
%
% Computational geometry community bibliography project
%   ftp://ftp.cs.usask.ca/pub/geometry/geombib.tar.gz
%
% July 2002 compilation
%

@article{-eera-57
, author =	"??"
, title =	"ERA. {An} electronic reading automaton"
, journal =	"Electronic Engineering"
, volume =	"??"
, month =	apr
, year =	1957
, pages =	"189--190"
, update =	"98.07 bibrelex"
}

@incollection{-akg-87
, title =	"Algorithmen in der kombinatorischen {Geometrie}"
, booktitle =	"Tagungsber. Math. Forschungsinst. Oberwolfach"
, number =	5
, year =	1987
, pages =	"1--14a"
, note =	"seminar abstracts"
, update =	"97.11 icking, 95.05 korneenko"
}

@manual{-arm-92
, title =	"AutoCAD Reference Manual"
, organization =	"Autodesk, Inc."
, year =	1992
, update =	"98.03 bibrelex"
}

@incollection{-dg-87
, title =	"Diskrete {Geometrie}"
, booktitle =	"Tagungsber. Math. Forschungsinst. Oberwolfach"
, number =	25
, year =	1987
, pages =	"1--18"
, note =	"seminar abstracts"
, update =	"97.11 icking, 95.05 korneenko"
}

@article{-fcp-91
, title =	"Fast convex polygons"
, journal =	"Doctor Dobbs J."
, volume =	16
, number =	3
, year =	1991
, pages =	"129--147"
, keywords =	"convex polygon, rendering, computer graphics, implementation"
, update =	"95.05 korneenko"
}

@techreport{-gchpc-92
, title =	"Grand challenges: {High} performance computing and communications"
, type =	"Report"
, institution =	"Committee in Physical, Mathematical, and Engineering Sciences. Federal Council for Science, Engineering, and Technology"
, year =	1992
, note =	"The FY 1992 U.S. Research and Development Program"
, update =	"99.03 bibrelex, 98.07 bibrelex, 98.03 bibrelex"
}

@manual{-isbfp-85
, title =	"IEEE Standard for binary floating point arithmetic, {ANSI}/{IEEE} Std $754-1985$"
, publisher =	"IEEE Computer Society"
, address =	"New York, NY"
, year =	1985
, note =	"Reprinted in SIGPLAN Notices, 22(2):9--25, 1987"
, update =	"99.11 devillers, 98.07 bibrelex"
, key =	"IEEE754"
}

@manual{-i6um-96
, title =	"IRIT $6.0$ User's Manual"
, organization =	"Technion"
, year =	1996
, url =	"http://www.cs.technion.ac.il/~irit"
, update =	"98.07 bibrelex"
}

@manual{-mrm-83
, title =	"{MACSYMA} Reference Manual"
, organization =	"Lab. Comput. Sci., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1983
, update =	"98.03 bibrelex"
}

@manual{-m4rm-85
, title =	"Maple $4.0$ Reference Manual"
, organization =	"Symbolic Computation Group, Univ. Waterloo"
, address =	"Waterloo, Canada"
, year =	1985
, update =	"98.03 bibrelex"
}

@manual{-mrg-92
, title =	"{MATLAB} Reference Guide"
, organization =	"The MathWorks, Inc."
, address =	"Natick, MA"
, year =	1992
, update =	"98.03 bibrelex"
}

@manual{-nwp-91
, title =	"NURBS White Paper"
, organization =	"Automotive Industry Action Group"
, address =	"Southfield, MI"
, year =	1991
, update =	"98.07 bibrelex"
}

@manual{-pltc-85
, title =	"POSTSCRIPT Language Tutorial and Cookbook"
, organization =	"Adobe Systems Incorporated"
, year =	1985
, update =	"98.03 bibrelex"
}

@manual{-rurcp-88
, title =	"Robface: {The} universal {Rob}-{Cad} programming interface"
, organization =	"Technomatics, N. V."
, year =	1988
, update =	"98.07 bibrelex"
}

@manual{-rpmv4-82
, title =	"Romulus Programmers Manual: Version 4"
, organization =	"Shape Data Ltd."
, address =	"Cambridge, UK"
, year =	1982
, update =	"97.11 bibrelex"
}

@article{-sicp-90
, title =	"Special issue: {Cutting} and packing"
, journal =	"European J. Oper. Res."
, volume =	44
, number =	2
, year =	1990
, pages =	"134--299"
, keywords =	"packing cutting"
, update =	"95.05 korneenko"
}

@article{-sill-84
, title =	"Special issue on legged locomotion"
, journal =	"Internat. J. Robot. Res."
, volume =	3
, number =	2
, year =	1984
, update =	"97.11 bibrelex"
}

@article{-sill-90
, title =	"Special issue on legged locomotion"
, journal =	"Internat. J. Robot. Res."
, volume =	9
, number =	2
, year =	1990
, update =	"97.11 bibrelex"
}

@misc{-sp-
, title =	"STEP on a page"
, url =	"http://www.nist.gov/sc5/soap/"
, update =	"98.07 bibrelex"
}

@manual{-sis-89
, title =	"Stereolithography interface specification"
, organization =	"3D Systems, Inc."
, address =	"Valencia, CA"
, year =	1989
, note =	"p/n 50065-S01-00"
, update =	"98.07 bibrelex"
}

@manual{-t1-78
, title =	"TIPS-1"
, organization =	"Inst. Precision Engg., Hokkaido Univ."
, address =	"Sapporo, Japan"
, year =	1978
, update =	"97.11 bibrelex"
}

@techreport{a-am3sa-91
, author =	"C. Aarmstrong"
, title =	"Abstraction and meshing of 3d stress analysis models"
, type =	"Progress Report"
, institution =	"SERC Directorate"
, address =	"UK"
, year =	1991
, update =	"98.11 bibrelex"
}

@article{a-srcg-74
, author =	"H. L. Abbott"
, title =	"Some results in combinatorial geometry"
, journal =	"Discrete Math."
, volume =	9
, year =	1974
, pages =	"199--204"
, update =	"97.11 bibrelex"
}

@inproceedings{a-bigj-91
, author =	"A. Abdullah"
, title =	"Bottleneck identification in general junctions"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"26--28"
, cites =	"ahu-dsa-83, aaghi-vdp-86, c-tsplt-90i, cw-oaimd-83, gm-osacv-87, ghlst-ltavs-87, h-ovgat-89, kkt-ptots-90i, l-prp-78, mz-lubgj-88, mt-fmvdb-83, ps-cgi-85, s-fmdbt-81, w-cvgnl-85, mz-rgj-89, p-orrc-81, ZZZ"
, update =	"01.04 icking, 98.07 bibrelex"
}

@incollection{aitt-pacvd-87
, author =	"T. Abe and K. Inoue and J. Takanami and H. Taniguchi"
, title =	"A parallel algorithm for the construction of {Voronoi} diagrams"
, booktitle =	"Meet. Techn. Group on Automata and Languages, IECE Japan"
, year =	1987
, keywords =	"Voronoi diagram, parallel computation"
, update =	"95.05 korneenko"
}

@article{am-castd-90
, author =	"D. J. Abel and D. M. Mark"
, title =	"A comparative analysis of some two-dimensional orderings"
, journal =	"Intl. J. Geographic Informations Systems"
, volume =	4
, year =	1990
, pages =	"21--31"
, update =	"97.07 agarwal"
}

@article{as-dsabl-83
, author =	"D. J. Abel and J. L. Smith"
, title =	"A data structure and algorithm based on linear key for a rectangle retrieval problem"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	24
, number =	1
, year =	1983
, pages =	"1--13"
, keywords =	"searching, rectangle retrieval, orthogon, data structuring"
, update =	"95.05 korneenko"
}

@inproceedings{a-dgpg-99
, author =	"Manuel Abellanas"
, title =	"{Delaunay} Graphs on a Prescribed Graph"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"101--103"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{aghhs-op-92
, author =	"M. Abellanas and J. Garc{\'\i}a and G. Hern{\'a}ndez and F. Hurtado and O. Serra"
, title =	"Onion polygonizations"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"127--131"
, cites =	"acns-cfs-82, c-clps-85, ds-ppsp-88, h-lbocf-87, h-rsr-72, mr-ulbnm-90, nm-ocfhc-80, obw-cdnh-87, ps-cgi-85, t-cm-88, t-nrcgr-86, ZZZ"
, update =	"98.07 bibrelex, 93.05 jones"
}

@article{aghhsu-up-93
, author =	"M. Abellanas and J. Garc{\'\i}a and G. Hern{\'a}ndez and F. Hurtado and O. Serra and J. Urrutia"
, title =	"Updating Polygonizations"
, journal =	"Comput. Graph. Forum"
, volume =	12
, number =	3
, year =	1993
, pages =	"143--152"
, update =	"98.11 bibrelex"
}

@inproceedings{agh-cg-94
, author =	"M. Abellanas and J. Garc{\'\i}a-L{\'o}pez and F. Hurtado"
, title =	"Consecutive Guards"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"393--398"
, cites =	"o-agta-87, c-ctpg-75, f-spcwt-78, s-rrag-92, ll-ccagp-86, h-ragp-90, hkk-agtph-91, jl-agtls-93, ZZZ"
, update =	"98.11 bibrelex, 97.11 icking, 94.09 jones"
}

@inproceedings{agrh-tsgs-94
, author =	"Manuel Abellanas and Francisco G{\'o}mez and Ferran Hurtado and Pedro Ramos"
, title =	"On the Tolerance of Some Geometric Structures"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"64--67"
, update =	"00.11 smid, 00.07 icking"
}

@techreport{aghr-stdt-
, author =	"M. Abellanas and F. G{\'o}mez and F. Hurtado and P. Ramos"
, title =	"Structural Tolerance and {Delaunay} Triangulation"
, type =	"Technical Report"
, number =	"MA2-IR-93-11"
, institution =	"Dept. Mat. Aplicada II, Univesitat Polit{\`e}cnica de Catalunya"
, update =	"98.11 bibrelex"
}

@techreport{ahknu-cpcs-95
, author =	"Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
, title =	"A Combinatorial Property of Convex Sets"
, number =	176
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1995
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr176.pdf"
, precedes =	"ahknu-cpcs-97"
, update =	"01.04 icking, 99.07 bibrelex, 98.11 bibrelex"
}

@article{ahknu-cpcs-97
, author =	"Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
, title =	"A Combinatorial Property of Convex Sets"
, journal =	"Discrete Comput. Geom."
, volume =	17
, number =	3
, year =	1997
, pages =	"307--318"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr176.pdf"
, succeeds =	"ahknu-cpcs-95"
, update =	"01.04 icking, 99.07 bibrelex, 98.11 bibrelex"
}

@techreport{ahknu-vdcfc-95t
, author =	"Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
, title =	"Voronoi-Diagrams and Containment of Families of Convex Sets on the Plane"
, number =	173
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1995
, precedes =	"ahknu-vdcfc-95"
, update =	"99.07 bibrelex, 98.11 bibrelex"
}

@inproceedings{ahknu-vdcfc-95
, author =	"Manuel Abellanas and G. Hernandez and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
, title =	"Voronoi Diagrams and Containment of Families of Convex Sets on the Plane"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"71--78"
, keywords =	"convex distance functions"
, succeeds =	"ahknu-vdcfc-95t"
, cites =	"bl-cppe-90, bssu-crapb-89, cd-vdbcd-85, ehs-cttpt-88, f-ioco-88, hrw-sercc-89, h-nccp-89, iklm-cdf3s-93, kmm-ricav-93a, l-cnp-94, l-artcn-94, nu-crpcp-88, ssu-congo-88, u-poeg-89, ZZZ"
, update =	"99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 95.09 mitchell"
}

@techreport{ahiklmps-scso-01t
, author =	"Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
, title =	"Smallest Color-Spanning Objects"
, number =	283
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	2001
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf"
, precedes =	"ahiklmps-scso-01"
, cites =	"aesw-emstb-91, aiks-fkpmd-91, dlss-sdakp-95, ddg-fsp-83, esz-cskec-94, ee-innfm-94, eorw-fmakg-92, es-blbda-95, go-copcg-95, gh-appcp-93, hks-uevsi-93, m-gofvc-94, m-ekpc-95, m-gspno-00, mnsw-cnnsq-00, ol-mcp-81, ps-cgi-85, sk-ekpsa-98, sa-dsstg-95, s-fkpse-92, ZZZ"
, update =	"01.07 icking, 01.04 icking"
}

@inproceedings{ahiklmps-scso-01
, author =	"Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
, title =	"Smallest Color-Spanning Objects"
, booktitle =	"Proc. 9th Annu. European Sympos. Algorithms"
, nickname =	"ESA 2001"
, series =	"Lecture Notes Comput. Sci."
, volume =	2161
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"278--289"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf"
, succeeds =	"ahiklmps-scso-01t"
, update =	"02.03 icking, 01.07 icking"
}

@inproceedings{ahiklmps-fcvdr-01
, author =	"Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
, title =	"The Farthest Color {Voronoi} Diagram and Related Problems"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"113--116"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ahiklmps-fcvdr-01.pdf"
, cites =	"aesw-emstb-91, aiks-fkpmd-91, ak-vd-00, dlss-sdakp-95, ddg-fsp-83, ee-innfm-94, go-copcg-95, gh-appcp-93, hks-uevsi-93, m-lpltw-84, m-gspno-00, mnsw-cnnsq-00, ol-mcp-81, ps-cgi-85, sa-dsstg-95, w-sedbe-91a, ZZZ"
, update =	"01.04 icking"
}

@inproceedings{ahr-tgs-94
, author =	"M. Abellanas and F. Hurtado and P. Ramos"
, title =	"Tolerance of Geometric Structures"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"250--255"
, cites =	"aghhsu-up-93, aghr-stdt-, a-sdcgp-85, abmmrss-tsp-93, gss-egbra-89, gss-cscah-93, l-cbagd, lm-cschu-90, ms-tgmst-91, r-tegc, cegs-ablsp-89, ms-rcibt-88, lmr-pvdcb-93, v-plcpt-, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{ahr-rgwgt-95
, author =	"M. Abellanas and F. Hurtado and P. A. Ramos"
, title =	"Redrawing a Graph within a Geometric Tolerance"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"246--253"
, keywords =	"graph drawing, Delaunay triangulation"
, update =	"95.01 tamassia"
}

@inproceedings{ar-vdisg-95
, author =	"Manuel Abellanas and Eugenio Roanes-Lozano"
, title =	"{Voronoi} Diagrams for Infinite Sets Generated by Consecutive Stretches"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"13--16"
, update =	"00.03 bibrelex"
}

@techreport{ae-vgspu-91
, author =	"J. Abello and {\"O}. E{\~g}ecio{\~g}lu"
, title =	"Visibility graphs of staircase polygons with uniform step length"
, type =	"Manuscript"
, institution =	"??"
, year =	1991
, precedes =	"ae-vgspu-93"
, update =	"98.07 bibrelex"
}

@article{ae-vgspu-93
, author =	"J. Abello and {\"O}. E{\~g}ecio{\~g}lu"
, title =	"Visibility graphs of staircase polygons with uniform step length"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"27--37"
, keywords =	"visibility graph, staircase polygon, orthogonal convex fan, uniform step length"
, succeeds =	"ae-vgspu-91"
, update =	"98.07 bibrelex, 96.09 devillers"
}

@techreport{aek-rvgsp-91
, author =	"J. Abello and {\"O}. E{\~g}ecio{\~g}lu and K. Kumar"
, title =	"Recognizing visibility graphs of staircase polygons"
, type =	"Manuscript"
, institution =	"??"
, year =	1991
, update =	"98.07 bibrelex"
}

@article{aesu-iopof-98
, author =	"James Abello and Vladimir Estivill-Castro and Thomas Shermer and Jorge Urrutia"
, title =	"Illumination of Orthogonal Polygons with Orthogonal Floodlights"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"25--38"
, succeeds =	"aesu-iof-95"
, update =	"98.11 devillers"
}

@inproceedings{aesu-iof-95
, author =	"James Abello and Vladimir Estivill-Castro and Thomas Shermer and Jorge Urrutia"
, title =	"Illumination with Orthogonal Floodlights"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"362--371"
, precedes =	"aesu-iopof-98"
, update =	"98.11 devillers, 98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@inproceedings{ak-vgom-95
, author =	"J. Abello and K. Kumar"
, title =	"Visibility Graphs and Oriented Matroids"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"147--158"
, keywords =	"graph drawing, visibility"
, update =	"95.01 tamassia"
}

@article{alp-vgsp-92
, author =	"J. Abello and H. Lin and S. Pisupati"
, title =	"On visibility graphs of simple polygons"
, journal =	"Congr. Numer."
, volume =	90
, year =	1992
, pages =	"119--128"
, update =	"98.11 bibrelex"
}

@book{ad-tg-80
, author =	"H. Abelson and A. A. diSessa"
, title =	"Turtle Geometry"
, publisher =	"MIT Press"
, address =	"Cambridge"
, year =	1980
, update =	"97.03 icking"
}

@book{a-ca-80
, author =	"O. Aberth"
, title =	"Computable analysis"
, publisher =	"McGraw-Hill"
, address =	"New York"
, year =	1980
, update =	"98.11 bibrelex"
}

@article{a-gph-88
, author =	"S. Abhyankar"
, title =	"Good Points of a Hypersurface"
, journal =	"Adv. Math."
, volume =	68
, number =	2
, year =	1988
, pages =	"87--256"
, update =	"97.11 bibrelex"
}

@article{a-hragr-76
, author =	"S. Abhyankar"
, title =	"Historical Ramblings in Algebraic Geometry and Related Algebra"
, journal =	"Amer. Math. Monthly"
, volume =	83
, number =	6
, year =	1976
, pages =	"409--448"
, update =	"98.03 bibrelex"
}

@article{ab-arpcs2-87
, author =	"S. Abhyankar and C. Bajaj"
, title =	"Automatic Rational Parameterization of Curves and Surfaces {II}: Cubics and Cubicoids"
, journal =	"Comput. Aided Design"
, volume =	19
, number =	2
, year =	1987
, pages =	"499--502"
, update =	"97.11 bibrelex"
}

@inproceedings{ab-cac-89
, author =	"S. Abhyankar and C. Bajaj"
, title =	"Computations with Algebraic Curves"
, booktitle =	"Proc. Internat. Sympos. on Symbolic and Algebraic Computation"
, series =	"Lecture Notes Comput. Sci."
, volume =	358
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"279--284"
, update =	"97.11 bibrelex"
}

@techreport{ab-arpcs3-86
, author =	"S. Abhyankar and C. Bajal"
, title =	"Automatic Rational Parameterization of Curves and Surfaces {III}: {Algebraic} Plane Curves"
, type =	"Technical {Report}"
, number =	"CSD-TR-619"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{a-asc-70
, author =	"S. S. Abhyankar"
, title =	"Algebraic space curves"
, journal =	"Montreal Lecture Notes"
, volume =	"??"
, year =	1970
, update =	"98.03 bibrelex"
}

@article{ab-arpcs-87
, author =	"S. S. Abhyankar and C. Bajaj"
, title =	"Automatic rational parameterization of curves and surfaces {I}: conics and conicoids"
, journal =	"Comput. Aided Design"
, volume =	19
, year =	1987
, pages =	"11--14"
, keywords =	"algebraic geometry, design of algorithms, computer graphics, CAD"
}

@inproceedings{ac-iiac-89
, author =	"S. S. Abhyankar and S. Chandrasekar"
, title =	"Improper intersection of algebraic curves"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	10
}

@inproceedings{acc-dcbia-89
, author =	"S. S. Abhyankar and S. Chandrasekar and V. Chandru"
, title =	"Degree complexity bounds on the intersection of algebraic curves"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"88--93"
, cites =	"a-asc-70, acc-iasc-88, acc-iiac-88, d-icds-86, g-mrtii-85, h-ac-85, as-tsbac-88, e-acg-87, cegsw-ccbac-88, sr-iag-49, ZZZ"
, update =	"98.03 bibrelex"
}

@techreport{acc-iiac-88
, author =	"S. S. Abhyankar and S. Chandrasekar and V. Chandru"
, title =	"Improper intersection of algebraic curves"
, number =	"CC-88-24"
, institution =	"Purdue University"
, month =	sep
, year =	1988
, update =	"98.03 bibrelex"
}

@techreport{acc-iasc-88
, author =	"S. S. Abhyankar and S. Chandrasekar and V. Chandru"
, title =	"Intersection of algebraic space curves"
, type =	"Technical {Report}"
, number =	"CC-88-13"
, institution =	"Dept. Math., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1988
, precedes =	"acc-iasc-91"
, update =	"95.05 korneenko"
}

@article{acc-iasc-91
, author =	"S. S. Abhyankar and S. Chandrasekar and V. Chandru"
, title =	"Intersection of algebraic space curves"
, journal =	"Discrete Appl. Math."
, volume =	31
, number =	2
, year =	1991
, pages =	"81--96"
, keywords =	"algebraic curves, intersection"
, succeeds =	"acc-iasc-88"
, update =	"95.05 korneenko"
}

@article{a-pthlh-86
, author =	"S. S. Abi-Ezzi"
, title =	"The priority tree: {A} hidden-line / hidden-surface approach to ``{PHIGS}''"
, journal =	"Comput. Graph. Forum"
, volume =	5
, number =	4
, year =	1986
, pages =	"283--289"
, keywords =	"hidden line/surface elimination, priority tree"
, update =	"95.05 korneenko"
}

@inproceedings{as-tcshv-91
, author =	"S. S. Abi-Ezzi and L. A. Shirman"
, title =	"Tessellation of Curved Surfaces under Highly Varying Transformations"
, editor =	"F. H. Post and W. Barth"
, booktitle =	"Proc. Eurographics '91"
, publisher =	"Elsevier Science"
, address =	"Vienna, Austria"
, month =	sep
, year =	1991
, pages =	"385--397"
, update =	"93.09 held"
}

@incollection{abbkw-pdb-87
, author =	"E. E. Abola and F. C. Bernstein and S. H. Bryant and T. F. Koetzle and J. Weng"
, title =	"Protein data bank"
, editor =	"F. H. Allen and G. Bergerhoff and R. Seivers"
, booktitle =	"Crystallographic Databases: Information Content, Software Systems, Scientific Applications"
, publisher =	"Data Comission of the International Union of Crystallography"
, address =	"Bonn/Cambridge/Chester"
, year =	1987
, update =	"98.03 bibrelex"
}

@article{a-mcp-90
, author =	"Karl Abrahamson"
, title =	"On the Modality of Convex Polygons"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"409--419"
, annote =	"Random convex polygon defined by hull of $n$ points
		 from (1) uniform on disc and (2) 2d normal
		 distribution. Expected modality shown to be
		 $\Theta(\log h/\log\log h)$, where $h$ is expected
		 number of hull vertices."
}

@article{adkp-sptca-89
, author =	"K. Abrahamson and N. Dadoun and D. G. Kirkpatrick and T. Przytycka"
, title =	"A Simple Parallel Tree Contraction Algorithm"
, journal =	"J. Algorithms"
, volume =	10
, year =	1989
, pages =	"287--302"
, update =	"96.09 orourke"
}

@inproceedings{a-cano-88
, author =	"S. Abramowski"
, title =	"Collision avoidance for nonrigid objects"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"168--179"
, keywords =	"motion planning"
, update =	"00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@incollection{alm-mrkgp-89
, author =	"S. Abramowski and B. Lang and H. M{\"u}ller"
, title =	"Moving regular $k$-gons in contact"
, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '88"
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"229--242"
, keywords =	"motion planning, contact, regular polygon"
, update =	"98.07 smid, 97.11 bibrelex, 95.05 korneenko"
}

@techreport{am-1dq3d-85
, author =	"S. Abramowski and H. M{\"u}ller"
, title =	"$1$-d queries in $3$-d space"
, type =	"Report"
, number =	"09/85"
, institution =	"Fakult{\"a}t Inform., Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1985
, update =	"97.11 bibrelex"
}

@article{am-cano-84
, author =	"S. Abramowski and H. M{\"u}ller"
, title =	"Collision Avoidance for Nonrigid Objects"
, journal =	"Oper. Res."
, volume =	32
, year =	1984
, pages =	"165--186"
, update =	"93.09 milone+mitchell"
}

@book{am-gm-91
, author =	"S. Abramowski and H. M{\"u}ller"
, title =	"{Geometrisches} {Modellieren}"
, publisher =	"BI-Wissenschaftsverlag"
, address =	"Mannheim"
, year =	1991
, update =	"97.03 icking"
}

@incollection{am-sccvl-87
, author =	"S. Abramowski and H. M{\"u}ller"
, title =	"Searching connected components in very large grid graphs"
, booktitle =	"Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '86"
, series =	"Lecture Notes Comput. Sci."
, volume =	246
, year =	1987
, pages =	"118--130"
, keywords =	"grid graph, motion planning, connected component"
, update =	"97.11 bibrelex, 95.05 korneenko"
}

@article{ag-ftfcf-02
, author =	"Aaron Abrams and Robert Shrist"
, title =	"Finding Topology in a Factory: {Configuration} Spaces"
, journal =	"Amer. Math. Monthly"
, volume =	109
, number =	2
, year =	2002
, pages =	"140--150"
, comments =	"Several robots"
, update =	"02.03 orourke"
}

@article{abcptwz-gmisp-95
, author =	"S. L. Abrams and L. Bardis and C. Chryssostomidis and N. M. Patrikalakis and S. T. Tuohy and F.-E. Wolter and J. Zhou"
, title =	"The Geometric Modeling and Interrogation System Praxiteles"
, journal =	"Journal of Ship Production"
, volume =	11
, number =	2
, year =	1995
, pages =	"116--131"
, update =	"95.05 abrams"
}

@article{a-zhadr-28
, author =	"W. Ackermann"
, title =	"Zum {Hilbertschen} {Aufbau} der reellen {Zahlen}"
, journal =	"Mathematical Annals"
, volume =	99
, year =	1928
, pages =	"118--133"
, keywords =	"Ackermann function"
, update =	"95.05 agarwal"
}

@article{ahs-itcp-89
, author =	"D. M. Acketa and V. Hauk and D. Surla"
, title =	"On the intersection of two convex polygons"
, journal =	"Informatica"
, volume =	13
, number =	4
, year =	1989
, pages =	"52--57"
, keywords =	"intersection, convex polygon"
, update =	"95.05 korneenko"
}

@article{vk-mnecd-82a
, author =	"D. M. Acketa and J. {\v Z}uni{\'c}"
, title =	"On the maximal number of edges of convex digital polygons included into a square grid"
, journal =	"Pocitace a umela inteligencia"
, volume =	1
, number =	6
, month =	dec
, year =	1982
, pages =	"549--558"
, update =	"98.07 bibrelex"
}

@inproceedings{az-mnecd-91
, author =	"D. M. Acketa and J. {\v Z}uni{\'c}"
, title =	"On the maximal number of edges of convex digital polygons included into a square grid"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"215--218"
, cites =	"bl-ndsls-88, hw-itn-68, vk-mnecd-82a, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{akss-icsac-97
, author =	"Bruno Adam and Pierre Kauffmann and Dominique Schmitt and Jean-Claude Spehner"
, title =	"An Increasing--Circle Sweep--Algorithm to Construct the {D}elaunay Diagram in the Plane"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"268--273"
, update =	"97.11 jones"
}

%, number =	4
@article{a-vlplc-96
, author =	"Andrew Adamatzky"
, title =	"Voronoi-Like Partition of a Lattice in Cellular Automata"
, journal =	"Mathematical and Computer Modelling"
, volume =	23
, year =	1996
, pages =	""
, keywords =	"image processing, Voronoi diagram, cellular automata"
, update =	"96.01 jones"
, abstract =	"In this paper, we discuss an automata model for parallel
approximation of the discrete Voronoi diagram. Given a subset of the $n$
labeled nodes of a two-dimensional lattice of $m \times m$ nodes, we wish to
construct a Voronoi cell for every given node, i.e., mark such nodes that form
Voronoi edges and vertices. Our technique is based in the wave generation in
the cellular automata lattice, their spreading and interactions.
The waves are generated in such sites that are corresponded to lattice
nodes of a given set (which should be separated). In the result of wave
interactions a stationary structure is produced --- it represents the
required elements of the discrete Voronoi diagram. We show how to construct
a Voronoi-like structure in two-dimensional cellular automata with $O(1)$ and
$O(n)$ cell states and 4 (in metric $L_1$) or 8 (in metric $L_8$) size of
cell neighborhood in $O(m)$ time."
}

@article{akv-gdssl-92
, author =	"R. Adamec and M. Klazar and P. Valtr"
, title =	"Generalized {Davenport}-{Schinzel} sequences with linear upper bound"
, journal =	"Discrete Math."
, volume =	108
, year =	1992
, pages =	"219--229"
, update =	"95.05 agarwal"
}

@article{aa-ntsrm-76
, author =	"M. Adamowich and A. Albano"
, title =	"Nesting twodimensional shapes in rectangular modules"
, journal =	"Comput. Aided Design"
, volume =	2
, number =	1
, year =	1976
, pages =	"27--33"
, keywords =	"packing"
, update =	"95.05 korneenko"
}

@article{as-mith3-91
, author =	"C. Adams and W. Sherman"
, title =	"Minimum ideal triangulations of hyperbolic $3$-manifolds"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"135--153"
}

@book{a-kb-94
, author =	"C. C. Adams"
, title =	"The Knot Book"
, publisher =	"W. H. Freeman"
, address =	"New York"
, year =	1994
, update =	"98.07 orourke, 97.11 bibrelex"
}

@article{ab-cdcg-86
, author =	"J. A. Adams and L. M. Billow"
, title =	"Combining descriptive and computational geometry"
, journal =	"CIME"
, volume =	4
, number =	6
, year =	1986
, pages =	"69--76"
, keywords =	"descriptive geometry, three-dimensional"
, update =	"95.05 korneenko"
}

@inproceedings{agj-lcsr-00
, author =	"Udo Adamy and Joachim Giesen and Matthias John"
, title =	"The {$\lambda$}-Complex and Surface Reconstruction"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"14--17"
, update =	"00.03 bibrelex"
}

@inproceedings{as-ewcqc-98
, author =	"Udo Adamy and Raimund Seidel"
, title =	"On the Exact Worst Case Query Complexity of Planar Point Location"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"609--618"
, update =	"99.07 bibrelex, 98.07 mitchell"
}

@article{aos-mlcps-94
, author =	"John Adegeest and Mark Overmars and Jack Snoeyink"
, title =	"Minimum-link $C$-oriented paths: {Single}-source queries"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, number =	1
, year =	1994
, pages =	"39--51"
, keywords =	"shortest path, link distance, rectilinear link distance"
, update =	"98.03 mitchell, 96.09 devillers, 96.05 mitchell"
, annote =	"They consider a set of obstacles given by $n$ line
                  segments having disjoint interiors, and being at $c$
                  different fixed orientations.  For a fixed source
                  point, they build a data structure (SPM) of size
                  $O(cn)$ that supports min-link queries from the
                  source to any query point in time $O(c\log n)$ (with
                  additional time $O(k)$ to report a path, if it has
                  $k$ links).  Here, link distance is $C$-oriented
                  link distance.  The preprocessing is done with
                  $O(c^2 n\log n)$ time and space, OR with $O(c^2 n
                  \log^2 n)$ time and $O(c^2 n)$ space."
}

@phdthesis{a-ap-71
, author =	"I. Adler"
, title =	"Abstract Polytopes"
, school =	"Dept. Operations Research, Stanford University"
, year =	1971
, keywords =	"doctoral thesis"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{ab-palpa-92
, author =	"I. Adler and P. A. Beling"
, title =	"Polynomial algorithms for linear programming over the algebraic numbers"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"483--494"
}

@article{ad-mdap-74
, author =	"I. Adler and G. B. Dantzig"
, title =	"Maximum diameter of abstract polytopes"
, journal =	"Math. Programming Studies"
, volume =	1
, year =	1974
, pages =	"20--40"
, update =	"97.03 gaertner+salinger"
}

@article{adm-eaaap-74
, author =	"I. Adler and G. B. Dantzig and K. Murty"
, title =	"Existence of A-avoiding a-paths in abstract polytopes"
, journal =	"Math. Programming Studies"
, volume =	1
, year =	1974
, pages =	"41--42"
, update =	"97.03 gaertner+salinger"
}

@techreport{aks-svsml-83
, author =	"I. Adler and R. Karp and R. Shamir"
, title =	"A simplex variant solving an $m \times d$ linear program in {$O(\min(m^{2},d^{2}))$} expected number of pivot steps"
, type =	"Report"
, number =	"UCB/CSD 83/158"
, institution =	"Comput. Sci. Div., Univ. California"
, address =	"Berkeley, CA"
, year =	1983
}

@inproceedings{am-sawan-84
, author =	"I. Adler and N. Megiddo"
, title =	"A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"312--323"
, precedes =	"am-sawan-85"
}

@article{am-sawan-85
, author =	"I. Adler and N. Megiddo"
, title =	"A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension"
, journal =	"J. ACM"
, volume =	32
, year =	1985
, pages =	"871--895"
, keywords =	"average-case analysis, linear programming"
, succeeds =	"am-sawan-84"
}

@article{amt-nrbsa-84
, author =	"I. Adler and N. Megiddo and M. J. Todd"
, title =	"New results on the behavior of simplex algorithms"
, journal =	"Bull. Amer. Math. Soc."
, volume =	11
, year =	1984
, pages =	"378--382"
, keywords =	"average-case analysis, linear programming"
}

@article{as-lmpap-76
, author =	"I. Adler and R. Saigal"
, title =	"Long monotone paths in abstract polytopes"
, journal =	"Math. Oper. Res."
, volume =	1
, number =	1
, year =	1976
, pages =	"89--95"
, update =	"97.03 gaertner+salinger"
}

@techreport{as-rssua-90
, author =	"I. Adler and R. Shamir"
, title =	"A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio"
, type =	"Technical {Report}"
, number =	"21-90"
, institution =	"Rutgers Univ."
, address =	"New Brunswick, NJ"
, month =	may
, year =	1990
, update =	"98.03 bibrelex"
}

@article{as-rssua-93
, author =	"I. Adler and R. Shamir"
, title =	"A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio"
, journal =	"Math. Prog."
, volume =	61
, year =	1993
, pages =	"39--52"
, update =	"97.03 clarkson"
}

@inproceedings{abk-pslb-95
, author =	"M. Adler and J. W. Byers and R. M. Karp"
, title =	"Parallel sorting with limited bandwidth"
, booktitle =	"Proc. 7th ACM Sympos. Parallel Algorithms Architect."
, year =	1995
, pages =	"129--136"
, update =	"96.09 orourke"
}

@article{as-rprs-92
, author =	"F. Affentranger and R. Schneider"
, title =	"Random projections of regular simplices"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"219--226"
}

@article{aw-churp-91
, author =	"F. Affentranger and J. A. Wieacker"
, title =	"On the convex hull of uniform random points in a simple $d$-polytope"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"291--305"
}

@inproceedings{asw-emstb-90
, author =	"Pankaj Agarwal and Otfried Schwarzkopf and Emo Welzl"
, title =	"Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	3
, precedes =	"aesw-emstb-90"
, update =	"01.04 icking, 00.03 bibrelex"
}

@inproceedings{a-dapal-89
, author =	"Pankaj K. Agarwal"
, title =	"A deterministic algorithm for partitioning arrangements of lines and its applications"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"11--22"
, cites =	"a-pal1e-90, a-pal2a-90, a-rsoas-89, as-rbida-88, aks-scps-83, aegs-ibcmf-89, c-rcsi-86, c-prsig-87, c-tbsns-88, ce-oails-88, cf-dvrsi-88, cw-rsvdc-88, c-sdsno-84, c-narsc-87, c-arscg-88, cegsw-ccbac-88, cs-adpch-88, ctv-flvat-88i, csss-oss-88, e-acg-87, eghsssw-irals-89, egs-cmfal-88, egs-oplms-86, eos-calha-86, ew-cbtda-86, gos-ilsrs-88, hw-ensrq-86, ms-rcibt-88, m-cen-89, m-splcn-91, m-apcad-83, m-fppa1-88, ps-cgi-85, st-pplup-86, st-epdg-83, w-mksfs-86, w-pttco-88, w-enh-88, ZZZ"
, update =	"98.03 bibrelex, 96.05 agarwal"
}

@inproceedings{a-anspt-91
, author =	"Pankaj K. Agarwal"
, title =	"Applications of a new space partition technique"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, nickname =	"WADS '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, year =	1991
, pages =	"379--392"
, keywords =	"$d$-dimensional, ray tracing, hidden line/surface elimination, minimal spanning tree, space partition"
, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 agarwal, 95.09 agarwal, 95.05 korneenko"
}

@mastersthesis{a-ga-85
, author =	"Pankaj K. Agarwal"
, title =	"Geometric algorithms"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Comput. Sci., Univ. California"
, address =	"Santa Barbara, CA"
, year =	1985
, note =	"Report TRCS 85-17"
, keywords =	"master thesis"
, update =	"96.05 agarwal, 93.05 jones"
}

@techreport{a-gpia-91t
, author =	"Pankaj K. Agarwal"
, title =	"Geometric partitioning and its applications"
, type =	"Report"
, number =	"CS-1991-27"
, institution =	"Dept. Comput. Sci., Duke Univ."
, address =	"Durham, NC"
, year =	1991
, keywords =	"random sampling, partition, arrangement, point location"
, precedes =	"a-gpia-91i"
, update =	"98.11 bibrelex, 96.05 agarwal, 94.01 smid"
}

@incollection{a-gpia-91i
, author =	"Pankaj K. Agarwal"
, title =	"Geometric partitioning and its applications"
, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
, booktitle =	"Computational Geometry: Papers from the DIMACS Special Year"
, publisher =	"American Mathematical Society"
, year =	1991
, keywords =	"random sampling, partition, arrangement, point location"
, comments =	"survey paper --- cuttings, range search"
, succeeds =	"a-gpia-91t"
, update =	"98.11 bibrelex, 98.07 agarwal, 96.05 agarwal, 93.09 matousek"
}

@phdthesis{a-idaac-89
, author =	"Pankaj K. Agarwal"
, title =	"Intersection and decomposition algorithms for arrangements of curves in the plane"
, school =	"Dept. Comput. Sci., New York Univ."
, month =	aug
, year =	1989
, keywords =	"doctoral thesis"
, update =	"98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
}

@book{a-idapa-91
, author =	"Pankaj K. Agarwal"
, title =	"Intersection and decomposition algorithms for planar arrangements"
, publisher =	"Cambridge University Press"
, address =	"New York, NY"
, year =	1991
, keywords =	"arrangement, partition, Davenport-Schinzel sequences"
, update =	"96.05 agarwal"
}

@techreport{a-slp3d-93
, author =	"Pankaj K. Agarwal"
, title =	"On stabbing lines for polyhedra in $3$d"
, type =	"Technical Report"
, number =	"CS-1993-09"
, institution =	"Department Computer Science, Duke University"
, year =	1993
, update =	"96.05 agarwal, 94.01 matousek"
}

@article{a-slp3d-94
, author =	"P. K. Agarwal"
, title =	"On stabbing lines for polyhedra in $3$d"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"177--189"
, update =	"96.09 devillers, 96.05 agarwal"
}

@article{a-pal1e-90
, author =	"Pankaj K. Agarwal"
, title =	"Partitioning arrangements of lines: {I}. {An} efficient deterministic algorithm"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"449--483"
, keywords =	"deterministic partitioning, random sampling, arrangements of lines"
, update =	"96.05 agarwal"
}

@article{a-pal2a-90
, author =	"Pankaj K. Agarwal"
, title =	"Partitioning arrangements of lines: {II}. {Applications}"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"533--573"
, keywords =	"random sampling, arrangements, divide-and-conquer"
, update =	"96.05 agarwal"
}

@techreport{a-rs-96
, author =	"Pankaj K. Agarwal"
, title =	"Range searching"
, type =	"Report"
, number =	"CS-1996-05"
, institution =	"Dept. Comput. Sci., Duke Univ."
, address =	"Durham, NC"
, year =	1996
, update =	"96.09 agarwal"
}

@incollection{a-rs-97
, author =	"Pankaj K. Agarwal"
, title =	"Range searching"
, chapter =	31
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"575--598"
, update =	"98.07 agarwal, 98.03 mitchell, 97.11 orourke"
}

@inproceedings{a-rsoas-89
, author =	"Pankaj K. Agarwal"
, title =	"Ray shooting and other applications of spanning trees with low stabbing number"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"315--325"
, precedes =	"a-rsoas-92"
, cites =	"a-dapal-89, a-pal1e-90, a-pal2a-90, a-rsoas-92, cw-rsvdc-88, c-tbsns-88, c-prsig-87, cg-vippg-85, cg-fc1ds-86, cg-fc2a-86, c-narsc-87, cegsw-ccbac-88, c-sssl-86, d-qbhle-86, de-ssio-87, dsst-mdsp-89, eg-tsa-89, egppss-acptc-88, eghsssw-irals-88, egs-cmfal-88, egs-oplms-86, eos-calha-86, ew-hrsls-86, ghlst-ltavs-87, gos-ilsrs-88t, gss-gmppt-88, gy-tsr-83, hw-ensrq-87, k-osps-83, m-wcohs-87, m-cen-89, m-splcn-91, pss-stsps-88, so-wcoac-86, st-pplup-86, w-pttco-88, ZZZ"
, update =	"98.03 bibrelex, 96.05 agarwal, 95.05 korneenko"
}

@article{a-rsoas-92
, author =	"Pankaj K. Agarwal"
, title =	"Ray shooting and other applications of spanning trees with low stabbing number"
, journal =	"SIAM J. Comput."
, volume =	21
, year =	1992
, pages =	"540--570"
, keywords =	"ray shooting, visibility, spanning trees, partition trees"
, succeeds =	"a-rsoas-89"
, update =	"96.05 agarwal, 95.05 korneenko"
}

% yes, "farthest"
@inproceedings{aaakss-cefns-89
, author =	"Pankaj K. Agarwal and A. Aggarwal and B. Aronov and S. R. Kosaraju and B. Schieber and Subhash Suri"
, title =	"Computing external-farthest neighbors for a simple polygon"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	45
, keywords =	"furthest neighbors, geodesic distance, simple polygon, diameter"
, precedes =	"aaakss-cefns-91"
, update =	"98.03 mitchell, 96.05 agarwal"
}

% yes, "farthest"
@article{aaakss-cefns-91
, author =	"Pankaj K. Agarwal and A. Aggarwal and B. Aronov and S. R. Kosaraju and B. Schieber and Subhash Suri"
, title =	"Computing external farthest neighbors for a simple polygon"
, journal =	"Discrete Appl. Math."
, volume =	31
, number =	2
, year =	1991
, pages =	"97--111"
, keywords =	"furthest neighbors, geodesic distance, simple polygon, diameter"
, succeeds =	"aaakss-cefns-89"
, update =	"98.03 mitchell, 96.05 agarwal"
}

@inproceedings{aaas-cvgbr-93
, author =	"Pankaj K. Agarwal and N. Alon and B. Aronov and Subhash Suri"
, title =	"Can visibility graphs be represented compactly?"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"338--347"
, cites =	"ast-apsgo-94, as-pm-92, as-cldsp-90, c-tpca-82, c-lbors2-90, c-lbcpr-89, cegs-ablsp-94, cg-vippg-89, cr-ccpso-91, et-psant-41, f-lbcor-81, gm-osacv-91, hw-itn-79, ks-pgt-67, s-tfpgs-38, t-cgcbs-84, w-cvgnl-85, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex+mitchell, 96.05 agarwal, 93.09 jones"
}

@article{aaas-cvgbr-94
, author =	"Pankaj K. Agarwal and N. Alon and B. Aronov and Subhash Suri"
, title =	"Can visibility graphs be represented compactly?"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"347--365"
, update =	"98.03 mitchell, 96.05 agarwal, 95.01 smid"
}

@inproceedings{aaas-lpmpc-97
, author =	"Pankaj K. Agarwal and Nina Amenta and Boris Aronov and Micha Sharir"
, title =	"Largest placements and motion planning of a convex polygon"
, editor =	"Jean-Paul Laumond and Mark Overmars"
, booktitle =	"Algorithms for Robotic Motion and Manipulation"
, nickname =	"WAFR '96"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1997
, pages =	"143--154"
, precedes =	"aas-mpcpp-97"
, update =	"01.04 icking, 98.11 bibrelex, 98.07 agarwal, 97.11 aronov"
, annote =	"Proc. 1996 Workshop on the Algorithmic Foundations of Robotics"
}

@article{aas-lpocp-98
, author =	"Pankaj K. Agarwal and Nina Amenta and Micha Sharir"
, title =	"Largest Placement of One Convex Polygon Inside Another"
, journal =	"Discrete Comput. Geom."
, succeeds =	"aas-mpcpp-97"
, update =	"01.04 icking, 98.11 bibrelex, 97.11 bibrelex"
}

@techreport{aas-pocpi-95
, author =	"P. K. Agarwal and N. Amenta and Micha Sharir"
, title =	"Placement of one convex polygon inside another"
, type =	"Tech. {Report}"
, number =	"CS-1995-29"
, institution =	"Duke University"
, year =	1995
, keywords =	"collision detection, motion planning"
, update =	"98.03 mitchell, 96.05 agarwal"
}

@article{aas-pocpi-98
, author =	"P. K. Agarwal and N. Amenta and M. Sharir"
, title =	"Placement of one convex polygon inside another"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"95--104"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@inproceedings{aabv-iedpl-99
, author =	"Pankaj K. Agarwal and Lars Arge and G. Brodal and Jeffrey S. Vitter"
, title =	"I/O-efficient dynamic point location in monotone subdivisions"
, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1999
, pages =	"11--20"
, update =	"99.03 agarwal"
}

@inproceedings{aae-imp-00
, author =	"P. K. Agarwal and L. Arge and J. Erickson"
, title =	"Indexing moving points"
, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
, year =	2000
, note =	"175--186"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{aaefv-eslc-98
, author =	"P. K. Agarwal and L. Arge and J. Erickson and P. G. Franciosa and J. S. Vitter"
, title =	"Efficient Searching with Linear Constraints"
, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
, year =	1998
, note =	"to appear"
, update =	"98.03 agarwal"
}

@inproceedings{aamvv-ieacl-98
, author =	"Pankaj K. Agarwal and Lars Arge and T. M. Murali and Kasturi R. Varadarajan and Jeffrey S. Vitter"
, title =	"{I/O}-Efficient Algorithms for Contour-Line Extraction and Planar Graph Blocking"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"117--126"
, update =	"99.07 bibrelex, 98.07 mitchell"
}

@techreport{aa-cfi-89
, author =	"Pankaj K. Agarwal and B. Aronov"
, title =	"Counting facets and incidences"
, type =	"Report"
, number =	"90-38"
, institution =	"DIMACS, Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1989
, keywords =	"combinatorial geometry, combinatorial complexity, hyperplane arrangements, triangle arrangements"
, precedes =	"aa-cfi-92"
, update =	"96.05 agarwal"
}

@article{aa-cfi-92
, author =	"Pankaj K. Agarwal and B. Aronov"
, title =	"Counting facets and incidences"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"359--369"
, keywords =	"combinatorial geometry, combinatorial complexity, hyperplane arrangements, triangle arrangements"
, succeeds =	"aa-cfi-89"
, update =	"96.05 agarwal"
}

@article{aacs-lalsp-98
, author =	"P. K. Agarwal and B. Aronov and T. M. Chan and M. Sharir"
, title =	"On Levels in Arrangements of Lines, Segments, Planes, and Triangles"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"315--331"
, update =	"98.07 agarwal+smid, 98.03 agarwal"
}

@inproceedings{aahs-aeamw-99
, author =	"Pankaj K. Agarwal and Boris Aronov and Sariel Har-Peled and Micha Sharir"
, title =	"Approximation and Exact Algorithms for Minimum-Width Annuli and Shells"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"380--389"
, update =	"99.07 devillers"
}

@inproceedings{aaos-supa-90
, author =	"Pankaj K. Agarwal and B. Aronov and J. O'Rourke and C. Schevon"
, title =	"Star unfolding of a polytope with applications"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"251--263"
, keywords =	"motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
, precedes =	"aaos-supa-93"
, update =	"98.03 orourke, 96.05 agarwal"
}

@techreport{aaos-supa-93
, author =	"Pankaj K. Agarwal and B. Aronov and J. O'Rourke and C. Schevon"
, title =	"Star unfolding of a polytope with applications"
, type =	"Technical {Report}"
, number =	031
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	jul
, year =	1993
, keywords =	"motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
, succeeds =	"aaos-supa-90"
, precedes =	"aaos-supa-97"
, update =	"98.03 orourke, 96.05 agarwal, 95.01 smid, 94.01 orourke"
}

% number = 6
% month = dec
@article{aaos-supa-97
, author =	"Pankaj K. Agarwal and Boris Aronov and Joseph O'Rourke and Catherine A. Schevon"
, title =	"Star Unfolding of a Polytope with Applications"
, journal =	"SIAM J. Comput."
, volume =	26
, year =	1997
, pages =	"1689--1713"
, keywords =	"motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
, succeeds =	"aaos-supa-93"
, update =	"98.03 smid, 97.11 agarwal+orourke, 97.03 agarwal+orourke, 96.05 orourke"
}

@techreport{aapps-qpghl-95
, author =	"Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
, title =	"Quasi-planar graphs have a linear number of edges"
, type =	"Report"
, number =	"CS-1995-30"
, institution =	"Dept. Comput. Sci., Duke Univ."
, address =	"Durham, NC"
, year =	1996
, precedes =	"aapps-qpghl-96"
, update =	"98.11 bibrelex, 96.09 agarwal"
}

@inproceedings{aapps-qpghl-96
, author =	"Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
, title =	"Quasi-planar graphs have a linear number of edges"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"1--7"
, succeeds =	"aapps-qpghl-95"
, precedes =	"aapps-qpghl-97"
, update =	"98.11 bibrelex, 97.11 aronov"
}

@article{aapps-qpghl-97
, author =	"Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
, title =	"Quasi-planar graphs have a linear number of edges"
, journal =	"Combinatorica"
, volume =	17
, year =	1997
, pages =	"1--9"
, succeeds =	"aapps-qpghl-96"
, update =	"97.11 aronov"
}

@inproceedings{aas-cefda-94
, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
, title =	"Computing Envelopes in Four Dimensions with Applications"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"348--358"
, precedes =	"aas-cefda-97"
, cites =	"am-rsps-93, am-rsss-92, ass-oleia-93, ast-apsgo-94, agps-rss-92, as-nvpt-93, as-tsbac-90, bdsty-arsol-92, bd-olrcu-93, cegs-ablsp-94, cegs-dwclp-93, cegss-cfals-93, cs-agpli-90, cksw-vdl3s-, cs-arscg-89, bds-lric-94, efnn-rauvd-89, es-vda-86, hs-nblet-93, hw-ensrq-87, ht-cws-85, m-apcad-83, ms-rsast-93, m-fppa-90, m-fppa2-91, pt-eplcs-92, hrr-araga-91, s-atubl-93, sa-dsstg-95, ZZZ"
, update =	"98.03 bibrelex, 97.11 aronov, 96.05 agarwal, 94.09 jones, 94.01 jones"
}

% number = 6
% month = dec
@article{aas-cefda-97
, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
, title =	"Computing Envelopes in Four Dimensions with Applications"
, journal =	"SIAM J. Comput."
, volume =	26
, year =	1997
, pages =	"1714--1732"
, succeeds =	"aas-cefda-94"
, update =	"98.03 bibrelex, 97.11 aronov, 97.03 agarwal+orourke, 96.05 orourke"
}

@inproceedings{aas-eaamw-00
, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
, title =	"Exact and approximation algorithms for minimum-width cylindrical shells"
, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA"
, year =	2000
, pages =	"510--517"
, update =	"00.03 agarwal+devillers"
}

@article{aas-eaamw-01
, author =	"P. K. Agarwal and B. Aronov and M. Sharir"
, title =	"Exact and approximation algorithms for minimum-width cylindrical shells"
, journal =	"Discrete Comput. Geom."
, volume =	26
, year =	2001
, pages =	"307--320"
, update =	"01.11 smid"
}

@inproceedings{aas-ltbse-97
, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
, title =	"Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"483--492"
, precedes =	"aas-ltbse-99"
, update =	"01.11 devillers+smid, 97.07 aronov, 97.03 agarwal+held, 96.09 agarwal, 96.05 agarwal"
}

@article{aas-ltbse-99
, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
, title =	"Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	21
, year =	1999
, pages =	"373--388"
, succeeds =	"aas-ltbse-97"
, update =	"01.11 devillers"
}

@techreport{aas-mpcpp-97
, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
, title =	"Motion planning for a convex polygon in a polygonal environment"
, type =	"Tech. Report"
, number =	"CS-1997-17"
, institution =	"Department of Computer Science"
, address =	"Duke University"
, year =	1997
, succeeds =	"aaas-lpmpc-97"
, precedes =	"aas-lpocp-98"
, update =	"01.04 icking, 98.11 bibrelex, 98.03 agarwal"
, annote =	"Corrects and supercedes parts of \cite{aaas-lpmpc-97}"
}

@article{aas-mpcpp-99
, author =	"P. K. Agarwal and B. Aronov and M. Sharir"
, title =	"Motion planning for a convex polygon in a polygonal environment"
, journal =	"Discrete Comput. Geom."
, volume =	22
, year =	1999
, pages =	"201--221"
, update =	"01.11 smid, 98.11 aronov"
}

@inproceedings{aass-sdp-90
, author =	"Pankaj K. Agarwal and B. Aronov and Micha Sharir and Subhash Suri"
, title =	"Selecting distances in the plane"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"321--331"
, keywords =	"selection problems, parametric search"
, precedes =	"aass-sdp-93"
, cites =	"bo-arcgi-79, bfprt-tbs-73, c-ntcos-85, cl-cpp-86, cegsw-ccbac-90, cs-arscg-89, c-sdsno-87, cv-dctao-86, e-acg-87, egppss-acptc-88, egs-oplms-86, lf-ppc-80, hs-ndssg-86, m-cha-90i, m-apcad-83, m-ptlp-85, ps-cgi-85, s-spcg-87, spp-fm-76, sv-fmmsp-81, tv-epba-85, tv-opatc-89t, v-pcp-75, v-spcs-83, y-cmstk-82, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 agarwal, 95.05 smid"
}

@article{aass-sdp-93
, author =	"Pankaj K. Agarwal and B. Aronov and Micha Sharir and Subhash Suri"
, title =	"Selecting distances in the plane"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"495--514"
, succeeds =	"aass-sdp-90"
, update =	"98.03 mitchell, 96.05 agarwal, 94.01 matousek"
}

@inproceedings{aas-stl3d-95
, author =	"Pankaj K. Agarwal and Boris Aronov and Subhash Suri"
, title =	"Stabbing Triangulations by Lines in $3$D"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, publisher =	"ACM Press"
, address =	"New York, NY, USA"
, month =	jun
, year =	1995
, pages =	"267--276"
, issn =	"0-89791-724-3"
, keywords =	"ray shooting, contrained triangulation, tetrahedra"
, cites =	"am-stl3s-95, as-tsbac-90, be-mgot-92i, b-ct-93, c-cpplb-84, ceg-ccc-89, cp-tncp-90, cs-bst-94, cw-qorss-89, dk-fdpi-82, dk-ladsc-85, e-t-91, hs-parss-95, m-ept-92, mms-qsrs-94, o-agta-87, rs-dt3dn-89, w-stlcn-92t, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{abghz-dfstk-00
, author =	"Pankaj K. Agarwal and J. Basch and L. J. Guibas and J. Hershberger and L. Zhang"
, title =	"Deformable free space tiling for kinetic collision detection"
, booktitle =	"Proc. 4th Workshop Algorithmic Found. Robot."
, year =	2000
, note =	"To appear"
, update =	"00.03 agarwal"
}

@inproceedings{abhs-egkda-96
, author =	"P. K. Agarwal and M. de Berg and D. Halperin and Micha Sharir"
, title =	"Efficient generation of {$k$}-directional assembly sequences"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"122--131"
, keywords =	"depth order, translational motion, rotational motion, assembly planning, stack products, upper envelope searching, maximality"
, update =	"98.03 mitchell, 96.09 agarwal+orourke, 96.01 mitchell"
}

@inproceedings{abms-claho-94
, author =	"Pankaj K. Agarwal and M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Constructing Levels in Arrangements and Higher Order {Voronoi} Diagrams"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"67--75"
, cites =	"as-solri-92, as-pm-92, ass-sulbl-89, bdt-schov-93, ce-iacko-87, c-narsc-87, c-racpq-88, cs-arscg-89, csy-khrp-87, bds-lric-94, e-acg-87, erk-oalla-93, hw-ensrq-87, m-fppa2-91, m-lavd-91, m-cgitr-93, pss-ubnpk-92, s-ksacs-91, ZZZ"
, update =	"98.11 bibrelex, 98.03 agarwal+bibrelex, 96.09 agarwal, 96.05 agarwal, 95.09 agarwal, 94.09 jones, 94.05 schwarzkopf, 94.01 jones"
}

@article{abms-claho-98
, author =	"P. K. Agarwal and M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Constructing Levels in Arrangements and Higher Order {Voronoi} Diagrams"
, journal =	"SIAM J. Comput."
, volume =	27
, year =	1998
, pages =	"654--667"
, update =	"98.07 smid, 98.03 agarwal"
}

@inproceedings{abs-osaup-99
, author =	"Pankaj K. Agarwal and Binay K. Bhattacharya and Sandeep Sen"
, title =	"Output-Sensitive Algorithms for Uniform Partitions of Points"
, booktitle =	"Proc. 10th Intl. Sympos. Algorithms and Computation"
, year =	1999
, pages =	"??"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{ablrsw-ccspc-98
, author =	"Pankaj K. Agarwal and Therese Biedl and Sylvain Lazard and Steve Robbins and Subhash Suri and Sue Whitesides"
, title =	"Curvature-Constrained Shortest Paths in a Convex Polygon"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"to appear"
, 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"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"139--147"
, update =	"01.04 smid, 97.03 agarwal, 96.09 agarwal"
}

@inproceedings{ad-aalm-00
, author =	"Pankaj K. Agarwal and P. K. Desikan"
, title =	"Approximation algorithms for layered manufacturing"
, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
, year =	2000
, pages =	"528--537"
, update =	"00.03 agarwal"
}

@inproceedings{aesw-emstb-90
, author =	"Pankaj K. Agarwal and H. Edelsbrunner and O. Schwarzkopf and Emo Welzl"
, title =	"Euclidean minimum spanning trees and bichromatic closest pairs"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"203--210"
, succeeds =	"asw-emstb-90"
, precedes =	"aesw-emstb-91"
, cites =	"c-fetaa-84, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-oplms-86, es-hipac-90, gbt-srtgp-84, ps-cgi-85, pt-espl-89, s-chaop-81, st-pplup-86, s-lpchm-90, sh-cpp-75, v-famst-84, y-cmstk-82, ZZZ"
, update =	"01.04 icking, 98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
}

@article{aesw-emstb-91
, author =	"Pankaj K. Agarwal and H. Edelsbrunner and O. Schwarzkopf and Emo Welzl"
, title =	"Euclidean minimum spanning trees and bichromatic closest pairs"
, journal =	"Discrete Comput. Geom."
, volume =	6
, number =	5
, year =	1991
, pages =	"407--422"
, keywords =	"proximity, minimum spanning trees, random sampling, geometric graphs, Voronoi diagrams, three-dimensional, closest pairs, red-blue"
, succeeds =	"aesw-emstb-90"
, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 93.05 schwarzkopf"
}

@inproceedings{aes-vdsl3-95
, author =	"Pankaj K. Agarwal and Alon Efrat and Micha Sharir"
, title =	"Vertical Decomposition of Shallow Levels in $3$-Dimensional Arrangements and Its Applications"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"39--50"
, keywords =	"curved surfaces, range searching, nearest neighbor, segment center, bipartite matching, smallest stabbing disk, parametric search, convex distance functions"
, cites =	"abms-claho-94, aest-cscpp-93, am-dhsrr-95, am-rsps-93, am-rsss-94, ass-oletd-95, ass-sulbl-89, abkks-emcmu-92, bcm-prsss-93, by-lotmc-94, cegs-sessr-89, c-narsc-87, cs-arscg-89, bgh-vdt3s-94, e-acg-87, es-vda-86, es-nlaps-96, e-demst-95, g-pvc-56, hs-nblet-94, hs-ndssg-86, hw-ensrq-87, ily-sccp-92, ls-pptmc-87, k-hmap-55, l-conm-76, l-tdvdl-80, ld-gvdp-81, ms-fmapp-91, m-aogdc-91, m-rph-92, ms-rscp-93, m-apcad-83, m-cgitr-93, s-atubl-94, sa-dsstg-95, t-mnlcf-92, v-ghm-89, v-pcp-75, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{aes-vdsl3-99
, author =	"P. K. Agarwal and A. Efrat and M. Sharir"
, title =	"Vertical decomposition of shallow levels in $3$-dimensional arrangements and its applications"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	1999
, pages =	"912--953"
, update =	"00.11 smid, 00.07 smid"
}

@techreport{aest-cscpp-91
, author =	"P. K. Agarwal and A. Efrat and Micha Sharir and S. Toledo"
, title =	"Computing a segment center for a planar point set"
, type =	"Manuscript"
, number =	"DUKE--TR--1991--33"
, institution =	"Department of Computer Science, Duke University"
, year =	1991
, url =	"ftp://ftp.cs.duke.edu/dist/techreport/1991/1991-33.ps.Z"
, update =	"98.03 bibrelex+mitchell, 97.11 bibrelex"
, abstract =	"\indent Given a set $S$ of $n$ points in the plane and
                 a segment $e$, a {\em center placement} of $e$ is a
                 placement (allowing translation and rotation) that
                 minimizes the maximum distance from $e$ to the points
                 of $S$. We present an algorithm for computing a center
                 placement for $S$, whose running time is $O(n^{2}
                 \alpha (n) \, \mbox {log} ^{3}n),$ where $\alpha (n)$
                 is the inverse Ackermann function. The algorithm makes
                 use of the parametric searching technique of Megiddo."
}

@article{aest-cscpp-93
, author =	"Pankaj K. Agarwal and A. Efrat and Micha Sharir and S. Toledo"
, title =	"Computing a Segment Center for a Planar Point Set"
, journal =	"J. Algorithms"
, volume =	15
, number =	2
, year =	1993
, pages =	"314--323"
, keywords =	"points, center, placement"
, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 93.09 efrat"
}

@inproceedings{aegm-pkmst-98
, author =	"Pankaj K. Agarwal and D. Eppstein and L. J. Guibas and M. Henzinger"
, title =	"Parametric and kinetic minimum spanning trees"
, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1998
, pages =	"596--605"
, update =	"99.03 agarwal"
}

@inproceedings{aem-dhsrg-92
, author =	"Pankaj K. Agarwal and D. Eppstein and J. Matou{\v s}ek"
, title =	"Dynamic half-space reporting, geometric optimization, and minimum spanning trees"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"80--89"
, succeeds =	"am-dhsrr-91"
, update =	"96.09 agarwal, 96.05 agarwal, 93.09 erickson"
}

@techreport{ae-rsir-97
, author =	"Pankaj K. Agarwal and Jeff Erickson"
, title =	"Geometric range searching and its relatives"
, type =	"Tech.\ Report"
, number =	"CS-1997-11"
, institution =	"Department of Computer Science"
, address =	"Duke University"
, year =	1997
, update =	"98.03 agarwal"
}

@incollection{ae-rsir-99
, author =	"Pankaj K. Agarwal and Jeff Erickson"
, title =	"Geometric range searching and its relatives"
, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
, booktitle =	"Advances in Discrete and Computational Geometry"
, series =	"Contemporary Mathematics"
, volume =	223
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1999
, pages =	"1--56"
, update =	"00.03 smid, 98.07 agarwal"
}

@unpublished{aeg-kbspr-97
, author =	"P. K. Agarwal and J. Erickson and L. J. Guibas"
, title =	"Kinetic binary space partitions in {$R^{3}$}"
, year =	1997
, note =	"In preparation"
, update =	"98.07 bibrelex+mitchell"
}

@inproceedings{aeg-kbisd-98
, author =	"Pankaj K. Agarwal and Jeff Erickson and Leonidas J. Guibas"
, title =	"Kinetic {BSP}s for Intersecting Segments and Disjoint Triangles"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"107--116"
, update =	"98.07 bibrelex, 98.03 agarwal"
}

@techreport{agkptv-argc-95
, author =	"P. K. Agarwal and M. T. Goodrich and S. R. Kosaraju and F. P. Preparata and R. Tamassia and J. S. Vitter"
, title =	"Applicable and Robust Geometric Computing"
, type =	"Project Proposal (U. S. Army Research Office grant DAAH04-96-1-0013)"
, institution =	"Center for Geometric Computing"
, year =	1995
, url =	"http://www.cs.brown.edu/cgc/"
, update =	"98.07 bibrelex, 97.03 tamassia"
}

@inproceedings{agmv-bspfr-96
, author =	"P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter"
, title =	"Binary Space Partitions for Fat Rectangles"
, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
, site =	"Burlington, VT"
, month =	oct
, year =	1996
, pages =	"482--491"
, update =	"98.07 bibrelex, 98.03 agarwal, 97.07 smid, 97.03 murali"
}

@article{agmv-bspfr-00
, author =	"P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter"
, title =	"Binary Space Partitions for Fat Rectangles"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"1422--1448"
, update =	"00.11 smid"
}

@techreport{agps-rss-92
, author =	"P. K. Agarwal and L. Guibas and M. Pellegrini and M. Sharir"
, title =	"Ray shooting among spheres"
, type =	"Manuscript"
, institution =	"??"
, year =	1992
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@inproceedings{aghrs-cpdtc-00
, author =	"Pankaj K. Agarwal and L. J. Guibas and S. Har-Peled and A. Rabinovitch and M. Sharir"
, title =	"Computing the Penetration Depth of Two Convex Polytopes in 3D"
, booktitle =	"Proc. 7th Scandanavian Workshop on Algorithmic Theory"
, year =	2000
, pages =	"??"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{aghv-memps-97
, author =	"Pankaj K. Agarwal and Leonidas J. Guibas and John Hershberger and Eric Veach"
, title =	"Maintaining the extent of a moving point set"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"31--44"
, update =	"99.07 bibrelex, 98.03 agarwal"
}

@inproceedings{agmv-cskbs-97
, author =	"Pankaj K. Agarwal and Leonidas J. Guibas and T. M. Murali and Jeffrey Scott Vitter"
, title =	"Cylindrical Static and Kinetic Binary Space Partitions"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"39--48"
, cites =	"aeg-kbspr-97, agmv-bspfr-96, as-sagp-94, a-iurbw-90, b-mpbsp-93, bgh-dsmd-97, c-mgdii-91, csm-nocpt-95, cgl-pgd-85, cf-nrtsg-89, cf-fopsg-92, c-sc3di-96, cs-arscg-89, b-lsbsp-95, e-acg-87, fkn-vsgpt-80, hw-ensrq-87, mm-aagtn-95, mf-csbra-97, nat-mbtyp-90, nt-abtrt-86, n-sismt-90, n-isgpt-92, py-ebsph-90, py-obspo-92, sbgs-sacgi-69, s-barga-93, t-vcdop-92, tn-sopub-87, t-obspa-90, ZZZ"
, update =	"98.07 bibrelex, 97.07 agarwal+efrat"
}

@inproceedings{ahk-caspc-00
, author =	"Pankaj K. Agarwal and S. Har-Peled and M. Karia"
, title =	"Computing approximate shortest paths on convex polytopes"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"270--279"
, update =	"00.11 smid, 00.07 agarwal"
}

@techreport{ahsv-aspcp-96
, author =	"Pankaj K. Agarwal and Sariel Har-Peled and Micha Sharir and Kasturi R. Varadarajan"
, title =	"Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
, type =	"Report"
, number =	"CS-1996-12"
, institution =	"Dept. Comput. Sci., Duke Univ."
, address =	"Durham, NC"
, year =	1996
, precedes =	"ahsv-aspcp-97"
, update =	"98.03 mitchell, 96.09 agarwal"
}

@article{ahsv-aspcp-97
, author =	"P. K. Agarwal and S. Har-Peled and M. Sharir and K. R. Varadarajan"
, title =	"Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
, journal =	"J. ACM"
, volume =	44
, year =	1997
, pages =	"567--584"
, succeeds =	"ahsv-aspcp-96"
, update =	"98.03 mitchell"
}

@article{aks-cdofo-95
, author =	"Pankaj K. Agarwal and M. Katz and Micha Sharir"
, title =	"Computing depth orders for fat objects and related problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"187--206"
, succeeds =	"aks-cdorp-94"
, update =	"98.07 agarwal, 98.03 mitchell, 96.09 devillers"
}

@inproceedings{aks-cdorp-94
, author =	"Pankaj K. Agarwal and M. J. Katz and Micha Sharir"
, title =	"Computing depth orders and related problems"
, booktitle =	"Proc. 4th Scand. Workshop Algorithm Theory"
, year =	1994
, pages =	"1--12"
, precedes =	"aks-cdorp-95"
, update =	"98.03 mitchell, 97.11 katz, 96.09 devillers, 96.05 agarwal, 95.09 agarwal"
}

@article{aks-cdorp-95
, author =	"Pankaj K. Agarwal and M. J. Katz and Micha Sharir"
, title =	"Computing depth orders and related problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"187--206"
, succeeds =	"aks-cdorp-94"
, update =	"98.03 mitchell, 97.11 katz, 97.03 agarwal"
}

@book{akm-rap-98
, title =	"Robotics: The Algorithmic Perspective"
, editor =	"Pankaj K. Agarwal and L. E. Kavraki and M. T. Mason"
, publisher =	"A. K. Peters"
, address =	"Wellesley"
, year =	1998
, update =	"99.03 agarwal"
}

@inproceedings{akksw-seahq-99
, author =	"Pankaj K. Agarwal and Lars Knipping and Marc van Kreveld and Tycho Strijk and Alexander Wolf"
, title =	"A Simple and Efficient Algorithm for High-Quality Line Labeling"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"93--96"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{ak-ccspi-93
, author =	"Pankaj K. Agarwal and Marc van Kreveld"
, title =	"Connected Component and Simple Polygon Intersection Searching"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"36--47"
, update =	"93.09 milone+mitchell+smid, 93.05 jones"
}

@techreport{ak-iplal-92t
, author =	"Pankaj K. Agarwal and M. van Kreveld"
, title =	"Implicit point location in arrangements of line segments, with an application to motion planning"
, type =	"Report"
, number =	"RUU-CS-92-15"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1992
, precedes =	"ak-iplal-92i"
, update =	"98.11 bibrelex, 96.05 agarwal, 94.05 schwarzkopf"
}

@inproceedings{ak-iplal-92i
, author =	"Pankaj K. Agarwal and M. van Kreveld"
, title =	"Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning"
, booktitle =	"Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"New Delhi, India"
, year =	1992
, succeeds =	"ak-iplal-92t"
, update =	"98.11 bibrelex, 96.05 agarwal, 93.09 milone+mitchell"
}

@article{ak-iplal-94
, author =	"Pankaj K. Agarwal and M. van Kreveld"
, title =	"Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"369--383"
, keywords =	"point location, motion planning, arrangements"
, update =	"97.03 schwarzkopf, 96.05 agarwal, 95.05 agarwal"
}

@article{ak-pccis-96
, author =	"Pankaj K. Agarwal and Marc van Kreveld"
, title =	"Polygon and connected component intersection searching"
, journal =	"Algorithmica"
, volume =	15
, year =	1996
, pages =	"626--660"
, update =	"97.07 agarwal+smid"
}

@techreport{ako-iqco-90
, author =	"Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
, title =	"Intersection queries for curved objects"
, type =	"Manuscript"
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{ako-iqco-91
, author =	"Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
, title =	"Intersection queries for curved objects"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"41--50"
, keywords =	"range searching, partition trees, intersection"
, precedes =	"ako-iqco-93"
, cites =	"a-rsoas-89, a-dapal-89, ako-iqco-90, ass-sulbl-89, ahl-sqrpc-90, c-fsnaq-86, ceggss-rspug-90, cg-fc1ds-86, cg-fc2a-86, csw-qoubs-90, cw-qorss-89, de-ssio-87, dsst-mdsp-89, e-acg-87, ew-hrsls-86, gos-rsipl-89, hw-ensrq-87, koa-iqsd-90i, m-mcast-90, mw-gscpt-89, oss-slspt-90, s-ksacs-91, w-pr-82, ydep-psrq-89, ZZZ"
, update =	"97.11 bibrelex, 96.05 agarwal, 95.05 korneenko, 94.05 devillers"
}

@article{ako-iqco-93
, author =	"Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
, title =	"Intersection queries in curved objects"
, journal =	"J. Algorithms"
, volume =	15
, number =	2
, year =	1993
, pages =	"229--266"
, keywords =	"intersection, searching, curvilinear, ray shooting, partition trees, geometric transformations"
, succeeds =	"ako-iqco-91"
, update =	"96.05 agarwal, 95.05 korneenko, 94.01 smid"
}

@inproceedings{aks-lpmis-97
, author =	"Pankaj K. Agarwal and Mark van Kreveld and Subhash Suri"
, title =	"Label Placement by Maximum Independent Set in Rectangles"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"233--238"
, update =	"97.11 jones"
}

@inproceedings{almr-npppd-97
, author =	"P. K. Agarwal and J.-C. Latombe and R. Motwani and P. Raghavan"
, title =	"Nonholonomic path planning for pushing a disk among obstacles"
, booktitle =	"Intl. Conf. Robotics and Auto."
, year =	1997
, update =	"97.03 agarwal"
}

@techreport{am-dhsrr-91
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
, title =	"Dynamic Half-Space Range Reporting and Its Applications"
, type =	"Tech. {Report}"
, number =	"CS-1991-43"
, institution =	"Duke University"
, year =	1991
, precedes =	"aem-dhsrg-92"
, update =	"98.07 bibrelex, 96.05 agarwal, 93.09 erickson"
}

@article{am-dhsrr-95
, author =	"P. K. Agarwal and J. Matou{\v s}ek"
, title =	"Dynamic Half-Space Range Reporting and Its Applications"
, journal =	"Algorithmica"
, volume =	13
, year =	1995
, pages =	"325--345"
, keywords =	"arrangements, cuttings, range-searching, dynamization"
, update =	"96.09 agarwal, 96.05 pascucci"
}

@inproceedings{am-rsss-92
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
, title =	"On range searching with semialgebraic sets"
, booktitle =	"Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	629
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"1--13"
, keywords =	"range search, partition tree, cutting, algebraic surface, semialgebraic set, Tarski cell"
, precedes =	"am-rsss-94"
, update =	"96.05 agarwal, 95.05 smid, 93.09 matousek"
}

@article{am-rsss-94
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
, title =	"On range searching with semialgebraic sets"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"393--418"
, succeeds =	"am-rsss-92"
, update =	"96.05 agarwal, 95.01 matousek"
}

@techreport{am-rsps-91
, author =	"P. K. Agarwal and J. Matou{\v s}ek"
, title =	"Ray shooting and parametric search"
, type =	"Technical {Report}"
, number =	"CS-1991-22"
, institution =	"Dept. Comput. Sci., Duke Univ."
, address =	"Durham, NC"
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{am-rsps-92
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
, title =	"Ray shooting and parametric search"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"517--526"
, keywords =	"ray tracing, range search, intersection, partition trees"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@article{am-rsps-93
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
, title =	"Ray shooting and parametric search"
, journal =	"SIAM J. Comput."
, volume =	22
, number =	4
, year =	1993
, pages =	"794--806"
, succeeds =	"am-rsps-92"
, update =	"97.11 bibrelex"
}

@techreport{am-rng3d-91
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
, title =	"Relative neighborhood graphs in $3$-d"
, type =	"Report"
, number =	"CS-1991-19"
, institution =	"Dept. Comput. Sci., Duke Univ."
, address =	"Durham, NC"
, year =	1991
, keywords =	"pattern recognition, geometric graphs"
, precedes =	"am-rngtd-92i"
, update =	"96.09 agarwal, 96.05 agarwal, 95.01 smid"
}

@inproceedings{am-rngtd-92i
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
, title =	"Relative neighborhood graphs in three dimensions"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"58--65"
, keywords =	"pattern recognition, geometric graphs"
, succeeds =	"am-rng3d-91"
, precedes =	"am-rngtd-92a"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@article{am-rngtd-92a
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
, title =	"Relative neighborhood graphs in three dimensions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	1
, year =	1992
, pages =	"1--14"
, keywords =	"pattern matching, geometric graphs, arrangements, random sampling, closest pairs"
, succeeds =	"am-rngtd-92i"
, update =	"96.09 agarwal, 96.05 agarwal, 95.05 korneenko"
}

@inproceedings{ams-cmfal-94
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Computing Many Faces in Arrangements of Lines and Segments"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"76--84"
, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-39.ps.gz"
, precedes =	"ams-cmfal-98"
, cites =	"a-pal2a-90, aegs-nemfl-92, bds-lric-94, c-talp-69, cegghss-rspug-91, cegss-cfals-93, cf-dvrsi-90, c-csfas-90, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-ccmfa-90, ew-mnemf-86, gs-caa-93, hs-parss-93, hw-ensrq-87, m-mdscg-84, m-fppa-90, m-fppa2-91, st-epdg-83, ZZZ"
, update =	"98.07 mitchell, 98.03 bibrelex, 96.09 agarwal, 96.05 agarwal, 95.09 agarwal, 94.09 jones, 94.01 jones"
}

@article{ams-cmfal-98
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Computing Many Faces in Arrangements of Lines and Segments"
, journal =	"SIAM J. Comput."
, volume =	27
, number =	2
, year =	1998
, pages =	"491--505"
, succeeds =	"ams-cmfal-94"
, update =	"98.07 bibrelex+mitchell, 98.03 agarwal"
}

@inproceedings{ams-fnmst-91
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and Subhash Suri"
, title =	"Farthest neighbors, maximum spanning trees and related problems in higher dimensions"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"105--116"
, precedes =	"ams-fnmst-92"
, update =	"98.03 mitchell, 96.09 agarwal, 96.05 agarwal"
}

@article{ams-fnmst-92
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and Subhash Suri"
, title =	"Farthest neighbors, maximum spanning trees and related problems in higher dimensions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	4
, year =	1992
, pages =	"189--201"
, keywords =	"proximity, partition, maximal spanning tree, minimal spanning tree, $d$-dimensional, furthest neighbors, approximation, bichromatic"
, succeeds =	"ams-fnmst-91"
, update =	"98.03 mitchell, 96.09 agarwal, 96.05 agarwal+pascucci, 95.05 korneenko"
}

@inproceedings{amv-nacbs-98
, author =	"Pankaj K. Agarwal and T. Murali and J. Vitter"
, title =	"A new algorithm for constructing binary space partitions for orthogonal rectangles"
, booktitle =	"Proc. European Sympos. Algortihms"
, year =	1998
, update =	"99.03 agarwal"
}

@inproceedings{amv-ptcbs-97
, author =	"Pankaj K. Agarwal and T. Murali and J. Vitter"
, title =	"Practical techniques for constructing binary space partitions for orthogonal rectangles"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"382--384"
, cites =	"agmv-bspfr-96, a-iurbw-90, fkn-vsgpt-80, py-obspo-92, sbgs-sacgi-69, t-vcdop-92, tn-sopub-87, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@article{aps-ccai-93
, author =	"Pankaj K. Agarwal and M. Pellegrini and Micha Sharir"
, title =	"Counting circular arc intersections"
, journal =	"SIAM J. Comput."
, volume =	22
, number =	4
, year =	1993
, pages =	"778--793"
, keywords =	"intersection, counting, circles, circular arc arrangement, point location, random sampling, partition trees, geometric transformations"
, succeeds =	"as-ccai-91"
, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 94.01 matousek"
}

@inproceedings{ap-aapc-00
, author =	"Pankaj K. Agarwal and Cecilia M. Procopiuc"
, title =	"Approximation Algorithms for Projective Clustering"
, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
, year =	2000
, pages =	"538--547"
, update =	"00.03 agarwal"
}

@inproceedings{ap-eaac-98
, author =	"Pankaj K. Agarwal and Cecilia M. Procopiuc"
, title =	"Exact and Approximation Algorithms for Clustering"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"658--667"
, update =	"99.07 bibrelex, 98.07 mitchell, 98.03 agarwal"
}

@inproceedings{art-mpscr-95
, author =	"Pankaj K. Agarwal and P. Raghavan and H. Tamaki"
, title =	"Motion planning for a steering-constrained robot through moderate obstacles"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, year =	1995
, pages =	"343--352"
, update =	"96.05 agarwal, 95.09 agarwal+smid, 95.05 agarwal"
}

@techreport{ass-oleia-93
, author =	"P. K. Agarwal and O. Schwarzkopf and M. Sharir"
, title =	"The overlay of lower envelopes and its applications"
, type =	"Manuscript"
, institution =	"??"
, year =	1993
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@article{ass-oleia-96
, author =	"P. K. Agarwal and O. Schwarzkopf and Micha Sharir"
, title =	"The overlay of lower envelopes and its applications"
, journal =	"Discrete Comput. Geom."
, volume =	15
, year =	1996
, pages =	"1--13"
, update =	"98.03 mitchell, 96.05 smid"
}

@techreport{ass-oletd-94
, author =	"P. K. Agarwal and O. Schwarzkopf and M. Sharir"
, title =	"The overlay of lower envelopes in three dimensions and its applications"
, type =	"Manuscript"
, institution =	"??"
, year =	1994
, update =	"98.03 bibrelex"
}

@inproceedings{ass-oletd-95
, author =	"Pankaj K. Agarwal and Otfried Schwarzkopf and Micha Sharir"
, title =	"The Overlay of Lower Envelopes in Three Dimensions and its Applications"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"182--189"
, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-40.ps.gz"
, keywords =	"curved surfaces"
, cites =	"as-erasg-95, ass-sulbl-89, a-sdcgp-85, bd-olrcu-93, cgppsw-ctct-94, cegs-sessr-89, cs-arscg-89, bds-lric-94, e-acg-87, egs-ueplf-89, es-mnwsn-90, gpw-gtt-93, gpw-bngpi-94, hs-nblet-94, hs-atubs-95, hs-ndssg-86, hrr-araga-91, s-atubl-94, sa-dsstg-95, ZZZ"
, update =	"98.03 bibrelex, 96.05 agarwal, 95.09 mitchell+schwarzkopf, 95.05 agarwal"
}

@article{as-smmck-96
, author =	"Pankaj K. Agarwal and Sandeep Sen"
, title =	"Selection in monotone matrices and computing $k$-th nearest neighbors"
, journal =	"J. Algorithms"
, volume =	20
, year =	1996
, pages =	"581--601"
, update =	"96.09 agarwal"
}

@incollection{as-atgo-95
, author =	"P. K. Agarwal and Micha Sharir"
, title =	"Algorithmic techniques for geometric optimization"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	1000
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"234--253"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{as-anps-91
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Applications of a new partitioning scheme"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"379--391"
, keywords =	"random sampling, range searching, ray tracing, hidden line/surface elimination"
, precedes =	"as-anspt-93"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 agarwal, 95.05 korneenko"
}

@techreport{as-anspt-91
, author =	"P. K. Agarwal and Micha Sharir"
, title =	"Applications of a New Space Partition Technique"
, type =	"Manuscript"
, year =	1991
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{as-anspt-93
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Applications of a new space-partitioning technique"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"11--38"
, keywords =	"random sampling, range searching, ray tracing, hidden line/surface elimination, partition trees"
, succeeds =	"as-anps-91"
, update =	"98.03 mitchell, 97.11 bibrelex, 97.07 agarwal, 96.05 agarwal, 95.05 korneenko, 94.01 matousek"
}

@incollection{as-aa-00
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Arrangements and Their Applications"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"49--119"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell"
, annote =	"Chapter 2 of su-hcg-00"
}

@techreport{as-cssp-90
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Circle shooting in a simple polygon"
, type =	"Technical {Report}"
, number =	"90-56"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"98.03 mitchell, 96.05 agarwal, 95.01 smid, 93.09 milone+mitchell"
}

@article{as-cssp-93
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Circle shooting in a simple polygon"
, journal =	"J. Algorithms"
, volume =	14
, year =	1993
, pages =	"69--87"
, succeeds =	"as-cssp-90"
, update =	"98.03 mitchell, 96.05 agarwal, 95.01 smid, 94.05 matousek"
}

@article{as-cvspf-93
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Circular visibility of a simple polygon from a fixed point"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, month =	mar
, year =	1993
, pages =	"1--25"
, keywords =	"visibility, simple polygon"
, succeeds =	"as-cvspp-90"
, update =	"98.11 bibrelex, 98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 94.05 sharir"
}

@techreport{as-cvspp-90
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Circular visibility of a simple polygon from a point"
, type =	"Report"
, number =	"90-61"
, institution =	"DIMACS, Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1990
, keywords =	"visibility, simple polygon"
, precedes =	"as-cvspf-93"
, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
}

@techreport{as-cci-91
, author =	"P. K. Agarwal and Micha Sharir"
, title =	"Counting circular arc intersections"
, type =	"Technical {Report}"
, number =	"CS-1991-04"
, institution =	"Dept. Comput. Sci., Duke Univ."
, address =	"Durham, NC"
, month =	jan
, year =	1991
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{as-ccai-91
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Counting circular arc intersections"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"10--20"
, keywords =	"intersection, circles, random sampling"
, cites =	"a-pal1e-90, a-pal2a-90, aass-sdp-90, as-cci-91, bo-arcgi-79, c-rcsi-86, ce-oails-88, cegs-sessr-89, cegs-ablsp-89, cs-agpli-90, csw-qoubs-90, c-narsc-87, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-oplms-86, gos-crial-89, hw-ensrq-87, m-cen-90, m-cha-90i, m-fppa1-88, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
}

@incollection{as-dssga-00
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"{Davenport-Schinzel} Sequences and Their Geometric Applications"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"1--47"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell"
, annote =	"Chapter 1 of su-hcg-00"
}

@techreport{as-eago-96
, author =	"P. K. Agarwal and M. Sharir"
, title =	"Efficient Algorithms for Geometric Optimization"
, number =	"CS-1996-19"
, institution =	"Dept. Computer Science, Duke University"
, year =	1996
, update =	"99.03 forrest, 98.11 bibrelex, 98.07 agarwal"
}

@article{as-eago-98
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Efficient algorithms for geometric optimization"
, journal =	"ACM Comput. Surv."
, volume =	30
, year =	1998
, pages =	"412--458"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{as-erasg-95
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Efficient Randomized Algorithms for Some Geometric Optimization Problems"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"326--335"
, keywords =	"vertical decompositions, width of point sets, minimum-width annulus, biggest stick problem"
, cites =	"aas-cefda-94, ass-oletd-95, ast-apsgo-94, as-cldsp-90, bc-ossc-94, cegs-dwclp-93, cegs-sessr-89, cs-agpli-90, cegsw-ccbac-90, cs-arscg-89, dmn-rass-92, bds-lric-94, bgh-vdt3s-94, efnn-rauvd-89, hs-nblet-94, hw-ensrq-87, ht-cws-88, ks-osse-93, ks-ebago-93, m-roass-91, m-apcad-83, s-atubl-94, sa-dsstg-95, sj-wrspp-94, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{as-erasg-96
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Efficient Randomized Algorithms for Some Geometric Optimization Problems"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"317--337"
, update =	"97.03 agarwal"
}

@inproceedings{as-mpbpo-99
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Motion planning of a ball amid polyhedral obstacles in three dimensions"
, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1999
, pages =	"21--30"
, update =	"99.03 agarwal"
}

@unpublished{as-mpbas-98
, author =	"P. K. Agarwal and M. Sharir"
, title =	"Motion Planning of a Ball Amidst Segments in Three Dimensions"
, year =	1998
, note =	"unpublished manuscript"
, update =	"98.03 agarwal"
}

@techreport{as-oldmw-90
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Off-line dynamic maintenance of the width of a planar point set"
, type =	"Report"
, number =	"90-64"
, institution =	"DIMACS, Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1990
, precedes =	"as-oldmw-91"
, update =	"98.03 mitchell, 96.05 agarwal, 93.09 jones"
}

@article{as-oldmw-91
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Off-line dynamic maintenance of the width of a planar point set"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1991
, pages =	"65--78"
, keywords =	"off-line problem, dynamization, width, convex hull"
, succeeds =	"as-oldmw-90"
, update =	"98.03 mitchell, 96.05 agarwal, 93.09 jones"
}

@inproceedings{as-nvpt-93
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"On the number of views of polyhedral terrains"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"55--60"
, cites =	"bhok-sanvp-91, bd-agisr-90, cf-cvbtd-82, cs-vppt-89, c-agrv-85, gcs-ecrag-91, hs-nblet-93, kd-svm-76, pd-acag-86, pd-voag-90, s-atubl-93, s-nvapo-91, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 96.05 agarwal, 95.09 agarwal, 93.09 milone+mitchell"
}

@article{as-nvpt-94
, author =	"P. K. Agarwal and Micha Sharir"
, title =	"On the number of views of polyhedral terrains"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"177--182"
, update =	"98.03 mitchell, 96.05 pocchiola, 95.09 agarwal, 93.09 milone+mitchell"
}

@inproceedings{as-pckum-99
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Pipes, cigars, and kreplach: The union of {M}inkowski sums in three dimensions"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"143--153"
, update =	"00.03 agarwal"
}

@article{as-pckum-00
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Pipes, cigars, and kreplach: The union of {M}inkowski sums in three dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	24
, number =	4
, year =	2000
, pages =	"645--685"
, update =	"01.07 orourke"
}

@techreport{as-pglp-90
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Planar geometric location problems"
, type =	"Report"
, number =	"90-58"
, institution =	"DIMACS, Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1990
, precedes =	"as-pglpm-91"
, update =	"98.03 mitchell, 96.05 agarwal, 93.09 jones"
}

@article{as-pglp-94
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Planar geometric location problems"
, journal =	"Algorithmica"
, volume =	11
, year =	1994
, pages =	"185--195"
, keywords =	"location problems, arrangements, width, parametric search techniques"
, succeeds =	"as-pglpm-91"
, update =	"98.03 mitchell, 97.03 devillers, 96.05 agarwal, 94.05 sharir"
}

@inproceedings{as-pglpm-91
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Planar geometric location problems and maintaining the width of a planar set"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"449--458"
, keywords =	"location problems, arrangements, width, parametric search techniques"
, succeeds =	"as-pglp-90"
, update =	"98.03 mitchell, 96.05 agarwal, 93.09 jones"
}

@article{as-rsacp-96i
, author =	"P. K. Agarwal and Micha Sharir"
, title =	"Ray shooting amidst convex polygons in {2D}"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"508--519"
, update =	"98.03 mitchell, 97.03 agarwal+pocchiola+smid, 96.09 agarwal, 96.05 agarwal"
}

@article{as-rsacp-96ii
, author =	"P. K. Agarwal and Micha Sharir"
, title =	"Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"100--116"
, succeeds =	"as-rsacp-93"
, update =	"98.03 mitchell, 96.05 smid"
}

@inproceedings{as-rsacp-93
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Ray Shooting Amidst Convex Polytopes in Three Dimensions"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"260--270"
, precedes =	"as-rsacp-96ii"
, update =	"98.03 mitchell, 96.05 smid, 93.05 smid"
}

@techreport{as-rbida-88t
, author =	"P. K. Agarwal and M. Sharir"
, title =	"Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
, type =	"Manuscript"
, institution =	"??"
, year =	1988
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@inproceedings{as-rbida-88
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"70--80"
, keywords =	"motion planning, red-blue intersection"
, precedes =	"as-rbida-90"
, cites =	"as-rbida-88t, ass-sulbl-87, a-sdcgp-85, bo-arcgi-79, bk-cmpgm-87, c-fsram-85, cg-vippg-85, c-narsc-87, cegsw-ccbac-88t, c-dic-36, eghsssw-irals-88, egs-cmfal-88, ghlst-ltavs-87, gss-gmppt-88, hs-ndssg-86, hw-ensrq-87, klps-ujrcf-86, l-bc-61, my-mpacc-86, ZZZ"
, update =	"98.03 bibrelex+mitchell, 96.05 agarwal, 95.05 korneenko"
}

@article{as-rbida-90
, author =	"Pankaj K. Agarwal and Micha Sharir"
, title =	"Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
, journal =	"SIAM J. Comput."
, volume =	19
, number =	2
, year =	1990
, pages =	"297--321"
, keywords =	"intersection, motion planning, {Davenport}-{Schinzel} sequences, sweeping, red-blue, random sampling, ray shooting, curve arrangements"
, succeeds =	"as-rbida-88"
, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
}

@techreport{ass-sulbl-87
, author =	"P. K. Agarwal and M. Sharir and P. W. Shor"
, title =	"Sharp upper and lower bounds on the length of general {Davenport}-{Schinzel} sequences"
, number =	332
, institution =	"Department of Computer Science, New York University"
, year =	1987
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@techreport{ast-emst-93
, author =	"P. K. Agarwal and Micha Sharir and S. Toledo"
, title =	"An efficient multi-dimensional searching technique and its applications"
, type =	"Tech. Report"
, number =	"CS-1993-20"
, institution =	"Dept. Comp. Sci."
, address =	"Duke University"
, year =	1993
, update =	"98.03 mitchell, 96.05 agarwal"
}

@inproceedings{ast-apsgo-92
, author =	"Pankaj K. Agarwal and Micha Sharir and Sivan Toledo"
, title =	"Applications of parametric searching in geometric optimization"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"72--82"
, keywords =	"parametric search"
, precedes =	"ast-apsgo-94"
, update =	"96.01 aronov, 95.05 korneenko"
}

@article{ast-apsgo-94
, author =	"Pankaj K. Agarwal and Micha Sharir and S. Toledo"
, title =	"Applications of parametric searching in geometric optimization"
, journal =	"J. Algorithms"
, volume =	17
, year =	1994
, pages =	"292--318"
, keywords =	"parametric search"
, succeeds =	"ast-apsgo-92"
, update =	"98.03 mitchell, 96.05 agarwal, 96.01 aronov, 95.05 korneenko, 95.01 smid"
}

@inproceedings{asw-d2cp-97
, author =	"Pankaj K. Agarwal and Micha Sharir and Emo Welzl"
, title =	"The Discrete $2$-Center Problem"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"147--155"
, cites =	"a-slp3d-94, aass-sdp-93, as-pglp-94, cegsw-ccbac-90, cs-arscg-89, e-fcptc-97, hs-ftp-91, jk-eaetc-94, ks-ebago-93, klps-ujrcf-86, m-apcad-83, ms-cscgl-84, r-dcikc-88a, s-nlap2-97, t-icbcl-88, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@article{ass-sulbl-89
, author =	"Pankaj K. Agarwal and Micha Sharir and P. W.Shor"
, title =	"Sharp upper and lower bounds on the length of general {Davenport}-{Schinzel} sequences"
, journal =	"J. Combin. Theory Ser. A"
, volume =	52
, number =	2
, year =	1989
, pages =	"228--274"
, keywords =	"Davenport-Schinzel sequences, Ackermann's function, combinatorial geometry"
, update =	"98.07 agarwal, 98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
}

@article{as-escrs-90
, author =	"Pankaj K. Agarwal and M.-T. Shing"
, title =	"Efficient special cases of rectilinear {Steiner} trees: Points on the boundary of a rectilinear rectangle"
, journal =	"Networks"
, volume =	20
, year =	1990
, pages =	"453--485"
, keywords =	"Steiner trees"
, update =	"98.11 bibrelex, 96.05 agarwal"
}

@inproceedings{as-sagp-94
, author =	"Pankaj K. Agarwal and Subhash Suri"
, title =	"Surface Approximation and Geometric Partitions"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"24--33"
, keywords =	"triangulation, ray shooting"
, update =	"95.01 mitchell"
}

@article{as-sagp-98
, author =	"P. K. Agarwal and S. Suri"
, title =	"Surface Approximation and Geometric Partitions"
, journal =	"SIAM J. Comput."
, volume =	27
, year =	1998
, pages =	"1016--1035"
, update =	"01.04 smid"
}

@article{av-eaapc-00
, author =	"P. K. Agarwal and Kasturi R. Varadarajan"
, title =	"Efficient algorithms for approximating polygonal chains"
, journal =	"Discrete Comput. Geom."
, volume =	23
, year =	2000
, pages =	"273--291"
, update =	"01.11 smid, 00.03 agarwal"
}

@article{af-wmsia-96
, author =	"R. Agarwala and D. Fern\'{a}ndez-Baca"
, title =	"Weighted multidimensional search and its applications to convex optimization"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"83--99"
, update =	"96.05 agarwal"
}

@article{a-lncg-88
, author =	"A. Aggarwal"
, title =	"Lecture Notes in Computational Geometry"
, journal =	"MIT Reserch Seminar Series MIT/LCS/RSS"
, volume =	3
, month =	aug
, year =	1988
, update =	"97.11 bibrelex"
}

@article{a-obfma-86
, author =	"A. Aggarwal"
, title =	"Optimal bounds for finding maximum on array of processors with {$k$} global buses"
, journal =	"IEEE Trans. Comput."
, volume =	"C-35"
, year =	1986
, pages =	"62--64"
, update =	"98.07 bibrelex"
}

@article{a-rtcg-89
, author =	"A. Aggarwal"
, title =	"Research topics in computational geometry"
, journal =	"Bull. EATCS"
, volume =	39
, year =	1989
, pages =	"388--408"
, keywords =	"problem collection"
, update =	"95.05 korneenko"
}

@phdthesis{a-agpiv-84
, author =	"Alok Aggarwal"
, title =	"The art gallery problem: {Its} variations, applications, and algorithmic aspects"
, school =	"Dept. of Comput. Sci., Johns Hopkins University"
, address =	"Baltimore, MD"
, year =	1984
, keywords =	"visibility"
, update =	"98.11 bibrelex, 98.03 smid, 97.11 orourke"
}

@inproceedings{aacs-mhm-87
, author =	"A. Aggarwal and B. Alpern and A. K. Chandra and M. Snir"
, title =	"A model for hierarchical memory"
, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '87"
, year =	1987
, pages =	"305--313"
, update =	"98.07 bibrelex, 97.03 agarwal, 94.05 franciosa"
}

@inproceedings{abkks-emcmu-92
, author =	"A. Aggarwal and A. Bar-Noy and S. Khuller and D. Kravets and B. Schieber"
, title =	"Efficient minimum cost matching using quadrangle inequality"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"583--592"
, update =	"98.03 bibrelex"
}

@inproceedings{abosy-fmcnp-85
, author =	"A. Aggarwal and H. Booth and J. O'Rourke and Subhash Suri and C. K. Yap"
, title =	"Finding minimal convex nested polygons"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"296--304"
, keywords =	"packing, visibility"
, precedes =	"abosy-fmcnp-89"
, cites =	"cy-psppo-84, da-frkec-84, db-ccppf-83, kl-fstcg-85, o-fmeb-84, so-fmnp-85t, t-sgprc-83, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{abosy-fmcnp-89
, author =	"A. Aggarwal and H. Booth and J. O'Rourke and Subhash Suri and C. K. Yap"
, title =	"Finding minimal convex nested polygons"
, journal =	"Inform. Comput."
, volume =	83
, number =	1
, month =	oct
, year =	1989
, pages =	"98--110"
, keywords =	"packing, visibility, convex polygons, extremal figures"
, succeeds =	"abosy-fmcnp-85"
, update =	"98.03 mitchell, 95.05 korneenko"
}

@inproceedings{ac-vma-88
, author =	"A. Aggarwal and A. K. Chandra"
, title =	"Virtual memory algorithms"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"173--185"
, update =	"94.05 franciosa"
}

@article{acs-ccp-90
, author =	"A. Aggarwal and A. K. Chandra and M. Snir"
, title =	"Communication Complexity of {PRAM}s"
, journal =	"Theoret. Comput. Sci."
, volume =	71
, year =	1990
, pages =	"3--28"
, update =	"96.09 orourke"
}

@inproceedings{acs-hmbt-87
, author =	"A. Aggarwal and A. K. Chandra and M. Snir"
, title =	"Hierarchical memory with block transfer"
, booktitle =	"Proc. 28rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"204--216"
, update =	"94.05 franciosa"
}

@article{acy-macp-85
, author =	"A. Aggarwal and J. S. Chang and C. K. Yap"
, title =	"Minimum area circumscribing polygons"
, journal =	"Visual Comput."
, volume =	1
, year =	1985
, pages =	"112--117"
, keywords =	"extremal figures, polygons"
, update =	"95.05 korneenko"
}

@techreport{ac-eapps-84
, author =	"A. Aggarwal and Bernard Chazelle"
, title =	"Efficient algorithm for partitioning a polygon into star-shaped polygons"
, type =	"Report"
, number =	"??"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1984
, update =	"98.03 mitchell"
}

@article{acgoy-pcg-88
, author =	"A. Aggarwal and Bernard Chazelle and Leonidas J. Guibas and C. {\'O}'D{\'u}nlaing and C. Yap"
, title =	"Parallel computational geometry"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"293--327"
, succeeds =	"acgoy-pcg-85"
, update =	"98.03 mitchell"
}

@inproceedings{acgoy-pcg-85
, author =	"A. Aggarwal and Bernard Chazelle and Leonidas J. Guibas and C. {\'O}'D{\'u}nlaing and C. K. Yap"
, title =	"Parallel computational geometry"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"468--477"
, precedes =	"acgoy-pcg-88"
, update =	"98.03 mitchell"
}

@inproceedings{ackms-amtsp-97
, author =	"Alok Aggarwal and Don Coppersmith and Sanjeev Khanna and Rajeev Motwani and Baruch Schieber"
, title =	"The Angular-Metric Traveling Salesman Problem"
, booktitle =	"Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms"
, site =	"New Orleans, Louisiana"
, month =	jan
, year =	1997
, pages =	"221--229"
, update =	"98.03 mitchell"
, annote =	"An earlier version, titled 'The Angle-TSP Problem  and the
                  Weighted Linear Matroid Parity Problem' was accepted
                  to STOC96, but apparently was withdrawn, as it never
                  appeared there"
}

@article{ackms-amtsp-99
, author =	"A. Aggarwal and D. Coppersmith and S. Khanna and R. Motwani and B. Schieber"
, title =	"The angular-metric traveling salesman problem"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	1999
, pages =	"697--711"
, update =	"00.11 smid, 00.07 smid"
}

@article{aert-otbsp-92
, author =	"A. Aggarwal and H. Edelsbrunner and P. Raghavan and P. Tiwari"
, title =	"Optimal Time Bounds for Some Proximity Problems in the Plane"
, journal =	"Inform. Process. Lett."
, volume =	42
, number =	1
, year =	1992
, pages =	"55--60"
, keywords =	"proximity, lower bounds"
, update =	"95.05 korneenko, 93.09 held"
}

@incollection{ags-ccrpd-88
, author =	"A. Aggarwal and S. K. Ghosh and R. K. Shyamasundar"
, title =	"Computational complexity of restricted polygon decompositions"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"1--11"
, keywords =	"polygons, decomposition, watchman problem"
, update =	"95.05 korneenko"
}

@inproceedings{agss-ltacv-87
, author =	"A. Aggarwal and L. J. Guibas and J. Saxe and P. W. Shor"
, title =	"A linear time algorithm for computing the {Voronoi} diagram of a convex polygon"
, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
, year =	1987
, pages =	"39--45"
, precedes =	"agss-ltacv-89"
, update =	"01.07 devillers, 98.07 agarwal, 98.03 mitchell"
}

@article{agss-ltacv-89
, author =	"A. Aggarwal and L. J. Guibas and J. Saxe and P. W. Shor"
, title =	"A linear-time algorithm for computing the {Voronoi} diagram of a convex polygon"
, journal =	"Discrete Comput. Geom."
, volume =	4
, number =	6
, year =	1989
, pages =	"591--604"
, keywords =	"convex polygons, Voronoi diagram"
, succeeds =	"agss-ltacv-87"
, update =	"01.07 devillers, 98.03 mitchell, 95.05 korneenko"
}

@inproceedings{ahl-sqrpc-90
, author =	"A. Aggarwal and M. Hansen and T. Leighton"
, title =	"Solving query-retrieval problems by compacting {Voronoi} diagrams"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"331--340"
, keywords =	"Voronoi diagram, searching, separator, filtering search, probabilistic geometry"
, comments =	"Submitted to J. ACM"
, update =	"95.05 korneenko"
}

@article{ah-ccbpc-89
, author =	"A. Aggarwal and M. Hawrylycz"
, title =	"On computing the closest boundary point on the convex hull"
, journal =	"Inform. Process. Lett."
, volume =	31
, year =	1989
, pages =	"311--314"
, keywords =	"proximity, points, convex hull, lower bound"
, update =	"95.05 korneenko"
}

@inproceedings{aiks-fkpmd-89
, author =	"A. Aggarwal and H. Imai and N. Katoh and Subhash Suri"
, title =	"Finding $k$ points with minimum diameter and related problems"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"283--291"
, precedes =	"aiks-fkpmd-91"
, cites =	"agss-ltacv-87, as-facle-87, a-imtpr-72, abky-cabmm-88, ddg-fsp-83, h-ca-75, hs-ftp-89, ia-eaggs-86, l-knnvd-82, mos-fmrio-85, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{aiks-fkpmd-91
, author =	"A. Aggarwal and H. Imai and N. Katoh and Subhash Suri"
, title =	"Finding $k$ points with minimum diameter and related problems"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"38--56"
, succeeds =	"aiks-fkpmd-89"
, update =	"98.03 mitchell"
}

@article{ak-agmsg-87
, author =	"A. Aggarwal and M. M. Klawe"
, title =	"Applications of generalized matrix searching to geometric algorithms"
, journal =	"Discrete Appl. Math."
, volume =	27
, year =	1987
, pages =	"3--23"
, keywords =	"monotone matrix, proximity, polygons"
, update =	"96.09 agarwal, 95.05 korneenko"
}

@article{akllw-lbapl-91
, author =	"A. Aggarwal and M. M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson"
, title =	"A lower bound on the area of permutation layouts"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"241--255"
, succeeds =	"akllw-mlge-85"
, update =	"96.09 agarwal"
}

@inproceedings{akllw-mlge-85
, author =	"A. Aggarwal and M. M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson"
, title =	"Multi-layer grid embeddings"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"186--196"
, precedes =	"akllw-lbapl-91"
, update =	"96.09 agarwal"
}

@inproceedings{akmsw-gamsa-86
, author =	"A. Aggarwal and M. M. Klawe and S. Moran and P. W. Shor and R. Wilber"
, title =	"Geometric applications of a matrix searching algorithm"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"285--292"
, precedes =	"akmsw-gamsa-87"
, cites =	"acy-macp-85, am-fcmp-86, atb-mdcp-82, bddg-fep-85, dkssu-owbr-81, lp-annpc-78, mos-fmrio-85, p-scg-77, sd-sgslw-81, s-gc-75, sh-cpp-75, t-ccu-84, t-safnp-83, tb-gaufn-81, ZZZ"
, update =	"98.07 agarwal, 98.03 bibrelex, 96.09 agarwal, 96.05 agarwal"
}

@article{akmsw-gamsa-87
, author =	"A. Aggarwal and M. M. Klawe and S. Moran and P. W. Shor and R. Wilber"
, title =	"Geometric applications of a matrix-searching algorithm"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"195--208"
, keywords =	"polygons, furthest neighbors, convex polygons, routing"
, succeeds =	"akmsw-gamsa-86"
, update =	"98.07 agarwal, 96.09 agarwal, 96.05 agarwal, 95.05 korneenko"
}

@article{ak-ltafa-89
, author =	"A. Aggarwal and D. Kravets"
, title =	"A linear time algorithm for finding all farthest neighbors in a convex polygon"
, journal =	"Inform. Process. Lett."
, volume =	31
, number =	1
, year =	1989
, pages =	"17--20"
, keywords =	"convex polygons, furthest neighbors"
, update =	"95.05 korneenko"
}

@inproceedings{akps-psgma-90
, author =	"A. Aggarwal and D. Kravets and J. K. Park and S. Sen"
, title =	"Parallel Searching in Generalized {Monge} Arrays with Applications"
, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"259--268"
, update =	"96.09 orourke"
}

@article{am-fcmp-86
, author =	"A. Aggarwal and R. Melville"
, title =	"Fast computation of the modality of polygons"
, journal =	"J. Algorithms"
, volume =	7
, number =	3
, year =	1986
, pages =	"369--381"
, keywords =	"polygons, modality"
, update =	"95.05 korneenko"
}

@inproceedings{amss-cmvvd-89
, author =	"A. Aggarwal and S. Moran and P. W. Shor and Subhash Suri"
, title =	"Computing the minimum visible vertex distance between two polygons"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"115--134"
, keywords =	"proximity, visibility, polygons"
, update =	"98.03 mitchell, 95.05 korneenko"
}

@inproceedings{ap-nsmma-88
, author =	"A. Aggarwal and J. K. Park"
, title =	"Notes on searching in multidimensional monotone arrays"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"497--512"
, comments =	"To appear in J. Algorithms as two papers"
, update =	"98.07 agarwal"
}

@techreport{ap-psmma-89
, author =	"A. Aggarwal and J. K. Park"
, title =	"Parallel searching in Multidimensional Monotone Arrays"
, type =	"Manuscript"
, institution =	"??"
, year =	1989
, update =	"97.11 bibrelex"
}

@techreport{ap-ssmma-89
, author =	"A. Aggarwal and J. K. Park"
, title =	"Sequential searching multidimensional monotone arrays"
, institution =	""
, month =	jun
, year =	1989
, update =	"93.09 milone+mitchell"
}

@inproceedings{ap-opsml-94
, author =	"A. Aggarwal and C. G. Plaxton"
, title =	"Optimal Parallel Sorting in Multi-Level Storage"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"659--668"
, update =	"99.07 smid, 96.09 orourke"
}

@techreport{art-lbcpr-87
, author =	"A. Aggarwal and P. Raghavan and P. Tiwari"
, title =	"Lower Bounds for Closest Pair and Related Problems in Simple Polygons"
, number =	""
, institution =	"IBM Thomas J. Watson Research Center"
, address =	"Yorktown Heights, NY"
, year =	1987
, update =	"93.09 held"
}

@article{ar-ddsnn-91
, author =	"A. Aggarwal and P. Raghawan"
, title =	"Deferred data structures for the nearest-neighbor problem"
, journal =	"Inform. Process. Lett."
, volume =	40
, number =	3
, year =	1991
, pages =	"119--122"
, keywords =	"convex hull, Voronoi diagram, proximity, nearest neighbor, furthest neighbor, deferred data structures"
, update =	"95.05 korneenko"
}

@inproceedings{ast-fmwkl-93
, author =	"A. Aggarwal and B. Schieber and T. Tokuyama"
, title =	"Finding a minimum weight $k$-link path in graphs with {Monge} property and applications"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"189--197"
, precedes =	"ast-fmwkl-94"
, cites =	"akmsw-gamsa-87, ap-nsmma-88, at-ciqdp-93, a-dpi-91, blp-despp-92, bddg-fep-85, cegs-dwclp-92, c-sdsno-87, cl-flwsf-90, f-oatp-91, k-sltac-89, kk-altag-88, lh-llc-90, lp-pctow-91, ls-oldpa-91, m-apcad-83, v-pcp-75, w-oqms-91, ZZZ"
, update =	"98.03 bibrelex, 95.05 korneenko, 93.09 jones"
}

@article{ast-fmwkl-94
, author =	"A. Aggarwal and B. Schieber and T. Tokuyama"
, title =	"Finding a minimum-weight $k$-link path in graphs with the concave {Monge} property and applications"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"263--280"
, succeeds =	"ast-fmwkl-93"
, update =	"95.05 korneenko, 95.01 smid"
}

@techreport{as-cldsp-89
, author =	"A. Aggarwal and S. Suri"
, title =	"Computing the longest diagonal of a simple polygon"
, type =	"Research {Report}"
, number =	"14775 (\#66232)"
, institution =	"IBM"
, month =	jul
, year =	1989
, update =	"98.07 bibrelex"
}

@article{as-cldsp-90
, author =	"A. Aggarwal and Subhash Suri"
, title =	"Computing the longest diagonal of a simple polygon"
, journal =	"Inform. Process. Lett."
, volume =	35
, number =	1
, year =	1990
, pages =	"13--18"
, keywords =	"polygon, diagonal"
, update =	"98.03 mitchell, 95.05 korneenko, 95.01 smid"
}

@inproceedings{as-facle-87
, author =	"A. Aggarwal and Subhash Suri"
, title =	"Fast algorithms for computing the largest empty rectangle"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"278--290"
, keywords =	"orthogon, extremal figures, empty rectangle"
, cites =	"akmsw-gamsa-86, af-nfmer-86, cdl-cler-86, mos-fmrio-85, nhl-merp-84, ZZZ"
, update =	"98.03 bibrelex+mitchell, 95.05 korneenko"
}

@inproceedings{at-iatp-93
, author =	"Alok Aggarwal and Takeshi Tokuyama"
, title =	"An Improved Algorithm for the Traveler's Problem"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"476--485"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@inproceedings{at-ciqdp-93
, author =	"Alok Aggarwal and Takeshi Tokuyama"
, title =	"Consecutive Interval Query and Dynamic Programming on Intervals"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"466--475"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@article{av-iocsr-88
, author =	"A. Aggarwal and J. S. Vitter"
, title =	"The input/output complexity of sorting and related problems"
, journal =	"Commun. ACM"
, volume =	31
, year =	1988
, pages =	"1116--1127"
, update =	"94.05 devillers+franciosa, 93.09 milone+mitchell"
}

@techreport{aw-cg-88
, author =	"A. Aggarwal and J. Wein"
, title =	"Computational geometry"
, type =	"Report"
, number =	"RSS-3"
, institution =	"Lab. Comput. Sci., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1988
, keywords =	"lecture notes"
, annote =	"lecture notes for course 18.409"
}

@article{am-ssrsd-91
, author =	"Michael E. Agishtein and Alexander A. Migdal"
, title =	"Smooth Surface Reconstruction From Scattered Data Points"
, journal =	"Comput. Graph. (UK)"
, volume =	15
, number =	1
, year =	1991
, pages =	"29--39"
, keywords =	"triangulation, rational interpolation, surface smoothing, surface reconstruction"
, update =	"96.09 devillers"
, annote =	"Uses incremental flip algorithm. Extra point at
		 infinity. Points are ordered by a plane filling fractal
		 to speed point location. Extra points are added at cc
		 centres until tris are small enough."
, abstract =	"We describe here a new technique and a package for
		 rapid reconstruction of smooth surfaces from scattered
		 data points. This method is based on a fast recurrent
		 algorithm for the Delaunay triangulation followed by
		 rational interpolation inside triangles. Preprocessing
		 of data includes sorting and takes N log(N) time.
		 Afterwards the computational cost is a linear function
		 of the amount of data. This technique enables a user to
		 construct a surface of any class of smoothness and
		 degree of convergence. Our package reconstructs
		 surfaces that can be uniquely projected either on a
		 plane or a plane or on a sphere. The graphical section
		 of this package includes three dimensional
		 transformations, shading, hidden surface removal,
		 interactive adding points into triangulation by mouse,
		 etc. The graphics has been implemented on Iris-4D,
		 SUN-4 and IBM-5080. (Author abstract) 17 Refs."
}

@article{a-rmli-54
, author =	"S. Agmon"
, title =	"The Relaxation Method for Linear Inequalities"
, journal =	"Canad. J. Math."
, volume =	6
, year =	1954
, pages =	"382--392"
, update =	"97.11 bibrelex"
}

@book{a-atfc-76
, author =	"M. Agoston"
, title =	"Algebraic Topology: A First Course"
, series =	"Lecture Notes in Pure and Applied Mathematics"
, publisher =	"Marcel Dekker"
, address =	"New York, NY"
, year =	1976
, update =	"98.07 bibrelex"
}

@book{a-at-76
, author =	"M. K. Agoston"
, title =	"Algebraic Topology"
, publisher =	"Marcel Dekker Inc"
, address =	"New York, NY"
, year =	1976
, update =	"98.07 bibrelex"
}

@article{ar-prdag-94
, author =	"Amitabh Agrawal and Aristides A. G. Requicha"
, title =	"A paradigm for the robust design of algorithms for geometric modelling"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	3
, year =	1994
, pages =	"33--44"
, note =	"Proc. EUROGRAPHICS '94"
, keywords =	"geometric modeling, robustness, interval arithmetic, constructive solid geometry"
, update =	"95.09 korneenko"
}

@inproceedings{afs-esssd-93
, author =	"R. Agrawal and C. Faloutsos and A. Swami"
, title =	"Efficient similarity search in sequence databases"
, booktitle =	"Proc. 4th Internat. Conf. Foundations of Data Organization and Algorithms"
, nickname =	"FODO '93"
, year =	1993
, update =	"98.07 bibrelex"
}

@inproceedings{aggr-aschd-98
, author =	"R. Agrawal and J. Gehrke and D. Gunopulos and P. Raghavan"
, title =	"Automatic subspace clustering of high dimensional data for data mining applications"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1998
, pages =	"94--105"
, update =	"98.07 agarwal"
}

@inproceedings{ag-icdma-92
, author =	"R. Agrawal and A. Ghosh and T. Imielinski and B. Iyer and A. Swami"
, title =	"An Interval Classifier for Database Mining Applications"
, booktitle =	"Proceedings of the 18th Conference on Very Large Databases"
, publisher =	"Morgan Kauffman"
, month =	aug
, year =	1992
, pages =	"560--573"
, update =	"98.07 agarwal"
, annote =	"marketing example; creates decision rules; compared
                 with CART and ID3; splits continuous values into weak
                 and strong intervals"
}

@inproceedings{alss-fsspn-95
, author =	"R. Agrawal and K.-I. Lin and H. S. Sawhney and S. Shim"
, title =	"Fast similarity search in the presence of noise, scaling and translation in time-series databases"
, booktitle =	"Proc. 21st VLDB Conference"
, year =	1995
, pages =	"490--501"
, update =	"98.07 bibrelex"
}

@inproceedings{ael-dlptr-85
, author =	"R. Aharoni and P. Erd{\H o}s and N. Linial"
, title =	"Dual linear programs and the relationship between their optima"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"476--482"
, precedes =	"ael-dlptr-88"
}

@article{ael-dlptr-88
, author =	"R. Aharoni and P. Erd{\H o}s and N. Linial"
, title =	"Dual linear programs and the relationship between their optima"
, journal =	"Combinatorica"
, volume =	8
, year =	1988
, pages =	"13--20"
, succeeds =	"ael-dlptr-85"
}

@incollection{ah-azube-89
, author =	"U. Ahlfeld and H.-D. Hecker"
, title =	"Algorithmen zur {Unimodalit\"at} {Bestimmung} einfacher {Polygone}"
, booktitle =	"Wiss. Beitr{\"a}ge Martin-Luther-Univ. Halle-Wittenberg"
, volume =	55
, publisher =	"??"
, address =	"Germany"
, year =	1989
, pages =	"139--146"
, keywords =	"polygon, unimodal"
, update =	"95.05 korneenko"
}

@incollection{ah-ehep-91
, author =	"U. Ahlfeld and H.-D. Hecker"
, title =	"Eine {Hierarchie} einfacher {Polygone}"
, booktitle =	"Wiss. Beitr{\"a}ge Martin-Luther-Univ. Halle-Wittenberg"
, volume =	60
, publisher =	"??"
, address =	"Germany"
, year =	1991
, pages =	"45--56"
, keywords =	"simple polygons, taxonomy"
, update =	"95.05 korneenko"
}

@article{ah-mwgp-91
, author =	"U. Ahlfeld and H.-D. Hecker"
, title =	"Minimal watchman graphs in polygons"
, journal =	"Research in Informatics"
, volume =	4
, publisher =	"Akademie-Verlag"
, address =	"Berlin, Germany"
, year =	1991
, pages =	"126--130"
, note =	"Geobild '91"
, keywords =	"watchman problem, polygons, visibility"
, update =	"95.05 korneenko"
}

@article{ahh-suusm-88
, author =	"U. Ahlfeld and H.-D. Hecker"
, title =	"Strenge {Unimodalit\"at} und strenge monotonie einfacher {Polygone}"
, journal =	"Wiss. Z. P{\"a}dagog. Hochschule ``K. W. F. Wander'', Dresden. Math. Naturwiss. R."
, volume =	22
, year =	1988
, pages =	"29--33"
, keywords =	"polygon, monotone, unimodal"
, update =	"98.07 bibrelex, 95.05 korneenko"
}

@article{ah-ccsgs-92
, author =	"U. Ahlfeld and H.-D. Hecker"
, title =	"The computational complexity of some guard sets in polygons"
, journal =	"J. Information Processing and Cybernetics"
, volume =	28
, number =	6
, year =	1992
, pages =	"331--342"
, keywords =	"watchman problem, NP-completeness, polygons"
, update =	"95.05 korneenko"
}

@book{a-ca-66
, author =	"L. V. Ahlfors"
, title =	"Complex Analysis"
, publisher =	"McGraw-Hill"
, year =	1966
, update =	"98.03 bibrelex"
}

@inproceedings{abbchms-soc-97
, author =	"H.-K. Ahn and M. de Berg and P. Bose and S.-W. Cheng and D. Halperin and J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Separating an Object from its Cast"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"221--230"
, cites =	"abbgotwz-fds-93, b-gcamp-95, bbk-dcsp-94, bkt-fpm-93, bt-gcamp-94, ccw-pdmdd-93, e-cit-88, fm-gaim-93, g-oppws-93, gs-pmgsc-85, h-cgpm-91, h-gamp-97, ht-mdsoh-92, k-caplp-92, mgj-cfufp-96, m-ept-92, ms-tdctd-93, orsw-ipaw-95, ps-cgi-85, p-mrisf-87, rr-mcp-92, t-mss-85, wo-ich-81, wl-grama-94, ZZZ"
, update =	"98.07 agarwal+bibrelex, 97.07 efrat"
}

@inproceedings{acc-csed-98
, author =	"H.-K. Ahn and S.-W. Cheng and O. Cheong"
, title =	"Casting with skewed ejection direction"
, booktitle =	"Proc. 9th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '98"
, series =	"Lecture Notes Comput. Sci."
, volume =	1533
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"139--148"
, update =	"00.03 smid"
}

@inproceedings{acmv-rpbcc-00
, author =	"Hee-Kap Ahn and Otfried Cheong and Ji{\v r}{\'i} Matou{\v s}ek and Antoine Vigneron"
, title =	"Reachability by Paths of Bounded Curvature in Convex Polygons"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"251--259"
, update =	"00.11 jones"
}

@inproceedings{acs-bcrrp-01
, author =	"Hee-Kap Ahn and Otfried Cheong and Chan-Su Shin"
, title =	"Bridging Convex Regions and Related Problems"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"53--56"
, update =	"01.04 icking"
}

@article{af-panp-84
, author =	"J. Ahn and H. Freeman"
, title =	"A program for automatic name placement"
, journal =	"Cartographica"
, volume =	21
, number =	"2--3"
, year =	1984
, pages =	"101--109"
, update =	"97.07 agarwal"
}

@incollection{a-afps-90
, author =	"A. V. Aho"
, title =	"Algorithms for finding patterns in strings"
, booktitle =	"Algorithms and Complexity"
, series =	"Handbook of Theoretical Computer Science"
, volume =	"A"
, publisher =	"Elsevier"
, year =	1990
, pages =	"255--400"
, update =	"98.07 bibrelex"
}

@article{agh-rstes-77
, author =	"A. V. Aho and M. R. Garey and F. K. Hwang"
, title =	"Rectilinear {Steiner} trees: efficient special case algorithms"
, journal =	"Networks"
, volume =	7
, year =	1977
, pages =	"37--58"
, keywords =	"Steiner trees, $L_{1}$-metric"
, update =	"95.05 korneenko"
}

@book{ahu-dsa-83
, author =	"A. V. Aho and J. E. Hopcroft and J. D. Ullman"
, title =	"Data Structures and Algorithms"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1983
}

@book{ahu-daca-74
, author =	"A. V. Aho and J. E. Hopcroft and J. D. Ullman"
, title =	"The Design and Analysis of Computer Algorithms"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1974
}

@article{au-opmrw-79
, author =	"A. V. Aho and J. D. Ullman"
, title =	"Optimal partial-match retrieval when fields are independently specified"
, journal =	"ACM Trans. Database Syst."
, volume =	4
, year =	1979
, pages =	"168--179"
}

@article{an-ormo-84
, author =	"A. Ahuja and C. Nash"
, title =	"Octree representation of moving objects"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	26
, year =	1984
, pages =	"207--216"
, keywords =	"data structuring, octree"
, update =	"95.05 korneenko"
}

@article{ac-gcd-68
, author =	"D. V. Ahuja and S. A. Coons"
, title =	"Geometry for construction and display"
, journal =	"IBM Syst. J."
, volume =	7
, year =	1968
, pages =	"188--205"
}

@inproceedings{a-dppuv-80
, author =	"N. Ahuja"
, title =	"Dot pattern processing using {Voronoi} polygons as neighborhoods"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
, site =	"Miami Beach, FL"
, year =	1980
, pages =	"1122--1127"
, precedes =	"a-dppuv-82"
}

@article{a-dppuv-82
, author =	"N. Ahuja"
, title =	"Dot pattern processing using {Voronoi} polygons as neighborhoods"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	4
, year =	1982
, pages =	"336--343"
, succeeds =	"a-dppuv-80"
}

@article{aas-iruvt-85
, author =	"N. Ahuja and B. An and B. Schachter"
, title =	"Image Representation Using {Voronoi} Tessellation"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	29
, year =	1985
, pages =	"286--295"
, annote =	"Suggests using Voronoi cells as primitives to
		 represent an image."
}

@inproceedings{acyb-idcat-80
, author =	"N. Ahuja and R. T. Chien and R. Yen and N. Birdwell"
, title =	"Interference detection and collision avoidance among three dimensional objects"
, booktitle =	"Proc. 1st Nat. Conf. Artificial Intell."
, site =	"Palo Alto, CA"
, year =	1980
, pages =	"44--48"
}

@inproceedings{ah-amat-84
, author =	"N. Ahuja and W. Hoff"
, title =	"Augmented Medial Axis Transform"
, booktitle =	"Proceedings of Workshop on Computer Vision, Representation and Control"
, year =	1984
, pages =	"251--256"
, annote =	"Representation of 2D shape by MAT (overlapping
		 blocks). AMAT adds adjacency info for blocks. Build
		 from DT of block centres."
}

@article{as-mpabu-84
, author =	"N. Ahuja and S. Swamy"
, title =	"Multiprocessor pyramid architectures for bottom-up image analysis"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-6"
, year =	1984
, pages =	"463--474"
, update =	"97.11 bibrelex"
}

@article{av-gooso-89
, author =	"N. Ahuja and J. Veenstra"
, title =	"Generating Octrees from Object Silhouettes in orthographic views"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	11
, year =	1989
, pages =	"137--149"
, update =	"98.11 bibrelex"
}

@incollection{amo-nf-90
, author =	"R. K. Ahuja and T. L. Magnanti and J. B. Orlin"
, title =	"Network Flows"
, editor =	"G. L. Nemhauser and A. H. G. {Rinnooy Kan} and M. J. Todd"
, booktitle =	"Optimization"
, series =	"Handbooks in Operations Research and Management"
, volume =	1
, publisher =	"North-Holland"
, year =	1990
, pages =	"211--360"
, update =	"97.11 bibrelex"
}

@book{amo-nftaa-93
, author =	"R. K. Ahuja and T. L. Magnanti and J. B. Orlin"
, title =	"Network Flows: Theory, Algorithms, and Applications"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1993
, update =	"96.09 tamassia, 96.04 garg"
}

@inproceedings{a-e01ss-98
, author =	"Oswin Aichholzer"
, title =	"Efficient \{0,1\}-String Searching Based on Pre-Clustering"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"11--13"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{a-lpt-95
, author =	"Oswin Aichholzer"
, title =	"Local Properties of Triangulations"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"33--36"
, update =	"00.03 bibrelex"
}

@inproceedings{a-pt-97
, author =	"Oswin Aichholzer"
, title =	"The Path of a Triangulation"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"1--3"
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{a-pt-99
, author =	"Oswin Aichholzer"
, title =	"The Path of a Triangulation"
, booktitle =	"Proc. 15th Ann. Sympos. Comput. Geom."
, nickname =	"SCG'99"
, year =	1999
, pages =	"14--23"
, update =	"02.03 pocchiola"
}

@article{aaag-ntsp-95
, author =	"O. Aichholzer and D. Alberts and F. Aurenhammer and B. G{\"a}rtner"
, title =	"A Novel Type of Skeleton for Polygons"
, journal =	"J. Universal Comput. Sci."
, volume =	1
, number =	12
, year =	1995
, pages =	"752--761"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{aah-fps-01
, author =	"Oswin Aichholzer and Lyuba S. Alboul and Ferran Hurtado"
, title =	"On Flips in Polyhedral Surfaces"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"27--30"
, update =	"01.04 icking"
}

@inproceedings{aa-chh-94
, author =	"Oswin Aichholzer and Franz Aurenhammer"
, title =	"Classifying Hyperplanes in Hypercubes"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"53--57"
, update =	"00.11 smid, 00.07 icking"
}

@techreport{aa-skfgpf-95
, author =	"O. Aichholzer and F. Aurenhammer"
, title =	"Straight skeletons for general polygonal figures"
, number =	432
, institution =	"Inst. for Theor. Comput. Sci., Graz Univ. of Technology, Graz, Austria"
, year =	1995
, precedes =	"aa-ssgpf-96"
, update =	"00.03 bibrelex"
}

@inproceedings{aa-ssgpf-96
, author =	"Oswin Aichholzer and Franz Aurenhammer"
, title =	"Straight skeletons for general polygonal figures in the plane"
, booktitle =	"Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '96"
, site =	"Hong Kong"
, series =	"Lecture Notes Comput. Sci."
, volume =	1090
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"117--126"
, succeeds =	"aa-skfgpf-95"
, update =	"00.11 smid, 00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
}

@incollection{aa-ssgpf-98
, author =	"O. Aichholzer and F. Aurenhammer"
, title =	"Straight skeletons for general polygonal figures in the plane"
, editor =	"P. Engel and H. Syta"
, booktitle =	"Voronoi's Impact on Modern Science, Book 2"
, publisher =	"Institute of Mathematics of the National Academy of Sciences of Ukraine"
, address =	"Kyiv"
, year =	1998
, pages =	"7--21"
, succeeds =	"aa-ssgpf-96"
, update =	"00.11 smid"
}

@inproceedings{aaclmp-vddsd-97
, author =	"O. Aichholzer and F. Aurenhammer and D. Chen and D. Lee and A. Mukhopadhyay and E. Papadopoulou"
, title =	"Voronoi Diagrams for Direction-Sensitive Distances"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"418--420"
, cites =	"ak-eama-87, cd-vdbcd-85, f-savd-87, ks-ossaf-85, k-cavd-89, ld-gvdp-81, mmp-dgp-87, mp-wrpfs-91, s-icpps-85, s-vdr-92, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{aacktrx-tin-96
, author =	"Oswin Aichholzer and Franz Aurenhammer and Siu-Wing Cheng and Naoki Katoh and Michael Taschwer and G{\"u}nter Rote and Yin-Feng Xu"
, title =	"Triangulations Intersect Nicely"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"339--359"
, keywords =	"matching, minimum weight triangulation, greedy triangulation"
, succeeds =	"aatr-tin-95, cx-cistp-95"
, update =	"01.07 devillers, 97.03 rote"
, abstract =	"We show that there is a matching between the edges of any two
		triangulations of a planar point set such that an edge of one
		triangulation is matched either to the identical edge in the other
		triangulation or to an edge that crosses it. This theorem also
		holds for the triangles of the triangulations and in general
		independence systems. As an application we give some lower
		bounds for the minimum weight triangulation which can be
		computed in polynomial time by matching and network flow
		techniques. We exhibit an easy-to-recognize class of point sets
		for which the minimum-weight triangulation coincides with the
		greedy triangulation."
}

@article{aahk-tct-02
, author =	"Oswin Aichholzer and Franz Aurenhammer and Ferran Hurtado and Hannes Krasser"
, title =	"Towards compatible triangulations"
, journal =	"Theoret. Comput. Sci."
, volume =	"??"
, year =	2002
, pages =	"??--??"
, url =	"http://www.cis.TUGraz.at/igi/oaich/publications.html"
, succeeds =	"aak-ctps-01"
, update =	"02.03 orourke"
}

@techreport{aaiklr-psac-97
, author =	"Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
, title =	"$\varphi$-Self-Approaching Curves"
, number =	226
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1997
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr226.pdf"
, precedes =	"aaiklr-gsac-98"
, update =	"99.03 bibrelex, 98.07 icking"
}

@inproceedings{aaiklr-gsac-98
, author =	"Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
, title =	"Generalized Self-Approaching Curves"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"15--17"
, succeeds =	"aaiklr-psac-97"
, precedes =	"aaiklr-gsac-98p"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{aaiklr-gsac-98p
, author =	"Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
, title =	"Generalized Self-Approaching Curves"
, booktitle =	"Proc. 9th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '98"
, site =	"Taejon"
, series =	"Lecture Notes Comput. Sci."
, volume =	1533
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"317--326"
, succeeds =	"aaiklr-gsac-98"
, precedes =	"aaiklr-gsac-01"
, update =	"01.04 icking, 99.03 bibrelex"
}

@article{aaiklr-gsac-01
, author =	"Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
, title =	"Generalized Self-Approaching Curves"
, journal =	"Discrete Appl. Math."
, volume =	109
, year =	2001
, pages =	"3--24"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr226.pdf"
, succeeds =	"aaiklr-gsac-98p"
, cites =	"admss-esstl-95, cfg-upg-90, ik-skpcs-95, ikl-sac-99, lc-tasso-99, lsksc-ncssu-97, ls-pinos-97, r-cic-94, rs-addce-91, ZZZ"
, update =	"01.04 icking"
}

@inproceedings{aak-eotsp-01
, author =	"Oswin Aichholzer and Franz Aurenhammer and Hannes Krasser"
, title =	"Enumerating order types for small point sets with applications"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"11--18"
, update =	"01.11 pocchiola"
}

@inproceedings{aak-ctps-01
, author =	"Oswin Aichholzer and Franz Aurenhammer and Hannes Krasser"
, title =	"On Compatible Triangulations of Point Sets"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"23--26"
, update =	"01.04 icking"
}

@inproceedings{aarx-clgta-96
, author =	"Oswin Aichholzer and Franz Aurenhammer and G{\"u}nter Rote and Yin-Feng Xu"
, title =	"Constant-level greedy triangulations approximate the MWT well"
, editor =	"Ding-Zhu Du and Xiang-Sun Zhang and Kan Cheng"
, booktitle =	"Proc. Second Internat. Symp. Operations Research and its Applications, Guilin, China, December 11--13, 1996"
, series =	"Lecture Notes in Operations Research"
, volume =	2
, publisher =	"World Publishing Corp."
, address =	"Beijing"
, year =	1996
, pages =	"309--318"
, precedes =	"aarx-clgta-97"
, update =	"97.11 bibrelex, 97.03 rote"
}

@inproceedings{aarx-clgta-97
, author =	"Oswin Aichholzer and Franz Aurenhammer and G{\"u}nter Rote and Yin-Feng Xu"
, title =	"Constant-level greedy triangulations approximate the {MWT} well"
, booktitle =	"??"
, journal =	"Journal of Combinatorial Optimization"
, volume =	"2?"
, year =	"1998?"
, pages =	"??--??"
, note =	"to appear"
, succeeds =	"aarx-clgta-96"
, update =	"98.07 rote, 98.03 mitchell, 97.03 rote"
, abstract =	"Exploiting the concept of so-called light edges, we introduce
		a new way of defining the greedy triangulation GT(S) of a point
		set S.  It provides a decomposition of
		GT(S) into levels, and the number of levels allows us to
		bound the total edge length of GT(S). In particular, we show
		|GT(S)| <= $3 \times 2^{k+1}$ |MWT(S)|, where k is the number of
		levels and MWT(S) is the minimum-weight triangulation
		of S. This constitutes the first non-trivial upper bound on
		|GT(S)| for general points sets S."
}

@inproceedings{aatr-tin-95
, author =	"Oswin Aichholzer and Franz Aurenhammer and Michael Taschwer and G{\"u}nter Rote"
, title =	"Triangulations Intersect Nicely"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"220--229"
, keywords =	"matching, minimum weight triangulation, greedy triangulation"
, precedes =	"aacktrx-tin-96"
, cites =	"b-gtic-79, cx-cistp-95, dfpn-stdt-88, ddmw-fgta-94, dds-saeid-92, dra-sltgt-95, e-atccd-90, gj-cigtn-79, g-segta-89, hk-nammb-73, k-csmwt-94, ll-fagt-92, l-esta-94, l-conm-76, l-scsi-77, t-dsna-83, w-eucdt-93, x-mwtpp-92, yxy-cdapp-94, ZZZ"
, update =	"98.03 bibrelex, 97.03 rote, 95.09 mitchell"
}

@inproceedings{abdmss-lpuof-01
, author =	"Oswin Aichholzer and David Bremner and Erik D. Demaine and Henk Meijer and Vera Sacrist{\'a}n and Michael Soss"
, title =	"Long Proteins with Unique Optimal Foldings in the {H-P} Model"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"59--62"
, update =	"01.04 icking"
}

@inproceedings{acddemoprt-fp-00
, author =	"Oswin Aichholzer and Carmen Cort{\'e}s and Erik D. Demaine and Vida Dujmovi{\'c} and Jeff Erickson and Henk Meijer and Mark Overmars and Bel\'en Palop and Suneeta Ramaswami and Godfried T. Toussaint"
, title =	"Flipturning Polygons"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom."
, site =	"Tokyo, Japan"
, series =	"Lecture Notes Comput. Sci."
, month =	nov
, year =	2000
, note =	"To appear in \emph{Discrete Comput. Geom.}."
, update =	"02.03 orourke"
}

@article{adehost-rcp-01
, author =	"O. Aichholzer and E. D. Demaine and J. Erickson and F. Hurtado and M. Overmars and M. Soss and G. T. Toussaint"
, title =	"Reconfiguring convex polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"85--95"
, update =	"01.11 smid"
}

@inproceedings{ah-eoncs-00
, author =	"Oswin Aichholzer and Ferran Hurtado"
, title =	"Edge Operations on Non-Crossing Spanning Trees"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"121--125"
, update =	"00.03 bibrelex"
}

@inproceedings{ar-ngta-96v
, author =	"Oswin Aichholzer and G{\"u}nter Rote"
, title =	"New Greedy Triangulation Algorithms"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"11--14"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@book{az-pftb-98
, author =	"M. Aigner and G. M. Ziegler"
, title =	"Proofs from {THE} {BOOK}"
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1998
, update =	"98.11 smid"
}

@phdthesis{a-iurbw-90
, author =	"John Milligan Airey"
, title =	"Increasing Update Rates in the Building Walkthrough System with Automatic Model-space Subdivision and Potentially Visible Set Calculations"
, school =	"Dept. of Computer Science, University of North Carolina, Chapel Hill"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"97.07 agarwal"
}

@article{arb-tiriu-90
, author =	"J. M. Airey and J. H. Rohlf and F. P. {Brooks, Jr.}"
, title =	"Towards Image Realism with Interactive Update Rates in Complex Virtual Building Environments"
, journal =	"ACM Siggraph Special Issue on 1990 Symposium on Interactive 3D Graphics"
, volume =	24
, number =	2
, year =	1990
, pages =	"41--50"
, update =	"97.11 bibrelex"
}

@article{ap-dpesa-88
, author =	"V. G. Ajjanagadde and L. M. Patniak"
, title =	"Design and performance evaluation of a systolic architecture for hidden surface removal"
, journal =	"Comput. Graph. (UK)"
, volume =	12
, number =	1
, year =	1988
, pages =	"71--74"
, keywords =	"hidden line/surface elimination, parallel computation"
, update =	"95.05 korneenko"
}

@article{a-lbfpy-88
, author =	"M. Ajtai"
, title =	"A lower bound for finding predecessors in {Yao}'s cell probe model"
, journal =	"Combinatorica"
, volume =	8
, number =	3
, year =	1988
, pages =	"235--247"
, update =	"95.05 korneenko"
}

@article{acns-cfs-82
, author =	"M. Ajtai and V. Chv{\'a}tal and M. Newborn and E. Szemer{\'e}di"
, title =	"Crossing-free subgraphs"
, journal =	"Ann. Discrete Math."
, volume =	12
, year =	1982
, pages =	"9--12"
, update =	"98.03 agarwal+bibrelex"
}

@inproceedings{akss-dsot-86
, author =	"M. Ajtai and J. Koml{\'o}s and W. Steiger and E. Szemer{\'e}di"
, title =	"Deterministic selection in {$O( \log \log n)$} time"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"188--195"
, update =	"98.03 bibrelex"
}

@article{akss-opshc-89
, author =	"M. Ajtai and J. Komlos and W. L. Steiger and E. Szemeredi"
, title =	"Optimal parallel selection has complexity $o(\log \log n)$"
, journal =	"J. Comput. Syst. Sci."
, volume =	38
, number =	1
, year =	1989
, pages =	"125--133"
, keywords =	"parallel computation, selection, lower bound"
, update =	"95.05 korneenko"
}

@inproceedings{aks-osn-83
, author =	"M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di"
, title =	"An {$O(n \log n)$} Sorting Network"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
, year =	1983
, pages =	"1--9"
, update =	"98.03 bibrelex"
}

@article{aks-scps-83
, author =	"M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di"
, title =	"Sorting in $c\log n$ parallel steps"
, journal =	"Combinatorica"
, volume =	3
, year =	1983
, pages =	"1--19"
, update =	"93.09 rote"
}

@article{akt-om-84
, author =	"M. Ajtai and J. Koml{\'o}s and G. Tusn{\'a}dy"
, title =	"On optimal matchings"
, journal =	"Combinatorica"
, volume =	4
, year =	1984
, pages =	"259--264"
, update =	"98.03 bibrelex"
}

@article{am-dptnp-96
, author =	"M. Ajtai and N. Megiddo"
, title =	"A Deterministic $Poly(\log \log N)$-Time $N$-Processor Algorithm for Linear Programming in Fixed Dimension"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"1171--1195"
, update =	"97.03 agarwal+smid"
}

@inproceedings{am-dptnp-92
, author =	"M. Ajtai and N. Megiddo"
, title =	"A Deterministic $Poly(\log \log N)$-Time $N$-Processor Algorithm for Linear Programming in Fixed Dimensions"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"327--338"
, update =	"97.03 agarwal, 94.01 matousek, 93.09 milone+mitchell"
}

@inproceedings{a-reg-93
, author =	"Kurt Akeley"
, title =	"Reality Engine Graphics"
, booktitle =	"Proc. SIGGRAPH '93"
, series =	"In {\em Comput. Graph.\/} Proceedings, Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"Addison-Wesley"
, year =	1993
, pages =	"109--116"
, update =	"98.03 agarwal"
}

@incollection{ahlm-spfoj-96
, author =	"S. Akella and W. Huang and K. M. Lynch and M. T. Mason"
, title =	"Sensorless parts feeding with a one joint robot"
, editor =	"J.-P. Laumond and M. H. Overmars"
, booktitle =	"Algorithms for Robotic Motion and Manipulation"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1996
, update =	"98.07 bibrelex"
}

@inproceedings{am-ppopp-92
, author =	"S. Akella and M. T. Mason"
, title =	"Posing polygonal objects in the plane by pushing"
, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
, year =	1992
, pages =	"2255--2268"
, update =	"98.07 bibrelex"
}

@inproceedings{ahk-sgaan-87
, author =	"S. B. Akers and D. Harel and B. Krishnamurthy"
, title =	"The Star Graph: An Attractive Alternative to the {$n$}-cube"
, booktitle =	"Proc. Int. Conf. on Parrallel Processing"
, year =	1987
, pages =	"393--400"
, update =	"98.07 bibrelex"
}

@inproceedings{ak-gtmsi-86
, author =	"S. B. Akers and B. Krishnamurthy"
, title =	"A group theoretic model for symmetric interconnection networks"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1986
, pages =	"216--223"
, update =	"98.07 bibrelex"
}

@article{ak-gtmsi-38
, author =	"S. B. Akers and B. Krishnamurthy"
, title =	"A Group Theoretic Model for Symmetric Interconnection Networks"
, journal =	"IEEE Trans. Comput."
, volume =	38
, number =	4
, year =	1989
, pages =	"555--566"
, update =	"98.07 bibrelex"
}

@inproceedings{ak-ftsg-87
, author =	"S. B. Akers and B. Krishnamurthy"
, title =	"The fault tolerance of star graphs"
, booktitle =	"Proc. 2nd International Conference on Supercomputing"
, site =	"San Francisco, CA"
, year =	1987
, update =	"98.07 bibrelex"
}

@article{a-mbiss-78
, author =	"H. Akima"
, title =	"A Method of Bivariate Interpolation on Smooth Surface Fitting for Irregularly Distributed Data Points"
, journal =	"ACM Trans. Math. Softw."
, volume =	4
, year =	1978
, pages =	"148--159"
, precedes =	"a-a526b-78"
, update =	"98.03 bibrelex"
, annote =	"Fits a 5th degree polynomial in each triangle. Uses
		 DT. Incremental algorithm---adds points outside the
		 convex hull."
}

@article{a-a526b-78
, author =	"H. Akima"
, title =	"Algorithm 526: {Bivariate} interpolation and smooth surface fitting for irregularly distributed data points"
, journal =	"ACM Trans. Math. Softw."
, volume =	4
, number =	2
, year =	1978
, pages =	"160--164"
, succeeds =	"a-mbiss-78"
, update =	"98.03 bibrelex"
}

@article{a-epdbi-84
, author =	"H. Akima"
, title =	"On estimating partial derivatives for bivariate interpolation of scattered data"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"41--52"
}

@article{aa-wvp-88
, author =	"I. Ya. Akimova and A. P. Akimov"
, title =	"Weighted {Voronoi} Partitions"
, journal =	"Soviet Journal of Computer and Systems Sciences (English translation of Tekhnicheskaya Kibernetika)"
, volume =	26
, number =	6
, month =	nov
, year =	1988
, pages =	"75--80"
, keywords =	"weighted euclidean metric, Voronoi partitions, Voronoi diagrams, geometrical problems, point set"
, update =	"93.05 schwarzkopf"
, annote =	"Multiplicative weights in $n$ dimensions. Incremental
		 algorithm"
, abstract =	"Weighted Voronoi partitions are proposed in this paper
		 as a generalization of the Voronoi partition.
		 Properties of such partitions are obtained, and an
		 algorithm developed for their construction. Certain
		 applied problems whose solution would benefit from the
		 use of Voronoi diagrams are indicated. (Author
		 abstract) 13 Refs."
}

@inproceedings{a-wtcdg-97
, author =	"Jin Akiyama"
, title =	"Why {Taro} Can Do Geometry"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	112
, update =	"97.11 jones"
}

@inproceedings{aa-dsgh-89
, author =	"J. Akiyama and N. Alon"
, title =	"Disjoint simplices and geometric hypergraphs"
, editor =	"G. S. Blum and R. L. Graham and J. Malkevitch"
, booktitle =	"Combinatorial Mathematics; Proc. of the Third International Conference (New York, 1985)"
, volume =	555
, publisher =	"Annals of the New York Academy of Sciences"
, year =	1989
, pages =	"1--3"
, update =	"97.03 schwarzkopf, 95.05 korneenko, 95.01 mitchell"
}

@article{au-nbclp-90
, author =	"J. Akiyama and J. Urrutia"
, title =	"A note on balanced colouring of lattice points"
, journal =	"Discrete Math."
, volume =	83
, number =	1
, year =	1990
, pages =	"123--126"
, update =	"95.05 korneenko"
}

@article{au-sapp-90
, author =	"J. Akiyama and J. Urrutia"
, title =	"Simple alternating path problem"
, journal =	"Discrete Math."
, volume =	84
, number =	1
, year =	1990
, pages =	"101--103"
, keywords =	"points, convex polygons, connect-the-dots problem"
, update =	"95.05 korneenko"
}

@article{ans-nchcp-80
, author =	"T. Akiyama and T. Nishizeki and N. Saito"
, title =	"{NP}-completeness of the {Hamiltonian} cycle problem for bipartite graphs"
, journal =	"J. Inform. Process."
, volume =	3
, year =	1980
, pages =	"73--76"
, update =	"98.11 bibrelex"
}

@proceedings{adss-p4wad-95
, title =	"Proc. 4th Workshop Algorithms Data Struct."
, editor =	"S. Akl and F. Dehne and J.-R. Sack and N. Santoro"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, update =	"98.07 bibrelex, 97.11 sack"
}

@techreport{amr-pgg-88
, author =	"S. Akl and H. Meijer and D. Rappaport"
, title =	"Parallel geometry on a grid"
, number =	"cisc 88--238"
, institution =	"Dept. Computer Inf. Sci. Queen's Univ."
, address =	"Kingston, Ontario, Canada"
, year =	1988
, keywords =	"parallel computations"
, update =	"98.07 bibrelex, 95.05 korneenko"
}

@article{a-ctpac-82
, author =	"S. G. Akl"
, title =	"A Constant-time Parallel Algorithm for Computing Convex Hulls"
, journal =	"BIT"
, volume =	22
, year =	1982
, pages =	"130--134"
, keywords =	"parallel computations, convex hull"
, update =	"95.05 korneenko, 93.09 held"
}

@article{a-nemts-83
, author =	"S. G. Akl"
, title =	"A note on {Euclidean} matchings, triangulations, and spanning trees"
, journal =	"Journal of Combinatorics, Information and System Sciences"
, volume =	8
, number =	3
, year =	1983
, pages =	"169--174"
, keywords =	"geometric graphs, triangulation, minimal spanning tree, matching"
, update =	"95.05 korneenko, 95.01 mitchell, 95.01 mitchell"
}

@phdthesis{a-avats-78
, author =	"S. G. Akl"
, title =	"An analysis of various aspects of the traveling salesman problem"
, type =	"Ph.{D}. Thesis"
, school =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1978
, keywords =	"doctoral thesis"
}

@article{a-cgmap-78
, author =	"S. G. Akl"
, title =	"Comments on: {G}. {Manacher}, an application of pattern matching to a problem in geometrical complexity"
, journal =	"Inform. Process. Lett."
, volume =	7
, number =	2
, year =	1978
, pages =	86
, keywords =	"polygon similarity, affine maps"
, succeeds =	"m-apmpg-76"
}

@article{a-ccha-80
, author =	"S. G. Akl"
, title =	"Corrigendum on convex hull algorithms"
, journal =	"Inform. Process. Lett."
, volume =	10
, number =	3
, year =	1980
, pages =	168
}

@techreport{a-mtodh-78
, author =	"S. G. Akl"
, title =	"On maximal triangulations, optimal drawings and {Hamilton} cycles"
, type =	"Report"
, number =	"78-67"
, institution =	"Dept. Comput. Inform. Sci., Queen's Univ."
, address =	"Kingston, ON"
, year =	1978
}

@article{a-enono-81
, author =	"S. G. Akl"
, title =	"On the expected number of optimal and near-optimal solutions to the {Euclidean} travelling salesman problem"
, journal =	"J. Comp. Math. Appl."
, volume =	7
, number =	4
, year =	1981
, pages =	"287--288"
, update =	"95.05 korneenko"
}

@article{a-oacch-84
, author =	"S. G. Akl"
, title =	"Optimal algorithms for computing convex hulls and for sorting"
, journal =	"Computing"
, volume =	33
, year =	1984
, pages =	"1--11"
}

@incollection{a-opass-85
, author =	"S. G. Akl"
, title =	"Optimal parallel algorithms for selection, sorting and computing convex hulls"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"1--22"
}

@book{a-psa-85
, author =	"S. G. Akl"
, title =	"Parallel Sorting Algorithms"
, publisher =	"Academic Press"
, address =	"Orlando, Florida"
, year =	1985
, isbn =	"0-12-047680-0"
, update =	"98.07 bibrelex, 95.05 korneenko"
}

@book{a-dapa-89
, author =	"S. G. Akl"
, title =	"The Design and Analysis of Parallel Algorithms"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1989
, update =	"96.09 orourke"
}

@article{a-trcha-79
, author =	"S. G. Akl"
, title =	"Two remarks on a convex hull algorithm"
, journal =	"Inform. Process. Lett."
, volume =	8
, number =	2
, year =	1979
, pages =	"108--109"
, keywords =	"convex hull, counterclockwise test, angle test, geometrical primitives"
}

@book{al-pcg-93
, author =	"S. G. Akl and K. A. Lyons"
, title =	"Parallel Computational Geometry"
, publisher =	"Prentice Hall"
, year =	1993
, update =	"97.03 schwarzkopf, 93.09 held"
}

@incollection{am-acba-81
, author =	"S. G. Akl and H. Meijer"
, title =	"On the average-case of ``bucketing'' algorithms"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1981
, pages =	"381--388"
, precedes =	"am-acba-82"
, update =	"95.05 korneenko"
}

@article{am-acba-82
, author =	"S. G. Akl and H. Meijer"
, title =	"On the average-case of ``bucketing'' algorithms"
, journal =	"J. Algorithms"
, volume =	3
, number =	1
, year =	1982
, pages =	"9--13"
, keywords =	"average-case analysis, bucketing"
, succeeds =	"am-acba-81"
, update =	"95.05 korneenko"
}

@article{am-pbs-90
, author =	"S. G. Akl and J. Meijer"
, title =	"Parallel binary search"
, journal =	"IEEE Trans. Parallel Distrib. Syst."
, volume =	1
, year =	1990
, pages =	"247--250"
, update =	"98.07 bibrelex"
}

@inproceedings{aqs-cvdsp-92
, author =	"S. G. Akl and K. Qiu and I. Stojmenovi{\'c}"
, title =	"Computing the {Voronoi} diagram on the star and pancake interconnection networks"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"353--358"
, cites =	"ak-gtmsi-38, ahk-sgaan-87, ak-ftsg-87, jl-pgamc-90, lp-lppsi-77, ms-esasg-90, ps-cgi-85, aqs-dccgs-91t, l-cvdmc-85, qma-prspn-91, s-cgh-88, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{aqs-cgspn-91i
, author =	"S. G. Akl and K. Qui and I. Stojmenovi{\'c}"
, title =	"Computational geometry on the star and pancake networks"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"252--255"
, update =	"98.07 bibrelex"
}

@techreport{aqs-dccgs-91t
, author =	"S. G. Akl and K. Qui and I. Stojmenovic"
, title =	"Data Communication and Computational Geometry on the Star and Pancake Interconnection Networks"
, type =	"Technical Report"
, number =	"91-301"
, institution =	"Dept. Comp and Info Sci, Queens's University"
, month =	apr
, year =	1991
, precedes =	"aqs-cgspn-91i"
, update =	"98.07 bibrelex"
}

@article{at-fcha-78
, author =	"S. G. Akl and G. T. Toussaint"
, title =	"A fast convex hull algorithm"
, journal =	"Inform. Process. Lett."
, volume =	7
, number =	5
, year =	1978
, pages =	"219--222"
}

@article{at-aiacp-79
, author =	"S. G. Akl and G. T. Toussaint"
, title =	"Addendum to ``{An} improved algorithm to check for polygon similarity''"
, journal =	"Inform. Process. Lett."
, volume =	8
, number =	3
, year =	1979
, pages =	"157--158"
, succeeds =	"at-iacps-78"
}

@article{at-iacps-78
, author =	"S. G. Akl and G. T. Toussaint"
, title =	"An improved algorithm to check for polygon similarity"
, journal =	"Inform. Process. Lett."
, volume =	7
, year =	1978
, pages =	"127--128"
, precedes =	"at-aiacp-79"
}

@inproceedings{at-echap-78
, author =	"S. G. Akl and G. T. Toussaint"
, title =	"Efficient convex hull algorithms for pattern recognition applications"
, booktitle =	"Proc. 4th IEEE Internat. Conf. Pattern Recogn."
, site =	"Kyoto, Japan"
, year =	1978
, pages =	"483--487"
, keywords =	"convex hull, simple polygon, average-case analysis, average size of convex hull, empirical analysis, Graham's scan"
}

@article{a-adomf-87
, author =	"V. Akman"
, title =	"An algorithm for determining an opaque minimal forest of a convex polygon"
, journal =	"Inform. Process. Lett."
, volume =	24
, number =	3
, year =	1987
, pages =	"193--198"
, keywords =	"triangulation, Steiner trees, minimum spanning trees, visibility, convex polygon"
, update =	"95.05 korneenko"
}

@incollection{a-ggar-88
, author =	"V. Akman"
, title =	"Geometry and graphics applied to robotics"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"619--638"
, update =	"99.11 bibrelex"
}

@phdthesis{a-spapo-85
, author =	"V. Akman"
, title =	"Shortest Paths Avoiding Polyhedral Obstacles In 3-Dimensional {Euclidean} Space"
, school =	"Computer and Systems Engineering, Rensselaer Polytechnic Institute"
, address =	"Troy, NY"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@article{a-sp825-83
, author =	"V. Akman"
, title =	"Solution to ``problem 82-5''"
, journal =	"J. Algorithms"
, volume =	4
, year =	1983
, pages =	"184--187"
, keywords =	"triangulation, subdivision"
, update =	"95.05 korneenko"
}

@book{a-usppe-87
, author =	"V. Akman"
, title =	"Unobstructed Shortest Paths in Polyhedral Environments"
, series =	"Lecture Notes Comput. Sci."
, volume =	251
, publisher =	"Springer-Verlag"
, year =	1987
, keywords =	"book, polyhedra, motion planning"
, update =	"93.09 franklin"
}

@article{af-qis-86
, author =	"Varol Akman and Wm. Randolph Franklin"
, title =	"On the Question `Is $\sum_1^n \sqrt{a_i}\le L ?$'"
, journal =	"Bull. EATCS"
, volume =	28
, month =	feb
, year =	1986
, pages =	"16--20"
, keywords =	"motion planning, complexity theory"
, update =	"95.05 korneenko, 93.09 franklin"
}

@article{af-rrkdt-89
, author =	"Varol Akman and Wm. Randolph Franklin"
, title =	"Ray Representation for K-d Trees"
, journal =	"Pattern Recogn. Lett."
, volume =	"??"
, month =	nov
, year =	1989
, pages =	"315--320"
, keywords =	"oct trees, measure, rays"
, update =	"93.09 franklin"
}

@article{af-rorhp-89
, author =	"Varol Akman and Wm. Randolph Franklin"
, title =	"Representing Objects as Rays, or How to Pile up an Octree?"
, journal =	"Computers and Graphics"
, volume =	13
, number =	3
, year =	1989
, pages =	"373--379"
, keywords =	"oct trees, measure, polyhedra, rays"
, update =	"93.09 franklin"
}

@article{afkn-gcugd-89
, author =	"V. Akman and Wm. Randolph Franklin and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
, title =	"Geometric Computing and the Uniform Grid Data Technique"
, journal =	"Comput. Aided Design"
, volume =	21
, number =	7
, year =	1989
, pages =	"410--420"
, keywords =	"intersection, CAD, grids"
, update =	"94.05 akman, 93.09 franklin"
}

@inproceedings{a-adgct-92
, author =	"T. Akutsu"
, title =	"Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"279--288"
, update =	"94.09 smid, 93.09 milone+mitchell"
}

@article{a-dcpsd-98
, author =	"Tatsuya Akutsu"
, title =	"On Determining the Congruence of Point Sets in {$d$} Dimensions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, number =	4
, year =	1998
, pages =	"247--256"
, succeeds =	"a-dcpsh-94"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{a-dcpsh-94
, author =	"Tatsuya Akutsu"
, title =	"On Determining the Congruity of Point Sets in Higher Dimensions"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"38--46"
, precedes =	"a-dcpsd-98"
, update =	"99.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 96.05 mitchell"
}

@inproceedings{a-ssaat-94
, author =	"T. Akutsu"
, title =	"Substructures search and alignment algorithms for three-dimensional protein structures"
, booktitle =	"Proc. SIGAL-41"
, year =	1994
, pages =	"1--8"
, update =	"98.07 bibrelex"
}

@inproceedings{aahit-ssede-91
, author =	"Tatsuya Akutsu and Yasukazu Aoki and Susumi Hasegawa and Hiroshi Imai and Takeshi Tokuyama"
, title =	"The sum of smaller endpoint degree over edges of graphs and its. applications to geometric problems"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"145--148"
, cites =	"ce-oails-88, cn-asla-85, e-acg-87, egppss-acptc-88, i-nfalt-83, m-fppa2-89, os-nrdca, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{ah-alcsl-94
, author =	"T. Akutsu and M. M. Halldorsson"
, title =	"On the Approximation of Largest Common Subtrees and Largest Common Point Sets"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"405--413"
, update =	"99.11 bibrelex, 97.03 aronov, 96.05 mitchell"
}

@inproceedings{att-ddtps-97
, author =	"T. Akutsu and H. Tamaki and T. Tokuyama"
, title =	"Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Set"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"314--323"
, cites =	"aass-sdp-93, a-ssaat-94, a-dcpsh-94, amww-cssgo-88, a-oagc-87, b-ghtda-81, cghkkk-gpmem-93, cegsw-ccbac-90, ee-scpg-94, e-sdnp-46, e-sdnpe-60, ep-sepg-71, gmo-pmagp-94, h-gaaps-93, hh-gicv-92, ir-cerrp-96, keb-pht-91, m-cag-, m-dddnp-52, mp-rdcg-93, m-hmcs-96, pa-cg-95, pt-gdfcp-96, s-nadcp-84, st-epdg-83, s-cnhep-97, vs-dctds-91, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{aaa-apcbv-88
, author =	"A. J. {Al-Khalili} and D. {Al-Khalili} and K. Ammar"
, title =	"An algorithm for polygon conversion to boxes for {VLSI} layouts"
, journal =	"Integration"
, volume =	6
, year =	1988
, pages =	"291--308"
, keywords =	"polygon, decomposition, orthogon"
, update =	"95.05 korneenko"
}

@article{apru-mptdp-91
, author =	"F. {Al-Thukair} and A. Pelc and I. Rival and J. Urrutia"
, title =	"Motion planning, two-directional point representations, and ordered sets"
, journal =	"SIAM J. Discrete Math."
, volume =	4
, number =	2
, year =	1991
, pages =	"151--163"
, keywords =	"motion planning"
, update =	"95.05 korneenko"
}

@article{n-loviu-92
, author =	"V. B. Nitya el al."
, title =	"Linear octree by volume intersection using perspective silhouettes"
, journal =	"Pattern Recogn. Lett."
, volume =	"??"
, year =	1992
, pages =	"781--788"
, update =	"98.11 bibrelex"
}

@article{a-dmbds-91
, author =	"S. R. Ala"
, title =	"Design methodology of boundary data structures"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	3
, year =	1991
, pages =	"207--226"
, keywords =	"boundary data structures, optimization, symmetric data structure, winged edge, storage and access time"
}

@article{a-pabds-92
, author =	"S. R. Ala"
, title =	"Performance anomalies in boundary data structures"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	12
, number =	2
, year =	1992
, pages =	"49--58"
, update =	"95.05 korneenko"
}

@phdthesis{a-tddvd-91
, author =	"G. Albers"
, title =	"Three-Dimensional Dynamic {Voronoi} Diagrams"
, school =	"University of W{\"u}rzburg"
, month =	jul
, year =	1991
, note =	"in German"
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@article{agmr-vdmp-98
, author =	"G. Albers and Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
, title =	"Voronoi Diagrams of Moving Points"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"365--380"
, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences"
, succeeds =	"gmr-vdmpp-92, ar-vdmph-92, gmr-vdmpp-91t"
, update =	"99.11 bibrelex, 98.11 bibrelex+devillers, 98.03 mitchell"
}

@inproceedings{ar-vdmph-92
, author =	"G. Albers and T. Roos"
, title =	"Voronoi diagrams of moving points in higher dimensional spaces"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '92"
, site =	"Helsinki, Finland"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"399--409"
, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences"
, precedes =	"agmr-vdmp-98"
, update =	"99.07 bibrelex, 98.11 bibrelex+devillers, 98.03 mitchell"
}

@inproceedings{aks-eueo-99
, author =	"Susanne Albers and Klaus Kursawe and Sven Schuierer"
, title =	"Exploring Unknown Environments with Obstacles"
, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '99"
, site =	"Baltimore"
, year =	1999
, pages =	"842--843"
, update =	"99.07 bibrelex, 99.03 bibrelex"
}

@inproceedings{agmn-allag-97
, author =	"D. Alberts and C. Gutwenger and P. Mutzel and S. N{\"a}her"
, title =	"{AGD-Library}: {A} Library of Algorithms for Graph Drawing"
, booktitle =	"Proc. Workshop on Algorithm Engineering"
, nickname =	"WAE '97"
, site =	"Venice"
, month =	sep
, year =	1997
, pages =	"112--123"
, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap12.ps.gz"
, update =	"00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vismara+vahrenhold, 98.03 mitchell"
}

@inproceedings{ah-acadg-95
, author =	"D. Alberts and M. R. Henzinger"
, title =	"Average Case Analysis of Dynamic Graph Algorithms"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"312--321"
, update =	"97.03 gaertner+salinger"
}

@techreport{aho-srcp-90
, author =	"M. Albertson and R. Haas and J. O'Rourke"
, title =	"Some results on clamping a polygon"
, number =	003
, institution =	"Dept. Comput. Sci., Smith College"
, year =	1990
, keywords =	"robotics, gripping, clamping"
, precedes =	"aho-srcp-95"
, update =	"96.05 orourke, 94.01 orourke"
}

@article{aho-srcp-95
, author =	"M. Albertson and R. Haas and J. O'Rourke"
, title =	"Some results on clamping a polygon"
, journal =	"Congr. Numer."
, volume =	109
, year =	1995
, pages =	"33--50"
, keywords =	"robotics, gripping, clamping"
, succeeds =	"aho-srcp-90"
, update =	"96.05 orourke"
}

@article{ao-crs-81
, author =	"M. Albertson and C. J. O'Keefe"
, title =	"Covering regions by squares"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	2
, number =	3
, year =	1981
, pages =	"240--243"
, keywords =	"covering, orthogon"
, update =	"95.05 korneenko"
}

@book{ah-dma-88
, author =	"M. O. Albertson and J. P. Hutchinson"
, title =	"Discrete Mathematics with Algorithms"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1988
}

@inproceedings{a-hagcp-86
, author =	"A. Albrecht"
, title =	"On hardware algorithms for geometric computation problems"
, booktitle =	"Proc. IFIP 10th World Comput. Congr., Dublin 1986, Amsterdam"
, year =	1986
, pages =	"989--994"
, keywords =	"parallel computations, Delaunay triangulation, point location, diameter relative neighborhood graph"
, update =	"95.05 korneenko"
}

@inproceedings{a-ccpo-84
, author =	"A. Albrecht"
, title =	"On the circuit complexity of planar objects"
, booktitle =	"Proc. 7th IEEE Internat. Conf. Pattern Recogn."
, site =	"Montreal, PQ"
, year =	1984
, pages =	"468--470"
}

@techreport{a-vcsgc-84
, author =	"A. Albrecht"
, title =	"On the {VLSI} complexity of some geometrical computation problems"
, type =	"Report"
, number =	86
, institution =	"Sektion Math., Humboldt Univ."
, address =	"Berlin, West Germany"
, year =	1984
}

@book{az-igs-67
, author =	"A. D. Aleksandrov and U. A. Zalgaller"
, title =	"Intrinsic Geometry of Surfaces"
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1967
, update =	"98.07 orourke"
}

@inproceedings{alms-eaaws-98
, author =	"Lyudmil Aleksandrov and Mark Lanthier and Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack"
, title =	"An {$\epsilon$}-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"19--21"
, update =	"00.03 bibrelex, 98.07 bibrelex+mitchell, 98.03 mitchell"
}

@inproceedings{alms-eaaws-98b
, author =	"L. Aleksandrov and M. Lanthier and A. Maheshwari and J.-R. Sack"
, title =	"An {$\epsilon$}-Approximation Algorithm for Weighted Shortest Paths on Polyhedral Surfaces"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"11--22"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

@inproceedings{akllr-rwuts-79
, author =	"R. Aleliunas and R. M. Karp and R. J. Lipton and L. Lov{\'a}sz and C. Rackoff"
, title =	"Random walks, universal traversal sequences, and the complexity of maze problems"
, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1979
, pages =	"218--223"
}

@phdthesis{a-adral-88
, author =	"Panagiotis Alevizos"
, title =	"Arrangements de rayons: application {\`a} la reconstruction de formes planes"
, type =	"Th{\`e}se de Doctorat en Sciences"
, school =	"Uni\-ver\-sit{\'e} Paris-Sud"
, address =	"Orsay, France"
, year =	1988
, keywords =	"doctoral thesis"
, update =	"99.07 devillers, 93.09 rote, 93.05 jones"
}

@techreport{abst-oaccs-90
, author =	"Panagiotis Alevizos and V. Bistiolas and D. Sofotassios and A. Tsakalidis"
, title =	"An Optimal Algorithm for Computing the Closure of a Set of Planar Rectangles and Locked-Transaction Systems"
, type =	"Technical {Report}"
, number =	"90.11.33"
, institution =	"Univ. of Patras"
, address =	"Greece"
, year =	1990
, update =	"99.07 devillers, 93.09 milone+mitchell"
}

@incollection{abp-oabcu-89
, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
, title =	"An optimal algorithm for the boundary of a cell in a union of rays"
, booktitle =	"Geometry and Robotics"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, year =	1989
, pages =	"247--274"
, update =	"99.07 devillers, 97.11 bibrelex, 95.05 korneenko"
}

@article{abp-oabcu-90
, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
, title =	"An optimal algorithm for the boundary of a cell in a union of rays"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"573--590"
, succeeds =	"abp-oabcu-89"
, precedes =	"abp-oabcu-91"
, update =	"99.07 devillers, 95.05 korneenko"
}

@article{abp-oabcu-91
, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
, title =	"An optimal algorithm for the boundary of a cell in a union of rays: {C}orrigendum"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"292--293"
, succeeds =	"abp-oabcu-90"
, update =	"99.07 devillers, 95.09 agarwal"
}

@inproceedings{abp-bur-89
, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and F. P. Preparata"
, title =	"On the boundary of a union of rays"
, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	349
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"72--83"
, update =	"99.07 devillers"
}

@techreport{aby-oisra-89
, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
, title =	"On the order induced by a set of rays, with application to the probing of non-convex polygons"
, type =	"Manuscript"
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1989
, keywords =	"robotics, probing, shape, worst-case analysis, rays, polygons, two-dimensional"
, update =	"99.07 devillers"
}

@inproceedings{a-aorsd-98
, author =	"Panagiotis D. Alevizos"
, title =	"An Algorithm for Orthogonal Range Search in {$d\ge3$} Dimensions"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"23--25"
, cites =	"cg-fc2a-86, ht-fafnc-84, ps-cgi-85, ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{aby-ooacr-87
, author =	"Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
, title =	"An optimal {$O(n \log n)$} algorithm for contour reconstruction from rays"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"162--170"
, precedes =	"aby-nccr-90"
, cites =	"aes-solac-85, b-gstds-84, b-dscns-84, c-clps-85, cg-vippg-85, cy-sp-83, cr-tgsps-85, k-ss-73, l-egimv-85, o-uocd-86, ps-cgi-85, r-cscsl-87, rit-cscsl-86,"
, update =	"99.07 devillers, 98.03 bibrelex, 93.09 milone+mitchell"
}

@article{aby-nccr-90
, author =	"Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
, title =	"Non-convex contour reconstruction"
, journal =	"J. Symbolic Comput."
, volume =	10
, year =	1990
, pages =	"225--252"
, keywords =	"reconstruction, shape, polygon, probing"
, succeeds =	"aby-ooacr-87"
, update =	"99.07 devillers, 95.05 korneenko, 93.09 milone+mitchell"
}

@inproceedings{aby-pncp-89
, author =	"Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
, title =	"Probing non-convex polygons"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Robot. Autom."
, year =	1989
, pages =	"202--208"
, update =	"99.07 devillers"
}

@incollection{abc-gdtud-97
, author =	"J. R. Alexander and J. Beck and W. W. L. Chen"
, title =	"Geometric discrepancy theory and uniform distribution"
, chapter =	10
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"185--208"
, update =	"97.11 orourke"
}

@phdthesis{a-copmh-89
, author =	"R. Alexander"
, title =	"Construction of Optimal-Path Maps for Homogeneous-Cost-Region Path-Planning Problems"
, type =	"Ph.{D}. Thesis"
, school =	"Computer Science, U.S. Naval Postgraduate School"
, address =	"Monterey, CA"
, year =	1989
, keywords =	"doctoral thesis"
}

@article{a-gmtud-90
, author =	"R. Alexander"
, title =	"Geometric methods in the theory of uniform distribution"
, journal =	"Combinatorica"
, volume =	10
, number =	2
, year =	1990
, pages =	"115--136"
, update =	"93.09 matousek"
}

@article{a-lmtmc-85
, author =	"R. Alexander"
, title =	"Lipschitzian mappings and total mean curvature of polyhedral surfaces I"
, journal =	"Trans. Amer. Math. Soc."
, volume =	288
, number =	2
, year =	1985
, pages =	"661--678"
, update =	"98.07 bibrelex"
}

@article{a-pnmsi-91
, author =	"R. Alexander"
, title =	"Principles of a new method in the study of irregularities of distribution"
, journal =	"Invent. Math."
, volume =	103
, year =	1991
, pages =	"279--296"
, update =	"94.05 matousek"
}

@techreport{ar-gpppo-89
, author =	"R. Alexander and N. Rowe"
, title =	"Geometrical Principles for Path Planning by Optimal-Path-Map Construction for Linear and Polygonal Homogeneous-Region Terrain"
, institution =	"Computer Science, U.S. Naval Postgraduate School"
, address =	"Monterey, CA"
, year =	1989
}

@inproceedings{ar-ppopm-90
, author =	"R. Alexander and N. Rowe"
, title =	"Path Planning by Optimal-Path-Map Construction for Homogeneous-Cost Two-Dimensional Regions"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1990
}

@article{aw-aps-81
, author =	"G. L. Alexanderson and J. E. Wetzel"
, title =	"Arrangements of planes in space"
, journal =	"Discrete Math."
, volume =	34
, year =	1981
, pages =	"219--240"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@article{aw-dpo-77
, author =	"G. L. Alexanderson and J. E. Wetzel"
, title =	"Dissections of a plane oval"
, journal =	"Amer. Math. Monthly"
, volume =	84
, year =	1977
, pages =	"442--449"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@article{aw-sps-78
, author =	"G. L. Alexanderson and J. E. Wetzel"
, title =	"Simple partitions of space"
, journal =	"Math. Mag."
, volume =	51
, year =	1978
, pages =	"220--225"
, update =	"98.07 agarwal, 98.03 mitchell"
}

@article{at-eserh-87
, author =	"N. A. Alexandridis and P. D. Tsanakas"
, title =	"An encoding scheme for the efficient representation of hierarchical image structures"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"199--206"
}

@book{ah-t1-35
, author =	"P. Alexandroff and H. Hopf"
, title =	"Topologie {I}"
, series =	"Grundlehren der math"
, volume =	45
, publisher =	"Julius Springer"
, address =	"Berlin, Germany"
, year =	1935
}

@book{a-digdk-55
, author =	"A. D. Alexandrov"
, title =	"Die innere Geometrie der konvexen Fl{\"a}chen"
, publisher =	"Akademie-Verlag"
, address =	"Berlin, Germany"
, year =	1955
, update =	"97.11 bibrelex"
}

@book{a-kp-58
, author =	"A. D. Alexandrov"
, title =	"Konvexe Polyeder"
, publisher =	"Akademie-Verlag"
, address =	"Berlin, West Germany"
, year =	1958
}

@techreport{abfhz-csbp-90
, author =	"M. Alfaro and J. Brock and J. Foisy and N. Hodges and J. Zimba"
, title =	"Compound soap bubbles in the plane"
, type =	"SMALL {Geometry} {Group} {Report}"
, institution =	"Williams College"
, year =	1990
, update =	"97.11 bibrelex"
}

@article{achlkkmh-scmfe-90
, author =	"M. Alfaro and M. Conger and K. Hodges and A. Levy and R. Kochar and L. Kuklinski and Z. Mahmood and K. von Haam"
, title =	"Segments can meet in fours in energy-minimizing networks"
, journal =	"J. Und. Math."
, volume =	"??"
, year =	1990
, pages =	"9--20"
, update =	"97.11 bibrelex"
}

@article{achlkkmh-sspmn-91
, author =	"M. Alfaro and M. Conger and K. Hodges and A. Levy and R. Kochar and L. Kuklinski and Z. Mahmood and K. von Haam"
, title =	"The structure of singularities in {$\Phi$}-minimizing networks in {$R^{2}$}"
, journal =	"Pacific J. Math."
, volume =	"??"
, year =	1991
, note =	"To appear"
, update =	"97.11 bibrelex"
}

@incollection{a-csmpp-87
, author =	"P. Alfeld"
, title =	"A case study of multivariate piecewise polynomials"
, editor =	"G. Farin"
, booktitle =	"Geometric Modeling: Algorithms and New Trends"
, publisher =	"SIAM Publications"
, year =	1987
, pages =	"149--160"
, update =	"98.07 bibrelex"
}

@article{a-dcitd-84
, author =	"P. Alfeld"
, title =	"A discrete {$C^{1}$} interpolant for tetrahedral data"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, year =	1984
, pages =	"5--16"
}

@article{ab-tcit-84
, author =	"P. Alfeld and R. E. Barnhill"
, title =	"A transfinite {$C^{2}$} interpolant over triangles"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"17--39"
}

@article{as-sru3d-96
, author =	"M.-E. Algorri and F. Schmitt"
, title =	"Surface Reconstruction from Unstructured 3D Data"
, journal =	"Comput. Graph. Forum"
, volume =	15
, number =	1
, month =	mar
, year =	1996
, pages =	"47--60"
, update =	"96.05 held"
}

@inproceedings{aknw-pmccp-93
, author =	"F. Alizadeh and R. M. Karp and L. A. Newberg and D. K. Weisser"
, title =	"Physical Mapping of Chromosomes: {A} Combinatorial Problem in Molecular Biology"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"371--381"
, update =	"93.05 smid"
}

@article{ad-dessl-95
, author =	"S. Allen and D. Dutta"
, title =	"Determination and evaluation of support structures in layered manufacturing"
, journal =	"Journal of Design and Manufacturing"
, volume =	5
, year =	1995
, pages =	"153--162"
, update =	"97.11 smid"
}

@inproceedings{ad-wtclm-97
, author =	"S. Allen and D. Dutta"
, title =	"Wall thickness control in layered manufacturing"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"240--247"
, cites =	"ad-dessl-95, kd-asplm-96, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{ad-wtclm-98
, author =	"Seth Allen and Debasish Dutta"
, title =	"Wall thickness control in layered manufacturing for surfaces with closed slices"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"223--238"
, succeeds =	"ad-wtclm-97"
, update =	"98.11 devillers"
}

@article{a-ssag-46
, author =	"C. B. Allendoerfer"
, title =	"``{Slope}'' in solid analytic geometry"
, journal =	"Amer. Math. Monthly"
, volume =	53
, year =	1946
, pages =	"241--247"
}

@article{ag-aplai-87
, author =	"E. Allgower and S. Gnutzmann"
, title =	"An algorithm for piecewise linear approximation of an implicitly defined two-dimensional surfaces"
, journal =	"SIAM J. Numer. Anal."
, volume =	24
, year =	1987
, pages =	"452--469"
, keywords =	"surface-approximation"
, update =	"95.05 agarwal"
}

@article{as-cvp-86
, author =	"F. L. Allgower and P. H. Schmidt"
, title =	"Computing volumes of polyhedra"
, journal =	"Math. Comput."
, volume =	46
, number =	173
, year =	1986
, pages =	"171--174"
, keywords =	"volume"
, update =	"95.05 korneenko"
}

@inproceedings{ad-pcltt-01
, author =	"Pierre Alliez and Mathieu Desbrun"
, title =	"Progressive Compression for Lossless Transmission of Triangles Meshes"
, booktitle =	"Siggraph 2001"
, year =	2001
, update =	"01.07 devillers"
}

@inproceedings{ads-rdppw-98
, author =	"Pierre Alliez and Olivier Devillers and Jack Snoeyink"
, title =	"Removing Degeneracies by Perturbing the Problem or the World"
, booktitle =	"Proc. 10th Canad. Conf. Comput. Geom."
, year =	1998
, url =	"http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-alliez-removing.ps.gz"
, precedes =	"ads-rdppw-00"
, cites =	"ecs-ephgd-97, em-sstcd-90, kmm-ricav-93a, ms-getcc-88, y-gctsp-90, ZZZ"
, update =	"00.03 devillers, 99.11 bibrelex, 99.07 devillers, 98.11 devillers"
, annote =	"extended abstract"
}

@article{ads-rdppw-00
, author =	"Pierre Alliez and Olivier Devillers and Jack Snoeyink"
, title =	"Removing Degeneracies by Perturbing the Problem or the World"
, journal =	"Reliable Computing"
, volume =	6
, year =	2000
, pages =	"61--79"
, note =	"Special Issue on Computational Geometry, to appear"
, url =	"http://www-sop.inria.fr/prisme/biblio/"
, succeeds =	"ads-rdppw-98"
, update =	"00.03 devillers"
, abstract =	"We describe two problem-specific approaches to remove geometric degeneracies that we call {\it perturbing the problem} and {\it perturbing the world}. Using as our primary examples 2-d and 3-d Delaunay triangulation with Euclidean and polygonal metrics, we show that these approaches lead to relatively simple and efficient perturbations of the points that do not depend on a fixed ordering or index. Thus, they produce canonical output, which is important for producing test suites and verifiers for randomized or dynamic geometric algorithms."
}

@article{an-cchsp-87
, author =	"D. C. S. Allison and M. T. Noga"
, title =	"Computing the convex hull of a set of points"
, journal =	"Computer Physics Commun."
, volume =	43
, number =	3
, year =	1987
, pages =	"381--386"
, keywords =	"convex hull, points"
, update =	"95.05 korneenko"
}

@article{an-sptch-84
, author =	"D. C. S. Allison and M. T. Noga"
, title =	"Some performance tests of convex hull algorithms"
, journal =	"BIT"
, volume =	24
, year =	1984
, pages =	"2--13"
}

@article{an-ltsp-84
, author =	"D. C. S. Allison and M. T. Noga"
, title =	"The {$L_{1}$} {Traveling} {Salesman} {Problem}"
, journal =	"Inform. Process. Lett."
, volume =	18
, number =	4
, year =	1984
, pages =	"195--199"
, update =	"95.05 korneenko"
}

@book{ag-hpc-90
, author =	"G. S. Almasi and A. Gottlieb"
, title =	"Highly parallel computing"
, publisher =	"Benjamin/Cummings"
, address =	"Redwood City, California"
, year =	1990
, update =	"98.07 bibrelex"
}

@article{apk-evaag-89
, author =	"H. M. Alnuweiri and V. K. {Prasanna Kumar}"
, title =	"An efficient {VLSI} architecture with applications to geometric problems"
, journal =	"Parallel Comput."
, volume =	12
, number =	1
, year =	1989
, pages =	"71--94"
, keywords =	"parallel computations, convex hull, intersection, diameter, proximity"
, update =	"95.05 korneenko"
}

@inproceedings{apk-ogafs-88
, author =	"H. M. Alnuweiri and V. K. {Prasanna Kumar}"
, title =	"Optimal geometric algorithms on fixed-size linear arrays and scan-line ..."
, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
, year =	1988
, pages =	"931--936"
, keywords =	"parallel computations, intersection, distance"
, update =	"95.05 korneenko"
}

@article{awb-av-88
, author =	"J. Aloimonos and I. Weiss and A. Bandyopadhyay"
, title =	"Active vision"
, journal =	"Internat. J. Comput. Vision"
, volume =	2
, year =	1988
, pages =	"333--356"
, update =	"98.07 bibrelex"
}

@article{a-egesr-86
, author =	"N. Alon"
, title =	"Eigenvalues, geometric expanders, sorting in rounds and {Ramsey} theory"
, journal =	"Combinatorica"
, volume =	6
, year =	1986
, pages =	"207--219"
, update =	"98.03 bibrelex"
}

@inproceedings{a-esrsl-85
, author =	"N. Alon"
, title =	"Expanders, sorting in rounds and superconcentrators of limited depth"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"98--102"
, update =	"98.03 bibrelex"
}

@incollection{a-tha-95
, author =	"N. Alon"
, title =	"Tools from Higher Algebra"
, editor =	"R. L. Graham and M. Gr{\" o}tschel and L. Lov{\' a}sz"
, booktitle =	"Handbook of Combinatorics"
, publisher =	"Elsevier"
, address =	"Amsterdam"
, year =	1995
, pages =	"1749--1783"
, update =	"98.03 agarwal"
}

@inproceedings{aa-csstm-92
, author =	"N. Alon and Y. Azar"
, title =	"Comparison-sorting and selecting in totally monotone matrices"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"403--408"
}

@article{aa-fam-89
, author =	"N. Alon and Y. Azar"
, title =	"Finding the approximate maximum"
, journal =	"SIAM J. Comput."
, volume =	18
, number =	2
, year =	1989
, pages =	"258--267"
, update =	"95.05 korneenko"
}

@inproceedings{aa-olste-92
, author =	"N. Alon and Y. Azar"
, title =	"On-line {Steiner} trees in the {Euclidean} plane"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"337--343"
, keywords =	"Steiner tree, points, on-line algorithms, competitive algorithms"
, precedes =	"aa-olste-93"
, cites =	"bm-tspkd-, bs-athet-80, cv-crcns-91, iw-dstp-91, gj-cigtn-79, m-gpinn-87, n-ps-82, rsl-ashts-77, st-aelup-85, w-spns-87, y-pctum-77, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 95.05 korneenko"
}

@article{aa-olste-93
, author =	"N. Alon and Y. Azar"
, title =	"On-line {Steiner} trees in the {Euclidean} plane"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"113--121"
, keywords =	"Steiner tree, points, on-line algorithms, competitive algorithms"
, succeeds =	"aa-olste-92"
, cites =	"bm-tspkd-, bs-athet-80, cv-crcns-91, iw-dstp-91, gj-cigtn-79, m-gpinn-87, n-ps-82, rsl-ashts-77, st-aelup-85, w-spns-87, y-pctum-77, ZZZ"
, update =	"98.03 mitchell"
}

@inproceedings{aa-pcaap-88
, author =	"N. Alon and Y. Azar"
, title =	"Parallel Comparison Algorithms for Approximation Problems"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"194--203"
, update =	"98.03 bibrelex"
}

@article{abfk-pswen-92
, author =	"N. Alon and I. B{\'a}r{\'a}ny and Z. F{\"u}redi and D. Kleitman"
, title =	"Point selections and weak $\varepsilon$-nets for convex hulls"
, journal =	"Combin., Probab. Comput."
, volume =	1
, number =	3
, year =	1992
, pages =	"189--200"
, update =	"94.05 matousek"
}

@techreport{abfk-pswen-91
, author =	"N. Alon and I. B{\'a}r{\'a}ny and Z. F{\"u}redi and D. J. Kleitman"
, title =	"Point selections and weak $\varepsilon$-nets for convex hulls"
, type =	"Manuscript"
, institution =	"??"
, year =	1991
, update =	"98.03 bibrelex"
}

@article{ae-degg-89
, author =	"N. Alon and P. Erd{\H o}s"
, title =	"Disjoint edges in geometric graphs"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"287--290"
}

@article{afk-sppsb-85
, author =	"N. Alon and Z. F{\"u}redi and M. Katchalski"
, title =	"Separating pairs of points by standard boxes"
, journal =	"European J. Combin."
, volume =	6
, number =	3
, year =	1985
, pages =	"205--210"
, update =	"95.05 korneenko"
}

@article{aghp-scakw-92
, author =	"N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta"
, title =	"Simple construction of almost $k$-wise independent random variables"
, journal =	"Random Structures and Algorithms"
, volume =	3
, year =	1992
, pages =	"289--304"
, update =	"95.01 matousek"
}

@article{ag-nssfs-86
, author =	"N. Alon and E. Gy{\H o}ri"
, title =	"The number of small semispaces of a finite set of points in the plane"
, journal =	"J. Combin. Theory Ser. A"
, volume =	41
, year =	1986
, pages =	"154--157"
, update =	"95.09 agarwal, 94.09 bernal"
}

@inproceedings{ahw-pgers-87
, author =	"N. Alon and D. Haussler and Emo Welzl"
, title =	"Partitioning and geometric embedding of range spaces of finite {Vapnik}-{Chervonenkis} dimension"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"331--340"
, cites =	"a-esrsl-85, a-egesr-86, f-lbcso-81, h-ct-67, hw-ensrq-87, l-cpe-79, s-dfs-72, vc-ucrfe-71, w-pr-82, yy-gaddg-85, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{ak-spubt-85
, author =	"N. Alon and G. Kalai"
, title =	"A simple proof of the upper bound theorem"
, journal =	"European J. Combin."
, volume =	6
, year =	1985
, pages =	"211--214"
, update =	"97.11 bibrelex"
}

@article{ak-bpn-95
, author =	"N. Alon and G. Kalai"
, title =	"Bounding the piercing number"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"245--256"
, update =	"95.09 wenger"
}

@article{akp-cddsl-89
, author =	"N. Alon and M. Katchalski and W. R. Pulleyblank"
, title =	"Cutting disjoint disks by straight lines"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"239--243"
}

@article{akp-mscpr-89
, author =	"N. Alon and M. Katchalski and W. R. Pulleyblank"
, title =	"The maximum size of a convex polygon in a restricted set of points in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"245--251"
}

@article{ak-pcs-92a
, author =	"N. Alon and D. Kleitman"
, title =	"Piercing convex sets and the {Hadwiger}--{Debrunner} $(p,q)$-problem"
, journal =	"Adv. Math."
, volume =	96
, number =	1
, year =	1992
, pages =	"103--112"
, succeeds =	"ak-pcs-92i"
, update =	"95.09 wenger"
}

@article{ak-csspr-86
, author =	"N. Alon and D. J. Kleitman"
, title =	"Covering a square by small perimeter rectangles"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"1--7"
}

@inproceedings{ak-pcs-92i
, author =	"N. Alon and D. J. Kleitman"
, title =	"Piercing convex sets"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"157--160"
, cites =	"abfk-pswen-92, ak-spubt-85, b-gct-82, dgk-htir-63, d-cp-72, e-ubtfc-85, e-hrctt-93, f-ipcfc-74, g-iss-59, g-lcg-74, hd-uevzh-57, hdk-cgp-64, h-umkkm-23, kl-pgr-79, k-ipcs-84, s-tlip-86, t-grt-66, w-uekgf-65, w-dcnfc-75, w-uhgs-85, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@inproceedings{am-plpfd-90
, author =	"N. Alon and N. Megiddo"
, title =	"Parallel linear programming in fixed dimension almost surely in constant time"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"574--582"
}

@article{ap-ieggs-86
, author =	"N. Alon and M. A. Perles"
, title =	"On the intersection of edges of a geometric graph by straight lines"
, journal =	"Discrete Math."
, volume =	60
, year =	1986
, pages =	"75--90"
, keywords =	"intersection, geometric graphs"
, update =	"95.05 korneenko"
}

@inproceedings{ars-lnccp-93
, author =	"N. Alon and S. Rajagopalan and Subhash Suri"
, title =	"Long non-crossing configurations in the plane"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"257--263"
, cites =	"aa-dsgh-89, gj-cigtn-79, hs-asdch-92, kln-ncstl-91, l-pstp-83, llrs-tsp-85, pss-ubnpk-89, p-etspi-77, r-cscsl-87,"
, update =	"98.03 bibrelex+mitchell, 93.09 jones"
}

@techreport{as-opaol-87
, author =	"N. Alon and B. Schieber"
, title =	"Optimal preprocessing for answering on-line product queries"
, number =	"TR 71/87"
, institution =	"The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University"
, year =	1987
, update =	"98.03 bibrelex"
}

@article{ast-ps-94
, author =	"N. Alon and P. Seymour and R. Thomas"
, title =	"Planar separators"
, journal =	"SIAM J. Discrete Math."
, volume =	2
, number =	7
, year =	1994
, pages =	"184--193"
, update =	"97.11 bibrelex"
}

@book{as-pm-92
, author =	"N. Alon and J. Spencer"
, title =	"The {P}robabilistic {M}ethod"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1992
, update =	"99.11 bibrelex, 98.11 bibrelex, 97.03 agarwal, 94.01 matousek, 93.09 matousek"
}

@article{agr-lmulb-92
, author =	"Laurent Alonso and Arthur S. Goldstein and Edward M. Reingold"
, title =	"'Lion and Man': Upper and Lower Bounds"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"447--452"
, update =	"98.03 mitchell"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@inproceedings{aht-dismr-89
, author =	"P. G. Alourdas and G. R. Hottel and S. T. Tuohy"
, title =	"A Design and Interrogation System for Modeling with Rational Splines"
, booktitle =	"Proc. 9th International Symposium on Offshore Mechanics and Arctic Engineering"
, year =	1990
, pages =	"555--565"
, update =	"95.09 mitchell, 95.05 abrams"
}

@inproceedings{acf-umh-90
, author =	"B. Alpern and L. Carter and E. Feig"
, title =	"Uniform Memory Hierarchies"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"600--608"
, update =	"96.09 orourke"
}

@inproceedings{ahrsz-iecc-90
, author =	"B. Alpern and R. Hoover and B. Rosen and P. Sweeney and F. K. Zadeck"
, title =	"Incremental Evaluation of Computational Circuits"
, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"32--42"
, keywords =	"dynamic algorithm"
, update =	"96.01 tamassia"
}

@book{a-aac-78
, title =	"Algorithmic Aspects of Combinatorics"
, editor =	"Brian Alspach"
, series =	"Ann. Discrete Math."
, volume =	2
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	1978
, update =	"01.04 icking, 97.11 bibrelex"
}

@article{a-fshpi-96
, author =	"M. H. Alsuwaiyel"
, title =	"Finding a shortest {Hamiltonian} path inside a simple polygon"
, journal =	"Inform. Process. Lett."
, volume =	59
, year =	1996
, pages =	"207--210"
, update =	"98.11 devillers, 97.03 smid"
}

@article{a-tasdp-97
, author =	"M. H. Alsuwaiyel"
, title =	"Two Algorithms for the Sum of Diameters Problem and a Related Problem"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"493--508"
, update =	"98.11 devillers"
}

@article{al-famlv-95
, author =	"M. H. Alsuwaiyel and D. T. Lee"
, title =	"Finding an approximate minimum-link visibility path inside a simple polygon"
, journal =	"Inform. Process. Lett."
, volume =	55
, number =	2
, year =	1995
, pages =	"75--79"
, keywords =	"simple polygon, link distance, watchman routes, visibility, approximation, set cover"
, update =	"95.09 mitchell"
, annote =	"gives a correction to an approximation result claimed in al-mlvpi-93"
}

@article{al-mlvpi-93
, author =	"M. H. Alsuwaiyel and D. T. Lee"
, title =	"Minimal link visibility paths inside a simple polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, number =	1
, year =	1993
, pages =	"1--25"
, keywords =	"simple polygon, link distance, watchman route, NP-hardness, approximation, set cover"
, update =	"95.09 mitchell, 95.05 korneenko"
, annote =	"see al-famlv-95 for correction to the approximation algorithm result"
}

@article{a-dprm-62
, author =	"F. L. Alt"
, title =	"Digital pattern recognition by moments"
, journal =	"J. ACM"
, volume =	9
, year =	1962
, pages =	"240--258"
}

@article{a-cccaf-88
, author =	"H. Alt"
, title =	"Comparing the combinational complexities of arithmetic functions"
, journal =	"J. ACM"
, volume =	35
, year =	1988
, pages =	"447--460"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{a-gmpsm-97
, author =	"Helmut Alt"
, title =	"Geometric Methods in Pattern and Shape Matching"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	42
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{aar-msrp-94
, author =	"H. Alt and O. Aichholzer and G{\"u}nter Rote"
, title =	"Matching Shapes with a Reference Point"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"85--92"
, succeeds =	"aar-msrp-94c"
, precedes =	"aar-msrp-97"
, cites =	"abb-amps-91, ag-chdhd-, ast-apsgo-92, b-azede-90, cghkkk-gpmem-93, cks-ocpad-94t, g-cp-67, h-gaaps-93, hs-adaps-92, hk-cmhdp-90, hks-uevsi-93, hkr-ciuhd-93, s-spcp-66, s-kkk-72, ZZZ"
, update =	"00.11 smid, 00.07 icking, 98.03 bibrelex+mitchell, 97.03 rote, 94.09 jones, 94.01 jones"
}

@inproceedings{aar-msrp-94c
, author =	"Helmut Alt and Oswin Aichholzer and G{\"u}nter Rote"
, title =	"Matching Shapes with a Reference Point"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"81--84"
, precedes =	"aar-msrp-94"
, update =	"00.11 smid, 00.07 icking"
}

@article{aar-msrp-97
, author =	"H. Alt and O. Aichholzer and G{\"u}nter Rote"
, title =	"Matching Shapes with a Reference Point"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"349--363"
, keywords =	"shape matching, Steiner point"
, succeeds =	"aar-msrp-94"
, update =	"98.07 rote, 98.03 mitchell, 97.03 rote"
, abstract =	"For two given point sets, we present a very simple
		(almost trivial) algorithm to translate one set so that the
		Hausdorff distance between the two sets is not larger than a constant
		factor times the minimum Hausdorff
		distance which can be achieved in this way. The algorithm just matches
		the so-called Steiner points of the two sets.
		The focus of our paper is the general study of reference points (like
		the Steiner point) and their properties with
		respect to shape matching."
}

@inproceedings{ab-akp-90
, author =	"Helmut Alt and Bernd Behrends"
, title =	"{Approximative} {Kongruenz} von {Polygonen}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	4
, update =	"00.03 bibrelex"
}

@inproceedings{abb-amps-91
, author =	"H. Alt and B. Behrends and J. Bl{\"o}mer"
, title =	"Approximate matching of polygonal shapes"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"186--193"
, keywords =	"matching, polygons, approximation"
, precedes =	"abb-amps-95"
, cites =	"abgw-acp-90, akmsw-mpnrc-91, amww-cssgo-88, ass-sulbl-89, a-ltahd-83, a-dcg-83, epss-lebfi-87, f-savd-87, g-nmccd-91, hk-cmhdp-90, m-tgis-82, s-udbde-88, y-oavds-87, ZZZ"
, update =	"97.11 bibrelex, 95.09 mitchell"
}

@article{abb-amps-95
, author =	"H. Alt and B. Behrends and J. Bl{\"o}mer"
, title =	"Approximate matching of polygonal shapes"
, editor =	"Janos Csirik and Horst Bunke"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"251--266"
, keywords =	"matching, shape recognition, vision"
, succeeds =	"abb-amps-91"
, update =	"97.03 agarwal+smid, 95.09 mitchell"
}

@techreport{abgw-acp-
, author =	"H. Alt and J. Bl{\"o}mer and M. Godau and H. Wagener"
, title =	"Approximation of convex polygons"
, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berlin"
, precedes =	"abgw-acp-90"
, update =	"94.05 franciosa, 93.09 milone+mitchell"
}

@inproceedings{abgw-acp-90
, author =	"H. Alt and J. Bl{\"o}mer and M. Godau and H. Wagener"
, title =	"Approximation of convex polygons"
, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	443
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"703--716"
, succeeds =	"abgw-acp-"
, update =	"94.05 franciosa"
}

@article{abm-cmcmb-91
, author =	"H. Alt and N. Blum and K. Mehlhorn"
, title =	"Computing a Maximum Cardinality Matching of a Bipartite Graph in Time ${O}(n^{1.5} \sqrt{m/\log n})$"
, journal =	"Inform. Process. Lett."
, volume =	37
, year =	1991
, pages =	"237--240"
, update =	"97.03 gaertner+salinger"
}

@book{acs-cg-95
, title =	"Computational Geometry"
, editor =	"Helmut Alt and Bernard Chazelle and Raimund Seidel"
, series =	"Dagstuhl-Seminar-Report"
, volume =	109
, publisher =	"Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
, address =	"Schloss Dagstuhl, Germany"
, year =	1995
, url =	"http://www.dagstuhl.de/DATA/Participants/9511.html"
, update =	"01.04 icking"
}

@book{acw-cg-93
, title =	"Computational Geometry"
, editor =	"Helmut Alt and Bernard Chazelle and Emo Welzl"
, series =	"Dagstuhl-Seminar-Report"
, volume =	59
, publisher =	"Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
, address =	"Schloss Dagstuhl, Germany"
, year =	1993
, url =	"http://www.dagstuhl.de/DATA/Seminars/93/"
, update =	"01.07 icking"
}

@inproceedings{afhn-psfks-98
, author =	"Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy"
, title =	"Point-Sets with few {$k$}-Sets"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"27--28"
, note =	"To appear in Proc. 14th ACM Sympos. Comput. Geom."
, update =	"00.03 bibrelex, 98.07 agarwal+bibrelex, 98.03 agarwal"
}

@inproceedings{afkmnsu-ampcb-90
, author =	"H. Alt and R. Fleischer and M. Kaufmann and K. Mehlhorn and S. N{\"a}her and S. Schirra and C. Uhrig"
, title =	"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"281--289"
, cites =	"egs-oplms-86, gss-gmppt-88, klps-ujrcf-86, ks-eapcf-85, ks-ampsc-88, lw-apcfp-79, ls-ipjc-85, ls-pptmc-87, s-dsstg-88, ZZZ"
, update =	"97.11 bibrelex"
}

@article{afkmnsu-ampcb-92
, author =	"H. Alt and R. Fleischer and M. Kaufmann and K. Mehlhorn and S. N{\"a}her and S. Schirra and C. Uhrig"
, title =	"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"391--406"
, update =	"95.05 agarwal"
}

@inproceedings{afrw-mcsrs-96
, author =	"H. Alt and U. Fuchs and G{\"u}nter Rote and G. Weber"
, title =	"Matching convex shapes with respect to the symmetric difference"
, booktitle =	"Algorithms --- Proc. 4th Annu. European Sympos. Algorithms"
, nickname =	"ESA'96"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"320--333"
, precedes =	"afrw-mcsrs-98"
, update =	"98.07 rote"
}

@article{afrw-mcsrs-98
, author =	"H. Alt and U. Fuchs and G. Rote and G. Weber"
, title =	"Matching convex shapes with respect to the symmetric difference"
, journal =	"Algorithmica"
, volume =	21
, year =	1998
, pages =	"89--103"
, succeeds =	"afrw-mcsrs-96"
, cites =	"bdkst-cmotc-96"
, update =	"98.07 rote"
, abstract =	"This paper deals with questions from convex geometry related
                 to shape matching.  In particular, we consider the problem of
                 moving one convex figure over another, minimizing the area of
                 their symmetric difference.  We show that if we just let the
                 two centers of gravity coincide, the resulting symmetric
                 difference is within a factor of 11/3 of the optimum.  This
                 leads to efficient approximate matching algorithms for convex
                 figures."
}

@inproceedings{afrw-rpsm-96
, author =	"Helmut Alt and Ulrich Fuchs and G{\"u}nter Rote and Gerald Weber"
, title =	"Reference Points for Shape Matching"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"73--74"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{agm-nscrc-92
, author =	"H. Alt and V. Geffert and K. Mehlhorn"
, title =	"Nondeterministic Space Complexity for the Recognition of Context-Free Languages"
, journal =	"Inform. Process. Lett."
, volume =	42
, year =	1992
, pages =	"25--27"
, update =	"97.03 gaertner+salinger"
}

@article{ag-cfdbt-95
, author =	"H. Alt and M. Godau"
, title =	"Computing the {Fr\'echet} distance between two polygonal curves"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"75--91"
, keywords =	"Frechet distance, shape analysis, resemblance of curves, computational morphology"
, succeeds =	"ag-mrpc-92"
, update =	"96.09 devillers"
}

@unpublished{ag-chdhd-
, author =	"H. Alt and M. Godau"
, title =	"Computing the {Hausdorff}-distance in higher dimensions"
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@inproceedings{ag-mrpc-92
, author =	"H. Alt and M. Godau"
, title =	"Measuring the resemblance of polygonal curves"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"102--109"
, precedes =	"ag-cfdbt-95"
, cites =	"abb-amps-91, abgw-acp-90, c-pms-88, clr-ia-90, e-cva-85, f-sqpdc-06, g-nmccd-91, g-fmpaa-91, gpy-mclmr-89, m-apcad-83, n-ccpwl-91, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@inproceedings{ag-mamrc-91
, author =	"H. Alt and M. Godau"
, title =	"Metrics and Algorithms for Measuring the Resemblance of Curves"
, booktitle =	"Proc. 13th IMACS World Congress on Computation and Applied Mathematics"
, year =	1991
, pages =	"135--136"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{agw-u3dvr-96
, author =	"H. Alt and M. Godau and S. Whitesides"
, title =	"Universal 3-Dimensional Visibility Representations for Graphs"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"8--19"
, keywords =	"graph drawing, visibility, 3D"
, precedes =	"agw-u3dvr-98"
, update =	"99.11 bibrelex, 98.11 devillers+patrignani, 96.09 tamassia"
}

@article{agw-u3dvr-98
, author =	"Helmut Alt and Michael Godau and Sue Whitesides"
, title =	"Universal $3$-Dimensional Visibility Representations for Graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, year =	1998
, pages =	"111--125"
, note =	"(special issue on Graph Drawing, edited by G.~{Di Battista} and R.~Tamassia)"
, keywords =	"graph drawing, visibility, 3D"
, succeeds =	"agw-u3dvr-96"
, update =	"99.11 bibrelex, 98.11 devillers+patrignani"
}

@incollection{ag-dgsmi-00
, author =	"Helmut Alt and Leonidas J. Guibas"
, title =	"Discrete Geometric Shapes: {Matching}, Interpolation, and Approximation"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"121--153"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 96.09 orourke"
, annote =	"Chapter 3 of su-hcg-00"
}

@inproceedings{ah-elnns-99
, author =	"Helmut Alt and Ulrich Hoffmann"
, title =	"Exact {$L_\infty$} Nearest Neighbor Search in High Dimensions"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"91--92"
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{ahs-cliir-95
, author =	"Helmut Alt and David Hsu and Jack Snoeyink"
, title =	"Computing the Largest Inscribed Isothetic Rectangle"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"67--72"
, update =	"95.09 jones"
}

@inproceedings{ak-msrsd
, author =	"Helmut Alt and Christian Knauer"
, title =	"Matching Shape with Respect to the Symmetric Difference"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"195--197"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{akw-bfdhd-01
, author =	"Helmut Alt and Christian Knauer and Carola Wenk"
, title =	"Bounding the {Fr{\'e}chet} Distance by the {Hausdorff} Distance"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"166--169"
, update =	"01.04 icking"
}

@article{am-sst-85
, author =	"H. Alt and K. Mehlhorn"
, title =	"Searching semisorted tables"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"840--848"
}

@article{amm-cpmr-81
, author =	"H. Alt and K. Mehlhorn and J. I. Munro"
, title =	"On the complexity of partial match retrieval"
, journal =	"Mathematical Foundations of Computer Science"
, volume =	"??"
, year =	1981
, pages =	"156--161"
, update =	"97.11 bibrelex"
}

@article{amm-pmrid-84
, author =	"H. Alt and K. Mehlhorn and J. I. Munro"
, title =	"Partial match retrieval in implicit data structures"
, journal =	"Inform. Process. Lett."
, volume =	19
, year =	1984
, pages =	"61--65"
}

@inproceedings{amww-cssgo-87
, author =	"H. Alt and K. Mehlhorn and H. Wagener and Emo Welzl"
, title =	"Congruence, similarity and symmetries of geometric objects"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"308--315"
, precedes =	"amww-cssgo-88"
, cites =	"ahu-daca-74, a-cspf-84, a-sd-85, a-oagc-83, h-oafsp-86, m-dsa-84, m-tgis-82, m-ltalp-83, ps-cgi-85, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{amww-cssgo-88
, author =	"H. Alt and K. Mehlhorn and H. Wagener and Emo Welzl"
, title =	"Congruence, similarity and symmetries of geometric objects"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"237--256"
, succeeds =	"amww-cssgo-87"
, update =	"98.03 mitchell"
}

@inproceedings{as-vdco-95
, author =	"Helmut Alt and Otfried Schwarzkopf"
, title =	"The {Voronoi} diagram of curved objects"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"89--97"
, url =	"http://www.cs.uu.nl/~otfried/ps/as-vdco-95.ps.gz"
, keywords =	"randomized incremental algorithm"
, cites =	"a-vdsfg-91, bdsty-arsol-92, c-bvdcp-86, cs-arscg-89, k-avdta-88, k-cavd-89, kmm-ricav-93a, kw-vdbgm-88, ls-pptmc-87, mp-fitcp-78, m-fppa1-88, oy-rmpmd-85, obs-stcav-92, ps-cgi-85, s-barga-93, s-dg-69, y-oavds-87, ya-mpce-89, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell+schwarzkopf"
}

@article{aw-vgoas-88
, author =	"H. Alt and Emo Welzl"
, title =	"Visibility graphs and obstacle-avoiding shortest paths"
, journal =	"Zeitschrift f{\"u}r Operations Research"
, volume =	32
, year =	1988
, pages =	"145--164"
, update =	"98.03 mitchell"
}

@inproceedings{aww-plabc-97
, author =	"H. Alt and E. Welzl and B. Wolfers"
, title =	"Piecewise Linear Approximation of B{\'e}zier-Curves"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"433--435"
, cites =	"ag-cfdbt-95, b-pgs-78, f-cscag-93, fdfh-cgpp-90, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@article{ay-aampt1-90
, author =	"H. Alt and C. K. Yap"
, title =	"Algorithmic aspect of motion planning: a tutorial, part 1"
, journal =	"Algorithms Rev."
, volume =	1
, number =	1
, year =	1990
, pages =	"43--60"
, keywords =	"motion planning, robotics, computational geometry, Voronoi diagrams, computational algebra"
, update =	"93.09 jones"
}

@article{ay-aampt2-90
, author =	"H. Alt and C. K. Yap"
, title =	"Algorithmic aspect of motion planning: a tutorial, part 2"
, journal =	"Algorithms Rev."
, volume =	1
, number =	2
, year =	1990
, pages =	"61--77"
, keywords =	"motion planning, robotics, computational geometry, Voronoi diagrams, computational algebra"
, update =	"93.09 jones"
}

@inproceedings{ay-aart-89
, author =	"H. Alt and C. K. Yap"
, title =	"Algorithmic Aspects of Robotics: a Tutorial"
, booktitle =	"Proceedings SOFSEM `89"
, year =	1989
, pages =	"7--40"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{am-pttbc-00
, author =	"E. Althaus and K. Mehlhorn"
, title =	"Polynomial time {TSP}-based curve reconstruction"
, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '00"
, month =	jan
, year =	2000
, pages =	"686--695"
, update =	"00.03 orourke"
}

@inproceedings{amns-ecr-00
, author =	"E. Althaus and K. Mehlhorn and S. N{\"a}her and S. Schirra"
, title =	"Experiments on curve reconstruction"
, booktitle =	"Proc. 2nd Workshop Algorithm Eng. Exper."
, nickname =	"ALENEX '00"
, month =	jan
, year =	2000
, pages =	"103--114"
, update =	"00.03 orourke"
}

@article{a-aevcp-75
, author =	"W. Altherr"
, title =	"An algorithm for enumerating the vertices of a convex polyhedron"
, journal =	"Computing"
, volume =	15
, year =	1975
, pages =	"181--193"
}

@article{a-orfms-88
, author =	"I. Alth{\"o}fer"
, title =	"On optimal realizations of finite metric spaces by graphs"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"103--122"
}

@inproceedings{addj-gsswg-90
, author =	"I. Alth{\"o}fer and G. Das and D. Dobkin and D. Joseph"
, title =	"Generating Sparse Spanners for Weighted Graphs"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, year =	1990
, pages =	"26--37"
, update =	"98.03 smid, 97.11 bibrelex"
}

@article{addjs-sswg-93
, author =	"I. Alth{\"o}fer and G. Das and D. P. Dobkin and D. Joseph and J. Soares"
, title =	"On sparse spanners of weighted graphs"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"81--100"
, update =	"94.05 smid"
}

@incollection{achllstu-mairp-81
, author =	"M. D. Altschuler and Y. Censor and G. T. Hermann and A. Lent and R. M. Lewitt and S. N. Srihari and H. Tuy and J. K. Udupa"
, title =	"Mathematical aspects of image reconstruction from projections"
, editor =	"L. N. Kanal and A. Rosenfeld"
, booktitle =	"Progress in pattern recognition"
, volume =	1
, publisher =	"North-Holland"
, address =	"New-York, NY"
, year =	1981
, pages =	"323--375"
, update =	"97.11 bibrelex"
}

@article{ab-wnpm2-86
, author =	"A. Altshuler and U. Brehm"
, title =	"The weakly neighborly polyhedral maps on the $2$-manifold with {Euler} characteristic $-1$"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"355--369"
}

@inproceedings{as-dchan-99
, author =	"S. Aluru and F. E. Sevilgen"
, title =	"Dynamic compressed hyperoctrees with application to the {N}-body problem"
, booktitle =	"Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1738
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"21--33"
, update =	"00.03 smid"
}

@article{a-rtc-84
, author =	"J. Amanatides"
, title =	"Ray Tracing with Cones"
, journal =	"Comput. Graph."
, volume =	18
, number =	3
, year =	1984
, pages =	"129--135"
, note =	"Proc. SIGGRAPH '84"
, update =	"97.11 bibrelex"
}

@book{a-dgms-85
, author =	"S. Amari"
, title =	"Differential Geometrical Methods in Statistics"
, series =	"Lecture Notes in Statistics"
, volume =	28
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1985
, update =	"98.07 bibrelex"
}

@article{a-dssp-94
, author =	"N. Amato"
, title =	"Determining the separation of simple polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"457--474"
, keywords =	"separation, simple polygon, parallel algorithm, sequential algorithm"
, succeeds =	"a-oafss-93"
, update =	"96.09 devillers"
}

@incollection{abdjv-oobp3-98
, author =	"N. Amato and O. B. Bayazit and L. K. Dale and C. Jones and D. Vallejo"
, title =	"{OBPRM}: An obstacle-based {PRM} for {3D} workspaces"
, editor =	"P. K. Agarwal and L. E. Kavraki and M. Mason"
, booktitle =	"Proc. Workshop Algorithmic Found. Robot."
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1998
, note =	"To appear"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@inproceedings{a-oafss-93
, author =	"Nancy M. Amato"
, title =	"An Optimal Algorithm for Finding the Separation of Simple Polygons"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"48--59"
, precedes =	"a-dssp-94"
, update =	"96.09 devillers, 93.09 milone+mitchell+smid, 93.05 jones"
}

@article{agr-ratsp-01
, author =	"Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos"
, title =	"A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time"
, journal =	"Discrete Comput. Geom."
, volume =	26
, number =	2
, year =	2001
, pages =	"245--265"
, update =	"01.11 pocchiola+smid"
}

@inproceedings{agr-cfssa-95
, author =	"N. M. Amato and M. T. Goodrich and E. A. Ramos"
, title =	"Computing faces in segment and simplex arrangements"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, year =	1995
, pages =	"672--682"
, update =	"95.09 agarwal+smid"
}

@inproceedings{agr-cacsd-00
, author =	"N. M. Amato and M. T. Goodrich and E. A. Ramos"
, title =	"Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling"
, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '00"
, year =	2000
, pages =	"705--706"
, update =	"00.11 smid"
}

@inproceedings{agr-lttsp-00
, author =	"Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos"
, title =	"Linear-Time Triangulation of a Simple Polygon Made Easier via Randomization"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"201--212"
, update =	"00.11 jones"
}

@inproceedings{agr-pahdc-94
, author =	"N. M. Amato and M. T. Goodrich and E. A. Ramos"
, title =	"Parallel algorithms for higher-dimensional convex hulls"
, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1994
, pages =	"683--694"
, update =	"95.01 smid"
}

@inproceedings{ap-np3dc-93
, author =	"N. M. Amato and F. P. Preparata"
, title =	"An {NC}$^1$ Parallel 3{D} convex hull algorithm"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"289--297"
, cites =	"acgoy-pcg-88, ap-p3dch-92, c-pms-88, cz-opabd-90, c-pagp-80, dk-pcsh-89, dk-dsppu-90, kr-pasmm-90, pdw-npach-92, ph-chfsp-77, ps-cgi-85, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
}

@article{ap-p3dch-92
, author =	"N. M. Amato and F. P. Preparata"
, title =	"The parallel 3{D} convex hull problem revisited"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"163--173"
, keywords =	"convex hull, parallel computation, PRAM, hierarchical representation"
}

@inproceedings{ar-cvddp-96
, author =	"Nancy M. Amato and Edgar A. Ramos"
, title =	"On Computing {Voronoi} Diagrams by Divide-Prune-and-Conquer"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"166--175"
, cites =	"as-vdco-95, agr-pahdc-94, agr-cfssa-95, a-pdpaa-87, bcm-prsss-93, c-osrch-95, csy-oscpf-95, csy-pddpo-97, c-chdc-93, c-ochaa-93, cf-dvrsi-90, cs-arscg-89, dk-fdpi-83, e-acg-87, em-sstcd-90, es-itfwr-92, es-otatd-91, g-gpmee-93, goy-cvdsl-93, ks-upcha-86, k-cavd-89, m-aogdc-91, m-cha-91, m-ept-92, m-loq-93, m-lpltw-84, rs-oprat-92, s-chdch-86, s-sdlpc-91, sa-dsstg-95, s-fchff-85, y-gctsp-90, ZZZ"
, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
}

@article{a-cspcp-66
, author =	"R. V. Ambarcumjam"
, title =	"Convex subclusters of point clusters in the plane"
, journal =	"Dokl. Acad. Nauk Armjan. SSR"
, volume =	43
, year =	1966
, pages =	"12--14"
, update =	"02.03 devillers"
}

@inproceedings{a-bbhdn-94
, author =	"N. Amenta"
, title =	"Bounded Boxes, {Hausdorff} Distance, and a New Proof of an Interesting {Helly} Theorem"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"340--347"
, cites =	"a-htglp-93, a-htglp-93t, abb-amps-91, ak-srtat-89, a-ltahd-83, cghkkk-gpmem-93, c-lvalp-88, dmr-fmaap-93, dgk-htir-63, e-hrctt-93, gm-csfs-61, hks-uevsi-91, l-htpuc-68, m-gofvc-94, msw-sblp-92, m-tphpu-73, s-lpchm-90, sw-cblpr-92, w-sedbe-91, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@incollection{a-cgs-97
, author =	"N. Amenta"
, title =	"Computational geometry software"
, chapter =	52
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"951--960"
, update =	"97.11 orourke"
}

@misc{a-dcgs-
, author =	"Nina Amenta"
, title =	"Directory of Computational Geometry Software"
, url =	"http://www.geom.umn.edu/software/cglist/"
, update =	"97.03 tamassia"
}

@inproceedings{a-fltao-92
, author =	"N. Amenta"
, title =	"Finding a line transversal of axial objects in three dimensions"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"66--71"
}

@inproceedings{a-fpf-96
, author =	"Nina Amenta"
, title =	"Four-polytopes and a funeral"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V1--V2"
, cites =	"az-ssp-96, almp-gsgv-95, km-hgisa-72, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@phdthesis{a-htglp-93t
, author =	"N. Amenta"
, title =	"Helly Theorems and Generalized Linear Programming"
, school =	"Geometry Center"
, address =	"Minneapolis, MN"
, year =	1993
, note =	"Technical Report GCG61"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{a-htglp-93
, author =	"N. Amenta"
, title =	"Helly theorems and generalized linear programming"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"63--72"
, cites =	"a-fltao-92, ad-ahdsp-90, ah-cahti-91, agpw-tinhn-, cm-ltdao-93, c-lvalp-88, dgk-htir-63, d-cdnsm-92, d-mstia-86, d-ccpac-92, e-hrctt-93, ew-spdtl-89, gpw-gtt-93, gm-csfs-61, h-bchn-79, km-accvd-91, msw-sblp-92, m-ltalp-83, m-bsb-89, pr-rn-92, r-lie-89, s-lpchm-90, sw-cblpr-92, t-pgcct-89, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{a-httgl-94
, author =	"N. Amenta"
, title =	"Helly-type theorems and generalized linear programming"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"241--261"
, succeeds =	"a-htglp-93"
, update =	"95.01 matousek+smid"
}

@inproceedings{a-ktpcs-96
, author =	"N. Amenta"
, title =	"$k$-{Transversals} of parallel convex sets"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"80--86"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{ab-srvf-98
, author =	"Nina Amenta and Marshall Bern"
, title =	"Surface reconsruction by {Voronoi} filtering"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, site =	"Minneapolis"
, year =	1998
, pages =	"39--48"
, precedes =	"ab-srvf-99"
, update =	"00.03 devillers"
}

@article{ab-srvf-99
, author =	"Nina Amenta and Marshall Bern"
, title =	"Surface Reconstruction by {Voronoi} Filtering"
, journal =	"Discrete Comput. Geom."
, volume =	22
, number =	4
, year =	1999
, pages =	"481--504"
, succeeds =	"ab-srvf-98"
, update =	"00.03 devillers, 99.11 held"
}

@inproceedings{abe-oppms-97
, author =	"N. Amenta and M. Bern and D. Eppstein"
, title =	"Optimal Point Placement for Mesh Smoothing"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1997
, pages =	"528--537"
, update =	"97.03 held"
}

@techreport{abe-cbscc-97
, author =	"N. Amenta and M. Bern and D. Eppstein"
, title =	"The Crust and the $\beta$-Skeleton: Combinatorial Curve Reconst ruction"
, type =	"Research {Report}"
, institution =	"Xerox PARC"
, year =	1997
, precedes =	"abe-cbscc-98"
, update =	"00.03 devillers, 98.03 devillers"
}

@article{abe-cbscc-98
, author =	"Nina Amenta and Marshall Bern and David Eppstein"
, title =	"The Crust and the $\beta$-Skeleton: Combinatorial Curve Reconstruction"
, journal =	"Graphical Models and Image Processing"
, volume =	60
, year =	1998
, pages =	"125--135"
, url =	"http://www.geom.umn.edu/~nina/papers/crust.ps.gz"
, comments =	"\url{http://www.geom.umn.edu/~nina/papers/crust.ps.gz}"
, succeeds =	"abe-cbscc-97"
, update =	"02.03 wenger, 00.03 devillers+orourke"
}

@article{abet-rdcp-00
, author =	"N. Amenta and M. Bern and D. Eppstein and S.-H. Teng"
, title =	"Regression Depth and Center Points"
, journal =	"Discrete Comput. Geom."
, volume =	23
, year =	2000
, pages =	"305--323"
, update =	"01.11 smid"
}

@inproceedings{abk-nvbsr-98
, author =	"N. Amenta and M. Bern and M. Kamvysselis"
, title =	"A New {Voronoi}-Based Surface Reconstruction Algorithm"
, booktitle =	"Proc. SIGGRAPH '98"
, site =	"Orlando, FL"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, month =	jul
, year =	1998
, pages =	"415--412"
, update =	"00.03 orourke, 98.11 held"
}

@unpublished{ac-opdfh-99
, author =	"N. Amenta and S. Choi"
, title =	"One-pass {Delaunay} filtering for homeomorphic {3D} surface reconstruction"
, year =	1999
, note =	"Manuscript"
, update =	"00.03 orourke"
}

% title page uses initials only
@inproceedings{acdl-sahsr-00
, author =	"N. Amenta and S. Choi and T. K. Dey and N. Leekha"
, title =	"A Simple Algorithm for Homeomorphic Surface Reconstruction"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"213--222"
, update =	"00.11 jones"
}

@article{ack-pcubm-01
, author =	"N. Amenta and S. Choi and R. K. Kolluri"
, title =	"The power crust, unions of balls, and the medial axis transform"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"127--153"
, update =	"01.11 smid"
}

@inproceedings{ak-aeub-00
, author =	"Nina Amenta and Ravi Krishna Kolluri"
, title =	"Accurate and Efficient Unions of Balls"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"119--128"
, update =	"00.11 jones"
}

@article{ak-maub-01
, author =	"N. Amenta and R. K. Kolluri"
, title =	"The medial axis of a union of balls"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"25--37"
, update =	"01.11 smid"
}

@inproceedings{almp-gsgv-95
, author =	"N. Amenta and S. Levy and T. Munzner and M. Philips"
, title =	"Geomview: A System for Geometric Visualization"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C12--C13"
, keywords =	"software, visualization"
, cites =	"ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
}

@inproceedings{az-ssp-96
, author =	"Nina Amenta and G{\"u}nter Ziegler"
, title =	"Shadows and Slices of Polytopes"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"10--19"
, cites =	"aaas-lpmpc-97, af-pachv-92, b-smpa-87, c-osrch-95, ceg-ccc-89, gz-rsakm-94, gs-capof-55, g-wccsv-83, g-csa-94, km-hgisa-72, m-loq-93, m-ccplp-80, pf-ctffc-95, pssbm-cffef-96, s-chdch-86, s-cpdoc-87, z-lp-94, ZZZ"
, update =	"01.04 icking, 97.11 bibrelex, 96.05 efrat"
}

@inproceedings{ab-tdpia-92
, author =	"A. Amir and G. Benson"
, title =	"Two-dimensional periodicity and its applications"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"440--452"
}

@inproceedings{af-e2dam-91
, author =	"A. Amir and M. Farach"
, title =	"Efficient $2$-dimensional approximate matching of non-rectangular figures"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"212--223"
}

@article{a-afccf-90
, author =	"I. Amir"
, title =	"Algorithms for finding the center of circular fiducials"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	49
, year =	1990
, pages =	"398--406"
, update =	"98.11 bibrelex"
}

@techreport{a-pmwt-90
, author =	"Efthymios Anagnostou"
, title =	"Progress in Minimum Weight Triangulation"
, type =	"Technical Report 232/90"
, institution =	"Department of Computer Science, University of Toronto"
, year =	1990
, update =	"98.07 bibrelex"
}

@article{ac-ptimw-93
, author =	"E. Anagnostou and D. Corneil"
, title =	"Polynomial time instances of the minimum weight triangulation problem"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"247--259"
, update =	"96.09 devillers"
}

@inproceedings{agp-tstd-90
, author =	"E. G. Anagnostou and Leonidas J. Guibas and V. G. Polimenis"
, title =	"Topological sweeping in three dimensions"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"310--317"
, keywords =	"topological sweep, three-dimensional"
, update =	"98.03 mitchell"
}

@inproceedings{arrms-dgbb2-97
, author =	"Brad Andalman and Kathy Ryall and Wheeler Ruml and Joe Marks and Stuart Shieber"
, title =	"Design Gallery Browsers Based on {2D} and {3D} Graph Drawing"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"322--329"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@book{a-caa-73
, author =	"M. R. Anderberg"
, title =	"Cluster Analysis for Applications"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1973
, comments =	"Unchecked reference from PRNN"
, update =	"98.07 agarwal"
}

@article{a-readc-78
, author =	"K. R. Anderson"
, title =	"A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set"
, journal =	"Inform. Process. Lett."
, volume =	7
, number =	1
, year =	1978
, pages =	"53--55"
, update =	"97.11 bibrelex, 95.05 korneenko"
}

@article{aw-omht-96
, author =	"L. Anderson and R. Wenger"
, title =	"Oriented Matroids and Hyperplane Transversals"
, journal =	"Adv. Math."
, volume =	119
, year =	1996
, pages =	"117--125"
, update =	"01.07 wenger"
}

@incollection{abb-paa-90
, author =	"R. Anderson and P. Beame and E. Brisson"
, title =	"Parallel algorithms for arrangements"
, booktitle =	"ACM Sympos. Paral. Algorithms and Architectures"
, year =	1990
, pages =	"298--306"
, keywords =	"parallel computations, arrangement"
, update =	"95.09 agarwal+korneenko, 95.05 korneenko"
}

@article{abb-paa-96
, author =	"Richard Anderson and Paul Beame and Erik Brisson"
, title =	"Parallel Algorithms for Arrangements"
, journal =	"Algorithmica"
, volume =	15
, year =	1996
, pages =	"104--125"
, update =	"98.03 agarwal"
}

@inproceedings{aks-oa1dt-90
, author =	"R. Anderson and S. Kahan and M. Schlag"
, title =	"An {$O(n \log n)$} algorithm for $1$-d tile compaction"
, editor =	"M. Nagl"
, booktitle =	"Graph-Theoretic Concepts in Computer Science"
, series =	"Lecture Notes Comput. Sci."
, volume =	411
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"287--301"
, update =	"98.03 bibrelex"
}

@inproceedings{am-dplr-88
, author =	"R. Anderson and G. Miller"
, title =	"Deterministic parallel list ranking"
, booktitle =	"Proc. 3rd Aegean Workshop Computing"
, series =	"Lecture Notes Comput. Sci."
, volume =	319
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"81--90"
, update =	"97.11 bibrelex"
}

@inproceedings{a-palc-92
, author =	"R. J. Anderson"
, title =	"Primitives for asynchronous list compression"
, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
, year =	1992
, pages =	"199--208"
, update =	"96.09 orourke"
}

@article{amw-paabp-89
, author =	"R. J. Anderson and E. W. Mayr and M. K. Warmuth"
, title =	"Parallel approximation algorithms for bin packing"
, journal =	"Inform. Comput."
, volume =	82
, year =	1989
, pages =	"262--277"
, update =	"96.09 orourke"
}

@article{am-dplr-91
, author =	"R. J. Anderson and G. L. Miller"
, title =	"An optimal algorithm for intersecting line segments in the plane"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"859--868"
, update =	"98.07 bibrelex"
}

@inproceedings{aw-wfpau-91
, author =	"R. J. Anderson and H. Woll"
, title =	"Wait-free parallel algorithms for the union-find problem"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"370--380"
, update =	"96.09 orourke"
}

@article{ahnr-slt-98
, author =	"Andersson and Hagerup and Nilsson and Raman"
, title =	"Sorting in linear time?"
, journal =	"J. Comput. Syst. Sci."
, volume =	57
, year =	1998
, pages =	"74--93"
, keywords =	""
, update =	"98.11 pocchiola"
}

@inproceedings{ahhp-fms-94
, author =	"Arne Andersson and Torben Hagerup and Johan H{\.a}astad and Ola Petersson"
, title =	"Faster Multidimensional Searching"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	""
, update =	"94.01 jones"
}

@article{aiko-bstao-90
, author =	"Arne Andersson and Christian Icking and Rolf Klein and Thomas Ottmann"
, title =	"Binary Search Trees of Almost Optimal Height"
, journal =	"Acta Inform."
, volume =	28
, year =	1990
, pages =	"165--178"
, update =	"98.11 bibrelex"
}

@inproceedings{amrt-sdarq-96
, author =	"Arne Andersson and Peter Bro Miltersen and S{\o}ren Riis and Mikkel Thorup"
, title =	"Static Dictionaries on {$\mathit{AC}^0$} {RAMs}: Query Time {$\Theta(\sqrt(\log n/\log \log n))$} is Necessary and Sufficient"
, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1996
, pages =	"441--450"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{as-drs-95
, author =	"Arne Andersson and Kurt Swanson"
, title =	"On the Difficulty of Range Searching"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"473--481"
, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
}

@article{as-drs-97
, author =	"A. Andersson and K. Swanson"
, title =	"On the Difficulty of Range Searching"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"115--122"
, update =	"98.03 smid"
}

@article{adps-pptpt-95
, author =	"L.-E. Andersson and S. M. Dorney and T. J. Peters and N. F. Stewart"
, title =	"Polyhedral Perturbations that Preserve Topological Form"
, journal =	"Comput. Aided Geom. Design"
, volume =	12
, number =	8
, month =	dec
, year =	1995
, pages =	"785--799"
, update =	"99.11 bibrelex, 97.07 held"
}

@article{as-eacs-01
, author =	"M. V. A. Andrade and J. Stolfi"
, title =	"Exact algorithms for circles on the sphere"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"267--290"
, update =	"01.07 smid"
}

@unpublished{a-srvg-89
, author =	"T. Andrae"
, title =	"Some results on visibility graphs"
, year =	1989
, note =	"Preprint"
, precedes =	"a-srvg-92"
, update =	"98.07 bibrelex"
}

@article{a-srvg-92
, author =	"T. Andreae"
, title =	"Some Results on Visibility Graphs"
, journal =	"Discrete Appl. Math."
, volume =	40
, year =	1992
, pages =	"5--17"
, keywords =	"graph drawing"
, succeeds =	"a-srvg-89"
, update =	"98.07 bibrelex, 94.01 tamassia"
}

@article{a-cpls-70
, author =	"E. M. Andreev"
, title =	"On convex polyhedra in {Lobacevskii} space"
, journal =	"Math. USSR Sbornik"
, volume =	10
, number =	3
, year =	1970
, pages =	"413--440"
, update =	"97.11 bibrelex"
}

@article{a-cpfvl-70
, author =	"E. M. Andreev"
, title =	"On convex polyhedra of finite volume in {Lobacevskii} space"
, journal =	"Math. USSR Sbornik"
, volume =	12
, number =	2
, year =	1970
, pages =	"259--270"
, update =	"97.11 bibrelex"
}

@article{a-acap-89
, author =	"R. D. Andreev"
, title =	"Algorithm for clipping arbitrary polygons"
, journal =	"Comput. Graph. Forum"
, volume =	8
, number =	3
, year =	1989
, pages =	"183--191"
, keywords =	"polygon, clipping"
, update =	"95.05 korneenko"
}

@article{a-aeach-79
, author =	"A. M. Andrew"
, title =	"Another efficient algorithm for convex hulls in two dimensions"
, journal =	"Inform. Process. Lett."
, volume =	9
, number =	5
, year =	1979
, pages =	"216--219"
, keywords =	"designing algorithms, convex hull, two-dimensional"
}

@inproceedings{a-fcagi-94
, author =	"D. S. Andrews"
, title =	"Further comparison of algorithms for geometric intersection problems"
, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
, site =	"Edinburgh, UK"
, year =	1994
, pages =	"709--724"
, update =	"98.03 bibrelex"
}

@inproceedings{as-gginc-95
, author =	"D. Scott Andrews and Jack Snoeyink"
, title =	"Geometry in {GIS} is not Combinatorial: {Segment} Intersection for Polygon Overlay"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C24--C25"
, keywords =	""
, cites =	"a-fcagi-94, bo-arcgi-79, c-stsar-94, f-eicld-89, fkn-vsgpt-80, o-tcg-93, ps-crrbs-94, p-csarg-90, s-dasds-90, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{a-lbvsc-63
, author =	"G. E. Andrews"
, title =	"A lower bound for the volume of strictly convex bodies with many boundary lattice points"
, journal =	"Trans. Amer. Math. Soc."
, volume =	106
, year =	1963
, pages =	"270--279"
, keywords =	"volume"
, update =	"95.05 korneenko"
}

@book{a-imtpr-72
, author =	"H. C. Andrews"
, title =	"Introduction to Mathematical Techniques in Pattern Recognition"
, publisher =	"Wiley-Interscience"
, address =	"New York"
, year =	1972
, update =	"98.03 bibrelex"
}

@article{al-pacag-95
, author =	"M. Andrews and D. T. Lee"
, title =	"Parallel algorithms on circular-arc graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"117--141"
, update =	"96.09 devillers"
}

@unpublished{aahsw-rksjf-98
, author =	"Artur Andrzejak and Boris Aronov and Sariel Har-Peled and Raimund Seidel and Emo Welzl"
, title =	"Results on $k$-sets and $j$-facets via continuous motion arguments"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"192--199"
, update =	"98.11 aronov, 98.03 agarwal"
}

@article{as-fqna-94
, author =	"C. H. Ang and H. Samet"
, title =	"A Fast Quadtree Normalization Algorithm"
, journal =	"Pattern Recogn. Lett."
, volume =	15
, month =	jan
, year =	1994
, pages =	"57--63"
, update =	"96.05 efrat"
}

@incollection{as-ndpq-90
, author =	"C. H. Ang and H. Samet"
, title =	"Node distribution in a {PR} quadtree"
, editor =	"A. Buchmann and O. G{\"u}nther and T. R. Smith and Y.-F. Wang"
, booktitle =	"Design and Implementation of Large Spatial Databases"
, series =	"Lecture Notes Comput. Sci."
, volume =	409
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"223--252"
, update =	"99.11 bibrelex, 96.09 agarwal, 96.05 efrat"
}

@article{ass-nreq-90
, author =	"C. H. Ang and H. Samet and C. A. Shaffer"
, title =	"A new region expansion for quadtrees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	12
, number =	7
, month =	jul
, year =	1990
, pages =	"682--686"
, note =	"(also Proceedings of the Third International
		  Symposium on Spatial Data Handling, Sydney,
		  Australia, August 1988, 19--37)"
, update =	"96.05 efrat"
}

@inproceedings{ap-sstvc-01
, author =	"P. Angelier and M. Pocchiola"
, title =	"A sum of squares theorem for visibility complexes"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"302--311"
, note =	""
, update =	"01.11 pocchiola"
}

@inproceedings{ap-ctvg-00
, author =	"Pierre Angelier and Michel Pocchiola"
, title =	"On Computing Tangent Visibility Graphs"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"108--111"
, update =	"00.03 bibrelex"
}

@inproceedings{apr-tsm-99
, author =	"Pierre Angelier and Michel Pocchiola and St{\'e}phane Rivi{\`e}re"
, title =	"On the Topological Sweep Method"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	179
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{am-qtad2-86
, author =	"Ian O. Angell and Richard E. M. Moore"
, title =	"Quad-Tree Algorithm For Displaying a 2-Dimensional Slice Of An $n$-Dimensional Weighted {Voronoi} Tessellation"
, booktitle =	"EUROGRAPHICS '86: Proceedings of the European Computer Graphics Conference and Exhibition --- The Computer Interface."
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1986
, pages =	"19--27"
, keywords =	"Voronoi tessellation, computational geometry"
, annote =	"Multiplicative weights. Quadtree Method: find closest
		 (weighted) point to square centre, then construct
		 bisectors of this point with all others to see if any
		 intersect square and subdivide if necessary."
, abstract =	"A tessellation exists in N-dimensional Euclidean space
		 which is best known either in purely 2-dimensional
		 contexts or in the purely 3-dimensional --- often workers
		 familiar with the one paying no regard to the other ---
		 though the utility of this tessellation in 2-, 3- and
		 even higher dimensions is vast. In 2-dimensions
		 applications exist in fields as disparate as
		 archaeology, astronomy, biology, economics, forestry,
		 geography, metallurgy and virology, and in many other
		 fields too. In 3-dimensions applications are equally
		 varied: for example in anatomy, astronomy, botany,
		 chemistry, crystallography, and stereology. It has
		 major importance in the investigation of the structure
		 of liquids, and in other aspects of physics.
		 Applications in dimensions higher than three, although
		 comparatively rare, do exist --- and might be greater if
		 such tessellations were easier to calculate. 10 refs."
}

@article{am-pdp-89
, author =	"T. A. Angelov and I. S. Manoach"
, title =	"A point-in-domain program"
, journal =	"Adv. Eng. Softw."
, volume =	11
, number =	2
, year =	1989
, pages =	"99--106"
, keywords =	"point location, implementation"
, update =	"96.09 devillers, 95.05 korneenko"
}

@article{av-fpahc-79
, author =	"D. Angluin and L. G. Valiant"
, title =	"Fast Probabilistic Algorithms for {Hamiltonian} Circuits and Matchings"
, journal =	"J. Comput. Syst. Sci."
, volume =	18
, year =	1979
, pages =	"155--193"
, update =	"98.03 bibrelex"
}

@inproceedings{awz-rnrq-96
, author =	"Dana Angluin and Jeffery Westbrook and Wenhong Zhu"
, title =	"Robot Navigation with Range Queries"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '96"
, site =	"Philadelphia, PA"
, month =	may
, year =	1996
, pages =	"469--478"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{adf-efgrs-84
, author =	"S. Ansaldi and L. {De Floriani} and B. Falcidieno"
, title =	"Edge-face graph representation of solid objects"
, booktitle =	"Poceedings of Workshop on Computer Vision, Representation and Control"
, site =	"Annapolis, MD"
, year =	1984
, pages =	"164--169"
, update =	"98.03 bibrelex"
}

@article{adf-gmsou-85
, author =	"S. Ansaldi and L. {De Floriani} and B. Falcidieno"
, title =	"Geometric modeling of solid objects by using a face adjacency graph representation"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, year =	1985
, pages =	"131--139"
, note =	"Proc. SIGGRAPH '85"
}

@book{ab-clt-92
, author =	"M. Anthony and N. Biggs"
, title =	"Computational Learning Theory"
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1992
, update =	"95.05 agarwal"
}

@article{a-slddf-21
, author =	"L. Antoine"
, title =	"Sur l'homeomorphisme de deux figures et de leurs voisinages"
, journal =	"J. Math., Ser. 8"
, volume =	4
, year =	1921
, pages =	"221--235"
, update =	"98.07 bibrelex"
}

@inproceedings{ag-iad5v-97
, author =	"Fran{\c c}ois Anton and Christopher Gold"
, title =	"An Iterative Algorithm for the Determination of {V}oronoi Vertices in Polygonal and Non--Polygonal Domains"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"257--262"
, update =	"00.03 bibrelex, 97.11 jones"
}

@inproceedings{am-dldme-00
, author =	"Fran{\c c}ois Anton and Darka Mioc"
, title =	"Dynamic {Laguerre} Diagrams Made Easy"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"10--13"
, update =	"00.03 bibrelex"
}

@inproceedings{asg-iadvv
, author =	"Fran{\c c}ois Anton and Jack Snoeyink and Christopher Gold"
, title =	"An Iterative Algorithm for the Determination of {Voronoi} Vertices in Polygonal and Non-Polygonal Domains on the Plane and the Sphere"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"33--35"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{a-edsau-89
, author =	"J.-I. Aoe"
, title =	"An efficient digital search algorithm by using a double-array structure"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	15
, number =	9
, year =	1989
, pages =	"1066--1077"
, update =	"95.05 korneenko"
}

@inproceedings{a-pah-92
, author =	"Y. Aoki"
, title =	"Probing the arrangement of hyperplanes"
, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
, site =	"Kyoto, Japan"
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@phdthesis{a-ccra-93
, author =	"Y. Aoki"
, title =	"The combinatorial complexity of reconstructing arrangements"
, school =	"Department of Information Science, University of Tokyo"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{aiir-pshlr-93
, author =	"Yasukazu Aoki and Hiroshi Imai and Keiko Imai and David Rappaport"
, title =	"Probing a Set of Hyperplanes by Lines and Related Problems"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"72--82"
, update =	"93.09 milone+mitchell+smid, 93.05 jones"
}

@inproceedings{aiit-mlcop-90
, author =	"H. Aonuma and H. Imai and K. Imai and T. Tokuyama"
, title =	"Maximin location of convex objects in a polygon and related dynamic {Voronoi} diagrams"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"225--234"
, cites =	"ass-sulbl-89, aik-vspca-89, a-sdcgp-85, ab-pptr-88, c-pcp-83, ck-plscc-89, f-fapct-85, f-savd-87, i-vdmp-89, isi-mgftc-89, ls-pptmc-87, s-pds-74, t-dmvdt-88, ZZZ"
, update =	"97.11 bibrelex"
}

@article{aiit-mpcpr-90
, author =	"H. Aonuma and H. Imai and K. Imai and T. Tokuyama"
, title =	"Maximin polygon containment problems and related dynamic {Voronoi} diagrams"
, journal =	"Surikaisekikenkyosho Kokyuroku"
, volume =	731
, year =	1990
, pages =	"177--186"
, note =	"Proc. Sympos. Algorithms and Comput. Complexity"
, keywords =	"on-line algorithms, convex, location, Voronoi diagram"
, update =	"98.07 bibrelex, 95.09 agarwal, 95.05 korneenko"
}

@inproceedings{aik-vspca-89
, author =	"H. Aonuma and H. Imai and Y. Kambayashi"
, title =	"A Visual System of Placing Characters Appropriately in Multimedia Map Databases"
, booktitle =	"Visual Database Systems"
, publisher =	"North-Holland"
, year =	1989
, pages =	"525--546"
, note =	"Proc. IFIP TC2/WG2.6 Working Conf. Visual Database Syst."
, update =	"97.11 bibrelex"
}

@article{als-caged-86
, author =	"F. Aoudja and M. Laborie and A. Saint-Paul"
, title =	"{CASE}: Automatic Generation of Electrical Diagrams"
, journal =	"Comput. Aided Design"
, volume =	18
, number =	7
, year =	1986
, pages =	"356--360"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{a-iant-76
, author =	"T. M. Apostol"
, title =	"Introduction to Analytic Number Theory"
, publisher =	"Springer-Verlag"
, year =	1976
, update =	"97.11 bibrelex"
}

@article{aalm-epase-90
, author =	"A. Apostolico and M. J. Atallah and L. L. Larmore and H. S. McFaddin"
, title =	"Efficient parallel algorithms for string editing and related problems"
, journal =	"SIAM J. Comput."
, volume =	19
, number =	5
, year =	1990
, pages =	"968--988"
, update =	"98.11 bibrelex"
}

@article{ah-fmcca-88
, author =	"A. Apostolico and S. E. Hambrusch"
, title =	"Finding maximal cliques of circular-arc graphs"
, journal =	"Inform. Process. Lett."
, volume =	26
, number =	4
, year =	1988
, pages =	"209--215"
, keywords =	"circular-arc graph, geometric graphs, clique"
, update =	"95.05 korneenko"
}

@article{as-lce-73
, author =	"G. Appa and C. Smith"
, title =	"On {$L_{1}$} and {Chebyshev} estimation"
, journal =	"Math. Program."
, volume =	5
, year =	1973
, pages =	"73--87"
, update =	"98.03 bibrelex"
}

@inproceedings{a-nqimr-67
, author =	"A. Appel"
, title =	"The notion of quantitative invisibility and the machine rendering of solids"
, booktitle =	"Proc. ACM National Conference"
, year =	1967
, pages =	"367--393"
, update =	"98.03 bibrelex"
}

@article{aw-dtdch-76
, author =	"A. Appel and P. M. Will"
, title =	"Determining the three-dimensional convex hull of a polyhedron"
, journal =	"IBM J. Res. Develop."
, volume =	20
, year =	1976
, pages =	"590--611"
}

@article{ah-epmfc-77
, author =	"K. Appel and W. Haken"
, title =	"Every planar map is four colourable, Part {I}: discharging"
, journal =	"Illinois J. Math."
, volume =	21
, year =	1977
, pages =	"429--490"
, update =	"98.11 bibrelex"
}

@book{a-tdmrt-41
, author =	"P. Appell"
, title =	"Trait{\'e} de M{\'e}canique Rationelle, Tome {I}: Statique, Dynamique du Point"
, edition =	"6th"
, publisher =	"Gauthier-Villars"
, year =	1941
, update =	"98.07 bibrelex"
}

@inproceedings{ak-levtg-91
, author =	"D. Applegate and R. Kannan"
, title =	"Local expansion of vertex-transitive graphs and random generation in finite groups"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"164--174"
, keywords =	"approximation, volume, convex"
}

@inproceedings{at-qdbt-00
, author =	"Sigal Ar and Ayellet Tal"
, title =	"Query Driven {BSP} Trees"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"81--84"
, update =	"00.03 bibrelex"
}

@inproceedings{as-rst-89
, author =	"C. Aragon and R. Seidel"
, title =	"Randomized search trees"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"540--545"
}

@article{ac-r1mp-83
, author =	"J. Ar{\'a}oz and W. H. Cunningham"
, title =	"Reductions to $1$-matching polyhedra"
, journal =	"Networks"
, volume =	13
, year =	1983
, pages =	"455--473"
}

@article{ac-cpdia-74
, author =	"C. Arcelli and L. Cordella"
, title =	"Concavity point detection by iterative arrays"
, journal =	"Comput. Graph. Image Process."
, volume =	3
, year =	1974
, pages =	"34--47"
}

@article{al-cepp-71
, author =	"C. Arcelli and S. Levialdi"
, title =	"Concavity extraction by parallel processing"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-1"
, year =	1971
, pages =	"394--396"
}

@article{asdb-cvddp-86
, author =	"C. Arcelli and G. {Sanniti di Baja}"
, title =	"Computing {Voronoi} diagrams in digital pictures"
, journal =	"Pattern Recogn. Lett."
, volume =	4
, number =	5
, year =	1986
, pages =	"383--389"
, keywords =	"Voronoi diagram, digital geometry"
, update =	"95.05 korneenko"
}

@inproceedings{as-pcctb-78
, author =	"C. Arcelli and G. {Sanniti di Baja}"
, title =	"Polygonal covering and concavity tree of binary digital pictures"
, editor =	"M. H. Hamza and S. G. Tzafestas"
, booktitle =	"Proc. Internat. Sympos. Measurement \& Control"
, nickname =	"MECO '78"
, publisher =	"Panhellenic Society of Mechanical \& Electrical Engineers"
, address =	"Athens"
, year =	1978
, pages =	"292--297"
, update =	"95.05 korneenko"
}

@inproceedings{a-iacs-95
, author =	"Eugen Ardeleanu"
, title =	"Intersection Algorithms: A Comparative Study"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"43--46"
, update =	"00.03 bibrelex"
}

@inproceedings{as-cmqou-94
, author =	"W. G. Aref and H. Samet"
, title =	"A Cost Model for Query Optimization Using R-Trees"
, booktitle =	"Proceedings of the Second ACM Workshop on Geographic Information Systems"
, site =	"Gaithersburg, Maryland"
, month =	dec
, year =	1994
, pages =	"60--67"
, update =	"96.05 efrat"
}

@inproceedings{as-wrasd-95
, author =	"W. G. Aref and H. Samet"
, title =	"A Window Retrieval Algorithm for Spatial Databases Using Quadtrees"
, booktitle =	"Proceedings of the Third ACM Workshop on Geographic Information Systems"
, site =	"Baltimore"
, month =	dec
, year =	1995
, pages =	"69--76"
, update =	"96.05 efrat"
}

@inproceedings{as-aimga-90
, author =	"W. G. Aref and H. Samet"
, title =	"An Approach to Information Management in Geographical Applications"
, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
, site =	"Zurich"
, month =	jul
, year =	1990
, pages =	"589--598"
, update =	"96.05 efrat"
}

@techreport{as-ewras-92
, author =	"W. G. Aref and H. Samet"
, title =	"An efficient window retrieval algorithm for spatial query processing"
, type =	"Computer Science Department"
, number =	"TR-2866"
, institution =	"UMD"
, address =	"College Park, MD"
, month =	mar
, year =	1992
, update =	"96.05 efrat"
}

@article{as-dwmqb-93
, author =	"W. G. Aref and H. Samet"
, title =	"Decomposing a window into maximal quadtree blocks"
, journal =	"Acta Inform."
, volume =	"??"
, year =	1993
, note =	"(also University of Maryland Computer Science
                  TR-2771)"
, update =	"96.05 efrat"
}

@techreport{as-deups-93
, author =	"W. G. Aref and H. Samet"
, title =	"Duplicate Elimination using Proximity in Spatial Databases"
, number =	"CS-3067"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	may
, year =	1993
, update =	"96.05 efrat"
}

@inproceedings{as-epwqp-90
, author =	"W. G. Aref and H. Samet"
, title =	"Efficient processing of window queries in the pyramid data structure"
, booktitle =	"Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems"
, nickname =	"PODS"
, site =	"Nashville Tennessee"
, month =	apr
, year =	1990
, pages =	"265--272"
, note =	"(also in Proceedings of the Fifth Brazilian
		  Symposium on Databases, Rio de Janeiro, Brazil,
		  April 1990, 15--26)"
, update =	"96.05 efrat"
}

@inproceedings{as-esfso-93
, author =	"W. G. Aref and H. Samet"
, title =	"Estimating Selectivity Factors of Spatial Operations"
, booktitle =	"Optimization in Databases - 5th Int'l Workshop on Foundations of Models and Languages for Data and Objects"
, site =	"Aigen, Austria"
, month =	sep
, year =	1993
, pages =	"31--40"
, note =	"(also tech report:  Informatik-Bericht 93/9
                   Technische Universitat Clausthal, Clausthal -
                   Zellerfeld)"
, update =	"96.05 efrat"
}

@inproceedings{as-edso-91
, author =	"W. G. Aref and H. Samet"
, title =	"Extending a {DBMS} with spatial operations"
, editor =	"O. G{\"u}nther and H. J. Schek"
, booktitle =	"Proc. 2nd Sympos. Advances in Spatial Databases"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1991
, pages =	"299--318"
, note =	"(also Lecture Notes in Computer Science 525)"
, update =	"96.09 agarwal, 96.05 efrat"
}

@inproceedings{as-hppds-94
, author =	"W. G. Aref and H. Samet"
, title =	"Hashing by Proximity to Process Duplicates in Spatial Databases"
, booktitle =	"Proceedings of the Third International Conference on Information and Knowledge Management"
, publisher =	"ACM Press"
, address =	"Gaithersburg, Maryland"
, month =	dec
, year =	1994
, pages =	"347--354"
, update =	"96.05 efrat"
}

@incollection{as-lsfip-92
, author =	"W. G. Aref and H. Samet"
, title =	"Loading spatial features into the incomplete pyramid data structure"
, editor =	"G. Gambosi and M. Scholl and H.-W. Six"
, booktitle =	"?"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1992
, pages =	"138--160"
, update =	"96.09 agarwal, 96.05 efrat"
}

@inproceedings{as-ossqp-91
, author =	"W. G. Aref and H. Samet"
, title =	"Optimization strategies for spatial query processing"
, editor =	"G. Lohman"
, booktitle =	"Proceedings of the Seventeenth International Conference on Very Large Data Bases"
, site =	"Barcelona"
, month =	sep
, year =	1991
, pages =	"81--90"
, update =	"96.05 efrat"
}

@article{as-pvoro-95
, author =	"W. G. Aref and H. Samet"
, title =	"Perspective viewing of objects Represented by Octrees"
, journal =	"Comput. Graph. Forum"
, volume =	14
, number =	1
, month =	mar
, year =	1995
, pages =	"59--66"
, note =	"also University of Maryland Computer Science
                  TR-2757"
, update =	"96.05 efrat"
}

@techreport{as-qsesj-93
, author =	"W. G. Aref and Hanan Samet"
, title =	"Query size estimation of spatial join"
, number =	"MITL-TR 79-93"
, institution =	"Matsushita Information Technology Laboratory"
, address =	"2 Research Way, Princeton, NJ 08540-6628"
, month =	dec
, year =	1993
, update =	"96.05 efrat"
}

@inproceedings{as-sfr-94
, author =	"W. G. Aref and H. Samet"
, title =	"The Spatial Filter Revisited"
, editor =	"T. C. Waugh and R. G. Healey"
, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
, site =	"Edinburgh, Scotland"
, organization =	"International Geographical Union Comission on Geographic Information Systems, Association for Geographical Information"
, month =	sep
, year =	1994
, pages =	"190--208"
, update =	"96.05 efrat"
}

@inproceedings{as-ursoy-92
, author =	"W. G. Aref and H. Samet"
, title =	"Uniquely reporting spatial objects: yet another operation for comparing spatial data structures"
, booktitle =	"Proceedings of the fifth international symposium on spatial data handling"
, site =	"Charleston, South Carolina"
, month =	aug
, year =	1992
, pages =	"178--189"
, update =	"96.05 efrat"
}

@techreport{a-esdsp-94
, author =	"L. Arge"
, title =	"External-storage data structures for plane-sweep algorithms"
, type =	"Technical {Report}"
, number =	"RS-94-16"
, institution =	"BRICS"
, address =	"Aarhus Univ., Denmark"
, year =	1994
, update =	"95.01 devillers"
}

@inproceedings{a-btnto-95
, author =	"L. Arge"
, title =	"The {Buffer} {Tree}: A New Technique for Optimal {I/O}-Algorithms"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, number =	955
, year =	1995
, pages =	"334--345"
, keywords =	"external memory algorithms, data structures"
, update =	"99.07 bibrelex, 96.09 kreveld"
}

@inproceedings{aprsv-tpiea-98
, author =	"Lars Arge and Octavian Procopiuc and Sridhar Ramaswamy and Torsten Suel and Jeffrey Scott Vitter"
, title =	"Theory and Practice of {I/O}-Efficient Algorithms for Multidimensional Batched Searching Problems"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"685--694"
, update =	"99.07 bibrelex, 98.07 mitchell, 98.03 agarwal"
}

@inproceedings{av-ioedp-00
, author =	"Lars Arge and Jan Vahrenhold"
, title =	"{I/O}-Efficient Dynamic Planar Point Location"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"191--200"
, update =	"00.11 jones"
}

@inproceedings{avv-emapl-96
, author =	"Lars Arge and Darren Erik Vengroff and Jeffrey Scott Vitter"
, title =	"External-Memory Algorithms for Processing Line Segments in Georgraphic Information Systems"
, booktitle =	"Algorithmica"
, year =	"to appear"
, note =	"special issue on cartography and geographic
		  information systems. A shortened version appears in Proceedings of the
		  3rd Annual European Symposium on Algorithms
		  (ESA~'95), September~1995, published in Lecture
		  Notes in Computer Science, Springer-Verlag, Berlin, 295--310"
, update =	"97.03 murali"
}

@inproceedings{av-oimem-96
, author =	"L. Arge and J. S. Vitter"
, title =	"Optimal Interval Management in External Memory"
, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
, site =	"Burlington, VT"
, month =	oct
, year =	1996
, pages =	"560--569"
, update =	"97.07 agarwal, 97.03 murali"
}

@inproceedings{amz-sbme-94
, author =	"S. Arikati and A. Maheshwari and C. Zaroliagis"
, title =	"Saving Bits Made Easy"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"140--146"
, cites =	"e-mpmis-65, fhkr-owpas-92, if-umtor-81, ir-mtard-84, knr-irg-88, ly-grp-82, nsv-rpamu-92, o-agta-87, n-edstf-61, s-epgg-90, l-ga-90, j-ipa-92, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{accdsz-psasp-96
, author =	"Srinivasa Rao Arikati and Danny Z. Chen and L. Paul Chew and Gautam Das and Michiel Smid and Christos D. Zaroliagis"
, title =	"Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane"
, editor =	"Josep D{\'\i}az and Maria Serna"
, booktitle =	"Algorithms---ESA~'96, Fourth Annual European Symposium"
, site =	"Barcelona, Spain"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"514--528"
, issn =	"3-540-61680-2"
, keywords =	"two-point shortest path queries, fixed orientations, geodesics"
, update =	"00.03 smid, 99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.03 smid"
}

@techreport{am-accgp-90
, author =	"E. Arkin and J. Mitchell"
, title =	"Applications of combinatorics and computational geometry to pattern recognition"
, type =	"Technical {Report}"
, institution =	"Cornell Univ."
, address =	"Ithaca, NY"
, year =	1990
, update =	"98.03 bibrelex"
}

@techreport{a-bih-88
, author =	"Esther M. Arkin"
, title =	"Beautification is hard"
, type =	"Technical {Report}"
, number =	818
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1988
, keywords =	"clustering"
, update =	"98.03 mitchell"
}

@techreport{abmmrss-tsp-93t
, author =	"Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
, title =	"Testing simple polygons"
, number =	"TR-93-14"
, institution =	"DIMACS"
, month =	apr
, year =	1993
, precedes =	"abmmrss-tsp-93, abmmrss-tsp-97"
, update =	"98.11 bibrelex"
}

@inproceedings{abmmrss-tsp-93
, author =	"Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
, title =	"Testing simple polygons"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"387--392"
, keywords =	"probing, point probes, testing, simple polygons"
, succeeds =	"abmmrss-tsp-93t"
, precedes =	"abmmrss-tsp-97"
, cites =	"abmmrss-tsp-93t, bs-ppmih-93, cy-sp-87, k-rop-91, lr-eaiou-89t, m-acvpp-90, r-att-92, rs-tgo-90i, rs-tos-92, s-gp-88, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 96.09 romanik, 95.09 agarwal, 95.01 mitchell, 93.09 milone+mitchell"
}

@article{abmmrss-tsp-97
, author =	"Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
, title =	"Testing simple polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"97--114"
, keywords =	"probing, point probes, testing, simple polygons"
, succeeds =	"abmmrss-tsp-93t, abmmrss-tsp-93"
, update =	"98.11 bibrelex"
}

@inproceedings{abfms-ftphwusr-01
, author =	"E. M. Arkin and M. A. Bender and S. P. Fekete and J. S. B. Mitchell and M. Skutella"
, title =	"The Freeze-Tag Problem: How to Wake Up a Swarm of Robots"
, booktitle =	"Proc. 13th ACM-SIAM Sympos. Discrete Algorithms"
, year =	2002
, note =	"To appear"
, update =	"02.03 orourke"
}

@techreport{achkm-ecmcp-89
, author =	"E. M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and J. S. B. Mitchell"
, title =	"An efficiently computable metric for comparing polygonal shapes"
, type =	"Technical {Report}"
, number =	"TR 89-1007"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	may
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{achkm-ecmcp-90
, author =	"Esther M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and Joseph S. B. Mitchell"
, title =	"An efficiently computable metric for comparing polygonal shapes"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"129--137"
, keywords =	"matching, shape, polygons"
, update =	"98.03 mitchell"
}

@article{achkm-ecmcp-91
, author =	"Esther M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and Joseph S. B. Mitchell"
, title =	"An efficiently computable metric for comparing polygonal shapes"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	13
, number =	3
, year =	1991
, pages =	"209--216"
, keywords =	"polygon, distance, shape, similarity"
, update =	"98.03 mitchell, 95.05 korneenko"
}

@inproceedings{achmssy-omah-96
, author =	"Esther M. Arkin and Y.-J. Chiang and Martin Held and Joseph S. B. Mitchell and V. Sacristan and Steven S. Skiena and T.-C. Yang"
, title =	"On minimum-area hulls"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"334--348"
, precedes =	"achmssy-omah-98"
, update =	"98.03 mitchell"
}

@article{achmssy-omah-98
, author =	"Esther M. Arkin and Y.-J. Chiang and Martin Held and Joseph S. B. Mitchell and V. Sacristan and Steven S. Skiena and T.-C. Yang"
, title =	"On minimum-area hulls"
, journal =	"Algorithmica"
, volume =	21
, year =	1998
, pages =	"119--136"
, succeeds =	"achmssy-omah-96"
, update =	"01.07 devillers, 98.03 mitchell"
}

@inproceedings{acmsy-mst-97
, author =	"Esther M. Arkin and Y.-J. Chiang and Joseph S. B. Mitchell and Steven S. Skiena and T. Yang"
, title =	"On the Maximum Scatter {TSP}"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '97"
, year =	1997
, pages =	"211--220"
, keywords =	"TSP, MAX TSP, bottleneck TSP, approximation algorithms"
, update =	"98.03 mitchell"
}

@inproceedings{acm-mpoap-89
, author =	"Esther M. Arkin and R. Connelly and Joseph S. B. Mitchell"
, title =	"On monotone paths among obstacles, with applications to planning assemblies"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"334--343"
, keywords =	"path planning, monotonicity, assembly, visibility, separability"
, cites =	"cr-nlbtr-87, gm-osacv-87t, gh-ospqs-87, gy-tsr-80, ps-tspm-81, t-mss-85, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@techreport{afm-aalmm-97
, author =	"Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
, title =	"Approximation Algorithms for Lawn Mowing and Milling"
, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
, year =	1997
, url =	"ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr97-255.ps.gz"
, keywords =	"NC machining, covering, TSP, TSP with neighborhoods, approximation algorithms, NP-completeness, traveling salesman problem, shortest paths, watchman routes, lawn mowing, milling, NC machines; 68Q25, 68U05, 90C27, 90C28, 90C35"
, succeeds =	"afm-lp-93,afm-aalm-95"
, update =	"01.04 smid, 98.03 mitchell"
, abstract =	"We study the problem of finding shortest tours/paths for ``lawn
mowing'' and ``milling'' problems: Given a region in the plane, and
given the shape of a ``cutter'' (typically, a circle or a square), find
a shortest tour/path for the cutter such that every point within the
region is covered by the cutter at some position along the
tour/path. In the milling version of the problem, the cutter is
constrained to stay within the region. The milling problem arises
naturally in the area of automatic tool path generation for NC
pocket machining. The lawn mowing problem arises in optical
inspection, spray painting, and optimal search planning.
\par
Both problems are NP-hard in general. We give efficient
constant-factor approximation algorithms for both problems. In
particular, we give a $(3+\epsilon)$-approximation algorithm for
the lawn mowing problem and a 2.5-approximation
algorithm for the milling problem. Furthermore, we give a simple
6/5-approximation algorithm for the TSP problem in simple
grid graphs, which leads to an 11/5-approximation algorithm
for milling simple rectilinear polygons."
}

@article{afm-aalmm-00
, author =	"E. M. Arkin and S. P. Fekete and J. S. B. Mitchell"
, title =	"Approximation algorithms for lawn mowing and milling"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"25--50"
, update =	"01.04 smid"
}

@techreport{afm-aalm-95
, author =	"Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
, title =	"Approximation algorithms for lawnmowing and milling"
, type =	"Report"
, institution =	"University at Stony Brook"
, year =	1995
, keywords =	"NC machining, covering, TSP, TSP with neighborhoods"
, succeeds =	"afm-lp-93"
, precedes =	"afm-aalmm-97"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.01 mitchell"
}

@inproceedings{afm-lp-93
, author =	"Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
, title =	"The lawnmower problem"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"461--466"
, precedes =	"afm-aalm-95,afm-aalmm-97"
, cites =	"ah-aagcs-91, c-tsplt-91a, e-hpnrg-86, f-gtsp-92, f-ldead-72, h-cgpm-91, ips-hpgg-82, jp-cctsp-85, n-wrlv-92, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 96.01 mitchell"
}

@inproceedings{afms-mpsms-01
, author =	"Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Steven S. Skiena"
, title =	"On the Manufacturability of Paperclips and Sheet Metal Structures"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"187--190"
, update =	"01.04 icking"
}

@inproceedings{agmmps-ppdtg-93
, author =	"Esther M. Arkin and Michael T. Goodrich and Joseph S. B. Mitchell and David Mount and Christine D. Piatko and Steven S. Skiena"
, title =	"Point Probe Decision Trees for Geometric Concept Classes"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"95--106"
, update =	"94.09 piatko, 93.09 milone+mitchell+smid, 93.05 jones"
}

@inproceedings{ahkmn-astse-91
, author =	"Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
, title =	"Arrangements of segments that share endpoints: {Single} face results"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"324--333"
, keywords =	"arrangements, segments, Davenport-Schinzel sequences, zone theorems"
, comments =	"The proof of the Exposure Lemma, which results in bound of $O(h\alpha(h))$ on the
		 single cell complexity, is in error.  A corrected proof is given in
		 \cite{ahkmn-astse-94}, where the upper bound of $O(h \log h)$ is proved.
		 There remains a gap between this and the lower bound of $\Omega(h\alpha(h))$."
, precedes =	"ahkmn-astse-94"
, cites =	"abp-oabcu-90, cegss-cfals-91, egs-ccmfa-90, gss-gmppt-89, l-cpe-79, m-csfal-90, mrw-mlpop-90, pss-stsps-88, ws-prnds-88, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 efrat, 95.01 mitchell, 95.01 mitchell"
}

@techreport{ahkmn-astse-94
, author =	"Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
, title =	"Arrangements of segments that share endpoints: {Single} face results"
, institution =	"SUNY Stony Brook"
, year =	1994
, keywords =	"arrangements, segments, Davenport-Schinzel sequences, zone theorems"
, succeeds =	"ahkmn-astse-91"
, update =	"98.03 mitchell, 95.01 mitchell, 95.01 mitchell"
}

@article{ahkmn-astse-95
, author =	"Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
, title =	"Arrangements of segments that share endpoints: {Single} face results"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"257--270"
, succeeds =	"ahkmn-astse-94"
, update =	"98.03 mitchell, 95.09 agarwal"
}

@techreport{ah-aagcs-91
, author =	"Esther M. Arkin and R. Hassin"
, title =	"Approximation Algorithms for the Geometric Covering Salesman Problem"
, type =	"Technical Report"
, number =	968
, institution =	"School of Operations Research and Industrial Engineering, Cornell University"
, month =	jul
, year =	1991
, precedes =	"ah-aagcs-94"
, update =	"98.11 bibrelex"
}

@article{ah-aagcs-94
, author =	"Esther M. Arkin and R. Hassin"
, title =	"Approximation Algorithms for the Geometric Covering Salesman Problem"
, journal =	"Discrete Appl. Math."
, volume =	55
, year =	1994
, pages =	"197--218"
, succeeds =	"ah-aagcs-91"
, update =	"98.11 bibrelex, 98.03 mitchell, 96.09 devillers, 95.09 mitchell"
}

@unpublished{ahk-rdpn-94
, author =	"Esther M. Arkin and R. Hassin and L. Klein"
, title =	"Restricted Delivery Problems on a Network"
, year =	1994
, note =	"Manuscript"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@inproceedings{ahm-madcg-95
, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell"
, title =	"Manufacturing: {A}n application domain for computational geometry"
, booktitle =	"First Regional Symposium on Manufacturing Science and Technology"
, site =	"Stony Brook, NY"
, month =	oct
, year =	1995
, pages =	"29--36"
, update =	"00.11 smid, 00.07 icking, 98.03 mitchell, 96.01 mitchell"
}

@inproceedings{ahms-htfr-94
, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
, title =	"Hamiltonian Triangulations for Fast Rendering"
, editor =	"J. van Leeuwen"
, booktitle =	"Algorithms -- ESA'94"
, site =	"Utrecht, NL"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, month =	sep
, year =	1994
, pages =	"36--47"
, keywords =	"triangulation, tri-strips, mesh generation, rendering, sequential triangulation, ribbons"
, update =	"98.03 mitchell, 96.05 agarwal, 95.01 held"
}

@article{ahms-htfr-96
, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
, title =	"Hamiltonian Triangulations for Fast Rendering"
, journal =	"Visual Comput."
, volume =	12
, number =	9
, year =	1996
, pages =	"429--444"
, keywords =	"triangulation, tri-strips, mesh generation, rendering, sequential triangulation, ribbons"
, succeeds =	"ahms-htfr-94"
, update =	"98.03 mitchell, 97.11 held"
}

@inproceedings{ahms-rppwm-95
, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
, title =	"Recognizing Polygonal Parts from Width Measurements"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"199--204"
, precedes =	"ahms-rppwm-98"
, update =	"98.03 mitchell, 95.09 jones"
}

@article{ahms-rppwm-98
, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
, title =	"Recognizing Polygonal Parts from Width Measurements"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, number =	4
, year =	1998
, pages =	"237--246"
, succeeds =	"ahms-rppwm-95"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@techreport{ahs-oprzp-95
, author =	"Esther M. Arkin and Martin Held and C. L. Smith"
, title =	"Optimization problems related to zigzag pocket machining"
, type =	"Manuscript"
, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
, year =	1995
, update =	"98.03 mitchell, 95.09 mitchell"
}

@inproceedings{ahs-oprzp-96
, author =	"Esther M. Arkin and Martin Held and Christopher L. Smith"
, title =	"Optimization problems related to zigzag pocket machining"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"419--428"
, keywords =	"CAD, NC-machining, milling, lawnmower problem, retractions, approximation, NP-hardness"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@inproceedings{ahs-oprzp-96c
, author =	"Esther M. Arkin and Martin Held and Christopher L. Smith"
, title =	"Optimization Problems Related to Zigzag Pocket Machining"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"109--111"
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{ahs-oprzp-00
, author =	"E. M. Arkin and M. Held and C. L. Smith"
, title =	"Optimization Problems Related to Zigzag Pocket Machining"
, journal =	"Algorithmica"
, volume =	26
, number =	2
, year =	2000
, pages =	"197--236"
, update =	"00.03 held"
}

@inproceedings{ahmss-00
, author =	"E. M. Arkin and F. Hurtado and J. S. B. Mitchell and C. Seara and S. S. Skiena"
, title =	"Some Separability Problems in the Plane"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"51--54"
, update =	"00.03 bibrelex"
}

@inproceedings{akmsw-mpnrc-91
, author =	"Esther M. Arkin and K. Kedem and Joseph S. B. Mitchell and J. Sprinzak and M. Werman"
, title =	"Matching points into noise regions: combinatorial bounds and algorithms"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"42--51"
, keywords =	"matching, similarity"
, precedes =	"akmsw-mppdn-92"
, update =	"98.03 mitchell"
}

@article{akmsw-mppdn-92
, author =	"Esther M. Arkin and K. Kedem and Joseph S. B. Mitchell and J. Sprinzak and M. Werman"
, title =	"Matching points into pairwise-disjoint noise regions: combinatorial bounds and algorithms"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"375--386"
, keywords =	"matching, similarity"
, succeeds =	"akmsw-mpnrc-91"
, update =	"98.03 mitchell"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@inproceedings{akm-gkp-91
, author =	"Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
, title =	"Geometric knapsack problems"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"165--176"
, precedes =	"akm-gkp-93"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@article{akm-gkp-93
, author =	"Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
, title =	"Geometric knapsack problems"
, journal =	"Algorithmica"
, volume =	10
, year =	1993
, pages =	"399--427"
, succeeds =	"akm-gkp-91"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@inproceedings{akm-oep-89
, author =	"Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
, title =	"Optimal enclosure problems"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	36
, keywords =	"partitioning, enclosure, knapsack, optimization"
, precedes =	"akm-gkp-93"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@inproceedings{ammrs-dtgm-93
, author =	"Esther M. Arkin and H. Meijer and Joseph S. B. Mitchell and D. Rappaport and S. S. Skiena"
, title =	"Decision trees for geometric models"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"369--378"
, precedes =	"ammrs-dtgm-98"
, cites =	"am-accgp-90, bs-ppmh-91, b-dscns-86, bgg-raor-88, bggm-p2trd-90, ce-oails-92, cd-mbrrv-86, fpp-hdpgg-90, e-acg-87, fs-hfb-89, fpt-opcpa-81, fntv-sltjs-90, g-obip-72, gl-trluo-84, g-agtpg-80, g-clcmb-86, gl-lopsi-87, hmrt-sjslt-86, hr-cobdt-76, j-aacp-74, js-mbpsc-92, l-pftu-82, lr-eaiou-94, m-dtd-82, p-cpav-91, s-irgp-92, ZZZ"
, update =	"98.11 devillers, 98.07 devillers, 98.03 bibrelex+mitchell, 93.09 jones"
}

@article{ammrs-dtgm-98
, author =	"Esther M. Arkin and H. Meijer and Joseph S. B. Mitchell and D. Rappaport and S. S. Skiena"
, title =	"Decision trees for geometric models"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"343--364"
, succeeds =	"ammrs-dtgm-93"
, update =	"98.11 devillers"
}

@techreport{am-ovasp-87
, author =	"Esther M. Arkin and Joseph S. B. Mitchell"
, title =	"An optimal visibility algorithm for a simple polygon with star-shaped holes"
, type =	"Technical {Report}"
, number =	746
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1987
, keywords =	"visibility, hidden line/surface elimination, plane-sweep"
, update =	"98.03 mitchell"
}

@inproceedings{amn-rcgno-98
, author =	"Esther M. Arkin and Joseph S. B. Mitchell and Giri Narasimhan"
, title =	"Resource-Constrained Geometric Network Optimization"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"307--316"
, keywords =	"orienteering, generalized TSP, bank robber problem, approximation algorithms, guillotine subdivisions"
, update =	"01.11 smid, 98.03 mitchell"
}

@techreport{amp-mlwt-94
, author =	"Esther M. Arkin and Joseph S. B. Mitchell and C. Piatko"
, title =	"Minimum-link watchman tours"
, type =	"Report"
, institution =	"University at Stony Brook"
, year =	1994
, update =	"98.03 mitchell, 96.05 mitchell"
}

@inproceedings{amp-bsppp-91
, author =	"Esther M. Arkin and Joseph S. B. Mitchell and C. D. Piatko"
, title =	"Bicriteria shortest path problems in the plane"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"153--156"
, succeeds =	"amp-gbpp-90"
, cites =	"aw-vgoas-88, amp-gbpp-90, cdrx-ckp-88, gj-cigtn-79, gm-osacv-87, h-bpp-80, l-conm-76, m-aaorp-90, mp-wrpfs-91, mrw-mlpop-90, s-ltaml-86, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@unpublished{amp-gbpp-90
, author =	"E. M. Arkin and J. S. B. Mitchell and C. D. Piatko"
, title =	"Geometric Bicriteria Path Problems"
, year =	1990
, note =	"Manuscript in Preparation"
, precedes =	"amp-bsppp-91"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@article{ams-ltlpq-95
, author =	"Esther M. Arkin and Joseph S. B. Mitchell and Subhash Suri"
, title =	"Logarithmic-time link path queries in a simple polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, number =	4
, year =	1995
, pages =	"369--395"
, keywords =	"link distance, shortest paths, geodesic paths"
, succeeds =	"ams-olpqs-92"
, update =	"98.03 mitchell, 96.01 mitchell"
}

@inproceedings{ams-olpqs-92
, author =	"Esther M. Arkin and Joseph S. B. Mitchell and Subhash Suri"
, title =	"Optimal link path queries in a simple polygon"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"269--279"
, precedes =	"ams-ltlpq-95"
, update =	"98.03 mitchell, 96.01 mitchell"
}

@techreport{amz-apmp-89
, author =	"Esther M. Arkin and Joseph S. B. Mitchell and K. Zikan"
, title =	"Algorithms for point matching problems"
, type =	"Manuscript"
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1989
, keywords =	"matching, computer vision"
, update =	"98.03 mitchell"
}

@article{am-anme-90
, author =	"R. Arkin and R. R. Murphy"
, title =	"Autonomous Navigation in a manufacturing environment"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, number =	4
, year =	1990
, pages =	"445--454"
, update =	"93.09 milone+mitchell"
}

@article{ate-plcsl-89
, author =	"D. Armitage and J. I. Thakara and W. D. Eades"
, title =	"Photoaddressed liquid crystal spatial light modulators"
, journal =	"Appl. Optics"
, volume =	28
, number =	22
, year =	1989
, pages =	"4763--4771"
, update =	"97.11 bibrelex"
}

@inproceedings{ar-dsa-93
, author =	"D. Armon and John Reif"
, title =	"A Dynamic Separator Algorithm"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"107--118"
, update =	"93.09 milone+mitchell"
}

@inproceedings{armldm-mmm-95
, author =	"C. G. Armstrong and D. J. Robinson and R. M. McKeag and T. S. Li and S. J. Bridgett and R. J. Donaghy and C. A. McGleenan"
, title =	"Medials for Meshing and More"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"277--289"
, update =	"96.01 samitchell"
}

@phdthesis{a-sagni-82
, author =	"G. T. Armstrong"
, title =	"A Study of Automatic Generation of Non-Invasive Machine Paths from Geometric Models"
, school =	"Univ. Leeds"
, address =	"Leeds, UK"
, month =	oct
, year =	1982
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@incollection{acp-ncggm-84
, author =	"G. T. Armstrong and G. C. Carey and A. de Pennington"
, title =	"Numerical Code Generation from a Geometric Modeling System"
, editor =	"M. S. Pickett and J. W. Boyse"
, booktitle =	"Solid Modeling by Computers: {From} Theory to Applications"
, publisher =	"Plenum Press"
, address =	"Ne York, NY"
, year =	1984
, update =	"98.03 bibrelex"
}

@book{a-bt-79
, author =	"M. A. Armstrong"
, title =	"Basic Topology"
, publisher =	"McGraw-Hill"
, address =	"London, UK"
, year =	1979
, update =	"97.11 bibrelex"
}

@article{acp-cfekt-87
, author =	"S. Arnborg and D. G. Corneil and A. Proskurowski"
, title =	"Complexity of finding embeddings in a $k$-tree"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	8
, year =	1987
, pages =	"277--284"
, update =	"97.11 bibrelex"
}

@article{af-adrc-88
, author =	"S. Arnborg and H. Feng"
, title =	"Algebraic decomposition of regular curves"
, journal =	"J. Symbolic Comput."
, volume =	15
, number =	1
, year =	1988
, pages =	"131--140"
, keywords =	"polygons, algebraic geometry, curvilinear"
, update =	"95.05 korneenko"
}

@article{ap-crp3t-86
, author =	"S. Arnborg and A. Proskurowski"
, title =	"Characterization and recognition of partial $3$-trees"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	7
, year =	1986
, pages =	"305--314"
, update =	"97.11 bibrelex"
}

@article{am-uvtps-84
, author =	"D. B. Arnold and W. J. Milne"
, title =	"The use of {Voronoi} tessellations in processing soil survey results"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	4
, year =	1984
, pages =	"22--28"
, keywords =	"application, Voronoi diagrams, subdivision"
}

@book{ag-jpl-96
, author =	"K. Arnold and J. Gosling"
, title =	"The Java Programming Language"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1996
, update =	"98.07 tamassia"
}

@article{a-sicp-80
, author =	"V. I. Arnold"
, title =	"Statistics of integral convex polytopes"
, journal =	"Functional Anal. Appl."
, volume =	14
, year =	1980
, pages =	"1--3"
, update =	"97.11 bibrelex"
}

@article{a-bqera-88
, author =	"D. Arnon"
, title =	"A bibliography of quantifier elimination for real algebraic fields"
, journal =	"J. Symbolic Comput."
, volume =	5
, year =	1988
, pages =	"267--274"
, keywords =	"algebraic geometry, bibliography"
, update =	"95.05 korneenko"
}

@article{a-grla-88
, author =	"D. Arnon"
, title =	"Geometric reasoning with logic and algebra"
, journal =	"Artif. Intell."
, volume =	37
, number =	1
, year =	1988
, pages =	"37--60"
, keywords =	"algebraic geometry, geometric reasoning"
, update =	"96.09 devillers, 95.05 korneenko"
}

@book{ab-arag-88
, title =	"Algorithms in Real Algebraic Geometry"
, editor =	"D. S. Arnon and B. Buchberger"
, volume =	"5/1, 2"
, publisher =	"??"
, year =	1988
, note =	"Special issue of the Journal of Symbolic Computation"
, update =	"98.03 bibrelex"
}

@article{acm-aacad-88
, author =	"D. S. Arnon and G. E. Collins and S. {McCallum}"
, title =	"An adjacency algorithm for cylindrical algebraic decomposition in three-dimensional space"
, journal =	"J. Symbolic Comput."
, volume =	5
, number =	"1--2"
, year =	1988
, pages =	"163--187"
, keywords =	"algebraic geometry, motion planning"
, update =	"95.05 korneenko"
}

@article{acm-cad1b-84
, author =	"D. S. Arnon and G. E. Collins and S. {McCallum}"
, title =	"Cylindrical algebraic decomposition {I}: {The} basic algorithm"
, journal =	"SIAM J. Comput."
, volume =	13
, number =	4
, year =	1984
, pages =	"865--877"
, keywords =	"algebraic geometry, motion planning"
, update =	"96.05 agarwal, 95.05 korneenko"
}

@article{acm-cad2a-84
, author =	"D. S. Arnon and G. E. Collins and S. {McCallum}"
, title =	"Cylindrical algebraic decomposition {II}: {The} adjacency algorithm for the plane"
, journal =	"SIAM J. Comput."
, volume =	13
, number =	4
, year =	1984
, pages =	"878--889"
, keywords =	"algebraic geometry, motion planning"
, update =	"97.03 agarwal, 95.05 korneenko"
}

@unpublished{a-lbvdc-98
, author =	"B. Aronov"
, title =	"A lower bound on {Voronoi} diagram complexity"
, year =	1998
, note =	"unpublished manuscript"
, update =	"98.03 agarwal"
}

@phdthesis{a-caasd-89
, author =	"B. Aronov"
, title =	"Combinatorial and algorithmic analysis of space decomposition problems"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, month =	feb
, year =	1989
, keywords =	"doctoral thesis"
}

@inproceedings{a-gvdps-87
, author =	"B. Aronov"
, title =	"On the geodesic {Voronoi} diagram of point sites in a simple polygon"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"39--49"
, keywords =	"geodesic distance, Voronoi diagram, simple polygon, shortest path"
, precedes =	"a-gvdps-89"
, cites =	"a-pdpaa-83, aa-vdpsp-, ae-oacwv-84, sb-spbtc-85, c-tpca-82, cd-vdbcd-85, f-savd-86, ghlst-ltavs-86t, gjpt-tsp-78, gs-dfbt-78, iim-vdlgi-85, k-eccs-79, l-prp-78, l-tdvdl-80, lpsssstwy-clcsp-87, lp-esppr-84, ls-ippvd-87, lw-vdllm-80, osy-rnamp-83, ps-cgcsp-86, ps-cgi-85, sh-cpp-75, s-cldsp-86, s-cgdsp-86, t-oacrc-86, tv-otats-86, y-oavds-84, ZZZ"
, update =	"98.03 bibrelex, 95.01 aronov"
}

@article{a-gvdps-89
, author =	"Boris Aronov"
, title =	"On the geodesic {Voronoi} diagram of point sites in a simple polygon"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"109--140"
, keywords =	"geodesic distance, Voronoi diagram, simple polygon, shortest path"
, succeeds =	"a-gvdps-87"
, update =	"96.05 efrat, 95.01 aronov"
, abstract =	"Given a simple polygon with $n$ sides in the plane
and a set of $k$ point ``sites'' in its interior or on the boundary,
compute the Voronoi diagram of the set of sites using the internal
``geodesic'' distance inside the polygon as the metric. We describe an
$O((n+k)\log(n+k)\log n )$-time algorithm for solving this
problem and sketch a faster $O((n+k)\log(n+k))$ algorithm for the case when
the set of sites includes all reflex vertices of the polygon in question."
}

@inproceedings{aas-lalsp-97
, author =	"B. Aronov and P. Agarwal and M. Sharir"
, title =	"On Levels in Arrangements of Lines, Segments, Planes, and Triangles"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"30--38"
, precedes =	"aacs-lalsp-98"
, cites =	"ag-nssfs-86, acegsw-ptphp-91, bfl-nhp-90, bs-enks-94, ceghss-shcp-94, c-blmat-93, cs-arscg-89, de-ctchp-94, e-acg-87, evw-cdpsh-94, elss-dgpps-73, gp-asotd-93, g-saco-80, g-bpstp-79, hs-dccap-91, hs-cdcca-94, hs-cpmfl-92, l-nhl-71, pa-cg-95, pss-ubnpk-92, s-ksacs-91, tt-hcpps-95, w-mksfs-86, ws-prnds-88, vz-ctpci-92, ZZZ"
, update =	"98.07 bibrelex+smid, 98.03 mitchell, 97.07 efrat, 97.03 agarwal, 96.09 agarwal"
}

@inproceedings{abssv-mpmr-98
, author =	"B. Aronov and M. de Berg and A. F. van der Stappen and O. \v{S}vestka and J. Vleugels"
, title =	"Motion planning for multiple robots"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"374--382"
, update =	"00.03 agarwal"
}

@article{advsv-mpmr-99
, author =	"B. Aronov and M. de Berg and A. F. van der Stappen and P. {\v S}vestka and J. Vleugels"
, title =	"Motion Planning for Multiple Robots"
, journal =	"Discrete Comput. Geom."
, volume =	22
, number =	4
, year =	1999
, pages =	"505--525"
, update =	"00.03 bibrelex, 99.11 held"
}

@unpublished{abe-acp-95
, author =	"B. Aronov and M. Bern and D. Eppstein"
, title =	"Arrangements of convex polytopes"
, year =	1995
, note =	"unpublished manuscript"
, update =	"98.03 agarwal"
}

%, number =      1
@article{abe-nm1st-94
, author =	"B. Aronov and M. Bern and D. Eppstein"
, title =	"On the Number of Minimal {1-Steiner} Trees"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"29--34"
, update =	"98.03 aronov"
}

@techreport{abe-ap1sp-91
, author =	"B. Aronov and M. Bern and D. Epstein"
, title =	"Arrangement of polytopes and the $1$-{Steiner} problem"
, type =	"Preprint"
, institution =	"??"
, year =	1991
, update =	"98.07 bibrelex"
}

@inproceedings{acegsw-ptphp-90
, author =	"B. Aronov and Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and R. Wenger"
, title =	"Points and triangles in the plane and halving planes in space"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"112--115"
, keywords =	"combinatorial geometry, halving sets, $k$-sets"
, precedes =	"acegsw-ptphp-91"
, cites =	"ag-nssfs-86, a-pdpaa-87, b-gct-82, bfl-nhp-89, bf-ntccn-84, ceghss-sdash-90, cs-arscg-89, e-acg-87, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-nhl-71, pss-ubnpk-89, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 95.01 aronov"
}

@article{acegsw-ptphp-91
, author =	"Boris Aronov and Bernard Chazelle and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Rephael Wenger"
, title =	"Points and triangles in the plane and halving planes in space"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"435--442"
, keywords =	"combinatorial geometry, halving sets, $k$-sets"
, succeeds =	"acegsw-ptphp-90"
, update =	"95.01 aronov"
, abstract =	"We prove that for any set $S$ of $n$ points in the plane and
  $n^{3-\alpha}$ triangles spanned by the points in $S$ there
  exists a point (not necessarily in $S$) contained in at least
  $n^{3-3\alpha} \over c \log^5n$ of the triangles.
  This implies that any set of $n$ points in three-dimensional space
  defines at most $\sqrt[3]{c \over 2} n^{8/3}\log^{5/3}n$ halving planes."
}

@inproceedings{addpp-vmr-96
, author =	"Boris Aronov and Alan R. Davis and Tamal K. Dey and Sudebkumar P. Pal and D. Chithra Prasad"
, title =	"Visibility with Multiple Reflections"
, booktitle =	"Proc. 5th Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	1097
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"284--295"
, precedes =	"addpp-vmr-98"
, update =	"99.11 bibrelex, 98.11 aronov, 96.09 aronov"
}

%% Edited this from addpp-vmr in old version of geombib--was completely wrong!
%% Yes, the names are abbreviated like that in DCG version. --BA
@article{addpp-vmr-98
, author =	"B. Aronov and A. R. Davis and T. K. Dey and S. P. Pal and D. C. Prasad"
, title =	"Visibility with Multiple Reflections"
, journal =	"Discrete Comput. Geom."
, volume =	20
, year =	1998
, pages =	"61--78"
, succeeds =	"addpp-vmr-96"
, update =	"98.11 aronov, 98.03 agarwal+bibrelex, 97.11 aronov"
}

@article{addpp-vor-98
, author =	"B. Aronov and A. R. Davis and T. K. Dey and S. P. Pal and D. C. Prasad"
, title =	"Visibility with One Reflection"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"553--574"
, succeeds =	"addpp-vr-95"
, update =	"98.11 aronov+held, 97.11 aronov"
}

@inproceedings{addpp-vr-95
, author =	"Boris Aronov and Alan R. Davis and Tamal K. Dey and Sudebkumar P. Pal and D. Chithra Prasad"
, title =	"Visibility with Reflection"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"316--325"
, keywords =	"mirrors"
, precedes =	"addpp-vor-98"
, cites =	"addpp-vmr-96, ak-frtrc-87, bo-arcgi-79, dpp-agpvr-95, ea-lacvp-81, fkn-vsgpt-80, ghlst-ltavs-87, g-bp-86, hv-splsp-49,  k-ealdp-89, kw-onupp-91, l-vsp-83, ll-ccagp-86, lpsssstwy-clcsp-88, o-agta-87, rty-ccrt-94, s-rrag-92, s-mlppr-87, s-sldps-90, ZZZ"
, update =	"99.11 bibrelex, 98.11 aronov, 98.03 bibrelex, 95.09 mitchell"
}

@techreport{aegs-ibcmf-89
, author =	"B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"Improved bounds on the complexity of many faces in arrangements of segments"
, type =	"Report"
, number =	459
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, month =	jul
, year =	1989
, keywords =	"combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
, precedes =	"aegs-nemfl-90"
, update =	"98.03 mitchell"
}

@article{aegs-nemfl-92
, author =	"B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"The number of edges of many faces in a line segment arrangement"
, journal =	"Combinatorica"
, volume =	12
, number =	3
, year =	1992
, pages =	"261--274"
, keywords =	"combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
, succeeds =	"aegs-nemfl-90"
, update =	"98.03 mitchell, 97.11 aronov, 93.09 matousek"
}

@techreport{aegs-nemfl-90
, author =	"B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"The number of edges of many faces in line segment arrangements"
, type =	"Report"
, number =	"90-46"
, institution =	"DIMACS, Rutgers Univ."
, address =	"New Brunswick, NJ"
, month =	jun
, year =	1990
, keywords =	"combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
, succeeds =	"aegs-ibcmf-89"
, precedes =	"aegs-nemfl-92"
, update =	"98.03 mitchell, 97.11 aronov"
}

@inproceedings{aehs-nrvuj-98
, author =	"Boris Aronov and Alon Efrat and Dan Halperin and Micha Sharir"
, title =	"On the Number of Regular Vertices of the Union of {Jordan} Regions"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"322--334"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

@techreport{aes-sbnrv-97
, author =	"Boris Aronov and Alon Efrat and Micha Sharir"
, title =	"A Subquadratic Bound on the Number of Regular Vertices of the Union of {Jordan} Regions"
, type =	"Manuscript"
, institution =	"Tel Aviv University"
, year =	1997
, update =	"98.03 mitchell"
}

@inproceedings{aegkkps-cf-91
, author =	"B. Aronov and P. Erd{\H o}s and W. Goddard and D. J. Kleitman and M. Klugerman and J. Pach and L. J. Schulman"
, title =	"Crossing families"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"351--356"
, keywords =	"partition"
, cites =	"ae-degg-89, cp-tttcc-90, e-acg-87, es-cpg-35, m-ept-91, r-ng-83, ZZZ"
, update =	"97.11 bibrelex"
}

@article{aegkkps-cf-94
, author =	"B. Aronov and P. Erd{\H o}s and W. Goddard and D. J. Kleitman and M. Klugerman and J. Pach and L. J. Schulman"
, title =	"Crossing families"
, journal =	"Combinatorica"
, volume =	14
, year =	1994
, pages =	"127--134"
, keywords =	"partition"
, update =	"97.11 bibrelex"
}

@inproceedings{af-acrsm-97
, author =	"B. Aronov and S. Fortune"
, title =	"Average-Case Ray Shooting and Minimum Weight Triangulations"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"203--211"
, cites =	"a-rs-97, aas-stl3d-95, am-rsss-94, as-anspt-93, be-aagp-97, c-aapts-91, e-acg-87, e-amwst-94, f-btapi-96, hs-parss-93, mms-qsrs-94, m-smga-92, o-cgc-94, s-ipgp-79, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@unpublished{afw-msm-87
, author =	"B. Aronov and S. Fortune and G. Wilfong"
, title =	"Minimum speed motion"
, year =	1987
, note =	"??"
, update =	"98.03 bibrelex"
}

@article{afw-fsgvd-93
, author =	"B. Aronov and S. J. Fortune and G. Wilfong"
, title =	"Furthest-Site Geodesic {Voronoi} Diagram"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"217--255"
, keywords =	"geodesic distance, simple polygon, Voronoi diagram"
, succeeds =	"afw-fsgvd-88"
, update =	"94.05 aronov"
, abstract =	"We present an $O((n+k)\log(n+k))$ time, $O(n+k)$ space
algorithm for computing the furthest-site Voronoi diagram of $k$ point
sites with respect to the geodesic metric within a simple $n$-sided polygon."
}

@inproceedings{afw-fsgvd-88
, author =	"B. Aronov and S. J. Fortune and G. Wilfong"
, title =	"The furthest-site geodesic {Voronoi} diagram"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"229--240"
, keywords =	"geodesic distance, simple polygon, Voronoi diagram"
, precedes =	"afw-fsgvd-93"
, cites =	"a-gvdps-87, at-cgcsp-87, ghlst-ltavs-86, gjpt-tsp-78, lp-esppr-84, psr-cgcsp-89, ps-cgi-85, s-agfnp-87, t-oacrc-86, ZZZ"
, update =	"98.03 bibrelex, 94.05 aronov"
}

@unpublished{agpw-tinhn-
, author =	"B. Aronov and J. E. Goodman and R. Pollack"
, title =	"There is no {Hadwiger} number for line traversals in higher dimensions"
, note =	"Unpublished Manuscript"
, update =	"98.03 bibrelex"
}

@inproceedings{agpw-httht-00
, author =	"Boris Aronov and Jacob E. Goodman and Richard Pollack and Rephael Wenger"
, title =	"A {Helly}-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"57--63"
, update =	"00.11 jones"
}

% issue number 1
@article{am-stl3s-95
, author =	"B. Aronov and J. Matou{\v s}ek"
, title =	"On stabbing triangles by lines in 3-space"
, journal =	"Comment. Math. Univ. Carolinae"
, volume =	36
, year =	1995
, pages =	"109--113"
, update =	"98.03 bibrelex, 97.11 aronov"
}

@inproceedings{ams-sscch-91
, author =	"B. Aronov and J. Matou{\v s}ek and Micha Sharir"
, title =	"On the sum of squares of cell complexities in hyperplane arrangements"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"307--313"
, keywords =	"combinatorial geometry, combinatorial complexity, arrangements, polytopes, hyperplanes"
, comments =	"To appear in {\em Journal Combin. Theory Ser. A}"
, cites =	"aa-cfi-89, as-tsbac-90, as-zasha-91, as-cscas-, cf-plh-91, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-cmcap-90, ess-npzta-, p-caasv-91, p-nrrsi-91, s-ksacs-91, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.09 agarwal"
}

@article{ams-sscch-94
, author =	"B. Aronov and J. Matou{\v s}ek and Micha Sharir"
, title =	"On the sum of squares of cell complexities in hyperplane arrangements"
, journal =	"J. Combin. Theory Ser. A"
, volume =	65
, year =	1994
, pages =	"311--321"
, update =	"98.03 mitchell, 97.11 bibrelex, 94.05 matousek"
}

@article{anps-ipbah-93
, author =	"B. Aronov and D. Q. Naiman and J. Pach and Micha Sharir"
, title =	"An invariant property of balls in arrangements of hyperplanes"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"421--425"
, update =	"98.03 mitchell, 97.11 bibrelex, 94.05 aronov+sharir"
}

@techreport{ao-ampps-87
, author =	"B. Aronov and C. {\'O}'D{\'u}nlaing"
, title =	"Analysis of the motion-planning problem for a simple two-link planar arm"
, type =	"Report"
, number =	314
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, month =	aug
, year =	1987
, keywords =	"motion planning, configuration space"
}

@techreport{ao-nsu-91t
, author =	"B. Aronov and J. O'Rourke"
, title =	"Nonoverlap of the star unfolding"
, type =	"Technical {Report}"
, number =	002
, institution =	"Smith College"
, address =	"Northampton, MA"
, month =	mar
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{ao-nsu-91
, author =	"B. Aronov and J. O'Rourke"
, title =	"Nonoverlap of the star unfolding"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"105--114"
, keywords =	"polytopes, shortest paths, Voronoi diagrams, edge sequences"
, cites =	"ao-nsu-91t, aaos-supa-90, aaos-supa-93, a-digdk-55, a-kp-58, b-cs-58, ch-spp-90, k-ccl-67, p-egcs-73, ss-spps-86, ZZZ"
, update =	"97.11 bibrelex, 93.05 orourke"
}

@article{ao-nsu-92
, author =	"B. Aronov and J. O'Rourke"
, title =	"Nonoverlap of the star unfolding"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"219--250"
, keywords =	"polytopes, shortest paths, Voronoi diagrams, edge sequences"
, update =	"93.05 orourke"
}

@article{aps-zsha-93
, author =	"B. Aronov and M. Pellegrini and Micha Sharir"
, title =	"On the zone of a surface in a hyperplane arrangement"
, journal =	"Discrete Comput. Geom."
, volume =	9
, number =	2
, year =	1993
, pages =	"177--186"
, comments =	"zone of k-dim bounded degree algebraic variety in arrangement of n hyperplanes in d-space has roughly $n^{\lfloor (k+d)/2\rfloor}$ complexity (plus some extra logs)"
, succeeds =	"as-zsha-91, p-zcdps-91"
, update =	"98.03 mitchell, 95.09 aronov, 93.09 matousek"
}

@article{ass-ctsp-93
, author =	"B. Aronov and R. Seidel and D. Souvaine"
, title =	"On compatible triangulations of simple polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, number =	1
, year =	1993
, pages =	"27--35"
, keywords =	"polygon, triagulation"
, update =	"95.05 korneenko"
}

@inproceedings{as-car-92
, author =	"B. Aronov and Micha Sharir"
, title =	"Castles in the air revisited"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"146--156"
, keywords =	"combinatorial geometry, combinatorial complexity, simplex arrangements, popularity, excess"
, precedes =	"as-car-94"
, cites =	"aa-cfi-89, ams-sscch-91, as-tsbac-90, as-zsha-91, cs-arscg-89, e-acg-87, egppss-acptc-92, egs-ccmfa-90, egs-cmcap-90, ess-ztha-93, gss-gmppt-89, h-cscca-91, hks-uevsi-91, ps-ueplf-89, ss-pmp2g-83, ss-tddsp-90, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 95.01 aronov, 93.05 smid"
}

%, number =	2
%, month =	sep
@article{as-car-94
, author =	"B. Aronov and Micha Sharir"
, title =	"Castles in the air revisited"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"119--150"
, keywords =	"combinatorial geometry, combinatorial complexity, simplex arrangements, popularity, excess"
, succeeds =	"as-car-92"
, update =	"98.03 mitchell, 97.11 aronov, 95.01 aronov"
}

@inproceedings{as-ccpsi-01
, author =	"Boris Aronov and Micha Sharir"
, title =	"Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"66--69"
, update =	"01.04 icking"
}

@unpublished{as-cscas-
, author =	"B. Aronov and Micha Sharir"
, title =	"On the complexity of a single cell in an arrangement of simplices in $d$-space"
, note =	"In preparation"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{as-cocat-91
, author =	"B. Aronov and Micha Sharir"
, title =	"On the complexity of one cell in an arrangement of triangles"
, type =	"Manuscript"
, year =	1991
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{as-zsha-91
, author =	"B. Aronov and Micha Sharir"
, title =	"On the zone of a surface in a hyperplane arrangement"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"13--19"
, keywords =	"arrangements, hyperplanes"
, precedes =	"aps-zsha-93"
, update =	"98.03 mitchell, 95.09 aronov"
}

@techreport{as-zasha-91
, author =	"B. Aronov and Micha Sharir"
, title =	"On the Zone of an Algebraic Surface in a Hyperplane Arrangement"
, type =	"Manuscript"
, year =	1991
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{as-tmp3s-94
, author =	"Boris Aronov and Micha Sharir"
, title =	"On Translational Motion Planning in $3$-Space"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"21--30"
, precedes =	"as-tmpcp-97"
, cites =	"as-cecpp-94, as-tsbac-90, as-car-92, as-ucptd-93, bms-plpco-93, c-oaitd-92, cegss-cfals-93, cs-arscg-89, e-acg-87, egs-ueplf-89, gh-atfc-81, gks-ricdv-92, gs-ccrs-87, hy-cctbp-93, hs-actbn-93, klps-ujrcf-86, ms-eracu-91, m-mt-63, ps-ueplf-89, s-eappt-87, v-htiat-73, ZZZ"
, update =	"98.03 bibrelex, 97.11 aronov, 94.09 jones, 94.01 jones"
}

% number = 6
% month = dec
@article{as-tmpcp-97
, author =	"Boris Aronov and Micha Sharir"
, title =	"On Translational Motion Planning of a Convex Polyhedron in $3$-Space"
, journal =	"SIAM J. Comput."
, volume =	26
, year =	1997
, pages =	"1785--1803"
, succeeds =	"as-tmp3s-94"
, update =	"97.11 aronov"
}

@techreport{as-cecpp-94
, author =	"B. Aronov and M. Sharir"
, title =	"The common exterior of convex polygons in the plane"
, type =	"Manuscript"
, institution =	"??"
, year =	1994
, update =	"98.03 bibrelex"
}

@article{as-cecpp-97
, author =	"Boris Aronov and Micha Sharir"
, title =	"The common exterior of convex polygons in the plane"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"139--149"
, update =	"97.11 aronov"
}

@inproceedings{as-ucptd-93
, author =	"Boris Aronov and Micha Sharir"
, title =	"The Union of Convex Polyhedra in Three Dimensions"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"518--527"
, precedes =	"ast-ucptd-97"
, update =	"98.07 bibrelex, 97.11 aronov, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@techreport{as-tsbac-87
, author =	"B. Aronov and M. Sharir"
, title =	"Triangles in space, or building and analyzing castles in the air"
, type =	"Manuscript"
, institution =	"??"
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{as-tsbac-88
, author =	"B. Aronov and Micha Sharir"
, title =	"Triangles in space or building (and analyzing) castles in the air"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"381--391"
, keywords =	"three-dimensional, triangle arrangements"
, precedes =	"as-tsbac-90"
, cites =	"cgl-pgd-85, c-narsc-87, e-acg-87, egppss-acptc-88, egs-ueplf-87, egs-cmfal-88, egs-cmcap-88, eos-calha-86, ew-mnemf-86, hs-ndssg-86, hw-ensrq-87, ps-ueplf-87, pss-stsps-88, ss-cmpti-88, st-pplup-86, ws-prnds-88, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{as-tsbac-90
, author =	"B. Aronov and Micha Sharir"
, title =	"Triangles in space or building (and analyzing) castles in the air"
, journal =	"Combinatorica"
, volume =	10
, number =	2
, year =	1990
, pages =	"137--173"
, keywords =	"three-dimensional, triangle arrangements"
, succeeds =	"as-tsbac-88"
, update =	"98.03 mitchell"
}

% number = 6
% month = dec
@article{ast-ucptd-97
, author =	"Boris Aronov and Micha Sharir and Boaz Tagansky"
, title =	"The Union of Convex Polyhedra in Three Dimensions"
, journal =	"SIAM J. Comput."
, volume =	26
, year =	1997
, pages =	"1670--1688"
, succeeds =	"as-ucptd-93"
, update =	"97.11 aronov"
}

@article{a-efslc-67
, author =	"G. Aronsson"
, title =	"Extensions of functions satisfying {Lipschitz} conditions"
, journal =	"Arkiv f{\"o}r Matematik"
, volume =	28
, year =	1967
, pages =	"551--561"
, update =	"98.07 bibrelex"
}

@techreport{a-phfcd-94
, author =	"Gunnar Aronsson"
, title =	"On $p$-harmonic functions, convex duality and an asymptotic formula for injection mold filling"
, type =	"Technical {Report}"
, number =	"LiTH-MAT-R-94-27"
, institution =	"Link{\"o}ping University"
, month =	jun
, year =	1994
, keywords =	"injection molding, continuous Dijkstra, shortest paths, wavefront propagation"
, update =	"96.05 mitchell"
}

@techreport{a-spdfc-95
, author =	"Gunnar Aronsson"
, title =	"On some properties of a distance function and a connection to injection molding"
, type =	"Technical {Report}"
, number =	"LiTH-MAT-R-95-03"
, institution =	"Link{\"o}ping University"
, month =	jan
, year =	1995
, keywords =	"injection molding, continuous Dijkstra, geodesic metric, shortest paths, wavefront propagation"
, update =	"96.05 mitchell"
}

@inproceedings{a-nltas-97
, author =	"S. Arora"
, title =	"Nearly Linear Time Approximation Schemes for {Euclidean} {TSP} and Other Geometric Problems"
, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '97"
, year =	1997
, pages =	"554--563"
, update =	"98.07 bibrelex, 98.03 agarwal+mitchell"
}

@article{a-ptase-98
, author =	"Sanjeev Arora"
, title =	"Polynomial time approximation schemes for {Euclidean} traveling salesman and other geometric problems"
, journal =	"J. ACM"
, volume =	45
, number =	5
, year =	1998
, pages =	"753--782"
, update =	"01.04 icking, 00.11 smid, 00.07 agarwal"
}

@inproceedings{a-ptase-96
, author =	"Sanjeev Arora"
, title =	"Polynomial time approximation schemes for {Euclidean} {TSP} and other geometric problems"
, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1996
, pages =	"2--11"
, update =	"01.04 icking, 97.03 agarwal, 96.05 agarwal"
}

@inproceedings{abss-haolc-93
, author =	"Sanjeev Arora and L. Babai and J. Stern and Z. Sweedyk"
, title =	"The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"724--733"
, update =	"01.04 icking, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{agkkw-ptasw-98
, author =	"Sanjeev Arora and Michelangelo Grigni and David Karger and Philip Klein and Andrzej Woloszyn"
, title =	"A Polynomial-Time Approximation Scheme for Weighted Planar Graph {TSP}"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"33--41"
, comments =	"running time {$n^{O(1/\epsilon^2)}$}"
, update =	"99.07 bibrelex, 98.07 mitchell"
}

@incollection{al-ha-97
, author =	"Sanjeev Arora and Carsten Lund"
, title =	"Hardness of approximations"
, editor =	"D. S. Hochbaum"
, booktitle =	"Approximation Algorithms for NP-Hard Problems"
, publisher =	"PWS Publishing Company"
, address =	"Boston, MA"
, year =	1997
, pages =	"399--446"
, update =	"97.07 smid, 97.03 agarwal, 96.09 agarwal"
}

@techreport{almss-iap-92
, author =	"S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy"
, title =	"On the Intractability of Approximation Problems"
, type =	"Manuscript"
, institution =	"??"
, year =	1992
, update =	"98.07 bibrelex"
}

@inproceedings{arr-asekm-98
, author =	"Sanjeev Arora and Prabhakar Raghavan and Satish Rao"
, title =	"Approximation schemes for {Euclidean} $k$-median and related problems"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, year =	1998
, pages =	"106--113"
, update =	"01.04 icking, 98.07 agarwal"
}

@inproceedings{arr-ptase-98
, author =	"S. Arora and P. Raghavan and S. Rao"
, title =	"Polynomial time approximation schemes for the {Euclidean} {$k$}-medians problem"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, year =	1998
, pages =	"to appear"
, update =	"98.03 mitchell"
}

@inproceedings{ak-mdspl-89
, author =	"D. Arqu{\`e}s and P. Koch"
, title =	"Mod{\'e}lisation de solides par les pavages"
, booktitle =	"Proc. of Pixim '89"
, site =	"Paris, France"
, month =	sep
, year =	1989
, pages =	"47--61"
, update =	"98.07 bibrelex"
}

@book{a-ocds-89
, title =	"Optical Computing: Digital and Symbolic"
, editor =	"R. Arrathoon"
, publisher =	"Marcel Dekker, Inc."
, year =	1989
, keywords =	"angular resolution"
, update =	"94.05 tamassia"
}

@book{as-dsdem-92
, author =	"D. K. Arrowsmith and C. M. Smith"
, title =	"Dynamical Systems. Differential Equations, Maps, and Chaotic Behavior"
, publisher =	"Chapman and Hall"
, address =	"London"
, year =	1992
, update =	"98.11 bibrelex"
}

@article{afh-tdie3-81
, author =	"E. Artzy and G. Frieder and G. T. Herman"
, title =	"The theory, design, implementation, and evaluation of $3$-d surface detection algorithms"
, journal =	"Comput. Graph. Image Process."
, volume =	15
, year =	1981
, pages =	"1--24"
}

@article{ahb-lsft3-87
, author =	"K. S. Arun and T. S. Huang and S. D. Blostein"
, title =	"Least squares fitting of two $3$-d point sets"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-9"
, number =	5
, month =	sep
, year =	1987
, update =	"98.07 bibrelex"
}

@inproceedings{akm-hrsss-93
, author =	"V. Arvind and J. Kobler and M. Mundhenk"
, title =	"Hausdorff reduction to sparse sets and to sets of high information content"
, booktitle =	"Proc. 18th Internat. Sympos. Math. Found. Comput. Sci."
, nickname =	"MFCS '93"
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@book{a-gg2-91
, title =	"Graphics Gems {II}"
, editor =	"James Arvo"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1991
, update =	"98.07 tamassia+vismara"
}

@incollection{a-rrm-91
, author =	"J. Arvo"
, title =	"Random rotation matrics"
, editor =	"J. Arvo"
, booktitle =	"Graphics Gems II"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1991
, pages =	"355--356"
, update =	"97.07 orourke"
}

@article{a-ijpop-94
, author =	"J. Arvo"
, title =	"The irradiance {Jacobian} for partially occluded polyhedral sources"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1994
, pages =	"343--350"
, note =	"Proc. SIGGRAPH '94"
, update =	"98.03 bibrelex"
}

@inproceedings{ak-frtrc-87
, author =	"J. Arvo and D. Kirk"
, title =	"Fast ray tracing by ray classification"
, editor =	"M. C. Stone"
, booktitle =	"Proc. SIGGRAPH '87"
, year =	1987
, pages =	"55--63"
, update =	"97.11 bibrelex"
}

@inproceedings{aksm-agdss-85
, author =	"A. Arya and A. Kumar and V. Swaminathan and A. Misra"
, title =	"Automatic Generation of Digital System Schematic Diagrams"
, booktitle =	"Proc. 22nd Design Autom. Conf."
, year =	1985
, pages =	"388--395"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{acm-aamtm-98
, author =	"Sunil Arya and Siu-Wing Cheng and David Mount"
, title =	"Approximation Algorithms for Multiple-Tool Milling"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"to appear"
, update =	"98.03 mitchell"
}

@article{acm-aamtm-01
, author =	"S. Arya and S.-W. Cheng and D. M. Mount"
, title =	"Approximation Algorithm for Multiple-Tool Milling"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"339--372"
, update =	"01.07 smid"
}

@inproceedings{admss-esstl-95
, author =	"S. Arya and G. Das and D. M. Mount and J. S. Salowe and M. Smid"
, title =	"Euclidean spanners: short, thin, and lanky"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '95"
, year =	1995
, pages =	"489--498"
, update =	"98.07 bibrelex, 97.03 agarwal, 95.09 smid"
}

@inproceedings{amn-abenn-95
, author =	"S. Arya and D. Mount and O. Narayan"
, title =	"Accounting for Boundary Effects in Nearest Neighbor Searching"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"336--344"
, keywords =	""
, cites =	"am-annqf-93, am-afvq-93, amnsw-oaann-94, bo-ammse-78, b-mbstu-75, c-aacpq-94, c-aafnn-79, fbf-afbml-77, gg-vqsc-91, gt-smmp-60, r-oeapb-74, s-rnns-91, w-bires-71, ZZZ"
, update =	"98.03 bibrelex, 96.05 agarwal, 95.09 mitchell"
}

@inproceedings{am-afvq-93
, author =	"S. Arya and D. M. Mount"
, title =	"Algorithms for Fast Vector Quantization"
, booktitle =	"Data Compression Conference"
, nickname =	"DCC '93"
, publisher =	"IEEE Press"
, year =	1993
, pages =	"381--390"
, update =	"95.09 agarwal, 94.05 smid, 93.09 milone+mitchell"
}

@inproceedings{am-annqf-93
, author =	"S. Arya and D. M. Mount"
, title =	"Approximate Nearest Neighbor Queries in Fixed Dimensions"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"271--280"
, update =	"93.05 smid"
}

@inproceedings{am-ars-95
, author =	"Sunil Arya and David M. Mount"
, title =	"Approximate Range Searching"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"172--181"
, keywords =	"quadtrees, box decomposition trees"
, cites =	"amnsw-oaann-94, b-kdtsp-90, bcp-hhihr-93, ck-dmdps-92, ck-adcpn-95, c-lbcpr-89, cw-qorss-89, c-faann-83, fm-rpdsa-85, m-rsehc-93, o-plfs-92, ps-cgi-85, s-dasds-90, v-oaann-89, ZZZ"
, update =	"98.03 bibrelex, 96.05 agarwal, 95.09 mitchell"
}

@article{am-ars-00
, author =	"S. Arya and D. M. Mount"
, title =	"Approximate range searching"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"135--152"
, update =	"01.04 smid"
}

@techreport{amn-abenn-94
, author =	"S. Arya and D. M. Mount and O. Narayan"
, title =	"Accounting for boundary effects in nearest neighbor searching"
, type =	"Report"
, number =	"MPI-I-94-159"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"95.01 smid"
}

@article{amn-abenn-96
, author =	"S. Arya and D. M. Mount and O. Narayan"
, title =	"Accounting for boundary effects in nearest-neighbor searching"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"155--176"
, update =	"97.03 smid"
}

@inproceedings{amnsw-oaann-94
, author =	"S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman and A. Wu"
, title =	"An optimal algorithm for approximate nearest neighbor searching"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"573--582"
, update =	"94.05 smid"
}

@article{amnsw-oaann-98
, author =	"S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman and A. Wu"
, title =	"An optimal algorithm for approximate nearest neighbor searching in fixed dimensions"
, journal =	"J. ACM"
, volume =	45
, year =	1998
, pages =	"891--923"
, update =	"00.11 smid, 00.07 agarwal"
}

@techreport{ams-dagss-94
, author =	"S. Arya and D. M. Mount and M. Smid"
, title =	"Dynamic algorithms for geometric spanners of small diameter: randomized solutions"
, type =	"Report"
, number =	"MPI-I-94-156"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"95.01 smid"
}

@article{ams-dagss-99
, author =	"S. Arya and D. M. Mount and M. Smid"
, title =	"Dynamic algorithms for geometric spanners of small diameter: {Randomized} solutions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"91--107"
, update =	"99.11 smid"
}

@inproceedings{ams-rdags-94
, author =	"S. Arya and D. M. Mount and M. Smid"
, title =	"Randomized and deterministic algorithms for geometric spanners of small diameter"
, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1994
, pages =	"703--712"
, update =	"95.01 smid"
}

@techreport{as-ecbds-94t
, author =	"S. Arya and M. Smid"
, title =	"Efficient construction of a bounded degree spanner with low weight"
, type =	"Report"
, number =	"MPI-I-94-115"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"95.01 smid, 94.05 smid"
}

@inproceedings{as-ecbds-94i
, author =	"S. Arya and M. Smid"
, title =	"Efficient construction of a bounded degree spanner with low weight"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, nickname =	"ESA '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"48--59"
, precedes =	"as-ecbds-97"
, update =	"97.03 smid, 95.01 smid"
}

@article{as-ecbds-97
, author =	"S. Arya and M. Smid"
, title =	"Efficient construction of a bounded-degree spanner with low weight"
, journal =	"Algorithmica"
, volume =	17
, year =	1997
, pages =	"33--54"
, succeeds =	"as-ecbds-94i"
, update =	"97.03 smid"
}

@article{ab-kawff-85
, author =	"H. Asada and A. B. By"
, title =	"Kinematic analysis of workpart fixturing for flexible assembly with automatically reconfigurable fixtures"
, journal =	"Internat. J. Robot. Autom."
, volume =	"RA-1"
, number =	2
, month =	jun
, year =	1985
, update =	"98.03 bibrelex"
}

@book{as-rac-86
, author =	"H. Asada and J.-J. E. Slotine"
, title =	"Robot Analysis and Control"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1986
, update =	"99.11 bibrelex, 97.11 bibrelex"
}

@techreport{a-fafmw-90
, author =	"T. Asano"
, title =	"A faster algorithm for finding a maximum weight clique of a circular-arc graph"
, number =	"90624--OR"
, institution =	"??"
, address =	"Bonn"
, year =	1990
, keywords =	"circular-arc graph"
, update =	"98.07 bibrelex, 95.05 korneenko"
}

@techreport{a-oafmc-89
, author =	"T. Asano"
, title =	"An optimal algorithm for finding a minimal clique covering of a circular-arc graph"
, number =	"89619--OR"
, institution =	"??"
, address =	"Bonn"
, year =	1989
, keywords =	"circular-arc graph"
, update =	"98.07 bibrelex, 95.05 korneenko"
}

@article{a-cg-87
, author =	"T. Asano"
, title =	"Computational geometry"
, journal =	"J. Soc. Instrum. Control Eng."
, volume =	26
, number =	11
, year =	1987
, pages =	"985--994"
, keywords =	"tutorial"
, update =	"95.05 korneenko"
}

@unpublished{a-eafvp
, author =	"T. Asano"
, title =	"Efficient algorithms for finding the visibility polygon for a polygonal region with holes"
, note =	"Manuscript, University of California at Berkeley"
, precedes =	"a-eafvp-85"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@inproceedings{a-rcilw-94
, author =	"T. Asano"
, title =	"Reporting and Counting Intersections of Lines within a Polygon"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"652--659"
, update =	"99.11 bibrelex, 97.03 aronov, 96.05 mitchell"
}

@article{ackt-eaobi-01
, author =	"T. Asano and D. Z. Chen and N. Katoh and T. Tokuyama"
, title =	"Efficient algorithms for optimization-based image segmentation"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"145--166"
, update =	"01.07 smid"
}

@inproceedings{ak-nthld-93
, author =	"T. Asano and N. Katoh"
, title =	"Number theory helps line detection in digital images"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"313--322"
, update =	"97.11 bibrelex"
}

@article{ak-vhtld-96
, author =	"T. Asano and N. Katoh"
, title =	"Variants for the {Hough} transform for line direction"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"231--252"
, update =	"96.09 devillers"
}

@article{akt-usdfc-94
, author =	"T. Asano and N. Katoh and T. Tokuyama"
, title =	"A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images"
, journal =	"SIGAL Technical Report of Inform Process. Soc. Japan"
, volume =	"AL38-7"
, year =	1994
, pages =	"49--56"
, update =	"98.11 bibrelex"
}

@article{akt-usdfc-01
, author =	"T. Asano and N. Katoh and T. Tokuyama"
, title =	"A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"73--93"
, update =	"01.07 smid"
}

@inproceedings{arww-sfctu-95
, author =	"T. Asano and T. Roos and P. Widmayer and Emo Welzl"
, title =	"Space Filling Curves and Their Use in the Design of Geometric Data Structures"
, booktitle =	"Proc. 2nd Latin Amer. Sympos. Theoret. Informatics"
, series =	"Lecture Notes Comput. Sci."
, volume =	911
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"36--48"
, update =	"98.03 mitchell, 97.03 gaertner+salinger"
}

@incollection{at-cpabg-93
, author =	"T. Asano and T. Tokuyama"
, title =	"Circuit Partitioning Algorithm Based on Geometry Model"
, editor =	"M. Sarrafzadeh and D. T. Lee"
, booktitle =	"Algorithmic Aspects of VLSI Layout"
, series =	"Lecture Notes Series on Computing"
, volume =	2
, publisher =	"World Scientific"
, year =	1993
, pages =	"199--212"
, update =	"98.11 bibrelex"
}

@article{at-pcala-94
, author =	"T. Asano and T. Tokuyama"
, title =	"Partial construction of an arrangement of lines and its applications to optimal partitioning of bicromatic point set"
, journal =	"Trans. (E) of IEICE of Japan"
, volume =	"E77--A"
, number =	4
, month =	apr
, year =	1994
, update =	"97.03 pocchiola"
}

@inproceedings{at-twr-94
, author =	"T. Asano and T. Tokuyama"
, title =	"Topological Walk Revisited"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"1--6"
, cites =	"akt-usdfc-94, at-pcala-94, at-appgm-93, at-cpabg-93, eg-tsa-89, m-ltalp-83, e-acg-87, agt-wat-94, erk-oalla-93, m-ltalp-83, bms-dgc-94, ykii-avoll-88, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{a-dpi-91
, author =	"Ta. Asano"
, title =	"Dynamic Programming on Intervals"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"199--207"
, precedes =	"a-dpi-93"
, update =	"96.09 devillers, 96.05 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@article{a-dpi-93
, author =	"Ta. Asano"
, title =	"Dynamic Programming on Intervals"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"323--330"
, keywords =	"Circular-arc graph, clique, dynamic programming, interval graph, segment tree, sequential partition"
, succeeds =	"a-dpi-91"
, update =	"96.09 devillers"
}

@inproceedings{aa-mpprt-83
, author =	"Ta. Asano and Te. Asano"
, title =	"Minimum partition of polygonal regions into trapezoids"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"233--241"
, precedes =	"aai-pprt-86"
}

@inproceedings{aa-vdpsp-87
, author =	"Ta. Asano and Te. Asano"
, title =	"{Voronoi} diagram for points in a simple polygon"
, editor =	"D. S. Johnson"
, booktitle =	"Discrete Algorithms and Complexity"
, series =	"Perspectives in Computing"
, publisher =	"Academic Press"
, year =	1987
, pages =	"51--64"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
, abstract =	"[For the entire collection see Zbl. 636.00011.] The
		 authors present an algorithm for constructing the
		 Voronoi diagram (Voronoi triangulation) for a set of n
		 points in a simple polygon of m vertices. The
		 complexity of the algorithm is O(mn + m log log m + n
		 log n) time and O(m + n) space. This algorithm is based
		 on the recent results of triangulating a simple polygon
		 [see R. E. Tarjan and C. J. Van Wyk, Proc. 18th Annu.
		 ACM Sympos. Theory of Computing, Berkeley, California, 380
		 - 388 (1986); cf. SIAM J. Comput. 17, 143 - 178 (1988;
		 Zbl. 637.68044)] and of finding shortest paths from a
		 point to all the vertices of a simple polygon [see L.
		 Guibas, J. Hershberger, D. Leven, Micha Sharir and R. E.
		 Tarjan, Proc. 2nd ACM Sympos. Computational Geometry,
		 Yorktown Heights, New York, 1 - 13 (1986)]. Some
		 problems which can be efficiently solved with this
		 algorithm are also specified"
}

@article{aaghi-vdp-86
, author =	"Ta. Asano and Te. Asano and Leonidas J. Guibas and J. Hershberger and H. Imai"
, title =	"Visibility of disjoint polygons"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"49--63"
, keywords =	"design of algorithms, data structuring, visibility, path planning, geometric transformations, arrangements"
, succeeds =	"aaghi-vpses-85"
, update =	"98.03 mitchell"
}

@inproceedings{aaghi-vpses-85
, author =	"Ta. Asano and Te. Asano and Leonidas J. Guibas and J. Hershberger and H. Imai"
, title =	"Visibility-polygon search and {Euclidean} shortest paths"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"155--164"
, precedes =	"aaghi-vdp-86"
, update =	"98.03 mitchell"
, annote =	"$O(n^2)$ time and space algorithm builds visibility
		 graph of polygonal set. Hence $O(n^2)$ shortest path
		 algorithm."
}

@article{aai-pprt-86
, author =	"Ta. Asano and Te. Asano and H. Imai"
, title =	"Partitioning a Polygonal Region into Trapezoids"
, journal =	"J. ACM"
, volume =	33
, year =	1986
, pages =	"290--312"
, keywords =	"decomposition, approximation, dynamic programming, polygon triangulation"
, succeeds =	"aa-mpprt-83"
, update =	"93.09 held"
}

@article{aai-spbts-87
, author =	"Ta. Asano and Te. Asano and H. Imai"
, title =	"Shortest path between two simple polygons"
, journal =	"Inform. Process. Lett."
, volume =	24
, year =	1987
, pages =	"285--288"
, keywords =	"design of algorithms, path planning, geometric transformations, visibility, arrangements"
}

@article{aap-ptem-86
, author =	"Ta. Asano and Te. Asano and R. Y. Pinter"
, title =	"Polygon Triangulation: Efficiency and Minimality"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"221--231"
, keywords =	"lower bounds, design of algorithms, triangulation"
, update =	"93.09 held"
, annote =	"Proves lower bound of $\Theta(n\log n)$ for
		 triangulation of polygons with holes. Dynamic
		 programming algorithm for minimum number triangulation
		 where there is a fixed number of holes."
}

@incollection{aeiim-pubtc-85
, author =	"Ta. Asano and M. Edahiro and H. Imai and M. Iri and K. Murota"
, title =	"Practical use of bucketing techniques in computational geometry"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"153--195"
, keywords =	"survey paper, implementing algorithms, optimization, bucketing, matchings, Voronoi diagrams, range search, point location, shortest paths, quad trees"
}

@article{ah-ecp-83
, author =	"Ta. Asano and T. Hirata"
, title =	"Edge-contraction problems"
, journal =	"J. Comput. Syst. Sci."
, volume =	26
, year =	1983
, pages =	"197--208"
, keywords =	"NP-completeness, graph theory"
}

@incollection{aso-cga-86
, author =	"Ta. Asano and M. Sato and T. Ohtsuki"
, title =	"Computational geometry algorithms"
, editor =	"T. Ohtsuki"
, booktitle =	"Layout Design and Verification"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1986
, pages =	"295--347"
, keywords =	"VLSI design, priority search trees, intersection, rectangles"
}

@techreport{a-ncabb-86
, author =	"Te. Asano"
, title =	"A new compaction algorithm for building block {LSI} using block packing technique"
, type =	"Technical {Report}"
, number =	"CAS85-158"
, institution =	"IECE of Japan"
, year =	1986
}

@techreport{a-adild-86
, author =	"Te. Asano"
, title =	"Accuracy of digital images of lines and disks"
, type =	"Technical {Report}"
, number =	"COMP86-6"
, institution =	"IECE of Japan"
, year =	1986
, keywords =	"design of algorithms, discrete geometry, convex hull, worst-case analysis"
}

@article{a-aceam-86
, author =	"Te. Asano"
, title =	"An algorithm for computing every angle of movable separability of two polygons"
, journal =	"Trans. IECE Japan"
, volume =	"J69-A"
, year =	1986
, pages =	"1162--1165"
, keywords =	"design of algorithms, visibility, convex hull, path planning"
, comments =	"in Japanese"
}

@article{a-eackr-85
, author =	"Te. Asano"
, title =	"An efficient algorithm for computing the $k$-reachability region from a point"
, journal =	"Trans. IECE Japan"
, volume =	"E68"
, year =	1985
, pages =	"560--562"
, keywords =	"design of algorithms, VLSI design, visibility, plane-sweep"
}

@inproceedings{a-eacrp-85
, author =	"Te. Asano"
, title =	"An efficient algorithm for computing the reachability polygon from a point: rectilinear case"
, booktitle =	"Proc. ISCAS"
, year =	1985
, pages =	"1293--1296"
}

@article{a-eafrr-85
, author =	"Te. Asano"
, title =	"An efficient algorithm for finding the region reachable within $k$ bends"
, journal =	"Trans. IECE Japan"
, volume =	"E68"
, year =	1985
, pages =	"831--835"
, keywords =	"design of algorithms, VLSI design, worst-case analysis, visibility"
}

% also claimed pages = "557--559"
% independent refce to 557--559. N.K.
@article{a-eafvp-85
, author =	"Te. Asano"
, title =	"An efficient algorithm for finding the visibility polygon for a polygonal region with holes"
, journal =	"Trans. IECE Japan"
, volume =	"E68"
, number =	9
, year =	1985
, pages =	"560--562"
, keywords =	"design of algorithms, computer graphics, reporting, visibility, hidden line/surface elimination, plane-sweep"
, succeeds =	"a-eafvp"
, update =	"98.11 bibrelex, 95.05 korneenko"
}

@article{a-dsptt-86
, author =	"Te. Asano"
, title =	"Dividing a simple polygon into two territories"
, journal =	"Trans. IECE Japan"
, volume =	"E69"
, year =	1986
, pages =	"521--523"
, keywords =	"design of algorithms, visibility, decomposition, operations research"
}

@article{a-gmpaa-88
, author =	"Tetsuo Asano"
, title =	"Generalized {Manhattan} path algorithm with applications"
, journal =	"Comput. Aided Design"
, volume =	7
, number =	7
, month =	jul
, year =	1988
, pages =	"797--804"
}

@article{a-gcvpr-86
, author =	"Te. Asano"
, title =	"Generating and counting valid patterns in routes between two points"
, journal =	"Graphs Combin."
, volume =	2
, year =	1986
, pages =	"9--13"
, keywords =	"counting, VLSI design, path planning"
}

@article{a-mwprb-85
, author =	"Te. Asano"
, title =	"On minimum width packing of rectilinear blocks"
, journal =	"Trans. IECE Japan"
, volume =	"E68"
, year =	1985
, pages =	"647--649"
, keywords =	"design of algorithms, plane-sweep, graph theory, VLSI design, packing"
}

@article{a-pgr-82
, author =	"Te. Asano"
, title =	"Parallel global route"
, journal =	"Japanese Journal"
, volume =	23
, year =	1982
, pages =	"443--450"
}

@article{a-rsprs-86
, author =	"Te. Asano"
, title =	"Rectilinear shortest paths in a rectilinear simple polygon"
, journal =	"Trans. IECE Japan"
, volume =	"E69"
, number =	6
, year =	1986
, pages =	"750--758"
, keywords =	"design of algorithms, minimum spanning trees, decomposition, point location"
}

@article{a-rbtp-82
, author =	"Te. Asano"
, title =	"Routes between two points"
, journal =	"Japanese Journal"
, volume =	23
, year =	1982
, pages =	"576--578"
}

@techreport{a-tlrpl-87
, author =	"Te. Asano"
, title =	"Two layer routing problem with large vias"
, type =	"Technical {Report}"
, number =	"CAS86-198"
, institution =	"IECE of Japan"
, year =	1987
, keywords =	"design of algorithms, VLSI design, path planning, decomposition, plane-sweep, priority search trees, reporting, point location"
}

@article{aao-pprmn-84
, author =	"Te. Asano and Ta. Asano and Y. Ohsuga"
, title =	"Partitioning a polygonal region into a minimum number of triangles"
, journal =	"Trans. IECE Japan"
, volume =	"E67"
, number =	4
, year =	1984
, pages =	"232--233"
, keywords =	"approximation, dynamic programming, triangulation"
}

@inproceedings{abky-cabmm-88
, author =	"Te. Asano and B. K. Bhattacharya and J. M. Keil and F. Yao"
, title =	"Clustering algorithms based on minimum and maximum spanning trees"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"252--257"
, keywords =	"cluster analysis, minimum spanning trees, diameter, partition"
, cites =	"ahu-daca-74, a-dp-86, b-ccp-77, emprww-sls-82, g-asrp-75, h-ca-75, j-nccog-82, mt-pnadt-82, mpsy-cemst-88, ps-cgi-85, ZZZ"
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@inproceedings{ackt-ptsis-96
, author =	"Tetsuo Asano and Danny Z. Chen and Naoki Katoh and Takeshi Tokuyama"
, title =	"Polynomial-time solutions to image segmentation"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"104--113"
, keywords =	"separation, monotone chains, dynamic programming, probing, computer vision"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@incollection{ags-vp-00
, author =	"Tetsuo Asano and Subis K. Ghosh and Thomas C. Shermer"
, title =	"Visibility in the Plane"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"829--876"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 19 of su-hcg-00"
}

@inproceedings{agt-wat-91
, author =	"Te. Asano and Leonidas J. Guibas and T. Tokuyama"
, title =	"Walking on an arrangement topologically"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"297--306"
, keywords =	"arrangements, lines"
, cites =	"at-appgm-90, ce-oails-88, e-acg-87, eg-tsa-89, h-gt-72, m-ltalp-83, ow-nmcvg-88, ykii-avoll-88, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{agt-wat-94
, author =	"Te. Asano and Leonidas J. Guibas and T. Tokuyama"
, title =	"Walking on an arrangement topologically"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"123--151"
, keywords =	"arrangements, lines"
, succeeds =	"agt-wat-91"
, update =	"98.03 mitchell, 96.05 pocchiola"
}

@inproceedings{ahpsss-sbcpp-90
, author =	"Te. Asano and J. Hershberger and J. Pach and E. Sontag and D. Souvaine and S. Suri"
, title =	"Separating bi-chromatic points by parallel lines"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"46--49"
, cites =	"ahu-daca-74, b-cmp-88, bh-wsngv-89, b-lgc-74, s-sdbh-89, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{ahii-ulsag-90
, author =	"Te. Asano and M. E. Houle and H. Imai and K. Imai"
, title =	"A unified linear-space approach to geometric minimax problems"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"20--23"
, cites =	"co-gpah-82, hk-cmhdp-90, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{aii-chppm-89
, author =	"Te. Asano and H. Imai and K. Imai"
, title =	"Clustering/hashing points in the plane with maxmin criteria"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	15
}

@inproceedings{aklr-oamcg-95
, author =	"Tetsuo Asano and Naoki Katoh and Elena Lodi and Thomas Roos"
, title =	"Optimal Approximation of Monotone Curves on a Grid"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"37--42"
, update =	"95.09 jones"
}

@inproceedings{aktt-cppkt-97
, author =	"Te. Asano and N. Katoh and H. Tamaki and T. Tokuyama"
, title =	"Covering points in the plane by $k$-tours: towards a polynomial time approximation scheme for general $k$"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '97"
, year =	1997
, pages =	"275--283"
, update =	"00.11 smid, 00.07 smid, 98.07 bibrelex, 98.03 smid"
}

@inproceedings{aky-domr-96
, author =	"Tetsuo Asano and David Kirkpatrick and Chee K. Yap"
, title =	"$d_1$-Optimal Motion for a Rod"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"252--263"
, cites =	"b-kpso-28, cr-nlbtr-87, csy-aesp3-94, irwy-spls-92, o-fslps-87, ps-oplmo-87, rty-ccrt-94, ss-pmp1c-83, s-npsap-89t, osy-gvdl-86, osy-gvdl-87, u-pmm-64, y-amp-87, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{arrww-sfcdg-97
, author =	"Tetsuo Asano and Desh Ranjan and Thomas Roos and Emo Welzl and Peter Widmayer"
, title =	"Space-Filling Curves and Their Use in the Design of Geometric Data Structures"
, journal =	"Theoret. Comput. Sci."
, volume =	181
, number =	1
, month =	jul
, year =	1997
, pages =	"3--15"
, update =	"98.03 mitchell"
}

@inproceedings{at-appgm-90
, author =	"Te. Asano and T. Tokuyama"
, title =	"Algorithms for projecting points to give the most uniform distribution with application to hashing"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"300--309"
}

@article{at-appgm-93
, author =	"Te. Asano and T. Tokuyama"
, title =	"Algorithms for projecting points to give the most uniform distribution with application to hashing"
, journal =	"Algorithmica"
, volume =	"??"
, year =	1993
, pages =	"572--590"
, update =	"98.11 bibrelex"
}

@inproceedings{at-cpagm-91
, author =	"Te. Asano and T. Tokuyama"
, title =	"Circuit partitioning algorithms: graph model versus geometry model"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"94--103"
}

@incollection{at-cgcsp-87
, author =	"Te. Asano and G. Toussaint"
, title =	"Computing the Geodesic Center of a Simple Polygon"
, editor =	"D. S. Johnson"
, booktitle =	"Discrete Algorithms and Complexity"
, series =	"Perspectives in Computing"
, publisher =	"Academic Press"
, year =	1987
, pages =	"65--79"
, update =	"97.11 bibrelex, 95.05 korneenko, 93.09 held"
}

@techreport{at-cgcsp-86
, author =	"Te. Asano and G. T. Toussaint"
, title =	"Computing the geodesic center of a simple polygon"
, type =	"Technical {Report}"
, number =	"COMP86-24"
, institution =	"IECE of Japan"
, year =	1986
}

@techreport{au-sacvp-86
, author =	"Te. Asano and H. Umeo"
, title =	"Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region"
, type =	"Technical {Report}"
, number =	"COMP86-7"
, institution =	"IECE of Japan"
, year =	1986
, keywords =	"parallel computation, design of algorithms, visibility, triangulation"
, precedes =	"au-sacvp-88"
}

@inproceedings{au-sacvp-87
, author =	"Te. Asano and H. Umeo"
, title =	"Systolic Algorithms for Computing the Visibility Polygon and Triangulation of a Polygonal Region"
, editor =	"A. Albrecht and H. Jung and K. Mehlhorn"
, booktitle =	"Parallel Algorithms and Architectures"
, publisher =	"Akademie-Verlag Berlin"
, month =	may
, year =	1987
, pages =	"77--85"
, update =	"93.09 held"
}

@article{au-sacvp-88
, author =	"Te. Asano and H. Umeo"
, title =	"Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region"
, journal =	"Parallel Comput."
, volume =	6
, number =	2
, year =	1988
, pages =	"209--216"
, succeeds =	"au-sacvp-86"
, abstract =	"Many geometrical problems have been shown to require
		 at least O(n log n) computer time in the worst case. A
		 problem of this kind is the following: Given a
		 polygonal domain with (polygonal) holes and a point q
		 in its interior, find the vertices of the boundary that
		 are visible from q. Since the problem is almost solved
		 when the rays from q to the vertices are sorted
		 according to their direction, it follows that one has
		 the n log n-asymptotics. Now the computer time can be
		 reduced to const. n, if O(n) processors are organized
		 as a one-dimensional systolic array. Each processor
		 cell needs only to communicate with its two neighbours.
		 The communication links with the outside are located at
		 the ends of the array. The essential step is the
		 following. In each processor only an amount of
		 information which is independent of n is needed. Also
		 each vertex ``who is sent through the systolic array''
		 may carry an amount of information which does not
		 depend on n. It is described how this is possible.
		 Another problem which fits into this framework is often
		 encountered in CAD. Which part of a polygonal body is
		 visible? A subdivision of a polygonal domain into a
		 minimal set of triangles is also treated"
}

@incollection{abbgotwz-fds-93
, author =	"B. Asberg and G. Blanco and P. Bose and J. Garcia-Lopez and M. Overmars and G. Toussaint and G. Wilfong and B. Zhu"
, title =	"Feasibility of Design in Stereolithography"
, booktitle =	"Proc. 13th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	761
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"228--237"
, update =	"97.11 smid"
}

@article{abbgotwz-fds-97
, author =	"B. Asberg and G. Blanco and P. Bose and J. Garcia-Lopez and M. Overmars and G. Toussaint and G. Wilfong and B. Zhu"
, title =	"Feasibility of Design in Stereolithography"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"61--83"
, update =	"97.07 held"
}

@incollection{am-iw81c-82
, author =	"F. Aschim and B. M. Mostue"
, title =	"{IFIP} {WG} 8.1 Case Solved Using {SYSDOC} and {SYSTEMATOR}"
, editor =	"T. W. Olle and H. G. Sol and A. A. Verrijn-Stuart"
, booktitle =	"Information Systems Design Methodologies: A Comparative Review"
, publisher =	"North-Holland"
, address =	"New York, NY"
, year =	1982
, pages =	"15--40"
, keywords =	"graph drawing"
, update =	"97.11 bibrelex, 93.09 tamassia"
}

@incollection{abcw-cpdts-88
, author =	"Peter Ash and Ethan Bolker and Henry Crapo and Walter Whiteley"
, title =	"Convex Polyhedra, {Dirichlet} Tessellations, and Spider Webs"
, chapter =	17
, editor =	"Marjorie Senechal and George Fleck"
, booktitle =	"Shaping Space: A Polyhedral Approach"
, publisher =	"Birkh{\"a}user"
, address =	"Boston, MA"
, year =	1988
, pages =	"231--250"
, update =	"93.09 rote"
, annote =	"Plane pictures of 3d convex polyhedra, plane sections
		 of 3d Vds and flat spider webs under tension are all
		 the same."
}

@article{ab-gdt-86
, author =	"Peter F. Ash and Ethan D. Bolker"
, title =	"Generalized {Dirichlet} Tessellations"
, journal =	"Geom. Dedicata"
, volume =	20
, year =	1986
, pages =	"209--243"
, update =	"93.09 rote"
, annote =	"Gives conditions for a planar tessellations to be a
		 generalized Voronoi diagram. Generalized distance from
		 a site is $\phi(|X-P|)+w(P)$ where $\phi$ is increasing."
}

@article{ab-rdt-85
, author =	"Peter F. Ash and Ethan D. Bolker"
, title =	"Recognizing {Dirichlet} Tesselations"
, journal =	"Geom. Dedicata"
, volume =	19
, year =	1985
, pages =	"175--206"
, keywords =	"Voronoi diagrams"
, annote =	"Gives conditions for a planar tessellation to be a
		 Voronoi diagram"
}

@techreport{a-brep-96
, author =	"Ian Ashdown"
, title =	"{B-REP96.TXT}"
, institution =	"Ledalite Architectural Products"
, address =	"Vancouver, BC"
, month =	jan
, year =	1996
, url =	"http://www.ledalite.com/library/cgis.html"
, keywords =	"bibliography, computer graphics, winged edge, edge-based boundary representations"
, comments =	"A comprehensive bibliography of edge-based boundary
representation (e.g., winged edge) papers, theses, articles, and books.
39 references."
, update =	"96.01 ashdown"
}

@techreport{a-cquan-96
, author =	"Ian Ashdown"
, title =	"{CQUANT96.TXT}"
, institution =	"Ledalite Architectural Products"
, address =	"Vancouver, BC"
, month =	jan
, year =	1996
, url =	"http://www.ledalite.com/library/cgis.html"
, keywords =	"bibliography, computer graphics, color quantization, dynamic palettes"
, comments =	"A comprehensive bibliography of color quantization
algorithms.  91 references."
, update =	"96.01 ashdown"
}

@techreport{a-radbi-96
, author =	"Ian Ashdown"
, title =	"{RADBIB96.TXT}"
, institution =	"Ledalite Architectural Products"
, address =	"Vancouver, BC"
, month =	jan
, year =	1996
, url =	"http://www.ledalite.com/library/rrt.html"
, keywords =	"bibliography, computer graphics, radiosity, global illumination, form factors"
, comments =	"A comprehensive bibliography of radiosity and related
global illumination papers, theses, articles, and books.  904 references."
, update =	"96.05 jones, 96.01 ashdown"
}

@incollection{ah-afopb-87
, author =	"J. Ashton and D. Hoang"
, title =	"An algorithm for finding optimal paths between points while avoiding polyhedral obstacles"
, booktitle =	"Towards 3 Generation Robotics. Proc. 3rd Internat. Conf. Adv. Robotics"
, publisher =	"Springer"
, address =	"France"
, year =	1987
, pages =	"307--312"
, keywords =	"motion planning, polyhedra, three-dimensional"
, update =	"95.05 korneenko"
}

@article{a-gttvmd-85
, author =	"D. Asimov"
, title =	"The {Grand Tour}: {A} tool for viewing multidimensional data"
, journal =	"SIAM J. Sci. Statist. Comput."
, volume =	6
, year =	1985
, pages =	"128--143"
, update =	"97.07 orourke"
}

@article{ar-rg-78
, author =	"L. Asimov and B. Roth"
, title =	"The rigidity of graphs"
, journal =	"Trans. Amer. Math. Soc."
, volume =	245
, year =	1978
, pages =	"279--289"
, keywords =	"rigidity"
, update =	"95.05 korneenko"
}

@article{ar-rg2-79
, author =	"L. Asimov and B. Roth"
, title =	"The rigidity of graphs, 2"
, journal =	"J. Math. Anal. Appl."
, volume =	68
, year =	1979
, pages =	"171--190"
, keywords =	"rigidity"
, update =	"95.05 korneenko"
}

@inproceedings{ah-wfdsa-90
, author =	"J. Aspnes and M. Herlihy"
, title =	"Wait-free data structures in the asynchronous {PRAM} model"
, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"340--349"
, update =	"96.09 orourke"
}

@inproceedings{as-ptass-79
, author =	"B. Aspvall and Y. Shiloac"
, title =	"A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality"
, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1979
, update =	"97.11 bibrelex"
}

@techreport{aa-vdpsp-
, author =	"T. Assano and T. Assano"
, title =	"Voronoi diagram for points in a simple polygon"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, update =	"98.03 bibrelex"
}

@article{a-ded-83
, author =	"P. Assouad"
, title =	"Densit\'e et dimension"
, journal =	"Ann. Inst. Fourier, Grenoble"
, volume =	3
, year =	1983
, pages =	"232--282"
, update =	"96.09 orourke"
}

@inproceedings{ac-proap-93i
, author =	"M. Atallah and D. Chen"
, title =	"On parallel rectilinear obstacle-avoiding paths"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"210--215"
, precedes =	"ac-proap-93a"
, cites =	"ap-nsmma-88, aalm-epase-90, ac-prspr-91, acg-cdctd-89, ak-eparm-91, b-pegae-74, c-pms-88, rlw-rsppr-89, em-osrqa-91, nllw-xchsx-83, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 96.09 devillers, 93.09 milone+mitchell"
}

@article{ac-proap-93a
, author =	"M. Atallah and D. Chen"
, title =	"On parallel rectilinear obstacle-avoiding paths"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"307--313"
, succeeds =	"ac-proap-93i"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.09 devillers"
, annote =	"They improve the results of \cite{ac-prspr-91}, to give
a CREW algorithm using $O(n^2/\log n)$ processors (versus
earlier bound of $O(n^2)$), $O(\log^2 n)$ time,
and $O(n^2)$ space (versus earlier bound of $O(n^2\log^2 n)$).
See also ElGindy and Mitra~\cite{em-osrqa-94}, who are said
to have an $O(\log^3 n)$ time, $O(n^2/\log^2 n)$ processor,
method that uses very different techniques."
}

@incollection{a-fpams-90
, author =	"M. J. Atallah"
, title =	"A faster parallel algorithm for a matrix searching problem"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, year =	1990
, pages =	"192--200"
, keywords =	"matrix searching, parallel computation"
, update =	"95.05 korneenko"
}

@article{a-ltahd-83
, author =	"M. J. Atallah"
, title =	"A linear time algorithm for the {Hausdorff} distance between convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	17
, year =	1983
, pages =	"207--209"
}

@article{a-mpp-85
, author =	"M. J. Atallah"
, title =	"A matching problem in the plane"
, journal =	"J. Comput. Syst. Sci."
, volume =	31
, year =	1985
, pages =	"63--70"
}

@article{a-cspf-84
, author =	"M. J. Atallah"
, title =	"Checking similarity of planar figures"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	13
, year =	1984
, pages =	"279--290"
}

@article{a-cchli-86
, author =	"M. J. Atallah"
, title =	"Computing the convex hull of line intersections"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"285--288"
}

@inproceedings{a-dcg-83
, author =	"M. J. Atallah"
, title =	"Dynamic computational geometry"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"92--99"
, precedes =	"a-sdcgp-85"
}

@article{a-sd-85
, author =	"M. J. Atallah"
, title =	"On symmetry detection"
, journal =	"IEEE Trans. Comput."
, volume =	"C-34"
, year =	1985
, pages =	"663--666"
}

@article{a-ptcg-92
, author =	"M. J. Atallah"
, title =	"Parallel techniques for computational geometry"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1435--1448"
, keywords =	"survey paper"
}

@article{a-sdcgp-85
, author =	"M. J. Atallah"
, title =	"Some dynamic computational geometry problems"
, journal =	"Comput. Math. Appl."
, volume =	11
, number =	12
, year =	1985
, pages =	"1171--1181"
, succeeds =	"a-dcg-83"
, update =	"98.11 bibrelex"
}

@article{ab-eact-87
, author =	"M. J. Atallah and C. Bajaj"
, title =	"Efficient algorithms for common transversals"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"87--91"
}

@inproceedings{acg-pcgp-90
, author =	"M. J. Atallah and P. Callahan and M. T. Goodrich"
, title =	"{$P$}-complete geometric problems"
, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"317--326"
, precedes =	"acg-pcgp-93"
, update =	"96.09 devillers"
}

@article{acg-pcgp-93
, author =	"M. J. Atallah and P. Callahan and M. T. Goodrich"
, title =	"{$P$}-complete geometric problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"443--462"
, keywords =	"computational geometry, complexity, P-completeness, parallel algorithms"
, succeeds =	"acg-pcgp-90"
, update =	"96.09 devillers"
}

@article{ac-opamc-89
, author =	"M. J. Atallah and D. Z. Chen"
, title =	"An optimal parallel algorithm for the minimum circle-cover problem"
, journal =	"Inform. Process. Lett."
, volume =	34
, number =	4
, year =	1989
, pages =	"159--165"
, update =	"96.09 orourke"
}

@article{ac-caplc-95
, author =	"M. J. Atallah and D. Z. Chen"
, title =	"Computing the all-pairs longest chains in the plane"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"257--271"
, keywords =	"computational geometry, CREW PRAM, increasing chains, longest paths, Monge matrices, parallel algorithms, sequential algorithms"
, update =	"96.09 devillers"
}

@incollection{ac-dpcg-00
, author =	"Mikhail J. Atallah and Danny Z. Chen"
, title =	"Deterministic Parallel Computational Geometry"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"155--200"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 4 of su-hcg-00"
}

@article{ac-crbrp-01
, author =	"M. J. Atallah and D. Z. Chen"
, title =	"On connecting red and blue rectilinear polygonal obstacles with nonintersecting monotone rectilinear paths"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"373--400"
, update =	"01.11 smid"
}

@inproceedings{ac-opavs-89
, author =	"M. J. Atallah and D. Z. Chen"
, title =	"Optimal parallel algorithm for visibility of a simple polygon from a p oint"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"114--123"
, precedes =	"acw-opavs-91"
, cites =	"acg-cdctd-87, ahu-daca-74, c-pms-88, cd-icott-87, ds-ehlec-85, ea-lacvp-81, g-fchsp-87, hs-et-55, krs-ppp-85a, l-vsp-83, lf-ppc-80, ps-cgi-85, w-opach-85, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex"
}

@incollection{ac-pcg-94
, author =	"M. J. Atallah and D. Z. Chen"
, title =	"Parallel Computational Geometry"
, editor =	"A. Y. Zomaya"
, booktitle =	"Parallel Computations: Paradigms and Applications"
, publisher =	"World Scientific Publishing"
, year =	1994
, pages =	""
, update =	"96.09 orourke"
}

@article{ac-prspr-91
, author =	"M. J. Atallah and D. Z. Chen"
, title =	"Parallel rectilinear shortest paths with rectangular obstacles"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	2
, year =	1991
, pages =	"79--113"
, comments =	"They preprocess a set of $n$ disjoint axis-aligned rectangles (obstacles),
		 within a rectilinearly convex polygon $P$,
		 for 2-point shortest path queries (rectilinear shortest paths).
		 The query time is $O(\log n)$, on one processor.
		 The sequential preprocessing time is $O(n^2)$ (no space
		 bounds seem to be stated explicitly).
		 Their parallel (CREW) algorithms take time $O(\log^2 n)$,
		 on either $O(n^2/\log^2 n)$, $O(n^2/\log n)$, or $O(n^2)$ processors,
		 depending on whether 2, 1, or 0 of the points $\{s,t\}$ lie
		 on the boundary of $P$."
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@inproceedings{ack-palic-97
, author =	"Mikhail J. Atallah and Danny Z. Chen and Kevin S. Klenk"
, title =	"Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"59--64"
, update =	"97.11 jones"
}

@article{acw-opavs-91
, author =	"M. J. Atallah and D. Z. Chen and H. Wagener"
, title =	"Optimal parallel algorithm for visibility of a simple polygon from a point"
, journal =	"J. ACM"
, volume =	38
, year =	1991
, pages =	"516--553"
, succeeds =	"ac-opavs-89"
}

@inproceedings{acg-cdctd-87
, author =	"M. J. Atallah and R. Cole and M. T. Goodrich"
, title =	"Cascading divide-and-conquer: {A} technique for designing parallel algorithms"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"151--160"
, keywords =	"cascading divide-and-conquer algorithm, parallel algorithms, concurrent-read- exclusive-write, parallel random-access machine"
, precedes =	"acg-cdctd-89"
, annote =	"Triangulation of a polygon using $O(\log n)$ time and
		 $O(n)$ processors."
, abstract =	"Techniques are presented for parallel
		 divide-and-conquer, resulting in improved parallel
		 algorithms for a number of problems, including
		 intersection detection, trapezoidal decomposition
		 (hence, polygon triangulation), and planar point
		 location (hence, Voronoi diagram construction).
		 Efficient parallel algorithms are also given for
		 fractional cascading, three-dimensional maxima, two-set
		 dominance counting, and visibility from a point. All of
		 the algorithms run in O(log n) time with either a
		 linear or sublinear number of processors in the
		 concurrent-read- exclusive-write parallel random-access
		 machine model. 20 refs."
}

@article{acg-cdctd-89
, author =	"M. J. Atallah and R. Cole and M. T. Goodrich"
, title =	"Cascading divide-and-conquer: {A} technique for designing parallel algorithms"
, journal =	"SIAM J. Comput."
, volume =	18
, number =	3
, year =	1989
, pages =	"499--532"
, keywords =	"parallel computation, decomposition, range search, point location, visibility, domination, points, lines, divide-and-conquer, two-dimensional"
, succeeds =	"acg-cdctd-87, ag-epsp-86i, ag-epsp-86t"
, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 milone+mitchell"
}

@techreport{acg-dctdp-87
, author =	"M. J. Atallah and R. Cole and M. T. Goodrich"
, title =	"Divide-and-Conquer: {A} Technique for Designing Parallel Algorithms"
, type =	"Technical {Report}"
, number =	665
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{admrt-mtids-91
, author =	"M. J. Atallah and F. Dehne and R. Miller and A. Rau-Chaplin and J.-J. Tsay"
, title =	"Multisearch techniques for implementing data structures on a mesh-connected computer"
, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
, nickname =	"SPAA"
, year =	1991
, pages =	"204--214"
, update =	"94.01 dehne"
}

@article{admrt-mtids-94
, author =	"M. J. Atallah and F. Dehne and R. Miller and A. Rau-Chaplin and J.-J. Tsay"
, title =	"Multisearch techniques for implementing data structures on a mesh-connected computer"
, journal =	"J. Parallel Distrib. Comput."
, volume =	"??"
, year =	"1993/94"
, comments =	"to appear"
, update =	"94.01 dehne"
}

@techreport{af-mph-93
, author =	"M. J. Atallah and A. Fabri"
, title =	"On the Multisearching Problem for Hypercubes"
, type =	"Research {Report}"
, number =	1990
, institution =	"INRIA"
, address =	"BP93, 06902 Sophia-Antipolis, France"
, month =	jun
, year =	1993
, url =	"https://hal.inria.fr/inria-00074682"
, keywords =	"parallel algorithms, hypercube, multisearching, point location"
, update =	"95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell"
}

@article{af-mph-96
, author =	"M. J. Atallah and A. Fabri"
, title =	"On the multisearching problem for hypercubes"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1996
, pages =	"293--302"
, update =	"96.05 smid"
}

@article{af-nfmer-86
, author =	"M. J. Atallah and G. N. Frederickson"
, title =	"A note on finding a maximum empty rectangle"
, journal =	"Discrete Appl. Math."
, volume =	13
, number =	1
, year =	1986
, pages =	"87--91"
, keywords =	"orthogon, empty rectangle, extremal figures"
, update =	"97.03 smid, 95.05 korneenko"
}

@article{afk-seusp-88
, author =	"M. J. Atallah and G. N. Frederickson and S. R. Kosaraju"
, title =	"Sorting with efficient use of special-purpose sorters"
, journal =	"ILP"
, volume =	"??"
, year =	1988
, pages =	"13--15"
, update =	"98.03 bibrelex"
}

@incollection{ag-dpcg-93
, author =	"M. J. Atallah and M. T. Goodrich"
, title =	"Deterministic Parallel Computational Geometry"
, editor =	"J. H. Reif"
, booktitle =	"Synthesis of Parallel Algorithms"
, publisher =	"Morgan Kaufmann Publishers"
, year =	1993
, pages =	"497--536"
, update =	"96.09 orourke"
}

@inproceedings{ag-epsgp-85
, author =	"M. J. Atallah and M. T. Goodrich"
, title =	"Efficient Parallel Solutions to Geometric Problems"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1985
, pages =	"411--417"
, update =	"93.09 held"
}

@article{ag-epssg-86
, author =	"M. J. Atallah and M. T. Goodrich"
, title =	"Efficient parallel solutions to some geometric problems"
, journal =	"J. Parallel Distrib. Comput."
, volume =	3
, year =	1986
, pages =	"492--507"
, keywords =	"parallel computation, convex hull, proximity, divide-and-conquer, points, two-dimensional"
}

@techreport{ag-epsp-86t
, author =	"M. J. Atallah and M. T. Goodrich"
, title =	"Efficient plane sweeping in parallel"
, number =	"CSD-TR-563"
, institution =	"Prude University, Computer Science"
, year =	1986
, update =	"98.03 bibrelex"
}

@inproceedings{ag-epsp-86i
, author =	"M. J. Atallah and M. T. Goodrich"
, title =	"Efficient plane sweeping in parallel"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"216--225"
, keywords =	"parallel computation, decomposition, range search, point location, triangulation, visibility, domination, points, lines, two-dimensional"
, precedes =	"acg-cdctd-89"
, cites =	"acgoy-pcg-85, ag-epsgp-85, ag-epsp-86t, aks-scps-83, bh-rmspm-85, ci-tpdc-83, c-iies-84, cg-fc1ds-86, c-pagp-80, eo-esrp-82, ea-lacvp-81, g-opaan-85, k-osps-83, krs-ppp-85, klp-fmsv-75, lp-cgs-84, lw-dsdrq-82, ol-mcp-81, sh-gip-76, v-pcp-75, ZZZ"
, update =	"98.03 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{ag-pasft-86
, author =	"M. J. Atallah and M. T. Goodrich"
, title =	"Parallel algorithms for some functions of two convex polygons"
, booktitle =	"Proc. 24th Allerton Conf. Commun. Control Comput."
, year =	1986
, pages =	"758--767"
, keywords =	"parallel computation, convex hull, distance, polygons, convex, two-dimensional"
, precedes =	"ag-pasft-88"
}

@article{ag-pasft-88
, author =	"M. J. Atallah and M. T. Goodrich"
, title =	"Parallel algorithms for some functions of two convex polygons"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"535--548"
, keywords =	"parallel computation, convex hull, distance, polygons, convex, two-dimensional"
, succeeds =	"ag-pasft-86"
}

@inproceedings{agr-bfttd-94
, author =	"M. J. Atallah and M. T. Goodrich and K. Ramaiyer"
, title =	"Biased Finger Trees and Three-Dimensional Layers of Maxima"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"150--159"
, cites =	"ap-nsmma-88, ahu-dsa-83, bjm-dplgs-92i, bst-bst-85, bm-anrow-80, c-clps-85, ct-dtmpp-91, ct-dacg-92, cpt-uadpl-93, cj-nrdpl-90, ct-detta-91, c-sssl-86, clr-ia-90, e-acg-87, egs-oplms-86, eittwy-mmsfd-92, gt-dtdpl-91, gt-drssp-93, gmpr-nrll-77, gs-dfbt-78, hm-ndsrs-82, k-osps-83, k-ss-73, k-lssl-81, k-oricm-94, klp-fmsv-75, lp-lppsi-77, lp-cgs-84, m-ss-84, m-mdscg-84, mn-dfc-90, nr-bstbb-73, o-ddds-83, p-nappl-81, ps-cgi-85, pt-fdplm-89, pt-dpplo-90, st-pplup-86, st-dsdt-83, t-dsna-83, t-acc-85, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@article{ah-aaaic-86
, author =	"M. J. Atallah and S. Hambrusch"
, title =	"An assignment algorithm with applications to integrated circuit layout"
, journal =	"Discrete Appl. Math."
, volume =	13
, number =	1
, year =	1986
, pages =	"9--22"
, keywords =	"geometric graphs"
, update =	"95.05 korneenko"
}

@article{ah-bmmd-87
, author =	"M. J. Atallah and S. E. Hambrusch"
, title =	"On bipartite matching of minimum density"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"480--502"
, keywords =	"geometric graphs"
, update =	"95.05 korneenko"
}

@article{ak-gdmv-85
, author =	"M. J. Atallah and S. R. Kosaraju"
, title =	"A generalized dictionary machine for {VLSI}"
, journal =	"IEEE Trans. Comput."
, volume =	"C-34"
, year =	1985
, pages =	"151--155"
}

@techreport{ak-eama-87
, author =	"M. J. Atallah and S. R. Kosaraju"
, title =	"An efficient algorithm for maxdominance, with applications"
, type =	"Report"
, number =	"CSD-TR-641"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1987
, precedes =	"ak-eama-89"
, update =	"95.05 korneenko"
}

@article{ak-eama-89
, author =	"M. J. Atallah and S. R. Kosaraju"
, title =	"An efficient algorithm for maxdominance, with applications"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"221--236"
, keywords =	"dominance maxdominance"
, succeeds =	"ak-eama-87"
, update =	"95.05 korneenko"
}

@inproceedings{ak-eparm-91
, author =	"M. J. Atallah and S. R. Kosaraju"
, title =	"An efficient parallel algorithm for the row minima of a totally monotone matrix"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, site =	"San Francisco, California"
, year =	1991
, pages =	"394--403"
, note =	"accepted for publication in J. of Algorithms"
, update =	"98.11 bibrelex"
, annote =	"$O(\log n)$ time, $O(n)$ processors, EREW-PRAM model"
}

@inproceedings{ak-essmp-87
, author =	"M. J. Atallah and S. R. Kosaraju"
, title =	"Efficient solutions to some maxdominance problems"
, booktitle =	"Proc. 1st Ann. Conf. Inform. Sci. Systems"
, year =	1987
, pages =	"600--610"
}

@article{ak-esstp-88
, author =	"M. J. Atallah and S. R. Kosaraju"
, title =	"Efficient solutions to some transportation problems with application to minimizing robot arm travel"
, journal =	"SIAM J. Comput."
, volume =	17
, number =	5
, year =	1988
, pages =	"849--869"
, keywords =	"motion planning"
, succeeds =	"ak-mrat-??"
, update =	"95.05 korneenko"
}

@techreport{ak-mrat-??
, author =	"M. J. Atallah and S. R. Kosaraju"
, title =	"Minimizing robot arm travel"
, type =	"Technical {Report}"
, number =	"??"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	"??"
, precedes =	"ak-esstp-88"
, update =	"95.05 korneenko"
}

@misc{am-fddse-88
, author =	"M. J. Atallah and J. Manning"
, title =	"Fast Detection and Display of Symmetry in Embedded Planar Graphs"
, institution =	"Department of Computer Science, Purdue University"
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{arl-ltacs-91
, author =	"M. J. Atallah and C. C. Ribeiro and S. Lifschitz"
, title =	"A linear time algorithm for the computation of some distance functions between convex polygons"
, journal =	"Rech. Oper."
, volume =	25
, number =	4
, year =	1991
, pages =	"413--424"
, keywords =	"convex polygon, proximity, Hausdorf distance"
, update =	"95.05 korneenko"
}

@article{arl-csdfb-91
, author =	"M. J. Atallah and C. C. Ribeiro and S. Lifschitz"
, title =	"Computing some distance functions between polygons"
, journal =	"Pattern Recogn."
, volume =	24
, number =	8
, year =	1991
, pages =	"775--782"
, keywords =	"parallel computation, polygon, proximity, Hausdorf distance"
, update =	"95.05 korneenko"
}

@inproceedings{at-pdgp-89
, author =	"M. J. Atallah and J.-J. Tsay"
, title =	"On the parallel-decomposability of geometric problems"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"104--113"
, cites =	"av-iocsr-88, afk-seusp-88, bg-sos-87, b-mdc-80, c-cgsc-84, fj-csrxm-82, g-eptcg-87, g-odccm-84, jl-pgamc-90, ka-osbmc-88, lcw-occss-81, lp-cgs-84, mc-ivs-80, ms-mcacg-86, m-snuls-87, ps-cgi-85, scl-saeap-87, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{a-vgsls-96
, author =	"Y. Atassi"
, title =	"Visibility graph of a set of line sements: {A} dynamic sequential algorithm and its parallel version"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"246--251"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@techreport{am-otibe-85
, author =	"A. Athavale and D. M. Mount"
, title =	"Order type and isomyphism based on enclosing circles"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Maryland College Park"
, address =	"College Park, MD"
, year =	1985
}

@article{awg-psg-78
, author =	"P. Atherton and K. Weiler and D. P. Greenberg"
, title =	"Polygon shadow generation"
, journal =	"Comput. Graph."
, volume =	12
, number =	3
, year =	1978
, pages =	"275--281"
, note =	"Proc. SIGGRAPH '78"
}

@book{an-bp-72
, author =	"K. B. Athreya and P. E. Ney"
, title =	"Branching processes"
, publisher =	"Springer-Verlag"
, year =	1972
, update =	"97.11 bibrelex"
}

@article{agw-crhtn-85
, author =	"H. H. Atkinson and I. Gargantini and T. R. S. Walsch"
, title =	"Counting regions, holes and their nesting level in time proportional to the border"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	29
, year =	1985
, pages =	"196--215"
, update =	"95.05 korneenko"
}

@article{agw-fqo-86
, author =	"H. H. Atkinson and I. Gargantini and T. R. S. Walsh"
, title =	"Filling by quadrants or octants"
, journal =	"Comput. Graph. Image Process."
, volume =	33
, year =	1986
, pages =	"138--155"
, update =	"98.07 bibrelex"
}

@techreport{a-oagc-83
, author =	"M. D. Atkinson"
, title =	"An Optimal Algorithm for Geometric Congruence"
, type =	"Technical {Report}"
, number =	"SCS-TR-31"
, institution =	"Carleton Univ."
, address =	"Ottawa, ON"
, year =	1983
, update =	"98.03 bibrelex"
}

@article{a-oagc-87
, author =	"M. D. Atkinson"
, title =	"An optimal algorithm for geometrical congruence"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"159--172"
}

@article{as-gbtr-92
, author =	"M. D. Atkinson and J.-R. Sack"
, title =	"Generating Binary Trees at Random"
, journal =	"Inform. Process. Lett."
, volume =	41
, year =	1992
, pages =	"21--23"
, update =	"97.11 sack"
}

@article{as-ugbtp-94
, author =	"M. D. Atkinson and J.-R. Sack"
, title =	"Uniform Generation of Binary Trees in Parallel"
, journal =	"J. Parallel Distrib. Comput."
, volume =	23
, year =	1994
, pages =	"101--103"
, keywords =	"combinatorial objects; CREW-PRAM; generator; parallel algorithms; random-access storage; trees; unbiased random; uniform generation of binary trees"
, update =	"98.03 bibrelex, 96.01 held"
}

@article{as-ugfrh-94
, author =	"M. D. Atkinson and J.-R. Sack"
, title =	"Uniform Generation of Forests of Restricted Height"
, journal =	"Inform. Process. Lett."
, volume =	50
, year =	1994
, pages =	"323--327"
, update =	"96.01 held"
}

@techreport{asss-moacp-85
, author =	"M. D. Atkinson and J.-R. Sack and N. Santoro and Th. Strothotte"
, title =	"Minmaxheaps, orderstatisticstrees and their application to the coursmarks problem"
, institution =	"School of Computer Science, Carleton University"
, year =	1985
, update =	"97.11 bibrelex"
}

@inproceedings{a-rrsru-97
, author =	"D. Attali"
, title =	"$R$-regular shape reconstruction from unorganized points"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"248--253"
, cites =	"hddms-srup-92, o-pma3d-81, b-gstds-84, f-sdpvd-83, obw-cdnh-87, crg-uasgl-92, eks-sspp-83, em-tdas-94, r-mrpdt-90, s-iamm-82, ba-cscvd-92, b-cccda-94, a-segdv-95, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{a-rrsru-98
, author =	"D. Attali"
, title =	"$r$-regular shape reconstruction from unorganized points"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"239--247"
, succeeds =	"a-rrsru-97"
, update =	"98.11 devillers"
}

@phdthesis{a-segdv-95
, author =	"D. Attali"
, title =	"Squelettes et graphes de {Vorono{\"{\i}}} $2$-d et $3$-d"
, school =	"Univ. Joseph Fourier"
, address =	"Grenoble"
, month =	oct
, year =	1995
, keywords =	"doctoral thesis"
, update =	"98.11 devillers, 98.07 bibrelex"
}

@inproceedings{ab-lbcdt-02
, author =	"Dominique Attali and Jean-Daniel Boissonnat"
, title =	"Complexity of the {Delaunay} Triangulation of Points on Polyhedral Surfaces"
, booktitle =	"Proc. 7th ACM Symposium on Solid Modeling and Applications"
, year =	2002
, pages =	""
, update =	"02.03 devillers"
}

@article{al-dciss-01
, author =	"D. Attali and J.-O. Lachaud"
, title =	"Delaunay conforming iso-surface, skeleton extraction and noise removal"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"175--189"
, update =	"01.11 smid"
}

@inproceedings{abwwy-sptt-96
, author =	"J. W. Atwood and M. M. Burnett and R. A. Walpole and E. M. Wilcox and S. Yang"
, title =	"Steering Programs via Time Travel"
, booktitle =	"Proc. IEEE Symp. on Visual Languages"
, year =	1996
, update =	"97.03 tamassia"
}

@inproceedings{a-ollrn-93
, author =	"Peter Auer"
, title =	"On-line Learning of Rectangles in Noisy Environments"
, booktitle =	"Proc. 6th ACM Conf. Comput. Learning Theory"
, nickname =	"COLT '93"
, month =	jul
, year =	1993
, pages =	"??"
, update =	"98.07 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{ah-hgrp-96
, author =	"T. Auer and Martin Held"
, title =	"Heuristics for the Generation of Random Polygons"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"38--43"
, url =	"http://www.cosy.sbg.ac.at/~held/papers/cccg96.ps.gz"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 agarwal, 96.09 held+mitchell"
}

@article{as-srrgd-90
, author =	"S. Auerbach and H. Schaeben"
, title =	"Surface Representations Reproducing Given Digitized Contour Lines"
, journal =	"Mathematical Geology"
, volume =	22
, number =	6
, year =	1990
, pages =	"723--742"
, annote =	"Computes CDT of contour lines, with extra constraint
		 that no triangle can have three vertices on same
		 contour. (Extra constraint is done manually!)"
}

@article{ap-cvms-85
, author =	"J. M. Augenbaum and C. S. Peskin"
, title =	"On the Construction of the {Voronoi} Mesh on a Sphere"
, journal =	"J. Comput. Phys."
, volume =	59
, year =	1985
, pages =	"177--192"
, annote =	"Joe iterative algorithm. Use for problems where mesh
		 changes with time (but presumably not much)."
}

@inproceedings{app-anaop-96
, author =	"V. Auletta and D. Parente and P. Persiano"
, title =	"A new approach to optimal planning of robot motion on a tree with obstacles"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"529--545"
, update =	"97.03 smid"
}

@book{as-cg-93
, author =	"G{\"u}nter Aumann and Klaus Spitzm{\"u}ller"
, title =	"Computerorientierte Geometrie"
, publisher =	"BI-Wissenschaftsverlag"
, address =	"Mannheim"
, year =	1993
, update =	"97.03 icking"
}

@inproceedings{akpr-heael-93
, author =	"Y. Aumann and Z. M. Kedem and K. V. Palem and M. O. Rabin"
, title =	"Highly efficient asynchronous execution of large-grained parallel programs"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1993
, pages =	""
, update =	"96.09 orourke"
}

@techreport{a-acps-88
, author =	"L. J. Aupperle"
, title =	"An algorithm for covering polygons with squares"
, type =	"Draft"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, month =	oct
, year =	1988
, update =	"98.07 bibrelex"
}

@inproceedings{acko-cops-88
, author =	"L. J. Aupperle and H. E. Conn and J. M. Keil and J. O'Rourke"
, title =	"Covering orthogonal polygons with squares"
, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
, month =	oct
, year =	1988
, pages =	"97--106"
, keywords =	"covering, decomposition, polygons, NP-completeness, image processing, graph theory, squares, medial axis"
}

@article{ak-parep-89
, author =	"L. J. Aupperle and J. M. Keil"
, title =	"Polynomial algorithms for restricted {Euclidean} $p$-centre problems"
, journal =	"Discrete Appl. Math."
, volume =	23
, year =	1989
, pages =	"25--31"
, keywords =	"lines, cluster analysis, dynamic programming, circles, optimization, operations research, facility location"
, update =	"95.05 korneenko"
}

@article{a-caecc-87
, author =	"F. Aurenhammer"
, title =	"A criterion for the affine equality of cell complexes in {$R^{d}$} and convex polyhedra in {$R^{d+1}$}"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"49--64"
, keywords =	"discrete geometry, cell complexes, power diagrams, reciprocal figure, $d$-dimensional"
, update =	"93.09 aurenhammer"
}

@inproceedings{a-ndrcv-86
, author =	"F. Aurenhammer"
, title =	"A new duality result concerning {Voronoi} diagrams"
, booktitle =	"Proc. 13th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	226
, publisher =	"Springer-Verlag"
, year =	1986
, pages =	"21--30"
, keywords =	"design of algorithms, discrete geometry, duality, Voronoi diagrams, convex hull, worst-case analysis"
, precedes =	"a-ndrcv-90"
}

@article{a-ndrcv-90
, author =	"F. Aurenhammer"
, title =	"A new duality result concerning {Voronoi} diagrams"
, journal =	"Discrete Comput. Geom."
, volume =	5
, number =	3
, year =	1990
, pages =	"243--254"
, keywords =	"design of algorithms, discrete geometry, duality, Voronoi diagr ams, convex hull, worst-case analysis"
, succeeds =	"a-ndrcv-86"
, update =	"98.07 bibrelex"
}

@article{a-rbgtv-90
, author =	"F. Aurenhammer"
, title =	"A relationship between {Gale} transforms and {Voronoi} diagrams"
, journal =	"Discrete Appl. Math."
, volume =	28
, year =	1990
, pages =	"83--91"
, update =	"97.11 bibrelex, 95.05 korneenko"
}

@inproceedings{a-pvd-89
, author =	"Franz Aurenhammer"
, title =	"{Das} {Peeper's} {Voronoi}-{Diagramm}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@phdthesis{a-gvdgd-84
, author =	"F. Aurenhammer"
, title =	"Gewichtete {Voronoi} {Diagramme}: {Geometrische} {Deutung} und {Konstruktions}-{Algorithmen}"
, type =	"Ph.{D}. Thesis"
, school =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1984
, note =	"Report B53"
, keywords =	"doctoral thesis, discrete geometry, design of algorithms, geometric transformations, Voronoi diagrams, weighted, $d$-dimensional"
, update =	"93.05 jones"
}

@article{a-iadbu-88
, author =	"F. Aurenhammer"
, title =	"Improved algorithms for discs and balls using power diagrams"
, journal =	"J. Algorithms"
, volume =	9
, year =	1988
, pages =	"151--161"
, keywords =	"design of algorithms, computer graphics, robotics, intersection, volume, Voronoi diagrams, disks, balls"
}

@inproceedings{a-jschc-87
, author =	"F. Aurenhammer"
, title =	"Jordan sorting via convex hulls of certain non-simple polygons"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"21--29"
, keywords =	"design of algorithms, sorting, convex hull, non-simple polygons, trees, worst-case analysis"
, cites =	"f-hgiit-76, r-ppdti-84, hmrt-sjslt-86, e-agc-, ZZZ"
, update =	"98.03 bibrelex"
}

@article{a-lcpd-88
, author =	"F. Aurenhammer"
, title =	"Linear combinations from power domains"
, journal =	"Geom. Dedicata"
, volume =	28
, year =	1988
, pages =	"45--52"
, keywords =	"power diagrams, convex combinations, $d$-dimensional"
, update =	"93.09 aurenhammer"
}

@article{a-olsts-88
, author =	"F. Aurenhammer"
, title =	"On-line sorting of twisted sequences in linear time"
, journal =	"BIT"
, volume =	28
, year =	1988
, pages =	"194--204"
, keywords =	"design of algorithms, sorting, convex hull, arrangements, incrementation, worst-case analysis, lower bounds"
, update =	"93.09 aurenhammer"
}

@techreport{a-pdpaa-83
, author =	"F. Aurenhammer"
, title =	"Power Diagrams: {Properties}, Algorithms and Applications"
, number =	"F120"
, institution =	"Techn. Univ. Graz"
, address =	"Graz, Austria"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{a-pdpaa-87
, author =	"F. Aurenhammer"
, title =	"Power diagrams: properties, algorithms and applications"
, journal =	"SIAM J. Comput."
, volume =	16
, year =	1987
, pages =	"78--96"
, keywords =	"discrete geometry, design of algorithms, geometric transformations, duality, Voronoi diagrams, convex hull, arrangements, $d$-dimensional, distance, weighted"
}

@article{a-rpccc-87
, author =	"F. Aurenhammer"
, title =	"Recognising polytopical cell complexes and constructing projection polyhedra"
, journal =	"J. Symbolic Comput."
, volume =	3
, year =	1987
, pages =	"249--255"
, keywords =	"design of algorithms, cell complexes, Voronoi diagrams, reciprocal figure, image processing, pattern recognition"
, update =	"93.09 aurenhammer"
}

@techreport{a-odwvd-83
, author =	"F. Aurenhammer"
, title =	"The one-dimensional weighted {Voronoi} diagram"
, type =	"Report"
, number =	"F 110, IIG"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1983
, precedes =	"a-odwvd-86"
}

@article{a-odwvd-86
, author =	"F. Aurenhammer"
, title =	"The one-dimensional weighted {Voronoi} diagram"
, journal =	"Inform. Process. Lett."
, volume =	22
, year =	1986
, pages =	"119--123"
, keywords =	"design of algorithms, divide-and-conquer, plane-sweep, upper envelope, Voronoi diagrams, weighted"
, succeeds =	"a-odwvd-83"
, update =	"93.09 aurenhammer"
}

@inproceedings{a-ugtcg-88
, author =	"F. Aurenhammer"
, title =	"Using {Gale} transforms in computational geometry"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"202--216"
, keywords =	"geometric transform, convex hulls, scene analysis, $d$-dimensional"
, precedes =	"a-ugtcg-91"
, update =	"00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex, 98.07 bibrelex, 95.05 korneenko, 93.09 aurenhammer"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@article{a-ugtcg-91
, author =	"F. Aurenhammer"
, title =	"Using {Gale} transforms in computational geometry"
, journal =	"Math. Program."
, volume =	"B 52"
, year =	1991
, pages =	"179--190"
, keywords =	"geometric transform, convex hulls, scene analysis, $d$-dimensional"
, succeeds =	"a-ugtcg-88"
, update =	"95.05 korneenko, 93.09 aurenhammer"
}

@techreport{a-vds-88
, author =	"F. Aurenhammer"
, title =	"{Voronoi} diagrams: a survey"
, institution =	"Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1988
, update =	"97.11 bibrelex"
}

@techreport{a-vdsfg-90
, author =	"F. Aurenhammer"
, title =	"Voronoi diagrams: a survey of a fundamental geometric data structure"
, type =	"Report"
, number =	"B-90-09"
, institution =	"Fachber. Math., Free Univ. Berlin"
, address =	"Berlin, West Germany"
, year =	1990
, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations, arrangements, hyperplanes, plane sweep, divide-and-conquer, parallel computation, minimum spanning trees, cluster analysis, motion planning"
, succeeds =	"a-vds-88"
, precedes =	"a-vdsfg-91"
, update =	"93.09 aurenhammer"
}

@article{a-vdsfg-91
, author =	"F. Aurenhammer"
, title =	"Voronoi diagrams: A survey of a fundamental geometric data structure"
, journal =	"ACM Comput. Surv."
, volume =	23
, number =	3
, month =	sep
, year =	1991
, pages =	"345--405"
, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations, arrangements, hyperplanes, plane sweep, divide-and-conquer, parallel computation, minimum spanning trees, cluster analysis, motion planning"
, succeeds =	"a-vdsfg-90"
, update =	"98.11 bibrelex, 95.09 agarwal"
}

@article{ae-oacwv-84
, author =	"F. Aurenhammer and H. Edelsbrunner"
, title =	"An optimal algorithm for constructing the weighted {Voronoi} diagram in the plane"
, journal =	"Pattern Recogn."
, volume =	17
, year =	1984
, pages =	"251--257"
, keywords =	"combinatorial geometry, design of algorithms, construction, incrementation, geometric transformations, worst-case analysis, Voronoi diagrams, two-dimensional, three-dimensional, weighted"
, annote =	"$O(n^2)$ algorithm (worst case optimal). Uses
		 inversion to transform problem to constructing
		 polyhedra in 3D. ``Add a point'' algorithm."
}

@article{afisw-fiepc-94
, author =	"F. Aurenhammer and M. Formann and R. M. Idury and A. A. Sch{\"a}ffer and F. Wagner"
, title =	"Faster Isometric Embedding in Products of Complete Graphs"
, journal =	"Discrete Appl. Math."
, volume =	17
, year =	1994
, pages =	"321--340"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{ahi-fcpgl-90
, author =	"F. Aurenhammer and J. Hagauer and W. Imrich"
, title =	"Factoring Cartesian-product graphs at logarithmic cost per edge"
, booktitle =	"Proc. MPC Conf. Integer Programming and Combinatorial Optimization"
, site =	"Waterloo, ON"
, year =	1990
, pages =	"29--44"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{aha-lsp-92
, author =	"Franz Aurenhammer and Friedrich Hoffmann and Boris Aronov"
, title =	"Least-Squares Partitioning"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"55--57"
, update =	"00.03 bibrelex"
}

@article{aha-mttlsc-98
, author =	"Franz Aurenhammer and Friedrich Hoffmann and Boris Aronov"
, title =	"Minkowski-type theorems and least-squares clustering"
, journal =	"Algorithmica"
, volume =	20
, year =	1998
, pages =	"61--76"
, succeeds =	"aha-mttls-92"
, update =	"98.03 aronov, 97.11 aronov"
}

@inproceedings{aha-mttls-92
, author =	"F. Aurenhammer and F. Hoffmann and B. Aronov"
, title =	"Minkowski-type theorems and least-squares partitioning"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"350--357"
, keywords =	"optimization, least squares, power diagram, matching"
, precedes =	"aha-mttlsc-98"
, cites =	"am-dhsrr-91, a-vdsfg-91, a-caecc-87, b-colmm-82, e-fdmem-92, ft-fhtui-87, g-cp-67, l-conm-76, l-egimv-85, ol-mcp-81, t-dsna-83, tn-gamca-91, v-ghm-89, ZZZ"
, update =	"98.07 bibrelex, 97.11 aronov+bibrelex"
}

@techreport{ai-grvd-86
, author =	"F. Aurenhammer and H. Imai"
, title =	"Geometric relations among {Voronoi} diagrams"
, type =	"Technical {Report}"
, number =	228
, institution =	"Inst. Informationsverarb., Techn. Univ. Graz"
, address =	"Graz, Autria"
, year =	1986
, update =	"98.03 bibrelex"
}

@inproceedings{ai-grvd-87
, author =	"F. Aurenhammer and H. Imai"
, title =	"Geometric relations among {Voronoi} diagrams"
, booktitle =	"Proc. 4th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	247
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"53--65"
, keywords =	"design of algorithms, discrete geometry, Voronoi diagrams, distance, weighted"
, precedes =	"ai-grvd-88"
}

@article{ai-grvd-88
, author =	"F. Aurenhammer and H. Imai"
, title =	"Geometric relations among {Voronoi} diagrams"
, journal =	"Geom. Dedicata"
, volume =	27
, year =	1988
, pages =	"65--75"
, keywords =	"design of algorithms, discrete geometry, Voronoi diagrams, distance, weighted"
, succeeds =	"ai-grvd-87"
, update =	"93.09 aurenhammer"
}

@techreport{ak-vd-96
, author =	"Franz Aurenhammer and Rolf Klein"
, title =	"Voronoi Diagrams"
, number =	198
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1996
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf"
, precedes =	"ak-vd-00"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex"
}

@incollection{ak-vd-00
, author =	"Franz Aurenhammer and Rolf Klein"
, title =	"Voronoi Diagrams"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"201--290"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf"
, succeeds =	"ak-vd-96"
, cites =	"ahknu-vdcfc-95, abms-claho-94, aesw-emstb-91, agss-ltacv-89, ahl-sqrpc-90, aiks-fkpmd-91, a-dppuv-82, aaag-ntsp-95, aa-skfgpf-95, aacktrx-tin-96, a-nemts-83, as-vdco-95, ay-aampt1-90, ay-aampt2-90, ar-cvddp-96, a-gvdps-89, a-lbvdc-98, abky-cabmm-88, abcw-cpdts-88, ab-rdt-85, a-sdcgp-85, a-pdpaa-87, a-rpccc-87, a-iadbu-88, a-lcpd-88, a-ndrcv-90, a-vdsfg-91, ae-oacwv-84, aha-mttls-92, ai-grvd-88, as-solri-92, abi-cvus-88, br-rasas-90, bo-arcgi-79, bs-dcms-76, bwy-oetac-80, be-mgot-92i, beg-pgmg-94, b-bnvd, bt-gatuf-85, bmt-dppbp-96, bcdt-osc3d-91i, bdsty-arsol-92, bg-tdrcs-93, bsty-vdhdc-95, bt-rcdt-93, bh-cpcoe-88, b-rgsdd-89, b-vdch-79, b-gtfga-80, bms-hcvdl-94, b-gog-55, c-vmpmp-85, cd-svd-88, crw-gc-91, csy-oscpf-95, cdns-nsrgs-95, c-ochaa-93, ce-iacko-87, cgt-ecabs-95, cx-alesw-96, c-bvdcp-86, c-cdt-89, c-tapga-89, c-gqmgc-93,
		cd-vdbcd-85, ckstw-vdl3s-95, csw-fmasp-95, c-wcanh-76, cms-mfdca-94, c-narsc-87, c-agmst-89, cms-frric-93, cs-arscg-89, cmrs-tspvd-93, cw-pspp-86, dj-wtacg-89, ds-oiti-89, bms-plpco-93, dfnp-stdt-91, d-eaclm-77, dk-savd-87, dk-bspwa-97, dn-cgacp-85, d-slsv-34, d-pp-44, d-rysoa-92, dv-cprac-77, dds-saeid-92, de-apphd-96, d-nhndt-87, d-tdt-90, d-fhcdt-92, d-udrdp-50, dl-cvdrp-91, ddg-fsp-83, dfs-dgaag-90, dl-pmtds-89, dl-msp-76, d-ec-83, d-fdcac-87, d-hdvdl-91, e-acg-87, e-atccd-90, e-ubids-95, egs-ueplf-89, egs-oplms-86, eks-sspp-83, em-tdas-94, eos-calha-86, es-vda-86, ess-ztha-93, es-itfwr-96, es-otatd-91, et-qtaml-93, et-ubcdt-93, etw-otama-92, ei-drmwc-79, f-sodt-90, f-iwatd-86, f-nsa2d-92, f-vddt-92, f-savd-87, gs-nsagv-69, gj-cigtn-79, g-3dmud-95, g-agt-85, grr-vdlsm-95, grss-sracp-95,
		goy-cvdsl-93, gs-cdtp-78, gks-ricdv-92, gmr-vdmpp-92, gs-pmgsc-85, h-ca-75, h-rvdlp-92, h-gbitp-91, hkp-itnc-91, hn-sc-89, hns-psscp-88, h-pcprn-91, hks-uevsi-93, h-oarms-79, iklm-cdf3s-93, iki-awvdr-94, iss-nriac-92, j-3dtlt-89, j-ctddt-91, j-gspgm-91, jrz-ccdt-91, km-accvd-91, km-icdmc-92, kk-cdtmb-88, kg-cgwac-92, k-csmwt-94, ks-tpscv-93, k-eccs-79, k-ndot-80, k-osps-83, kr-fcm-85, k-cddvd-80, k-cavd-89, kl-ltrab-93, kl-fsc-95, kl-mpsp-95, kmm-ricav-93a, kw-vdbgm-88, k-sssgt-56, kl-fsacl-95, l-dtmmi-94, l-esta-94, l-scsi-77, l-vdlmh-94, l-ricsa-95, l-tdvdl-80, l-matps-82, l-knnvd-82, ld-gvdp-81, ll-gdtpg-86, lw-vdllm-80, lk-qgtam-96, l-ltcrn-94, msw-sblp-92, ms-pggrg-80, m-dtchn-84, mr-vdcdg-90, mks-cplvd-96, m-tdird-76, m-mnfcp-70, m-lpltw-84, mmo-cavd-91, m-zkav-93,
		m-uuam-28, m-rcvdp-93, m-spop-93, mmp-dgp-87, ms-getcc-88, mp-fitcp-78, m-osclv-90, m-lavd-91, osy-gvdl-86, osy-gvdl-87, oy-rmpmd-85, oim-iimvd-84, obs-stcav-92, p-etspi-77, pl-ecgvd-95, p-kpudz-82, p-mrpdt-92, ps-cgi-85, p-scnsg-57, r-odtr-91, rr-oprav-94, r-aiv-94, r-mrpdt-90, r-tbvdm-93, rsl-ashts-77, st-pwvt-88, s-cvdhd-82, s-mplbc-85, s-chdch-86, s-nfhdv-87, s-cdtvd-88, s-sdlpc-91, s-barga-93, s-cg-78, sh-cpp-75, s-icpps-85, s-atubl-94, s-let-78, s-vidt-80, s-sagdt-91, s-facdt-87, s-mmdpsl-91a, sd-csdta-95, s-smane-92, si-cvdom-92, soi-toari-90, s-rngam-83, si-atpvd-86, t-otdt-93, too-natdv-83, t-gcvdm-86, t-rngfp-80, v-mstkd-88, v-sgagc-91, v-dmrsl-09, v-nadpc-08, w-eucdt-93, ws-oacdt-87, w-cnddt-81, w-sedbe-91a, www-sdpfo-87, y-cmstk-82, y-amp-87, y-oavds-87, zm-sdnah-91, ZZZ"
, update =	"00.11 smid, 00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 bibrelex, 97.03 icking"
, annote =	"Chapter 5 of su-hcg-00"
}

@techreport{as-solri-91t
, author =	"F. Aurenhammer and O. Schwarzkopf"
, title =	"A Simple On-line Randomized Incremental Algorithm for Computing Higher Order {Voronoi} Diagrams"
, type =	"Technical {Report}"
, institution =	"Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, year =	1991
, precedes =	"as-solri-91"
, update =	"00.03 bibrelex, 97.11 bibrelex"
}

@inproceedings{as-solri-91
, author =	"F. Aurenhammer and O. Schwarzkopf"
, title =	"A simple on-line randomized incremental algorithm for computing higher order {Voronoi} diagrams"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"142--151"
, keywords =	"Voronoi diagrams, geometric transforms, dynamization"
, succeeds =	"as-solri-91t"
, precedes =	"as-solri-92"
, cites =	"aesw-emstb-90, agss-ltacv-89, a-ndrcv-90, a-pdpaa-87, as-solri-91t, bdsty-arsol-90, bdt-riach-, cegss-cfals-91, c-narsc-87, cs-arscg-89, dsst-mdsp-89, e-acg-87, gks-ricdv-90, l-knnvd-82, mmo-cavd-91, m-lavd-91, s-riads-91, s-lpchm-90, s-sfira-90, w-csedb-91, ZZZ"
, update =	"00.03 bibrelex, 97.11 bibrelex, 93.09 aurenhammer"
}

@article{as-solri-92
, author =	"F. Aurenhammer and O. Schwarzkopf"
, title =	"A simple on-line randomized incremental algorithm for computing higher order {Voronoi} diagrams"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, year =	1992
, pages =	"363--381"
, keywords =	"Voronoi diagrams, geometric transforms, dynamization"
, succeeds =	"as-solri-91"
, update =	"93.09 aurenhammer, 93.05 schwarzkopf"
}

@article{as-pvd-91
, author =	"F. Aurenhammer and G. St{\"o}ckl"
, title =	"On the peeper's {Voronoi} diagram"
, journal =	"SIGACT News"
, volume =	22
, number =	4
, year =	1991
, pages =	"50--59"
, keywords =	"Voronoi diagrams, visibility, lower envelope"
, update =	"93.09 aurenhammer"
}

@article{as-sslro-92
, author =	"F. Aurenhammer and G. St{\"o}ckl"
, title =	"Searching for segments with largest relative overlap"
, journal =	"Inform. Process. Lett."
, volume =	41
, year =	1992
, pages =	"103--108"
, keywords =	"line segments, search structure, one-dimensional, two-dimensional"
, update =	"93.09 aurenhammer+jones"
}

@inproceedings{asw-popfp-91
, author =	"Franz Aurenhammer and Gerd St{\"o}ckl and Emo Welzl"
, title =	"The post office problem for fuzzy point sets"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"1--11"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{aflst-caolt-95
, author =	"Giorgio Ausiello and Esteban Feuerstein and Stefano Leonardi and Leen Stougie and Maurizio Talamo"
, title =	"Competitive Algorithms for the On-line Traveling Salesman"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"206--217"
, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
}

@inproceedings{aimn-iamlp-90
, author =	"G. Ausiello and G. F. Italiano and A. Marchetti-Spac\-camela and U. Nanni"
, title =	"Incremental Algorithms for Minimal Length Paths"
, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"12--21"
, update =	"94.01 tamassia"
}

@article{ajd-cdans-97
, author =	"S. P. Austin and R. B. Jerard and R. L. Drysdale"
, title =	"Comparison of Discretization Algorithms for NURBS Surfaces With Application to Numerically Controlled Machining"
, journal =	"Comput. Aided Design"
, volume =	29
, number =	1
, month =	jan
, year =	1997
, pages =	"71--83"
, update =	"97.11 held"
}

@article{as-vswma-93
, author =	"S. V. Avgustinovich and S. V. Sevast{\'\j}anov"
, title =	"Vector Summation within Minimal Angle"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	5
, month =	mar
, year =	1993
, pages =	"235--239"
, update =	"93.09 held+milone+mitchell"
}

@inproceedings{as-ddsrs-81
, author =	"Z. Aviad and E. Shamir"
, title =	"A direct dynamic solution to range search and related problems for product regions"
, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1981
, pages =	"123--126"
, keywords =	"orthogonal range queries, integer coordinates, multidimensional search"
}

@article{a-shwmp-83
, author =	"D. Avis"
, title =	"A survey of heuristics for the weighted matching problem"
, journal =	"Networks"
, volume =	13
, year =	1983
, pages =	"475--493"
, keywords =	"heuristics, worst-case analysis, average-case analysis"
}

@article{a-clbch-80
, author =	"D. Avis"
, title =	"Comments on a lower bound for convex hull determination"
, journal =	"Inform. Process. Lett."
, volume =	11
, year =	1980
, pages =	126
, keywords =	"convex hull, lower bounds, linear decision trees"
}

@article{a-dp-86
, author =	"D. Avis"
, title =	"Diameter partitioning"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"265--276"
, keywords =	"planar point sets, partition, diameter"
}

@article{a-grtwr-96
, author =	"D. Avis"
, title =	"Generating rooted triangulations without repetitions"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"618--632"
, update =	"97.03 smid"
}

@inproceedings{a-lbgp-80
, author =	"D. Avis"
, title =	"Lower bounds for geometric problems"
, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
, year =	1980
, pages =	"35--40"
, keywords =	"lower bounds, linear decision trees, quadratic decision trees"
}

@article{a-npps-84
, author =	"D. Avis"
, title =	"Non-partitionable point sets"
, journal =	"Inform. Process. Lett."
, volume =	19
, year =	1984
, pages =	"125--129"
, keywords =	"discrete geometry, decomposition, range search"
}

@article{a-cfchs-82
, author =	"D. Avis"
, title =	"On the complexity of finding the convex hull of a set of points"
, journal =	"Discrete Appl. Math."
, volume =	4
, year =	1982
, pages =	"81--86"
, keywords =	"convex hull, lower bounds, linear decision trees"
}

@inproceedings{a-ppss-85
, author =	"D. Avis"
, title =	"On the partitionability of point sets in space"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"116--120"
, keywords =	"point sets, partition, half spaces"
, comments =	"some results appeared in a-spiag-85"
, cites =	"k-ss-73, w-pr-82, y-3spia-83, de-ssio-84, a-npps-84, yb-cf-61, m-it-62, g-ncp-63, g-gcpnc-58, yy-gaddg-85, ZZZ"
, update =	"97.11 bibrelex, 93.09 milone+mitchell"
}

% ### alias "a-spiag-87"
@inproceedings{a-spiag-85
, author =	"D. Avis"
, title =	"Space partitioning and its application to generalized retrieval problems"
, booktitle =	"Proc. Internat. Conf. Found. Data Organization"
, site =	"Kyoto, Japan"
, year =	1985
, pages =	"154--162"
, keywords =	"searching, point sets, partition, half spaces"
, update =	"95.05 korneenko"
}

% == "a-spiag-85"
@inproceedings{a-spiag-87
, author =	"D. Avis"
, title =	"Space partitioning and its application to generalized retrieval problems"
, booktitle =	"Proc. Internat. Conf. Found. Data Organization, 1985"
, publisher =	"Plenum Press"
, address =	"Kyoto, Japan"
, year =	1987
, pages =	"237--248"
, keywords =	"searching, point sets, partition, half spaces"
, update =	"95.05 korneenko"
}

@article{a-nfnfp-84
, author =	"D. Avis"
, title =	"The number of furthest neighbors of a finite planar set"
, journal =	"Amer. Math. Monthly"
, volume =	91
, year =	1984
, pages =	"417--420"
, keywords =	"combinatorial geometry, proximity"
}

@article{a-wcbem-81
, author =	"D. Avis"
, title =	"Worst case bounds for the {Euclidean} matching problem"
, journal =	"Comput. Math. Appl."
, volume =	7
, year =	1981
, pages =	"251--257"
, keywords =	"heuristics, worst-case analysis"
}

@inproceedings{abdeghz-umpca-93
, author =	"D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
, title =	"Unoriented {$\Theta$}-Maxima in the Plane"
, booktitle =	"Proc. of the 16th Australian Conf. in Comp. Science"
, site =	"Brisbane"
, year =	1993
, update =	"98.11 bibrelex"
}

@article{abdeghz-utmp-98
, author =	"D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
, title =	"Unoriented {$\Theta$}-Maxima in the Plane: {Complexity} and Algorithms"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1998
, pages =	"278--296"
, update =	"99.07 smid"
}

@unpublished{abdeghz-ump2
, author =	"D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
, title =	"Unoriented {$\Theta$}-Maxima in the Plane {II}"
, note =	"in preparation"
, update =	"98.11 bibrelex"
}

@incollection{ab-acddv-83
, author =	"David Avis and Binay K. Bhattacharya"
, title =	"Algorithms for Computing $d$-dimensional {Voronoi} Diagrams and their Duals"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"159--180"
, keywords =	"Voronoi diagrams, $d$-dimensional, linear programming"
, update =	"01.04 icking"
}

@techreport{abi-cvus-87
, author =	"D. Avis and B. K. Bhattacharya and H. Imai"
, title =	"Computing the volume of the union of spheres"
, type =	"Technical {Report}"
, number =	"SOCS 87.3"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1987
, precedes =	"abi-cvus-88"
}

@article{abi-cvus-88
, author =	"D. Avis and B. K. Bhattacharya and H. Imai"
, title =	"Computing the volume of the union of spheres"
, journal =	"Visual Comput."
, volume =	3
, year =	1988
, pages =	"323--328"
, keywords =	"volume, spheres, Voronoi diagrams"
, succeeds =	"abi-cvus-87"
}

@inproceedings{absstz-sacp-96
, author =	"D. Avis and P. Bose and T. Shermer and J. Snoeyink and G. Toussaint and B. Zhu"
, title =	"On the Sectional Area of Convex Polytopes"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C11--C12"
, cites =	"c-oaitd-92, cd-icott-87, bdkst-cmotc-96, dj-cccsp-73, k-cpvc-93, s-mv-93, s-labp-92, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{ab-hgach-95
, author =	"David Avis and David Bremner"
, title =	"How Good are Convex Hull Algorithms?"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"20--28"
, keywords =	"vertex enumeration, pivoting"
, cites =	"af-pachv-92, bdh-qach-93, bl-cacp-93, b-icp-83, cgaf-gstlm-94, ck-acp-70, c-ochaa-93, c-lp-83, cs-adpch-88, d-cvem-83, f-crmv0-, gkz-drmd-94, h-sretn-91, k-pptrl-74, km-hgisa-72, l-epcrn-88, lt-sptcc-91, l-rtp-91, mrtt-ddm-53, s-chaop-81, s-chdch-86, y-stgd-90, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{abs-hgach-97
, author =	"D. Avis and D. Bremner and R. Seidel"
, title =	"How good are convex hull algorithms?"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"265--302"
, update =	"97.07 devillers"
}

@article{ac-nbpr-78
, author =	"D. Avis and V. Chv{\'a}tal"
, title =	"Notes on {Bland's} pivoting rule"
, journal =	"Math. Programming Study"
, volume =	8
, year =	1978
, pages =	"24--34"
, update =	"97.03 gaertner+salinger"
}

@article{ads-paghe-88
, author =	"D. Avis and B. Davis and J. M. Steele"
, title =	"Probabilistic analysis of a greedy heuristic for {Euclidean} matching"
, journal =	"Probab. Engin. Inform. Sci."
, volume =	2
, year =	1988
, pages =	"143--156"
, update =	"93.09 rote"
}

@inproceedings{ad-lecmf-89
, author =	"D. Avis and M. Deza"
, title =	"{$L_{1}$} embeddability, complexity, and multicommodity flows"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	30
}

@techreport{ad-ahdsp-87
, author =	"D. Avis and M. Doskas"
, title =	"Algorithms for high dimensional stabbing problems"
, type =	"Technical {Report}"
, number =	"SOCS 87.2"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1987
, precedes =	"ad-ahdsp-88"
}

@incollection{ad-ahdsp-88
, author =	"D. Avis and M. Doskas"
, title =	"Algorithms for high dimensional stabbing problems"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"199--210"
, keywords =	"transversals, hyperplanes, stabbing, polyhedra, linear programming"
, succeeds =	"ad-ahdsp-87"
, update =	"99.11 bibrelex"
}

@article{ad-ahdsp-90
, author =	"D. Avis and M. Doskas"
, title =	"Algorithms for high dimensional stabbing problems"
, journal =	"Discrete Appl. Math."
, volume =	27
, year =	1990
, pages =	"59--62"
, update =	"97.11 bibrelex"
}

@article{ae-caps-83
, author =	"D. Avis and H. ElGindy"
, title =	"A combinatorial approach to polygon similarity"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-2"
, year =	1983
, pages =	"148--150"
, keywords =	"polygons, similarity, pattern matching, visibility graphs"
}

@article{ae-tpss-87
, author =	"D. Avis and H. ElGindy"
, title =	"Triangulating point sets in space"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"99--111"
, keywords =	"triangulation, decomposition, three-dimensional, $d$-dimensional, point sets"
, succeeds =	"ae-tspss-86"
}

@inproceedings{ae-tspss-86
, author =	"D. Avis and H. ElGindy"
, title =	"Triangulating simplicial point sets in space"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"133--141"
, keywords =	"triangulation, decomposition, three-dimensional, $d$-dimensional, point sets"
, precedes =	"ae-tpss-87"
, cites =	"g-cp-67, ps-cgi-85, rs-tchnp-85, ph-chfsp-77, k-osps-83, ZZZ"
, update =	"97.11 bibrelex"
}

@incollection{aes-solac-85
, author =	"D. Avis and H. ElGindy and R. Seidel"
, title =	"Simple on-line algorithms for convex polygons"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"23--42"
, keywords =	"convex hull, on-line, planar point sets, intersection, polygons"
, annote =	"Maintains convex hull of $n$ points in $O(\log n)$
		 time per insertion"
}

@article{aep-dddsp-91
, author =	"D. Avis and P. Erd{\H o}s and J. Pach"
, title =	"Distinct distances determined by subsets of a point set in space"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1991
, pages =	"1--11"
}

@article{aep-rds-88
, author =	"D. Avis and P. Erd{\H o}s and J. Pach"
, title =	"Repeated distances in the space"
, journal =	"Graphs Combin."
, volume =	4
, year =	1988
, pages =	"207--217"
, keywords =	"combinatorial geometry, proximity"
}

@article{af-beals-91
, author =	"D. Avis and K. Fukuda"
, title =	"A basis enumeration algorithm for linear systems with geometric applications"
, journal =	"Appl. Math. Lett."
, volume =	4
, number =	5
, year =	1991
, pages =	"39--42"
, keywords =	"linear programing, convex hull, oriented matroid"
, update =	"95.05 korneenko"
}

@techreport{af-pachv-90
, author =	"D. Avis and K. Fukuda"
, title =	"A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra"
, type =	"Technical {Report}"
, number =	"B-237"
, institution =	"Dept. of Information Science, Tokyo Institute of Technology"
, address =	"Tokyo, Japan"
, month =	nov
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{af-pachv-91
, author =	"D. Avis and K. Fukuda"
, title =	"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"98--104"
, precedes =	"af-pachv-92"
, cites =	"af-pachv-90, b-calp-77, ck-acp-70, c-lp-83, d-cvem-83, eos-calha-86, e-acg-87, eg-tsa-89, f-omp-82, fm-fccm-91, hiiry-owlll-90, mr-scmfa-80, mrtt-ddm-53, s-chdch-86, s-chaop-81, t-cccm-85, t-fccmo-87, t-lqpom-85, w-cefao-87, ZZZ"
, update =	"97.11 bibrelex, 93.09 rote"
}

@article{af-pachv-92
, author =	"D. Avis and K. Fukuda"
, title =	"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"295--313"
, succeeds =	"af-pachv-91"
, update =	"97.11 bibrelex"
}

@techreport{af-rse-92
, author =	"D. Avis and K. Fukuda"
, title =	"Reverse Search for Enumeration"
, number =	"No.~92-5"
, institution =	"Tsukuba University, Graduate School of Systems Management, Tokyo, Japan"
, month =	apr
, year =	1992
, comments =	"generates all enumerations of triangulations, spanning trees, etc."
, update =	"95.01 held"
}

@article{af-rse-96
, author =	"D. Avis and K. Fukuda"
, title =	"Reverse search for enumeration"
, journal =	"Discrete Appl. Math."
, volume =	65
, year =	1996
, pages =	"21--46"
, url =	"http://www.ifor.math.ethz.ch/staff/fukuda/fukuda.html"
, update =	"98.03 houle, 97.03 pocchiola, 96.05 fukuda"
, annote =	"Reverse search is a general exhaustive search technique
which came out of the new convex hull algorithm by the authors.
This technique can be applied to many enumeration problems in computer
science, operations research and geometry.
It is highly suitable for parallelization."
}

@article{ag-bkgfh-93
, author =	"D. Avis and V. P. Grishukhin"
, title =	"A Bound on the $k$-gonality of Facets of the Hypermetric Cone and Related Complexity Problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	5
, month =	mar
, year =	1993
, pages =	"241--254"
, update =	"93.09 held+milone+mitchell"
}

@article{agt-vbtes-86
, author =	"D. Avis and T. Gum and G. Toussaint"
, title =	"Visibility between two edges of a simple polygon"
, journal =	"Visual Comput."
, volume =	2
, number =	6
, month =	dec
, year =	1986
, pages =	"342--357"
, keywords =	"weak edge visibility, polygons, convex hull, hidden line problems, Jordan sorting, geometric complexity"
}

@article{ah-rsig-82
, author =	"D. Avis and J. Horton"
, title =	"Remarks on the sphere of influence graphs"
, journal =	"Ann. New York Acad. Sci."
, volume =	440
, year =	1982
, pages =	"323--327"
, keywords =	"proximity, geometric graphs"
, update =	"95.05 korneenko"
}

@inproceedings{ah-cahti-91
, author =	"D. Avis and M. E. Houle"
, title =	"Computational aspects of {Helly}'s theorem and its relatives"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"11--14"
, precedes =	"ah-cahti-95"
, cites =	"dgk-htir-63, h-umkkm-23, h-tess-91, k-cscb-53, r-mkkde-21, v-etrec-39, ZZZ"
, update =	"98.07 bibrelex, 96.09 devillers"
}

@article{ah-cahti-95
, author =	"D. Avis and M. E. Houle"
, title =	"Computational aspects of {Helly}'s theorem and its relatives"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"357--367"
, keywords =	"computational geometry, convexity, intersection, separation"
, succeeds =	"ah-cahti-91"
, update =	"96.09 devillers"
}

@article{ai-lram-90
, author =	"D. Avis and H. Imai"
, title =	"Locating a robot with angle measurements"
, journal =	"J. Symbolic Comput."
, volume =	10
, number =	"3--4"
, year =	1990
, pages =	"311--326"
, update =	"95.05 korneenko"
}

@inproceedings{ak-grtmd-96
, author =	"D. Avis and C. M. Kong"
, title =	"Generating rooted triangulations with minimum degree four"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"56--61"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@incollection{ar-cmscp-88
, author =	"D. Avis and D. Rappaport"
, title =	"Computing monotone simple circuits in the plane"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"13--23"
}

@inproceedings{ar-clecs-85
, author =	"D. Avis and D. Rappaport"
, title =	"Computing the largest empty convex subset of a set of points"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"161--167"
, keywords =	"planar point sets, convex subsets, discrete geometry"
, precedes =	"deo-secp-88, deo-secp-90"
, cites =	"ck-flcs-80, ea-lacvp-81, es-cpg-35, es-sepeg-60, e-peac-73, gp-gs-82, h-kfiep-78, h-snec7-83, m-rpdg-81, rt-slhla-83, s-pcg-77, ZZZ"
, update =	"97.11 bibrelex, 93.09 milone+mitchell"
}

@article{arw-lbls-89
, author =	"D. Avis and J.-M. Robert and R. Wenger"
, title =	"Lower bounds for line stabbing"
, journal =	"Inform. Process. Lett."
, volume =	33
, year =	1989
, pages =	"59--62"
}

@article{at-eadps-81
, author =	"D. Avis and G. T. Toussaint"
, title =	"An efficient algorithm for decomposing a polygon into star-shaped polygons"
, journal =	"Pattern Recogn."
, volume =	13
, year =	1981
, pages =	"395--398"
, keywords =	"decomposition, polygons, star-shaped, coloring"
, annote =	"Uses Fisk's constructive proof of Chvatal's theorem:
		 for every $n$-gon there is a decomposition into
		 $\lfloor n/3 \rfloor$ star shaped pieces. Proceeds by
		 colouring a triangulation with three colours."
}

@article{at-oadvp-81
, author =	"D. Avis and G. T. Toussaint"
, title =	"An optimal algorithm for determining the visibility of a polygon from an edge"
, journal =	"IEEE Trans. Comput."
, volume =	"C-30"
, number =	12
, year =	1981
, pages =	"910--1014"
, keywords =	"combinatorial geometry, design of algorithms, construction, incrementation, geometric transformations, worst-case analysis, Voronoi diagrams, two-dimensional, three-dimensional, weighted"
, update =	"98.07 bibrelex"
}

@article{atb-mdcp-82
, author =	"D. Avis and G. T. Toussaint and B. K. Bhattacharya"
, title =	"On the multimodality of distances in convex polygons"
, journal =	"Comput. Math. Appl."
, volume =	8
, year =	1982
, pages =	"153--156"
, keywords =	"discrete geometry, diameter, planar point sets"
}

@inproceedings{aw-alts-87
, author =	"D. Avis and R. Wenger"
, title =	"Algorithms for line transversals in space"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"300--307"
, precedes =	"aw-plts-88"
, cites =	"a-dp-86, ad-ahdsp-87, b-mag-69, dgk-htir-63, es-mnwsn-87, e-ftssg-85, emprww-sls-82, et-eaide-85, gp-htthd-86, hdk-cgp-64, klz-gpcs-85, k-tsct-80, ps-cgi-85, w-ublo-86, ZZZ"
, update =	"98.03 bibrelex"
}

@article{aw-plts-88
, author =	"D. Avis and R. Wenger"
, title =	"Polyhedral line transversals in space"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"257--265"
, succeeds =	"aw-alts-87"
}

@article{aw-plts-89
, author =	"D. Avis and R. Wenger"
, title =	"Polyhedral line traversals in space"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, update =	"98.11 bibrelex"
}

@article{ah-g-66
, author =	"S. Avital and H. Hanani"
, title =	"Graphs"
, journal =	"Gilyonot Lematematika"
, volume =	3
, year =	1966
, pages =	"2--8"
, note =	"In Hebrew"
, update =	"98.03 bibrelex"
}

@phdthesis{a-peddf-89
, author =	"Francis Avnaim"
, title =	"Placement et d{\'e}placement de formes rigides ou articul{\'e}es"
, type =	"Th{\`e}se de Doctorat en Sciences"
, school =	"Uni\-ver\-sit{\'e} de Franche-Comt{\'e}"
, address =	"Besan\c{c}on, France"
, year =	1989
, keywords =	"doctoral thesis"
, update =	"99.07 devillers, 93.09 rote, 93.05 jones"
}

@incollection{ab-pptr-88
, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
, title =	"Polygon placement under translation and rotation"
, booktitle =	"Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	294
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"322--333"
, update =	"99.07 devillers"
}

@article{ab-pptr-89
, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
, title =	"Polygon placement under translation and rotation"
, journal =	"RAIRO Inform. Theor."
, volume =	23
, year =	1989
, pages =	"5--28"
, update =	"99.07 devillers, 98.07 bibrelex, 95.05 korneenko, 95.01 devillers"
}

@inproceedings{ab-pempc-89
, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
, title =	"Practical exact motion planning of a class of robots with three degrees of freedom"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	19
, update =	"99.07 devillers"
}

@inproceedings{ab-scsp-87
, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
, title =	"Simultaneous containment of several polygons"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"242--250"
, cites =	"b-srpcs-86, bfm-ipc-84, c-pcp-83, f-fapct-85, grs-kfcg-83, gs-ccrs-86, hm-ftprs-85, hmmn-sssic-84, ks-eapcf-85, oww-fabmo-85, ps-cgi-85, ss-pmp3c-82, ww-tsoab-86, y-cmsd-84, ZZZ"
, update =	"99.07 devillers, 98.03 bibrelex"
}

@techreport{ab-pcp1s-87
, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
, title =	"The polygon containment problem: 1. Simultaneous containment under translation"
, type =	"Technical {Report}"
, number =	689
, institution =	"INRIA Sophia-Antipolis"
, month =	jun
, year =	1987
, update =	"99.07 devillers, 97.11 bibrelex"
}

@techreport{abdpy-esdus-94
, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
, title =	"Evaluating signs of determinants using single-precision arithmetic"
, type =	"Research {Report}"
, number =	2306
, institution =	"INRIA"
, address =	"BP93, 06902 Sophia-Antipolis, France"
, year =	1994
, url =	"http://www.inria.fr/RRRT/RR-2306"
, precedes =	"abdpy-esdus-97"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
, abstract =	"We propose a method to evaluate signs of $2\times 2$ and
$3\times 3$ determinants with $b$-bit integer entries using only $b$ and
$(b+1)$-bit arithmetic respectively. This algorithm has numerous
applications in geometric computation and provides a general and practical
approach to robustness.  The algorithm has been implemented and
experimental results show that it slows down the computing time by only a
small factor with respect to floating-point calculation."
}

@article{abdpy-esdus-97
, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
, title =	"Evaluating signs of determinants using single-precision arithmetic"
, journal =	"Algorithmica"
, volume =	17
, number =	2
, year =	1997
, pages =	"111--132"
, url =	"http://www-sop.inria.fr/prisme/publis/abdpy-esdus-97.ps.gz"
, succeeds =	"abdpy-esdus-94, abdpy-enmcs-95"
, cites =	"bjmm-lsicg-93, c-sede-92, fm-nsala-91, f-nsa2d-92, f-smpst-89, fv-eeacg-93, gss-egbra-89, gy-frcg-86, hhk-rsops-89, kln-edtur-91, m-dpggt-89, m-vigau-88a, ps-cgi-85, si-gafpa-88, v-cca-79"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.07 tamassia, 97.11 bibrelex, 97.03 devillers"
, abstract =	"We propose a method to evaluate signs of  $2\times 2$ and $3\times 3$ determinants with $b$-bit integer entries using only $b$ and $(b+1)$-bit arithmetic respectively. This algorithm has numerous applications in geometric computation and provides a general and practical approach to robustness.  The algorithm has been implemented and compared with other exact computation methods."
}

@inproceedings{abdpy-enmcs-95
, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
, title =	"Evaluation of a new method to compute signs of determinants"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C16--C17"
, url =	"http://www-sop.inria.fr/prisme/publis/abdpy-enmcs-95.ps.gz"
, precedes =	"abdpy-esdus-97"
, cites =	"ZZZ"
, update =	"99.11 bibrelex, 99.07 devillers, 98.03 bibrelex, 97.03 devillers, 96.01 devillers, 95.05 devillers"
}

@inproceedings{abf-pempa-88
, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Bernard Faverjon"
, title =	"A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Robot. Autom."
, year =	1988
, pages =	"1656--1661"
, update =	"99.07 devillers"
}

@incollection{abf-pempa-89
, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Bernard Faverjon"
, title =	"A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, year =	1989
, pages =	"67--86"
, keywords =	"motion planning"
, update =	"99.07 devillers, 95.05 korneenko"
}

@incollection{ak-srtat-89
, author =	"J. Avro and D. Kirk"
, title =	"A survey of ray tracing acceleration techniques"
, editor =	"A. Glassner"
, booktitle =	"An Introduction to Ray Tracing"
, publisher =	"Academic Press"
, address =	"San Diego, CA"
, year =	1989
, pages =	"201--262"
, isbn =	"0-12-286160-4"
, update =	"98.11 bibrelex, 98.03 bibrelex+mitchell"
}

@article{a-cns-85
, author =	"B. Awerbuch"
, title =	"Complexity of network synchronization"
, journal =	"J. ACM"
, volume =	"??"
, year =	1985
, pages =	"804--823"
, update =	"97.11 bibrelex"
}

@techreport{aabv-iagmw-94
, author =	"B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
, title =	"Improved approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
, number =	"CMU-CS-94-173"
, institution =	"Dept. Computer Science, Carnegie-Mellon University"
, address =	"Pittsburgh, PA, 15213"
, month =	aug
, year =	1994
, update =	"95.01 mitchell"
}

@inproceedings{aabv-iagmw-95
, author =	"B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
, title =	"Improved approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC 95"
, year =	1995
, pages =	"277--283"
, succeeds =	"aabv-iagmw-94"
, update =	"99.07 smid, 98.07 mitchell, 98.03 bibrelex"
}

@article{aabv-nagmw-98
, author =	"B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
, title =	"New approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1998
, pages =	"254--262"
, update =	"99.07 smid"
}

@article{abcp-nltcs-98
, author =	"B. Awerbuch and B. Berger and L. Cowen and D. Peleg"
, title =	"Near-linear time construction of sparse neighborhood covers"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1998
, pages =	"263--277"
, update =	"99.07 smid"
}

@inproceedings{ap-sp-90
, author =	"B. Awerbuch and D. Peleg"
, title =	"Sparse partitions"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"503--513"
, update =	"97.11 bibrelex"
}

@book{a-avmrs-91
, author =	"N. Ayache"
, title =	"Artificial Vision for Mobile Robots: Stereo Vision and Multisensory Perception"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1991
, update =	"97.11 bibrelex"
}

@incollection{abcglms-stai3-90
, author =	"N. Ayache and J. D. Boissonnat and L. Cohen and B. Geiger and J. Levy-Vehel and O. Monga and P. Sander"
, title =	"Steps toward the automatic interpretation of 3{D} images"
, editor =	"K. H. H{\"o}hne and H. Fuchs and S. M. Pizer"
, booktitle =	"3D Imaging in Medicine"
, series =	"NATO ASI"
, volume =	"F60"
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"107--120"
, update =	"93.09 devillers+rote"
}

@article{af-ersmg-87
, author =	"N. Ayache and B. Faverjon"
, title =	"Efficient registration of stereo by matching graph descriptors of edge segments"
, journal =	"Internat. J. Comput Vision"
, volume =	"??"
, year =	1987
, pages =	"107--131"
, update =	"97.11 bibrelex"
}

@article{abjn-ormnd-85
, author =	"D. Ayala and P. Brunet and R. Juan and I. Navazo"
, title =	"Object representation by means of nominal division quadtrees"
, journal =	"ACM Trans. Graph."
, volume =	4
, number =	1
, year =	1985
, pages =	"41--59"
}

@inproceedings{adfqr-ndstd-94
, author =	"R. Ayala and E. Dom{\'\i}nguez and A. R. Franc{\'e}s and A. Quintero and J. Rubio"
, title =	"{$N$}-Dimensional Separation Theorems in Digital Topology"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"29--32"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{ai-patgt-97
, author =	"Cavit Aydin and Doug Ierardi"
, title =	"Partitioning Algorithms for Transportation Graphs and their Applications to Routing"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"245--250"
, update =	"97.11 jones"
}

@article{a-lbimt-94
, author =	"Yossi Azar"
, title =	"Lower Bounds for Insertion Methods for {TSP}"
, journal =	"Combinatorics, Probability and Computing"
, volume =	3
, year =	1994
, pages =	"285--292"
, update =	"98.03 mitchell"
, annote =	"See also \cite{bkp-naimy-94}; Bafna et al independently
                  discovered the same result."
}

@article{ae-tdp-97
, author =	"Yossi Azar and Leah Epstein"
, title =	"On Two Dimensional Packing"
, journal =	"J. Algorithms"
, volume =	25
, number =	2
, month =	nov
, year =	1997
, pages =	"290--310"
, keywords =	"bin packing, rectangles, boxes, approximation algorithm"
, update =	"98.03 mitchell"
}

@article{amm-cgcap-93
, author =	"A. S. Azarenok and V. N. Martynchik and N. N. Metel'skii"
, title =	"Computation of generalized convex approximations of planar geometric objects"
, journal =	"Comp. Maths Math. Phys. (English translation of Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki)"
, volume =	33
, number =	12
, year =	1993
, pages =	"1641--1651"
, keywords =	"shape approximation, generalized convexity, visibility, isothetic domain, $S-$convex hull, $S-$convex approximation"
, update =	"98.07 bibrelex, 95.01 korneenko"
, annote =	"The author's notion of $S-$convex hull for an isothetic
   domain is in other words the minimal externally isothetically visible
   hull. An $O(rn^3)$ time $O(rn^2)$ space algorithm for $r-$vertex
   $S-$convex approximation of miminal area of an $n-$vertex isothetic
   domain is given."
, abstract =	"Using generalizations of the concept of convexity,
     a technique is described for approximating polygonal domains by
     simplifying their geometric shape. An algorithm of polynomial
     complexity is obtained for computing a generalized-convex
     approximation with a priori constraints on the number of vertices
     of the resulting domain. The quality of the approximation is
     evaluated from the increment in area of the original domain
     which is minimized by solving a certain extremum combinatorial
     problem. (Author abstract) 8 Refs."
}

@inproceedings{bw-acmrs-92
, author =	"J. H. B{\/o}hn and M. J. Wozny"
, title =	"Automatic {CAD}-model repair: {Shell}-closure"
, booktitle =	"Proc. Sympos. on Solid Freeform Fabrication"
, site =	"Austin, TX"
, organization =	"Dept. Mech. Eng., Univ. Texas Austin"
, year =	1992
, pages =	"86--94"
, update =	"98.07 bibrelex"
}

@techreport{bf-lamcp-88
, author =	"L. Babai and P. Frankl"
, title =	"Linear Algebra Methods in Combinatorics, Part {I}"
, type =	"Technical {Report}"
, institution =	"Univ. Chicago"
, address =	"Chicago, IL"
, year =	1988
, update =	"98.03 bibrelex"
}

@article{bjmadh-lcff-88
, author =	"L. Babai and B. Just and F. {Meyer auf der Heide}"
, title =	"On the limits of computations with the floor function"
, journal =	"Inform. Comput."
, volume =	78
, number =	2
, year =	1988
, pages =	"99--108"
, keywords =	"lower bounds, computational complexity"
, update =	"95.05 korneenko"
}

@inproceedings{bsw-cplhp-97
, author =	"Mark Babikov and Diane Souvaine and Rephael Wenger"
, title =	"Constructing Piecewise Linear Homeomorphisms of Polygons with Holes"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"6--10"
, update =	"97.11 jones"
}

@article{ba-acfem-76
, author =	"I. Babuska and A. K. Aziz"
, title =	"On the angle condition in the finite element method"
, journal =	"SIAM J. Numer. Anal."
, volume =	13
, year =	1976
, pages =	"214--227"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@article{bb-3drcg-78
, author =	"N. Badler and R. Bajcsy"
, title =	"$3$-d representation for computer graphics and computer vision"
, journal =	"Comput. Graph. Image Process."
, volume =	12
, year =	1978
, pages =	"153--160"
}

@article{bsc-ctsv-99
, author =	"N. Baek and S.-Y. Shin and K.-Y. Chwa"
, title =	"On Computing Translational Swept Volumes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, number =	3
, month =	jun
, year =	1999
, pages =	"293--317"
, update =	"99.07 held"
}

@article{bsc-tdtsc-00
, author =	"N. Baek and S.-Y. Shin and K.-Y. Chwa"
, title =	"Three-dimensional topological sweep for computing rotational swept volumes of polyhedral objects"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"131--156"
, update =	"00.11 smid, 00.07 smid"
}

@article{beh-gms-79
, author =	"A. Baer and C. Eastman and M. Henrion"
, title =	"Geometric Modeling: {A} Survey"
, journal =	"CAD"
, volume =	11
, number =	5
, month =	sep
, year =	1979
, pages =	"253--272"
, update =	"97.11 bibrelex"
}

@incollection{b-ssar-89
, author =	"R. {Baeza-Yates}"
, title =	"String searching algorthms revisited"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, year =	1989
, pages =	"75--96"
, keywords =	"searching, string matching"
, update =	"95.05 korneenko"
}

@article{bcr-sp-93
, author =	"R. Baeza-Yates and J. Culberson and G. Rawlins"
, title =	"Searching in the plane"
, journal =	"Inform. Comput."
, volume =	106
, year =	1993
, pages =	"234--252"
, update =	"97.03 icking"
}

@incollection{br-fatdm-90
, author =	"R. {Baeza-Yates} and M. Regnier"
, title =	"Fast algorithms for two-dimensional and multiple pattern matching"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, year =	1990
, pages =	"332--247"
, keywords =	"searching, pattern matching"
, update =	"95.05 korneenko"
}

@article{bs-psp-95
, author =	"R. {Baeza-Yates} and R. Schott"
, title =	"Parallel searching in the plane"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"143--154"
, update =	"96.09 devillers"
}

@article{bkp-naimy-94
, author =	"Vineet Bafna and Bala Kalyanasundaram and Kirk Pruhs"
, title =	"Not All Insertion Methods Yield Constant Approximate Tours in the {Euclidean} Plane"
, journal =	"Theoret. Comput. Sci."
, volume =	125
, year =	1994
, pages =	"345--353"
, update =	"98.03 mitchell"
, annote =	"See also \cite{a-lbimt-94}; Azar independently
                  discovered the same result."
}

@article{b-bdce-86
, author =	"V. Bagatelj"
, title =	"On the balanced divide-and-conquer equation"
, journal =	"Internat. J. Comput. Math."
, volume =	19
, number =	"3--4"
, year =	1986
, pages =	"259--266"
, keywords =	"divide and conquer"
, update =	"95.05 korneenko"
}

@techreport{b-ip-??
, author =	"F. Bagemihl"
, title =	"On indecomposable polyhedra"
, type =	"Report"
, number =	"??"
, institution =	"Univ. Rochester"
, address =	"Rochester, NY"
, year =	"??"
, precedes =	"b-ip-48a"
, update =	"98.11 bibrelex"
}

@article{b-ip-48a
, author =	"F. Bagemihl"
, title =	"On indecomposable polyhedra"
, journal =	"Amer. Math. Monthly"
, volume =	"??"
, month =	sep
, year =	1948
, pages =	"411--413"
, succeeds =	"b-ip-??"
, update =	"98.11 bibrelex"
}

@inproceedings{bdegm-cvgls-97
, author =	"J. Bagga and S. Dey and J. Emert and L. Gewali and J. McGrew"
, title =	"Contracted Visibility Graphs of Line Segments"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"82--86"
, update =	"97.11 jones"
}

@inproceedings{bgg-cipaf-96
, author =	"J. Bagga and L. Gewali and D. Glasser"
, title =	"The complexity of illuminating polygons by {$\alpha$}-flood-lights"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"337--342"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{bgn-vemeu-97
, author =	"Jay Bagga and Laxmi Gewali and Simeon Ntafos"
, title =	"Visibility Edges, Mixed Edges, and Unique Triangulation"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	11
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@techreport{b-phpmp-93
, author =	"D. H. Bailey"
, title =	"A Portable High Performance Multiprecision Package"
, number =	"RNR-90-022"
, institution =	"NASA Ames Res. Center"
, month =	may
, year =	1993
, update =	"97.11 bibrelex"
}

@article{bc-chit-87
, author =	"T. Bailey and J. Cowles"
, title =	"A convex hull inclusion test"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	9
, number =	2
, year =	1987
, pages =	"312--316"
, keywords =	"convex hull, point location"
, update =	"95.05 korneenko"
}

@techreport{bbdmrs-mqr-90
, author =	"J. Baillieul and R. Brockett and B. Donald and R. Murray and M. Raghavan and S. Sastry"
, title =	"Mathematical questions in robotics"
, type =	"Technical {Report}"
, number =	"TR~90-1097"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	feb
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{b-bsdi-92
, author =	"H. S. Baird"
, title =	"Background structure in document images"
, booktitle =	"Proc. of the IAPR 1992 Workshop on Syntactic and Structural Pattern Recognition"
, year =	1992
, pages =	"??"
, keywords =	"maximal empty rectangles, OCR, optical character recognition"
, update =	"95.01 mitchell"
}

@inproceedings{b-falaa-77
, author =	"H. S. Baird"
, title =	"Fast algorithms for {LSI} artwork analysis"
, booktitle =	"Proc. Design Autom. Conf."
, year =	1977
, pages =	"303--311"
, precedes =	"b-falaa-78"
, update =	"95.05 korneenko"
}

@article{b-falaa-78
, author =	"H. S. Baird"
, title =	"Fast algorithms for {LSI} artwork analysis"
, journal =	"J. Design Autom. Fault-Tolerant Comput."
, volume =	2
, number =	2
, year =	1978
, pages =	"179--209"
, keywords =	", VLSI design, polygons, Boolean operations, isothetic"
, succeeds =	"b-falaa-77"
, update =	"95.05 korneenko"
}

@book{b-mbimu-84
, author =	"H. S. Baird"
, title =	"Model-Based Image Matching Using Location"
, series =	"Distinguished Dissertation Series"
, publisher =	"MIT Press"
, year =	1984
}

@inproceedings{bjf-issdc-90
, author =	"H. S. Baird and S. E. Jones and S. J. Fortune"
, title =	"Image segmentation by shape-directed covers"
, booktitle =	"Proc. of the Tenth International Conference on Pattern Recognition"
, publisher =	"IEEE Computer Society"
, year =	1990
, pages =	"820--825"
, keywords =	"maximal empty rectangles, OCR, optical character recognition"
, update =	"95.01 mitchell"
}

@inproceedings{br-tdarp-94
, author =	"B. Bajaj and A. Royappa"
, title =	"Triangulation and display of arbitrary rational parametric surfaces"
, editor =	"R. Bergeron and A. Kaufman"
, booktitle =	"IEEE Visualiuation '94 Conference"
, publisher =	"IEEE"
, year =	1994
, update =	"98.07 bibrelex"
}

@inproceedings{b-epses-86
, author =	"C. Bajaj"
, title =	"An efficient parallel solution for {Euclidean} shortest paths in three dimensions"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"San Francisco, CA"
, year =	1986
, pages =	"1897--1900"
, keywords =	"motion planning, elementary geometry, parallel computation, geodesic distance, numerical analysis, CAD, robotics"
}

@inproceedings{b-agtam-85
, author =	"C. Bajaj"
, title =	"Applying {Galois} Theoretic Algebraic Methods to Geometric Optimization problems"
, booktitle =	"SIAM Conf. on Geometric Modeling and Robotics"
, site =	"Albany, NY"
, month =	jul
, year =	1985
, update =	"93.09 milone+mitchell"
}

@inproceedings{b-cgiv-96
, author =	"C. Bajaj"
, title =	"Computational geometry for interrogative visualization"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"99--100"
, update =	"97.03 agarwal, 96.09 mitchell"
, annote =	"Invited Lecture by C. Bajaj"
}

@incollection{b-gmas-89
, author =	"C. Bajaj"
, title =	"Geometric Modeling with Algebraic Surfaces"
, editor =	"D. Handscomb"
, booktitle =	"The Mathematics of Surfaces III"
, publisher =	"Oxford University Press"
, year =	1989
, pages =	"3--48"
, update =	"97.11 bibrelex"
}

@techreport{b-gocc-84
, author =	"C. Bajaj"
, title =	"Geometric optimization and computational complexity"
, type =	"Technical {Report}"
, number =	"TR~84-629"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1984
}

@inproceedings{b-goph-85
, author =	"C. Bajaj"
, title =	"Geometric Optimization and the Polynomial Hierarchy"
, booktitle =	"Proc. 5th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"New Delhi, India"
, series =	"Lecture Notes Comput. Sci."
, volume =	206
, publisher =	"Springer-Verlag"
, month =	dec
, year =	1985
, pages =	"176--195"
, precedes =	"b-goph-87"
, update =	"99.11 bibrelex, 96.05 pascucci, 95.05 korneenko, 93.09 milone+mitchell"
}

@article{b-goph-87
, author =	"C. Bajaj"
, title =	"Geometric optimization and the polynomial hierarchy"
, journal =	"Theoret. Comput. Sci."
, volume =	54
, number =	1
, year =	1987
, pages =	"87--102"
, keywords =	"optimization, facility location, computational complexity"
, succeeds =	"b-goph-85"
, update =	"95.05 korneenko"
}

@inproceedings{b-lasgm-86
, author =	"C. Bajaj"
, title =	"Limitations to algorithm solvability: {Galois} methods and models of computation"
, booktitle =	"Proc. ACM Sympos. Symbolic and Algebraic Computation"
, year =	1986
, pages =	"71--76"
, keywords =	"discrete geometry, algebra, complexity theory, two-dimensional, three-dimensional, CAD, robotics"
}

@techreport{b-lpiir-89
, author =	"C. Bajaj"
, title =	"Local Parameterization, Implicitazion and Inversion of Real Algebraic Curves"
, type =	"Technical {Report}"
, number =	"CSD-TR-863"
, institution =	"Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1989
, note =	"Also CAPO-89-9, Proc. AAECC-7 Conf."
, update =	"97.11 bibrelex"
}

@techreport{b-mgopa-84
, author =	"C. Bajaj"
, title =	"{MINSUM} geometric optimization problems are {$\delta_{2}^{P}$}-proper"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1984
, comments =	"Updated invited version in \cite{b-goph-87}"
, precedes =	"b-goph-87"
, update =	"96.05 pascucci, 93.05 jones"
}

@article{b-pgans-86
, author =	"C. Bajaj"
, title =	"Proving geometric algorithm non-solvability: {An} application of factoring polynomials"
, journal =	"J. Symbolic Comput."
, volume =	2
, year =	1986
, pages =	"99--102"
, keywords =	"discrete geometry, algebra, complexity theory, two-dimensional, three-dimensional, CAD, robotics"
}

@inproceedings{b-rhd-90
, author =	"C. Bajaj"
, title =	"Rational Hypersurface Display"
, booktitle =	"Proc. 1990 Sympos. Interactive 3D Graphics"
, site =	"Snowbird, UT"
, year =	1990
, update =	"97.11 bibrelex"
}

@techreport{b-rglao-84
, author =	"C. Bajaj"
, title =	"Reducibility among geometric location-allocation optimization problems"
, type =	"Technical {Report}"
, number =	"TR~84-607"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1984
, keywords =	"discrete geometry, complexity theory, optimization, two-dimensional, three-dimensional, robotics"
}

@inproceedings{b-acspp-85
, author =	"C. Bajaj"
, title =	"The algebraic complexity of shortest paths in polyhedral spaces"
, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
, year =	1985
, pages =	"510--517"
, keywords =	"motion planning, geometry, algebra, complexity theory, three-dimensional, CAD, robotics"
}

@article{b-adgop-88
, author =	"C. Bajaj"
, title =	"The algebraic degree of geometric optimization problems"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"177--191"
, keywords =	"discrete geometry, algebra, complexity theory, optimization, two-dimensional, three-dimensional, CAD, robotics"
}

@incollection{b-eacsg-93
, author =	"C. Bajaj"
, title =	"The Emergence of Algebraic Curves and Surfaces in Geometric Design"
, editor =	"R. Martin"
, booktitle =	"Directions in Geometric Computing"
, publisher =	"Information Geometers Press"
, year =	1993
, pages =	"1--29"
, update =	"96.05 pascucci"
}

@techreport{ba-aprcs-86
, author =	"C. Bajaj and S. Abhyankar"
, title =	"Automatic parameterization of rational curves and surfaces {II}: {Cubics} and cubicoids"
, type =	"Report"
, number =	"CSD-TR-592"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1986
, keywords =	"algebraic geometry, design of algorithms, computer graphics, CAD"
, update =	"93.05 jones"
}

@incollection{bas-cpdp-95
, author =	"C. Bajaj and V. Anupam and D. Schikore"
, title =	"Custom Prosthesis Design and Prototyping"
, chapter =	3
, editor =	"Roy Rada and Claude Ghaoui"
, booktitle =	"Multimedia Medical Education"
, publisher =	"Intellect Books"
, address =	"Oxford, England"
, year =	1995
, pages =	"39--47"
, update =	"96.05 pascucci"
}

@article{bbx-arssf-95
, author =	"C. Bajaj and F. Bernardini and G. Xu"
, title =	"Automatic reconstruction of surface and scalar fields from $3$d scans"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1995
, pages =	"109--118"
, note =	"Proc. SIGGRAPH'95"
, update =	"98.07 bibrelex"
}

@inproceedings{bcgw-frpc-89
, author =	"C. Bajaj and J. Canny and T. Garrity and J. Warren"
, title =	"Factoring Rational Polynomials over the Complexes"
, booktitle =	"Proc. Internat. Sympos. on Symbolic and Algebraic Computation"
, year =	1989
, pages =	"81--90"
, update =	"97.11 bibrelex"
}

@article{bcx-mcap-95
, author =	"C. Bajaj and J. Chen and G. Xu"
, title =	"Modeling with cubic {A}-patches"
, journal =	"ACM Trans. Graph."
, volume =	14
, number =	2
, year =	1995
, pages =	"103--133"
, update =	"98.07 bibrelex"
}

@techreport{bd-cdpr-90
, author =	"C. Bajaj and T. Dey"
, title =	"Convex Decomposition of Polyhedra and Robustness"
, type =	"Technical {Report}"
, number =	"CSD-TR-990"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, year =	1990
, update =	"97.11 bibrelex"
}

@techreport{bd-cdsp-89
, author =	"C. Bajaj and T. Dey"
, title =	"Convex Decomposition of Simple Polyhedra"
, number =	"CSD-TR-833"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, year =	1989
, update =	"98.03 bibrelex"
}

@article{bd-cdpr-92
, author =	"C. Bajaj and T. K. Dey"
, title =	"Convex decomposition of polyhedra and robustness"
, journal =	"SIAM J. Comput."
, volume =	21
, year =	1992
, pages =	"339--364"
}

@inproceedings{bd-pnr-89
, author =	"C. Bajaj and T. K. Dey"
, title =	"Polygon nesting and robustness"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"33--40"
, keywords =	"containment"
, precedes =	"bd-pnr-90"
, update =	"95.09 mitchell"
}

@article{bd-pnr-90
, author =	"C. Bajaj and T. K. Dey"
, title =	"Polygon nesting and robustness"
, journal =	"Inform. Process. Lett."
, volume =	35
, year =	1990
, pages =	"23--32"
, keywords =	"containment"
, succeeds =	"bd-pnr-89"
, update =	"95.09 mitchell, 93.09 dey"
}

@techreport{bgw-amer-88
, author =	"C. Bajaj and T. Garrity and J. Warren"
, title =	"Applications of multi-equational resultants"
, type =	"Technical {Report}"
, number =	826
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1988
, update =	"98.07 bibrelex"
}

@techreport{bhhl-tsi-87
, author =	"C. Bajaj and C. M. Hoffmann and J. E. Hopcroft and R. E. Lynch"
, title =	"Tracing surface intersections"
, type =	"Report"
, number =	"CSD-TR-728"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1987
}

@article{bi-cspia-92
, author =	"C. Bajaj and I. Ihm"
, title =	"$C^1$ Smoothing of Polyhedra with Implicit Algebraic Splines"
, journal =	"Comput. Graph."
, volume =	26
, number =	2
, year =	1992
, pages =	"79--88"
, note =	"Proc. SIGGRAPH '92"
, update =	"96.09 devillers, 96.05 pascucci"
}

@inproceedings{bk-gcso3-87
, author =	"C. Bajaj and M. Kim"
, title =	"Generation of Configuration Space Obstacles {III}: {The} Case of Moving Algebraic Curves"
, booktitle =	"Proc. 4th IEEE Internat. Conf. Robot. Autom."
, year =	1987
, update =	"98.03 bibrelex"
}

@incollection{bkm-apgm-88
, author =	"C. Bajaj and M.-S. Kim"
, title =	"Algorithms for planar geometric models"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	317
, year =	1988
, pages =	"67--81"
, keywords =	"curvilinear, convex hull, decomposition, motion planning"
, update =	"95.05 korneenko"
}

@inproceedings{bk-cmpgm-87
, author =	"C. Bajaj and M.-S. Kim"
, title =	"Compliant motion planning with geometric models"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"171--180"
, keywords =	"motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
, comments =	"full version appeared as Generation of configuration space obstacles:{II} The moving of algebraic surfaces, the internation journal of robotics research 9:1, feb 1990, 92-112"
, cites =	"a-hragr-76, ab-arpcs-87, ba-aprcs-86, ab-arpcs3-86, aa-ntsrm-76, bk-gcso2-86, bk-gcso3-87, bfh-sam-86, bcl-casac-82, c-cdmp-84, c-cpplb-84, c-cmpr-71, d-etqti-08, c-dgcs-76, d-mpsdf-84, fa-spbsg-84, f-past-75, grs-kfcg-83, gs-ccrs-86, hh-gabr-86, hk-crcs-85, h-rv-86, kw-gcsmm-79, l-spcsa-83, lw-apcfp-79, lmt-asfms-84, mmp-dgp-85, m-fspcp-85, osb-spps-85, p-mmp-78, r-rrso-80, rv-smcsr-83, ss-pmp2g-83, ss-spps-84, th-otdp-84, u-cdacc-77, w-ac-78, y-amp-85, ZZZ"
, update =	"98.03 bibrelex, 93.09 milone+mitchell"
}

@techreport{bk-choba-87
, author =	"C. Bajaj and M. S. Kim"
, title =	"Convex hull of objects bounded by algebraic curves"
, type =	"Report"
, number =	"CSD-TR-697"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1987
, precedes =	"bk-choba-91"
}

@article{bk-choba-91
, author =	"C. Bajaj and M. S. Kim"
, title =	"Convex hull of objects bounded by algebraic curves"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"533--553"
, succeeds =	"bk-choba-87"
}

@techreport{bk-gcso1-85
, author =	"C. Bajaj and M.-S. Kim"
, title =	"Generation of configuration space obstacles {I}: the case of a moving sphere"
, type =	"Report"
, number =	"CSD-TR-565"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1985
, keywords =	"motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
, precedes =	"bkm-gcsoc-88"
, update =	"95.05 korneenko"
}

@techreport{bk-gcso2-86
, author =	"C. Bajaj and M. S. Kim"
, title =	"Generation of configuration space obstacles {II}: the case of moving algebraic surfaces"
, type =	"Report"
, number =	"CSD-TR-586"
, institution =	"Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1986
, keywords =	"motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
, precedes =	"bk-gcsoc-89"
}

@article{bk-gcsoc-89
, author =	"C. Bajaj and M.-S. Kim"
, title =	"Generation of configuration space obstacles: the case of moving algebraic surfaces"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"155--172"
, succeeds =	"bk-gcso2-86"
}

@article{bkm-gcsoc-88
, author =	"C. Bajaj and M.-S. Kim"
, title =	"Generation of configuration-space obstacles: {The} case of moving sphere"
, journal =	"Internat. J. Robot. Autom."
, volume =	4
, number =	1
, year =	1988
, pages =	"94--99"
, keywords =	"motion planning"
, precedes =	"bk-gcso1-85"
, update =	"95.05 korneenko"
}

@article{bl-godc-89
, author =	"C. Bajaj and M. Li"
, title =	"Geometric optimization and {$D^P$}-completeness"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"3--13"
}

@inproceedings{bl-dicp-83
, author =	"C. Bajaj and M. Li"
, title =	"On the duality of intersections and closest points"
, booktitle =	"Proc. 21st Allerton Conf. Commun. Control Comput."
, year =	1983
, pages =	"459--461"
, keywords =	"discrete geometry, design of algorithms, geometric transformations, computer graphics, CAD"
}

@article{bm-gusp-88
, author =	"C. Bajaj and T. T. Moh"
, title =	"Generalized unfoldings for shortest paths"
, journal =	"Internat. J. Robot. Res."
, volume =	7
, year =	1988
, pages =	"71--76"
, keywords =	"motion planning, elementary geometry, design of algorithms, geodesic distance, CAD, robotics"
, succeeds =	"bm-guspe-85"
, update =	"97.11 bibrelex"
}

@techreport{bm-guspe-85
, author =	"C. Bajaj and T. T. Moh"
, title =	"Generalized Unfoldings for Shortest Paths in {Euclidean} 3-Space"
, type =	"Technical {Report}"
, number =	"CSD-TR-526"
, institution =	"Department of Computer Science, Purdue University"
, year =	1985
, precedes =	"bm-gusp-88"
, update =	"98.07 bibrelex, 93.09 milone+mitchell"
}

@article{br-frrpc-95
, author =	"C. Bajaj and A. Royappa"
, title =	"Finite representations of real parametric curves and surfaces"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"313--326"
, keywords =	"real parametric curves and surfaces, varieties, computer graphics, projective domain transformations"
, update =	"96.09 devillers"
}

@techreport{br-gagt-90
, author =	"C. Bajaj and A. Royappa"
, title =	"The {GANITH} Algebraic Geometry Toolkit"
, type =	"Technical {Report}"
, number =	914
, institution =	"Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1990
, note =	"CAPO Report No. CER-89-21, Also to appear in DISCO 90"
, update =	"97.11 bibrelex"
}

@inproceedings{bs-ebrtm-96
, author =	"C. Bajaj and D. Schikore"
, title =	"Error-bounded reduction of triangle meshes with multivariate data"
, booktitle =	"Proc. SPIE Sympos. Visual Data Exploration and Analysis III"
, month =	jan
, year =	1996
, pages =	"34--45"
, update =	"98.07 bibrelex"
}

@article{bs-tpdse-98
, author =	"C. Bajaj and D. Schikore"
, title =	"Topology preserving data simplification with error bounds"
, journal =	"Computers \& Graphics"
, volume =	22
, number =	1
, year =	1998
, pages =	"3--12"
, update =	"02.03 wenger"
}

@incollection{bx-crcsr-94
, author =	"Chandrajit Bajaj and Guoliang Xu"
, title =	"Converting a Rational Curve to a Standard Rational {Bernstein}-{B{\'e}zier} Representation"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"256--260"
, keywords =	"Bezier curve, rational curve, NURB"
, update =	"94.09 heckbert"
, annote =	"Discusses a low-level operation on curves: conversion of a
rational piecewise polynomial curve into rational Bernstein-Bezier form, a
commonly used type of non-uniform rational B-spline (NURB). Rational splines
are useful because they allow conic curves to be represented exactly,
whereas standard (polynomial) splines do not. Contains pseudocode."
}

@booklet{b-cmst-95
, author =	"C. L. Bajaj"
, title =	"Collaborative Multimedia \& Scientific Toolkits"
, howpublished =	"Course Notes, Dept. Comp. Sci., Purdue Univ."
, address =	"West Lafayette, Indiana"
, year =	1996
, update =	"98.07 tamassia"
}

@inproceedings{b-gcavb-90
, author =	"C. L. Bajaj"
, title =	"Geometric computations with algebraic varieties of bounded degree"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"148--156"
, cites =	"a-gph-88, ab-arpcs-87, ab-arpcs2-87, ab-cac-89, b-gmas-89, b-lpiir-89, b-rhd-90, bcgw-frpc-89, bhhl-tsi-87, br-gagt-90, b-gbamp-85, c-sagcp-88, c-gcp-88, ckl-sspef-89, c-te-48, cg-stssa-83, d-cag-79, f-it-84, gw-cipas-87, g-seppi-84, h-ag-77, h-tdaz-08, hy-prsts-87, hk-crcs-85i, jb-spaac-90, k-eidat-03, k-geatd-82, k-eukav-52, k-eukav-59, l-mmdiq-79, l-gbger-83, l-gprs-83, m-sfe-02, mm-cwpcs-82, mm-chf-83, oss-picpu-87, r-ccgfo-89, s-limha-85, sr-iag-49, s-fpavp-80, ss-pmp2g-83, ss-pcas-87, w-tbcav-87, zs-ca1-58, zs-ca2-58, ZZZ"
, update =	"97.11 bibrelex"
}

@article{bbx-rsfsu-97
, author =	"C. L. Bajaj and F. Bernadini and G. Xu"
, title =	"Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"243--261"
, update =	"97.07 held"
}

@inproceedings{bb-dvddt-90
, author =	"C. L. Bajaj and W. J. Bouma"
, title =	"Dynamic {Voronoi} diagrams and {Delaunay} triangulations"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"273--277"
, cites =	"a-sdcgp-85, b-gmas-89, bgw-amer-88, c-fsram-84, e-acg-87, ow-dsp-84t, ps-cgi-85, rs-mppmo-85t, s-acvd-92, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{bcl-b3dtm-96
, author =	"Chandrajit L. Bajaj and Edward J. Coyle and Kwun-Nan Lin"
, title =	"Boundary and 3D triangular meshes from planar cross sections"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"169--178"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@incollection{bd-rdp-89
, author =	"C. L. Bajaj and T. K. Dey"
, title =	"Robust decompositions of polyhedra"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	405
, year =	1989
, pages =	"267--279"
, keywords =	"polyhedron decomposition robust"
, update =	"95.05 korneenko"
}

@incollection{be-sgm-97
, author =	"C. L. Bajaj and S. Evans"
, title =	"Splines and geometric modeling"
, chapter =	45
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"833--850"
, update =	"97.11 orourke"
}

@article{bhlh-tsi-88
, author =	"C. L. Bajaj and C. M. Hoffman and R. E. Lynch and J. E. Hopcroft"
, title =	"Tracing surface intersections"
, journal =	"Comput. Aided Geom. Design"
, volume =	5
, year =	1988
, pages =	"285--307"
, update =	"97.11 bibrelex"
}

@inproceedings{bi-hiura-89
, author =	"C. L. Bajaj and I. Ihm"
, title =	"Hermite interpolation using real algebraic surfaces"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"94--103"
, cites =	"b-gmas-89, bhhl-tsi-87, d-pimcc-85, f-spm-86, hh-qbs-86, m-essle-73, ms-bsstv-85a, p-dlsfas-87, rr-crbsm-84, s-igubc-87, s-pasp-85, w-bqsqc-87, w-asmgc-86, w-bgm-87, ZZZ"
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{bp-sccpa-96
, author =	"Chandrajit L. Bajaj and Valerio Pascucci"
, title =	"Splitting a Complex of Convex Polytopes in any Dimension"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"88--97"
, cites =	"am-dhsrr-95, am-rsss-94, b-rgsdd-93, bd-cdpr-92, be-mgot-92i, c-oaitd-92, cd-icott-87, dk-fdpi-83, e-acg-87, em-sstcd-90, fm-nsala-91, g-cp-67, hk-prga-92, k-opcbf-95, l-ndgcm-94, lc-mchr3-87, lm-cschu-90, m-cgitr-93, m-rpm-93, m-rsehc-93, mhc-avcev-90, n-cgpt-93, nat-mbtyp-90, pbcf-dimsc-93, pfp-diccb-95, py-ebsph-90, s-lrapi-94, s-rcaic-94, t-cpos-92, tn-sopub-87, v-bimsp-91, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{bps-fiii-96
, author =	"C. L. Bajaj and V. Pascucci and D. R. Schikore"
, title =	"Fast isocontouring for improved interactivity"
, booktitle =	"Proc. 1996 IEEE Symposium on Volume Visualization"
, site =	"San Francisco, CA"
, month =	oct
, year =	1996
, pages =	"39--46"
, update =	"98.07 bibrelex"
}

@article{a-pfp-00
, author =	"C. L. Bajaj and A. V. Royappa"
, title =	"Parameterization in Finite Precision"
, journal =	"Algorithmica"
, volume =	27
, number =	1
, year =	2000
, pages =	"100--114"
, update =	"00.11 smid, 00.07 held"
}

@article{b-ap-88
, author =	"R. Bajcsy"
, title =	"Active perception"
, journal =	"Proc. IEEE"
, volume =	76
, number =	8
, year =	1988
, pages =	"996--1005"
, update =	"98.07 bibrelex"
}

@article{bck-ccmdo-85
, author =	"J. Bajon and M. Catto{\"e}n and S. D. Kim"
, title =	"A concavity characterization method for digital objects"
, journal =	"Signal Process."
, volume =	9
, year =	1985
, pages =	"151--161"
}

@inproceedings{b-spucp-85
, author =	"B. Baker"
, title =	"Shortest Paths With Unit Clearance Among Polygonal Obstacles"
, booktitle =	"SIAM Conference on Geometric Modeling and Robotics"
, site =	"Albany, NY"
, month =	jul
, year =	1985
, update =	"93.09 milone+mitchell"
}

@inproceedings{bfg-spmfh-85
, author =	"B. Baker and S. Fortune and E. Grosse"
, title =	"Stable prehension with a multi-fingered hand"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"St. Louis, Missouri"
, year =	1985
, update =	"98.11 bibrelex"
}

@inproceedings{b-aancp-83
, author =	"B. S. Baker"
, title =	"Approximation algorithms for {NP}-complete problems on planar graphs"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, update =	"97.11 bibrelex"
}

@article{b-aancp-94
, author =	"B. S. Baker"
, title =	"Approximation algorithms for {NP}-complete problems on planar graphs"
, journal =	"J. ACM"
, volume =	41
, year =	1994
, pages =	"153--180"
, update =	"97.07 agarwal"
}

@article{bbk-5atdp-81
, author =	"B. S. Baker and D. J. Brown and H. P. Katseff"
, title =	"A $5/4$ algorithm for two-dimensional packing"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"348--368"
}

@article{bcr-optd-80
, author =	"B. S. Baker and E. G. {Coffman, Jr.} and R. L. Rivest"
, title =	"Orthogonal packings in two dimensions"
, journal =	"SIAM J. Comput."
, volume =	9
, year =	1980
, pages =	"846--855"
}

@inproceedings{bfg-sptf-85
, author =	"B. S. Baker and S. J. Fortune and E. Grosse"
, title =	"Stable prehension with three fingers"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"114--120"
}

@inproceedings{bfm-ipc-84
, author =	"B. S. Baker and S. J. Fortune and S. R. Mahaney"
, title =	"Inspection by polygon containment"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1984
, pages =	"91--100"
, keywords =	"polygons, containment"
, update =	"95.05 korneenko"
}

@article{bfm-pct-86
, author =	"B. S. Baker and S. J. Fortune and S. R. Mahaney"
, title =	"Polygon containment under translation"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"532--548"
, keywords =	"motion planning, polygons"
}

@article{bgr-ntp-88
, author =	"B. S. Baker and E. Grosse and C. S. Rafferty"
, title =	"Nonobtuse triangulation of polygons"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"147--168"
}

@article{bs-satdp-83
, author =	"B. S. Baker and J. S. Schwarz"
, title =	"Shelf algorithms for two-dimensional packing problems"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"508--525"
}

@article{b-cialc-94
, author =	"Henry G. Baker"
, title =	"Corrigenda: {Intersection} algorithms for lines and circles"
, journal =	"ACM Trans. Graph."
, volume =	13
, number =	3
, year =	1994
, pages =	"308--310"
, keywords =	"intersection, lines, circles"
, comments =	"Correction to mst-ialc-89"
, update =	"95.09 korneenko"
}

@inproceedings{bb-deibs-81
, author =	"H. H. Baker and T. O. Binford"
, title =	"Depth from Edge and Intensity Bases Stereo"
, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
, site =	"Vancouver"
, year =	1981
, pages =	"631--636"
, update =	"97.11 bibrelex"
}

@article{bclt-nmaaw-95
, author =	"J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
, title =	"A New Model for Algorithm Animation Over the {WWW}"
, journal =	"ACM Comput. Surv."
, volume =	27
, number =	4
, year =	1995
, pages =	"568--572"
, url =	"http://www.cs.brown.edu/cgc/papers/bclt-nmaaw-95.ps.gz"
, keywords =	"algorithm animation, Java, Web, WWW, graph drawing, CGC, Brown"
, update =	"97.03 tamassia, 96.09 tamassia"
}

@inproceedings{bclt-aawww-96
, author =	"J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
, title =	"Algorithm Animation Over the {World Wide Web}"
, booktitle =	"Proc. Int. Workshop on Advanced Visual Interfaces"
, nickname =	"AVI '96"
, year =	1996
, pages =	"203--212"
, url =	"http://www.cs.brown.edu/cgc/papers/bclt-aawww-96.ps.gz"
, keywords =	"algorithm animation, Java, Web, WWW, CGC, Brown"
, update =	"97.03 tamassia, 96.09 tamassia"
}

@inproceedings{bclt-agaow-96
, author =	"James E. Baker and Isabel F. Cruz and Giuseppe Liotta and Roberto Tamassia"
, title =	"Animating Geometric Algorithms over the {Web}"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C3--C4"
, url =	"http://www.cs.brown.edu/cgc/papers/bclt-agaow-96.ps.gz"
, keywords =	"algorithm animation, Java, Web, WWW, CGC, Brown"
, cites =	"bclt-nmaaw-95, ZZZ"
, update =	"97.11 bibrelex, 97.03 tamassia, 96.09 tamassia, 96.05 efrat"
}

@inproceedings{bclt-maas-96
, author =	"J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
, title =	"The {Mocha} Algorithm Animation System"
, booktitle =	"Proc. Int. Workshop on Advanced Visual Interfaces"
, nickname =	"AVI '96"
, year =	1996
, pages =	"248--250"
, url =	"http://www.cs.brown.edu/cgc/papers/bclt-maas-96.ps.gz"
, keywords =	"algorithm animation, Java, Web, WWW, CGC, Brown"
, update =	"97.03 tamassia, 96.09 tamassia"
}

@article{bclt-vga-
, author =	"J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
, title =	"Visualizing Geometric Algorithms over the Web"
, journal =	"Comput. Geom. Theory Appl."
, note =	"to appear"
, update =	"98.11 tamassia"
}

@article{bfr-pod2-71
, author =	"K. A. Baker and P. Fishburn and F. S. Roberts"
, title =	"Partial orders of dimension 2"
, journal =	"Networks"
, volume =	2
, year =	1971
, pages =	"11--28"
, keywords =	"graph drawing, planar, upward"
, update =	"95.05 tamassia"
}

@inproceedings{b-tdmgt-87
, author =	"T. Baker"
, title =	"Three dimensional mesh generation by triangulation of arbitrary point sets"
, booktitle =	"Proc. AIAA 8th Comput. Fluid Dynamics Conf."
, year =	1987
, pages =	"255--271"
, keywords =	"triangulation, three-dimensional"
, update =	"95.05 korneenko"
}

@article{b-amgct-89
, author =	"Timothy J. Baker"
, title =	"Automatic Mesh Generation For Complex Three-Dimensional Regions Using a Constrained {Delaunay} Triangulation"
, journal =	"Engineering with Computers (USA)"
, volume =	5
, number =	"3--4"
, year =	1989
, pages =	"161--175"
, keywords =	"mesh generation, Delaunay triangulation"
, update =	"00.11 smid, 00.07 icking, 96.09 devillers"
, annote =	"Bowyer's algorithm. Constraints by fixing triangles.
		 Uses octrees for point location in $O(\log n)$. Yet
		 another proof that Bowyer's works. Uses $a/r$ for tetra
		 quality."
, abstract =	"This paper describes a method for generating
		 tetrahedral meshes. The algorithm, based on the
		 Delaunay triangulation, can treat objects of
		 essentially arbitrary complexity. In order to preserve
		 the surface triangulation of solid objects, it is
		 necessary to override the Delaunay property and
		 redefine the triangulation when points are introduced
		 that are close to solid boundaries. Details of this
		 constrained Delaunay algorithm are presented and an
		 efficient implementation of the triangulation method is
		 described. Techniques for controlling the distribution
		 of mesh points and tetrahedron quality are also
		 discussed. (Author abstract) 25 Refs."
}

@article{b-srvmc-91
, author =	"Timothy J. Baker"
, title =	"Shape Reconstruction And Volume Meshing For Complex Solids"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	32
, number =	4
, month =	sep
, year =	1991
, pages =	"665--675"
, keywords =	"shape reconstruction, volume meshing"
, annote =	"An interior point is generated for each section
		 vertex. This is placed on the line bisecting the corner
		 $ABC$, at a distance $\min(AB,BC,d/3)$, where $d$ is
		 the length of the segment from $B$ to where it first
		 leaves the polygon. Dt of these points is constructed
		 and the surface is the boundary between tetras
		 containing only section vertices and the other
		 tetras."
, abstract =	"The reconstruction of a solid surface from a series of
		 cross-sections and the generation of a volume mesh that
		 conforms with a prescribed surface are issues that
		 arise in numerous applications. We describe an approach
		 to both these problems that is based on the generation
		 of a tetrahedral mesh which automatically captures a
		 triangulation of the surface points. A simple algorithm
		 for introducing a set of interior points permits a
		 simple partition of the volume mesh into two disjoint
		 sets of tetrahedra such that one set determines the
		 interior of the solid while the second determines the
		 exterior. (Author abstract) 10 Refs."
}

@article{blt-lir-91
, author =	"E. Bakker and J. van Leeuwen and R. Tan"
, title =	"Linear interval routing"
, journal =	"Algorithms Rev."
, volume =	2
, number =	2
, year =	1991
, pages =	"45--61"
}

@inproceedings{b-oafsi-95
, author =	"Ivan J. Balaban"
, title =	"An Optimal Algorithm for Finding Segment Intersections"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"211--219"
, keywords =	""
, cites =	"b-lbact-83, bo-arcgi-79, c-fsnaq-86, c-rcsi-86, ce-oails-92, cs-arscg-89, egs-oplms-86, l-dsorq-78, m-fppa1-88, ps-cgi-85, w-pr-82, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{bf-mp-93
, author =	"E. Balas and M. Fischetti"
, title =	"On the Monotonization of Polyhedra"
, booktitle =	"Proc. 3rd IPCO Conference Integer Programming and Combinatorial Optimization"
, site =	"Erice, Italy"
, year =	1993
, pages =	"??"
, update =	"98.07 bibrelex, 93.09 milone+mitchell"
}

@article{bp-pmspb-83
, author =	"E. Balas and W. Pulleyblank"
, title =	"The perfectly matchable subgraph polytope of a bipartite graph"
, journal =	"Networks"
, volume =	13
, year =	1983
, pages =	"495--516"
}

@phdthesis{b-gmhsr-01
, author =	"Sophie Balaven"
, title =	"G\'en\'eration de maillages hybrides pour la simulation de r\'eservoirs p\'etroliers"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"Ecole des Mines, Paris"
, address =	"France"
, year =	2001
, keywords =	"doctoral thesis"
, update =	"02.03 devillers"
}

@incollection{bmb-pmmca-94
, author =	"L. Balbes and S. Mascarella and D. Boyd"
, title =	"A perspective of modern methods in computer-aided drug design"
, editor =	"K. Lipkowitz and D. B. Boyd"
, booktitle =	"Reviews in Computational Chemistry"
, volume =	5
, publisher =	"VCH Publishers"
, year =	1994
, pages =	"337--370"
, update =	"98.07 bibrelex"
}

@article{bs-rmcso-91
, author =	"R. Balbes and J. Siegel"
, title =	"A Robust Method for Calculating the Simplicity and Orientation of Planar Polygons"
, journal =	"Comput. Aided Geom. Design"
, volume =	8
, number =	4
, month =	oct
, year =	1991
, pages =	"327--335"
, keywords =	"polygons"
, update =	"95.05 held+korneenko"
}

@article{blt-capsi-92
, author =	"J. Balc{\'a}zar and A. Lozano and J. Tor{\'a}n"
, title =	"The complexity of algorithmic problems on succinct instances"
, journal =	"Algorithms Rev."
, volume =	2
, number =	3
, year =	1992
, pages =	"113--137"
}

@mastersthesis{b-amstg-90
, author =	"D. F. Baldwin"
, title =	"Algorithmic methods and software tools for the generation of mechanical assembly sequences"
, type =	"M.{Sc}. Thesis"
, school =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1990
, keywords =	"master thesis"
}

@article{b-afavc-61
, author =	"M. L. Balinsky"
, title =	"An algorithm for finding all vertices of convex polyhedral sets"
, journal =	"SIAM J. Appl. Math."
, volume =	9
, year =	1961
, pages =	"72--88"
}

@article{b-ghtda-81
, author =	"D. H. Ballard"
, title =	"Generalizing the {Hough} transform to detect arbitrary shapes"
, journal =	"Pattern Recogn."
, volume =	13
, year =	1981
, pages =	"111--112"
, update =	"96.09 orourke"
}

@article{b-sthrc-81
, author =	"D. H. Ballard"
, title =	"Strip trees: {A} hierarchical representation for curves"
, journal =	"Commun. ACM"
, volume =	24
, number =	5
, year =	1981
, pages =	"310--321"
, update =	"97.07 agarwal"
}

@book{bb-cv-82
, author =	"D. H. Ballard and C. M. Brown"
, title =	"Computer Vision"
, publisher =	"Prentice Hall"
, year =	1982
, update =	"98.07 bibrelex"
}

@techreport{b-mpbsp-93
, author =	"C. Ballieux"
, title =	"Motion planning using binary space partitions"
, number =	"Inf/src/93-25"
, institution =	"Utrecht University"
, year =	1993
, update =	"98.07 bibrelex, 97.03 schwarzkopf"
}

@inproceedings{bb-chipd-91
, author =	"A. Balog and I. B{\'a}r{\'a}ny"
, title =	"On the convex hull of the integer points in a disc"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"162--165"
, keywords =	"convex hull, grid"
, cites =	"a-lbvsc-63, a-sicp-80, bhl-ipplb-92, c-lpc-63, chkm-ipp-92, c-vdabt-22, f-eidg-82, h-eslp-90, j-ugukk-25, ks-envci-84, s-racs-88, s-ipcs-85, s-nlpcc-74, v-nips-63, w-gimk-57, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{bs-spbtc-88
, author =	"A. Baltsan and Micha Sharir"
, title =	"On the shortest paths between two convex polyhedra"
, journal =	"J. ACM"
, volume =	35
, year =	1988
, pages =	"267--287"
, keywords =	"shortest paths, polyhedra, convex, $3$-dimensional"
, succeeds =	"sb-spbtc-85"
, update =	"98.03 mitchell"
}

@inproceedings{b-pichc-99
, author =	"Helymar Balza-Gomez"
, title =	"The Periodicity of Integral Convex Hulls for Conics in {$E^2$}"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"47--49"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{b-cpcep-67
, author =	"T. F. Banchoff"
, title =	"Critical points and curvature for embedded polyhedra"
, journal =	"J. Diff. Geom."
, volume =	1
, year =	1967
, pages =	"245--256"
, update =	"98.07 bibrelex"
}

@article{bt-hftcp-75
, author =	"T. F. Banchoff and F. Takens"
, title =	"Height functions with three critical points"
, journal =	"Illinois J. Math."
, volume =	76
, year =	1975
, pages =	"326--335"
, update =	"98.07 bibrelex"
}

@article{b-gmsa-74
, author =	"F. Bancilhon"
, title =	"A geometric model for stochastic automata"
, journal =	"IEEE Trans. Comput."
, volume =	23
, number =	12
, year =	1974
, pages =	"1290--1299"
, update =	"93.09 milone+mitchell"
}

@article{bmr-pcnds-91
, author =	"Saibal Banerjee and David Mount and Azriel Rosenfeld"
, title =	"Pyramid Computation Of Neighbor Distance Statistics In Dot Patterns"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	53
, number =	4
, month =	jul
, year =	1991
, pages =	"373--381"
, keywords =	"Voronoi neighbors"
, abstract =	"This paper describes an algorithm for computing
		 statistics of Voronoi neighbor distances in a dot
		 pattern, using a cellular pyramid computer, in a
		 logarithmic number of computational steps. Given a set
		 of dots in a square region of the digital plane, the
		 algorithm determines with high probability the Voronoi
		 neighbors of the dots in the interior of the region and
		 then computes statistics of the neighbor distances. An
		 algorithm of this type may account for the ability of
		 humans to perceive at a glance whether the dots in a
		 pattern are randomly or regularly spaced, i.e., their
		 neighbor distances have high or low variance. (Author
		 abstract)"
}

@manual{b-pug-90
, author =	"R. E. Bank"
, title =	"{PLTMG} User's Guide"
, organization =	"SIAM"
, year =	1990
, update =	"97.11 bibrelex"
}

@article{br-qslg-89
, author =	"P. G. Bao and J. G. Rokne"
, title =	"Quadruple-step line generation"
, journal =	"Computers and Graphics"
, volume =	13
, year =	1989
, pages =	"461--469"
, keywords =	"digital geometry, computer graphics, design of algorithms, approximation, incrementation, lines, two-dimensional, average-case analysis"
}

@inproceedings{bbfy-olnr-92
, author =	"E. Bar-Eli and P. Berman and A. Fiat and P. Yan"
, title =	"On-line Navigation in a Room"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"237--249"
}

@article{bbfy-olnr-94
, author =	"E. Bar-Eli and P. Berman and A. Fiat and P. Yan"
, title =	"Online Navigation in a Room"
, journal =	"J. Algorithms"
, volume =	17
, year =	1994
, pages =	"319--341"
, update =	"95.01 smid"
}

@incollection{b-lotdp-90
, author =	"G. Bar"
, title =	"On the level-oriented two-dimensional packing with rotation of rectangles"
, editor =	"R. Bodendiek and R. Henn"
, booktitle =	"??"
, publisher =	"Physica-Verlag"
, address =	"Geidelberg"
, year =	1990
, pages =	"73--78"
, keywords =	"packing, isothetic"
, update =	"98.07 bibrelex, 95.05 korneenko"
}

@inproceedings{bi-rppt-93
, author =	"G. B{\"a}r and C. Iturriaga"
, title =	"Rectangle packing in polynomial time"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"455--460"
, cites =	"cgjt-pblot-80, o-efo-83, wkc-fpgl-88, h-prf-88, dcl-cfdfb-89, wkc-oarbb-89, vt-ftcr-90, gj-cigtn-79, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{bkp-hanc-93
, author =	"J. Bar-Ilan and G. Kortsarz and D. Peleg"
, title =	"How to allocate network centers"
, journal =	"J. Algorithms"
, volume =	15
, number =	3
, year =	1993
, pages =	"385--415"
, update =	"97.03 agarwal"
}

@article{bb-ltacs-96
, author =	"R. Bar-YeHuda and E. Ben-Hanoch"
, title =	"A linear time algorithm for covering simple polygons with similar rectangles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"79--102"
, update =	"96.09 devillers"
}

@inproceedings{bb-otacs-90
, author =	"R. Bar-YeHuda and E. Ben-Hanoch"
, title =	"An ${O}(n \log^{*}n)$ time algorithm for covering simple polygons with squares"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"186--190"
, keywords =	"polygons, covering"
, cites =	"a-acps-88, acko-cops-88, ao-crs-81, be-lrtaw-85, c-ept-90, g-amcmc-72, hs-oiuqt-79, m-fmcbi-91, nt-vpspa-75, rk-dpp-82, si-ttids-86, sl-qcia-87, wbr-cgpma-86, ZZZ"
, update =	"98.07 bibrelex, 96.09 devillers, 95.05 korneenko"
}

@article{bc-tdjc-94
, author =	"R. Bar-Yehuda and Bernard Chazelle"
, title =	"Triangulating disjoint {Jordan} chains"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, number =	4
, year =	1994
, pages =	"475--481"
, keywords =	"triangulation, polygons with holes, merging holes"
, succeeds =	"cb-tsnis-92"
, update =	"98.03 mitchell, 95.09 mitchell"
}

@inproceedings{bei-samcp-93
, author =	"R. Bar-Yehuda and A. Efrat and A. Itai"
, title =	"A simple algorithm for maintaining the center of a planar point-set"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"252--257"
, succeeds =	"e-samcp-93"
, cites =	"as-pglpm-91, bs-dsp1s-80, e-dtdlp-91, ks-tpscv-93, msw-sblp-92, m-ltalp-82, m-apcad-83, m-ss-84, ol-ddspy-81, ps-cgi-85, st-pplup-86, s-sacse-91, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{be-lrtaw-85
, author =	"R. Bar-Yehuda and S. Even"
, title =	"A local ratio theorem for approximating the weighted vertex cover problem"
, journal =	"Ann. Discrete Math."
, volume =	25
, year =	1985
, pages =	"27--46"
, update =	"98.07 bibrelex"
}

@inproceedings{be-avcpg-82
, author =	"R. Bar-Yehuda and S. Even"
, title =	"On Approximating a Vertex Cover for Planar Graphs"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
, month =	may
, year =	1982
, pages =	"303--309"
, update =	"98.07 bibrelex"
}

@techreport{bfk-esrrt-??
, author =	"R. Bar-Yehuda and J. A. Feldman and R. Kay"
, title =	"Efficient 2-{SAT} related routing technique"
, type =	"Report"
, number =	830
, institution =	"Dept. Comput. Sci., Technion ITT"
, address =	"Haifa, Israel"
, year =	"??"
, keywords =	"wire routing, link distance"
, comments =	"Given in Eilat Workshop, March 1995; submitted to Algorithmica"
, update =	"95.09 mitchell"
}

@unpublished{bf-bcnag-90
, author =	"R. Bar-Yehuda and S. Fogel"
, title =	"Better constructions and new applications of good splitters"
, year =	1990
, note =	"In preparation"
, update =	"98.07 bibrelex"
}

@inproceedings{bf-gsars-90
, author =	"R. Bar-Yehuda and S. Fogel"
, title =	"Good splitters with applications to ray shooting"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"81--84"
, keywords =	"ray tracing, arrangements"
, cites =	"a-dapal-89, a-rsoas-89, bf-bcnag-90, c-prsig-87, cg-vippg-89, cw-qorss-89, e-acg-87, eghsssw-irals-89, ew-hrsls-86, hw-ensrq-87, mw-gscpt-89, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{bf-mskis-89
, author =	"R. Bar-Yehuda and S. Fogel"
, title =	"Maximal Sets of $k$-Increasing Subsequences with Applications to Counting Points in Triangles"
, type =	"Technical {Report}"
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, year =	1989
, update =	"95.01 smid, 93.09 milone+mitchell"
}

@techreport{bf-psfms-90
, author =	"R. Bar-Yehuda and S. Fogel"
, title =	"Partitioning a sequence into few monotone subsequences"
, type =	"Technical {Report}"
, number =	640
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, year =	1990
, update =	"95.01 smid"
}

@techreport{bf-vrs-90
, author =	"R. Bar-Yehuda and S. Fogel"
, title =	"Variations on Ray Shooting"
, type =	"Technical {Report}"
, number =	639
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, year =	1990
, keywords =	"sheaf, ES-trees"
, update =	"95.01 smid, 93.09 milone+mitchell"
}

@article{bf-vrs-94
, author =	"R. Bar-Yehuda and S. Fogel"
, title =	"Variations on Ray Shooting"
, journal =	"Algorithmica"
, volume =	11
, year =	1994
, pages =	"133--145"
, succeeds =	"bf-vrs-90"
, update =	"95.01 smid, 94.05 matousek"
}

@techreport{bg-tstpm-95
, author =	"R. Bar-Yehuda and C. Gotsman"
, title =	"Time/{Space} tradeoffs for polygon mesh rendering"
, type =	"CIS Report"
, number =	9515
, institution =	"Dept. Comput. Sci., Technion ITT"
, address =	"Haifa, Israel"
, year =	1995
, keywords =	"Hamiltonian triangulation, planar separator theorem, mesh generation"
, precedes =	"bg-tstpm-96"
, update =	"96.05 mitchell"
}

@article{bg-tstpm-96
, author =	"R. Bar-Yehuda and C. Gotsman"
, title =	"Time/{Space} tradeoffs for polygon mesh rendering"
, journal =	"ACM Trans. Graph."
, volume =	15
, number =	2
, year =	1996
, pages =	"141--152"
, keywords =	"Hamiltonian triangulation, planar separator theorem, mesh generation"
, succeeds =	"bg-tstpm-95"
, update =	"96.05 mitchell"
}

@techreport{bg-otamh-90
, author =	"R. Bar-Yehuda and R. Grinwald"
, title =	"An {$O(n+h^{1+\epsilon})$}-time algorithm to merge $h$ simple polygons"
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, year =	1990
, update =	"95.01 smid, 94.09 jones, 93.09 milone+mitchell"
}

@inproceedings{bg-tph-90
, author =	"R. Bar-Yehuda and R. Grinwald"
, title =	"Triangulating polygons with holes"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"112--115"
, cites =	"c-ept-90, ci-tsc-84, ctv-flvat-88i, fm-tspep-84, gjpt-tsp-78, k-osps-83, tv-otats-88, ZZZ"
, update =	"98.07 bibrelex"
}

@article{b-j-79
, author =	"J. Baracs"
, title =	"Juxtapositions"
, journal =	"Structural Topology"
, volume =	1
, year =	1979
, pages =	"59--72"
, update =	"97.11 bibrelex"
}

@article{b-amdsn-89
, author =	"D. Baraff"
, title =	"Analytical methods for dynamic simulation of non-penetrating rigid bodies"
, journal =	"Comput. Graph"
, volume =	23
, number =	3
, year =	1989
, pages =	"223--232"
, note =	"Proc. SIGGRAPH '89"
, update =	"98.03 bibrelex"
}

@article{b-cscnp-90
, author =	"D. Baraff"
, title =	"Curved surfaces and coherence for non-penetrating rigid body simulation"
, journal =	"Comput. Graph."
, volume =	24
, number =	4
, year =	1990
, pages =	"19--28"
, update =	"98.07 bibrelex"
}

@article{b-issrb-95
, author =	"D. Baraff"
, title =	"Interactive Simulation of Solid Rigid Bodies"
, journal =	"CGA"
, volume =	15
, number =	3
, month =	may
, year =	1995
, pages =	"63--75"
, update =	"96.05 mitchell"
}

@article{bmk-mffac-97
, author =	"D. Baraff and R. Matikalli and P. Khosla"
, title =	"Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"4--39"
, update =	"97.07 held"
}

@article{br-lbceo-87
, author =	"R. Barakat and J. Reif"
, title =	"Lower bounds on the computational efficiency of optical computing systems"
, journal =	"Appl. Optics"
, volume =	26
, number =	6
, year =	1987
, pages =	"1015--1018"
, update =	"97.11 bibrelex"
}

@article{br-pcamm-87
, author =	"R. Barakat and J. Reif"
, title =	"Polynomial convolution algorithm for matrix multiplication with application for optical computing"
, journal =	"Appl. Optics"
, volume =	26
, number =	14
, year =	1987
, pages =	"2707--2711"
, update =	"97.11 bibrelex"
}

@article{bv-nclp-92
, author =	"I. B{\'a}r{\'a}nav and A. M. Vershik"
, title =	"On the number of convex lattice polytopes"
, journal =	"Geometric and Functional Analysis"
, volume =	2
, year =	1992
, pages =	"381--393"
, update =	"97.11 bibrelex"
}

@article{b-gct-82
, author =	"I. B{\'a}r{\'a}ny"
, title =	"A generalization of {Carath{\'e}odory}'s theorem"
, journal =	"Discrete Math."
, volume =	40
, year =	1982
, pages =	"141--152"
, update =	"97.11 bibrelex"
}

@incollection{b-gcabt-93
, author =	"I. B{\'a}r{\'a}ny"
, title =	"Geometric and Combinatorial Applications of {Borsuk's} Theorem"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"235--249"
, keywords =	"survey paper, discrete geometry, Borsuk's theorem, covering, ham-sandwich cuts"
, update =	"93.09 erickson"
}

@inproceedings{bf-cvid-86
, author =	"I. B{\'a}r{\'a}ny and Z. F{\"u}redi"
, title =	"Computing the volume is difficult"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"442--447"
, precedes =	"bf-cvid-87"
}

@article{bf-cvid-87
, author =	"I. B{\'a}r{\'a}ny and Z. F{\"u}redi"
, title =	"Computing the volume is difficult"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"319--326"
, keywords =	"approximation, volume, convex"
, succeeds =	"bf-cvid-86"
}

@techreport{bf-eses-86
, author =	"I. Barany and Z. Furedi"
, title =	"Empty simplices in {Euclidean} space"
, type =	"Technical {Report}"
, number =	689
, institution =	"Cornell Univ."
, address =	"Ithaca, New York"
, month =	mar
, year =	1986
, update =	"93.09 milone+mitchell"
}

@article{bf-eses-87
, author =	"I. B{\'a}r{\'a}ny and Z. Furedi"
, title =	"Empty simplices in {Euclidean} space"
, journal =	"Canad. Math. Bull."
, volume =	30
, year =	1987
, pages =	"436--445"
, succeeds =	"bf-eses-86"
, update =	"02.03 devillers"
}

@inproceedings{bfl-nhp-89
, author =	"I. B{\'a}r{\'a}ny and Z. F{\"u}redi and L. Lov{\'a}sz"
, title =	"On the number of halving planes"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"140--144"
, cites =	"b-gct-82, bf-eses-86, bf-ntccn-84, e-acg-87, e-epggg-64, elss-dgpps-73, es-sgh-83, fr-hdnj-84, km-etdpp-88, r-ert-68, t-grt-66, ZZZ"
, update =	"98.03 bibrelex"
}

@article{bfl-nhp-90
, author =	"I. B{\'a}r{\'a}ny and Z. F{\"u}redi and L. Lov{\'a}sz"
, title =	"On the number of halving planes"
, journal =	"Combinatorica"
, volume =	10
, year =	1990
, pages =	"175--183"
, succeeds =	"bfl-nhp-89"
, update =	"95.05 agarwal"
}

@article{bhl-ipplb-92
, author =	"I. B{\'a}r{\'a}ny and R. Howe and L. Lov{\'a}sz"
, title =	"On integer points in polyhedra: A lower bound"
, journal =	"Combinatorica"
, volume =	12
, year =	1992
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{bl-cppe-90
, author =	"I. B{\'a}r{\'a}ny and D. G. Larman"
, title =	"A combinatorial property of points and ellipsoids"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"375--382"
}

@article{bl-ceb-87
, author =	"I. B{\'a}r{\'a}ny and J. Lehel"
, title =	"Covering with {Euclidean} boxes"
, journal =	"European J. Combin."
, volume =	8
, year =	1987
, pages =	"113--119"
, keywords =	"points, covering, isothetic"
, update =	"96.09 devillers, 95.05 korneenko"
}

@article{bssu-crapb-89
, author =	"I. B{\'a}r{\'a}ny and J. H. Schmerl and S. J. Sidney and J. Urrutia"
, title =	"A combinatorial results abouts points and balls in {Euclidean} space"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"259--262"
}

@inproceedings{bs-enks-90
, author =	"I. B{\'a}r{\'a}ny and W. Steiger"
, title =	"On the expected number of $k$-sets"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"55--59"
, cites =	"ag-nssfs-86, acegsw-ptphp-90, bfl-nhp-89, cp-hrsaa-86, c-narsc-87, cs-arscg-89, csy-khrp-87, e-acg-87, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-nhl-71, pss-ubnpk-92, w-mksfs-86, ZZZ"
, update =	"98.07 bibrelex"
}

@article{bs-enks-94
, author =	"I. B{\'a}r{\'a}ny and W. Steiger"
, title =	"On the expected number of $k$-sets"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"243--263"
, update =	"98.07 agarwal+bibrelex"
}

@article{bv-pfest-98
, author =	"I. B{\'a}r{\'a}ny and P. Valtr"
, title =	"A positive fraction {Erd{\H{o}}s-Szekeres} theorem"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"335--342"
, update =	"02.03 devillers"
}

@article{bh-eshmp-95
, author =	"M. Barbehenn and S. Hutchinson"
, title =	"Efficient Search and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Paths Trees"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	11
, number =	2
, month =	apr
, year =	1995
, pages =	"198--214"
, update =	"96.01 held"
}

@inproceedings{bh-rapp-93
, author =	"B. Barber and M. Hirsch"
, title =	"A robust algorithm for point in polyhedron"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"479--484"
, cites =	"bh-ppida-92, cw-pi-90, gss-egbra-89, h-srsia-89, hhk-tirgc-88, ht-tdscp-89, k-cplp-66, lmr-eppa-84, m-maia-79, m-eat-84, t-smcua-80, f-pcg-93, k-dscpg-82, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@phdthesis{b-cgida-93
, author =	"C. B. Barber"
, title =	"Computational geometry with imprecise data and arithmetic"
, school =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@techreport{bdh-qach-93
, author =	"C. B. Barber and D. P. Dobkin and H. Huhdanpaa"
, title =	"The {Quickhull} algorithm for convex hull"
, type =	"Technical Report"
, number =	"GCG53"
, institution =	"Geometry Center, Univ. of Minnesota"
, month =	jul
, year =	1993
, comments =	"code available from \url{ftp://geom.umn.edu/pub/qhull.tar.Z};
view results in $3$-d or $4$-d with
\url{ftp://geom.umn.edu/pub/geomview/geomview-sgi.tar.Z}
or \url{ftp://geom.umn.edu/pub/geomview/geomview-next.tar.Z}"
, precedes =	"bdh-qach-96"
, update =	"98.03 icking, 94.01 jones, 93.09 jones"
, abstract =	"The convex hull of a set of points is the smallest convex
set that contains the points.  This paper presents a convex hull algorithm
that combines the $2$-d Quickhull algorithm with the general dimension
Beneath-beyond algorithm.  It is similar to the randomized, incremental
algorithms for convex hull and Delaunay triangulation.  Our algorithm is
simpler, uses less memory, and allows good use of virtual memory.  A
simple modification produces an approximate convex hull.  We provide
empirical evidence that the algorithm runs faster and is output
sensitive."
}

@article{bdh-qach-96
, author =	"C. Bradford Barber and David P. Dobkin and Hannu Huhdanpaa"
, title =	"The {Quickhull} Algorithm for Convex Hulls"
, journal =	"ACM Trans. Math. Softw."
, volume =	22
, number =	4
, month =	dec
, year =	1996
, pages =	"469--483"
, succeeds =	"bdh-qach-93"
, update =	"01.04 icking, 98.03 icking"
}

@techreport{bh-ppida-92
, author =	"C. B. Barber and M. D. Hirsch"
, title =	"Point in polyhedron with imprecise data and arithmetic"
, type =	"Technical Report"
, number =	"GCG46"
, institution =	"The Geometry Center"
, year =	1992
, update =	"98.11 bibrelex"
}

@article{bjp-laics-92
, author =	"L. Bardis and R. A. Jinkerson and N. M. Patrikalakis"
, title =	"Localization for Automated Inspection of Curved Surfaces"
, journal =	"International Journal of Offshore and Polar Engineering"
, volume =	1
, number =	3
, year =	1992
, pages =	"228--234"
, update =	"95.05 abrams"
}

@article{bp-acrbp-89
, author =	"L. Bardis and N. M. Patrikalakis"
, title =	"Approximate Conversion of Rational {B}-Spline Patches"
, journal =	"Comput. Aided Geom. Design"
, volume =	6
, number =	3
, year =	1989
, pages =	"189--204"
, update =	"95.05 abrams"
}

@inproceedings{bp-brbs-89
, author =	"L. Bardis and N. M. Patrikalakis"
, title =	"Blending Rational {B}-Spline Surfaces"
, booktitle =	"Proc. Eurographics '89"
, year =	1989
, pages =	"453--462"
, update =	"95.05 abrams"
}

@article{bp-sarb90
, author =	"L. Bardis and N. M. Patrikalakis"
, title =	"Surface Approximation with Rational {B}-Splines"
, journal =	"Engineering with Computers"
, volume =	6
, number =	4
, year =	1990
, pages =	"223--235"
, update =	"95.05 abrams"
}

@article{b-csmpi-72
, author =	"E. H. Bareiss"
, title =	"Computational solution of matrix problems over an integral domain"
, journal =	"J. Inst. Maths Applics"
, volume =	10
, year =	1972
, pages =	"68--104"
, update =	"98.03 bibrelex"
}

@techreport{b-dapd-97
, author =	"G. Barequet"
, title =	"{DCEL}: {A} Polyhedral Database"
, type =	"Research {Report}, under submission to {\it IJCGA}"
, institution =	"Center for Geometric Computing"
, address =	"Johns Hopkins Univ."
, year =	1997
, precedes =	"b-dpdpe-98"
, update =	"98.11 devillers, 97.03 tamassia"
}

@article{b-dpdpe-98
, author =	"G. Barequet"
, title =	"{DCEL}: A Polyhedral Database and Programming Environment"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"619--636"
, succeeds =	"b-dapd-97"
, update =	"98.11 devillers"
}

@article{b-ughrc-97
, author =	"G. Barequet"
, title =	"Using Geometric Hashing to Repair CAD Objects"
, journal =	"IEEE Comput. Sci. \& Eng."
, volume =	4
, number =	4
, month =	oct
, year =	1997
, pages =	"22--28"
, update =	"98.07 held"
}

@inproceedings{bbdgt-ccgg-97
, author =	"Gill Barequet and Stina S. Bridgeman and Christian A. Duncan and Michael T. Goodrich and Roberto Tamassia"
, title =	"Classical Computational Geometry in {GeomNet}"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"412--414"
, keywords =	"internet computing, format conversion, client-server, CGC, Brown"
, cites =	"abdpy-enmcs-95, bclt-nmaaw-95, bclt-aawww-96, bclt-agaow-96, bclt-maas-96, bkmnsu-egcl-95, em-sstcd-90, fgkss-ckbgc-96, f-nsa2d-95, fm-nsala-91, gy-frcg-86, gm-rad-95, gss-egbra-89, hd-mgvia-00, hhk-tirgc-88, lpt-rpqiv-96, mn-lpcgc-95, m-dpggt-89, almp-gsgv-95, o-dcgal-96, y-gctsp-90, ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex, 97.07 efrat, 97.03 tamassia"
}

@article{bbdgt-ggcoi-99
, author =	"Gill Barequet and Stina S. Bridgeman and Christian A. Duncan and Michael T. Goodrich and Roberto Tamassia"
, title =	"{GeomNet:} Geometric Computing Over the Internet"
, journal =	"IEEE Internet Computing"
, volume =	3
, number =	2
, year =	1999
, pages =	"21--29"
, keywords =	"internet computing, format conversion, client-server, CGC, Brown"
, update =	"01.11 smid, 98.11 tamassia"
}

@inproceedings{bbddg-aopdf-97
, author =	"G. Barequet and A. Briggs and M. Dickerson and C. Dima and M. Goodrich"
, title =	"Animating the Offset Polygon Distance Function"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"479--480"
, keywords =	"video review"
, cites =	"aaag-ntsp-95, aa-ssgpf-96, bbdg-opapp-, bdg-vdpod-, kn-lts-76, obs-stcav-92, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{bbdg-opapp-
, author =	"G. Barequet and A. Briggs and M. Dickerson and M. Goodrich"
, title =	"Offset polygon annulus placement problems"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, update =	"98.07 bibrelex"
}

@article{bcgmt-bhrs3-96
, author =	"G. Barequet and B. Chazelle and L. Guibas and J. Mitchell and A. Tal"
, title =	"{BOXTREE}: {A} Hierarchical Representation for Surfaces in {3D}"
, journal =	"Comput. Graph. Forum"
, volume =	15
, number =	3
, month =	sep
, year =	1996
, pages =	"C387--C396, C484"
, note =	"Proc.\ Eurographics'96"
, keywords =	"Boxtree, Collision detection, Computational geometry, Data structures, Hierarchical systems, Octrees, Piecewise linear techniques, Ray shooting, Ray tracing, Surfaces, Three dimensional computer graphics"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{bde-ttdp-96
, author =	"Gill Barequet and Matthew Dickerson and David Eppstein"
, title =	"On Triangulating Three-Dimensional Polygons"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"38--47"
, cites =	"a-kb-94, be-mgot-92i, bs-fgbp-95, bs-plibp-96, c-tsplt-91a, e-t-91, eg-tsa-89, f-pc6ck-89, go-copcg-95, k-mtpd-80, rs-dttdn-92, s-tkwsd-90, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{bde-ttdp-98
, author =	"G. Barequet and M. Dickerson and D. Eppstein"
, title =	"On Triangulating Three-dimensional Polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, number =	3
, year =	1998
, pages =	"155--170"
, update =	"98.07 held"
}

@techreport{bdg-vdpod-
, author =	"G. Barequet and M. Dickerson and M. Goodrich"
, title =	"Voronoi diagrams for polygon-offset distance functions"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, update =	"98.07 bibrelex"
}

@inproceedings{bdp-tcpcm-95
, author =	"Gill Barequet and Matthew Dickerson and Petru Pau"
, title =	"Translating a Convex Polygon to Contain a Maximum Number of Points"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"61--66"
, precedes =	"bdp-tcpcm-97"
, update =	"98.03 mitchell, 95.09 jones"
}

@article{bdp-tcpcm-97
, author =	"Gill Barequet and Matthew Dickerson and Petru Pau"
, title =	"Translating a convex polygon to contain a maximum number of points"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, number =	4
, year =	1997
, pages =	"167--179"
, succeeds =	"bdp-tcpcm-95"
, update =	"98.03 mitchell"
}

@article{bdk-rgtcr-98
, author =	"G. Barequet and C. A. Duncan and S. Kumar"
, title =	"RSVP: A Geometric Toolkit for Controlled Repair of Solid Models"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	4
, number =	2
, month =	apr
, year =	1998
, pages =	"162--177"
, update =	"98.11 held"
}

@inproceedings{be-asrv-00b
, author =	"Gill Barequet and Gershon Elber"
, title =	"{$\alpha$}-Sectors of Rational Varieties"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"35--39"
, update =	"00.03 bibrelex"
}

@article{bh-pctmh-01
, author =	"G. Barequet and S. Har-Peled"
, title =	"Polygon containment and translational min-{Hausdorff}-distance between segment sets are {3SUM}-hard"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"465--474"
, update =	"01.11 smid"
}

@inproceedings{bk-dfelm-97
, author =	"G. Barequet and Y. Kaplan"
, title =	"A data front end for layered manufacturing"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"231--239"
, cites =	"-sis-89, b-dapd-97, bs-fgbp-95, bs-plibp-96, bw-acmrs-92, dm-otps-91, fd-ficg-82, g-cm-80, k-mtpd-80, ksl-pcdcv-97, md-sepct-93, mf-iicsf-96, sw-hdsac1-88, sh-ttsps-92, st-tsms-91, t-dsna-83, -rurcp-88, w-sve-96, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{bk-dfelm-98
, author =	"G. Barequet and Y. Kaplan"
, title =	"A Data Front-End for Layered Manufacturing"
, journal =	"Comput. Aided Design"
, volume =	30
, number =	4
, month =	apr
, year =	1998
, pages =	"231--243"
, update =	"98.07 held"
}

@inproceedings{bk-rcm-97
, author =	"G. Barequet and S. Kumar"
, title =	"Repairing {CAD} Models"
, booktitle =	"Proc. IEEE Visualization"
, site =	"Phoenix, AZ"
, year =	1997
, pages =	"363--370"
, update =	"98.03 mitchell"
}

@techreport{bs-fgbp-93
, author =	"G. Barequet and M. Sharir"
, title =	"Filling gaps in the boundary of a polyhedron"
, type =	"Technical {Report}"
, number =	"277/93"
, institution =	"Dept. Comput. Sci., Tel Aviv Univ."
, address =	"Tel Aviv, Israel"
, year =	1993
, update =	"98.03 bibrelex"
}

@article{bs-fgbp-95
, author =	"G. Barequet and Micha Sharir"
, title =	"Filling Gaps in the Boundary of a Polyhedron"
, journal =	"Comput. Aided Geom. Design"
, volume =	12
, year =	1995
, pages =	"207--229"
, update =	"98.03 mitchell, 97.11 bibrelex+held"
}

@inproceedings{bs-psvmt-94
, author =	"G. Barequet and Micha Sharir"
, title =	"Partial surface and volume matching in three dimensions"
, booktitle =	"Proc. 12th Annu. IAPR/IEEE Internat. Conf. Pattern Recogn."
, site =	"Jerusalem, Israel"
, volume =	2
, year =	1994
, pages =	"610--614"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{bs-psmud-96
, author =	"Gill Barequet and Micha Sharir"
, title =	"Partial Surface Matching by Using Directed Footprints"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C9--C10"
, cites =	"bj-tdor-85, bs-psvmt-94, cd-mbrrv-86, ksss-tdmbb-86, ss-ipoot-87, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{bs-plibp-94
, author =	"G. Barequet and Micha Sharir"
, title =	"Piecewise-Linear Interpolation between Polygonal Slices"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"93--102"
, cites =	"bs-fgbp-93, bpccd-tdcrs-81, b-srpcs-88, bg-tdrcs-92, cs-cccld-78, cllct-tatdr-88, cclbwfodbt-avebp-80, epo-taasm-91, fku-osrpc-77, gd-ngtmp-82, g-tdmho-93, gos-rpps-93, gs-pmgsc-85, hmn-fsv-93, hw-imbmm-88, ksss-tdmbb-86, kf-fsr3d-88, ksf-sstsr-88, k-acstc-75, khw-3dcmu-91, k-mtpd-80, mss-sccbp-91, s-r3doc-89, ss-ipoot-87, s-sdbcd-81, sh-srsd-81, sp-cstir-87, sp-pgmbo-88, wa-srr3d-86, ww-srbsp-93, w-cm-90, zjh-scpc-87, ZZZ"
, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
}

@article{bs-plibp-96
, author =	"G. Barequet and Micha Sharir"
, title =	"Piecewise-linear interpolation between polygonal slices"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	63
, year =	1996
, note =	"in press."
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{bw-ocbtp-96
, author =	"G. Barequet and B. Wolfers"
, title =	"Optimizing a corridor between two polygons with an application to polyhedral interpolation"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"32--37"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{bml-ggpj-97
, author =	"Naser S. Barghouti and John Mocenigo and Wenke Lee"
, title =	"{\em Grappa}: A {GRAPh} {PAckage} in {Java}"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"336--343"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{bbr-ecit-85
, author =	"M. Barnabei and A. Brini and G.-C. Rota"
, title =	"On the exterior calculus of invariant theory"
, journal =	"J. Algebra"
, volume =	96
, number =	1
, year =	1985
, pages =	"120--160"
, update =	"98.03 bibrelex"
}

@article{bs-dnapv-66
, author =	"O. Barndorff-Nielsen and M. Sobel"
, title =	"On the distribution of the number of admissible points in a vector sample"
, journal =	"Theory Probab. Appl."
, volume =	"XI"
, number =	2
, year =	1966
, pages =	"249--269"
}

@book{bf-a2-83
, author =	"M. Barner and F. Flohr"
, title =	"Analysis II"
, publisher =	"Walter de Gruyter"
, address =	"Berlin"
, year =	1983
, update =	"00.03 bibrelex"
}

@article{bh-hofca-86
, author =	"J. Barnes and P. Hut"
, title =	"A hierarchical {$O(n \log n)$} force-calculation algorithm"
, journal =	"Nature"
, volume =	324
, number =	4
, month =	dec
, year =	1986
, pages =	"446--449"
, update =	"98.03 bibrelex"
}

@article{b-gc2ce-87
, author =	"D. W. Barnette"
, title =	"Generating closed $2$-cell embeddings in the torus and the projective plane"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"233--247"
}

@article{b-pspcp-86
, author =	"D. W. Barnette"
, title =	"Preassigning the shape of projections of convex polytopes"
, journal =	"J. Combin. Theory Ser. A"
, volume =	42
, year =	1986
, pages =	"293--295"
, keywords =	"three-dimensional, polytope, projection"
, update =	"95.05 korneenko"
}

@article{b-wpt-90
, author =	"D. W. Barnette"
, title =	"{$W_V$} paths on the torus"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"603--608"
}

@incollection{b-casrd-83
, author =	"R. Barnhill"
, title =	"Computer aided surface representation and design"
, editor =	"R. Barnhill and W. Boehm"
, booktitle =	"Surfaces in Computer-Aided Geometric Design"
, publisher =	"North-Holland"
, year =	1983
, pages =	"1--24"
, update =	"97.11 bibrelex"
}

@article{b-srds-83
, author =	"R. E. Barnhill"
, title =	"A Survey of the Representation and Design of Surfaces"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, month =	oct
, year =	1983
, pages =	"9--16"
, annote =	"Suggests triangulation for basis of interpolation,
		 using Little's minmax, rather than Delaunay
		 Triangulation."
}

@incollection{b-ras-77
, author =	"R. E. Barnhill"
, title =	"Representation and approximation of surfaces"
, editor =	"J. R. Rice"
, booktitle =	"Math. Software III"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1977
, pages =	"69--120"
}

@article{bbl-ntc-78
, author =	"R. E. Barnhill and J. H. Brown and I. M. Lucewicz"
, title =	"A new twist in CAGD"
, journal =	"Comput. Graph. Image Process."
, volume =	8
, year =	1978
, pages =	"78--79"
, update =	"98.03 bibrelex"
}

@article{bfjp-ssi-87
, author =	"R. E. Barnhill and G. Farin and M. Jordan and B. R. Piper"
, title =	"Surface/surface intersection"
, journal =	"Comput. Aided Geom. Design"
, volume =	4
, year =	1987
, pages =	"3--16"
, update =	"97.11 bibrelex"
}

@article{bl-atc-84
, author =	"R. E. Barnhill and F. F. Little"
, title =	"Adaptive triangular cubatures"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"53--75"
}

@article{bl-tfds-84
, author =	"R. E. Barnhill and F. F. Little"
, title =	"Three- and four-dimensional surfaces"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, year =	1984
, pages =	"77--102"
}

@article{bo-sds-90
, author =	"R. E. Barnhill and H. S. Ou"
, title =	"Surfaces Defined on Surfaces"
, journal =	"Comput. Aided Geom. Design"
, volume =	7
, year =	1990
, pages =	"323--336"
, annote =	"Defines triangulation of a convex surface to be the
		 same as the convex hull. Hull algorithm is gift
		 wrapping."
}

@book{br-cagd-74
, author =	"R. E. Barnhill and R. F. Riesenfeld"
, title =	"Computer aided geometric design"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1974
, update =	"98.03 bibrelex"
}

@article{bgss-icfcm-96
, author =	"D. Barnum and J. Greene and A. Smellie and P. Sprague"
, title =	"Identification of common functional components among molecules"
, journal =	"J.  Chem. Inf. Comput. Sci."
, volume =	"??"
, year =	1996
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@inproceedings{bjz-adrc-99
, author =	"Ala Eddine Barouni and Ali Jaoua and Nejib Zaguia"
, title =	"An Algorithm for Drawing a Ring Cover"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"157--159"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{bgs-apcme-80
, author =	"R. C. Barr and T. M. Gallie and M. S. Spach"
, title =	"Automated Production of Contour Maps for Electrophysiology"
, journal =	"Computers in Biomedical Research"
, volume =	13
, year =	1980
, pages =	"142--191"
, annote =	"Constructs triangulation. Uses McLains circle
		 criterion for $O(n^2)$ DT."
}

@article{bkllmr-rsfpp-??
, author =	"J. Barraquand and L. E. Kavraki and J.-C. Latombe and T.-Y. Li and R. Motwani and P. Raghavan"
, title =	"A Random Sampling Framework for Path Planning in Large-Dimensional Configuration Spaces"
, journal =	"Internat. J. Robot. Res."
, volume =	"??"
, year =	"??"
, pages =	"to appear"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@inproceedings{bl-mcapp-90
, author =	"J. Barraquand and J.-C. Latombe"
, title =	"A Monte-Carlo Algorithm for Path Planning with Many Degrees of Freedom"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, month =	may
, year =	1990
, pages =	"1712--1717"
, location =	"Cincinnati, Ohio"
, update =	"02.03 orourke"
}

@article{bl-nmrom-89
, author =	"J. Barraquand and J.-C. Latombe"
, title =	"Nonholonomic mobile robots and optimal maneuvering"
, journal =	"Revue d'Intelligence artificielle"
, volume =	3
, year =	1989
, pages =	"77--103"
, update =	"97.11 bibrelex"
}

@article{bl-nmbmr-93
, author =	"J. Barraquand and J.-C. Latombe"
, title =	"Nonholonomic multi-body mobile robots: controllability and motion planning in the presence of obstacles"
, journal =	"Algorithmica"
, volume =	10
, year =	1993
, pages =	"121--155"
, update =	"97.11 bibrelex"
}

@article{bl-rmpdr-91
, author =	"J. Barraquand and J.-C. Latombe"
, title =	"Robot Motion Planning: A Distributed Representation Approach"
, journal =	"Internat. J. Robot. Res."
, volume =	10
, year =	1991
, pages =	"628--649"
, update =	"97.03 schwarzkopf"
}

@inproceedings{b-cmsmp-96
, author =	"Antonio Hern{\'a}ndez Barrera"
, title =	"Computing the {Minkowski} Sum of Monotone Polygons"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"113--116"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{bv-hmrr-84
, author =	"R. Barrera and A. M. Vazques"
, title =	"A Hierarchical Method for Representing Relief"
, booktitle =	"Proc. Pecora IX Symposium in Spatial Information Technologies for Remote Sensing Today and Tomorrow"
, site =	"Sioux Falls, South Dakota"
, month =	oct
, year =	1984
, pages =	"87--92"
, update =	"98.11 bibrelex"
}

@inproceedings{bgmrz-tsees-93
, author =	"T. Barrera and J. Griffith and S. A. McKee and G. Robins and T. Zhang"
, title =	"Toward a {Steiner} engine: {Enhanced} serial and parallel implementations of the iterated $1$-{Steiner} algorithm"
, booktitle =	"Proc. Great Lakes Sympos. VLSI"
, site =	"Kalamazoo, MI"
, month =	mar
, year =	1993
, pages =	"90--94"
, update =	"98.03 bibrelex"
}

@inproceedings{bgrz-ngnos-93
, author =	"T. Barrera and J. Griffith and G. Robins and T. Zhang"
, title =	"Narrowing the gap: {Near}-optimal {Steiner} trees in polynomial time"
, booktitle =	"Proc. IEEE Internat. ASIC Conf."
, site =	"Rochester, NY"
, month =	sep
, year =	1993
, pages =	"87--90"
, update =	"98.03 bibrelex"
}

@incollection{bg-kiufd-94
, author =	"Phillip Barry and Ron Goldman"
, title =	"Knot Insertion Using Forward Differences"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"251--255"
, keywords =	"curve subdivision"
, update =	"94.09 heckbert"
, annote =	"Describes a fast technique for subdivision of B-spline
curves and surfaces. Subdivision is a fundamental operation in modeling and
rendering. Contains pseudocode."
}

@article{bd-gcpct-89
, author =	"B. A. Barsky and A. D. DeRose"
, title =	"Geometric Continuity of Parametric Curves: Three Equivalent Characterizations"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	9
, number =	6
, month =	nov
, year =	1989
, pages =	"60--68"
, update =	"93.09 held"
}

@inproceedings{b-aamtm-98
, author =	"Yair Bartal"
, title =	"On Approximating Arbitrary Metrics by Tree Metrics"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, year =	1998
, pages =	"to appear"
, update =	"98.03 mitchell"
}

@inproceedings{b-pamsi-96
, author =	"Y. Bartal"
, title =	"Probabilistic approximation of metric spaces and its algorithmic applications"
, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1996
, pages =	"184--193"
, update =	"00.11 smid, 00.07 agarwal"
}

@book{bbb-isucg-87
, author =	"R. H. Bartels and J. C. Beatty and B. A. Barsky"
, title =	"An introduction to splines for use in computer graphics and geometric modeling"
, publisher =	"Morgan Kaufman"
, address =	"Los Altos, CA"
, year =	1987
, update =	"97.11 bibrelex"
}

@inproceedings{b-nacvh-91
, author =	"Timothy J. Barth"
, title =	"Numerical aspects of computing viscous high reynolds number flows on unstructured meshes"
, booktitle =	"AIAA 29th Aerospace Sciences Meeting"
, month =	jan
, year =	1991
, update =	"98.07 bibrelex"
}

@inproceedings{bh-ctbvg-99
, author =	"Wilhelm Barth and Ernst Huber"
, title =	"Computations with Tight Bounding Volumes for General Parametric Surfaces"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"123--127"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{bp-fhbsc-83
, author =	"J. J. {Bartholdi, III} and L. K. Platzman"
, title =	"A fast heuristic based on spacefilling curves for minimum-weight matching in the plane"
, journal =	"Inform. Process. Lett."
, volume =	17
, year =	1983
, pages =	"177--180"
}

@article{bp-optsh-82
, author =	"J. J. {Bartholdi, III} and L. K. Platzman"
, title =	"An {$O(n \log n)$} planar travelling salesman heuristic based on spacefilling curves"
, journal =	"Oper. Res. Lett."
, volume =	1
, number =	4
, year =	1982
, pages =	"121--125"
, keywords =	"travelling salesman problem, heuristic, routing, spacefilling curve, geometric graphs, optimization"
, update =	"95.05 korneenko"
}

@techreport{bp-hbscc-84
, author =	"J. J. {Bartholdi, III} and L. K. Platzman"
, title =	"Heuristics based on spacefilling curves for combinatorial problems in the plane"
, type =	"Report"
, number =	"PDRC 84-08"
, institution =	"School Indust. Syst. Engrg., Georgia Inst. Tech."
, address =	"Atlanta, GA"
, year =	1984
, keywords =	"heuristics"
}

@article{bpcw-mtrsm-83
, author =	"J. J. {Bartholdi, III} and L. K. Platzman and R. L. Collins and W. H. {Warden, III}"
, title =	"A minimal technology routing system for meals on wheels"
, journal =	"Interfaces"
, volume =	13
, number =	3
, year =	1983
, pages =	"1--8"
}

@techreport{bh-psafc-91
, author =	"F. Bartling and K. Hinrichs"
, title =	"A plane-sweep algorithm for finding a closest pair among convex planar objects"
, type =	"Report"
, number =	"91-03"
, institution =	"Dept. Comput. Sci., Univ. Siegen"
, address =	"Siegen, Germany"
, year =	1991
, precedes =	"bh-psafc-92"
}

@inproceedings{bh-psafc-92
, author =	"F. Bartling and K. Hinrichs"
, title =	"A plane-sweep algorithm for finding a closest pair among convex planar objects"
, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	577
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"221--232"
, succeeds =	"bh-psafc-91"
}

@inproceedings{bh-psafc-92c
, author =	"Frank Bartling and Klaus Hinrichs"
, title =	"A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	91
, update =	"00.03 bibrelex"
}

@techreport{bh-paask-90
, author =	"F. Bartling and K. Hinrichs"
, title =	"Probabilistic analysis of an algorithm for solving the $k$-dimensional all-nearest-neighbors problem by projection"
, type =	"Report"
, number =	"90-02"
, institution =	"Dept. Comput. Sci., Univ. Siegen"
, address =	"Siegen, West Germany"
, year =	1990
}

@article{bh-paask-91
, author =	"F. Bartling and K. Hinrichs"
, title =	"Probabilistic analysis of an algorithm for solving the $k$-dimensional all-nearest-neighbors problem by projection"
, journal =	"BIT"
, volume =	31
, year =	1991
, pages =	"558--565"
, update =	"97.11 smid"
}

@article{bp-hbscc-88
, author =	"J. J. Bartoldi and L. K. Platzman"
, title =	"Heuristics based on spacefilling curves for combinatorial problems in {Euclidean} space"
, journal =	"Manage. Sci."
, volume =	34
, number =	3
, year =	1988
, pages =	"291--305"
, keywords =	"optimization"
, update =	"95.05 korneenko"
}

@article{bb-pp-80
, author =	"E. E. Barton and I. Buchanan"
, title =	"The polygon package"
, journal =	"Comput. Aided Design"
, volume =	12
, year =	1980
, pages =	"3--11"
}

@inproceedings{bmn-reisl-97
, author =	"U. Bartuschka and K. Mehlhorn and S. N{\"a}her"
, title =	"A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem"
, booktitle =	"Proc. Workshop on Algorithm Engineering"
, nickname =	"WAE '97"
, site =	"Venice"
, month =	sep
, year =	1997
, pages =	"124--135"
, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap13.ps.gz"
, update =	"00.11 smid, 00.07 icking, 98.11 smid, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell"
}

@article{bmh-oaocl-99
, author =	"D. Bartz and M. Mei{\ss}ner and T. H{\"u}ttner"
, title =	"OpenGL-assisted Occlusion Culling for Large Polygonal Models"
, journal =	"Comput. \& Graphics"
, volume =	23
, number =	5
, month =	oct
, year =	1999
, pages =	"667--679"
, update =	"00.03 held"
}

@article{bgv-srmpd-97
, author =	"Rakesh D. Barve and Edward F. Grove and Jeffrey Scott Vitter"
, title =	"Simple Randomized Mergesort on Parallel Disks"
, journal =	"Parallel Comput."
, volume =	23
, number =	4
, year =	1997
, note =	"Special issue on parallel I/O.  An earlier version
		  appears in Proc. of the 8th Annual
		 ACM Symposium on Parallel Algorithms and
		 Architectures (SPAA~'96), Padua, Italy, June 1996, 109--118"
, update =	"97.03 murali"
}

@inproceedings{bjww-ptamp-98
, author =	"Alexander Barvinok and David S. Johnson and Gerhard J. Woeginger and Russell Woodroofe"
, title =	"Polynomial Time Algorithms for Maximization Problems in Spaces with Polyhedral Norms"
, booktitle =	"Sixth Conference on Integer Programming and Combinatorial Optimization"
, nickname =	"IPCO Houston '98"
, site =	"Rice University, Houston, TX"
, month =	jun
, year =	1998
, pages =	"to appear"
, update =	"98.03 mitchell"
}

@inproceedings{b-ptaci-93
, author =	"Alexander I. Barvinok"
, title =	"A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the dimension is fixed"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"566--572"
, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@article{b-cei-91
, author =	"Alexander I. Barvinok"
, title =	"Computation of exponential integrals"
, journal =	"Zap. Nauchn. Sem. LOMI"
, volume =	192
, number =	5
, year =	1991
, pages =	"149--163"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{b-cvcip-92
, author =	"Alexander I. Barvinok"
, title =	"Computing the volume, counting integral points and exponential sums"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"161--170"
, cites =	"b-cei-91, b-pedlp-88, gls-gaco-88, kb-ptacs-79, l-pvc-91, p-smfsp-80, s-ec-86, v-ctdah-87, vg-hfch-87, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{b-ighdp-95
, author =	"Alexander I. Barvinok"
, title =	"Integral geometry of higher-dimensional polytopes and the average case in combinatorial optimization"
, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '95"
, year =	1995
, pages =	"To appear"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 95.09 mitchell"
}

@incollection{b-lplp-97
, author =	"Alexander I. Barvinok"
, title =	"Lattice points and lattice polytopes"
, chapter =	7
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"133--152"
, update =	"98.03 mitchell, 97.11 orourke"
}

@article{b-tarts-96
, author =	"Alexander I. Barvinok"
, title =	"Two Algorithmic Results for the {TSP}"
, journal =	"Math. Oper. Res."
, volume =	21
, year =	1996
, pages =	"65--84"
, keywords =	"MAX TSP, longest cycle, PTAS, approximation scheme"
, update =	"98.03 mitchell"
}

@article{bb-msbdc-88
, author =	"R. Barzel and A. H. Barr"
, title =	"A modeling system based on dynamics constraints"
, journal =	"Comput. Graph."
, volume =	22
, number =	4
, year =	1988
, pages =	"179--187"
, note =	"Proc. SIGGRAPH '88"
, update =	"98.03 bibrelex"
}

@inproceedings{bdiz-pacfm-97
, author =	"J. Basch and H. Devarajan and P. Indyk and L. Zhang"
, title =	"Probabilistic Analysis for Combinatorial Functions of Moving Points"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"442--444"
, cites =	"a-sdcgp-85, bcl-fleta-90, bgh-dsmd-97, bgsz-pekds-97, cd-vdbcd-85, d-mirvc-83, d-kgaca-90, d-hdvdl-91, e-chrsp-65, gmr-vdmpp-92, kgs-fcdmm-97, kti-mmstl-95, ow-dsp-84, r-slcdn-70, rs-udkhv-63, s-chdch-86, ZZZ"
, update =	"99.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
}

@inproceedings{bgh-dsmd-97
, author =	"J. Basch and Leonidas J. Guibas and J. Hershberger"
, title =	"Data Structures for Mobile Data"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"747--756"
, update =	"98.03 mitchell, 97.07 agarwal, 97.03 held"
}

@inproceedings{bgr-sllsh-97
, author =	"J. Basch and L. J. Guibas and G. Ramkumar"
, title =	"Sweeping Lines and Line Segments with a Heap"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"469--472"
, cites =	"bgh-dsmd-97, bgr-rrbit-96, bo-arcgi-79, elss-dgpps-73, ew-nlsfs-85, g-bpstp-79, h-fuenl-89, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@inproceedings{bgr-rrbit-96
, author =	"J. Basch and Leonidas J. Guibas and G. D. Ramkumar"
, title =	"Reporting red-blue intersections between two sets of connected line segments"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"302--319"
, update =	"98.03 mitchell, 97.03 smid"
}

@unpublished{bgrr-pttc-
, author =	"J. Basch and Leonidas J. Guibas and G. D. Ramkumar and L. Ramshaw"
, title =	"Polyhedral tracings and their convolution"
, note =	"Submitted"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{bgsz-pekds-97
, author =	"J. Basch and L. J. Guibas and C. Silverstein and L. Zhang"
, title =	"A practical evaluation of kinetic data structures"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"388--390"
, cites =	"bdiz-pacfm-97, bgh-dsmd-97, gmr-vdmpp-92, ZZZ"
, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@inproceedings{bgz-ppmp-97
, author =	"J. Basch and L. J. Guibas and L. Zhang"
, title =	"Proximity Problems on Moving Points"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"344--351"
, cites =	"ams-fnmst-92, as-rst-89, bdiz-pacfm-97, bgh-dsmd-97, bs-dsp1s-80, ggst-eamst-86, kgs-fcdmm-97, kkt-rltaf-95, kti-mmstl-95, m-mdscg-84, m-cgitr-93, o-ddds-83, s-mmdpsp-92a, st-dsdt-83, v-famst-84, wl-arrcd-85, y-cmstk-82, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@incollection{bd-cp-94
, author =	"Gerard Bashein and Paul R. Detmer"
, title =	"Centroid of a Polygon"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"3--6"
, keywords =	"polygon area, polygon centroid"
, update =	"94.09 heckbert"
, annote =	"Gives formulas and code to find the centroid (center of
mass) of a polygon. This is useful when simulating Newtonian dynamics.
Contains C code."
}

@article{bs-fdmrc-67
, author =	"L. J. Bass and S. R. Schubert"
, title =	"On finding the disc of minimum radius containing a given set of points"
, journal =	"Math. Comput."
, volume =	12
, year =	1967
, pages =	"712--714"
}

@techreport{bh-fpsae-93
, author =	"H. Bast and T. Hagerup"
, title =	"Fast parallel space allocation, estimation and integer sorting"
, type =	"Report"
, number =	"MPI-I-93-123"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, update =	"97.11 bibrelex, 93.09 smid"
}

@article{bsss-or3dc-86
, author =	"C. M. Bastuscheck and E. Schonberg and J. T. Schwartz and Micha Sharir"
, title =	"Object recognition by $3$-dimensional curve matching"
, journal =	"Internat. J. Intell. Syst."
, volume =	1
, year =	1986
, pages =	"105--132"
, keywords =	"computer vision, curves, matchings, three-dimensional"
, update =	"98.03 mitchell"
}

@inproceedings{b-sgtfp-88
, author =	"M. Bastuscheck"
, title =	"On the stability of grasping: three fingers and a planar polygon"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Robot. Autom."
, year =	1988
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{b-bbnce-96
, author =	"Saugata Basu"
, title =	"On Bounding the {Betti} Numbers and Computing the {Euler} Characteristic of Semi-Algebraic Sets"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '96"
, site =	"Philadelphia, PA"
, month =	may
, year =	1996
, pages =	"408--417"
, update =	"00.03 smid, 98.07 bibrelex, 98.03 mitchell"
}

@unpublished{b-ctcsc-98
, author =	"S. Basu"
, title =	"On the combinatorial and topological complexity of a single cell"
, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1998
, pages =	"606--616"
, update =	"98.11 aronov, 98.07 agarwal"
}

@unpublished{bpr-ccsad-98
, author =	"S. Basu and R. Pollack and M.-F. Roy"
, title =	"Complexity of computing semi-algebraic descriptions of the connected components of a semi-algebraic set"
, year =	1998
, note =	"unpublished manuscript"
, update =	"98.07 agarwal"
}

% , month =	may
@inproceedings{bpr-crsas-96
, author =	"Saugata Basu and Richard Pollack and Marie-Fran{\c{c}}oise Roy"
, title =	"Computing Roadmaps of Semi-Algebraic Sets"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '96"
, site =	"Philadelphia, PA"
, year =	1996
, pages =	"168--173"
, update =	"98.07 bibrelex, 98.03 agarwal+mitchell"
}

@article{bpr-ocspm-97
, author =	"S. Basu and R. Pollack and M.-F. Roy"
, title =	"On Computing a Set of Points meeting every Semi-algebraically Connected Component of a Family of Polynomials on a Variety"
, journal =	"J. Complexity"
, volume =	13
, year =	1997
, pages =	"28--37"
, update =	"98.03 agarwal"
}

@article{bpr-oncdf-94
, author =	"S. Basu and R. Pollack and M.-F. Roy"
, title =	"On the number of cells defined by a family of polynomials on a variety"
, journal =	"Mathematika"
, volume =	43
, year =	1994
, pages =	"120--126"
, update =	"98.03 agarwal"
}

@incollection{bpr-ncdfp-95
, author =	"S. Basu and R. Pollack and M.-F. Roy"
, title =	"On the number of cells defined by a family of polynomials on a variety"
, editor =	"K. Y. Goldberg and D. Halperin and J.-C. Latombe and R. H. Wilson"
, booktitle =	"Algorithmic Foundations of Robotics"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1995
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@article{b-hsdbu-80
, author =	"B. G. Batchelor"
, title =	"Hierarchial shape description based upon convex hulls of concavities"
, journal =	"J. Cybern."
, volume =	10
, year =	1980
, pages =	"205--210"
}

@inproceedings{b-sduct-78
, author =	"B. G. Batchelor"
, title =	"Shape description using concavity trees"
, editor =	"M. H. Hamza and S. G. Tzafestas"
, booktitle =	"Proc. Internat. Sympos. Measurement \& Control"
, nickname =	"MECO '78"
, publisher =	"Panhellenic Society of Mechanical \& Electrical Engineers"
, address =	"Athens"
, year =	1978
, pages =	"385--390"
}

@article{b-sdlct-80
, author =	"B. G. Batchelor"
, title =	"Shape descriptors for labeling concavity trees"
, journal =	"J. Cybern."
, volume =	10
, year =	1980
, pages =	"233--237"
}

@article{b-tmfch-80
, author =	"B. G. Batchelor"
, title =	"Two methods for finding convex hulls of planar figures"
, journal =	"Cybernet. Systems"
, volume =	11
, year =	1980
, pages =	"105--113"
}

@article{b-uctsd-79
, author =	"B. G. Batchelor"
, title =	"Using concavity trees for shape description"
, journal =	"IEEE J. Comput. Digital Techniques"
, volume =	2
, year =	1979
, pages =	"157--168"
}

@inproceedings{b-snta-68
, author =	"K. E. Batcher"
, title =	"Sorting Networks and Their Applications"
, booktitle =	"Proc. 1968 Spring Joint Computer Conf."
, publisher =	"AFIPS Press"
, address =	"Reston, VA"
, year =	1968
, pages =	"307--314"
, update =	"96.09 orourke"
}

@inproceedings{bhrz-pgrtc-97
, author =	"C. Douglass Bateman and C. S. Helvig and Gabriel Robins and Alexander Zelikovsky"
, title =	"Provably Good Routing Tree Construction with Multi-Port Terminals"
, booktitle =	"Proc. ACM/SIGDA International Symposium on Physical Design"
, site =	"Napa Valley, CA"
, month =	apr
, year =	1997
, pages =	"??"
, keywords =	"one-of-a-set TSP, group TSP, approximation algorithms"
, update =	"98.03 mitchell"
}

@article{b-nccp-49
, author =	"P. T. Bateman"
, title =	"Note on the coefficients of the cyclotomic polynomial"
, journal =	"Bull. Amer. Math. Soc."
, volume =	55
, year =	1949
, pages =	"1180--1181"
, update =	"97.11 bibrelex"
}

@inproceedings{bbdnnrt-alfia-86
, author =	"C. Batini and P. Brunetti and G. {Di Battista} and P. Naggar and E. Nardelli and G. Richelli and R. Tamassia"
, title =	"An Automatic Layout Facility and its Applications"
, booktitle =	"Proc. Internat. Workshop on Software Engineering Environment"
, publisher =	"China Academic Publishers"
, address =	"Beijing, China"
, year =	1986
, pages =	"139--157"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{bcn-cdder-92
, author =	"C. Batini and S. Ceri and S. B. Navathe"
, title =	"Conceptual Database Design, an Entity-Relationship Approach"
, publisher =	"Benjamin Cummings"
, year =	1992
, update =	"95.01 tamassia"
}

@book{bf-mpbds-86
, author =	"C. Batini and E. Fortunato"
, title =	"Metodi per la Progettazione di Basi di Dati Statistici"
, publisher =	"ISTAT"
, year =	1986
, update =	"95.01 tamassia"
}

@inproceedings{bfn-wigdp-85
, author =	"C. Batini and L. Furlani and E. Nardelli"
, title =	"What is a Good Diagram? {A} Pragmatic Approach"
, booktitle =	"Proc. 4th Internat. Conf. on the Entity-Relationship Approach"
, year =	1985
, pages =	"312--319"
, keywords =	"graph drawing"
, update =	"98.07 vismara, 93.09 tamassia"
}

@inproceedings{bntt-gtaal-84
, author =	"C. Batini and E. Nardelli and M. Talamo and R. Tamassia"
, title =	"A Graph Theoretic Approach to Aesthetic Layout of Information Systems Diagrams"
, booktitle =	"Proc. 10th Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (Berlin June 1984)"
, publisher =	"Trauner Verlag"
, address =	"Linz, Austria"
, year =	1984
, pages =	"9--18"
, keywords =	"graph drawing"
, update =	"94.05 smid, 93.09 tamassia"
}

@incollection{bntt-ggtcd-85
, author =	"C. Batini and E. Nardelli and M. Talamo and R. Tamassia"
, title =	"{GINCOD}: a Graphical Tool for Conceptual Design of Data Base Applications"
, editor =	"A. Albano and V. De Antonellis and A. Di Leva"
, booktitle =	"Computer Aided Data Base Design"
, publisher =	"North-Holland"
, address =	"New York, NY"
, year =	1985
, pages =	"33--51"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{bnt-ladfd-86
, author =	"C. Batini and E. Nardelli and R. Tamassia"
, title =	"A Layout Algorithm for Data Flow Diagrams"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-12"
, number =	4
, year =	1986
, pages =	"538--546"
, keywords =	"graph drawing"
, update =	"98.07 vismara, 93.09 tamassia"
}

@article{btt-caler-84
, author =	"C. Batini and M. Talamo and R. Tamassia"
, title =	"Computer Aided Layout of Entity-Relationship Diagrams"
, journal =	"Journal of Systems and Software"
, volume =	4
, year =	1984
, pages =	"163--173"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{bpccd-tdcrs-81
, author =	"S. Batnitzky and H. I. Price and P. N. Cook and L. T. Cook and S. J. {Dwyer, III}"
, title =	"Three-dimensional computer reconstruction from surface contours for head {CT} examinations"
, journal =	"J. Comput. Assisted Tomography"
, volume =	5
, year =	1981
, pages =	"60--67"
, update =	"98.03 bibrelex"
}

@article{bgp-lfmma-89
, author =	"R. Batta and A. Ghose and U. S. Palekar"
, title =	"Locating facilities on the {Manhattan} metrics with arbitrary shaped barriers and convex forbidden regions"
, journal =	"Transp. Sci."
, volume =	23
, number =	1
, year =	1989
, pages =	"26--36"
, keywords =	"facility location, $L_1$-metrics"
, update =	"95.05 korneenko"
}

@article{bl-adpsp-88
, author =	"R. Batta and L. A. Leifer"
, title =	"On the accuracy of demand point solutions to the planar {Manhattan} metric p-median problem with and without barriers to travel"
, journal =	"Comput. Oper. Res."
, volume =	15
, number =	3
, year =	1988
, pages =	"253--262"
, keywords =	"facility location, $L_1$-metrics"
, update =	"95.05 korneenko"
}

@article{b-solq-85
, author =	"M. A. Bauer"
, title =	"Set operations on linear quadtrees"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	29
, year =	1985
, pages =	"248--258"
}

@inproceedings{bkkmnsu-osca-95
, author =	"F. Bauern{\"o}ppel and E. Kranankis and D. Krizanc and A. Maheshwari and M. Noy and J.-R. Sack and J. Urrutia"
, title =	"Optimal shooting: characterizations and applications"
, booktitle =	"Proc. 22nd ICALP"
, site =	"Szeged, Hungary"
, series =	"Lecture Notes Comput. Sci."
, volume =	944
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"220--231"
, update =	"99.11 bibrelex, 97.11 sack"
}

@article{bkkmsu-psgca-97
, author =	"F. Bauern{\"o}ppel and E. Kranankis and D. Krizanc and A. Maheshwari and J.-R. Sack and J. Urrutia"
, title =	"Planar stage graphs: characterization and applications"
, journal =	"Theoret. Comput. Sci."
, volume =	175
, month =	apr
, year =	1997
, update =	"97.11 sack"
}

@article{bmsw-mruap-91
, author =	"D. R. Baum and S. Mann and K. P. Smith and J. M. Winget"
, title =	"Making Radiosity Usable: {Automatic} Preprocessing and Meshing Techniques for the Generation of Accurate Radiosity Solutions"
, journal =	"Comput. Graph."
, volume =	25
, number =	4
, year =	1991
, pages =	"51--60"
, note =	"Proc. SIGGRAPH '91"
, keywords =	"triangulation, computer graphics"
, update =	"95.05 korneenko"
}

@article{b-luhs-90
, author =	"E. B. Baum"
, title =	"On learning a union of half spaces"
, journal =	"J. Complexity"
, volume =	6
, number =	1
, year =	1990
, pages =	"67--101"
, keywords =	"$d$-dimensional, halfspaces"
, update =	"95.05 korneenko"
}

@article{b-cmp-88
, author =	"E. B. Baum"
, title =	"On the capabilities of multilayer perceptrons"
, journal =	"J. Complexity"
, volume =	4
, year =	1988
, pages =	"19--25"
, update =	"98.07 bibrelex"
}

@article{bh-wsngv-89
, author =	"E. B. Baum and D. Haussler"
, title =	"What size net gives valid generalization?"
, journal =	"Neural Computation"
, volume =	1
, year =	1989
, pages =	"151--160"
, update =	"98.07 bibrelex"
}

@inproceedings{b-prcv-75
, author =	"B. G. Baumgart"
, title =	"A polyhedron representation for computer vision"
, booktitle =	"Proc. AFIPS Natl. Comput. Conf."
, volume =	44
, publisher =	"AFIPS Press, Alrington, Va."
, year =	1975
, pages =	"589--596"
, update =	"98.07 bibrelex"
}

@techreport{b-gmcv-74
, author =	"B. G. Baumgart"
, title =	"Geometric Modeling for Computer Vision"
, number =	"STAN-CS-74463"
, institution =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, month =	oct
, year =	1974
, update =	"97.11 bibrelex"
}

@techreport{bjm-dplgs-92t
, author =	"H. Baumgarten and H. Jung and K. Mehlhorn"
, title =	"Dynamic point location in general subdivisions"
, number =	"MPI-I-92-126"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
, update =	"93.05 schwarzkopf"
}

@inproceedings{bjm-dplgs-92
, author =	"Hanna Baumgarten and Hermann Jung and Kurt Mehlhorn"
, title =	"Dynamic Point Location in General Subdivisions"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"81--83"
, update =	"00.03 bibrelex"
}

@inproceedings{bjm-dplgs-92i
, author =	"H. Baumgarten and H. Jung and K. Mehlhorn"
, title =	"Dynamic point location in general subdivisions"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"250--258"
, update =	"93.05 schwarzkopf"
}

@article{bjm-dplgs-94
, author =	"H. Baumgarten and H. Jung and K. Mehlhorn"
, title =	"Dynamic point location in general subdivisions"
, journal =	"J. Algorithms"
, volume =	17
, year =	1994
, pages =	"342--380"
, update =	"95.01 smid"
}

@inproceedings{bdm-tepa1-95
, author =	"A. B{\"a}umker and W. Dittrich and F. {Meyer auf der Heide}"
, title =	"Truly efficient parallel algorithms: $1$-optimal multisearch for an extension of the {BSP} model"
, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
, nickname =	"ESA"
, year =	1995
, pages =	"17--30"
, update =	"96.09 orourke"
}

@inproceedings{bdp-dcpm-96
, author =	"A. B{\"a}umker and W. Dittrich and A. Pietracaprina"
, title =	"The deterministic complexity of parallel multisearch"
, booktitle =	"Proc. 1996 Scadanavian Workshop on Algorithmic Theory"
, year =	1996
, pages =	"to appear"
, update =	"96.09 orourke"
}

@inproceedings{by-kmafr-90
, author =	"J. J. Bausch and K. Youcef-Toumi"
, title =	"Kinematic methods for automated fixture reconfiguration planning"
, booktitle =	"Proc. 7th IEEE Internat. Conf. Robot. Autom."
, month =	may
, year =	1990
, update =	"98.03 bibrelex"
}

@incollection{bl-cacp-93
, author =	"M. Bayer and C. Lee"
, title =	"Combinatorial aspects of convex polytopes"
, chapter =	"2.3"
, editor =	"P. Gruber and J. Wills"
, booktitle =	"Handbook of Convex Geometry"
, publisher =	"North-Holland"
, address =	"New York, NY"
, year =	1993
, pages =	"485--534"
, update =	"98.03 bibrelex"
}

@article{bk-nip-91
, author =	"M. M. Bayer and A. Klapper"
, title =	"An new index for polytopes"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"33--47"
}

@article{b-sbbtd-72
, author =	"R. Bayer"
, title =	"Symmetric binary B-trees: data structure and maintenace algorithms"
, journal =	"Acta Inform."
, volume =	1
, year =	1972
, pages =	"290--306"
, update =	"97.11 bibrelex"
}

@article{bm-oloi-72
, author =	"R. Bayer and {McCreight}"
, title =	"Organization of large ordered indexes"
, journal =	"Acta Inform."
, volume =	1
, year =	1972
, pages =	"173--189"
, keywords =	"data structuring"
, update =	"95.05 korneenko"
}

@incollection{btrv-svtbu-98
, author =	"J. Bazik and R. Tamassia and S. P. Reiss and A. van Dam"
, title =	"Software Visualization in Teaching at {Brown University}"
, editor =	"J. Stasko and J. Domingue and M. H. Brown and B. A. Price"
, booktitle =	"Software Visualization: Programming as a Multimedia Experience"
, publisher =	"MIT Press"
, year =	1998
, pages =	"383--398"
, keywords =	"software visualization, algorithm animation"
, update =	"98.07 tamassia, 97.03 tamassia"
}

@inproceedings{bh-obdpc-87
, author =	"P. Beame and J. Hastad"
, title =	"Optimal bounds for decision problems on the {CRCW} {PRAM}"
, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
, year =	1987
, pages =	"83--93"
, update =	"98.03 bibrelex"
}

@article{bh-obdpc-89
, author =	"P. Beame and J. Hastad"
, title =	"Optimal Bounds for Decision Problems on the {CRCW} {PRAM}"
, journal =	"J. ACM"
, volume =	36
, number =	3
, year =	1989
, pages =	"643--670"
, update =	"96.09 orourke"
}

@book{b-gdg-83
, author =	"A. F. Beardon"
, title =	"The Geometry of Discrete Groups"
, series =	"Graduate Texts in Mathematics"
, publisher =	"Springer-Verlag"
, year =	1983
}

@article{bhh-sptmp-59
, author =	"J. Beardwood and J. H. Halton and J. M. Hammersley"
, title =	"The shortest path through many points"
, journal =	"Math. Proc. Camb. Phil. Soc."
, volume =	55
, year =	1959
, pages =	"299--327"
, update =	"97.11 bibrelex"
}

@article{b-aspg-84
, author =	"J. E. Beasley"
, title =	"An algorithm for the {Steiner} problem in graphs"
, journal =	"Networks"
, volume =	14
, year =	1984
, pages =	"147--159"
}

@article{bn-toptp-91
, author =	"D. Beauquier and M. Nivat"
, title =	"On translating one polyomino to tile the plane"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"575--592"
, succeeds =	"gn-tpot-90"
}

@article{bnrr-tfptb-94
, author =	"D. Beauquier and M. Nivat and E. Remila and M. Robson"
, title =	"Tiling figures of the plane with two bars"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"1--25"
, update =	"96.09 devillers"
}

@inproceedings{bbdl-tealf-91
, author =	"M. Beccaria and P. Bertolazzi and G. {Di Battista} and G. Liotta"
, title =	"A Tailorable and Extensible Automatic Layout Facility"
, booktitle =	"Proc. IEEE Workshop on Visual Languages"
, nickname =	"VL '91"
, year =	1991
, pages =	"68--73"
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 93.09 tamassia"
}

@article{b-gisne-90
, author =	"A. Beck"
, title =	"Greed is (sometimes) not enough"
, journal =	"Amer. Math. Monthly"
, volume =	97
, number =	4
, year =	1990
, pages =	"289--294"
, keywords =	"optimization, covering"
, update =	"95.05 korneenko"
}

@article{b-srnpt-83
, author =	"J. Beck"
, title =	"On size {Ramsey} number of paths, trees, and circuits, {I}."
, journal =	"J. Graph Theory"
, volume =	7
, year =	1983
, pages =	"115--129"
, update =	"97.11 bibrelex"
}

@article{b-lppsp-83
, author =	"J. Beck"
, title =	"On the lattice property of the plane and some problems of {Dirac,} {Motzkin} and {Erd\H os} in combinatorial geometry"
, journal =	"Combinatorica"
, volume =	3
, number =	"3--4"
, year =	1983
, pages =	"281--297"
, keywords =	"discrete geometry, points, arrangements"
, update =	"95.05 korneenko"
}

@article{b-redis-81
, author =	"J. Beck"
, title =	"Roth's estimate on the discrepancy of integer sequences is nearly sharp"
, journal =	"Combinatorica"
, volume =	1
, number =	4
, year =	1981
, pages =	"319--325"
, update =	"94.05 matousek"
}

@book{bc-id-87
, author =	"J. Beck and W. Chen"
, title =	"Irregularities of distribution"
, publisher =	"Cambridge University Press"
, year =	1987
, update =	"93.09 matousek"
}

@article{bfh-sam-86
, author =	"J. Beck and R. Farouki and J. Hinds"
, title =	"Surface Analysis Methods"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, year =	1986
, pages =	"18--36"
, update =	"98.03 bibrelex"
}

@misc{bs-dt-
, author =	"J. Beck and V. {S\'os}"
, title =	"Discrepancy theory"
, note =	"Chapter for {\em Handbook of Combinatorics}, to be
published by North-Holland"
, update =	"94.05 matousek"
}

@techreport{bfglow-asotm-92
, author =	"B. Becker and P. G. Franciosa and S. Gschwind and S. Leonardi and T. Ohler and P. Widmayer"
, title =	"Approximating a set of objects by two minimum area rectangles"
, type =	"Technical {Report}"
, number =	"21.92"
, institution =	"Dept. Inform. Sistem., Univ. Roma La Sapienza"
, address =	"Rome, Italy"
, year =	1992
, update =	"97.03 smid, 95.05 franciosa, 94.09 franciosa, 93.05 smid"
}

@article{bfglow-esotm-96
, author =	"B. Becker and P. G. Franciosa and S. Gschwind and S. Leonardi and T. Ohler and P. Widmayer"
, title =	"Enclosing a set of objects by two minimum area rectangles"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"520--541"
, update =	"97.03 smid"
}

@techreport{bfgotw-oaasr-91t
, author =	"B. Becker and P. G. Franciosa and S. Gschwind and T. Ohler and G. Thiemt and P. Widmayer"
, title =	"An optimal algorithm for approximating a set of rectangles by two minimum area rectangles"
, type =	"Technical {Report}"
, number =	35
, institution =	"Inst. Inform., Univ. Freiburg"
, address =	"Freiburg, Germany"
, year =	1991
, update =	"93.05 smid"
}

@inproceedings{bfgotw-oaasr-91i
, author =	"Bruno Becker and Paolo Giulio Franciosa and Stephan Gschwind and Thomas Ohler and Gerald Thiemt and Peter Widmayer"
, title =	"An optimal algorithm for approximating a set of rectangles by two minimum area rectangles"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"13--25"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{bfgotw-embop-92
, author =	"B. Becker and P. G. Franciosa and S. Gschwind and T. Ohler and G. Thiemt and P. Widmayer"
, title =	"Enclosing many boxes by an optimal pair of boxes"
, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	577
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"475--486"
}

@techreport{bh-olpg-83
, author =	"B. Becker and G. Hotz"
, title =	"On the optimal layout of planar graphs"
, type =	"Report"
, number =	"SFB 124 B1"
, institution =	"Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1983
}

@article{bh-olpgf-87
, author =	"B. Becker and G. Hotz"
, title =	"On The Optimal Layout of Planar Graphs with Fixed Boundary"
, journal =	"SIAM J. Comput."
, volume =	16
, number =	5
, year =	1987
, pages =	"946--972"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{bo-lwbl-87
, author =	"B. Becker and H. G. Osthof"
, title =	"Layout with Wires of Balanced Length"
, journal =	"Inform. Comput."
, volume =	73
, year =	1987
, pages =	"45--58"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{bo-lwbl-84
, author =	"B. Becker and H. G. Osthof"
, title =	"Layouts with wires of balanced length"
, type =	"Report"
, number =	"??"
, institution =	"Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1984
}

@inproceedings{bsw-spsat-91
, author =	"B. Becker and H. W. Six and P. Widmayer"
, title =	"Spatial priority search: {An} access technique for scaleless maps"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1991
, pages =	"128--138"
, update =	"97.07 agarwal"
}

@inproceedings{bw-mvl-90
, author =	"Bruno Becker and Peter Widmayer"
, title =	"{Ma{\ss}stabsunabh{\"a}ngige} {Verwaltung} von {Landkarten}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	5
, update =	"00.03 bibrelex"
}

@inproceedings{bkss-rtera-90
, author =	"N. Beckmann and H.-P. Kriegel and R. Schneider and B. Seeger"
, title =	"The {R$^*$}-tree: {An} efficient and robust access method for points and rectangles"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1990
, pages =	"322--331"
, update =	"97.07 agarwal, 95.01 mitchell"
}

@phdthesis{b-msvav-92
, author =	"B. B. Bederson"
, title =	"A miniature space-variant active vision system: {Cortex}-{I}"
, school =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@book{bbf-fmg-86
, author =	"Behnke and Bachmann and Fladt"
, title =	"Fundamentals of mathematics, geometry"
, volume =	1
, publisher =	"MIT Press"
, year =	1986
, update =	"97.11 bibrelex"
}

@article{b-udkuu-38
, author =	"F. Behrend"
, title =	"{\"U}ber die kleinste umbeschriebene und die gr{\"o}{\ss}te einbeschriebene {Ellipse} eines konvexen {Bereiches}"
, journal =	"Math. Ann."
, volume =	115
, year =	1938
, pages =	"379--411"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@mastersthesis{b-azede-90
, author =	"B. Behrends"
, title =	"Algorithmen zur {Erkennung} der $\epsilon$-{Kongruenz} von {Punktmengen} und {Polygonen}"
, school =	"Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, year =	1990
, note =	"Diploma Thesis"
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@incollection{b-fs-94
, author =	"Uwe Behrens"
, title =	"Fence Shading"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"404--409"
, keywords =	"Gouraud shading, Phong shading"
, update =	"94.09 heckbert"
, annote =	"Proposes an approach halfway between Gouraud shading and
Phong shading: shade along the edges of the polygon, but interpolate across
the interior. Contains pseudocode."
}

@inproceedings{bs-rptsa-90
, author =	"I. Beichl and F. Sullivan"
, title =	"A robust parallel triangulation and shelling algorithm"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"107--111"
, cites =	"bm-sdcs-71, dk-rtdpm-78, s-chdch-86, s-imc-73, ygkm-mdidq-, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{bg-sos-87
, author =	"R. Beigel and J. Gill"
, title =	"Sorting $n$ Objects with a $k$-sorter"
, institution =	"The John Hopkins University"
, year =	1987
, update =	"98.03 bibrelex"
}

@article{b-onasc-89
, author =	"W. Bein"
, title =	"An ${O}(n\log n)$ algorithm for a special class of linear programs"
, journal =	"Computing"
, volume =	42
, year =	1989
, pages =	"309--313"
, keywords =	"linear programming"
, update =	"95.05 korneenko"
}

@misc{blp-despp-92
, author =	"W. Bein and L. Larmore and J. Park"
, title =	"The $d$-edge shortest-path problem for a {Monge} graph"
, year =	1992
, note =	"Preprint"
, update =	"98.03 bibrelex"
}

@inproceedings{bs-ilmth-98
, author =	"Ronald Beirouti and Jack Snoeyink"
, title =	"Implementations of the LMT Heuristic for Minimum Weight Triangulations"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"96--105"
, update =	"01.11 pocchiola"
}

@article{b-tcil-77
, author =	"D. E. Bell"
, title =	"A theorem concerning integer lattice"
, journal =	"Studies Appl. Math."
, volume =	56
, number =	2
, year =	1977
, pages =	"187--188"
, keywords =	"discrete geometry, linear programming"
, update =	"95.05 korneenko"
}

@article{bhm-dghp-89
, author =	"S. B. M. Bell and F. C. Hobroyd and D. C. Masa"
, title =	"A digital geometry of hexagonal pixels"
, journal =	"Image Vision Comput."
, volume =	7
, number =	3
, year =	1989
, pages =	"194--204"
, keywords =	"digital geometry"
, update =	"95.05 korneenko"
}

@inproceedings{bglr-epcpa-93
, author =	"M. Bellare and S. Goldwasser and C. Lund and A. Russel"
, title =	"Efficient probabilistically checkable proofs and applications to approximation"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"294--304"
, update =	"97.11 bibrelex"
}

@inproceedings{bs-inar-94
, author =	"M. Bellare and M. Sudan"
, title =	"Improved non-approximability results"
, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"184--193"
, update =	"97.07 agarwal"
}

@mastersthesis{b-ctcsp-91
, author =	"Patrice Belleville"
, title =	"Computing two-covers of simple polygons"
, school =	"School of Computer Science, McGill University"
, year =	1991
, keywords =	"master thesis"
}

@inproceedings{b-cchd-95
, author =	"Patrice Belleville"
, title =	"Convex Covers in Higher Dimensions"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"145--150"
, update =	"95.09 jones"
}

@inproceedings{b-rbcct-93
, author =	"P. Belleville"
, title =	"On restricted boundary covers and convex three-covers"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"467--472"
, cites =	"ghlst-ltavs-87, h-fvgsp-87, o-agta-87, s-rutcp-93, cr-cpih-88, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{b-ppmih-91
, author =	"P. Belleville"
, title =	"Probing polygons minimally is hard"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"50--53"
, cites =	"gj-cigtn-79, l-aiorp-88, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{b-tgsp-92
, author =	"P. Belleville"
, title =	"Two-guarding simple polygons"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"103--108"
, cites =	"b-ctcsp-91, ghlst-ltavs-87, h-fuenl-89, o-agta-87, s-rutcp-93, s-rrag-92, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{bbcuz-kgpp-94
, author =	"P. Belleville and P. Bose and J. Czyzowicz and J. Urrutia and J. Zaks"
, title =	"$k$-Guarding Polygons on the Plane"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"381--386"
, cites =	"bglosu-fp-93, c-ctpg-75, cruz-grag, cru-ofipt-93, f-icd-77, f-spcwt-78, o-agta-87, fru-lsoso-92, h-mg-76, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{bkms-cetaa-96
, author =	"Patrice Belleville and Mark Keil and Michael McAllister and Jack Snoeyink"
, title =	"On computing edges that are in all minimum-weight triangulations"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V7--V8"
, cites =	"aatr-tin-95, bde-danmw-96t, dm-ucsmw-96, k-mtpd-80, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@techreport{bs-ppmh-91
, author =	"P. Belleville and T. Shermer"
, title =	"Probing polygons minimially is hard"
, type =	"Technical {Report}"
, number =	"91-12"
, institution =	"Dept. Comput. Sci., Simon Fraser Univ."
, address =	"Burnaby, BC"
, month =	dec
, year =	1991
, update =	"98.03 bibrelex"
}

@article{bs-ppmih-93
, author =	"P. Belleville and T. C. Shermer"
, title =	"Probing Polygons Minimally is Hard"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	5
, month =	mar
, year =	1993
, pages =	"255--265"
, update =	"93.09 held+milone+mitchell"
}

@book{b-dp-87
, author =	"R. E. Bellman"
, title =	"Dynamic Programming"
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1987
}

@article{br-cfssl-69
, author =	"R. E. Bellman and R. S. Roth"
, title =	"Curve fitting by segmented straight lines"
, journal =	"American Statistical Association Journal"
, volume =	64
, year =	1969
, pages =	"1079--1084"
, update =	"96.09 orourke"
}

@book{br-matmm-86
, author =	"R. E. Bellman and R. S. Roth"
, title =	"Methods in Approximation: Techniques for Mathematical Modelling"
, publisher =	"D.~Reidel Publishing Co."
, address =	"Boston"
, year =	1986
, update =	"96.09 orourke"
}

@article{bbdr-msdtc-00
, author =	"A. Below and U. Brehm and J. A. {De Loera} and J. Richter-Gebert"
, title =	"Minimal simplicial dissections and triangulations of convex 3-polytopes"
, journal =	"Discrete Comput. Geom."
, volume =	24
, year =	2000
, pages =	"35--48"
, update =	"01.04 orourke"
}

@unpublished{bdr-cfst-00
, author =	"A. Below and J. A. {De Loera} and J. Richter-Gebert"
, title =	"The complexity of finding small triangulations of convex 3-polytopes"
, year =	2000
, note =	"Manuscript. \url{http://www.inf.ethz.ch/personal/richter/}"
, update =	"01.04 orourke"
}

@article{bft-crup-01
, author =	"A. Bemporad and K. Fukuda and F. D. Torrisi"
, title =	"Convexity recognition of the union of polyhedra"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"141--154"
, update =	"01.07 smid"
}

@inproceedings{b-lbara-95
, author =	"Amir M. Ben-Amram"
, title =	"Lower Bounds on Algebraic Random Access Machines"
, booktitle =	"Proc. 22nd Internat. Colloq. Automata Lang. Prog."
, nickname =	"ICALP '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	944
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"360--371"
, update =	"97.07 agarwal"
, abstract =	"The method of proving lower bounds for decision
                 problems by topological component counting,
                 previously used with respect to algebraic computation
                 trees, is extended in this work to random access
                 machines with operations $\{+,-,\times,/\}$ or
                 $\{+,-,\times,\lfloor\;\rfloor\}$."
}

@article{b-wipm-95
, author =	"Amir M. Ben-Amram"
, title =	"What is a ``Pointer Machine''?"
, journal =	"SIGACT News"
, volume =	26
, year =	1995
, pages =	"88--95"
, update =	"97.07 agarwal"
}

@inproceedings{bbktw-prola-90
, author =	"S. Ben-David and A. Borodin and R. Karp and G. Tardos and A. Wigderson"
, title =	"On the Power of Randomization in On-Line Algorithms"
, booktitle =	"Proc. 22th Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"379--386"
, update =	"94.05 franciosa"
}

@inproceedings{bk-adspp-01
, author =	"Boaz Ben-Moshe and Matthew J. Katz"
, title =	"Approximating the Diameter of a Set of Points in the Presence of Rectangular Obstacles"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"154--157"
, update =	"01.04 icking"
}

@article{bks-oflcs-00
, author =	"B. Ben-Moshe and M. J. Katz and M. Segal"
, title =	"Obnoxious facility location: complete service with minimal harm"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"581--592"
, update =	"01.04 smid"
}

@inproceedings{b-actcp-94
, author =	"Michael Ben-Or"
, title =	"Algebraic Computation Trees in Characteristic {$p>0$}"
, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1994
, pages =	"534--539"
, update =	"97.03 agarwal"
}

@inproceedings{b-lbact-83
, author =	"M. Ben-Or"
, title =	"Lower bounds for algebraic computation trees"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
, year =	1983
, pages =	"80--86"
}

@article{bkr-ceag-86
, author =	"M. Ben-Or and D. Kozen and J. H. Reif"
, title =	"The complexity of elementary algebra and geometry"
, journal =	"J. Comput. Syst. Sci."
, volume =	32
, year =	1986
, pages =	"251--264"
}

@article{bs-cht-90
, author =	"Ben-Tzvi and D. and M. B. Sandler"
, title =	"A Combinatorial Hough Transform"
, journal =	"Pattern Recogn. Lett."
, volume =	"??"
, number =	11
, year =	1990
, pages =	"167--174"
, update =	"98.07 bibrelex"
}

@article{bd-rstod-86
, author =	"H. Bendelt and A. Dress"
, title =	"Reconstructing the shape of a tree from observed dissimilarity data"
, journal =	"Adv. Appl. Math."
, volume =	7
, year =	1986
, pages =	"309--343"
, update =	"97.11 bibrelex"
}

@book{bo-ammse-78
, author =	"C. M. Bender and S. A. Orszag"
, title =	"Advanced mathematical methods for scientists and engineers"
, series =	"International Series in Pure and Applied Mathematics"
, publisher =	"McGraw-Hill"
, year =	1978
, update =	"98.03 bibrelex"
}

@article{b-ame-74
, author =	"E. A. Bender"
, title =	"Asymptotic methods in enumeration"
, journal =	"SIAM Rev."
, volume =	16
, number =	4
, month =	oct
, year =	1974
, pages =	"485--515"
, update =	"97.11 bibrelex"
}

@article{bcm-anlcg-90
, author =	"E. A. Bender and E. R. Candfield and B. D. McKay"
, title =	"The asymptotic number of labeled connected graphs with a given number of vertices and edges"
, journal =	"Random Structures and Algorithms"
, volume =	1
, number =	2
, year =	1990
, pages =	"127--169"
, update =	"97.11 bibrelex"
}

@inproceedings{bf-lpr-00
, author =	"M. A. Bender and M. Farach-Colton"
, title =	"The {LCA} problem revisited"
, booktitle =	"Proceedings of the 4th Latin American Symposium on Theoretical Informatics"
, series =	"Lecture Notes Comput. Sci."
, volume =	1776
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	2000
, pages =	"88--94"
, update =	"01.11 smid"
}

@article{blr-bnccr-91
, author =	"R. Benedetti and F. Loeser and J. J. Risler"
, title =	"Bounding the number of connected components of a real algebraic set"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"191--209"
}

@book{br-rasas-90
, author =	"R. Benedetti and J.-J. Risler"
, title =	"Real algebraic and semi-algebraic sets"
, series =	"Actualit{\'e}s math{\'e}matiques"
, publisher =	"Hermann"
, address =	"Paris"
, year =	1990
, update =	"00.03 bibrelex"
}

@article{bh-ospp-95
, author =	"M. Benelli and R. Hassin"
, title =	"Optimal separable partitioning in the plane"
, journal =	"Discrete Appl. Math."
, volume =	59
, year =	1995
, pages =	"215--224"
, keywords =	"bipartition, clustering, separation, optimization, diameter, Weber problem, convex hull"
, update =	"95.09 mitchell"
}

@article{bn-ciimc-64
, author =	"B.-E. Bengtsson and S. Norbeck"
, title =	"Construction of isarithms and isarithmic maps by computers"
, journal =	"BIT"
, volume =	4
, year =	1964
, pages =	"87--105"
}

@inproceedings{b-rbasv-90
, author =	"Daniel Benninger"
, title =	"{R-B{\"a}ume} und {Abfragen} auf skalarwertigen {Vektorkarten}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	6
, update =	"00.03 bibrelex"
}

@inproceedings{bc-arstp-92
, author =	"I. Bennour and J. Cloutier"
, title =	"Approximation of the rectilinear {Steiner} tree problem with neural networks"
, booktitle =	"Canadian Conf. on VLSI"
, site =	"Halifax"
, month =	oct
, year =	1992
, update =	"98.11 bibrelex"
}

@inproceedings{bjmm-lsicg-93
, author =	"M. Benouamer and P. Jaillon and D. Michelucci and J.-M. Moreau"
, title =	"A lazy solution to imprecision in computational geometry"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"73--78"
, cites =	"bo-arcgi-79, c-fadsi-88, d-reidt-92, em-sstcd-88, fv-eeacg-93, gy-frcg-86, gss-egbra-89, si-cvd10-89, j-leair-93, k-sa-81, m-rfqcd-87, m-vigau-88p, m-dpggt-89, ml-csche-89, m-ia-66, m-fhrsg-90, otu-nsga-87, ps-cgi-85, ss-ccsm-85, ce-oails-88t, hns-saann-88, k-rmrs-89, kln-edtur-89, m-mdscg-84, y-gctsp-88, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@incollection{bllr-achmd-86
, author =	"M. Benson and R. Larntz and M. Lavine and R. Regal"
, title =	"The application of convex hulls in multiple dimensions"
, booktitle =	"Computer Sci. and Statistics: Proc. 18th Sympos. on the Interface"
, year =	1986
, pages =	"297--301"
, keywords =	"convex hull"
, update =	"95.09 agarwal, 95.05 korneenko"
}

@book{b-egc-66
, author =	"R. V. Benson"
, title =	"Euclidean Geometry and Convexity"
, publisher =	"McGraw-Hill"
, address =	"New York, NY"
, year =	1966
, update =	"97.03 schwarzkopf"
}

@article{bst-bst-85
, author =	"S. W. Bent and D. D. Sleator and R. E. Tarjan"
, title =	"Biased Search Trees"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"545--568"
, update =	"96.01 tamassia"
}

@unpublished{b-akrp-77
, author =	"J. Bentley"
, title =	"Algorithms for {Klee's} rectangle problems"
, year =	1977
, note =	"unpublished manuscript, Dept. of Computer Science, Carnegie-Mellon University"
, update =	"98.11 bibrelex"
}

@article{b-csaad-84
, author =	"J. L. Bentley"
, title =	"A case study in applied algorithm design"
, journal =	"Computer"
, volume =	17
, year =	1984
, pages =	"75--88"
}

@techreport{b-stfrn-75
, author =	"J. L. Bentley"
, title =	"A survey of techniques for fixed radius near neighbor searching"
, type =	"Report"
, number =	"STAN-CS-78-513"
, institution =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, year =	1975
}

@techreport{b-amn-78
, author =	"J. L. Bentley"
, title =	"Algorithms for multivariate nonparametrics"
, type =	"Report"
, number =	"CMU-CS-78-147"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1978
}

@article{b-dsp-79
, author =	"J. L. Bentley"
, title =	"Decomposable searching problems"
, journal =	"Inform. Process. Lett."
, volume =	8
, year =	1979
, pages =	"244--251"
}

@phdthesis{b-dcacp-76
, author =	"J. L. Bentley"
, title =	"Divide-and-conquer algorithms for closest point problems in multidimensional space"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, year =	1976
, note =	"Report TR-76-103"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@inproceedings{b-etsh-90
, author =	"J. L. Bentley"
, title =	"Experiments on traveling salesman heuristics"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, site =	"San Francisco, CA"
, month =	jan
, year =	1990
, pages =	"91--99"
, update =	"98.07 bibrelex"
}

@article{b-fagts-92
, author =	"Jon Louis Bentley"
, title =	"Fast Algorithms for Geometric Traveling Salesman Problems"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"387--411"
, update =	"98.03 mitchell"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@inproceedings{b-kdtsp-90
, author =	"J. L. Bentley"
, title =	"{$K$}-d trees for semidynamic point sets"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"187--197"
, cites =	"ahu-daca-74, b-mbstu-75, b-etsh-90, b-fagts-92, bs-dcms-76, bwy-oetac-80, fr-etbs-75, fbf-afbml-77, lw-wcarp-77, m-mdscg-84, pb-wcann-80t, ps-cgi-85, s-a-88, s-rnnsk-88, s-cpl-86, z-tcg-78, ZZZ"
, update =	"97.11 bibrelex"
}

@article{b-mbstd-79
, author =	"J. L. Bentley"
, title =	"Multidimensional binary search trees in database applications"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-5"
, year =	1979
, pages =	"333--340"
}

@article{b-mbstu-75
, author =	"J. L. Bentley"
, title =	"Multidimensional binary search trees used for associative searching"
, journal =	"Commun. ACM"
, volume =	18
, number =	9
, month =	sep
, year =	1975
, pages =	"509--517"
, update =	"98.11 bibrelex"
}

@article{b-mdc-80
, author =	"J. L. Bentley"
, title =	"Multidimensional divide-and-conquer"
, journal =	"Commun. ACM"
, volume =	23
, number =	4
, year =	1980
, pages =	"214--229"
, succeeds =	"bs-dcms-76"
}

@article{b-pqrr-79
, author =	"J. L. Bentley"
, title =	"Priority queues with range restriction"
, journal =	"Bull. EATCS"
, volume =	9
, year =	1979
, pages =	"7--8"
}

@book{b-pp-85
, author =	"J. L. Bentley"
, title =	"Programming Pearls"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1985
, update =	"00.03 bibrelex"
}

@techreport{b-skrp-77
, author =	"J. L. Bentley"
, title =	"Solutions to {Klee}'s rectangle problems"
, type =	"Technical Report"
, institution =	"Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1977
, update =	"97.03 schwarzkopf"
}

@inproceedings{b-scfga-81
, author =	"J. L. Bentley"
, title =	"Squeezing constant factors of geometric algorithms"
, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
, year =	1981
, pages =	"11--20"
}

@article{bb-hpmrd-76
, author =	"J. L. Bentley and W. A. Burkhard"
, title =	"Heuristics for partial-match retrieval data base design"
, journal =	"Inform. Process. Lett."
, volume =	4
, year =	1976
, pages =	"132--135"
}

@inproceedings{bc-atipp-80
, author =	"J. L. Bentley and W. Carruthers"
, title =	"Algorithms for testing the inclusion of points in polygons"
, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
, year =	1980
, pages =	"11--19"
}

@inproceedings{bcl-fleta-90
, author =	"J. L. Bentley and K. L. Clarkson and D. B. Levine"
, title =	"Fast linear expected-time algorithms for computing maxima and convex hulls"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"179--187"
}

@techreport{bfpp-tpcg-80
, author =	"J. L. Bentley and G. M. Faust and C. H. Papadimitriou and F. P. Preparata"
, title =	"Two papers on computational geometry"
, type =	"Report"
, number =	"CMU-CS-80-109"
, institution =	"Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1980
}

@article{bfp-aach-82
, author =	"J. L. Bentley and G. M. Faust and F. P. Preparata"
, title =	"Approximation algorithms for convex hulls"
, journal =	"Commun. ACM"
, volume =	25
, year =	1982
, pages =	"64--68"
, keywords =	"designing algorithms, convex hull, approximation, two-dimensional, worst-case analysis"
, annote =	"$O(n)$ time"
}

@article{bf-dsrs-79
, author =	"J. L. Bentley and J. H. Friedman"
, title =	"Data structures for range searching"
, journal =	"ACM Comput. Surv."
, volume =	11
, year =	1979
, pages =	"397--409"
}

@article{bf-facms-78
, author =	"J. L. Bentley and J. H. Friedman"
, title =	"Fast algorithms for constructing minimal spanning trees in coordinate spaces"
, journal =	"IEEE Trans. Comput."
, volume =	"C-27"
, year =	1978
, pages =	"97--105"
}

@inproceedings{bhh-fgavt-81
, author =	"J. L. Bentley and D. Haken and R. W. Hon"
, title =	"Fast geometric algorithms for {VLSI} tasks"
, booktitle =	"Proc. Comput. Conf."
, year =	1981
, pages =	"88--92"
}

@article{bkv-eccm-91
, author =	"J. L. Bentley and B. Kernigham and C. {Van Wyk}"
, title =	"An elementary {C} cost model"
, journal =	"UNIX Review"
, volume =	9
, number =	2
, year =	1991
, pages =	"38--48"
, update =	"98.03 bibrelex"
}

@article{bkst-anmsv-78
, author =	"J. L. Bentley and H. T. Kung and M. Schkolnick and C. D. Thompson"
, title =	"On the average number of maxima in a set of vectors and applications"
, journal =	"J. ACM"
, volume =	25
, year =	1978
, pages =	"536--543"
}

@article{bm-nenns-79
, author =	"J. L. Bentley and H. A. Maurer"
, title =	"A note on {Euclidean} near neighbor searching in the plane"
, journal =	"Inform. Process. Lett."
, volume =	8
, year =	1979
, pages =	"133--136"
}

@article{bm-ewcds-80
, author =	"J. L. Bentley and H. A. Maurer"
, title =	"Efficient worst-case data structures for range searching"
, journal =	"Acta Inform."
, volume =	13
, year =	1980
, pages =	"155--168"
}

@incollection{bow-cmhds-83
, author =	"Jon Louis Bentley and Thomas Ottmann and Peter Widmayer"
, title =	"The Complexity of Manipulating Hierarchically Defined Sets of Rectangles"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"127--158"
, keywords =	"isothetic, rectangles, data structuring"
, succeeds =	"bo-cmhds-82"
, update =	"01.04 icking, 95.05 korneenko"
}

@article{bo-arcgi-79
, author =	"J. L. Bentley and T. A. Ottmann"
, title =	"Algorithms for reporting and counting geometric intersections"
, journal =	"IEEE Trans. Comput."
, volume =	"C-28"
, number =	9
, month =	sep
, year =	1979
, pages =	"643--647"
, precedes =	"b-carcg-81"
, update =	"98.11 bibrelex"
}

@inproceedings{bo-cmhds-82
, author =	"J. L. Bentley and T. A. Ottmann"
, title =	"The complexity of manipulating hierarchically defined sets of rectangles"
, booktitle =	"Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	118
, publisher =	"Springer-Verlag"
, year =	1982
, pages =	"1--15"
, precedes =	"bow-cmhds-83"
, update =	"95.05 korneenko"
}

@article{bs-avs-79
, author =	"J. L. Bentley and J. B. Saxe"
, title =	"Algorithms on vector sets"
, journal =	"SIGACT News"
, volume =	11
, year =	1979
, pages =	"36--39"
}

@inproceedings{bs-athet-80
, author =	"J. L. Bentley and J. B. Saxe"
, title =	"An analysis of two heuristics for the {Euclidean} traveling salesman problem"
, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
, year =	1980
, pages =	"41--49"
}

@article{bs-dsp1s-80
, author =	"J. L. Bentley and J. B. Saxe"
, title =	"Decomposable searching problems {I}: {S}tatic-to-dynamic transformations"
, journal =	"J. Algorithms"
, volume =	1
, year =	1980
, pages =	"301--358"
, succeeds =	"sb-tsdsd-79"
, update =	"00.11 smid, 96.05 agarwal"
}

@inproceedings{bs-pmsad-77
, author =	"J. L. Bentley and M. I. Shamos"
, title =	"A problem in multivariate statistics: algorithm, data structure, and applications"
, booktitle =	"Proc. 15th Allerton Conf. Commun. Control Comput."
, year =	1977
, pages =	"193--201"
}

@article{bs-dclet-78
, author =	"J. L. Bentley and M. I. Shamos"
, title =	"Divide-and-conquer for linear expected time"
, journal =	"Inform. Process. Lett."
, volume =	7
, year =	1978
, pages =	"87--91"
}

@inproceedings{bs-dcms-76
, author =	"J. L. Bentley and M. I. Shamos"
, title =	"Divide-and-conquer in multidimensional space"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
, year =	1976
, pages =	"220--230"
, precedes =	"b-mdc-80"
}

@article{bs-arsqt-75
, author =	"J. L. Bentley and D. F. Stanat"
, title =	"Analysis of range searches in quad trees"
, journal =	"Inform. Process. Lett."
, volume =	3
, year =	1975
, pages =	"170--173"
}

@article{bsw-cffrn-77
, author =	"J. L. Bentley and D. F. Stanat and E. H. {William, Jr.}"
, title =	"The complexity of finding fixed-radius near neighbors"
, journal =	"Inform. Process. Lett."
, volume =	6
, year =	1977
, pages =	"209--212"
}

@article{bwy-oetac-80
, author =	"J. L. Bentley and B. W. Weide and A. C. Yao"
, title =	"Optimal expected-time algorithms for closest-point problems"
, journal =	"ACM Trans. Math. Softw."
, volume =	6
, year =	1980
, pages =	"563--580"
}

@article{bw-owcar-80
, author =	"J. L. Bentley and D. Wood"
, title =	"An optimal worst case algorithm for reporting intersections of rectangles"
, journal =	"IEEE Trans. Comput."
, volume =	"C-29"
, year =	1980
, pages =	"571--577"
}

@inproceedings{bbmmt-hmgd-95
, author =	"Steven Benzley and Ted D. Blacker and Scott A. Mitchell and Peter Murdoch and Timothy J. Tautges"
, title =	"Hexahedral Mesh Generation via the Dual"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C4--C5"
, cites =	"rt-gcphg-84, mbbm-cbmrc-, tmb-cbmrc-, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
}

@inproceedings{bpmcs-cahat-95
, author =	"Steven E. Benzley and Ernest Perry and Karl Merkley and Brett Clark and Gregory D. Sjaardema"
, title =	"A Comparison of All Hexagonal and All Tetrahedral Finite Element Meshes for Elastic and Elasto-plastic Analysis"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"179--192"
, update =	"96.01 samitchell"
}

@inproceedings{bbbkk-fpssm-97
, author =	"S. Berchtold and C. B{\"o}hm and B. Barunm{\"u}ller and D. A. Keim and H.-P. Kriegel"
, title =	"Fast parallel similarity search in multimedia databases"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1997
, pages =	"1--12"
, update =	"97.07 agarwal"
}

@inproceedings{bbkk-cmnns-97
, author =	"S. Berchtold and C. B{\"o}hm and D. A. Keim and H.-P. Kriegel"
, title =	"A cost model for nearest neighbor search in high-dimensional data space"
, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
, year =	1997
, pages =	"78--86"
, update =	"97.07 agarwal"
}

@inproceedings{bkk-xtish-96
, author =	"S. Berchtold and D. A. Keim and H.-P. Kriegel"
, title =	"The {X}-tree: {A}n index structure for higher dimensional data"
, booktitle =	"Proc. 22th VLDB Conference"
, year =	1996
, pages =	"28--39"
, update =	"97.07 agarwal"
}

@article{bl-ndsls-88
, author =	"C. A. Berenstein and D. Lavine"
, title =	"On the number of digital straight line segments"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	10
, number =	6
, year =	1988
, pages =	"880--888"
, keywords =	"digital geometry"
, update =	"95.05 korneenko"
}

@article{bklo-gasra-87
, author =	"C. A. Berenstein and L. N. Kanal And D. Lavine and E. Olson"
, title =	"A geometric approach to subpixel registration accuracy"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	40
, number =	3
, year =	1987
, pages =	"334--360"
, update =	"98.11 bibrelex"
}

@phdthesis{b-ipsap-84
, author =	"G. B. Beretta"
, title =	"An implementation of a plane-sweep algorithm on a personal computer"
, type =	"Ph.{D}. Thesis"
, school =	"Swiss Federal Inst. Tech."
, address =	"Z{\"u}rich, Switzerland"
, year =	1984
, note =	"Report ETH 7538"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@inproceedings{bos-oppp-00
, author =	"Robert-Paul Beretty and Mark H. Overmars and A. Frank van der Stappen"
, title =	"Orienting Polyhedral Parts by Pushing"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"136--139"
, update =	"00.03 bibrelex"
}

@inproceedings{b-chpsd-93
, author =	"M. de Berg"
, title =	"Computing half-plane and strip discrepancy of planar point sets"
, booktitle =	"Proc. 3rd Internat. Conf. on Comput. Graphics and Visualization Techniques"
, year =	1993
, pages =	"294--303"
, keywords =	"discrepancy, algorithms, dynamic"
, update =	"94.05 schwarzkopf"
}

@article{b-chpsd-96
, author =	"M. de Berg"
, title =	"Computing half-plane and strip discrepancy of planar point sets"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"69--83"
, update =	"96.09 smid"
}

@techreport{b-doshs-91
, author =	"M. de Berg"
, title =	"Dynamic output-sensitive hidden surface removal for $c$-oriented polyhedra"
, type =	"Report"
, number =	"RUU-CS-91-6"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1991
, precedes =	"b-doshs-92"
, update =	"94.05 schwarzkopf"
}

@article{b-doshs-92
, author =	"M. de Berg"
, title =	"Dynamic output-sensitive hidden surface removal for $c$-oriented polyhedra"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"119--140"
, succeeds =	"b-doshs-91"
}

@phdthesis{b-earsh-92
, author =	"M. de Berg"
, title =	"Efficient algorithms for ray shooting and hidden surface removal"
, type =	"Ph.{D}. Dissertation"
, school =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1992
, keywords =	"doctoral thesis"
, precedes =	"b-rsdoh-93"
, update =	"94.05 schwarzkopf"
}

@inproceedings{b-ghsr-93
, author =	"M. de Berg"
, title =	"Generalized hidden surface removal"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"1--10"
, precedes =	"b-ghsr-96"
, cites =	"am-rsps-92, b-hsrr-90, c-tsplt-91a, cegs-lscaa-89, cg-vippg-89, bhosk-ershs-91, bo-hsrco-92, e-acg-87, gao-isost-90, go-nasch-87, ghlst-ltavs-87, hs-ndssg-86, kos-ehsro-92, ms-rcibt-88, m-wcohs-87, oy-nubkm-91, rs-eoshs-88i, ZZZ"
, update =	"98.03 bibrelex, 96.09 devillers, 93.09 jones"
}

@article{b-ghsr-96
, author =	"M. de Berg"
, title =	"Generalized hidden surface removal"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1996
, pages =	"249--276"
, succeeds =	"b-ghsr-93"
, update =	"96.09 devillers+held"
}

@inproceedings{b-lsbsp-95
, author =	"Mark de Berg"
, title =	"Linear Size Binary Space Partitions for Fat Objects"
, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	979
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"252--263"
, update =	"97.03 murali+schwarzkopf"
}

@article{b-lsbsp-00
, author =	"Mark de Berg"
, title =	"Linear size binary space partitions for uncluttered scenes"
, journal =	"Algorithmica"
, volume =	28
, year =	2000
, pages =	"353--366"
, update =	"02.03 cheong"
}

@techreport{d-rld-89
, author =	"M. de Berg"
, title =	"On Rectilinear Link Distance"
, type =	"Technical Report"
, number =	"RUU-CS-89-13"
, institution =	"Dept. of Computer Science, Univ. of Utrecht"
, year =	1989
, precedes =	"b-rld-91"
, update =	"98.07 bibrelex"
}

@article{b-rld-91
, author =	"M. de Berg"
, title =	"On Rectilinear Link Distance"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	1
, month =	jul
, year =	1991
, pages =	"13--34"
, keywords =	"motion planning, rectilinear paths, rectilinear polygons, linkdistance"
, succeeds =	"d-rld-89"
, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 held"
, annote =	"He considers rectilinear paths in a rectilinear simple polygon.  In $O(n\log n)$
		 preprocessing time and space, he builds a data structure that supports
		 $O(\log n)$ time queries for distance between two points ($O(1)$ time between
		 two polygon vertices).  He is actually searching for paths that are``smallest'' in
		 that they are shortest simultaneously in rectilinear link distance and
		 $L_1$ length (which is always possible).  See improvements to $O(n)$ time and
		 space by Lingas, Maheshwari, and Sack~\cite{lms-parld-95} and
		 Schuierer~\cite{s-odssr-96}."
}

@book{b-rsdoh-93
, author =	"M. de Berg"
, title =	"Ray Shooting, Depth Orders and Hidden Surface Removal"
, series =	"Lecture Notes Comput. Sci."
, volume =	703
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1993
, keywords =	"book, ray shooting, depth orders, hidden surface removal, translation orders, graphics, data structures"
, succeeds =	"b-earsh-92"
, update =	"96.09 agarwal, 94.05 schwarzkopf"
}

@inproceedings{b-srpp-91
, author =	"M. de Berg"
, title =	"Shortest rectilinear path problems"
, booktitle =	"Proc. 13th IMACS World Congress on Computation and Applied Mathematics"
, year =	1991
, pages =	"142--143"
, keywords =	"motion planning, shortest paths"
}

@inproceedings{b-tpahs-90
, author =	"M. de Berg"
, title =	"Translating polygons with applications to hidden surface removal"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"60--70"
}

@inproceedings{b-tpwah-90
, author =	"Mark de Berg"
, title =	"Translating Polygons With Applications to Hidden Surface Removal"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	7
, update =	"00.03 bibrelex"
}

@article{b-tdcg-97
, author =	"M. de Berg"
, title =	"Trends and developments in computational geometry"
, journal =	"Comput. Graph. Forum"
, volume =	16
, year =	1997
, pages =	"3--30"
, update =	"97.11 oostrum+smid"
}

@inproceedings{bbbrw-ccmwa-97
, author =	"M. de Berg and J. Bose and D. Bremner and S. Ramaswami and G. Wilfong"
, title =	"Computing constrained minimum-width annuli of point sets"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"3--16"
, update =	"99.07 bibrelex, 97.11 oostrum"
}

@article{bbbrw-ccmwa-98
, author =	"M. de Berg and P. Bose and D. Bremner and S. Ramaswami and G. Wilfong"
, title =	"Computing Constrained Minimum-Width Annuli of Point Sets"
, journal =	"Comput. Aided Design"
, volume =	30
, number =	4
, month =	apr
, year =	1998
, pages =	"267--275"
, update =	"98.07 held"
}

@inproceedings{bbdkogrsy-crtt-96
, author =	"M. de Berg and P. Bose and K. Dobrint and M. van Kreveld and M. Overmars and M. de Groot and T. Roos and J. Snoeyink and S. Yu"
, title =	"The complexity of rivers in triangulated terrains"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"325--330"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{bcdkt-cmotc-98
, author =	"Mark de Berg and Otfried Cheong and Olivier Devillers and Mark van Kreveld and Monique Teillaud"
, title =	"Computing the Maximum Overlap of Two Convex Polygons Under Translations"
, journal =	"Theory of Computing Systems"
, volume =	31
, year =	1998
, pages =	"613--628"
, url =	"http://www-sop.inria.fr/prisme/biblio/search.html"
, succeeds =	"bdkst-cmotc-96"
, cites =	"ast-apsgo-92, abb-amps-91, ag-mrpc-92, absstz-sacp-96, ab-pptr-88, c-pcp-83, c-oaitd-92, c-chdc-93, cghkkk-gpmem-93, ck-cppop-93, f-fapct-85, fj-gsrsm-84, g-cp-67, h-ampac-92, hkk-dvdmh-92i, hks-uevsi-93, l-rmp-91, msw-aotp-93, pt-cocpc-92, scklps-gadss-86, v-aitco-95"
, update =	"99.11 devillers, 99.07 devillers, 98.11 devillers"
, abstract =	"Let $P$ be a convex polygon in the plane with $n$ vertices and let $Q$ be a convex polygon with $m$ vertices.  We prove that the maximum number of combinatorially distinct placements of $Q$ with respect to $P$ under translations is $O(n^2+m^2+\min(nm^2+n^2m))$, and we give an example showing that this bound is tight in the worst case.  Second, we present an $O((n+m)\log(n+m))$ algorithm for determining a translation of $Q$ that maximizes the area of overlap of $P$ and $Q$.  We also prove that the placement of $Q$ that makes the centroids of $Q$ and $P$ coincide realizes an overlap of at least $9/25$ of the maximum possible overlap.  As an upper bound, we show an example where the overlap in this placement is $4/9$ of the maximum possible overlap."
}

@article{bdds-cscot-97
, author =	"Mark de Berg and Olivier Devillers and Katrin Dobrindt and Otfried Schwarzkopf"
, title =	"Computing a Single Cell in the Overlay of Two Simple Polygons"
, journal =	"Inform. Process. Lett."
, volume =	63
, number =	4
, month =	aug
, year =	1997
, pages =	"215--219"
, url =	"http://www-sop.inria.fr/prisme/biblio/search.html"
, succeeds =	"bdds-cscut-95"
, cites =	"bds-lric-94, bdsty-arsol-92, cct-rpatd-92, cs-arscg-89, d-rysoa-92, gks-ricdv-92, gss-gmppt-89, m-cgitr-93, s-sfira-91"
, update =	"99.11 devillers, 99.07 devillers, 98.11 devillers, 98.07 bibrelex, 98.03 mitchell, 97.11 oostrum"
, abstract =	"This note combines the lazy randomized incremental construction scheme with the technique of ``connectivity acceleration'' to obtain an $O(n(\log^{\star}n)^2)$ time randomized algorithm to compute a single face in the overlay of two simple polygons in the plane."
}

@techreport{bdds-cscut-95
, author =	"Mark de Berg and Olivier Devillers and Katrin Dobrindt and Otfried Schwarzkopf"
, title =	"Computing a single cell in the union of two simple polygons"
, type =	"Research {Report}"
, number =	2626
, institution =	"INRIA"
, address =	"BP93, 06902 Sophia-Antipolis, France"
, year =	1995
, url =	"http://www.inria.fr/RRRT/RR-2626"
, precedes =	"bdds-cscot-97"
, update =	"99.11 bibrelex, 99.07 devillers, 98.11 devillers, 97.03 devillers, 96.01 devillers"
, abstract =	"This note presents a non trivial combination of two techniques previously used with randomized incremental algorithms: the lazy cleaning scheme \cite{bds-lric-94} to maintain structures with `non local' definition and the $O(n\log^{\star}n)$ acceleration when some additional information about the data is known \cite{s-sfira-91,cct-rpatd-92,d-rysoa-92}.  Authors assume that the reader is somehow familiar with this techniques.
If, we are interested in computing a single face in the intersection of two simple polygons, the two previous techniques can be used.  The lazy approach allows to compute a single face in an arrangement of line segments in expected time $O(n\alpha(n)\log n)$ but this technique do not exploit the organization of the segments in simple polygons.  The accelerated framework compute the whole intersection of the two simple polygon in $O(n\log^{\star}n+A)$ where $A=O(n^2)$ is the number of intersection points, and then the relevant connected component can be extracted easily in $O(n)$ time.  The two techniques can be combined to reach an algorithm whose expected time complexity is $O(n\log^{\star 2}n)$ which improve previous bounds above."
}

@inproceedings{bdkst-cmotc-96
, author =	"Mark de Berg and Olivier Devillers and Marc van Kreveld and Otfried Schwarzkopf and Monique Teillaud"
, title =	"Computing the maximum overlap of two convex polygons under translations"
, booktitle =	"Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC'96"
, series =	"Lecture Notes Comput. Sci."
, volume =	1178
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"126--135"
, precedes =	"bcdkt-cmotc-98"
, update =	"98.11 devillers, 98.07 rote"
}

@inproceedings{bd-ldt-95
, author =	"Mark de Berg and Katrin Dobrindt"
, title =	"On Levels of Detail in Terrains"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C26--C27"
, keywords =	"Delaunay triangulation, surface simplification, decimation"
, cites =	"dmp-htmsf-94, k-osps-83, l-cembt-91, ps-cgi-85, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@techreport{bds-lric-94t
, author =	"M. de Berg and K. Dobrindt and O. Schwarzkopf"
, title =	"On Lazy Randomized Incremental Construction"
, type =	"Tech. {Report}"
, number =	"UU-CS-1994-12"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, month =	mar
, year =	1994
, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-12.ps.gz"
, keywords =	"vertical decomposition, trapezoidal map, point location"
, comments =	"Full version of bds-lric-94"
, update =	"95.01 schwarzkopf+smid, 94.05 schwarzkopf"
}

@inproceedings{bds-lric-94
, author =	"M. de Berg and K. Dobrindt and O. Schwarzkopf"
, title =	"On Lazy Randomized Incremental Construction"
, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"105--114"
, comments =	"Full and ftp-able version see bds-lric-94t."
, update =	"95.01 smid, 94.05 schwarzkopf, 94.01 jones"
}

% also claimed, pages =	"161--186"
@article{bds-lric-95
, author =	"M. de Berg and K. Dobrindt and O. Schwarzkopf"
, title =	"On lazy randomized incremental construction"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"261--286"
, update =	"97.11 bibrelex+oostrum"
}

@article{bd-ldt-98
, author =	"M. de Berg and K. T. G. Dobrindt"
, title =	"On Levels of Details in Terrains"
, journal =	"Graph. Models Image Process."
, volume =	60
, number =	1
, month =	jan
, year =	1998
, pages =	"1--12"
, succeeds =	"bd-ldt-95"
, update =	"98.07 held"
}

@techreport{bew-tqsp-91
, author =	"M. de Berg and H. Everett and H. Wagener"
, title =	"Translation queries for sets of polygons"
, type =	"Report"
, number =	"RUU-CS-91-30"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1991
, keywords =	"convex hull, embedding, depth order"
, update =	"94.05 schwarzkopf"
}

@article{bew-tqsp-95
, author =	"M. de Berg and H. Everett and H. Wagener"
, title =	"Translation queries for sets of polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"221--242"
, keywords =	"convex hull, embedding, depth order"
, succeeds =	"bew-tqsp-91"
, update =	"96.05 pocchiola"
}

@inproceedings{bg-bspsc-94
, author =	"Mark de Berg and Marko de Groot"
, title =	"Binary Space Partitions for Sets of Cubes"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"85--88"
, update =	"00.11 smid, 00.07 icking, 98.07 bibrelex, 94.05 schwarzkopf"
}

@inproceedings{bgo-nrbsp-94
, author =	"Mark de Berg and Marko de Groot and Mark Overmars"
, title =	"New Results on Binary Space Partitions in the Plane"
, booktitle =	"Proc. 4th Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	824
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"61--72"
, precedes =	"bgo-nrbsp-97"
, update =	"00.11 smid, 00.07 icking, 95.01 schwarzkopf+smid, 94.05 schwarzkopf"
}

@article{bgo-nrbsp-97
, author =	"Mark de Berg and Marko de Groot and Mark Overmars"
, title =	"New Results on Binary Space Partitions in the Plane"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"317--333"
, succeeds =	"bgo-nrbsp-94"
, update =	"00.11 smid, 00.07 icking, 97.11 oostrum"
}

@inproceedings{bgo-pbsp-93
, author =	"M. de Berg and M. de Groot and M. Overmars"
, title =	"Perfect binary space partitions"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"109--114"
, precedes =	"bgo-pbsp-97"
, cites =	"bos-cvdo-92, fkn-vsgpt-80, go-nhpcg-93, hs-asdch-90, ol-mcp-81, ow-nmcvg-88, py-ebsph-90, py-obspo-92, ZZZ"
, update =	"98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
}

@article{bgo-pbsp-97
, author =	"M. de Berg and M. de Groot and M. Overmars"
, title =	"Perfect binary space partitions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"81--91"
, succeeds =	"bgo-pbsp-93"
, update =	"97.03 devillers"
}

@inproceedings{bghosst-rgdu-93
, author =	"Mark de Berg and Leonidas Guibas and Dan Halperin and Mark Overmars and Otfried Schwarzkopf and Micha Sharir and Monique Teillaud"
, title =	"Reaching a Goal with Directional Uncertainty"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"1--10"
, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
, precedes =	"bghosst-rgdu-95"
, update =	"98.07 bibrelex, 95.09 devillers, 94.05 devillers+schwarzkopf+sharir+smid, 93.09 milone+mitchell"
}

@article{bghosst-rgdu-95
, author =	"Mark de Berg and Leonidas Guibas and Dan Halperin and Mark Overmars and Otfried Schwarzkopf and Micha Sharir and Monique Teillaud"
, title =	"Reaching a Goal with Directional Uncertainty"
, journal =	"Theoret. Comput. Sci."
, volume =	140
, year =	1995
, pages =	"301--317"
, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
, succeeds =	"bghosst-rgdu-93"
, update =	"97.11 bibrelex, 95.09 devillers+schwarzkopf"
}

@inproceedings{bgh-vdt3s-94
, author =	"M. de Berg and Leonidas J. Guibas and D. Halperin"
, title =	"Vertical Decompositions for Triangles in $3$-Space"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"1--10"
, cites =	"ass-sulbl-89, as-tsbac-90, as-car-92, bo-arcgi-79, c-cpplb-84, c-ochan-91, ce-oails-92, cegs-sessr-89, cegs-lscaa-89, cf-dvrsi-90, cegsw-ccbac-90, c-racpq-88, cs-arscg-89, gt-dtdpl-91, gs-dfbt-78, gs-pmgsc-85, hs-nqbmp-93, hs-ndssg-84, hw-ensrq-87, h-fuenl-89, m-rsehc-92, m-hsrrm-91, m-rmstf-91, ps-cgi-85, pt-eplcs-92, s-atubl-93, t-dsna-83, ws-prnds-88, ZZZ"
, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
}

@article{bgh-vdt3s-96
, author =	"M. de Berg and Leonidas J. Guibas and D. Halperin"
, title =	"Vertical decompositions for triangles in $3$-space"
, journal =	"Discrete Comput. Geom."
, volume =	15
, year =	1996
, pages =	"35--61"
, update =	"98.03 mitchell, 96.05 smid"
}

@techreport{bhok-sanvp-91
, author =	"M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
, title =	"Sparse arrangements and the number of views of polyhedral scenes"
, type =	"manuscript"
, year =	1991
, precedes =	"bhok-sanvp-92, bhok-sanvp-97"
, update =	"98.11 bibrelex"
}

@techreport{bhok-sanvp-92
, author =	"M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
, title =	"Sparse arrangements and the number of views of polyhedral scenes"
, type =	"Technical {Report}"
, number =	"RUU-CS-92-24"
, institution =	"Dept. Comput. Sci., Univ. Utrecht"
, address =	"Utrecht, Netherlands"
, year =	1992
, succeeds =	"bhok-sanvp-91"
, precedes =	"bhok-sanvp-97"
, update =	"98.11 bibrelex, 97.07 devillers, 94.05 devillers+schwarzkopf, 93.09 milone+mitc hell"
}

@article{bhok-sanvp-97
, author =	"M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
, title =	"Sparse arrangements and the number of views of polyhedral scenes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"175--195"
, succeeds =	"bhok-sanvp-92,bhok-sanvp-91"
, update =	"98.11 bibrelex, 97.07 devillers"
}

@inproceedings{bhosk-ershs-91
, author =	"M. de Berg and D. Halperin and M. Overmars and J. Snoeyink and M. van Kreveld"
, title =	"Efficient ray shooting and hidden surface removal"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"21--30"
, keywords =	"ray tracing, hidden surface removal, random sampling"
, cites =	"as-anspt-91, ako-iqco-91, as-zasha-91, cegpsss-ccclr-90, cegs-lscaa-89, cg-vippg-89, csw-qoubs-90, cj-sersi-91, cs-vppt-89, bo-hsrap-90, de-ssio-87, dk-ladsc-85, e-acg-87, m-aodq-90, m-wcohs-87, os-oshsr-89, p-srs3d-90, p-nrrsi-91, sml-rtatp-88, s-pcg-88, ZZZ"
, update =	"97.11 bibrelex"
}

@article{bhosk-ershs-94
, author =	"M. de Berg and D. Halperin and M. Overmars and J. Snoeyink and M. van Kreveld"
, title =	"Efficient ray shooting and hidden surface removal"
, journal =	"algo"
, volume =	12
, year =	1994
, pages =	"30--53"
, succeeds =	"bhosk-ershs-91"
}

@inproceedings{bkosv-mmp-98
, author =	"Mark de Berg and Matthew Katz and Mark Overmars and A. Frank van der Stappen and Jules Vleugels"
, title =	"Models and Motion Planning"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"83--94"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

@inproceedings{bksv-rimga-97
, author =	"M. de Berg and M. J. Katz and A. F. van der Stappen and J. Vleugels"
, title =	"Realistic Input Models for Geometric Algorithms"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"294--303"
, cites =	"aks-cdorp-95, am-rsss-92, afkmnsu-ampcb-92, cg-fc1ds-86, cg-ssvip-88, b-lsbsp-95, fpt-opcpa-81, lw-vdllm-80, mmpssw-ftdlm-91, mms-qsrs-94, os-rsplf-96, py-ebsph-90, ps-cgi-85, sv-rslde-96, s-mpafo-94, so-mpelo-95, k-fpfcu-93, v-ffrim-97, ZZZ"
, update =	"99.03 bibrelex, 98.07 bibrelex, 97.11 katz, 97.07 efrat"
}

@techreport{bk-rdlsn-93
, author =	"M. de Berg and M. van Kreveld"
, title =	"Rectilinear decompositions with low stabbing number"
, type =	"Tech. {Report}"
, number =	"RUU-CS-93-25"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1993
, update =	"95.01 smid, 94.05 schwarzkopf"
}

@article{bk-rdlsn-94
, author =	"M. de Berg and M. van Kreveld"
, title =	"Rectilinear decompositions with low stabbing number"
, journal =	"Inform. Process. Lett."
, volume =	52
, year =	1994
, pages =	"215--221"
, update =	"95.01 smid"
}

@incollection{bk-tawfg-93
, author =	"Mark de Berg and Marc van Kreveld"
, title =	"Trekking in the Alps Without Freezing or Getting Tired"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"121--132"
, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-02.ps.gz"
, update =	"94.05 schwarzkopf, 94.01 smid, 93.09 milone+mitchell"
}

@article{bk-tafgt-97
, author =	"M. de Berg and M. van Kreveld"
, title =	"Trekking in the alps without freezing or getting tired"
, journal =	"Algorithmica"
, volume =	18
, year =	1997
, pages =	"306--323"
, update =	"97.11 oostrum"
}

@inproceedings{bkn-spqrw-91
, author =	"M. de Berg and M. van Kreveld and Bengt J. Nilsson"
, title =	"Shortest path queries in rectilinear worlds of higher dimension"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"51--60"
, cites =	"c-crmp-87, cr-nlbtr-87, c-tpca-82, c-tsplt-90i, cg-fc1ds-86, ch-spp-90, ckv-rsptp-87, b-rld-91, bkno-fsppo-90i, rlw-rsppr-89, d-ntpcg-59, k-ealdp-89, ll-fmrdp-81, l-prp-78, lp-esppr-84, lpsssstwy-clcsp-87, m-mdscg-84, m-oasrp-89, mmp-dgp-87, mrw-mlpop-90, os-cgd3p-89, rs-spesp-85, s-cg-78, ss-spps-86, s-mlppr-87, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{bkno-fsppo-90t
, author =	"M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
, title =	"Finding shortest paths in the presence of orthogonal obstacles using a combined {$L_{1}$} and link metric"
, type =	"Report"
, number =	"RUU-CS-90-20"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1990
, precedes =	"bkno-fsppo-90i"
, update =	"98.07 bibrelex, 98.03 mitchell, 94.05 schwarzkopf"
}

@inproceedings{bkno-fsppo-90i
, author =	"M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
, title =	"Finding shortest paths in the presence of orthogonal obstacles using a combined {$L_{1}$} and link metric"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"213--224"
, keywords =	"shortest paths, rectilinear paths, rectilinear obstacles, combined metric"
, succeeds =	"bkno-fsppo-90t"
, update =	"98.03 mitchell, 94.05 schwarzkopf"
, annote =	"They consider rectilinear paths among $n$ axis-parallel
line segment obstacles (possibly crossing).  They preprocess in time
$O(n^2)$, space $O(n\log n)$, for single-source shortest paths in
query time $O(\log n)$.  Distance is measured in a combined metric:
linear combination of rectilinear link distance and $L_1$ path length"
}

@article{bkno-spqrw-92
, author =	"M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
, title =	"Shortest path queries in rectilinear worlds"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"287--309"
, keywords =	"shortest paths, rectilinear paths, rectilinear obstacles, combined metric"
, update =	"98.03 mitchell"
, abstract =	"
In this paper, a data structure is given for two and higher
dimensional shortest path queries.  For a set of $n$ axis-parallel
rectangles in the plane, or boxes in $d$-space, and a fixed target, it
is possible with this structure to find a shortest rectilinear path
avoiding all rectangles or boxes from any point to this target.
Alternatively, it is possible to find the length of the path.  The
metric considered is a generalization of the $L_1$-metric and the link
metric, where the length of a path is its $L_1$-length plus some
(fixed) constant times the number of turns on the path.  The data
structure has size $O((n\log n)^{d-1})$, and a query takes
$O(\log^{d-1} n)$ time (plus the output size if the path must be
reported).  As a byproduct, a relatively simple solution to the single
shot problem is obtained; the shortest path between two given points
can be computed in time $O(n^d \log n)$ for $d\geq 3$ and in time
$O(n^2)$ in the plane."
}

@article{bkoo-stses-97
, author =	"M. de Berg and M. van Kreveld and R. van Oostrum and M. Overmars"
, title =	"Simple traversal of a subdivision without extra storage"
, journal =	"International Journal on Geographical Information Science"
, volume =	11
, year =	1997
, pages =	"359--373"
, update =	"97.11 oostrum"
}

@book{bkos-cgaa-97
, author =	"Mark de Berg and Marc van Kreveld and Mark Overmars and Otfried Schwarzkopf"
, title =	"Computational Geometry: Algorithms and Applications"
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1997
, isbn =	"3-540-61270-X"
, keywords =	"textbook"
, update =	"98.03 agarwal+mitchell, 97.11 oostrum+orourke"
}

@book{bkos-cgaa-00
, author =	"Mark de Berg and Marc van Kreveld and Mark Overmars and Otfried Schwarzkopf"
, title =	"Computational Geometry: Algorithms and Applications"
, edition =	"2nd"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	2000
, succeeds =	"bkos-cgaa-97"
, update =	"01.04 vismara"
}

@techreport{bkos-cge-95
, author =	"M. de Berg and M. van Kreveld and M. Overmars and O. Schwarzkopf"
, title =	"Computational Geometry by Example"
, type =	"Manuscript"
, institution =	"??"
, year =	1995
, update =	"97.11 bibrelex"
}

@inproceedings{bks-nass-95
, author =	"M. de Berg and M. van Kreveld and S. Schirra"
, title =	"A new approach to subdivision simplification"
, booktitle =	"Proc. 12th Internat. Sympos. Comput.-Assist. Cartog."
, year =	1995
, pages =	"79--88"
, keywords =	"line simplification, generalization"
, update =	"96.09 kreveld"
}

@inproceedings{bks-lsctp-95
, author =	"M. de Berg and M. van Kreveld and S. Schirra"
, title =	"Line simplification consistent with tag points"
, booktitle =	"Proc. Auto-Carto 12"
, year =	1995
, note =	"to appear"
, update =	"97.11 bibrelex"
}

@article{bkss-plzkf-96
, author =	"M. de Berg and M. van Kreveld and O. Schwarzkopf and J. Snoeyink"
, title =	"Point location in zones of $k$-flats in arrangements"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"131--143"
, keywords =	"zones, arrangements, point location, many cells"
, succeeds =	"bks-plzkf-91i"
, update =	"96.09 devillers+kreveld"
}

@techreport{bks-plzkf-91t
, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
, title =	"Point location in zones of $k$-flats in arrangements"
, type =	"Report"
, number =	"RUU-CS-91-9"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1991
, precedes =	"bks-plzkf-91i"
, update =	"94.05 schwarzkopf"
}

@inproceedings{bks-plzkf-91i
, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
, title =	"Point location in zones of $k$-flats in arrangements"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"228--232"
, succeeds =	"bks-plzkf-91t"
, cites =	"bks-plzkf-91t, csw-qoubs-90, c-narsc-87, cs-arscg-89, e-acg-87, eos-calha-86, m-aodq-90, m-lpltw-84, hw-ensrq-87, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{bks-ttdpl-91
, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
, title =	"Two- and three-dimensional point location in rectangular subdivisions"
, type =	"Report"
, number =	"RUU-CS-91-29"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1991
, precedes =	"bks-ttdpl-92"
, update =	"94.05 schwarzkopf"
}

@inproceedings{bks-ttdpl-92
, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
, title =	"Two- and three-dimensional point location in rectangular subdivisions"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"352--363"
, succeeds =	"bks-ttdpl-91"
, precedes =	"bks-ttdpl-95"
, update =	"95.05 smid"
}

@article{bks-ttdpl-95
, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
, title =	"Two- and three-dimensional point location in rectangular subdivisions"
, journal =	"J. Algorithms"
, volume =	18
, year =	1995
, pages =	"256--277"
, succeeds =	"bks-ttdpl-92"
, update =	"95.05 smid"
}

@inproceedings{bms-plpco-93
, author =	"M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Piecewise Linear Paths Among Convex Obstacles"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"505--514"
, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1993/1993-20.ps.gz"
, keywords =	"configuration space, motion planning, convex, robotics"
, precedes =	"bms-plpco-95"
, update =	"96.09 agarwal, 95.09 aronov, 94.05 devillers+schwarzkopf, 93.09 milone+mitchell, 93.05 schwarzkopf"
, abstract =	"Let $B$ be a set of $n$ arbitrary (possibly intersecting)
		convex obstacles in ${\bf R}^d$. It is shown that any
		two points which can be connected by a path avoiding
		the obstacles can also be connected by a path
		consisting of $O(n^{(d-1)\lfloor{d/2+1}\rfloor})$
		segments. The bound cannot be improved below
		$\Omega(n^d)$. For disjoint obstacles, a $\Theta(n)$
		bound is proved. By a well-known reduction, the
		general case result also upper bounds the complexity
		for a translational motion of an arbitrary convex
		robot among convex obstacles.  In the planar case,
		asymptotically tight bounds and efficient algorithms
		are given."
}

@article{bms-plpco-95
, author =	"M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Piecewise Linear Paths Among Convex Obstacles"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"9--29"
, keywords =	"configuration space, motion planning, convex, robotics"
, succeeds =	"bms-plpco-93"
, update =	"96.09 agarwal, 95.09 aronov"
}

@inproceedings{bmow-cat-96
, author =	"M. de Berg and H. Meijer and M. Overmars and G. Wilfong"
, title =	"Computing the angularity tolerance"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"331--336"
, precedes =	"bmow-cat-98"
, update =	"98.11 devillers, 97.03 agarwal, 96.09 mitchell"
}

@article{bmow-cat-98
, author =	"M. de Berg and H. Meijer and M. Overmars and G. Wilfong"
, title =	"Computing the angularity tolerance"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"467--"
, succeeds =	"bmow-cat-96"
, update =	"98.11 devillers"
}

@inproceedings{boo-stswe-96
, author =	"Mark de Berg and Ren{\'e} van Oostrum and Mark Overmars"
, title =	"Simple Traversal of a Subdivision Without Extra Storage"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C5--C6"
, cites =	"af-rse-92, bkos-cge-95, egs-oplms-86, fr-cfecp-94, gc-sontr-86, gcr-acmut-77, gm-tsocc-78, pm-aiecg-90, pm-tdds-90, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
}

@proceedings{bo-ewcg-92
, title =	"Abstracts 8th European Workshop Comput. Geom."
, editor =	"Mark de Berg and Mark Overmars"
, nickname =	"CG '92"
, site =	"Utrecht"
, volume =	"RUU-CS-92-10"
, publisher =	"Utrecht University"
, year =	1992
, update =	"00.03 bibrelex"
}

@inproceedings{bo-dpo-88
, author =	"M. de Berg and M. Overmars"
, title =	"Dominance in the presence of obstacles"
, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '88"
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"190--201"
, keywords =	"domination, maximal elements, rectangular visibility"
}

@article{bo-hsrco-92
, author =	"M. de Berg and M. Overmars"
, title =	"Hidden surface removal for $c$-oriented polyhedra"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	5
, year =	1992
, pages =	"247--268"
, keywords =	"hidden surface removal, $c$-oriented polyhedra, output-sensitive algorithms"
, succeeds =	"bo-hsrap-90"
}

@article{bok-fcbsb-90
, author =	"M. de Berg and M. Overmars and M. van Kreveld"
, title =	"Finding complete bipartite subgraphs in bipartite graphs"
, journal =	"Algorithms Rev."
, volume =	1
, number =	2
, year =	1990
, pages =	"79--85"
}

@inproceedings{bos-cvdo-92
, author =	"M. de Berg and M. Overmars and O. Schwarzkopf"
, title =	"Computing and verifying depth orders"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"138--145"
, keywords =	"hidden line/surface elimination, three-dimensional"
, cites =	"am-rsps-91, am-dhsrr-91, as-anps-91, c-tsplt-90i, cegpsss-ccclr-90, csw-qoubs-90, b-doshs-91, bhosk-ershs-91, bo-hsrap-90, fkn-vsgpt-80, go-nasch-87, hb-cg-86, kos-ehsro-91, m-ept-91, n-tsott-86, os-oshsr-89, py-ebsph-90, pvy-osgpv-90, ZZZ"
, update =	"97.11 bibrelex, 93.05 schwarzkopf"
}

@article{bos-cvdo-94
, author =	"M. de Berg and M. Overmars and O. Schwarzkopf"
, title =	"Computing and verifying depth orders"
, journal =	"sicomp"
, volume =	23
, year =	1994
, pages =	"437--446"
, succeeds =	"bos-cvdo-92"
, update =	"95.01 matousek"
}

@inproceedings{bo-hsrap-90
, author =	"M. de Berg and M. H. Overmars"
, title =	"Hidden surface removal for axis-parallel polyhedra"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"252--261"
, keywords =	"hidden surface removal, ray tracing"
, succeeds =	"bo-hsrco-90"
, precedes =	"bo-hsrco-92"
}

@techreport{bo-hsrco-90
, author =	"M. de Berg and M. H. Overmars"
, title =	"Hidden surface removal for $c$-oriented polyhedra"
, type =	"Report"
, number =	"RUU-CS-90-33"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1990
, precedes =	"bo-hsrap-90"
, update =	"94.05 schwarzkopf"
}

@techreport{bs-ca-92
, author =	"M. de Berg and O. Schwarzkopf"
, title =	"Cuttings and applications"
, type =	"Report"
, number =	"RUU-CS-92-26"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, month =	aug
, year =	1992
, keywords =	"cuttings, random sampling, hopcroft's problem, counting intersections, point location"
, precedes =	"bs-ca-95"
, update =	"96.09 devillers, 94.05 schwarzkopf"
}

@article{bs-ca-95
, author =	"M. de Berg and O. Schwarzkopf"
, title =	"Cuttings and applications"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"343--355"
, keywords =	"cuttings, random sampling, segment intersection counting, Hopcroft's problem, point location"
, succeeds =	"bs-ca-92"
, update =	"96.09 devillers"
}

@article{bco-gadp-92
, author =	"M. T. de Berg and S. Carlsson and M. H. Overmars"
, title =	"A general approach to dominance in the plane"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"274--296"
, keywords =	"domination, rectangular visibility"
}

@article{b-ttgt-57
, author =	"B. Berge"
, title =	"Two Theorems in Graph Theroy"
, journal =	"Proc. Nat. Acad. Sci. USA"
, volume =	43
, year =	1957
, pages =	"842--844"
, update =	"97.11 bibrelex"
}

@book{b-g-85
, author =	"C. Berge"
, title =	"Graphs"
, publisher =	"North-Holland"
, year =	1985
, update =	"97.11 bibrelex"
}

@article{b-slcmd-58
, author =	"C. Berge"
, title =	"Sur le couplage maximum d'un graphe"
, journal =	"C. R. Acad. Sciences, Paris"
, volume =	247
, year =	1958
, pages =	"258--259"
, update =	"98.07 bibrelex"
}

@book{bc-tpg-84
, title =	"Topics on Perfect Graphs"
, editor =	"C. Berge and V. Chv{\'a}tal"
, series =	"Ann. Discrete Math."
, volume =	21
, publisher =	"North-Holland"
, year =	1984
, update =	"98.11 bibrelex"
}

@book{bpv-ocdat-84
, author =	"P. Berge and Y. Pomeau and C. Vidal"
, title =	"Order within Chaos: towards a Deterministic Approach to Turbulence"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1984
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@article{v-frgic-99
, author =	"G. Van den Bergen"
, title =	"A Fast Robust GJK Implementation for Collision Detection of Convex Objects"
, journal =	"J. Graphics Tools"
, volume =	4
, number =	2
, year =	1999
, pages =	"7--25"
, update =	"00.03 held"
}

@inproceedings{bkl-rtdma-96
, author =	"Bonnie Berger and Jon Kleinberg and Tom Leighton"
, title =	"Reconstructing a Three-Dimensional Model with Arbitrary Errors"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '96"
, site =	"Philadelphia, PA"
, month =	may
, year =	1996
, pages =	"449--458"
, update =	"00.03 smid, 98.07 bibrelex, 98.03 mitchell"
}

@article{br-slwin-91
, author =	"B. Berger and J. Rompel"
, title =	"Simulating {$(\log^c n)$}-Wise Independence in {NC}"
, journal =	"J. ACM"
, volume =	38
, number =	4
, year =	1991
, pages =	"1026--1046"
, update =	"96.09 orourke"
}

@inproceedings{brs-enasc-89
, author =	"B. Berger and J. Rompel and P. W. Shor"
, title =	"Efficient {NC} algorithms for set cover with applications to learning and geometry"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, volume =	30
, year =	1989
, pages =	"54--59"
, update =	"93.09 matousek"
}

@inproceedings{bs-aamas-90
, author =	"B. Berger and P. Shor"
, title =	"Approximation Algorithms for the Maximum Acyclic Subgraph Problem"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"236--243"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{b-g3cep-74
, author =	"M. Berger"
, title =	"G{\'e}om{\'e}trie 3. convexes et polytopes, poly{\`e}dres r{\'e}guliers, aires et volumes"
, publisher =	"Fernand Nathan"
, address =	"Paris"
, year =	1974
, update =	"94.05 devillers"
}

@book{b-g-77
, author =	"M. Berger"
, title =	"G{\'e}om{\'e}trie (vols. 1-5)"
, publisher =	"Fernand Nathan"
, address =	"Paris"
, year =	1977
, update =	"96.09 devillers"
}

@book{b-g-87
, author =	"M. Berger"
, title =	"Geometry (vols. 1-2)"
, publisher =	"Springer-Verlag"
, year =	1987
, succeeds =	"b-g-77"
, update =	"96.09 devillers"
}

@book{bg-gd-72
, author =	"M. Berger and B. Gostiaux"
, title =	"G{\'e}om{\'e}trie diff{\'e}rentielle"
, publisher =	"Armand Collin"
, year =	1972
, update =	"97.11 bibrelex"
}

@article{br-apcgg-91
, author =	"M. Berger and I. Rigoutsos"
, title =	"An algorithm for point clustering and grid generation"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	21
, number =	5
, year =	1991
, pages =	"1278--1286"
, update =	"98.07 agarwal"
}

@article{b-udp-66
, author =	"R. Berger"
, title =	"The undecidability of the domino problem"
, journal =	"Memoirs Amer. Math. Soc."
, volume =	66
, year =	1966
, update =	"97.11 bibrelex"
}

@article{bsv-fpafc-96
, author =	"O. Berkman and B. Schieber and U. Vishkin"
, title =	"A fast parallel algorithm for finding the convex hull of a sorted point set"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"231--242"
, update =	"96.09 devillers+orourke"
}

@article{b-siec-69
, author =	"E. R. Berlekamp"
, title =	"On subsets with intersections of even cardinality"
, journal =	"Canad. Math. Bull."
, volume =	12
, year =	1969
, pages =	"363--366"
, update =	"98.03 bibrelex"
}

@article{bh-vpius-70
, author =	"J. D. Berman and K. Hanes"
, title =	"Volumes of polyhedra inscribed in the unit sphere $E^3$"
, journal =	"Mathematische Annalen"
, volume =	188
, year =	1970
, pages =	"78--84"
, update =	"97.11 bibrelex"
}

@article{b-lsbls-89
, author =	"Mark Berman"
, title =	"Large sample bias in least squares estimators of a circular arc center and its radius"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	45
, year =	1989
, pages =	"126--128"
, update =	"97.03 agarwal"
}

@incollection{b-olsn-98
, author =	"Piotr Berman"
, title =	"On-line Searching and Navigation"
, editor =	"Amos Fiat and Gerhard Woeginger"
, booktitle =	"Online Algorithms: The State of the Art"
, series =	"Lecture Notes Comput. Sci."
, volume =	1442
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"232--241"
, comments =	"chapter 10 of fw-ola-98"
, update =	"02.03 icking, 98.07 icking, 98.03 mitchell"
}

@inproceedings{bbfkrs-rrna-96
, author =	"Piotr Berman and Avrim Blum and Amos Fiat and Howard Karloff and Adi Rosen and Michael Saks"
, title =	"Randomized robot navigation algorithms"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"75--84"
, keywords =	"mobile robot, competitive ratio, shortest paths, randomized strategies, rectangular obstacles"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@inproceedings{bd-arpcp-92
, author =	"P. Berman and B. DasGupta"
, title =	"Approximating the rectilinear polygon cover problems"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"229--235"
, cites =	"ckss-crr-81, co-srrcp-87, cr-cpih-88, f-pgslh-89, fk-acrri-84, hk-nammb-73, l-pnrh-82, mc-ivs-80, os-snhpd-83, lllmp-tddo2-79, bd-rarpc-92, bs-caisp-92, l-ocopg-85, o-mdrp-82, almss-iap-92, l-bbpcp-88, m-ncscp-78, mrs-pgocc-88, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{bd-rarpc-92
, author =	"P. Berman and B. DasGupta"
, title =	"Results on Approximating of the Rectilinear Cover Problem"
, type =	"Technical Report"
, number =	"CS-92-07"
, institution =	"Pennsylvania State University"
, month =	apr
, year =	1992
, update =	"98.07 bibrelex"
}

@techreport{bk-rnwco-94
, author =	"Piotr Berman and M. Karpinski"
, title =	"Randomized Navigation to a Wall through Convex Obstacles"
, type =	"Technical Report"
, number =	"85118-CS"
, institution =	"Bonn University"
, year =	1994
, update =	"98.03 mitchell"
}

@article{bl-nopav-97
, author =	"P. Berman and A. Lingas"
, title =	"A nearly optimal parallel algorithm for the {Voronoi} diagram of a convex polygon"
, journal =	"Theoret. Comput. Sci."
, volume =	174
, year =	1997
, pages =	"193--202"
, update =	"97.07 smid"
}

@inproceedings{br-iastp-92
, author =	"P. Berman and V. Ramaiyer"
, title =	"Improved approximations for the {Steiner} tree problem"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1992
, pages =	"325--334"
, update =	"98.07 bibrelex"
}

@article{br-iastp-94
, author =	"P. Berman and V. Ramaiyer"
, title =	"Improved approximations for the {Steiner} tree problem"
, journal =	"J. Algorithms"
, volume =	17
, year =	1994
, pages =	"381--408"
, update =	"95.01 smid"
}

@article{bs-caisp-92
, author =	"P. Berman and G. Schnitger"
, title =	"On the complexity of approximating the Independent Set Problem"
, journal =	"Inform. Comput."
, volume =	96
, number =	1
, month =	jan
, year =	1992
, pages =	"77--94"
, update =	"98.07 bibrelex"
}

@incollection{b-hg-78
, author =	"J. C. Bermond"
, title =	"Hamiltonian Graphs"
, editor =	"L. W. Beineke and R. J. Wilson"
, booktitle =	"Selected Topics in Graph Theory"
, publisher =	"Academic Press"
, address =	"London, UK"
, year =	1978
, update =	"98.03 bibrelex"
}

@article{b-acpqh-93
, author =	"M. Bern"
, title =	"Approximate closest-point queries in high dimensions"
, journal =	"Inform. Process. Lett."
, volume =	45
, year =	1993
, pages =	"95--99"
, update =	"93.05 smid"
}

@inproceedings{b-ct-93
, author =	"M. Bern"
, title =	"Compatible tetrahedralizations"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"281--288"
, cites =	"agss-ltacv-89, ae-tpss-87, be-mgot-92t, c-cpplb-84, c-oaitd-92, cegs-dwclp-92, cp-tncp-90, de-iabns-93, dk-fdpi-82, dc-chtt-91, epw-tpstd-90, e-dtdlp-92, gp-cdpb-88, hs-cpmfl-92, k-osps-83, l-tsfpp-11, rs-dttdn-92, s-udzvd-28, g-vcem-77, h-fssp-81, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{b-feast-90
, author =	"M. Bern"
, title =	"Faster exact algorithms for {Steiner} trees in planar networks"
, journal =	"Networks"
, volume =	20
, number =	1
, year =	1990
, pages =	"109--120"
, keywords =	"Steiner tree"
, update =	"95.05 korneenko"
}

@inproceedings{b-hsrr-88
, author =	"M. Bern"
, title =	"Hidden surface removal for rectangles"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"183--192"
, precedes =	"b-hsrr-90"
, cites =	"cg-fc1ds-86, dsst-mdsp-86, e-ndrs-81, em-ioo-81, fmn-dgds-85, g-pahle-87i, gmpr-nrll-77, go-nasch-85, m-pst-81, m-wcohs-87, m-ceicw-86, ps-cgi-85, pvy-cavsi-88, st-pplup-86, ekz-diepq-77, wl-arrcd-85, ZZZ"
, update =	"98.03 bibrelex, 95.05 franciosa"
}

@article{b-hsrr-90
, author =	"M. Bern"
, title =	"Hidden surface removal for rectangles"
, journal =	"J. Comput. Syst. Sci."
, volume =	40
, year =	1990
, pages =	"49--69"
, succeeds =	"b-hsrr-88"
, update =	"95.05 franciosa"
}

@incollection{b-t-97
, author =	"M. Bern"
, title =	"Triangulations"
, chapter =	22
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"413--428"
, update =	"97.11 orourke"
}

@article{bb-psscs-91
, author =	"M. Bern and D. Bienstock"
, title =	"Polynomially solvable special cases of the {Steiner} tree problem in planar networks"
, journal =	"Ann. Oper. Res."
, volume =	33
, number =	"1--4"
, year =	1991
, pages =	"405--418"
, keywords =	"Steiner tree"
, update =	"95.05 korneenko"
}

@techreport{bcer-dbmgh-93
, author =	"M. Bern and L. P. Chew and D. Eppstein and J. Ruppert"
, title =	"Dihedral Bounds for Mesh Generation in High Dimensions"
, type =	"Manuscript"
, institution =	"??"
, year =	1993
, update =	"98.03 bibrelex"
}

@inproceedings{bcer-dbmgh-95
, author =	"Marshall Bern and Paul Chew and David Eppstein and Jim Ruppert"
, title =	"Dihedral Bounds for Mesh Generation in High Dimensions"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"189--196"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@inproceedings{bdeh-dpaomt-98
, author =	"M. Bern and E. D. Demaine and D. Eppstein and B. Hayes"
, title =	"A disk-packing algorithm for an origami magic trick"
, booktitle =	"Proc. Internat. Conf. Fun with Algorithms"
, site =	"Elba, Italy"
, month =	jun
, year =	1998
, update =	"00.03 orourke"
}

@inproceedings{bdek-up-99
, author =	"M. Bern and E. D. Demaine and D. Eppstein and E. Kuo"
, title =	"Ununfoldable Polyhedra"
, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
, year =	1999
, pages =	"13--16"
, note =	"Full version: https://arXiv.org/abs/cs/9908003/"
, url =	"http://www.cs.ubc.ca/conferences/CCCG/elec_proc/elecproc.html"
, update =	"01.11 orourke, 00.03 orourke"
}

@article{bdems-uptf-01
, author =	"M. Bern and E. D. Demaine and D. Eppstein and E. Kuo and A. Mantler and J. Snoeyink"
, title =	"Ununfoldable Polyhedra with Convex Faces"
, journal =	"Comput. Geom. Theory Appl."
, volume =	"??"
, year =	2001
, pages =	"?--?"
, update =	"01.11 orourke, 01.04 orourke"
}

@inproceedings{bde-tpwla-92
, author =	"M. Bern and D. Dobkin and D. Eppstein"
, title =	"Triangulating polygons without large angles"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"222--231"
, precedes =	"bde-tpwla-95"
, cites =	"ba-acfem-76, bgr-ntp-88, b-casrd-83, beemt-eiot-92i, be-psntp-91, be-mgot-92i, beg-pgmg-90, et-ubcdt-92, etw-otama-90, e-amwt-92, gcr-acmut-77, g-eblit-75, ms-cinap-92, mv-qmgtd-92i, sdhk-lht-91, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@article{bde-tpwla-95
, author =	"M. Bern and D. Dobkin and D. Eppstein"
, title =	"Triangulating polygons without large angles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"171--192"
, keywords =	"computational geometry, mesh generation, triangulation, angle condition"
, succeeds =	"bde-tpwla-92"
, update =	"96.09 devillers"
}

@inproceedings{bdeg-vmpv-90
, author =	"M. Bern and D. Dobkin and D. Eppstein and R. Grossman"
, title =	"Visibility with a moving point of view"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"107--117"
, update =	"95.01 smid"
}

@article{bdeg-vmpv-94
, author =	"M. Bern and D. Dobkin and D. Eppstein and R. Grossman"
, title =	"Visibility with a moving point of view"
, journal =	"Algorithmica"
, volume =	11
, year =	1994
, pages =	"360--378"
, keywords =	"visibility"
, update =	"94.09 orourke"
}

@techreport{beemt-eiot-92t
, author =	"M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
, title =	"Edge-insertion for optimal triangulations"
, type =	"Tech. Report"
, number =	"EDC UILU-ENG-92-1702"
, institution =	"Univ. Illinois"
, address =	"Urbana, IL"
, year =	1992
, precedes =	"beemt-eiot-93"
, update =	"95.05 korneenko"
}

@inproceedings{beemt-eiot-92i
, author =	"M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
, title =	"Edge-insertion for optimal triangulations"
, booktitle =	"Proc. Latin Amer. Sympos. Theoret. Informatics"
, nickname =	"LATIN '92"
, site =	"Sao Paulo"
, series =	"Lecture Notes Comput. Sci."
, volume =	583
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"46--60"
, precedes =	"beemt-eiot-93"
, update =	"99.11 bibrelex, 95.05 korneenko"
}

@article{beemt-eiot-93
, author =	"M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
, title =	"Edge insertion for optimal triangulations"
, journal =	"Discrete Comput. Geom."
, volume =	10
, number =	1
, year =	1993
, pages =	"47--65"
, keywords =	"points, triangulation"
, succeeds =	"beemt-eiot-92t, beemt-eiot-92i"
, update =	"95.05 korneenko"
}

@incollection{be-aagp-97
, author =	"M. Bern and D. Eppstein"
, title =	"Approximation algorithms for geometric problems"
, editor =	"Dorit S. Hochbaum"
, booktitle =	"Approximation Algorithms for NP-Hard Problems"
, publisher =	"PWS Publishing Company"
, address =	"Boston, MA"
, year =	1997
, pages =	"296--345"
, succeeds =	"be-gaa-95"
, update =	"98.07 agarwal, 97.11 bibrelex, 97.07 smid, 97.03 agarwal+held, 95.09 mitchell"
}

@misc{be-gaa-95
, author =	"M. Bern and D. Eppstein"
, title =	"Geometric approximation algorithms"
, year =	1995
, note =	"manuscript"
, precedes =	"be-aagp-97"
, update =	"97.11 bibrelex, 95.05 agarwal"
}

@techreport{be-mgot-92t
, author =	"M. Bern and D. Eppstein"
, title =	"Mesh generation and optimal triangulation"
, type =	"Tech. Report"
, number =	"CSL-92-1"
, institution =	"Xerox PARC"
, address =	"Palo Alto, CA"
, year =	1992
, precedes =	"be-mgot-92i"
}

@incollection{be-mgot-92i
, author =	"M. Bern and D. Eppstein"
, title =	"Mesh generation and optimal triangulation"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"23--90"
, keywords =	"survey paper, mesh generation, optimal triangulation, Steiner triangulation"
, succeeds =	"be-mgot-92t"
, precedes =	"be-mgot-95"
, update =	"98.07 icking, 93.09 erickson"
}

@incollection{be-mgot-95
, author =	"M. Bern and D. Eppstein"
, title =	"Mesh generation and optimal triangulation"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"47--123"
, keywords =	"survey paper, mesh generation, optimal triangulation, Steiner triangulation"
, succeeds =	"be-mgot-92i"
, update =	"98.07 icking, 97.11 bibrelex, 97.03 pocchiola"
}

@inproceedings{be-mrd-00
, author =	"Marshall Bern and David Eppstein"
, title =	"Multivariate Regression Depth"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"315--321"
, update =	"00.11 jones"
}

@inproceedings{be-psntp-91
, author =	"M. Bern and D. Eppstein"
, title =	"Polynomial-size nonobtuse triangulation of polygons"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"342--350"
, keywords =	"triangulation, polygons"
, precedes =	"be-psntp-92"
, cites =	"bgr-ntp-88, beg-pgmg-90, bg-dpd-91, c-cdt-87, etw-otama-90, e-fpdtm-90, f-cfemg-72, g-dpnet-84, ll-gdtpg-86, ls-tacdt-80, ms-getcc-88, sdhk-lht-91, s-let-78, ZZZ"
, update =	"97.11 bibrelex"
}

@article{be-psntp-92
, author =	"M. Bern and D. Eppstein"
, title =	"Polynomial-size nonobtuse triangulation of polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"241--255, 449--450"
, keywords =	"mesh generation, triangulation, angle condition"
, succeeds =	"be-psntp-91"
, update =	"96.09 devillers"
}

@inproceedings{be-wcbsg-93
, author =	"M. Bern and D. Eppstein"
, title =	"Worst-case bounds for subadditive geometric graphs"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"183--188"
, cites =	"akt-om-84, gp-smt-68, k-hlcet-89, s-rpmbp-85, s-lbrst-91, s-wcmrs-92, ss-piets-92, s-sefnl-81, s-pwcac-90, ss-wcgmu-90, ss-wcgrs-89, u-cav-92, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
}

@misc{be-ecct-99
, author =	"M. Bern and D. Eppstein and P. K. Agarwal and N. Amenta and P. Chew and T. Dey and D. P. Dobkin and H. Edelsbrunner and C. Grimm and L. J. Guibas and J. Harer and J. Hass and A. Hicks and C. K. Johnson and G. Lerman and D. Letscher and P. Plassmann and E. Sedgwick and J. Snoeyink and J. Weeks and C. Yap and D. Zorin"
, title =	"Emerging Challenges in Computational Topology"
, year =	1999
, note =	"Report on an NSF Workshop on Computational Topology,
        June 11-12, Miami Beach, FL."
, update =	"01.07 orourke"
}

@inproceedings{beg-pgmg-90
, author =	"M. Bern and D. Eppstein and J. Gilbert"
, title =	"Provably good mesh generation"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"231--241"
, keywords =	"VLSI design"
, update =	"98.03 smid"
}

@article{beg-pgmg-94
, author =	"M. Bern and D. Eppstein and J. Gilbert"
, title =	"Provably good mesh generation"
, journal =	"J. Comput. Syst. Sci."
, volume =	48
, year =	1994
, pages =	"384--409"
, update =	"98.03 smid"
}

@inproceedings{beghs-cpaw-95
, author =	"M. Bern and D. Eppstein and L. J. Guibas and J. Hershberger and S. Suri and J. Wolter"
, title =	"The centroid of points with approximate weights"
, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
, nickname =	"ESA '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	979
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"460--472"
, update =	"01.11 smid"
}

@incollection{bepy-htlp-91
, author =	"M. Bern and D. Eppstein and P. Plassman and F. Yao"
, title =	"Horizon theorems for lines and polygons"
, editor =	"J. Goodman and R. Pollack and W. Steiger"
, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	6
, publisher =	"American Mathematical Society, Association for Computing Machinery"
, address =	"Providence, RI"
, year =	1991
, pages =	"45--66"
, keywords =	"arrangements, horizon, pseudo lines"
, update =	"99.11 bibrelex, 95.09 agarwal"
}

@inproceedings{bet-pcqqt-93
, author =	"Marshall Bern and David Eppstein and Shan-Hua Teng"
, title =	"Parallel Construction of Quadtrees and Quality Triangulations"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"188--199"
, update =	"93.09 milone+mitchell+smid, 93.05 jones"
}

@article{bet-pcqqt-99
, author =	"M. Bern and D. Eppstein and S.-H. Teng"
, title =	"Parallel Construction of Quadtrees and Quality Triangulations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, number =	6
, year =	1999
, pages =	"517--532"
, update =	"00.03 held"
}

@inproceedings{bey-eedt-91i
, author =	"M. Bern and D. Eppstein and F. Yao"
, title =	"The expected extremes in a {Delaunay} triangulation"
, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	510
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"674--685"
}

@article{bey-eedt-91a
, author =	"M. Bern and D. Eppstein and F. Yao"
, title =	"The expected extremes in a {Delaunay} triangulation"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, year =	1991
, pages =	"79--91"
, keywords =	"Delaunay triangulation, probabilistic analysis"
}

@techreport{bg-dpd-91
, author =	"M. Bern and J. Gilbert"
, title =	"Drawing the planar dual"
, type =	"Manuscript"
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{bgrs-olalc-90
, author =	"M. Bern and D. Greene and A. Raghunathan and M. Sudan"
, title =	"Online Algorithms for Locating Checkpoints"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"359--368"
, update =	"95.01 smid, 93.09 milone+mitchell"
}

@inproceedings{bh-cfo-96
, author =	"Marshall Bern and Barry Hayes"
, title =	"The complexity of flat origami"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"175--183"
, keywords =	"NP-hardness, crease patterns, flat folding, flat foldability"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@inproceedings{bmr-lsntp-94
, author =	"M. Bern and S. Mitchell and J. Ruppert"
, title =	"Linear-Size Nonobtuse Triangulation of Polygons"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"221--230"
, cites =	"agss-ltacv-89, ba-acfem-76, bgr-ntp-88, b-pug-90, bs-dsp1s-80, bcer-dbmgh-93, bde-tpwla-92, be-psntp-92, be-mgot-92t, beg-pgmg-90, c-ig-61, et-ubcdt-93, f-savd-87, goy-cvdsl-93, -mrg-92, ms-cinap-92, m-rtpsl-93, m-fctwm-94, m-pabst-93, mkf-arbam-92, ps-cgi-85, r-cag-61, r-nsaq2-93, sg-cmpbf-92, sf-afem-73, t-pssug-90, v-sfepw-93, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@incollection{bp-mg-00
, author =	"Marshall Bern and Paul Plassmann"
, title =	"Mesh Generation"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"291--332"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 6 of su-hcg-00"
}

@inproceedings{bs-pdtcm-96
, author =	"Marshall Bern and Amit Sahai"
, title =	"Pushing Disks Together -- {The} Continuous-Motion Case"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '96"
, year =	1996
, pages =	"119--125"
, update =	"00.03 smid, 98.07 bibrelex, 98.03 mitchell"
}

@article{bs-pdtcm-98
, author =	"Marshall Bern and Amit Sahai"
, title =	"Pushing Disks Together -- {The} Continuous-Motion Case"
, journal =	"Discrete Comput. Geom."
, volume =	20
, year =	1998
, pages =	"499--514"
, update =	"01.07 orourke"
}

@inproceedings{b-tprrs-86
, author =	"M. W. Bern"
, title =	"Two probabilistic results on rectilinear {Steiner} trees"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"433--441"
, precedes =	"b-tprrs-88"
}

@article{b-tprrs-88
, author =	"M. W. Bern"
, title =	"Two probabilistic results on rectilinear {Steiner} trees"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"191--204"
, succeeds =	"b-tprrs-86"
}

@inproceedings{bkrs-fgatg-89
, author =	"M. W. Bern and H. J. Karloff and P. Raghavan and B. Schieber"
, title =	"Fast geometric approximation techniques and geometric embedding problems"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"292--301"
, precedes =	"bkrs-fgatg-92"
, cites =	"aa-pcaap-88, bfp-aach-82, bb-gweto-87, cf-shvd-88, c-wcanh-76, c-lat-84, ft-fhtui-87, ggj-sncgp-76, gj-cigtn-79, h-aagep-89, ll-wsisa-85, py-crstp-82, ps-cgi-85, s-a-83, sy-lbcft-76, v-ghm-88, v-amwmp-89, ekz-diepq-77, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{bkrs-fgatg-92
, author =	"Marshall W. Bern and Howard J. Karloff and Prabhakar Raghavan and Baruch Schieber"
, title =	"Fast Geometric Approximation Techniques and Geometric Embedding Problems"
, journal =	"Theoret. Comput. Sci."
, volume =	106
, number =	2
, month =	dec
, year =	1992
, pages =	"265--281"
, succeeds =	"bkrs-fgatg-89"
, update =	"98.03 mitchell"
}

@techreport{b-el3dv-90
, author =	"J. Bernal"
, title =	"An Expected Linear 3-Dimensional {Voronoi} Diagram Algorithm"
, number =	"NISTIR 4340"
, institution =	"National Inst. of Standards and Technology"
, address =	"Gaithersburg, MD"
, month =	jun
, year =	1990
, keywords =	"Voronoi diagram, expected complexity, expected linear"
, update =	"94.09 bernal"
, abstract =	"Let S be a set of n sites chosen independently from
                 a uniform distribution in a cube in 3-dimensional
                 Euclidean space. In this paper, an expected O(n)
                 algorithm for constructing the Voronoi diagram
                 for S together with numerical results obtained
                 from an implementation of the algorithm are presented."
}

@techreport{b-bnvd
, author =	"J. Bernal"
, title =	"Bibliographic notes on {Voronoi} diagrams"
, institution =	"National Institute of Standards and Technology"
, address =	"Gaithersburg, MD 20899"
, year =	1992
, update =	"00.03 bibrelex"
}

@techreport{b-cdtsc-88
, author =	"J. Bernal"
, title =	"Constructing {Delaunay} Triangulations For Sets Constrained By Line Segments"
, number =	"NIST/TN-1252"
, institution =	"Mathematical Analysis Div., National Inst. of Standards and Technology (NEL)"
, address =	"Gaithersburg, MD"
, month =	sep
, year =	1988
, keywords =	"Delaunay triangulations, ntiscomnbs"
, abstract =	"In the paper, the authors propose a simple algorithm
		 for constructing a Delaunay triangulation for a finite
		 set of points in the plane constrained by a finite
		 collection of line segments. The algorithm constructs
		 first a Delaunay triangulation for the set, and then
		 generates from it a sequence of triangulations as each
		 line segment is incorporated into the previously
		 obtained triangulation. An expected time analysis shows
		 the algorithm to be linear if the number of line
		 segments is kept constant."
}

@techreport{b-eooac-87
, author =	"J. Bernal"
, title =	"Expected ${O}({N})$ And ${O}({N}^{4/3})$ Algorithms For Constructing {Voronoi} Diagrams In Two And Three Dimensions"
, number =	"NBSIR-87/3679"
, institution =	"National Bureau of Standards (NEL), Gaithersburg, MD. Mathematical Analysis Div."
, month =	nov
, year =	1987
, keywords =	"Voronoi diagrams, computational geometry, computational complexity, two dimensional, three dimensional, ntiscomnbs"
, abstract =	"Bentley, Weide and Yao have proposed an expected O(N)
		 cell technique for computing Voronoi diagrams in two
		 dimensions that does not generalize readily to three.
		 In this paper their work is further developed and
		 generalized to produce expected O(N) and O(N sup 4/3)
		 algorithms for constructing Voronoi diagrams in two and
		 three dimensions, respectively. Computational
		 experience is presented for the algorithm in two
		 dimensions."
}

@techreport{b-ec3dv-90
, author =	"J. Bernal"
, title =	"On the Expected Complexity of the 3-Dimensional {Voronoi} Diagram"
, number =	"NISTIR 4321"
, institution =	"National Inst. of Standards and Technology"
, address =	"Gaithersburg, MD"
, month =	may
, year =	1990
, keywords =	"Voronoi diagram, expected complexity, expected linear"
, update =	"94.09 bernal"
, abstract =	"Let S be a set of n sites chosen independently from
                 a uniform distribution in a cube in 3-dimensional
                 Euclidean space. In this paper, work by Bentley,
                 Weide and Yao is extended to show that the Voronoi
                 diagram for S has an expected O(n) number of faces.
                 A consequence of the proof of this result is that
                 the Voronoi diagram for S can be constructed in
                 expected O(n) time."
}

% ### title?
@article{bf-2grph-67
, author =	"J. D. Bernal and J. L. Finney"
, title =	"{II}. Geometry of Random Packing of Hard Spheres"
, journal =	"Discussions of the Faraday Society"
, volume =	43
, year =	1967
, pages =	"62--69"
, annote =	"VD (in 3D) used as model of liquid. Calc stats, number
		 of neighbours, face distributions. Algorithm: $O(n^4)$
		 all combinations of four centres near target point."
}

@inproceedings{b-adg-81
, author =	"M. A. Bernard"
, title =	"On the Automated Drawing of Graphs"
, booktitle =	"Proc. 3rd Caribbean Conf. on Combinatorics and Computing"
, year =	1981
, pages =	"43--55"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{bb-srmua-97t
, author =	"F. Bernardini and C. Bajaj"
, title =	"Sampling and reconstructing manifolds using alpha-shapes"
, type =	"Technical {Report}"
, number =	"CSD-TR-97-013"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1997
, update =	"98.07 bibrelex"
}

@techreport{bbcs-ar3dc-97
, author =	"F. Bernardini and C. Bajaj and J. Chen and D. Schikore"
, title =	"Automatic reconstruction of $3${D} {CAD} models from digital scans"
, type =	"Technical {Report}"
, number =	"CSD-TR-97-012"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1997
, update =	"98.07 bibrelex"
}

@inproceedings{bbcs-tborm-97
, author =	"F. Bernardini and C. Bajaj and J. Chen and D. Schikore"
, title =	"Triangulation-Based Object Reconstruction Methods"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"481--484"
, keywords =	"video review"
, cites =	"bbx-arssf-95, bbx-rsfsu-97, bcx-mcap-95, bs-ebrtm-96, bb-srmua-97t, bbcs-ar3dc-97, b-gstds-84, em-tdas-94, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{bb-srmua-97
, author =	"Fausto Bernardini and Chandrajit L. Bajaj"
, title =	"Sampling and Reconstructing Manifolds Using Alpha--Shapes"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"193--198"
, update =	"97.11 jones"
}

@article{bbcs-ar3dc-99
, author =	"F. Bernardini and C. L. Bajaj and J. Chen and D. R. Schikore"
, title =	"Automatic reconstruction of $3${D} {CAD} models from digital scans"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, year =	1999
, pages =	"327--369"
, update =	"00.03 smid"
}

@inproceedings{bfp-cfcss-92
, author =	"Fausto Bernardini and Vincenzo Ferrucci and Alberto Paoluzzi"
, title =	"Computation of Free Configuration Space by Solid Modelling Techniques"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"13--16"
, update =	"00.03 bibrelex"
}

@article{bmrst-bpasr-99
, author =	"F. Bernardini and J. Mittleman and H. Rushmeir and C. Silva and G. Taubin"
, title =	"The ball-pivoting algorithm for surface reconstruction"
, journal =	"IEEE Transactions on Visualization and Computer Graphics"
, volume =	5
, number =	4
, year =	1999
, pages =	""
, update =	"01.07 devillers"
}

@article{bk-btg-79
, author =	"F. Bernhart and P. C. Kainen"
, title =	"The book thickness of a graph"
, journal =	"J. Combin. Theory"
, volume =	"Ser. B 27"
, year =	1979
, pages =	"320--331"
, update =	"98.07 bibrelex"
}

@article{bkwmbrkst-pdbcb-77
, author =	"F. C. Bernstein and T. F. Koetzle and G. J. B. Williams and E. F. {Meyer, Jr.} and M. D. Brice and J. R. Rodgers and O. Kennard and T. Shimanouchi and M. Tasumi"
, title =	"The protein data bank: {A} computer based archival file for macromolecular structure"
, journal =	"J. Molecular Biology"
, volume =	112
, year =	1977
, pages =	"535--542"
, update =	"98.03 bibrelex"
}

@article{b-dscns-86
, author =	"H. J. Bernstein"
, title =	"Determining the shape of a convex $n$-sided polygon by using $2n+k$ tactile probes"
, journal =	"Inform. Process. Lett."
, volume =	22
, year =	1986
, pages =	"255--260"
}

@techreport{b-dscns-84
, author =	"H. J. Bernstein"
, title =	"Determining the Shape of a Convex $n$-Sided Polygon Using $2n+k$ Tactile Probes"
, type =	"Technical {Report}"
, number =	125
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, month =	jun
, year =	1984
, note =	"Robotics Report No. 29"
, update =	"98.03 bibrelex"
}

@inproceedings{bgos-fdcpp-97
, author =	"R.-P. Berretty and K. Goldberg and M. Overmars and F. Van der Stappen"
, title =	"On fence design and the complexity of push plans for orienting parts"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"21--29"
, cites =	"aks-cdorp-95, ahlm-spfoj-96, am-ppopp-92, afkmnsu-ampcb-92, bbg-smutv-95, bdm-ulbpv-96, bpg-cfpa-93, ci-copod-95, clr-ia-90, b-lsbsp-95, em-esm-88, g-oppws-93, kos-ehsro-92, lm-spmcp-96, m-mgpo-82, mpssw-ftdlm-94, n-aaadp-86, os-rsplf-96, ps-mpsw-88, ps-prmsw-88, rg-mapp-95, sgo-gecmp-96, sho-cfsrm-93, so-mpafo-94, wgpb-cadpf-96, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
}

@article{bgos-cfdop-98
, author =	"Robert-Paul Berretty and Ken Goldberg and Mark H. Overmars and A. Frank van der Stappen"
, title =	"Computing fence designs for orienting parts"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"249--262"
, succeeds =	"bgos-fdcpp-97"
, update =	"98.11 devillers"
}

@techreport{bos-dmpld-97b
, author =	"R.-P. Berretty and M. Overmars and A. F. van der Stappen"
, title =	"Dynamic motion planning in low density environments"
, type =	"Report"
, number =	"UU-CS-1997-20"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1997
, update =	"97.11 oostrum"
}

@inproceedings{bos-dmpld-97
, author =	"R.-P. Berretty and M. Overmars and A. F. van der Stappen"
, title =	"Dynamic motion planning in low obstacle density environments"
, booktitle =	"Proc. Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"3--16"
, update =	"99.11 bibrelex, 99.07 bibrelex, 98.07 bibrelex+smid, 97.11 oostrum"
}

@inproceedings{bdgss-gdml-97
, author =	"Jonathan Berry and Nathaniel Dean and Mark Goldberg and Gregory Shannon and Steven Skiena"
, title =	"Graph Drawing and Manipulation with {LINK}"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"425--437"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@book{b-bmcai-93
, author =	"Joseph K. Berry"
, title =	"Beyond Mapping: Concepts, Algorithms, and Issues in GIS"
, publisher =	"GIS World"
, address =	"Fort Collins, CO"
, year =	1993
, isbn =	"0-9625063-6-2"
, update =	"95.09 mitchell"
}

@techreport{brv-ipam-89
, author =	"Patrice Bertin and Didier Roncin and Jean Vuillemin"
, title =	"Introduction to programmable active memories"
, type =	"Research Report"
, number =	3
, institution =	"Digital Paris Research Laboratory"
, month =	jun
, year =	1989
, update =	"98.11 bibrelex"
}

@article{bg-sfche-89
, title = "On the space-filling curve heuristic for the euclidean traveling salesman problem"
, author = "D. Bertsimas and M. Grigni"
, journal = "Operations Research Letters"
, year = 1989
, volume = 8
, pages = "241-244"
}

@techreport{bcdtt-hdspd-92t
, author =	"P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"How to Draw a Series-Parallel Digraph"
, type =	"Technical Report"
, number =	"UTDCS-9-92"
, institution =	"The University of Texas at Dallas"
, year =	1992
, succeeds =	"bcdtt-hdspd-92, bdtt-hdspd-91"
, precedes =	"bcdtt-hdspd-94, bcdtt-hdspd-92"
, update =	"98.11 bibrelex"
}

@inproceedings{bcdtt-hdspd-92
, author =	"P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"How to Draw a Series-Parallel Digraph"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"272--283"
, keywords =	"graph drawing"
, succeeds =	"bdtt-hdspd-91,bcdtt-hdspd-92t"
, precedes =	"bcdtt-hdspd-94"
, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 tamassia"
}

@article{bcdtt-hdspd-94
, author =	"P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"How to Draw a Series-Parallel Digraph"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"385--402"
, keywords =	"graph drawing, planar, upward"
, succeeds =	"bcdtt-hdspd-92, bdtt-hdspd-91, bcdtt-hdspd-92t"
, update =	"98.11 bibrelex, 98.03 bibrelex, 95.05 tamassia"
}

@inproceedings{bd-udttd-91
, author =	"P. Bertolazzi and G. {Di Battista}"
, title =	"On upward drawing testing of triconnected digraphs"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"272--280"
, keywords =	"graph drawing, planar graph representation"
, cites =	"b-g-85, bl-tcopi-76, cnao-laepg-85, fr-dfscp-82, dlr-bgudp-90, dt-aprad-88, dt-ipt-89, dtt-arsdd-89, et-adgab-89, e-ga-79, ht-ept-74, hl-updss-91, jnr-dippl-87, k-fpos-87, kr-pl-75, lec-aptg-67, lp-mt-86, nc-pgta-88, p-plpg-76, ru-roptc-88, s-oamnf-80, t-eggmn-87, t-paog-89, tm-dpp-77, ZZZ"
, update =	"97.11 bibrelex, 93.09 tamassia"
}

@inproceedings{bdd-codmn-97
, author =	"Paola Bertolazzi and Giuseppe {Di Battista} and Walter Didimo"
, title =	"Computing Orthogonal Drawings with the Minimum Number of Bends"
, editor =	"Frank Dehne and Andrew Rau-Chaplin and J{\"o}rg-R{\"u}diger Sack and Roberto Tamassia"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"331--344"
, update =	"99.07 bibrelex, 98.07 patrignani+tamassia+vismara"
}

@inproceedings{bdd-qup-98
, author =	"Paola Bertolazzi and Giuseppe {Di Battista} and Walter Didimo"
, title =	"Quasi-Upward Planarity"
, editor =	"S. H. Whitesides"
, booktitle =	"Graph Drawing (Proc. GD '98)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1547
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"15--29"
, keywords =	"graph drawing, upward"
, update =	"99.03 patrignani"
}

@techreport{bdl-pgd-92
, author =	"P. Bertolazzi and G. {Di Battista} and G. Liotta"
, title =	"Parametric Graph Drawing"
, type =	"Technical Report"
, number =	"6/67"
, institution =	"IASI--CNR, Rome, Italy"
, year =	1992
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@article{bdl-pgd-95
, author =	"P. Bertolazzi and G. {Di Battista} and G. Liotta"
, title =	"Parametric Graph Drawing"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	21
, number =	8
, year =	1995
, pages =	"662--673"
, keywords =	"graph drawing, system"
, update =	"96.01 liotta"
}

@article{bdlm-udtd-94
, author =	"P. Bertolazzi and G. {Di Battista} and G. Liotta and C. Mannino"
, title =	"Upward Drawings of Triconnected Digraphs"
, journal =	"Algorithmica"
, volume =	6
, number =	12
, year =	1994
, pages =	"476--497"
, keywords =	"graph drawing, upward, planar"
, update =	"96.01 liotta"
}

@incollection{bdmt-oupts-93
, author =	"P. Bertolazzi and G. {Di Battista} and C. Mannino and R. Tamassia"
, title =	"Optimal Upward Planarity Testing of Single-Source Digraphs"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"37--48"
, update =	"94.01 smid+tamassia, 93.09 milone+mitchell"
}

@article{bdmt-oupts-98
, author =	"P. Bertolazzi and G. {Di Battista} and C. Mannino and R. Tamassia"
, title =	"Optimal Upward Planarity Testing of Single-Source Digraphs"
, journal =	"SIAM J. Comput."
, volume =	27
, number =	1
, year =	1998
, pages =	"132--169"
, keywords =	"graph drawing, upward, planar"
, update =	"98.07 tamassia"
}

@misc{bdtt-hdspd-91
, author =	"P. Bertolazzi and G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"How to Draw a Series-Parallel Digraph"
, year =	1991
, note =	"manuscript"
, precedes =	"bcdtt-hdspd-92, bcdtt-hdspd-94, bcdtt-hdspd-92t"
, update =	"98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
}

@incollection{bgs-pavpi-89
, author =	"P. Bertolazzi and C. Guerra and S. Salza"
, title =	"A parallel algorithm for the visibility problem inside a simple polygon"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	399
, year =	1989
, pages =	"65--71"
, keywords =	"parallel computation, visibility"
, update =	"95.05 korneenko"
}

@article{bsg-pavpp-90
, author =	"P. Bertolazzi and S. Salza and C. Guerra"
, title =	"A parallel algorithm for the visibility problem from a point"
, journal =	"J. Parallel Distrib. Comput."
, volume =	9
, number =	1
, year =	1990
, pages =	"11--14"
, keywords =	"parallel computation, visibility"
, update =	"95.09 korneenko, 95.05 korneenko"
}

@inproceedings{bbd-ahc-93
, author =	"M. Bertolotto and E. Bruzzone and L. {De Floriani}"
, title =	"Acyclic hierarchical cell complexes"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"279--284"
, cites =	"fp-htbmt-92, mrl-tdugg-91, w-vomp-92,"
, update =	"98.11 bibrelex, 94.09 bernal, 93.09 milone+mitchell"
}

@article{b-pccp-88
, author =	"A. A. Bertossi"
, title =	"Parallel circle-cover problem"
, journal =	"Inform. Process. Lett."
, volume =	27
, year =	1988
, pages =	"133--139"
, keywords =	"parallel computation, circle, covering"
, update =	"95.05 korneenko"
}

@article{bhl-ahp-00
, author =	"C. Bertram-Kretzberg and T. Hofmeister and H. Lefmann"
, title =	"An algorithm for {Heilbronn's} problem"
, journal =	"SIAM J. Comput."
, volume =	30
, year =	2000
, pages =	"383--390"
, update =	"01.07 smid"
}

@article{bd-asmbh-94
, author =	"Y. Bertrand and J.-F. Dufourd"
, title =	"Algebraic specification of a {3D}-Modeler Based on Hypermaps"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	56
, year =	1994
, pages =	"29--60"
, update =	"00.11 smid, 00.07 devillers"
}

@book{b-colmm-82
, author =	"D. P. Bertsekas"
, title =	"Constrained Optimization and {Lagrange} Multiplier Methods"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1982
, update =	"97.11 bibrelex"
}

@book{bt-pdcnm-89
, author =	"D. P. Bertsekas and J. N. Tsitsiklis"
, title =	"Parallel and distributed Computation: {Numerical} Methods"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1989
, update =	"98.03 bibrelex"
}

@inproceedings{bg-ppcp-90
, author =	"D. J. Bertsimas and M. X. Goemans"
, title =	"On the parsimonious property of connectivity problems"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"388--396"
}

@article{b-wcesc-89
, author =	"D. Bertzimas"
, title =	"Worst-case examples for the spacefilling curve heuristics for the {Euclidean} {Travelling} {Salesman} {Problem}"
, journal =	"Oper. Res. Lett."
, volume =	8
, number =	5
, year =	1989
, pages =	"241--244"
, keywords =	"optimization"
, update =	"97.11 icking, 95.05 korneenko"
}

@article{b-sisal-74
, author =	"J. Besag"
, title =	"Spatial interaction and the statistical analysis of lattice systems"
, journal =	"J. Roy. Statist. Soc. Ser. B"
, volume =	36
, year =	1974
, pages =	"192--236"
}

@inproceedings{bc-mca-85
, author =	"G. M. Beshers and R. H. Campbell"
, title =	"Maintained and Constructor Attributes"
, booktitle =	"Proc. ACM Symp. on Language Issues in Programming Environments"
, year =	1985
, pages =	"34--42"
, update =	"96.01 tamassia"
}

@article{b-kpso-28
, author =	"A. S. Besicovitch"
, title =	"On {Kakeya's} problem and a similar one"
, journal =	"Mathematische Zeitschrift"
, volume =	27
, year =	1928
, pages =	"312--320"
, update =	"97.11 bibrelex"
}

@book{b-igs-85
, author =	"N. M. Beskin"
, title =	"Images of geometric solids"
, publisher =	"Mir Publishers"
, address =	"Moscow"
, year =	1985
, update =	"98.07 bibrelex"
}

@article{bj-tdor-85
, author =	"P. J. Besl and R. C. Jain"
, title =	"Three-dimensional object recognition"
, journal =	"ACM Comput. Surv."
, volume =	17
, year =	1985
, pages =	"75--154"
, update =	"97.11 bibrelex"
}

@article{b-eatdd-01
, author =	"S. N. Bespamyathnikh"
, title =	"An efficient algorithm for the three-dimensional diameter problem"
, journal =	"Discrete Comput. Geom."
, volume =	25
, year =	2001
, pages =	"235--255"
, update =	"02.03 smid"
}

@techreport{b-cmstt-
, author =	"S. N. Bespamyathnikh"
, title =	"Constructing Minimum Spanning Trees in {$R^k_\infty$} and triangulation of the k-Cube"
, type =	"manuscript"
, update =	"02.03 smid, 98.11 bibrelex"
}

@unpublished{b-eaet-00
, author =	"Sergei Bespamyatnikh"
, title =	"An Efficient Algorithm for Enumeration of Triangulations"
, year =	2000
, note =	"10th Annual Fall Workshop on Computational Geometry.
          \url{http://www.cs.ubc.ca/~besp/cgw.ps.gz}"
, update =	"01.11 pocchiola"
}

@article{b-eatddp-00
, author =	"S. Bespamyatnikh"
, title =	"An Efficient Algorithm for the Three-Dimensional Diameter Problem"
, journal =	"Discrete Comput. Geom."
, volume =	25
, number =	2
, year =	2000
, pages =	"235--255"
, update =	"02.03 bespamyatnikh"
}

@inproceedings{b-eaf2l-99
, author =	"Sergei Bespamyatnikh"
, title =	"Efficient Algorithm for Finding 2 Largest Empty Circles"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"37--38"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{bbkks-eacm-01
, author =	"S. Bespamyatnikh and B. Bhattacharya and M. Keil and D. Kirkpatrick and M. Segal"
, title =	"Efficient algorithms for centers and medians in interval and circular-arc graphs"
, journal =	"Networks"
, volume =	"??"
, year =	2002
, note =	"to appear"
, update =	"02.03 bespamyatnikh"
}

@article{bkst-oflvd-00
, author =	"S. Bespamyatnikh and K. Kedem and M. Segal and A. Tamir"
, title =	"Optimal facility location under various distance functions"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"523--534"
, update =	"01.04 smid"
}

@article{bds-ghsces-00
, author =	"S. Bespamyatnikh and D. Kirkpatrick and J. Snoeyink"
, title =	"Generalizing Ham Sandwich Cuts to Equitable Subdivisions"
, journal =	"Discrete Comput. Geom."
, volume =	24
, number =	4
, year =	2000
, pages =	"605--622"
, update =	"02.03 bespamyatnikh"
}

@inproceedings{bs-cspta-97
, author =	"Sergei Bespamyatnikh and Michael Segal"
, title =	"Covering a Set of Points by Two Axis--Parallel Boxes"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"33--38"
, update =	"97.11 jones"
}

@article{bs-qsvd-00
, author =	"S. Bespamyatnikh and J. Snoeyink"
, title =	"Queries with Segments in {Voronoi} Diagrams"
, journal =	"Comput. Geom. Theory Appl."
, volume =	16
, number =	1
, year =	2000
, pages =	"23--33"
, update =	"02.03 bespamyatnikh"
}

@inproceedings{b-eatdd-98
, author =	"Sergei N. Bespamyatnikh"
, title =	"An Efficient Algorithm for the Three-Dimensional Diameter Problem"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"137--146"
, update =	"98.07 agarwal+mitchell"
}

@inproceedings{b-oacpm-95
, author =	"Sergei N. Bespamyatnikh"
, title =	"An Optimal Algorithm for Closest Pair Maintenance"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"152--161"
, keywords =	"dynamic closest pair"
, cites =	"am-annqf-93, amnsw-oaann-94, b-lbact-83, bst-bst-85, bs-dcms-76, bet-pcqqt-93, b-rasdc-94, ck-dmdps-92, ck-adcpn-95, cpt-uadpl-93, ct-ccgtd-93, grss-rdsdc-93i, grss-sracp-93, ks-ntead-94, ls-ekcpo-92i, ps-cgi-85, s-sisie-91, sh-cpp-75, s-dsadc-93, ss-oaolc-92, sss-oaolc-92, st-dsdt-83, s-drpla-91, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, v-oaann-86, v-oaann-89, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{b-oacpm-98
, author =	"S. N. Bespamyatnikh"
, title =	"An Optimal Algorithm for Closest-Pair Maintenance"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"175--195"
, update =	"98.07 smid"
}

@inproceedings{b-oadpo-96
, author =	"S. N. Bespamyatnikh"
, title =	"An optimal algorithm for dynamic post-office problem in {$R^2_1$} and related problems"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"101--106"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{b-daans-96
, author =	"S. N. Bespamyatnikh"
, title =	"Dynamic algorithms for approximate neighbor searching"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"252--257"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{b-ocmst-97
, author =	"S. N. Bespamyatnikh"
, title =	"On constructing minimum spanning trees in {$R^k_1$}"
, journal =	"Algorithmica"
, volume =	18
, year =	1997
, pages =	"524--529"
, update =	"98.03 smid"
}

@inproceedings{b-rasdc-94
, author =	"S. N. Bespamyatnikh"
, title =	"The Region Approach for some Dynamic Closest-Point Problems"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"75--80"
, keywords =	"region approach, dynamic maintenance, data structures"
, cites =	"b-cmstt-, c-fadsi-88, gbt-srtgp-84, ks-ntead-, ls-ekcpo-92i, lw-dsdrq-82, s-eis-92, s-dsadc-93, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, w-mstpt-87, y-cmstk-82, hy-t-61, ZZZ"
, update =	"98.11 bibrelex, 98.03 smid, 94.09 jones"
}

@inproceedings{brs-plue-93
, author =	"Margrit Betke and Ronald L. Rivest and Mona Singh"
, title =	"Piecemeal Learning of an Unknown Environment"
, booktitle =	"Proc. 6th ACM Conf. Comput. Learning Theory"
, nickname =	"COLT '93"
, month =	jul
, year =	1993
, pages =	"277--286"
, update =	"98.07 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
}

@article{brs-plue-95
, author =	"Margrit Betke and Ronald L. Rivest and Mona Singh"
, title =	"Piecemeal Learning of an Unknown Environment"
, journal =	"Machine Learning"
, volume =	18
, number =	"2--3"
, year =	1995
, pages =	"231--254"
, succeeds =	"brs-plue-93"
, update =	"98.03 mitchell"
}

@article{bm-lplp-85
, author =	"V. Betke and P. {McMullen}"
, title =	"Lattice points in lattice polyhedra"
, journal =	"Monatsch. Math."
, volume =	99
, number =	4
, year =	1985
, pages =	"253--265"
, keywords =	"discrete geometry, polyhedra"
, update =	"95.05 korneenko"
}

@inproceedings{bc-ap1sq-94
, author =	"D. Beus and D. Crockett"
, title =	"Automated production of $1:24,000$ scale quadrangle maps"
, booktitle =	"Proc. 1994 ASPRS/ACSM Annual Convention and Exposition"
, volume =	1
, year =	1994
, pages =	"94--99"
, update =	"98.07 bibrelex"
}

@article{be-dapch-90
, author =	"H. Bez and J. Edwards"
, title =	"Distributed algorithm for the planar convex hull problem"
, journal =	"Comput. Aided Design"
, volume =	22
, number =	2
, year =	1990
, pages =	"81--86"
, keywords =	"convex hull, parallel computation"
, update =	"95.05 korneenko"
}

@article{b-orect-97
, author =	"Andras Bezdek"
, title =	"On optimal route planning evading cubes in the three space"
, journal =	"Beitr{\"a}ge zur Algebra und Geometrie"
, volume =	"??"
, year =	1997
, update =	"98.11 bibrelex, 98.03 mitchell"
, abstract =	"Let $\cal P$ be a finite arrangement of non-overlapping open
cubes with side-lengths not exceeding 1 in the $3$-dimensional
euclidean space. Let $S$ and $T$ be two points lying outside
the open cubes. Assume one needs to find a short path emanating
from $S$ and terminating at $T$ avoiding the cubes of $\cal P$
under the restriction that the cubes are not known prior to the search.
In fact the positions and the side-lengths of the cubes become known
to the searcher as the cubes are contacted. We give an algorithm to
construct a path of length less than
$\frac 32 d + 3 \sqrt 3 \log d + 5$,
where $d > 3 \sqrt 3$ denotes the distance between S and T."
}

@article{b-ddcc-90
, author =	"A. Bezdek"
, title =	"On the density of dual circle coverings"
, journal =	"Geom. Dedicata"
, volume =	33
, number =	2
, year =	1990
, pages =	"227--238"
, keywords =	"arrangements of circles, Sylvester problem"
, update =	"98.07 mitchell"
}

@article{bb-wiipt-86
, author =	"A. Bezdek and K. Bezdek"
, title =	"When it is possible to translate a convex polygon into another one?"
, journal =	"Stud. Sci. Math. Hungary"
, volume =	21
, year =	1986
, pages =	"337--342"
, keywords =	"convex polygon, containment"
, update =	"95.05 korneenko"
}

@article{bbb-ipls-92
, author =	"A. Bezdek and K. Bezdek and T. Bisztriczky"
, title =	"On illumination in the plane by line segments"
, journal =	"Geom. Dedicata"
, volume =	41
, number =	1
, year =	1992
, pages =	"39--50"
, keywords =	"visibility"
, update =	"95.05 korneenko"
}

@techreport{bbb-ktip-89
, author =	"A. Bezdek and K. Bezdek and T. Bisztriczky"
, title =	"On {Krasnosselsky}-type illumination problems"
, type =	"Research Paper"
, number =	676
, institution =	"Univ. of Calgary"
, address =	"Calgary, Canada"
, month =	jul
, year =	1989
, update =	"93.09 milone+mitchell"
}

@article{bbm-ipchf-91
, author =	"A. Bezdek and K. Bezdek and E. Makai"
, title =	"Interior points of the convex hull of few points in ${E}^d$"
, journal =	"Monatsh. Math."
, volume =	111
, number =	3
, year =	1991
, pages =	"181--186"
, keywords =	"convex hull, $d$-dimensional"
, update =	"95.05 korneenko"
}

@techreport{bk-pmsgc-??
, author =	"A. Bezdek and W. Kuperberg"
, title =	"Placing and Moving Spheres in the Gaps of a Cylinder Packing"
, type =	"Technical {Report}"
, institution =	"Dept. of Math, Cornell Univ"
, year =	"??"
, keywords =	"cylinder packing, closeness, motion planning"
, update =	"93.09 milone+mitchell"
}

@article{bkm-mdspp-91
, author =	"A. Bezdek and W. Kuperberg and E. Makai"
, title =	"Maximum density space packing with parallel strings of spheres"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"277--283"
}

@incollection{b-hlcpr-93
, author =	"K. Bezdek"
, title =	"{Hadwiger}-{Levi}'s Covering Problem Revisited"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"199--233"
, keywords =	"survey paper, discrete geometry, covering by homothets, illumination"
, update =	"93.09 erickson"
}

@inproceedings{b-irubd-01
, author =	"K{\'a}roly Bezdek"
, title =	"Improving {Roger's} Upper Bound for the Density of Unit Ball Packings in {Euclidean} $d$-Space for all $d\ge 8$"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"191--194"
, update =	"01.04 icking"
}

@article{b-pibcb-91
, author =	"K. Bezdek"
, title =	"The problem of illumination of the boundary of a convex body by affine subspaces"
, journal =	"Mathematika"
, volume =	38
, number =	2
, year =	1991
, pages =	"362--375"
, keywords =	"visibility, convex, polyhedra"
, update =	"95.05 korneenko"
}

@article{bl-ecld-88
, author =	"M. Bezem and J. van Leeuwen"
, title =	"On estimating the complexity of logarithmic decompositions"
, journal =	"Inform. Process. Lett."
, volume =	26
, number =	6
, year =	1988
, pages =	"321--324"
, update =	"96.05 smid, 95.05 korneenko"
}

@book{b-ncma-72
, author =	"P. Bezier"
, title =	"Numerical Control - Mathematics and Aplications"
, publisher =	"John Wiley \& Sons"
, address =	"London, UK"
, year =	1972
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{bc-fsamn-96
, author =	"J. Bhadury and R. Chandrasekaran"
, title =	"Finding the set of all minimal nested convex polygons"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"26--31"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{bcmc-agpcn-97
, author =	"J. Bhadury and V. Chandru and A. Maheshwari and R. Chandrasekaran"
, title =	"Art Gallery Problems for Convex Nested Polygons"
, journal =	"INFORMS J. Comput."
, volume =	9
, number =	1
, year =	1997
, pages =	"100--110"
, update =	"98.03 mitchell"
}

@inproceedings{bbgossz-tovra-93
, author =	"D. Bhagavathi and V. Bokka and H. Gurla and S. Olariu and J. L. Schwing and I. Stojmenovi{\'c} and J. Zhang"
, title =	"Time-optimal visibility-related algorithms on meshes with multiple broadcasting"
, booktitle =	"Proc. 1993 Internat. Conf. Application-Specific Array Processors, Venice, Italy"
, nickname =	"ASAP"
, month =	oct
, year =	1993
, pages =	"??"
, keywords =	"parallel computation"
, comments =	"to appear"
, update =	"93.09 rote"
}

@inproceedings{blosz-fsamb-92
, author =	"D. Bhagavathi and P. Looges and S. Olariu and J. L. Schwing and J. Zhang"
, title =	"Fast selection algorithms on meshes with multiple broadcasting"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, site =	"St. Charles"
, year =	1992
, update =	"98.07 bibrelex"
}

@inproceedings{bosswz-cpmmb-92
, author =	"D. Bhagavathi and S. Olariu and J. L. Schwing and W. Shen and L. Wilson and J. Zhang"
, title =	"Convexity problems on meshes with multiple broadcasting"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"365--370"
, keywords =	"convex polygons, meshes with muliple broadcasting, diameter, enclosing rectangle, inscribed triangle, time-optimal algorithms, image processing, computer vision"
, cites =	"cdr-ultbp-86, ds-gmmmc-79, dh-pcsa-73, fs-dmaer-75, l-ipaaa-92, l-spcsa-83, pl-pdavs-88, ps-cgi-85, rk-dpp-82, t-mss-85, ag-hpc-90, bb-cv-82, blosz-fsamb-92, bps-aamv-89, kr-icmmb-89, losz-sema-, l-cvdmc-85, ml-cascv-89, osz-tosam-92, p-cg-78, pr-apmb-87, v-mvavi-91, v-spa-91, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{bosw-tomsa-92t
, author =	"D. Bhagavathi and S. Olariu and W. Shen and L. Wilson"
, title =	"A time-optimal multiple search algorithm on enhanced meshes, with applications"
, type =	"Technical Report"
, number =	"TR-092-08"
, institution =	"Department of Computer Science, Old Dominion University"
, year =	1992
, precedes =	"bosw-tomsa-92"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{bosw-tomsa-92
, author =	"D. Bhagavathi and S. Olariu and W. Shen and L. Wilson"
, title =	"A time-optimal multiple search algorithm on enhanced meshes, with applications"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"359--364"
, succeeds =	"bosw-tomsa-92t"
, cites =	"l-ipaaa-92, tk-smcpc-77, a-obfma-86, am-pbs-90, bosw-tomsa-92t, b-fmapg-84, ml-cascv-89"
, update =	"98.11 bibrelex"
}

@inproceedings{bwc-ihd-00
, author =	"Praveen Bhaniramka and Rephael Wenger and Roger Crawfis"
, title =	"Isosurfacing in Higher Dimensions"
, booktitle =	"Proceedings of Visualization 2000"
, year =	2000
, pages =	"267--273"
, update =	"01.07 wenger"
}

@techreport{bpcj-vgdaa-95
, author =	"S. Bhanji and H. C. Purchase and R. F. Cohen and M. James"
, title =	"Validating Graph Drawing Aesthetics: A Pilot Study"
, type =	"Technical Report"
, number =	336
, institution =	"University of Queensland, Department of Computer Science"
, year =	1995
, keywords =	"graph drawing, aesthetics, human-computer interaction"
, update =	"96.09 tamassia, 96.04 garg"
}

@article{brw-pprrl-88
, author =	"S. K. Bhaskar and A. Rosenfeld and A. Y. Wu"
, title =	"Parallel processing of regions represented by linear quadtrees"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	42
, number =	3
, year =	1988
, pages =	"371--380"
, keywords =	"quad trees, parallel computations, digital geometry"
, update =	"95.05 korneenko"
}

@inproceedings{bnk-oplci-93
, author =	"V. Bhaskaran and B. K. Natarajan and K. Konstantinides"
, title =	"Optimal Piecewise-Linear Compression of Images"
, booktitle =	"Data Compression Conference"
, nickname =	"DCC '93"
, publisher =	"IEEE Press"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@article{bs-lafrd-88
, author =	"J. Bhasker and S. Sahni"
, title =	"A linear algorithm to find a rectangular dual of a planar triangulated graph"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"247--278"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{b-iatdg-92
, author =	"Dinesh Bhatia"
, title =	"Improved algorithms for two dimensional grid routing"
, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{bgks-flddf-98
, author =	"Randeep Bhatia and Sudipto Guha and Samir Khuller and Yoram J. Sussmann"
, title =	"Facility Location with Dynamic Distance Functions"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"23--34"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

@article{bl-tdfem-90
, author =	"R. P. Bhatia and K. L. Lawrence"
, title =	"Two-Dimensional Finite Element Mesh Generation Based On Stripwise Automatic Triangulation"
, journal =	"Comput. Struct."
, volume =	36
, number =	2
, year =	1990
, pages =	"309--319"
, keywords =	"two-dimensional finite element mesh, finite element mesh generation, stripwise automatic triangulation, central mesh generation, laplacian smoothing"
, annote =	"Advancing front scheme. Tri that maximizes $A/P^2$ is
		 chosen."
, abstract =	"A new mesh generator, capable of discretizing
		 arbitrary, two-dimensional, multiply connected domains
		 into triangles with a prescribed spatial density, has
		 been developed. The technique is based on stripwise
		 automatic triangulation. The triangulation strategy has
		 been enhanced using two heuristics. The first is a
		 method to temporarily reorient a region before
		 submitting it for generation. The second is a technique
		 to find and repair 'omitted patches' near sharply
		 curved boundaries. Despite employing a set of
		 heuristics, the resulting scheme is versatile, robust,
		 and demonstrates a near linear growth rate. (Author
		 abstract) 17 Refs."
}

@inproceedings{bclr-ostm-86
, author =	"S. Bhatt and F. Chung and F. Leighton and A. Rosenberg"
, title =	"Optimal simulations of tree machines"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"274--282"
, update =	"97.11 bibrelex"
}

@article{bc-cmwlv-87
, author =	"S. Bhatt and S. Cosmadakis"
, title =	"The Complexity of Minimizing Wire Lengths in {VLSI} Layouts"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"263--267"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{bl-fsvgl-84
, author =	"S. N. Bhatt and F. T. Leighton"
, title =	"A framework for solving {VLSI} graph layout problems"
, journal =	"J. Comput. Syst. Sci."
, volume =	28
, year =	1984
, pages =	"300--343"
, succeeds =	"l-lsvwi-82"
}

@techreport{b-acokv-83
, author =	"B. Bhattacharya"
, title =	"An algorithm for computing order $k$ {Voronoi} diagrams in the plane"
, type =	"Report"
, number =	"Tech. Rep. 83-9"
, institution =	"Comput. Sci. Dept., Simon Fraser Univ."
, year =	1983
, update =	"94.09 bernal"
}

@techreport{b-wcach-82
, author =	"B. Bhattacharya"
, title =	"Worst-case analysis of a convex hull algorithm"
, type =	"Report"
, number =	"Tech. Rep."
, institution =	"Comput. Sci. Dept., Simon Fraser Univ."
, year =	1982
, update =	"94.09 bernal"
}

@article{bb-cobbt-01
, author =	"Binay Bhattacharya and Robert Benkoczi"
, title =	"On computing the optimal bridge between two convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	79
, year =	2001
, pages =	"215--221"
, update =	"02.03 cheong"
}

@techreport{bcetsu-csts-90
, author =	"B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
, title =	"Computing Shortest Transversals of Sets"
, type =	"Technical {Report}"
, number =	"SOCS 90.23"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, update =	"97.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{bcetsu-csts-91
, author =	"B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
, title =	"Computing shortest transversals of sets"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"71--80"
, keywords =	"stabbing"
, precedes =	"bcetsu-csts-92"
, cites =	"ab-eact-87, ad-ahdsp-90, arw-lbls-89, bl-dicp-83, bt-cst-90t, bet-csdix-, b-gtfga-80, dgk-htir-63, d-ltatt-84, e-cedbt-85, e-ftssg-85, eg-tsa-86, egs-ueplf-89, emprww-sls-82, ew-spdtl-89, ew-ospdc-91, gpw-gtt-91, h-fuenl-89, hiir-wolla-89, k-sades-91t, m-ltalp-83, mt-fmvdb-85, o-olafs-81, ol-mcp-81, s-cesl-85, v-cbrdf-87, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex, 97.11 bibrelex, 96.09 devillers"
}

@article{bcetsu-csts-92
, author =	"B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
, title =	"Computing shortest transversals of sets"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	4
, year =	1992
, pages =	"417--442"
, keywords =	"computational geometry, shortest transversal, envelope, butterfly polygon"
, succeeds =	"bcetsu-csts-91"
, update =	"96.09 devillers"
}

@inproceedings{bet-cwb-91
, author =	"B. Bhattacharya and P. Egyed and G. Toussaint"
, title =	"Computing the wingspan of a butterfly"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"88--91"
, cites =	"agt-vbtes-86, bkt-dsvp-89, bt-cst-91a, bcetsu-csts-91, cd-icott-87, dk-ladsc-85, e-cedbt-85, mt-fmvdb-85, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{be-bskpc-97
, author =	"Binay Bhattacharya and Hossam ElGindy"
, title =	"Biased Search and $k$--Point Clustering"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"141--146"
, update =	"97.11 jones"
}

@article{bet-cdach-91
, author =	"B. Bhattacharya and H. Everett and G. Toussaint"
, title =	"A counterexample to a dynamic algorithm for convex hulls of line arrangements"
, journal =	"Pattern Recogn. Lett."
, volume =	12
, number =	3
, year =	1991
, pages =	"145--147"
, keywords =	"errata, convex hull"
, update =	"95.05 korneenko"
}

@article{bg-clvpr-01
, author =	"B. Bhattacharya and S. K. Ghosh"
, title =	"Characterizing {LR}-visibility polygons and related problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"19--36"
, update =	"01.04 smid"
}

@inproceedings{bkt-dsvp-89
, author =	"B. Bhattacharya and D. G. Kirkpatrick and G. T. Toussaint"
, title =	"Determining sector visibility of a polygon"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"247--254"
, cites =	"ab-eact-87, aw-alts-87, aw-plts-88, at-oadvp-81, bl-dicp-83, b-lbact-83, e-ftssg-85, eow-gfcs-83, e-hdpa-85, emprww-sls-82, et-eaide-85, g-ct-58, hv-splsp-49, k-dwvsp-88, l-tcctc-80, ma-lafch-79, mt-rltcp-87, o-olafs-81, r-dcikc-88a, rs-sp-77, ss-oadwv-86, st-ccssp-88, ta-chapi-82, t-ccu-84a, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@inproceedings{bm-ltacm-01
, author =	"Binay Bhattacharya and Asish Mukhopadhyay"
, title =	"A Linear Time Algorithm for Computing the Minimum Perimeter Triangle Enclosing a Convex Polygon"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"43--47"
, update =	"01.04 icking"
}

@inproceedings{bs-psdsr-90
, author =	"B. Bhattacharya and T. Shermer"
, title =	"Polygonal separators and digital shape recognition"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"74--77"
, cites =	"b-cspps-88, dr-clp-80, k-dcscp-82, ka-dd-84, na-dc-84, na-digp-85, na-ds-90, ol-mcp-81, t-stc-88, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{bt-cmscs-89
, author =	"B. Bhattacharya and G. Toussaint"
, title =	"Computing minimal spanning covers of sets"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	24
}

@techreport{bt-cst-90t
, author =	"B. Bhattacharya and G. Toussaint"
, title =	"Computing shortest transversals"
, number =	"SOCS 90.6"
, institution =	"School of Computer Science, McGill University"
, year =	1990
, keywords =	"stabbing"
, comments =	"revised April 1991"
}

@inproceedings{bt-cst-91i
, author =	"B. Bhattacharya and G. Toussaint"
, title =	"Computing shortest transversals"
, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	510
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"649--660"
, keywords =	"stabbing"
, update =	"93.09 rote"
}

@article{bt-cst-91a
, author =	"B. Bhattacharya and G. Toussaint"
, title =	"Computing shortest transversals"
, journal =	"Computing"
, volume =	46
, number =	3
, year =	1991
, pages =	"93--119"
, keywords =	"stabbing, line fitting"
, update =	"98.11 bibrelex, 93.09 rote"
, annote =	"of $n$ given line segments in the plane in $O(n \log^2 n)$
		 time, and related problems"
}

@inproceedings{b-eolca-88
, author =	"B. K. Bhattacharya"
, title =	"An efficient on-line {Chebyshov} approximation algorithm for a finite planar pointset"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, volume =	1
, year =	1988
, pages =	"107--108"
, keywords =	"line fitting, points, optimization"
, update =	"95.05 korneenko"
}

@techreport{b-acgpr-82
, author =	"B. K. Bhattacharya"
, title =	"Application of computational geometry to pattern recognition problems"
, type =	"Technical {Report}"
, number =	"82-3"
, institution =	"Dept. Comput. Sci., Simon Fraser Univ."
, address =	"Burnaby, BC"
, year =	1982
, update =	"98.03 bibrelex"
}

@phdthesis{b-acgpr-80
, author =	"B. K. Bhattacharya"
, title =	"Applications of computational geometry to pattern recognition problems"
, type =	"Ph.{D}. Thesis"
, school =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1980
, keywords =	"doctoral thesis"
}

@incollection{b-cspps-88
, author =	"B. K. Bhattacharya"
, title =	"Circular separability of planar point sets"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"25--39"
}

@inproceedings{b-uasls-91
, author =	"Binay K. Bhattacharya"
, title =	"Usefulness of Angle-Sweep over Line-Sweep"
, booktitle =	"Proc. 11th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"New Delhi, India"
, year =	1991
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@techreport{bet-csdix-
, author =	"B. K. Bhattacharya and P. Egyed and G. T. Toussaint"
, title =	"On computing shortest distances inside {X}-shaped polygons"
, type =	"Manuscript"
, update =	"97.11 bibrelex"
}

@article{be-nlcha-84
, author =	"B. K. Bhattacharya and H. ElGindy"
, title =	"A new linear convex hull algorithm for simple polygons"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-30"
, year =	1984
, pages =	"85--88"
}

% not Mukhopadhayay (title page typo)
@inproceedings{bjmr-oassi-91
, author =	"B. K. Bhattacharya and S. Jadhav and A. Mukhopadhyay and J.-M. Robert"
, title =	"Optimal algorithms for some smallest intersection radius problems"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"81--88"
, keywords =	"prune and search, optimization"
, cites =	"bt-cst-90t, bcetsu-csts-90, b-fihs-78, c-lpot-86, c-pcmce-85, d-ltatt-84, d-mstia-86, gs-spscp-89, hdk-cgp-64, hiir-wolla-89, m-ltalp-83, m-lpltw-84, s-cg-78, s-lpchm-90, s-qgs-57, s-pavsf-60, ZZZ"
, update =	"97.11 bibrelex, 96.09 agarwal"
}

@inproceedings{bm-cltcs-95
, author =	"Binay K. Bhattacharya and Asish Mukhopadhyay"
, title =	"Computing in Linear Time a Chord from which a Simple Polygon is Weakly Internally Visible"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"22--31"
, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@inproceedings{bmt-ltacs-91
, author =	"B. K. Bhattacharya and A. Mukhopadhyay and G. T. Toussaint"
, title =	"A linear time algorithm for computing the shortest line segment from which a polygon is weakly visible"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"412--424"
, keywords =	"polygon, visibility"
}

@article{br-ccip-90
, author =	"B. K. Bhattacharya and A. Rosenfeld"
, title =	"Contour codes of isothetic polygons"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	50
, number =	3
, year =	1990
, pages =	"353--363"
, keywords =	"isothetic, shape"
, update =	"95.05 korneenko"
}

@article{bs-spoos-97
, author =	"B. K. Bhattacharya and S. Sen"
, title =	"On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm"
, journal =	"J. Algorithms"
, volume =	25
, year =	1997
, pages =	"177--193"
, update =	"97.11 smid"
}

@article{bt-cdacp-82
, author =	"B. K. Bhattacharya and G. T. Toussaint"
, title =	"A counterexample to a diameter algorithm for convex polygons"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-4"
, year =	1982
, pages =	"306--309"
, succeeds =	"st-fer-80"
, precedes =	"st-ccdac-82"
}

@techreport{bt-ladts-86
, author =	"B. K. Bhattacharya and G. T. Toussaint"
, title =	"A linear algorithm for determining translation separability of two simple polygons"
, type =	"Report"
, number =	"SOCS-86.1"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1986
}

@article{bt-eacmd-83
, author =	"B. K. Bhattacharya and G. T. Toussaint"
, title =	"Efficient algorithms for computing the maximum distance between two finite planar sets"
, journal =	"J. Algorithms"
, volume =	4
, year =	1983
, pages =	"121--136"
}

@article{bt-facdf-88
, author =	"B. K. Bhattacharya and G. T. Toussaint"
, title =	"Fast algorithms for computing the diameter of a finite planar set"
, journal =	"Visual Comput."
, volume =	3
, year =	1988
, pages =	"379--388"
}

@incollection{bt-gatuf-85
, author =	"B. K. Bhattacharya and G. T. Toussaint"
, title =	"On geometric algorithms that use the furthest-point {Voronoi} diagram"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"43--61"
, succeeds =	"tb-gatuf-81"
}

@article{bt-tseio-83
, author =	"B. K. Bhattacharya and G. T. Toussaint"
, title =	"Time- and storage-efficient implementation of an optimal convex hull algorithm"
, journal =	"Image Vision Comput."
, volume =	1
, year =	1983
, pages =	"140--144"
}

@techreport{bz-stdfp-86
, author =	"B. K. Bhattacharya and J. Zorbas"
, title =	"Solving the two-dimensional findpath problem using a line-triangle representation of the robot"
, type =	"Technical {Report}"
, institution =	"School Comput. Sci., Simon Fraser Univ."
, address =	"Burnaby, BC"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{bz-stdfp-88
, author =	"B. K. Bhattacharya and J. Zorbas"
, title =	"Solving the two-dimensional findpath problem using a line-triangle representation of the robot"
, journal =	"J. Algorithms"
, volume =	9
, year =	1988
, pages =	"449--469"
}

@techreport{br-prttd-94
, author =	"P. Bhattacharya and A. Rosenfeld"
, title =	"Polygonal ribbons in two and three dimensions"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1994
, keywords =	"ribbons, strips, orientability, twist, Hamiltonian triangulation"
, update =	"95.09 mitchell"
}

@article{b-sfctg-69
, author =	"T. Bially"
, title =	"Space-filling curves: Their generation and their application to bandwidth reduction"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	15
, year =	1969
, pages =	"658--664"
, update =	"97.07 agarwal"
}

@article{bd-shc2c-91
, author =	"A. Bialostocki and P. Dierker"
, title =	"On simple {Hamiltonian} cycles in a 2-colored complete graph"
, journal =	"Ars Combin."
, volume =	21
, year =	1991
, pages =	"13--16"
, update =	"97.11 bibrelex"
}

@article{bl-rpsp-90
, author =	"G. Bianchi and M. Longinetti"
, title =	"Reconstructing plane sets from projections"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"223--242"
}

@article{bd-nstg-93
, author =	"E. Bibelnieks and P. M. Dearing"
, title =	"Neighborhood Subtree Tolerance Graphs"
, journal =	"Discrete Appl. Math."
, volume =	43
, year =	1993
, pages =	"13--26"
, update =	"98.11 bibrelex"
}

@inproceedings{b-iod3g-96
, author =	"T. Biedl"
, title =	"Improved orthogonal drawings of 3-graphs"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"295--299"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{b-oodcp-96
, author =	"T. Biedl"
, title =	"Optimal orthogonal drawings of connected plane graphs"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"306--311"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{bddlloorstw-lupc3d-99
, author =	"T. Biedl and E. Demaine and M. Demaine and S. Lazard and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. Toussaint and S. Whitesides"
, title =	"Locked and Unlocked Polygonal Chains in {3D}"
, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '99"
, month =	jan
, year =	1999
, pages =	"866--867"
, note =	"Full version Smith Tech. Rep. 060, Oct. 1999;
		LANL arXive cs.CG/9910009"
, archive =	"XXX:cs.CG/9910009"
, update =	"01.04 orourke, 00.03 orourke, 99.07 bibrelex, 99.03 orourke, 98.11 orourke"
}

@article{bddlloorstw-lupc3d-01
, author =	"T. Biedl and E. Demaine and M. Demaine and S. Lazard and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. Toussaint and S. Whitesides"
, title =	"Locked and Unlocked Polygonal Chains in {3D}"
, journal =	"Discrete Comput. Geom."
, volume =	26
, number =	3
, year =	2001
, pages =	"269--282"
, comments =	"Much detail left out; see full versions"
, succeeds =	"bddlloorstw-lupc3d-99"
, update =	"02.03 orourke"
}

@inproceedings{bddloorsw-orfltcl-98
, author =	"T. Biedl and E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. T. Toussaint and S. Whitesides"
, title =	"On Reconfiguring Tree Linkages: {T}rees Can Lock"
, booktitle =	"Proc. 10th Canad. Conf. Comput. Geom."
, year =	1998
, pages =	"4--5"
, note =	"Full version LANL arXive cs.CG/9910024;
		to appear in {\em Discrete Math.}"
, archive =	"XXX:cs.CG/9910024"
, update =	"01.04 orourke, 00.03 orourke"
}

@inproceedings{bddloorw-uscop-98
, author =	"T. Biedl and E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and S. Whitesides"
, title =	"Unfolding Some Classes of Orthogonal Polyhedra"
, booktitle =	"Proc. 10th Canad. Conf. Comput. Geom."
, year =	1998
, pages =	"70--71"
, note =	"Fuller version in Elec. Proc.
		http://cgm.cs.mcgill.ca/cccg98/proceedings/welcome.hml"
, update =	"00.03 orourke"
}

@inproceedings{bk-bhogd-94
, author =	"T. Biedl and G. Kant"
, title =	"A Better Heuristic for Orthogonal Graph Drawings"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, nickname =	"ESA '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"24--35"
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@article{bk-bhogd-98
, author =	"T. Biedl and G. Kant"
, title =	"A Better Heuristic for Orthogonal Graph Drawings"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, year =	1998
, pages =	"159--180"
, update =	"98.03 smid"
}

@inproceedings{bls-wcnfp-99
, author =	"Therese Biedl and Anna Lubiw and Julie Sun"
, title =	"When Can a Net Fold to a Polyhedron?"
, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
, year =	1999
, pages =	"1--4"
, update =	"01.11 orourke"
}

@inproceedings{bsww-o3dgd-97
, author =	"T. Biedl and T. Shermer and S. Whitesides and S. Wismath"
, title =	"Orthogonal $3$-{D} Graph Drawing"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"76--86"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{b-h3ogd-95
, author =	"T. C. Biedl"
, title =	"Heuristics for {\em 3D}-orthogonal graph drawings"
, booktitle =	"Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization"
, year =	1995
, pages =	"41--44"
, keywords =	"graph drawing, 3D, orthogonal"
, update =	"96.09 tamassia"
}

@article{b-nlbod-98
, author =	"Therese C. Biedl"
, title =	"New Lower Bounds For Orthogonal Drawings"
, journal =	"J. Graph Algorithms Appl."
, volume =	2
, number =	7
, year =	1998
, pages =	"1--31"
, url =	"http://www.cs.brown.edu/publications/jgaa/accepted/98/Biedl98.2.7.ps.gz"
, succeeds =	"b-nlbog-96"
, update =	"00.03 vismara"
}

@inproceedings{b-nlbog-96
, author =	"T. C. Biedl"
, title =	"New Lower Bounds for Orthogonal Graph Drawings"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD~'95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"28--39"
, update =	"99.03 vismara"
}

@article{b-rbsog-98
, author =	"Therese C. Biedl"
, title =	"Relating Bends and Size in Orthogonal Graph Drawings"
, journal =	"Inform. Process. Lett."
, volume =	65
, year =	1998
, pages =	"111--115"
, keywords =	"graph drawing, orthogonal"
, update =	"99.03 patrignani"
}

@techreport{bdlrs-cmp-99
, author =	"T. C. Biedl and E. D. Demaine and S. Lazard and S. M. Robbins and M. A. Soss"
, title =	"Convexifying Monotone Polygons"
, number =	"CS-99-03"
, institution =	"Univ. Waterloo, Ontario"
, year =	1999
, update =	"00.03 orourke"
}

@inproceedings{bk-aesig-97
, author =	"T. C. Biedl and M. Kaufmann"
, title =	"Area-Efficient Static and Incremental Graph Darwings"
, editor =	"R. Burkard and G. Woeginger"
, booktitle =	"Algorithms (Proc. ESA~'97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1284
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"37--52"
, update =	"98.07 vismara"
}

@inproceedings{bmt-tpmua-97
, author =	"Therese C. Biedl and Brendan P. Madden and Ioannis G. Tollis"
, title =	"The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"391--402"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{bmt-tpmua-00
, author =	"Therese C. Biedl and Brendan P. Madden and Ioannis G. Tollis"
, title =	"The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, number =	6
, year =	2000
, pages =	"553--580"
, succeeds =	"bmt-tpmua-97"
, update =	"01.04 smid+vismara"
}

@techreport{bgg-raor-88
, author =	"E. Bienenstock and D. Geman and S. Geman"
, title =	"A relational approach in object recognition"
, type =	"Technical {Report}"
, institution =	"Brown Univ."
, address =	"Providence, RI"
, year =	1988
, update =	"98.03 bibrelex"
}

@techreport{bggm-p2trd-90
, author =	"E. Bienenstock and D. Geman and S. Geman and D. E. McClure"
, title =	"Phase {II} technical report, development of laser radar {ATR} algorithms"
, type =	"Technical {Report}"
, number =	"DAAL02-89-C-0081"
, institution =	"CECOM Center for Night Vision and Electro-Optics"
, month =	oct
, year =	1990
, update =	"98.03 bibrelex"
}

@inproceedings{b-sphcn-90
, author =	"D. Bienstock"
, title =	"Some provably hard crossing number problems"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"253--260"
, precedes =	"b-sphcn-91"
, cites =	"bd-brcn-, eg-cnp-73, gj-cninc-83, gp-ccncp-80, gp-pgcsc-80, gp-ms-83, gp-sccca-84, gp-prpa-85, gp-taafp-86, gps-crotr-89, g-as-72, km-igs-94, l-civ-83, t-rdg-88, t-ttcn-70, ZZZ"
, update =	"97.11 bibrelex"
}

@article{b-sphcn-91
, author =	"D. Bienstock"
, title =	"Some provably hard crossing number problems"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"443--459"
, succeeds =	"b-sphcn-90"
}

@unpublished{bd-brcn-
, author =	"D. Bienstock and N. Dean"
, title =	"Bounds on rectilinear crossing numbers"
, note =	"Submitted"
, update =	"97.11 bibrelex"
}

@article{bg-eps01-91
, author =	"D. Bienstock and E. Gy{\H o}ri"
, title =	"An Extremal Problem on Sparse 0-1 Matrices"
, journal =	"SIAM J. Discrete Math."
, volume =	4
, year =	1991
, pages =	"17--27"
, update =	"95.09 agarwal, 93.09 milone+mitchell"
}

@article{bm-cepgm-90
, author =	"D. Bienstock and C. L. Monma"
, title =	"On the complexity of embedding planar graphs to minimize certain distance measures"
, journal =	"Algorithmica"
, volume =	5
, number =	1
, year =	1990
, pages =	"93--109"
, keywords =	"optimization, proximity"
, update =	"95.05 korneenko"
}

@techreport{bm-oerpg-??
, author =	"D. Bienstock and C. L. Monma"
, title =	"Optimal Enclosing Regions in Planar Graphs"
, type =	"Manuscript"
, year =	"??"
, precedes =	"bm-oerpg-89"
, update =	"95.05 korneenko, 93.09 milone+mitchell"
}

@article{bm-oerpg-89
, author =	"D. Bienstock and C. L. Monma"
, title =	"Optimal enclosing regions in planar graphs"
, journal =	"Networks"
, volume =	19
, number =	1
, year =	1989
, pages =	"79--94"
, keywords =	""
, succeeds =	"bm-oerpg-??"
, update =	"95.05 korneenko"
}

@article{b-sdtd-90
, author =	"Eric A. Bier"
, title =	"Snap-Dragging in Three Dimensions"
, journal =	"Computer Graphics"
, volume =	24
, number =	2
, year =	1990
, pages =	"193--204"
, keywords =	"Methodology and Techniques, Interaction techniques, Scene composition, interactive design, geometric construction, constraint systems"
, update =	"97.11 bibrelex, 95.05 schwarzkopf, 93.09 milone+mitchell"
}

@techreport{bs-ppht-??
, author =	"E. A. Bier and K. R. {Sloan, Jr.}"
, title =	"Pointing and placing with homogeneous transforms"
, type =	"Report"
, number =	"??"
, institution =	"Architect. Mach. Group, Massachusetts Inst. Tech., Xerox Palo Alto Res. Center"
, year =	"??"
}

@inproceedings{b-rp-89
, author =	"H. Bieri"
, title =	"{Raster}-{Polyeder}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@article{bn-rpsad-82
, author =	"H. Bieri and W. Nef"
, title =	"A recursive plane-sweep algorithm, determining all cells of a finite division of {$R^{d}$}"
, journal =	"Computing"
, volume =	28
, year =	1982
, pages =	"189--198"
}

@article{bn-space-85
, author =	"H. Bieri and W. Nef"
, title =	"A sweep-plane algorithm for computing the {Euler} characteristic of polyhedra represented in boolean form"
, journal =	"Computer"
, volume =	34
, number =	4
, year =	1985
, pages =	"287--302"
, keywords =	"space sweep, polyhedra"
, update =	"95.05 korneenko"
}

@article{bn-spacv-83
, author =	"H. Bieri and W. Nef"
, title =	"A sweep-plane algorithm for computing the volume of polyhedra represented in boolean form"
, journal =	"Linear Algebra and its Applications"
, volume =	"52--53"
, year =	1983
, pages =	"69--97"
}

@article{bn-aecra-84
, author =	"H. Bieri and W. Nef"
, title =	"Algorithms for the {Euler} characteristic and related additive functionals of digital objects"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	28
, year =	1984
, pages =	"166--175"
}

@inproceedings{bn-esodd-88
, author =	"H. Bieri and W. Nef"
, title =	"Elementary set operations with $d$-dimensional polyhedra"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"97--112"
, update =	"00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@proceedings{bn-cgmaa-91
, title =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, editor =	"H. Bieri and H. Noltemeier"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, update =	"00.03 bibrelex, 97.11 icking"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{bs-olacs-91
, author =	"Hanspeter Bieri and Peter-Michael Schmidt"
, title =	"An on-line algorithm for constructing sweep planes in regular position"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"27--35"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{bs-ofmpi-92
, author =	"Hanspeter Bieri and Peter-Michael Schmidt"
, title =	"On the Orders of Finitely Many Points Induced by Rotational Sweeps"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"61--63"
, update =	"00.03 bibrelex"
}

@inproceedings{bs-pgrsp-96
, author =	"H. Bieri and P.-M. Schmidt"
, title =	"On the permutations generated by rotational sweeps of planar point sets"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"179--184"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{bs-rpgsp-93
, author =	"Hanspeter Bieri and Peter-Michael Schmidt"
, title =	"Recognizing Permutations Generated by Sweeps of Planar Point Sets"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"10--13"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
}

@book{b-agt-74
, author =	"N. Biggs"
, title =	"Algebraic Graph Theory"
, edition =	"1st"
, publisher =	"Cambridge University Press"
, year =	1974
, update =	"97.11 bibrelex"
}

@book{b-agt-93
, author =	"N. Biggs"
, title =	"Algebraic Graph Theory"
, edition =	"2nd"
, publisher =	"Cambridge University Press"
, year =	1993
, update =	"97.11 bibrelex, 95.01 matousek"
}

@techreport{bn-absop-86
, author =	"G. Bilardi and A. Nicolau"
, title =	"Adaptive Bitonic Sorting: {An} Optimal Parallel Algorithm for Shared Memory Machines"
, type =	"Technical {Report}"
, number =	"86-769"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	aug
, year =	1986
, update =	"98.03 bibrelex"
}

@article{bn-absop-89
, author =	"G. Bilardi and A. Nicolau"
, title =	"Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines"
, journal =	"Inform. Comput."
, volume =	18
, year =	1989
, pages =	"216--228"
, update =	"96.09 orourke"
}

@inproceedings{bp-mavno-84
, author =	"G. Bilardi and F. P. Preparata"
, title =	"A minimum area {VLSI} network for {$O(\log n)$} time sorting"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"64--70"
, precedes =	"bp-mavno-85"
}

@article{bp-mavno-85
, author =	"G. Bilardi and F. P. Preparata"
, title =	"A minimum area {VLSI} network for {$O(\log n)$} time sorting"
, journal =	"IEEE Trans. Comput."
, volume =	"C-34"
, year =	1985
, pages =	"336--343"
, succeeds =	"bp-mavno-84"
}

@inproceedings{bp-lbptt-95
, author =	"G. Bilardi and F. P. Preparata"
, title =	"Lower bounds to processor-time tradeoffs under bounded-speed message propagation"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"1--12"
, update =	"99.07 bibrelex, 98.07 bibrelex, 96.09 orourke"
}

@techreport{bp-pangs-??
, author =	"G. Bilardi and F. P. Preparata"
, title =	"Probabilistic analysis of a new geometric searching technique"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, keywords =	"point location, probabilistic analysis"
}

@incollection{bs-ovcdf-87
, author =	"Gianfranco Bilardi and Majid Sarrafzadeh"
, title =	"Optimal {VLSI} Circuits for the Discrete {Fourier} Transform"
, editor =	"Franco P. Preparata"
, booktitle =	"Parallel and Distributed Computing"
, series =	"Adv. Comput. Res."
, volume =	4
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1987
, pages =	"87--101"
, update =	"01.04 icking"
}

@article{b-htssg-88
, author =	"L. Billera"
, title =	"Homology theory of smooth splines: generic triangulations and a conjecture of {Strang}"
, journal =	"Trans. Amer. Math. Soc."
, volume =	310
, year =	1988
, pages =	"325--340"
, update =	"98.07 bibrelex"
}

@incollection{bb-fnpc-97
, author =	"L. J. Billera and A. Bj{\"o}rner"
, title =	"Face numbers of polytopes and complexes"
, chapter =	15
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"291--310"
, update =	"97.11 orourke"
}

@article{bfs-ccsp-90
, author =	"L. J. Billera and P. Filliman and B. Sturmfels"
, title =	"Constructions and Complexity of Secondary Polytopes"
, journal =	"Adv. Math."
, volume =	83
, year =	1990
, pages =	"155--179"
, update =	"97.11 bibrelex"
}

@article{bl-psmcf-81
, author =	"L. J. Billera and C. W. Lee"
, title =	"A Proof of the Suffiency of {McMullen}'s Conditions for $f$-vectors of Simplicial Polytopes"
, journal =	"J. Combin. Theory Ser. A"
, volume =	31
, number =	3
, year =	1981
, pages =	"237--255"
, update =	"98.03 bibrelex"
}

@article{bm-bsebs-87
, author =	"L. J. Billera and K. E. Magurn"
, title =	"Balanced subdivision and enumeration in balanced spheres"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"297--317"
}

@article{br-dsms-91
, author =	"L. J. Billera and L. L. Rose"
, title =	"A dimension series for multivariate splines"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"107--128"
}

@incollection{b-sat3m-64
, author =	"R. H. Bing"
, title =	"Some aspects of the topology of $3$-manifolds related to the {Poincar\'e} conjecture"
, booktitle =	"Lectures in Modern Mathematics"
, volume =	2
, publisher =	"John Wiley \& Sons"
, year =	1964
, pages =	"93--128"
, keywords =	"triangulation, three-dimensional, shellability, topology"
, update =	"99.11 bibrelex, 95.09 korneenko"
, annote =	"possibly some other topics"
}

@book{bp-fa-94
, author =	"D. Bini and V. Y. Pan"
, title =	"Fundamental Algorithms"
, series =	"Polynomial and Matrix Computations"
, volume =	1
, publisher =	"Birkh{\"a}user"
, address =	"Boston, MA"
, year =	1994
, update =	"98.07 bibrelex"
}

@techreport{bs-gwbev-89
, author =	"B. Birgisson and G. Shannon"
, title =	"GraphView: {A} Workstation-Based Environment for Viewing Graphs and Animating Graph Algorithms"
, number =	295
, institution =	"Department of Computer Science, Indiana University"
, year =	1989
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@mastersthesis{b-lvpop-96
, author =	"R. Birk"
, title =	"L{\"o}sung von {Varianten} des {Post-Office-Problems} mit {Hilfe} von {Skip List Range Trees}"
, type =	"Masters Thesis"
, school =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1996
, keywords =	"masters thesis"
, update =	"96.09 smid"
}

@inproceedings{bl-facgp-91
, author =	"Y. Birk and J. B. Lotspiech"
, title =	"A fast algorithm for connecting grid points to the boundary with nonintersecting straight lines"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"465--474"
}

@book{bgm-sma-65
, author =	"Birkhoff and Garret and S. {MacLane}"
, title =	"A Survey of Modern Algebra"
, edition =	"3rd"
, publisher =	"MacMillan"
, address =	"New York, NY"
, year =	1965
, update =	"97.11 bibrelex"
}

@book{bi-pl-67
, author =	"G. Birkhoff"
, title =	"Lattice Theory"
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1967
, keywords =	"graph drawing, planar, upward, lattice"
, update =	"95.05 tamassia"
}

@article{b-cgra-88
, author =	"F. G. Bischoff"
, title =	"Computational geometry for reactor applications"
, journal =	"Trans. Amer. Nuclear Soc."
, volume =	57
, year =	1988
, pages =	"112--113"
, keywords =	"facility location"
, update =	"95.05 korneenko"
}

@inproceedings{bm-carnd-95
, author =	"P. Biscondi and J.-M. Moreau"
, title =	"Computer-Aided Road Network Design"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"229--234"
, update =	"95.09 jones"
}

@book{bb-ca-85
, author =	"E. Bishop and D. Bridges"
, title =	"Constructive Analysis"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1985
, update =	"97.11 bibrelex"
}

@techreport{bst-cre-90
, author =	"V. Bistiolas and D. Sofotassios and A. Tsakalidis"
, title =	"Computing Rectangle Enclosures"
, type =	"Technical {Report}"
, number =	"90.12.3?"
, institution =	"Univ. of Patras"
, address =	"Greece"
, year =	1990
, precedes =	"bst-cre-93"
, update =	"95.05 korneenko, 93.09 milone+mitchell"
}

@article{bst-cre-93
, author =	"V. Bistiolas and D. Sofotassios and A. Tsakalidis"
, title =	"Computing rectangle enclosures"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	6
, year =	1993
, pages =	"303--308"
, keywords =	"isothetic, enclosure"
, succeeds =	"bst-cre-90"
, update =	"95.05 korneenko"
}

@techreport{bst-pse-90
, author =	"V. Bistiolas and D. Sofotassios and A. Tsakalidis"
, title =	"On Point and Segment Enclosures"
, type =	"Technical {Report}"
, number =	"90.06.18"
, institution =	"Univ. of Patras"
, address =	"Greece"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{bpp-rwcvp-98
, author =	"Supriya Biswas and D. Chithra Prasad and Sudebkumar Prasant Pal"
, title =	"Recognizing weakly convex visible polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"171--186"
, update =	"98.11 devillers"
}

@article{bt-gest-89
, author =	"T. Bisztricky and G. Fejes T{\'o}th"
, title =	"A generalization of the {Erd{\H{o}}s-Szekeres} theorem"
, journal =	"J. Reine Angew. Math."
, volume =	395
, year =	1989
, pages =	"167--170"
, update =	"02.03 devillers"
}

@book{bmsw-pacc-94
, title =	"Polytopes: Abstract, Convex and Computational"
, editor =	"T. Bisztriczky and P. McMullen and R. Schneider and A. Ivi\'c Weiss"
, series =	"NATO ASI Series"
, volume =	440
, publisher =	"Kluwer Academic Publishers"
, year =	1994
, update =	"96.05 pocchiola"
}

@article{bdhm-tps-84
, author =	"D. Bitton and D. J. DeWitt and D. K. Hsiao and J. Menon"
, title =	"A Taxonomy of Parallel Sorting"
, journal =	"ACM Comput. Surv."
, volume =	16
, number =	3
, year =	1984
, pages =	"287--318"
, update =	"96.09 orourke"
}

@phdthesis{b-vagt-93
, author =	"Iliana Bjorling-Sachs"
, title =	"Variations on the Art Gallery Theorem"
, school =	"Rutgers University"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@techreport{bs-tbegm-92t
, author =	"Iliana Bjorling-Sachs and Diana L. Souvaine"
, title =	"A Tight Bound for Edge Guards in Monotone Polygons"
, type =	"Technical Report"
, number =	"92-52"
, institution =	"DIMACS, Rutgers University"
, year =	1992
, update =	"98.11 bibrelex"
}

@techreport{bs-tbgph-91
, author =	"I. Bjorling-Sachs and D. L. Souvaine"
, title =	"A tight bound for guarding polygons with holes"
, type =	"Report"
, number =	"LCSR-TR-165"
, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1991
, keywords =	"visibility, point guards, art gallery, simple polygon with holes"
}

@article{bs-eagpp-95
, author =	"I. Bjorling-Sachs and D. L. Souvaine"
, title =	"An efficient algorithm for guard placement in polygons with holes"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"77--109"
, update =	"96.05 smid"
}

@inproceedings{bs-tbegm-92
, author =	"I. Bjorling-Sachs and D. L. Souvaine"
, title =	"Tight bounds for edge guards in monotone polygons and rectilinear monotone polygons"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"93--98"
, cites =	"a-agpiv-84, c-ctpg-75, gjpt-tsp-78, o-agta-87, st-gprp-88, s-rrag-90, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@incollection{b-tm-95
, author =	"A. Bj{\"o}rner"
, title =	"Topological Methods"
, chapter =	34
, editor =	"R. L. Graham and M. Gr{\"o}tschel and L. Lov{\'a}sz"
, booktitle =	"Handbook of Combinatorics"
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	1995
, pages =	"1819--1872"
, update =	"00.03 agarwal"
}

@article{bez-halr-90
, author =	"A. Bj{\"o}rner and P. H. Edelman and G. M. Ziegler"
, title =	"Hyperplane arrangements with a lattice of regions"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"263--288"
}

@book{blwsz-om-93
, author =	"A. Bj{\"o}rner and M. {Las Vergnas} and N. White and B. Sturmfels and G. M. Ziegler"
, title =	"Oriented Matroids"
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1993
, update =	"98.11 bibrelex, 98.07 agarwal+bibrelex, 95.05 agarwal"
}

@inproceedings{bly-ldtve-93
, author =	"Anders Bj{\"o}rner and L{\'a}szl{\'o} Lov{\'a}sz and Andrew Chi-Chih Yao"
, title =	"Linear decision trees: {V}olume estimates and topological bounds"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"170--177"
, update =	"97.11 icking, 97.03 agarwal"
}

@article{bz-csca-92
, author =	"A. Bj{\" o}rner and G. M. Ziegler"
, title =	"Combinatorial stratification of complex arrangements"
, journal =	"J. Amer. Math. Soc."
, volume =	5
, year =	1992
, pages =	"105--149"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@techreport{bw-imsep-84
, author =	"P. E. Bjorstad and O. B. Widlund"
, title =	"Iterative methods for the solution of elliptic problems on regions partitioned into substructures"
, type =	"Report"
, number =	"TR136"
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, year =	1984
}

@inproceedings{b-ct-96
, author =	"Ted Blacker"
, title =	"The cooper tool"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"13--29"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@manual{bbehlmstwobclpwwt-cmgev-94
, author =	"T. D. Blacker and W. J. Bohnhoff and T. L. Edwards and J. R. Hipp and R. R. Lober and S. A. Mitchell G. D. Sjaardema and T. J. Tautges and T. J. Wilson and W. R. Oakes and S. Benzley and J. C. Clements and L. Lopez-Buriek and S. Parker and M. Whitely and D. White and E. Trimble"
, title =	"CUBIT mesh generation environment volume 1: users manual"
, organization =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, month =	may
, year =	1994
, note =	"SAND94-1100"
, update =	"01.07 devillers, 98.07 bibrelex"
}

@article{bj-etb-84
, author =	"C. E. Blair and R. G. Jeroslow"
, title =	"Extension of a theorem of {Balas}"
, journal =	"Discrete Appl. Math."
, volume =	9
, year =	1984
, pages =	"11--26"
}

@inproceedings{blhrs-iacv-96
, author =	"Gregoria Blanco and Jes{\'u}s Garc{\'\i}a L{\'o}pez and Ferran Hurtado and Pedro Ramos and Vera Sacrist{\'a}n"
, title =	"Incidence Angle Constrained Visibility"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"27--28"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{b-calp-77
, author =	"R. G. Bland"
, title =	"A combinatorial abstraction of linear programming"
, journal =	"J. Combin. Theory Ser. B"
, volume =	23
, year =	1977
, pages =	"33--57"
, update =	"97.03 gaertner+salinger"
}

@article{b-nfprs-77
, author =	"R. G. Bland"
, title =	"New finite pivoting rules for the simplex method"
, journal =	"Math. Oper. Res."
, volume =	2
, year =	1977
, pages =	"103--107"
, update =	"97.03 gaertner+salinger"
}

@article{bv-om-78
, author =	"R. G. Bland and M. {Las Vergnas}"
, title =	"Orientability of Matroids"
, journal =	"J. Combin. Theory"
, volume =	23
, year =	1978
, pages =	"94--123"
, update =	"98.11 bibrelex"
}

@article{bd-glihf-93
, author =	"J. Blaney and S. Dixon"
, title =	"A good ligand is hard to find: {Automated} docking methods"
, journal =	"Perspectives in Drug Discovery and Design"
, volume =	1
, year =	1993
, pages =	"310--319"
, update =	"98.07 bibrelex"
}

@inproceedings{buma-ggfdp-90
, author =	"H. Blanken and A. Ubema and P. Meek and B. Akker"
, title =	"The generalized grid file: description and performance aspects"
, booktitle =	"Proc. IEEE Internat. Conf. Data Eng."
, site =	"Los-Angeles, Calif."
, year =	1990
, pages =	"380--388"
, keywords =	"data structuring"
, update =	"95.05 korneenko"
}

@inproceedings{bg-eest-90
, author =	"Gabriele Blankenagel and Ralf Hartmut G{\"u}ting"
, title =	"{EST}: {Externe} {Segment} {Trees}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	8
, update =	"00.03 bibrelex"
}

@techreport{bg-ieapr-87
, author =	"G. Blankenagel and R. H. G{\"u}ting"
, title =	"Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
, type =	"Report"
, number =	228
, institution =	"Fachber. Inform., Univ. Dortmund"
, address =	"Dortmund, West Germany"
, year =	1987
, precedes =	"bg-ieapr-88"
}

@inproceedings{bg-ieapr-88
, author =	"G. Blankenagel and R. H. G{\"u}ting"
, title =	"Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"85--89"
, comments =	"extended abstract"
, succeeds =	"bg-ieapr-87"
, precedes =	"bg-ieapr-90"
, update =	"00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@article{bg-ieapr-90
, author =	"G. Blankenagel and R. H. G{\"u}ting"
, title =	"Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"251--276"
, succeeds =	"bg-ieapr-88"
}

@incollection{bps-aamv-89
, author =	"W.-E. Blanz and D. Petkovic and J. L. C. Sanz"
, title =	"Algorithms and Architectures for Machine Vision"
, editor =	"C. H. Chen"
, booktitle =	"Signal Processing Handbook"
, publisher =	"M. Dekker"
, address =	"New York"
, year =	1989
, update =	"98.07 bibrelex"
}

@book{b-kuk-16
, author =	"W. Blaschke"
, title =	"Kreis und {Kugel}"
, publisher =	"??"
, address =	"Leipzig"
, year =	1916
, update =	"98.07 bibrelex"
}

@inproceedings{bmt-dppbp-96
, author =	"Guy Blelloch and Gary L. Miller and Dafna Talmor"
, title =	"Developing a Practical Projection-Based Parallel {Delaunay} Algorithm"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"186--195"
, cites =	"acgoy-pcg-88, bey-eedt-91a, bmt-pdti-94, bchsz-ipndp-94, bl-psgps-94, csy-oscpf-95, c-pagp-80, cgo-mftpe-90, dddfk-rp3dc-95, d-sdcac-86, es-otatd-91, gg-ptpch-91, gs-pmgsc-85, ks-upcha-86, lf-ppc-80, m-piadt-92, mttw-dbnmt-95, ol-mcp-81, ps-cgi-85, rs-pnrst-89, sh-cpp-75, s-epacp-94, sd-csdta-95, tsbp-dpatd-93, t-dmwhf-63, vvm-eetpa-92, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{bmt-pdti-94
, author =	"G. Blelloch and G. L. Miller and D. Talmor"
, title =	"Parallel {Delaunay} triangulation imlpementation"
, booktitle =	"Proc. 4th MSI Workshop Comput. Geom."
, month =	oct
, year =	1994
, update =	"97.11 bibrelex"
}

@article{bchsz-ipndp-94
, author =	"G. E. Blelloch and S. Chatterjee and J. C. Hardwick and J. Sipelstein and M. Zagha"
, title =	"Implementation of a portable nested data-parallel language"
, journal =	"J. Parallel Distrib. Comput."
, volume =	21
, number =	1
, month =	apr
, year =	1994
, pages =	"4--14"
, update =	"97.11 bibrelex"
}

@inproceedings{blmpsz-csacm-91
, author =	"G. E. Blelloch and C. E. Leiserson and B. M. Maggs and C. G. Plaxton and S. J. Smith and M. Zagha"
, title =	"A comparison of sorting algorithms for the connection machine {CM-2}"
, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
, year =	1991
, pages =	"3--16"
, update =	"96.09 orourke"
}

@inproceedings{bl-psgps-88
, author =	"G. E. Blelloch and J. Little"
, title =	"Parallel solutions to geometric problems on the scan model of computation"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, volume =	3
, year =	1988
, pages =	"218--222"
, keywords =	"parallel computation"
, update =	"95.05 korneenko"
}

@article{bl-psgps-94
, author =	"G. E. Blelloch and J. J. Little"
, title =	"Parallel solutions to geometric problems in the scan model of computation"
, journal =	"J. Comput. Syst. Sci."
, volume =	48
, number =	1
, month =	feb
, year =	1994
, pages =	"90--115"
, update =	"97.11 bibrelex"
}

@article{bmht-dippd-99
, author =	"G. E. Blelloch and G. L. Miller and J. C. Hardwick and D. Talmor"
, title =	"Design and Implementation of a Practical Parallel {Delaunay} Algorithm"
, journal =	"Algorithmica"
, volume =	24
, number =	3
, year =	1999
, pages =	"243--269"
, update =	"99.11 held"
}

@phdthesis{b-cmda-92
, author =	"C. Bliek"
, title =	"Computer Methods for Design Automation"
, type =	"Ph.{D}. Thesis"
, school =	"Massachusetts Institute of Technology"
, address =	"Cambridge, Massachusetts"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"95.05 abrams"
}

@article{b-hflts-77
, author =	"J. Blinn"
, title =	"A homogeneous formulation for lines in three-space"
, journal =	"Comput. Graph."
, volume =	11
, number =	2
, year =	1977
, pages =	"237--241"
, note =	"Proc. SIGGRAPH '77"
}

@techreport{b-mrsdh-
, author =	"J. F. Blinn"
, title =	"A Method for Removing Some Degeneracies in Hidden Line and Ray Tracing Calculations"
, institution =	"Jet Propulsion Lab."
, year =	"??"
, update =	"98.03 bibrelex"
}

@article{b-tdgpl-91
, author =	"J. F. Blinn"
, title =	"A trip down the graphics pipeline: {Line} clipping"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	11
, number =	1
, year =	1991
, pages =	"98--105"
, keywords =	"clipping"
, update =	"95.05 korneenko"
}

@article{b-cwbcb-89
, author =	"E. D. Bloch"
, title =	"Complexes whose boundaries cannot be pushed around"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"365--374"
}

@inproceedings{b-csrpt-91
, author =	"J. Bl{\"o}mer"
, title =	"Computing Sums of Radicals in Polynomial Time"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"670--677"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{b-hdrnr-92
, author =	"J. Bl{\"o}mer"
, title =	"How to Denest {Ramanujan's} Nested Radicals"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"447--457"
, update =	"97.03 gaertner+salinger"
}

@article{br-olbds-89
, author =	"P. A. Bloniarz and S. S. Ravi"
, title =	"An $\Omega(n\log n)$ lower bound for decomposing a set of points into chains"
, journal =	"Inform. Process. Lett."
, volume =	31
, year =	1989
, pages =	"319--322"
, keywords =	"lower bounds, points"
, update =	"95.05 korneenko"
}

@article{b-ctp-77
, author =	"G. S. Bloom"
, title =	"A counterexamlpe to a theorem of {Piccard}"
, journal =	"J. Combin. Theory Ser. A"
, volume =	22
, year =	1977
, pages =	"378--379"
, update =	"97.11 bibrelex"
}

@incollection{b-isp-94
, author =	"Jules Bloomenthal"
, title =	"An Implicit Surface Polygonizer"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"324--349"
, keywords =	"iso-surface, marching cubes, polygonization"
, update =	"94.09 heckbert"
, annote =	"Gives code to polygonize an arbitrary implicit surface.
Polygonization is a common approach to implicit surface rendering and volume
rendering. When combined with code for trilinear interpolation code, a
program for polygonizing volume data can easily be constructed. The
resulting polygonizations will be superior to those generated by the
``Marching Cubes'' algorithm, in many cases. Contains C code."
}

@book{b-iis-97
, title =	"Introduction to Implicit Surfaces"
, editor =	"Jules Bloomenthal"
, volume =	391
, publisher =	"Morgan-Kaufmann"
, year =	1997
, update =	"00.03 devillers"
}

@article{b-pis-88
, author =	"J. Bloomenthal"
, title =	"Polygonization of implicit surfaces"
, journal =	"Comput. Aided Geom. Design"
, volume =	5
, number =	4
, year =	1988
, pages =	"341--355"
, keywords =	"surface fitting"
, update =	"95.05 korneenko"
}

@inproceedings{bc-olaip-93
, author =	"Avrim Blum and Prasad Chalasani"
, title =	"An On-Line Algorithm for Improving Performance in Navigation"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"2--11"
, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@article{bc-oaipn-00
, author =	"A. Blum and P. Chalasani"
, title =	"An online algorithm for improving performance in navigation"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"1907--1938"
, update =	"01.04 smid"
}

@inproceedings{bcv-cfakm-95
, author =	"A. Blum and P. Chalasani and S. Vempala"
, title =	"A constant-factor approximation for the $k$-{MST} problem in the plane"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '95"
, year =	1995
, pages =	"294--302"
, update =	"98.07 bibrelex, 97.03 agarwal, 96.01 smid, 95.09 mitchell"
}

@inproceedings{bk-likhu-93
, author =	"Avrim Blum and Ravi Kannan"
, title =	"Learning an Intersection of $k$ Halfspaces Over a Uniform Distribution"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"312--320"
, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid+tamassia, 93.09 milone+mitchell"
}

@inproceedings{brs-nugt-91
, author =	"A. Blum and P. Raghavan and B. Schieber"
, title =	"Navigating in unfamiliar geometric terrain"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"494--503"
, keywords =	"path planning, on-line"
, comments =	"Computing Reviews 9111-0883"
, succeeds =	"brs-nut-90, brs-nugt-97"
, cites =	"py-spwm-89"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@article{brs-nugt-97
, author =	"A. Blum and P. Raghavan and B. Schieber"
, title =	"Navigating in unfamiliar geometric terrain"
, journal =	"SIAM J. Comput."
, volume =	26
, number =	1
, month =	feb
, year =	1997
, pages =	"110--137"
, succeeds =	"brs-nugt-91"
, update =	"98.03 mitchell, 97.07 smid"
}

@inproceedings{brs-nut-90
, author =	"A. Blum and P. Raghavan and B. Schieber"
, title =	"Navigating in Unfamiliar Terrain"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, precedes =	"brs-nugt-91"
, update =	"98.11 bibrelex"
}

@inproceedings{br-t3nnn-88
, author =	"A. Blum and R. Rivest"
, title =	"Training a $3$-node neural network is {NP}-complete"
, booktitle =	"Proc. 1st. Workshop Comput. Learning Th."
, year =	1988
, pages =	"9--18"
, update =	"98.03 bibrelex"
}

@article{b-gb-74
, author =	"H. Blum"
, title =	"A Geometry for Biology"
, journal =	"Math. Analysis of Fundamental Biological Phenomena"
, volume =	231
, number =	1
, year =	1974
, pages =	"19--30"
, update =	"93.09 held"
}

@incollection{b-tends-67
, author =	"H. Blum"
, title =	"A transformation for extracting new descriptors of shape"
, editor =	"W. Wathen-Dunn"
, booktitle =	"Models for the Perception of Speech and Visual Form"
, publisher =	"MIT Press"
, year =	1967
, pages =	"362--380"
, update =	"96.09 orourke"
}

@article{bss-tccrn-89
, author =	"L. Blum and M. Shub and S. Smale"
, title =	"On a theory of computation and complexity over the real numbers: {NP}-completeness, recursive functions and universal machines"
, journal =	"Bull. Amer. Math. Soc."
, volume =	21
, number =	"1--46"
, year =	1989
, update =	"98.11 bibrelex"
}

@article{bfprt-tbs-73
, author =	"M. Blum and R. W. Floyd and V. Pratt and R. L. Rivest and R. E. Tarjan"
, title =	"Time bounds for selection"
, journal =	"J. Comput. Syst. Sci."
, volume =	7
, year =	1973
, pages =	"448--461"
, update =	"97.11 bibrelex"
}

@article{bk-dpcw-95
, author =	"Manuel Blum and Sampath Kannan"
, title =	"Designing Programs that Check Their Work"
, journal =	"J. ACM"
, volume =	42
, number =	1
, month =	jan
, year =	1995
, pages =	"269--291"
, update =	"97.03 tamassia"
}

@inproceedings{bk-ptctw-89
, author =	"M. Blum and S. Kannan"
, title =	"Programs that check their work"
, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{bk-pcwma-78
, author =	"M. Blum and D. Kozen"
, title =	"On the power of the compass (or, why mazes are easier to search than graphs)"
, booktitle =	"Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1978
, pages =	"132--142"
}

@article{blr-stcan-93
, author =	"Manuel Blum and Michael Luby and Ronitt Rubinfeld"
, title =	"Self-Testing/Correcting with Applications to Numerical Problems"
, journal =	"J. Comput. Syst. Sci."
, volume =	47
, number =	3
, year =	1993
, pages =	"549--595"
, succeeds =	"blr-scanp-90"
, update =	"98.07 tamassia+vismara"
}

@inproceedings{blr-scanp-90
, author =	"M. Blum and M. Luby and R. Rubinfeld"
, title =	"Selftesting/correcting with applications to numerical problems"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"73--83"
, update =	"97.11 bibrelex"
}

@article{bm-anrow-80
, author =	"N. Blum and K. Mehlhorn"
, title =	"On the average number of rebalancing operations in weight-balanced trees"
, journal =	"Theoret. Comput. Sci."
, volume =	11
, year =	1980
, pages =	"303--320"
, update =	"98.03 bibrelex"
}

@book{bm-sg-70
, author =	"L. M. Blumenthal and K. Menger"
, title =	"Studies in Geometry"
, publisher =	"W. H. Freeman"
, address =	"San Francisco, CA"
, year =	1970
}

@inproceedings{bbehw-clgcv-86
, author =	"A. Blumer and A. Ehrenfeucht and D. Haussler and M. Warmuth"
, title =	"Classifying learnable geometric concepts with Vapnik-Chervonenkis dimension"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, update =	"97.11 bibrelex"
}

@article{behw-clgcv-89
, author =	"A. Blumer and A. Ehrenfeucht and D. Haussler and M. Warmuth"
, title =	"Learnability and the {Vapnik}-{Chervonenkis} Dimension"
, journal =	"J. ACM"
, volume =	36
, year =	1989
, pages =	"929--965"
, keywords =	"pattern recognition, probability theory, probabilistic geometry, approximation, separation, probabilistic analysis"
, update =	"97.11 bibrelex"
}

@inproceedings{bgp-cdnsc-98
, author =	"Marko Boben and Harald Gropp and Toma{\v z} Pisanski"
, title =	"Computer Drawings of Non-Symmetric Configurations"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"37--40"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{bw-rphs-88
, author =	"J. Bobowski and J. M. Wills"
, title =	"Regular polyhedra with hidden symmetry"
, journal =	"The Mathematical Intelligencer"
, volume =	10
, number =	11
, year =	1988
, pages =	"27--32"
, update =	"98.07 bibrelex"
}

@article{bdg-tocrm-85
, author =	"J. Bobrow and S. Dubowsky and J. Gibson"
, title =	"Time-Optimal Control of Robot Manipulators"
, journal =	"Internat. J. Robot. Res."
, volume =	4
, number =	3
, year =	1985
, update =	"97.11 bibrelex"
}

@inproceedings{bdg-ocrma-83
, author =	"J. E. Bobrow and S. Dubowsky and J. S. Gibson"
, title =	"On the Optimal Control of Robotic Manipulators with Actuator Constraints"
, booktitle =	"Proc. ACC"
, site =	"San Francisco, CA"
, year =	1983
, pages =	"782--787"
, update =	"97.11 bibrelex"
}

@book{b-iha-07
, author =	"Maxime Bocher"
, title =	"Introduction to higher algebra"
, publisher =	"Macmillan"
, year =	1907
, update =	"97.03 tamassia"
}

@inproceedings{bm-csdp-97
, author =	"Daciana Bochis and Marisa Mazon"
, title =	"Combinatorial Structure of {Dirichlet} Partitions"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"51--54"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{bs-mnf3d-98
, author =	"Daciana Bochis and Francisco Santos"
, title =	"On the Maximal Number of Facets of 3-Dimensional {Dirichlet} Stereohedra"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"41--43"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{bgr-sppta-95
, author =	"D. F. Bochis and M. J. Gonz{\'a}lez-L{\'o}pez and T. Recio"
, title =	"Simulation Program of the Path Tracking for Any Irredundant Planar Manipulator and the {6R} Manipulator"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"71--73"
, update =	"00.03 bibrelex"
}

@book{bcr-gar-87
, author =	"J. Bochnak and M. Coste and M.-F. Roy"
, title =	"G\'eom\'etrie Alg\'ebrique R\'eelle"
, publisher =	"Springer-Verlag"
, address =	"Heidelberg"
, year =	1987
, update =	"98.07 agarwal, 95.05 agarwal"
}

@book{b-ak-74
, author =	"H. H. Bock"
, title =	"Automatische {Klassifikation}"
, publisher =	"Vandenhoeck \& Ruprecht"
, address =	"G{\"o}ttingen, West Germany"
, year =	1974
, update =	"98.07 bibrelex"
}

@techreport{bl-app-89
, author =	"L. Bodin and L. Levy"
, title =	"The arc partitioning problem"
, institution =	"College of Bus. and Mgmt., Univ. of Maryland at College Park"
, month =	feb
, year =	1989
, update =	"93.09 milone+mitchell"
}

@article{bfk-scsmc-84
, author =	"W. Boehm and G. Farin and J. Kahmann"
, title =	"A survey of curve and surface methods in {CAGD}"
, journal =	"Comput. Aided Geom. Design"
, volume =	1
, number =	1
, year =	1984
, pages =	"1--60"
, update =	"98.07 bibrelex"
}

@article{b-siacs-91
, author =	"E. Boender"
, title =	"A survey of intersection algorithms for curved surfaces"
, journal =	"Comput. Graph. (UK)"
, volume =	15
, number =	1
, year =	1991
, pages =	"109--115"
, keywords =	"intersection, curvilinear, three-dimensional, survey"
, update =	"95.05 korneenko"
}

@article{b-sdmsb-88
, author =	"F. G. Boese"
, title =	"Surface Drawing Made Simple -- But Not Too Simple"
, journal =	"Comput. Aided Design"
, volume =	20
, number =	5
, month =	jun
, year =	1988
, pages =	"249--258"
, update =	"93.09 held"
}

@article{bk-pmmm-84
, author =	"T. B. Boffey and J. Karkazis"
, title =	"$P$-medians and multi-medians"
, journal =	"J. Oper. Res. Society"
, volume =	35
, number =	1
, year =	1984
, pages =	"57--64"
, keywords =	"facility location"
, update =	"95.05 korneenko"
}

@techreport{bilf-putg-91
, author =	"K. P. Bogart and G. Isaak and L. Langley and P. C. Fishburn"
, title =	"Proper and Unit Tolerance Graphs"
, type =	"Technical Report"
, number =	"91-74"
, institution =	"DIMACS"
, month =	nov
, year =	1991
, update =	"98.11 bibrelex"
}

@techreport{bs-adssv-95
, author =	"P. Bogdanovich and H. Samet"
, title =	"The ATRee: A data structure to support very large scientific databases"
, type =	"Computer Science Department"
, number =	"CS-TR-3455"
, institution =	"University of Maryland"
, month =	mar
, year =	1995
, update =	"96.05 efrat"
}

@article{b-dgmnb-88
, author =	"A. Bogomolny"
, title =	"Digital geometry may not be discrete"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	43
, number =	2
, year =	1988
, pages =	"205--220"
, keywords =	"digital geometry"
, update =	"95.05 korneenko"
}

@techreport{b-smc-49
, author =	"D. J. Bogue"
, title =	"The structure of the metropolitan community"
, type =	"Report"
, number =	"??"
, institution =	"Univ. Mich. Contributions Inst. Human Adjustment Social Sci."
, address =	"Ann Arbor, MI"
, year =	1949
}

@incollection{b-wdwnb-90
, author =	"G. Bohlender"
, title =	"What do we need beyond {IEEE}-arithmetics?"
, booktitle =	"Computer Arithmetic and self-validating numerical methods"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1990
, pages =	"1--32"
, update =	"98.07 bibrelex"
}

@book{bruw-pcmls-86
, author =	"G. Bohlender and L. B. Rall and C. Ullrich and J. {Wolff von Gudenberg}"
, title =	"{PASCAL-CS} - {A} Microcomputer Language for Scientific Computation"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{b-ansrt-90
, author =	"J. B{\"o}hm"
, title =	"Addendum to the note ``{Some} remarks on triangulating a $d$-cube''"
, journal =	"Beitr. Algebra Geom."
, volume =	30
, year =	1990
, pages =	"167--168"
, keywords =	"$d$-dimensional, hypercube, triangulation"
, update =	"95.05 korneenko"
}

@article{b-srtdc-89
, author =	"J. B{\"o}hm"
, title =	"Some remarks on triangulating a $d$-cube"
, journal =	"Beitr. Algebra Geom."
, volume =	29
, year =	1989
, pages =	"195--218"
, keywords =	"$d$-dimensional, hypercube, triangulation"
, update =	"95.05 korneenko"
}

@book{bs-dcmta-84
, author =	"K. B{\"o}hmer and H. J. Stetter"
, title =	"Defect correction methods, theory and applications"
, publisher =	"Springer-Verlag"
, year =	1984
, update =	"97.11 bibrelex"
}

@inproceedings{bn-ucasa-90
, author =	"K. Bohringer and F. {Newbery Paulisch}"
, title =	"Using Constraints to Achieve Stability in Automatic Graph Layout Algorithms"
, booktitle =	"Proc. ACM Conf. on Human Factors in Computing Systems"
, nickname =	"CHI"
, year =	1990
, pages =	"43--51"
, keywords =	"graph drawing"
, update =	"98.07 vismara, 96.09 tamassia, 93.09 tamassia"
}

@inproceedings{bbg-smutv-95
, author =	"K.-F. B{\"o}hringer and V. Bhatt and K. Y. Goldberg"
, title =	"Sensorless manipulation using transverse vibrations of a plate"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Nagoya, Japan"
, year =	1995
, pages =	"1989--1996"
, update =	"98.07 bibrelex"
}

@inproceedings{bdh-abpfe-97
, author =	"K.-F. B{\"o}hringer and B. Donald and D. Halperin"
, title =	"The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"457--459"
, cites =	"bbg-smutv-95, bdm-scsaa-96, bdm-ulbpv-96, do-hssp-90, e-acg-87, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{bdm-scsaa-96
, author =	"K.-F. B{\"o}hringer and B. R. Donald and N. C. MacDonald"
, title =	"Single-crystal silicon actuator arrays for micro manipulation tasks"
, booktitle =	"Proc. IEEE Workshop on Micro Electro Mechanical Systems"
, nickname =	"MEMS"
, site =	"San Diego, CA"
, month =	feb
, year =	1996
, update =	"98.07 bibrelex"
}

@incollection{bdm-ulbpv-96
, author =	"K.-F. B{\"o}hringer and B. R. Donald and N. C. MacDonald"
, title =	"Upper and lower bounds for programmable vector fields with applications to {MEMS} and vibratory plate part feeders"
, editor =	"J.-P. Laumond and M. H. Overmars"
, booktitle =	"Algorithms for Robotic Motion and Manipulation"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1996
, pages =	"255--276"
, update =	"98.07 bibrelex"
}

@article{b--94
, author =	"Jean-Daniel Boissonnat"
, title =	"??"
, journal =	"J. Mol Graphics"
, volume =	12
, year =	1994
, pages =	"61--62"
, update =	"99.07 devillers, 98.03 bibrelex"
}

@inproceedings{b-asmra-86
, author =	"Jean-Daniel Boissonnat"
, title =	"Automatic Solid Modeler For Robotics Applications"
, booktitle =	"Robotics Research: Third International Symposium. MIT Press Series in Artificial Intelligence."
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1986
, pages =	"65--72"
, keywords =	"Delaunay triangulation, geometric shape representation, geometric solid modeler"
, update =	"99.07 devillers"
, annote =	"3D DT"
, abstract =	"This paper discusses several applications of the
		 Delaunay triangulation for shape representation and
		 manipulation, in the context of robotics. This
		 structure appears to be a useful tool in order to deal
		 with points scattered over surfaces of objects.
		 Reconstruction, matching and intersection problems are
		 considered. (Author abstract) 12 refs."
}

@article{b-gstds-84
, author =	"Jean-Daniel Boissonnat"
, title =	"Geometric structures for three-dimensional shape representation"
, journal =	"ACM Trans. Graph."
, volume =	3
, number =	4
, year =	1984
, pages =	"266--286"
, comments =	"further experimental results of the algorithm described in this article can be found in N. Ayache, J. D. Boissonnat, L. Cohen, B. Geiger, J. Levy-Vehel, O. Monga, P. Sander--Steps toward the Automatic Interpretation of 3D Images.  In 3D imaging in Medicine, vol F60 (1990)"
, update =	"99.07 devillers, 98.07 devillers, 93.09 milone+mitchell"
}

@inproceedings{b-pagc-98
, author =	"Jean-Daniel Boissonnat"
, title =	"Predicate Arithmetic for Geometric Computing"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	3
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{b-rs-85
, author =	"Jean-Daniel Boissonnat"
, title =	"Reconstruction of solids"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"46--54"
, comments =	"part of the results appeared in Geometric structures for 3D shape representation, ACM TOG, Vol 3, No. 4, Oct 84, pp266-286 and Shape Reconstruction for Planar Cross Sections, CGIP, Vol 44, pp 1-29 (1988) (good description on line)"
, cites =	"s-fssd-76, o-pma3d-81, fku-osrpc-77, r-pc-64, s-cg-78, k-cddvd-80, b-gstds-84, ph-chfsp-77, bwy-oetac-80, s-iggp-76, gs-cdtp-78, b-cdt-81, h-tadpe-82, m-hpppp-70, ZZZ"
, update =	"99.07 devillers, 97.11 bibrelex, 94.09 jones, 93.09 milone+mitchell"
}

@inproceedings{b-r2d3d-84
, author =	"Jean-Daniel Boissonnat"
, title =	"Representing 2d And 3d Shapes With The {Delaunay} Triangulation"
, booktitle =	"Proc. 7th IEEE Internat. Conf. Pattern Recogn."
, publisher =	"IEEE"
, address =	"New York, NY"
, year =	1984
, pages =	"745--748"
, keywords =	"Delaunay triangulation, automatic modeling, 3d shapes, 2d shapes, computer vision"
, update =	"99.07 devillers"
, annote =	"3D DT. We eliminate tetras until all points are on
		 boundary surface."
, abstract =	"In order to represent and measure a 2-dimensional or a
		 3-dimensional shape defined by a finite number of
		 points on its boundary, the author proposes to use the
		 Delaunay triangulation. It is shown that a good
		 polyhedral approximation of the shape can be obtained
		 and that a number of applications become
		 straightforward. The Delaunay triangulation appears to
		 be a useful tool in discrete curve and surface
		 analysis. 2 refs."
}

@techreport{b-srpcs-86
, author =	"Jean-Daniel Boissonnat"
, title =	"Shape reconstruction from planar cross-sections"
, type =	"Report"
, number =	546
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1986
, update =	"99.07 devillers, 98.03 bibrelex"
}

@article{b-srpcs-88
, author =	"Jean-Daniel Boissonnat"
, title =	"Shape Reconstruction From Planar Cross-Sections"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	44
, number =	1
, month =	oct
, year =	1988
, pages =	"1--29"
, keywords =	"shape reconstruction, planar cross sections, Delaunay triangulation, computational geometry"
, update =	"99.07 devillers, 93.09 devillers"
, annote =	"Computes the 3D DT between two contours (extra points
		 are added to force the boundary---by repeatedly adding
		 midpoints to edges not in DT) by merging DTs of each
		 contour. Then tetras are eliminated so that each point
		 is on the surface."
, abstract =	"We propose a new solution to the problem of
		 constructing a shape over a set of cross-sectional
		 contours. We construct a volume whose boundary is a
		 polyhedron with triangular faces intersecting the
		 cutting planes along the given contours. This volume is
		 obtained, slice by slice, by pruning the Delaunay
		 triangulations formed between two adjacent cross
		 sections. The Delaunay triangulation can be computed
		 efficiently in this specific situation: an algorithm is
		 presented that is optimal with respect to the input
		 size and the output size and that only uses
		 2-dimensional operations. The shape reconstruction
		 method extracts, from that triangulation, a maximum
		 solid with no singularity. It can handle the case where
		 the number of contours varies from one cross section to
		 the other and thus, can handle contour-defined objects
		 which are branched and have holes. This algorithm has
		 been fully implemented and tested on various examples;
		 results on medical images are presented. (Author
		 abstract) 28 Refs."
}

@techreport{bb-arcto-94
, author =	"J.-D. Boissonnat and X.-N. Bui"
, title =	"Accessibility region for a car that only moves forwards along optimal paths"
, type =	"Research Report"
, number =	2181
, institution =	"INRIA Sophia-Antipolis"
, year =	1994
, update =	"99.07 devillers, 98.03 mitchell, 97.11 bibrelex"
, abstract =	"
In [BSBL93], the   synthesis problem    has  been solved    for  a
 non-holonomic car-like robot only allowed to move forwards in a plane.
 Here  we complete  the study  of this  mobile robot  by  computing the
 SP-accessibility regions which are the sets of points reached from the
 origin configuration with an optimal path of length less than or equal
 to a given value. For that, we consider the  problem of optimising the
 paths  starting from an oriented point  and  arriving at another point
 with free orientation.   After characterising these optimal  paths, we
 compute  the  partition of the plane  w.r.t.  the types of the optimal
 paths, and finally we find the shapes of the SP-accessibility
                  regions."
}

@inproceedings{bc-cfssg-01
, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
, title =	"Coarse-to-fine surface simplification with geometric guarantees"
, editor =	"A. Chalmers and T.-M. Rhyne"
, booktitle =	"Eurographics'01"
, publisher =	"Blackwell"
, address =	"Manchester"
, year =	2001
, pages =	""
, update =	"01.11 devillers, 01.07 devillers"
}

@article{bc-ncps-01
, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
, title =	"Natural Coordinates of Points on a Surface"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"155--173"
, update =	"02.03 devillers"
}

@article{bc-nncps-01
, author =	"J.-D. Boissonnat and F. Cazals"
, title =	"Natural neighbor coordinates of points on a surface"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"155--173"
, update =	"01.11 smid"
}

@inproceedings{bc-ssrnn-00
, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
, title =	"Smooth surface reconstruction via natural neighbour interpolation of distance functions"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"223--232"
, update =	"00.11 smid, 00.07 devillers, 00.03 devillers"
}

@inproceedings{bcddprty-pcet-99
, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and Frank Da and Olivier Devillers and Sylvain Pion and Fran{\c c}ois Rebufat and Monique Teillaud and Mariette Yvinec"
, title =	"Programming with {CGAL}: The Example of Triangulations"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"421--423"
, url =	"http://www-sop.inria.fr/prisme/publis/bcddprty-pcet-99.ps.gz"
, update =	"02.03 devillers, 00.03 bibrelex, 99.11 bibrelex, 99.07 devillers"
}

@inproceedings{bcf-2sdsm-00
, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and Julia Fl{\"o}totto"
, title =	"2$D$-Structure Drawings of Similar Molecules"
, editor =	"Joe Marks"
, booktitle =	"Graph Drawing: 8th international symposium"
, series =	"Lecture Notes Comput. Sci."
, volume =	1984
, publisher =	"Springer-Verlag"
, year =	2000
, pages =	"115--126"
, update =	"01.11 devillers"
}

@inproceedings{bcn-ssr-99
, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and St{\'e}phane Nullans"
, title =	"Smooth Shape Reconstruction"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"63--68"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{bcdkl-sppbd-99
, author =	"Jean-Daniel Boissonnat and Andr\'e C\'er\'ezo and Elena Degtiariora-Kostova and Vladimir Kostov and Juliette Leblond"
, title =	"Shortest plane paths with bounded derivative of the curvature"
, journal =	"C. R. Acad. Sci."
, volume =	"329-I"
, year =	1999
, pages =	"613--618"
, succeeds =	"bcl-nspps-94"
, update =	"99.11 devillers"
}

@inproceedings{bcddy-acchs-92
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Jacqueline Duquesne and Mariette Yvinec"
, title =	"An algorithm for constructing the convex hull of a set of spheres in dimension $d$"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"269--273"
, precedes =	"bcddy-acchs-96"
, cites =	"c-ochap-91, cs-arscg-89, bdsty-arsol-92, ms-cpubc-71, r-chada-92, ss-tddsp-90, ZZZ"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.07 devillers, 97.03 devillers, 96.01 devillers, 93.09 devillers"
}

@article{bcddy-acchs-96
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Jacqueline Duquesne and Mariette Yvinec"
, title =	"An algorithm for constructing the convex hull of a set of spheres in dimension $d$"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"123--130"
, url =	"http://www-sop.inria.fr/prisme/publis/bcddy-acchs-96.ps.gz"
, succeeds =	"bcddy-acchs-92"
, cites =	"r-chada-92, ss-tddsp-90, m-mnfcp-70, c-ochap-91, cs-arscg-89, s-sdlpc-91, bdsty-arsol-92"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.07 devillers"
, abstract =	"We present an algorithm which computes the convex hull of a set of $n$ spheres i n dimension $d$ in time $O (n^{\lceil \frac{d}{2} \rceil}+n\log n)$.  It is worst-case optimal in three dimensions and in even dimensions.  The same method can also be used to compute the convex hull of a set of $n$ homo thetic convex objects of $E^d$. If the complexity of each object is constant, the time needed in the worst case is $O(n^{\lceil \frac{d}{2} \rceil}+n\log n)$."
}

@techreport{bcdt-osc3d-91t
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
, title =	"Output-sensitive construction of the $3$-d {Delaunay} triangulation of constrained sets of points"
, type =	"Research {Report}"
, number =	1415
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, month =	apr
, year =	1991
, url =	"http://www.inria.fr/RRRT/RR-1415"
, keywords =	"Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
, precedes =	"bcdt-osc3d-91i, bcdt-oscdt-96"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@inproceedings{bcdt-osc3d-91i
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
, title =	"Output-sensitive construction of the $3$-d {Delaunay} triangulation of constrained sets of points"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"110--113"
, keywords =	"Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
, succeeds =	"bcdt-osc3d-91t"
, precedes =	"bcdt-oscdt-96"
, cites =	"b-srpcs-88, bcdt-osc3d-91t, bdsty-olgag-91a, bm-sdcs-71, cs-arscg-89, e-acg-87, em-feptd-85, s-chdch-86, ZZZ"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@article{bcdt-oscdt-96
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
, title =	"Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, number =	1
, year =	1996
, pages =	"1--14"
, url =	"http://www-sop.inria.fr/prisme/publis/bcdt-oscdt-96.ps.gz"
, succeeds =	"bcdt-osc3d-91t, bcdt-osc3d-91i"
, cites =	"ps-cgi-85, e-acg-87, a-vdsfg-91, s-chdch-86, ms-loq-92, cs-arscg-89, bdsty-arsol-92, bcdt-osc3d-91i, bm-sdcs-71, bcdt-osc3d-94t, b-srpcs-88, a-pdpaa-87, c-ig-61, p-gcc-70, dmt-ssgtu-92i, gs-ccrs-87, eg-tsa-89, b-gdg-83"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.05 devillers"
, abstract =	"In this paper, we propose an algorithm to compute the
Delaunay triangulation of a set $S$ of {$n$} points in 3-dimensional
space when the points lie in 2 planes.  The algorithm is
output-sensitive and optimal with respect to the input and the output
sizes. Its time complexity is {$O(n\log n+t)$}, where {$t$} is the size
of the output, and the extra storage is {$O(n)$}."
}

@inproceedings{bcd-acchs-92
, author =	"J. D. Boissonnat and A. C{\'e}r{\'e}zo and J. Duquesne"
, title =	"An Algorithm for Constructing the Convex Hull of a Set of Spheres in Three Dimensional Space"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"51--53"
, update =	"01.07 devillers, 00.03 bibrelex"
}

@techreport{bcl-nspps-94
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C\'er\'ezo and Juliette Leblond"
, title =	"A Note on Shortest Paths in the Plane Subject to a Constraint on the Derivative of the Curvature"
, type =	"Rapport de recherche"
, number =	2160
, institution =	"INRIA"
, year =	1994
, url =	"http://www-sop.inria.fr/RRRT/RR-2160.html"
, precedes =	"bcdkl-sppbd-99"
, update =	"99.11 devillers, 99.07 devillers, 98.03 mitchell"
}

@techreport{bcl-spbcp-91
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Juliette Leblond"
, title =	"Shortest paths of bounded curvature in the plane"
, type =	"Report"
, number =	1503
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, month =	jul
, year =	1991
, precedes =	"bcl-spbcp-92"
, update =	"99.07 devillers, 95.01 devillers, 93.09 rote"
}

@inproceedings{bcl-spbcp-92
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Juliette Leblond"
, title =	"Shortest paths of bounded curvature in the plane"
, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
, year =	1992
, succeeds =	"bcl-spbcp-91"
, precedes =	"bcl-spbcp-94"
, update =	"99.07 devillers, 95.01 devillers, 93.09 rote"
}

@article{bcl-spbcp-94
, author =	"Jean-Daniel Boissonnat and Andr{\'e} C\'er\'ezo and Juliette Leblond"
, title =	"Shortest paths of bounded curvature in the plane"
, journal =	"Internat. J. Intell. Syst."
, volume =	10
, year =	1994
, pages =	"1--16"
, update =	"99.07 devillers, 95.01 devillers"
}

@inproceedings{bcdry-ctbc-94
, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jean-Marc Robert and Mariette Yvinec"
, title =	"Convex Tours of Bounded Curvature"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, nickname =	"ESA '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"254--265"
, url =	"http://www-sop.inria.fr/prisme/biblio/search.html"
, precedes =	"bcdry-ctbc-99"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.03 mitchell, 97.03 devillers, 96.01 devillers, 95.05 agarwal"
, abstract =	"
 We consider the  motion  planning problem  for a point  constrained to
 move along a  smooth (C1) closed (cycle)
 convex  path  of  bounded curvature.  The
 workspace of  the moving point  is bounded by  a convex polygon with m
 vertices, containing an obstacle in a form  of a simple polygon with n
 vertices.  We present  an O(m +   n) time algorithm  finding the path,
 going around the obstacle, whose curvature is the smallest possible."
}

@article{bcdry-ctbc-99
, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jean-Marc Robert and Mariette Yvinec"
, title =	"Convex Tours of Bounded Curvature"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"149--159"
, url =	"http://www-sop.inria.fr/prisme/biblio/"
, archive =	"XXX:cs.CG/9909004"
, succeeds =	"bcdry-ctbc-94"
, cites =	"agss-ltacv-89, dxcr-kmp-93, d-cmlca-57, fw-pcm-91, jc-pspmr-89, kslo-prpph-96, k-osps-83, l-rmp-91, o-mpic-87, o-ramp-92, os-plamp-94, p-masp-77, rs-mppmo-94, ss-ampr-90, w-mpav-88"
, update =	"99.11 devillers+smid"
, abstract =	"We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with $m$ vertices, containing an obstacle in a form of a simple polygon with $n$ vertices.  We present an $O(m+n)$ time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible."
}

@techreport{bcduy-clcst-95
, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
, title =	"Computing Largest Circles Separating Two Sets of Segments"
, type =	"Research {Report}"
, number =	2705
, institution =	"INRIA"
, address =	"BP93, 06902 Sophia-Antipolis, France"
, year =	1995
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2705"
, update =	"99.07 devillers, 96.01 devillers"
, abstract =	"A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An $\Theta(n \log  n)$ optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. This settles an open problem from a previous paper\cite{bcdy-csp-95}. In the general case, when line segments may intersect $\Omega(n^2)$ times, our algorithm can be adapted to work in $O(n \alpha(n) \log n)$ time and $O(n \alpha(n))$ space, where $\alpha(n)$ represents the extremely slowly growing inverse of Ackermann function."
}

@inproceedings{bcduy-clcst-96
, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
, title =	"Computing largest circles separating two sets of segments"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"173--178"
, precedes =	"bcduy-clcst-00"
, update =	"01.11 devillers, 99.07 devillers, 97.03 agarwal, 96.09 mitchell"
}

@article{bcduy-clcst-00
, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
, title =	"Computing Largest Circles Separating Two Sets of Segments"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"41--54"
, url =	"http://www-sop.inria.fr/prisme/publis/bcduy-clcst.ps.gz"
, archive =	"XXX/cs.CG/9909005"
, succeeds =	"bcduy-clcst-96"
, cites =	"abosy-fmcnp-89, b-cspps-88, bcdy-csp-95, bg-aoscf-95, cegss-cfals-93, dj-cmcnp-90, bds-lric-95, dk-ladsc-85, egs-cmcap-90, ep-mps-88, f-spcrd-86, ka-dd-84, k-eccs-79, k-osps-83, ld-gvdp-81, mt-cppna-85, m-lpltw-84, ms-sapo-95, m-idssp-92, okm-ccs-86"
, update =	"01.11 devillers"
, abstract =	"A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An $\Theta(n \log  n)$ optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowe d to meet only at their endpoints.  In the general case, when line segments may intersect $\Omega(n^2)$ times, our algorithm can be adapted to work in $O(n \alpha(n) \log n)$ time and $O(n \alpha(n))$ space, where $\alpha(n)$ represents the extremely slowly growing inverse of the Ackermann function."
}

@inproceedings{bcdy-csp-95
, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Mariette Yvinec"
, title =	"Circular Separability of Polygons"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"273--281"
, keywords =	"separation, containment, largest disk, Voronoi diagrams"
, precedes =	"bcdy-csp-01"
, update =	"01.11 devillers, 99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.09 agarwal, 96.05 mitchell, 96.01 devillers, 95.09 devillers, 95.01 devillers"
, abstract =	"Two planar sets are circularly separable if there exists
a circle enclosing one of the set and whose open interior disk does not
intersect the other set.  This paper studies two problems related to
circular separability. A linear-time algorithm is proposed to decide if
two polygons are circularly separable. The algorithm outputs the smallest
separating circle. The second problem asks for the largest circle included
in a preprocessed, convex polygon, under some point and/or line
constraints.  The resulting circle must contain the query points and it
must lie in the halfplanes delimited by the query lines."
}

@article{bcdy-csp-01
, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Mariette Yvinec"
, title =	"Circular Separability of Polygons"
, journal =	"Algorithmica"
, volume =	30
, year =	2001
, pages =	"67i--82"
, url =	"http://link.springer.de/link/service/journals/00453/contents/00/10078/paper/10078.pdf"
, archive =	"XXX/cs.CG/9909007"
, succeeds =	"bcdy-csp-95"
, cites =	"abosy-fmcnp-89, agss-ltacv-89, bcdry-ctbc-94, bg-aoscf-95, b-cspps-88, c-bvdcp-86, dj-cmcnp-90, dk-ladsc-85, ep-mps-88, f-spcrd-86, ka-dd-84, k-osps-83, l-sss-71, l-fchsp-83, m-lpltw-84, m-idssp-92, ms-sapo-95, okm-ccs-86"
, update =	"01.11 devillers"
, abstract =	"Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set.  This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly separable. The algorithm outputs the smallest separating circle. The second problem asks for the largest circle included in a preprocessed, convex polygon, under some point and/or line constraints.  The resulting circle must contain the query points and it must lie in the halfplanes delimited by the query lines."
}

@inproceedings{bddp-mpsr-92
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
, title =	"Motion planning for a spider robot"
, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
, year =	1992
, pages =	"2321--2326"
, keywords =	"motion planning, legged robot"
, precedes =	"bddp-mplrs-95"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@article{bddp-mplrs-95
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
, title =	"Motion planning of legged robots: the spider robot problem"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, number =	"1--2"
, year =	1995
, pages =	"3--20"
, url =	"http://www-sop.inria.fr/prisme/publis/bddp-mplrs-95.ps.gz"
, succeeds =	"bddp-mpsr-92,bddp-spsr-92"
, cites =	"ps-cgi-85, l-knnvd-82, agss-ltacv-87, s-ksacs-91, hs-ompc-91, p-pplr-90, w-cvgnl-85, bdp-cu3ct-91"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers"
, abstract =	"We consider the problem of planning motions of a simple legged robot called the spider robot. The robot is modelled as a point where all its legs are attached, and the footholds where the robot can securely place its feet consist of a set of $n$ points in the plane.  We show that the space $\cal F$ of admissible and stable placements of such robots has size $\Theta(n^2)$ and can be constructed in $O(n^2\log n)$ time and $O(n^2)$ space. Once $\cal F$ has been constructed, we can efficiently solve several problems related to motion planning."
}

@inproceedings{bddp-spsr-92
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
, title =	"Stable placements of spider robots"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"242--250"
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1767"
, keywords =	"motion planning, legged robot"
, precedes =	"bddp-mplrs-95"
, cites =	"agss-ltacv-89, bddp-mpsr-92, bdp-cu3ct-91, hs-ompc-91, hk-gsftq-91, hnku-agcqw-84, l-knnvd-82, ps-cgi-85, -sill-84, -sill-90, s-ksacs-91, ZZZ"
, update =	"99.07 devillers, 97.11 bibrelex, 95.09 devillers, 95.01 devillers"
}

@inproceedings{bdl-srhdr-94c
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
, title =	"From Spider Robots to Half-Disk Robots"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"62--63"
, precedes =	"bdl-mplr-00"
, update =	"01.11 devillers, 01.07 devillers, 00.11 smid, 00.07 icking"
}

@inproceedings{bdl-srhdr-94
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
, title =	"From Spider Robots to Half Disks Robots"
, booktitle =	"Proc. 11th IEEE Internat. Conf. Robot. Autom."
, year =	1994
, pages =	"953--958"
, succeeds =	"bdl-srhdr-94c"
, precedes =	"bdl-mplr-00"
, update =	"01.11 devillers, 00.11 smid, 00.07 icking, 99.07 devillers"
}

@inproceedings{bdl-mplr-94
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
, title =	"Motion Planning of Legged Robots"
, booktitle =	"Proc. 1st Workshop Algorithmic Found. Robot."
, publisher =	"A. K. Peters, Boston, MA"
, year =	1994
, precedes =	"bdl-mplr-00"
, update =	"01.11 devillers, 00.11 smid, 00.07 icking, 99.07 devillers"
}

@article{bdl-mplr-00
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
, title =	"Motion Planning of Legged Robots"
, journal =	"SIAM J. Comput."
, volume =	30
, year =	2000
, pages =	"218--246"
, url =	"http://www-sop.inria.fr/prisme/publis/bdl-mplr.ps.gz"
, archive =	"XXX/cs.CG/9909006"
, succeeds =	"bdl-mplr-94,bdl-srhdr-94,bdl-srhdr-94c"
, cites =	"bddp-mplrs-95, dd-frspp-90, h-fuenl-89, ks-empac-90, kst-coksm-97, l-ptrmn-96, s-ksacs-91, ss-nempa-87, t-frnns-91"
, update =	"01.11 devillers"
, abstract =	"We study the problem of computing the free space $\cal F$ of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body.  The robot is subject to two constraints: each leg has a maximal extension $R$ (accessibility constraint) and the body of the robot must lie above the convex hull of its feet (stability constraint).  Moreover, the robot can only put its feet on some regions, called the foothold regions.  The free space $\cal F$ is the set of positions of the body of the robot such that there exists a set of accessible footholds for which the robot is stable.  We present an efficient algorithm that computes $\cal F$ in $O(n^2\log n)$ time using $O(n^2\alpha(n))$ space for $n$ discrete point footholds where $\alpha(n)$ is an extremely slowly growing function ($\alpha(n)\leq 3$ for any practical value of $n$).  We also present an algorithm for computing $\cal F$ when the foothold regions are pairwise disjoint polygons with $n$ edges in total.  This algorithm computes $\cal F$ in $O(n^2\alpha_8(n)\log n)$ time using $O(n^2\alpha_8(n))$ space ($\alpha_8(n)$ is also an extremely slowly growing function).  These results are close to optimal since $\Omega(n^2)$ is a lower bound for the size of~$\cal F$."
}

@techreport{bdp-cu3ct-90
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata"
, title =	"Computing the Union of 3-colored triangles"
, type =	"Technical {Report}"
, number =	1293
, institution =	"INRIA"
, address =	"Sophia-Antipolis, France"
, month =	oct
, year =	1990
, url =	"http://www.inria.fr/RRRT/RR-1293"
, precedes =	"bdp-cu3ct-91"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
}

@article{bdp-cu3ct-91
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata"
, title =	"Computing the union of $3$-colored triangles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	2
, year =	1991
, pages =	"187--196"
, url =	"http://www-sop.inria.fr/prisme/publis/bdp-cu3ct-91.ps.gz"
, keywords =	"convex hull, motion planning, legged robot"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
, abstract =	"Given is a set $s$ of $n$ points, each colored with one of $k \geq 3$ colours. We say that a triangle defined by three points of $\cal s$ is 3-colored if its vertices have distinct colours.  We prove in this paper that the problem of constructing the boundary of the union $\cal ts$ of all such 3-colored triangles can be done in optimal $O(n \log n)$ time."
}

@techreport{bdsty-arsol-90
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
, title =	"Applications of random sampling to on-line algorithms in computational geometry"
, type =	"Technical {Report}"
, number =	1285
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1990
, url =	"http://www.inria.fr/RRRT/RR-1285"
, succeeds =	"bt-hrodt-86"
, precedes =	"bdsty-olgag-91i"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
}

@article{bdsty-arsol-92
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
, title =	"Applications of random sampling to on-line algorithms in computational geometry"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"51--71"
, url =	"https://hal.inria.fr/inria-00090675"
, keywords =	"randomized algorithms, Delaunay triangulation, semi-dynamic algorithms, arrangement of line-segments"
, succeeds =	"bdsty-olgag-91i"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
, abstract =	"This paper presents a general framework for the design
and randomized analysis of geometric algorithms.  These algorithms are
on-line and the framework provides general bounds for their expected space
and time complexities when averaging over all permutations of the input
data.  The method is general and can be applied to various geometric
problems.  The power of the technique is illustrated by new efficient
on-line algorithms for constructing convex hulls and Voronoi diagrams in
any dimension, Voronoi diagrams of line segments in the plane,
arrangements of curves in the plane and others."
}

@techreport{bdsty-olgag-90t
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
, title =	"On-line geometric algorithms with good expected behaviours"
, type =	"Technical Report"
, number =	"INRIA 1285"
, month =	aug
, year =	1990
, precedes =	"bdsty-olgag-91i, bdsty-olgag-91a"
, update =	"99.07 devillers, 98.07 bibrelex"
}

@inproceedings{bdsty-olgag-91i
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
, title =	"On-line geometric algorithms with good expected behaviours"
, booktitle =	"Proc. 13th World Congress on Computation and Applied Math."
, year =	1991
, pages =	"137--139"
, succeeds =	"bdsty-arsol-90"
, precedes =	"bdsty-arsol-92"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@article{bdsty-olgag-91a
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
, title =	"On-line geometric algorithms with good expected behaviours"
, journal =	"IMACS"
, volume =	"??"
, year =	1991
, succeeds =	"bdsty-olgag-90t"
, update =	"99.07 devillers, 98.07 bibrelex"
}

@techreport{bdt-dchov-90
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
, title =	"A dynamic construction of higher-order {Voronoi} diagrams and its randomized analysis"
, type =	"Technical {Report}"
, number =	1207
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1990
, url =	"http://www.inria.fr/RRRT/RR-1207"
, keywords =	"randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
, succeeds =	"bdt-olcho-90, bt-hrodt-86"
, precedes =	"bdt-schov-93"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell"
}

@article{bdt-schov-93
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
, title =	"A semidynamic construction of higher-order {Voronoi} diagrams and its randomized analysis"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"329--356"
, url =	"http://www-sop.inria.fr/prisme/publis/bdt-schov-93.ps.gz"
, keywords =	"randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
, succeeds =	"bdt-olcho-90"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers+schwarzkopf, 96.05 agarwal, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
, abstract =	"The $k$-Delaunay tree extends the Delaunay tree
introduced in \cite{bt-rcdt-93}.  It is a hierarchical data structure that
allows the semi-dynamic construction of the higher order Voronoi diagrams
of a finite set of $n$ points in any dimension.  In this paper, we prove
that a randomized construction of the $k$-Delaunay tree, and thus, of all
the order $\leq k$ Voronoi diagrams, can be done in $O(n \log n+k^3n)$
expected time and $O(k^2 n)$ expected storage in the plane, which is
asymptotically optimal for fixed $k$. The algorithm is simple and
experimental results are given."
}

@inproceedings{bdt-olcho-90
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
, title =	"An on-line construction of higher-order {Voronoi} diagrams and its randomized analysis"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"278--281"
, comments =	"to appear in Algorithmica"
, precedes =	"bdt-schov-93"
, cites =	"agss-ltacv-89, bdsty-arsol-90, bdt-dchov-90, bt-hrodt-86, bt-rcdt-89, ce-iacko-85, c-narsc-87, cs-arscg-89, d-hdvdl-89, eos-calha-86, gks-ricdv-90, gs-cdtp-78, l-knnvd-82, mmo-cavd-90, m-lavd-91, m-orfv-89, sh-cpp-75, ZZZ"
, update =	"99.11 bibrelex, 99.07 bibrelex+devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
}

@inproceedings{bdty-tcgal-00
, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud and Mariette Yvinec"
, title =	"Triangulations in {CGAL}"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"11--18"
, cites =	"bdh-qach-96, bd-asmbh-94, by-ag-98, b-rgsdd-93, bbp-iayed-98scg, cd-fsgr-00, boo-stswe-96, 9d-iirdt-98, dlpt-ccpps-98, fhhn-dipmc-99, gb-tdmae-97, g-ggmpa-96, gs-pmgsc-85, hkw-gapi2-99, k-ugpddsp-99, l-ndgcm-94, msz-frplw-96, m-rmstd-91, p-iaeia-99, ps-cgi-85, s-te2dq-96, s-rafpg-96, s-cgehdcd-98, v-gpccg-97"
, update =	"01.07 devillers, 00.11 smid, 00.07 devillers"
, abstract =	"This  paper
presents  the main algorithmic and design choices that have been
made
to implement triangulations in
the computational geometry algorithms library CGAL."
}

@article{bd-olcue-96
, author =	"Jean-Daniel Boissonnat and Katrin Dobrindt"
, title =	"On-line construction of the upper envelope of triangles and surface patches in three dimensions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1996
, pages =	"303--320"
, update =	"99.07 devillers, 98.07 agarwal, 98.03 agarwal, 96.05 smid"
}

@techreport{bd-olrcu-93
, author =	"Jean-Daniel Boissonnat and Katrin Dobrindt"
, title =	"On-line randomized construction of the upper envelope of triangles and surface patches in {$R^{3}$}"
, type =	"Manuscript"
, number =	"Tech. Rep. 1878"
, institution =	"INRIA, Sophia-Antipolis, France"
, year =	1993
, update =	"99.07 devillers, 98.07 agarwal, 98.03 bibrelex"
}

@inproceedings{bd-rcuet-92
, author =	"Jean-Daniel Boissonnat and Katrin Dobrindt"
, title =	"Randomized construction of the upper envelope of triangles in {$R^3$}"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"311--315"
, cites =	"bdsty-arsol-92, cs-arscg-89, d-rysoa-92, e-ueplf-89, e-ueplf-89, m-eahsr-89, m-orfv-89, ps-ueplf-89, ss-tddsp-90, s-sfira-91, ZZZ"
, update =	"99.07 devillers, 98.07 agarwal+bibrelex"
}

@inproceedings{bdgm-gmpmr-95
, author =	"Jean-Daniel Boissonnat and Katrin Dobrindt and Bernhard Geiger and Henri Michel"
, title =	"A Global Motion Planner for a Mobile Robot on a Terrain"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C20--C21"
, keywords =	""
, cites =	"bg-tdrcs-93, w-pdtpu-93, egs-ueplf-89, l-rmp-91, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{bf-t3do-81
, author =	"J.-D. Boissonnat and O. D. Faugeras"
, title =	"Triangulation of $3$-d objects"
, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
, year =	1981
, pages =	"658--660"
}

@techreport{bfl-rsddt-88t
, author =	"J. D. Boissonnat and O. D. Faugeras and E. {Le Bras-Mehlman}"
, title =	"Representing stereo data with the {Delaunay} triangulation"
, type =	"Technical Report"
, number =	788
, institution =	"INRIA"
, address =	"Domaine de Voluceau Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France"
, month =	feb
, year =	1988
, precedes =	"flb-rsddt-90, bfl-rsddt-88i"
, update =	"98.07 bibrelex"
}

@inproceedings{bfl-rsddt-88i
, author =	"J. D. Boissonnat and O. D. Faugeras and E. {Le Bras-Mehlman}"
, title =	"Representing stereo data with the {Delaunay} triangulation"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Robot. Autom."
, year =	1988
, pages =	"24--29"
, succeeds =	"bfl-rsddt-88t"
, precedes =	"flb-rsddt-90"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@inproceedings{bf-lcss-02
, author =	"Jean-Daniel Boissonnat and Julia Fl{\"o}totto"
, title =	"A local coordinate system on a surface"
, booktitle =	"Proc. 7th ACM Symposium on Solid Modeling and Applications"
, year =	2002
, pages =	""
, update =	"02.03 devillers"
}

@inproceedings{bg-3dsd-93
, author =	"Jean-Daniel Boissonnat and Bernhard Geiger"
, title =	"3D simulation of delivery"
, editor =	"G. M. Nielson and D. Bergeron"
, booktitle =	"Visualization 93"
, publisher =	"IEEE Computer Society Press"
, address =	"San Jose CA"
, year =	1993
, pages =	"416--419"
, update =	"99.07 devillers, 94.05 devillers"
}

@techreport{bg-tdrcs-92
, author =	"Jean-Daniel Boissonnat and Bernhard Geiger"
, title =	"Three-dimensional reconstruction of complex shapes based on the {Delaunay} triangulation"
, type =	"Report"
, number =	1697
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, month =	apr
, year =	1992
, url =	"http://www-sop.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
, keywords =	"shape reconstruction, medical images, Delaunay triangulation"
, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 held"
}

@inproceedings{bg-tdrcs-93
, author =	"Jean-Daniel Boissonnat and Bernhard Geiger"
, title =	"Three dimensional reconstruction of complex shapes based on the {Delaunay} triangulation"
, editor =	"R. S. Acharya and D. B. Goldgof"
, booktitle =	"Biomedical Image Processing and Biomedical Visualization"
, volume =	1905
, publisher =	"SPIE"
, year =	1993
, pages =	"964--975"
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
, succeeds =	"bg-tdrcs-92"
, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
}

@inproceedings{bk-udtil-85
, author =	"J.-D. Boissonnat and P. Kofakis"
, title =	"Use of the {Delaunay} Triangulation for the Identification and the Localization of Objects"
, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
, year =	1985
, pages =	"398--401"
, annote =	"Uses skeleton of object foe rep. Computes
		 approximation of the skeleton by connecting centres of
		 adjacent triangles in DT."
}

@inproceedings{blt-mosal-97
, author =	"Jean-Daniel Boissonnat and Eelco de Lange and Monique Teillaud"
, title =	"Minkowski operations for satellite antenna layout"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"67--76"
, url =	"http://www-sop.inria.fr/prisme/publis/blt-mosal-97.ps.gz"
, precedes =	"blt-smssa-98"
, cites =	"ab-scsp-87, ab-pptr-89, abdpy-esdus-97, bdh-qach-93, dm-mtcae-95, gs-ccrs-87, lm-cancp-93, l-spcsa-83, ZZZ"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex+devillers, 97.07 efrat"
}

@article{blt-smssa-98
, author =	"Jean-Daniel Boissonnat and Eelco de Lange and Monique Teillaud"
, title =	"Slicing {Minkowski} Sums for Satellite Antenna Layout"
, journal =	"Comput. Aided Design"
, volume =	30
, number =	4
, year =	1998
, pages =	"255--265"
, note =	"Special Issue on Computational Geometry and Computer-Aided Design and Manufacturing"
, succeeds =	"blt-mosal-97"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers+held"
}

@proceedings{bl-gr-89
, title =	"Proc. of the Workshop on Geometry and Robotics"
, editor =	"J.-D. Boissonnat and J.-P. Laumond"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, publisher =	"Springer-Verlag"
, year =	1989
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{bl-ptacs-96
, author =	"Jean-Daniel Boissonnat and Sylvain Lazard"
, title =	"A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"242--251"
, keywords =	"Non-holonomic robot, motion planning, shortest paths, mobile robot, computational geometry"
, cites =	"art-mpscr-95, bl-nmrom-89, bl-nmbmr-93, bbf-fmg-86, bb-arcto-94, bcl-spbcp-94, bsbl-spsdn-94, cs-arscg-89, ds-cgcw-90, d-cmlca-57, fw-pcm-88, jc-pspmr-89, jlt-empnm-91, klps-ujrcf-86, l-fppcl-91, l-rmp-91, l-fcfst-87, ljtm-mpnmr-94, lc-nmp-92, nm-nppa-89, rs-opctg-90, st-sprsc-91, wa-aaccs-96, w-mpav-88, w-spav-89, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex, 96.05 efrat"
, abstract =	"
In this paper, we consider the problem of computing a shortest path of
bounded curvature amidst obstacles in the plane. More precisely, given
prescribed initial and final configurations (i.e.  positions and
orientations) and a set of obstacles in the plane, we want to compute
a shortest C1 path joining those two configurations, avoiding the
obstacles, and with the further constraint that, on each C2 piece,
the radius of curvature is at least 1. In this paper, we consider the
case of moderate obstacles (as introduced by Agarwal et al.) and
present a polynomial-time exact algorithm to solve this problem."
}

@inproceedings{bl-chbc-96
, author =	"Jean-Daniel Boissonnat and Sylvain Lazard"
, title =	"Convex hulls of bounded curvature"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"14--19"
, update =	"99.07 devillers, 97.03 agarwal, 96.09 mitchell"
}

@techreport{bp-rpsis-97
, author =	"Jean-Daniel Boissonnat and Franco P. Preparata"
, title =	"Robust Plane Sweep for Intersecting Segments"
, type =	"Research {Report}"
, number =	3270
, institution =	"INRIA"
, address =	"Sophia Antipolis"
, month =	sep
, year =	1997
, update =	"99.11 devillers, 99.07 devillers, 98.11 ghali"
}

@article{bp-rpsis-00
, author =	"J.-D. Boissonnat and F. P. Preparata"
, title =	"Robust Plane Sweep for Intersecting Segments"
, journal =	"SIAM J. Comput."
, volume =	29
, number =	5
, year =	2000
, pages =	"1401--1421"
, update =	"00.11 smid, 00.07 vismara, 99.07 devillers, 98.11 tamassia"
}

@inproceedings{bsty-vdhdc-95
, author =	"Jean-Daniel Boissonnat and Micha Sharir and Boaz Tagansky and Mariette Yvinec"
, title =	"Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"79--88"
, keywords =	""
, precedes =	"bsty-vdhdc-98"
, cites =	"a-vdsfg-91, ckstw-vdl3s-95, cs-arscg-89, e-acg-87, es-vda-86, hs-nblet-94, klps-ujrcf-86, ls-ippvd-87, m-cgitr-93, o-cgc-94, ps-cgi-85, s-atubl-94, t-ntasa-95, ZZZ"
, update =	"98.07 devillers, 98.03 bibrelex, 95.09 mitchell"
}

% also claimed, pages =	"485--519"
@article{bsty-vdhdc-98
, author =	"Jean-Daniel Boissonnat and Micha Sharir and Boaz Tagansky and Mariette Yvinec"
, title =	"Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions"
, journal =	"Discrete Comput. Geom."
, volume =	19
, number =	4
, year =	1998
, pages =	"473--484"
, succeeds =	"bsty-vdhdc-95"
, update =	"99.07 devillers, 98.07 devillers+held"
}

% also claimed,  title =       "Line and curve segment intersection with restricted predicates"
@inproceedings{bs-ealcs-99
, author =	"J.-D. Boissonnat and J. Snoeyink"
, title =	"Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"370--379"
, precedes =	"bs-ealcs-00"
, update =	"01.07 devillers, 99.07 devillers+vismara"
}

@article{bs-ealcs-00
, author =	"J.-D. Boissonnat and J. Snoeyink"
, title =	"Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates"
, journal =	"Comput. Geom. Theory Appl."
, volume =	16
, number =	1
, year =	2000
, pages =	"35--52"
, succeeds =	"bs-ealcs-99"
, update =	"01.07 devillers, 00.11 smid, 00.07 vismara"
, annote =	"Special Issue on the 1998 Workshop on Computational Geometry"
}

@inproceedings{bt-hrodt-86
, author =	"Jean-Daniel Boissonnat and Monique Teillaud"
, title =	"A hierarchical representation of objects: {The} {Delaunay} tree"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"260--268"
, precedes =	"bt-rcdt-89, bdt-dchov-90, bdsty-arsol-90"
, cites =	"b-asmra-86, aes-solac-85, aeiim-pubtc-85, b-sthrc-81, b-gstds-84, b-srpcs-88, b-cdt-81, cg-vippg-85, dk-fdpi-83, es-vda-85, f-sdpvd-83, g-rssc-62, gs-cdtp-78, gs-pmgsc-85, k-osps-83, k-cddvd-80, ls-tacdt-80, m-iaeln-53, m-hpppp-70, ob-dtdos-79, ps-cgi-85, r-pc-64, s-qrhds-84, t-prgc-80, ZZZ"
, update =	"99.07 devillers, 98.03 bibrelex, 93.09 milone+mitchell"
}

@techreport{bt-rcdt-89
, author =	"Jean-Daniel Boissonnat and Monique Teillaud"
, title =	"On the randomized construction of the {Delaunay} tree"
, type =	"Technical {Report}"
, number =	1140
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1989
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1140"
, keywords =	"randomized algorithms, Delaunay triangulation, semi-dynamic algorithms"
, succeeds =	"bt-hrodt-86"
, precedes =	"bt-rcdt-93"
, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
}

@article{bt-rcdt-93
, author =	"Jean-Daniel Boissonnat and Monique Teillaud"
, title =	"On the randomized construction of the {Delaunay} tree"
, journal =	"Theoret. Comput. Sci."
, volume =	112
, year =	1993
, pages =	"339--354"
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1140"
, keywords =	"randomized algorithms, Delaunay triangulation, semi-dynamic algorithms"
, succeeds =	"bt-rcdt-89"
, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
}

@techreport{bv-earic-99
, author =	"Jean-Daniel Boissonnat and Antoine Vigneron"
, title =	"Elementary Algorithms for Reporting Intersections of Curve Segments"
, type =	"Rapport de recherche"
, number =	3825
, institution =	"INRIA"
, year =	1999
, url =	"http://www.inria.fr/RRRT/RR-3825"
, cites =	"b-oafsi-95, bo-arcgi-79, bs-ealcs-99, bp-rpsis-, c-stsar-94, ce-oails-92, cs-arscg-89, afl-rracg-98, k-ah-92, lpt-rpqid-99, p-iaeia-99, ps-cgi-90, s-ri-99, y-tegc-97, y-rgc-97"
, update =	"00.03 devillers"
, abstract =	"We propose several
 algorithms to report the $k$ intersecting pairs among a set of $n$ curve segments. Apart from the intersection predicate, our algorithms only use two simple predicates: the predicate that compares the coordinates of two points and the predicate that says if a point is below, on, or above a segment. In particular, the predicates we use do not allow to count the number of intersection points nor to sort them, and the time complexity of our algorithms depends on the number of intersecting pairs, not on the number of intersection points (differently from the other non trivial algorithms). We present an algorithm for the red-blue variant of the problem where we have a set of blue segments and a set of red segments so that no two segments of the same set intersect. The time complexity is $O((n+k)\log n)$. This algorithm is then used to solve the general case in $O(n\sqrt{k}\log n)$ time. In the case of pseudo-segments (i.e. segments that intersect in at most one point) we propose a better algorithm whose time complexity is $O((k+n)\log n+ n\sqrt k)$. All our time complexity results are a log factor from optimal."
}

@article{bv-earic-02
, author =	"Jean-Daniel Boissonnat and Antoine Vigneron"
, title =	"Elementary Algorithms for Reporting Intersections of Curve Segments"
, journal =	"Comput. Geom. Theory Appl."
, volume =	21
, year =	2002
, pages =	"167--175"
, update =	"02.03 devillers"
}

@book{by-ag-98
, author =	"Jean-Daniel Boissonnat and Mariette Yvinec"
, title =	"Algorithmic Geometry"
, publisher =	"Cambridge University Press"
, address =	"UK"
, year =	1998
, note =	"Translated by Herv{\'e} Br{\"o}nnimann"
, succeeds =	"by-ga-95"
, update =	"99.11 devillers, 99.07 devillers, 99.03 bibrelex+devillers, 98.07 devillers"
, annote =	"translated from {\cite{by-ga-95}} by Herv{\'e}  Br{\"o}nnimann"
}

@book{by-ga-95
, author =	"Jean-Daniel Boissonnat and Mariette Yvinec"
, title =	"G{\'e}om{\'e}trie Algorithmique"
, publisher =	"Ediscience international"
, address =	"Paris"
, year =	1995
, precedes =	"by-ag-98"
, update =	"99.07 devillers, 99.03 bibrelex, 98.07 devillers, 96.01 devillers"
}

@inproceedings{by-psncp-89
, author =	"Jean-Daniel Boissonnat and Mariette Yvinec"
, title =	"Probing a scene of non-convex polyhedra"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"237--246"
, precedes =	"by-psncp-92"
, cites =	"aby-ooacr-87, aby-pncp-89, b-dscns-86, cy-sp-87, dey-pcp-86, m-dsa-84, s-gp-88, ZZZ"
, update =	"99.07 devillers, 98.03 bibrelex"
}

@article{by-psncp-92
, author =	"Jean-Daniel Boissonnat and Mariette Yvinec"
, title =	"Probing a scene of non-convex polyhedra"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"321--342"
, keywords =	"geometric probing, polyhedral scenes"
, succeeds =	"by-psncp-89"
, update =	"99.07 devillers"
}

@article{b-fmapg-84
, author =	"S. H. Bokhari"
, title =	"Finding maximum on an array processor with a global bus"
, journal =	"IEEE Trans. Comput."
, volume =	"C-33"
, number =	2
, month =	feb
, year =	1984
, pages =	"133--139"
, update =	"98.07 bibrelex"
}

@article{b-grwsi-89
, author =	"J. Bokowski"
, title =	"A geometric realization without self-intersections does exist for {Dyck}'s regular map"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"583--589"
}

@inproceedings{b-acsg2-87
, author =	"J. Bokowski"
, title =	"Aspects of computational synthetic geometry 2, {Combinatorial} complexes and their geometric realization, an algebraic approach"
, booktitle =	"Comput. Aided Geom. Reasoning. Proc. INRIA Workshop"
, volume =	1
, year =	1987
, pages =	"87--125"
, keywords =	"matroids"
, update =	"95.05 korneenko"
}

@incollection{b-om-93
, author =	"J. Bokowski"
, title =	"Oriented Matroids"
, chapter =	"2.5"
, editor =	"Peter M. Gruber and J. M. Wills"
, booktitle =	"Handbook of Convex Geometry"
, volume =	"A"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1993
, pages =	"555--602"
, keywords =	"survey paper"
, update =	"96.05 pocchiola"
}

@techreport{b-omccg-87
, author =	"J. Bokowski"
, title =	"Oriented matroids and combinatorial convex geometry"
, type =	"Report"
, number =	"??"
, institution =	"Tech. Hochschule Darmstadt"
, address =	"Darmstadt, West Germany"
, year =	1987
}

@article{brs-npcg-90
, author =	"J. Bokowski and J. Richter and B. Sturmfels"
, title =	"Nonrealizability proofs in computational geometry"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"333--350"
}

@article{bs-com-86
, author =	"J. Bokowski and B. Sturmfels"
, title =	"On the coordination of oriented matroids"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"293--306"
}

@article{b-koejk-36
, author =	"G. Bol"
, title =	"Zur kinematischen Ordnung ebener {Jorden}-Kurven"
, journal =	"Abh. Math. Sem. Univ. Hamburg"
, volume =	11
, year =	1936
, pages =	"394--408"
, update =	"98.11 bibrelex"
}

@mastersthesis{b-scs-92
, author =	"R. Boland"
, title =	"Separating convex sets"
, school =	"Carleton Univ."
, address =	"Ottawa, Ontario, Canada"
, year =	1992
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@unpublished{bu-scpes-
, author =	"R. Boland and J. Urrutia"
, title =	"Separating collections of points in {Euclidean} space"
, note =	"In preparation"
, update =	"98.07 bibrelex"
}

@inproceedings{bu-sfpes-92
, author =	"R. P. Boland and J. Urrutia"
, title =	"Separating families of points in {Euclidean} spaces"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"6--10"
, cites =	"akp-cddsl-89, a-ppss-85, a-npps-84, b-scs-92, b-dsudn-33, bu-scpes-, cruz-scsp-92, lms-hscr-92, m-ptlp-85, s-tt-79, t-sppcs-79, w-pr-82, ZZZ"
, update =	"98.07 bibrelex"
}

@book{b-c-86
, author =	"B. Bollob{\'a}s"
, title =	"Combinatorics"
, publisher =	"Cambridge University Press"
, year =	1986
, update =	"98.07 bibrelex"
}

@book{b-egt-78
, author =	"B. Bollob{\'a}s"
, title =	"Extremal Graph Theory"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1978
, update =	"98.03 icking, 97.11 bibrelex"
}

@book{b-gtic-79
, author =	"B. Bollob{\'a}s"
, title =	"Graph Theory; {An} Introductory Course"
, publisher =	"Springer-Verlag"
, year =	1979
, update =	"98.03 bibrelex"
}

@book{b-rg-85
, author =	"B. Bollob{\'a}s"
, title =	"Random Graphs"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1985
, update =	"99.07 smid, 98.03 bibrelex"
}

@article{bb-gweto-87
, author =	"B. Bollob{\'a}s and G. Brightwell"
, title =	"Graphs whose every transitive orientation contains almost every relation"
, journal =	"Israel J. Math."
, volume =	59
, year =	1987
, pages =	"112--128"
, update =	"98.03 bibrelex"
}

@inproceedings{bdgm-tsspw-97
, author =	"B. Bollob{\'a}s and G. Das and D. Gunopulos and H. Mannila"
, title =	"Time-Series Similarity Problems and Well-Separated Geometric Sets"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"454--456"
, cites =	"afs-esssd-93, alss-fsspn-95, a-afps-90, b-c-86, c-chdc-93, cw-qorss-89, dgm-fsts-96, frm-fsmts-94, jmm-sbq-95, sz-aqrld-96, wj-assr-96, yo-smi-96, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{bm-tspkd-
, author =	"B. Bollob{\'a}s and A. Meir"
, title =	"A traveling salesman problem in the $k$-dimensional unit-cube"
, journal =	"Oper. Res. Lett."
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"97.11 bibrelex"
}

@article{b-orasr-81
, author =	"A. Bolour"
, title =	"Optimal retrieval algorithms for small region queries"
, journal =	"SIAM J. Comput."
, volume =	10
, year =	1981
, pages =	"721--741"
}

@article{b-opmkh-79
, author =	"A. Bolour"
, title =	"Optimality properties of multiple-key hashing functions"
, journal =	"J. ACM"
, volume =	26
, year =	1979
, pages =	"196--210"
}

@book{bg-rpcg-85
, author =	"V. Boltjansky and I. T. Gohberg"
, title =	"Results and Problems in Combinatorial Geometry"
, publisher =	"Cambridge University Press"
, address =	"New York, NY"
, year =	1985
}

@article{b-lgc-74
, author =	"E. Bombieri"
, title =	"Le grand crible"
, journal =	"Asterisque"
, volume =	18
, year =	1974
, update =	"98.07 bibrelex"
}

@article{bk-sectp-88
, author =	"F. Bonafatti and L. Kavazza"
, title =	"{SECT}: {An} efficient coding technique for polygonal geographical data"
, journal =	"Comput. Graph."
, volume =	22
, number =	"3--4"
, year =	1988
, pages =	"503--513"
, keywords =	"data structuring, polygons"
, update =	"95.05 korneenko"
}

@inproceedings{bl-oavdr-89
, author =	"C. R. Bonapace and C. Lo"
, title =	"An {$O(n \log n)$} algorithm for {VLSI} design rule checking"
, booktitle =	"Proc. 26th Design Autom. Conf."
, year =	1989
, pages =	"503--507"
, update =	"98.07 bibrelex"
}

@book{bm-gta-76
, author =	"J. A. Bondy and U. S. R. Murty"
, title =	"Graph Theory with Applications"
, publisher =	"Macmillan"
, address =	"London"
, year =	1976
, isbn =	"0-333-17791-6"
, keywords =	"graph drawing"
, comments =	"Also attributed to North-Holland, New York, NY"
, update =	"97.11 bibrelex, 93.09 tamassia"
}

@article{bp-adtaa-91
, author =	"J. Bonet and J. Peraire"
, title =	"An alternating digital tree (ADT) algortihm for $3$D geometric searching and intersection problems"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	31
, year =	1991
, pages =	"1--17"
, update =	"97.11 bibrelex"
}

@book{bf-tdkk-34
, author =	"T. Bonnesen and W. Fenchel"
, title =	"Theorie der konvexen {K{\"o}rper}"
, publisher =	"J. Springer"
, address =	"Berlin, Germany"
, year =	1934
, note =	"Reprinted Chelsea, New York, 1948"
, update =	"97.11 bibrelex"
}

% ### uncertain journal
@article{bk-gch-63
, author =	"W. Bonnice and V. L. Klee"
, title =	"The generation of convex hulls"
, journal =	"Math. Ann."
, volume =	152
, year =	1963
, pages =	"1--29"
, keywords =	"convex hull"
, update =	"95.05 korneenko"
}

@inproceedings{bkr-dcbws-95
, author =	"A. Bookstein and S. T. Klein and T. Raita"
, title =	"Detecting Content-Bearing Words by Serial Clustering"
, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
, year =	1995
, pages =	"319--327"
, update =	"98.07 agarwal"
}

@book{b-mtld-91
, author =	"F. L. Bookstein"
, title =	"Morphometric Tools for Landmark Data"
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1991
, update =	"93.05 orourke"
}

@article{b-ls-79
, author =	"F. L. Bookstein"
, title =	"The line skeleton"
, journal =	"Comput. Graph. Image Process."
, volume =	11
, number =	2
, month =	oct
, year =	1979
, pages =	"123--137"
, keywords =	"algorithm; computer graphics; computer programming Subroutines; methodology, techniques, modeling, representation, graphic, algorithmic aspects, polygon"
, update =	"98.07 bibrelex"
}

@book{b-mbssc-78
, author =	"F. L. Bookstein"
, title =	"The Measurement of Biological Shape and Shape Change"
, series =	"Lecture Notes in Biomathematics"
, volume =	24
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1978
, update =	"96.09 agarwal, 93.05 orourke"
}

@book{b-pgs-78
, author =	"C. de Boor"
, title =	"A practical guide to splines"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1978
, update =	"97.11 bibrelex"
}

@article{b-cbs-72
, author =	"C. de Boor"
, title =	"On Calculating with {B}-Splines"
, journal =	"J. Approx. Theory"
, volume =	6
, year =	1972
, pages =	"50--62"
, update =	"97.11 bibrelex"
}

@article{bl-tcopi-76
, author =	"K. Booth and G. Lueker"
, title =	"Testing for the Consecutive Ones Property Interval Graphs and Graph Planarity Using {PQ}-Tree Algorithms"
, journal =	"J. Comput. Syst. Sci."
, volume =	13
, year =	1976
, pages =	"335--379"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{b-affst-91
, author =	"R. S. Booth"
, title =	"Analytic formulas for full {Steiner} trees"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"69--82"
}

@article{b-srfp-91
, author =	"R. S. Booth"
, title =	"The {Steiner} ratio for five points"
, journal =	"Ann. Oper. Res."
, volume =	33
, number =	"1--4"
, year =	1991
, pages =	"419--436"
, keywords =	"Steiner tree"
, update =	"95.05 korneenko"
}

@article{b-elprv-87
, author =	"B. N. Boots"
, title =	"Edge Length Properties Of Random {Voronoi} Polygons"
, journal =	"Metallography"
, volume =	20
, number =	2
, month =	may
, year =	1987
, pages =	"231--236"
, keywords =	"edge length properties, random Voronoi polygons"
, abstract =	"The author has previously suggested that the equations
		 derived by Aboav for m//n, the average number of sides
		 of cells contiguous to an n-sided cell in a planar
		 tessellation, did not hold for a tessellation formed by
		 random Voronoi polygons (i. e. , cells created by
		 Dirichlet domains defined about a set of points located
		 at random in the plane). The suggestion was supported
		 by results derived either analytically or by Monte
		 Carlo simulation relating to a random Voronoi polygon
		 tessellation. These results included an estimate
		 derived by Crain from a Monte Carlo simulation of
		 46,000 polygons of E(l**2). This paper presents
		 evidence which supports Aboav's speculation concerning
		 Crain's results. However, the new result also indicates
		 that a RVP tessellation is inconsistent with an
		 equation. In addition, further information is presented
		 which suggests that other estimates provided by Crain
		 are inaccurate. 13 refs."
}

@article{b-mtp-87
, author =	"B. N. Boots"
, title =	"Modifying {Thiessen} Polygons"
, journal =	"The Canadian Geographer"
, volume =	31
, number =	2
, year =	1987
, pages =	"160--169"
, annote =	"Surveys use of VD for geographical analysis, and
		 discusses weighted diagrams, and other metrics."
}

% [a-vdsfg-91] claims it's Norwich, Conn.
@book{b-vtp-89
, author =	"B. N. Boots"
, title =	"{Voronoi} ({Thiessen}) Polygons"
, publisher =	"Geo Books"
, address =	"Norwich, England"
, year =	1989
, update =	"93.09 rote"
}

@article{b-wtp-79
, author =	"B. N. Boots"
, title =	"Weighting {Thiessen} polygons"
, journal =	"Econom. Geogr."
, volume =	55
, year =	1979
, pages =	"248--259"
}

@article{bm-sarvp-83
, author =	"B. N. Boots and D. J. Murdoch"
, title =	"The Spatial Arrangement of Random {Voronoi} Polygons"
, journal =	"Comput. Geosci."
, volume =	9
, number =	3
, year =	1983
, pages =	"351--365"
, annote =	"Measures various quantities for random VD.
		 Algorithm---incremental for each polygon---points in
		 order of increasing distance"
}

@article{b-icchp-90
, author =	"J. Boreddy"
, title =	"An incremental computation of a convex hull of planar line intersections"
, journal =	"Pattern Recogn. Lett."
, volume =	11
, number =	8
, year =	1990
, pages =	"541--543"
, note =	"erratic"
, keywords =	"convex hull, intersection, lines"
, update =	"95.05 korneenko"
}

@article{bm-afps-89
, author =	"J. Boreddy and R. N. Mukherjee"
, title =	"An algorithm to find polygon similarity"
, journal =	"Inform. Process. Lett."
, volume =	33
, number =	4
, year =	1989
, pages =	"205--206"
, note =	"erratic"
, keywords =	"polygons, similarity"
, update =	"95.05 korneenko"
}

@article{b-gdtnd-90
, author =	"C. Borgers"
, title =	"Generalized {Delaunay} Triangulations of Nonconvex Domains"
, journal =	"Comput. Math. Appl."
, volume =	20
, number =	7
, year =	1990
, pages =	"45--49"
, annote =	"Proof of switching construction for CDT. Algorithm
		 triangulates constraint polygon (by $O(n^3)$ algorithm
		 via search for triangle standing on boundary edge).
		 Then compute DT in each triangle and finally do
		 switchings until we converge on the CDT."
}

@book{b-smpa-87
, author =	"K. H. Borgwardt"
, title =	"The Simplex Method. A Probabilistic Analysis"
, series =	"Algorithms and Combinatorics"
, volume =	1
, publisher =	"Springer-Verlag"
, address =	"Berlin Heidelberg"
, year =	1987
, update =	"97.03 gaertner+salinger"
}

@incollection{bgjr-cchep-91
, author =	"K. H. Borgwardt and N. Gaffke and M. Junger and G. Reinelt"
, title =	"Computing the convex hull in the {Euclidean} plane in linear expected time"
, editor =	"P. Gritzman and B. Sturmfels"
, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	4
, publisher =	"AMS Press"
, year =	1991
, pages =	"91--107"
, keywords =	"convex hull, expected-case analysis"
, update =	"95.05 korneenko"
}

@phdthesis{b-tcosl-79
, author =	"A. Borning"
, title =	"Thinglab: {A} constraint-oriented simulation laboratory"
, school =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, month =	jul
, year =	1979
, note =	"Available as Technical Report STAN-CS-79-746"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{bh-rmspm-85
, author =	"A. Borodin and J. E. Hopcroft"
, title =	"Routing, merging, and sorting on parallel models of computation"
, journal =	"J. Comput. Syst. Sci."
, volume =	30
, number =	1
, year =	1985
, pages =	"130--145"
}

@inproceedings{bor-lbhdn-99
, author =	"A. Borodin and R. Ostrovsky and Y. Rabani"
, title =	"Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems"
, booktitle =	"Proc. 31st Annu. ACM Sympos. Theory Comput."
, year =	1999
, pages =	"312--321"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{bor-saacp-99
, author =	"A. Borodin and R. Ostrovsky and Y. Rabani"
, title =	"Subquadratic Approximation Algorithms For Clustering Problems in High Dimensional Spaces"
, booktitle =	"Proc. 31st Annu. ACM Sympos. Theory Comput."
, year =	1999
, pages =	"435--444"
, update =	"00.11 smid, 00.07 agarwal"
}

@article{bf-ntccn-84
, author =	"E. Boros and Z. F{\"u}redi"
, title =	"The number of triangles covering the center of an $n$-set"
, journal =	"Geom. Dedicata"
, volume =	17
, year =	1984
, pages =	"69--77"
, update =	"97.11 bibrelex"
}

@article{bfk-rsgd-89
, author =	"E. Boros and Z. F{\"u}redi and L. M. Kelly"
, title =	"On representing {Sylvester}-{Gallai} designs"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"345--348"
}

@techreport{bh-cpcoe-88
, author =	"E. Boros and P. L. Hammer"
, title =	"On clustering problems with connected optima in {Euclidean} spaces"
, type =	"Technical {Report}"
, institution =	"RUTCOR, Ruters University"
, address =	"New Brunswick, New Jersey"
, month =	mar
, year =	1988
, update =	"93.09 milone+mitchell"
}

@article{bh-cpcoe-89
, author =	"E. Boros and P. L. Hammer"
, title =	"On clustering problems with connected optima in {Euclidean} spaces"
, journal =	"Discrete Math."
, volume =	75
, year =	1989
, pages =	"81--88"
, update =	"98.03 bibrelex"
}

@inproceedings{bfg-utqmg-96
, author =	"Houman Borouchaki and Pascal J. Frey and Paul Louis George"
, title =	"Unstructured triangular-quadrilateral mesh generation application to surface meshing"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"229--242"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{bhsg-redbm-95
, author =	"H. Borouchaki and F. Hecht and E. Saltel and P. L. George"
, title =	"Reasonably Efficient {Delaunay} Based Mesh Generator in 3 Dimensions"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"3--14"
, update =	"96.01 samitchell"
}

@inproceedings{bm-pcg-95
, author =	"Ali R. Boroujerdi and Bernard M. E. Moret"
, title =	"Persistence in Computational Geometry"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"241--246"
, update =	"95.09 jones"
}

@article{brs-dot-92
, author =	"J. Borowski and J. Richter-Gebert and W. Schindler"
, title =	"On the distribution of order types"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	3
, year =	1992
, pages =	"127--142"
, keywords =	"chiritope, grassmanian, order type, oriented matroid, Monte-Carlo methods"
}

@article{bb-dndo-91
, author =	"P. Borrel and D. Bechmann"
, title =	"Deformation of $n$-dimensional objects"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	4
, year =	1991
, pages =	"427--453"
}

@article{b-dsudn-33
, author =	"K. Borsuk"
, title =	"Drei {S{\"a}tze} {\"u}ber die $n$-dimensionale euklidische {Sph{\"a}re}"
, journal =	"Fundam. Math."
, volume =	20
, year =	1933
, update =	"98.07 bibrelex"
}

@book{b-mag-69
, author =	"K. Borsuk"
, title =	"Multidimensional Analytic Geometry"
, publisher =	"Polish Scientific Publishers"
, address =	"Warsaw, Poland"
, year =	1969
, update =	"98.03 bibrelex"
}

@article{bm-sspig-90
, author =	"P. Borwein and W. O. J. Moser"
, title =	"A survey of {Sylvester}'s problem and its generalizations"
, journal =	"Aequationes Math."
, volume =	40
, number =	"2--3"
, year =	1990
, pages =	"111--135"
, keywords =	"survey"
, update =	"95.05 korneenko"
}

@article{bh-ststr-88
, author =	"J. M. Bosart and L. Huguet"
, title =	"Shortest trees and {Steiner} trees with rectilinear distances ( paper in {Catalan} language)"
, journal =	"Questiio"
, volume =	12
, number =	2
, year =	1988
, pages =	"159--174"
, keywords =	"Steiner tree, minimal spanning tree, $L_1$-metric"
, update =	"95.05 korneenko"
}

@phdthesis{b-gcamp-95
, author =	"P. Bose"
, title =	"Geometric and Computational Aspects of Manufacturing Processes"
, school =	"Dept. Comput. Sci., Univ. British Columbia"
, address =	"Vancouver, BC"
, year =	1995
, note =	"UBC Tech. Rep 95-02"
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@inproceedings{b-eopgp-97
, author =	"Prosenjit Bose"
, title =	"On Embedding an Outer-Planar Graph in a Point Set"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"25--36"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@techreport{bbk-dcsp-93
, author =	"P. Bose and D. Bremner and M. van Kreveld"
, title =	"Determining the Castability of Simple Polyhedra"
, type =	"Technical {Report}"
, number =	"SOCS 93.12"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1993
, update =	"98.03 bibrelex"
}

@inproceedings{bbk-dcsp-94
, author =	"P. Bose and D. Bremner and M. van Kreveld"
, title =	"Determining the Castability of Simple Polyhedra"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"123--131"
, cites =	"am-rsps-92, as-anps-91, abbgotwz-fds-93, bbk-dcsp-93, bkt-fpm-93, bt-gcaim-93, csw-qoubs-90, dk-ladsc-85, e-acg-87, e-cit-88, fm-gaim-93, h-cgpm-91, m-ept-91, m-rsehc-92, ms-tdctd-93, m-ltalp-83, ps-cgi-85, p-mrisf-87, rr-mcp-92, r-dcikc-88a, wo-ich-81, w-imm-84, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@article{bbk-dcsp-97
, author =	"P. Bose and D. Bremner and M. van Kreveld"
, title =	"Determining the Castability of Simple Polyhedra"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"84--113"
, update =	"97.07 held"
}

@techreport{bbt-acpcb-
, author =	"P. Bose and D. Bremner and G. Toussaint"
, title =	"All convex polyhedra can be clamped with parallel jaw grippers"
, institution =	"School of Computer Science, McGill University"
, note =	"to appear"
, succeeds =	"bbt-acpcb-94, bbt-acpcb-96"
, update =	"98.11 bibrelex"
}

@inproceedings{bbt-acpcb-94
, author =	"P. Bose and D. Bremner and G. Toussaint"
, title =	"All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"344--349"
, precedes =	"bbt-acpcb-96, bbt-acpcb-"
, cites =	"aho-srcp-90, abbgotwz-fds-93, bfg-spmfh-85, bbt-acpcb-, c-cpo-93, csu-isp-91, gs-ccrs-87, ht-cws-88, mss-esmpg-87, mu-ifp-91, ps-cgi-85, s-dcah-84, sv-cp-89t, tm-ragum-94, b-gtfga-80, ZZZ"
, update =	"98.11 bibrelex, 97.03 devillers+smid, 94.09 jones"
}

@article{bbt-acpcb-96
, author =	"P. Bose and D. Bremner and G. Toussaint"
, title =	"All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"291--302"
, succeeds =	"bbt-acpcb-94"
, precedes =	"bbt-acpcb-"
, update =	"98.11 bibrelex, 97.03 devillers+smid"
}

@inproceedings{bckm-aptcc-00
, author =	"P. Bose and J. Czyzowicz and E. Kranakis and A. Maheshwari"
, title =	"Algorithms for packing two circles in a convex polygon"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom."
, series =	"Lecture Notes Comput. Sci."
, volume =	1763
, publisher =	"Springer-Verlag"
, year =	2000
, pages =	"93--103"
, update =	"01.07 smid"
}

@techreport{bdhs-rvg1k-96
, author =	"P. Bose and A. Dean and J. Hutchinson and T. Shermer"
, title =	"On rectangle visibility graphs {I}: $k$-trees and caterpillar forests"
, institution =	"DIMACS and Simon Fraser University"
, month =	may
, year =	1996
, keywords =	"visibility graphs"
, update =	"96.09 orourke"
}

@techreport{bd-irgo-95
, author =	"P. Bose and L. Devroye"
, title =	"Intersections with random geometric objects"
, institution =	"School of Computer Science, McGill University"
, year =	1995
, note =	"Manuscript"
, update =	"97.11 bibrelex"
}

@article{bd-irgo-98
, author =	"Prosenjit Bose and Luc Devroye"
, title =	"Intersections with random geometric objects"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"139--154"
, succeeds =	"bd-irgo-95"
, update =	"98.11 devillers"
}

@techreport{bde-danmw-96t
, author =	"P. Bose and L. Devroye and W. Evans"
, title =	"Diamonds are not a minimum weight triangulation's best friend"
, type =	"Technical {Report}"
, number =	"96-01"
, institution =	"Dept. Comput. Sci., Univ. British Comumbia"
, month =	jan
, year =	1996
, update =	"97.11 bibrelex"
}

@inproceedings{bde-danmw-96
, author =	"P. Bose and L. Devroye and W. Evans"
, title =	"Diamonds are not a minimum weight triangulation's best friend"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"68--73"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{bdll-pcrt-95
, author =	"P. Bose and G. {Di Battista} and W. Lenhart and G. Liotta"
, title =	"Proximity Constraints and Representable Trees"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"340--351"
, keywords =	"graph drawing, proximity, trees"
, update =	"95.01 tamassia"
}

@techreport{bdll-pcrt-96
, author =	"P. Bose and G. {Di Battista} and W. Lenhart and G. Liotta"
, title =	"Proximity Constraints and Representable Trees"
, type =	"Technical Report"
, number =	"RT-INF-9-96"
, institution =	"Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III"
, year =	1996
, url =	"http://www.cs.brown.edu/cgc/papers/bdll-pcrt-96.ps.gz"
, keywords =	"graph drawing, proximity, CGC, Brown"
, update =	"97.03 tamassia"
}

@inproceedings{bekms-aspal-96
, author =	"P. Bose and W. Evans and D. Kirkpatrick and M. McAllister and J . Snoeyink"
, title =	"Approximating shortest paths in arrangements of lines"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"143--148"
, update =	"98.03 mitchell, 96.09 mitchell"
, annote =	"2-approximation in $O(n\log n)$ time"
}

@incollection{beflmrsw-ovrg3d-94
, author =	"P. Bose and H. Everett and S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer and K. Romanik and T. Shermer and S. Whitesides"
, title =	"On a Visibility Representation for Graphs in Three Dimensions"
, editor =	"D. Avis and P. Bose"
, booktitle =	"Snapshots in Computational and Discrete Geometry, Volume III"
, publisher =	"McGill University"
, month =	jul
, year =	1994
, pages =	"2--25"
, note =	"McGill technical report SOCS-94.50"
, keywords =	"graph drawing, visibility"
, precedes =	"behflmrrswz-vrg3d-98"
, update =	"98.07 rote, 98.03 mitchell, 97.03 rote, 96.09 romanik"
}

@article{behflmrrswz-vrg3d-98
, author =	"P. Bose and H. Everett and Michael E. Houle and S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer and K. Romanik and G{\"u}nter Rote and T. Shermer and S. Whitesides and Christian Zelle"
, title =	"A visibility representation for graphs in three dimensions"
, journal =	"J. Graph Algorithms Appl."
, volume =	2
, number =	3
, year =	1998
, pages =	"1--16"
, keywords =	"graph drawing, visibility"
, succeeds =	"beflmrsw-ovrg3d-94, fhw-nrvrg-96"
, update =	"98.07 rote, 98.03 mitchell, 97.11 orourke, 97.03 rote"
, abstract =	"We propose a 3-dimensional visibility representation of graphs
		in which vertices are mapped to horizontal axis-parallel
		rectangles floating in 3-space, with edges represented by
		vertical lines of sight. We apply an extension of the
		{Erd\H os}-Szekeres Theorem in a geometric setting to obtain an
		upper bound of 56 for size of the largest complete graph which
		is representable. On the other hand, we construct a
		representation of the complete graph with 22 vertices.
		These are the best existing bounds."
}

@inproceedings{bew-pag-98
, author =	"P. Bose and H. Everett and S. K. Wismath"
, title =	"Properties of Arragement Graphs"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"45--47"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{bgrt-dnpos-96
, author =	"Prosenjit Bose and Francisco Gomez and Pedro Ramos and Godfried T. Toussaint"
, title =	"Drawing nice projections of objects in space"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"52--63"
, update =	"98.07 orourke"
}

@inproceedings{bglosu-fp-93
, author =	"P. Bose and Leonidas J. Guibas and A. Lubiw and M. Overmars and D. Souvaine and J. Urrutia"
, title =	"The floodlight problem"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"399--404"
, precedes =	"bglosu-fp-97"
, cites =	"cru-glmvg-89, cru-irtp-93, e-acg-87, o-agta-87, ps-cgi-85, bfprt-tbs-73, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell"
}

@article{bglosu-fp-97
, author =	"P. Bose and Leonidas J. Guibas and A. Lubiw and M. Overmars and D. Souvaine and J. Urrutia"
, title =	"The floodlight problem"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"153--163"
, succeeds =	"bglosu-fp-93"
, update =	"98.03 mitchell, 97.07 devillers"
}

@inproceedings{bht-esdls-94
, author =	"P. Bose and M. E. Houle and G. Toussaint"
, title =	"Every Set of Disjoint Line Segments Admits a Binary Tree"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"??"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
}

@article{bht-esdls-01
, author =	"P. Bose and M. E. Houle and G. T. Toussaint"
, title =	"Every Set of Disjoint Line Segments Admits a Binary Tree"
, journal =	"Discrete Comput. Geom."
, volume =	26
, year =	2001
, pages =	"387--410"
, update =	"02.03 smid"
}

@inproceedings{bhot-aaop-95
, author =	"Prosenjit Bose and Ferran Hurtado-Diaz and Elsa Oma{\~n}a-Pulido and Godfried Toussaint"
, title =	"Aperture Angle Optimization Problems"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"73--78"
, update =	"95.09 jones"
}

@article{bhot-oaa-93
, author =	"P. Bose and F. Hurtado and E. Oman{\~n}a and G. T. Toussaint"
, title =	"Optimizaci{\'o}n del {\`a}ngulo de apertura"
, journal =	"Actas del {IV} Encuentro Espan{\~n}ol de Geometr{\'i}a Computacional"
, volume =	"??"
, year =	1993
, update =	"98.11 bibrelex"
}

@incollection{bjmo-kibvg-94
, author =	"P. Bose and A. Josefczyk and J. Miller and J. O'Rourke"
, title =	"{$K_{42}$} is a box visibility graph"
, booktitle =	"Snapshots of Computational and Discrete Geometry"
, volume =	3
, publisher =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, month =	jul
, year =	1994
, pages =	"88--91"
, note =	"Technical Report SOCS-94.50"
, keywords =	"visibility graphs"
, comments =	"Also Technical Report 035, Dept. Comput. Sci., Smith College"
, update =	"94.09 orourke"
}

@inproceedings{bkl-eagis-96
, author =	"P. Bose and D. Kirkpatrick and Z. Li"
, title =	"Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"217--222"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{bkt-fpm-93
, author =	"Prosenjit Bose and Marc van Kreveld and Godfried Toussaint"
, title =	"Filling Polyhedral Molds"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"210--221"
, update =	"93.09 milone+mitchell+smid, 93.05 jones"
}

@article{bkt-fpm-98
, author =	"P. Bose and M. van Kreveld and G. Toussaint"
, title =	"Filling Polyhedral Molds"
, journal =	"Comput. Aided Design"
, volume =	30
, number =	4
, month =	apr
, year =	1998
, pages =	"245--254"
, update =	"98.07 held"
}

@techreport{bll-cpt-93t
, author =	"P. Bose and W. Lenhart and G. Liotta"
, title =	"Characterizing proximity trees"
, type =	"Technical Report"
, number =	"SOCS 93.9"
, institution =	"School of Computer Science, McGill University"
, address =	"Montr{\'e}al, Quebec"
, year =	1993
, precedes =	"bll-cpt-93, bll-cpt-96"
, update =	"98.11 bibrelex"
}

@inproceedings{bll-cpt-93
, author =	"P. Bose and W. Lenhart and G. Liotta"
, title =	"Characterizing proximity trees"
, booktitle =	"Graph Drawing (Proc. GD '93)"
, year =	1993
, succeeds =	"bll-cpt-93t"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{bll-cpt-96
, author =	"P. Bose and W. Lenhart and G. Liotta"
, title =	"Characterizing Proximity Trees"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"83--110"
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
, keywords =	"graph drawing, proximity"
, succeeds =	"bll-cpt-93t"
, update =	"98.11 bibrelex, 96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@inproceedings{blm-evqsp-92
, author =	"P. Bose and A. Lubiw and J. I. Munro"
, title =	"Efficient visibility queries in simple polygons"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"23--28"
, cites =	"bm-gta-76, b-vsp-91, gmr-rlptd-92, k-osps-83, lp-lppsi-77, o-agta-87, p-nappl-81, ps-cgi-85, st-pplup-86, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{bmmm-gpp-01
, author =	"Prosenjit Bose and Anil Maheshwari and Pat Morin and Jason Morrison"
, title =	"The Grid Placement Problem"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"74--77"
, update =	"01.04 icking"
}

@inproceedings{bm-ort-99
, author =	"P. Bose and P. Morin"
, title =	"Online routing in triangulations"
, booktitle =	"Proc. 10th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '99"
, series =	"Lecture Notes Comput. Sci."
, volume =	1741
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"113--122"
, update =	"00.03 smid"
}

@inproceedings{brtt-ecqas-96
, author =	"Prosenjit Bose and Suneeta Ramaswami and Godfried Toussaint and Alain Turki"
, title =	"Experimental Comparison of Quadrangulation Algorithms for Sets of Points"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"39--40"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{bstz-gpt-92
, author =	"P. Bose and T. Shermer and G. Toussaint and B. Zhu"
, title =	"Guarding polyhedral terrains"
, type =	"Technical Report"
, number =	"SOCS-92.20"
, institution =	"McGill University"
, year =	1992
, precedes =	"bstz-gpt-97"
, update =	"98.11 bibrelex"
}

@article{bstz-gpt-97
, author =	"P. Bose and T. Shermer and G. Toussaint and B. Zhu"
, title =	"Guarding polyhedral terrains"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"173--185"
, succeeds =	"bstz-gpt-92"
, update =	"98.11 bibrelex, 97.03 devillers"
}

@article{bt-cecqp-97
, author =	"Prosenjit Bose and Godfried Toussaint"
, title =	"Characterizing and Efficiently Computing Quadrangulations of Planar Point Sets"
, journal =	"Comput. Aided Geom. Design"
, volume =	14
, year =	1997
, pages =	"763--785"
, comments =	"See also \cite{ahms-htfr-96}, where some similar facts are
                  shown."
, succeeds =	"bt-nqieo-95"
, update =	"98.03 mitchell"
}

@techreport{bt-gcaim-92
, author =	"P. Bose and G. Toussaint"
, title =	"Geometric and computational aspects of injection molding"
, type =	"Technical Report"
, number =	"SOCS 92.16"
, institution =	"School of Computer Science, McGill University"
, address =	"Canada"
, year =	1992
, precedes =	"bt-gcaim-93"
, update =	"98.11 bibrelex"
}

@inproceedings{bt-gcaim-93
, author =	"P. Bose and G. Toussaint"
, title =	"Geometric and computational aspects of injection molding"
, booktitle =	"Proc. 3rd. Internat. Conf. CAD Comput. Graph."
, site =	"Beijing, China"
, year =	1993
, pages =	"237--242"
, succeeds =	"bt-gcaim-92"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{bt-gcamp-94
, author =	"P. Bose and G. Toussaint"
, title =	"Geometric and computational aspects of manufacturing processes"
, journal =	"Comput. \& Graphics"
, volume =	18
, year =	1994
, pages =	"487--497"
, update =	"97.03 schwarzkopf"
}

@inproceedings{bt-gtfb-93
, author =	"Prosenjit Bose and Godfried Toussaint"
, title =	"Growing a tree from its branches"
, booktitle =	"Proc. First Pacific Conf. Computer Graphics Appl., Seoul, Korea, vol. 1"
, volume =	1
, publisher =	"World Scientific Publishing Co."
, year =	1993
, pages =	"90--99"
, keywords =	"segments, points, minimal spanning tree, lower bounds"
, update =	"96.05 smid, 95.09 korneenko"
, annote =	"Non-crossing spanning tree for ends of disjoint plane segments,
  that includes these segments as its edges, in $\Omega(n \log n)$."
}

@inproceedings{bt-nqieo-95
, author =	"Prosenjit Bose and Godfried Toussaint"
, title =	"No Quadrangulation is Extremely Odd"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"372--381"
, precedes =	"bt-cecqp-97"
, update =	"98.07 bibrelex, 98.03 mitchell, 96.01 smid, 95.09 mitchell"
}

@mastersthesis{b-vsp-91
, author =	"Prosenjit K. Bose"
, title =	"Visibility in simple polygons"
, school =	"Department of Computer Science, University of Waterloo"
, year =	1991
, keywords =	"master thesis"
}

@inproceedings{bh-pmamg-96
, author =	"Frank J. Bossen and Paul S. Heckbert"
, title =	"A pliant method for anisotropic mesh generation"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"63--74"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{b-cahs-93
, author =	"R. A. Botafogo"
, title =	"Cluster Analysis for Hypertext Systems"
, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
, year =	1993
, pages =	"116--125"
, keywords =	"Aggregation, Clustering, Structural analysis, Hypertext, Graph theory"
, update =	"98.07 agarwal"
}

@book{bt-dfat-82
, author =	"R. Bott and L. W. Tu"
, title =	"Differentiable forms in algebraic topology"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1982
, update =	"98.03 bibrelex"
}

@article{bv-lsedn-77
, author =	"O. Bottema and G. R. Veldkamp"
, title =	"On the lines in space with equal distances to $n$ given points"
, journal =	"Geom. Dedicata"
, volume =	6
, year =	1977
, pages =	"121--129"
, update =	"01.07 devillers"
}

@article{b-ihca-84
, author =	"A. Boucher"
, title =	"It's hard to color antirectangles"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	5
, number =	2
, year =	1984
, pages =	"162--163"
, keywords =	"isothetic"
, update =	"95.05 korneenko"
}

@techreport{bfhcp-gcs-93
, author =	"W. Bouma and I. Fudos and C. Hoffmann and J. Cai and R. Paige"
, title =	"A geometric constraint solver"
, type =	"Technical {Report}"
, number =	"CSD-TR-93-054"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1993
, update =	"98.07 bibrelex"
}

@incollection{bv-vbcd-95
, author =	"W. Bouma and G. {Van{\v e}{\v c}ek Jr.}"
, title =	"Velocity-based collision detection"
, editor =	"A. Paeth"
, booktitle =	"Graphics Gems V"
, publisher =	"Academic Press"
, year =	1995
, update =	"98.07 bibrelex"
}

@inproceedings{bv-cdapb-91
, author =	"W. J. Bouma and G. {Van{\v e}{\v c}ek Jr.}"
, title =	"Collision Detection and Analysis in a Physically Based Simulation"
, booktitle =	"Second Eurographics Workshop on Animation and Simulation"
, year =	1991
, update =	"95.01 mitchell"
}

@inbook{b-geadl-68
, author =	"N. Bourbaki"
, title =	"Groupes et alg{\`e}bres de Lie"
, chapter =	"4, 5, 6"
, publisher =	"Hermann"
, address =	"Paris, France"
, year =	1968
, update =	"97.11 bibrelex"
}

@article{bs-gtovl-89
, author =	"N. G. Bourbakis and I. N. Savvides"
, title =	"Geometric transformations for optimal {VLSI} layout placement"
, journal =	"Microproc. and Microprogr."
, volume =	25
, number =	"1--4"
, year =	1989
, pages =	"163--170"
, keywords =	"VLSI design, placement"
, update =	"95.05 korneenko"
}

@article{bl-abmss-93
, author =	"J. Bourgain and Joram Lindenstrauss"
, title =	"Approximating the ball by a {Minkowski} sum of segments with equal length"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"131--144"
, update =	"96.05 ramkumar"
}

%   is CAMS really the institution??
@techreport{br-t-91
, author =	"M. Bousset and P. Rosenstiehl"
, title =	"Twist"
, number =	"P.073"
, institution =	"CAMS"
, year =	1991
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{bc-mgrfc-92
, author =	"S. W. Bova and G. F. Carey"
, title =	"Mesh generation/refinement using fractal concepts and iterated function systems"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	33
, year =	1992
, pages =	"287--305"
, update =	"98.11 bibrelex"
}

@article{b-cdt-81
, author =	"A. Bowyer"
, title =	"Computing {Dirichlet} tesselations"
, journal =	"Comput. J."
, volume =	24
, year =	1981
, pages =	"162--166"
}

@techreport{b-mpump-85
, author =	"A. Bowyer"
, title =	"Matching patterns using a modified procrustean algorithm"
, type =	"Report"
, number =	"??"
, institution =	"School Engrg., Univ. Bath"
, address =	"Bath, England"
, year =	1985
}

@book{bw-pg-83
, author =	"A. Bowyer and J. R. Woodwork"
, title =	"A programmer's geometry"
, publisher =	"Butterworths"
, year =	1983
, update =	"98.07 bibrelex, 95.05 korneenko"
}

@article{bd-agisr-90
, author =	"K. W. Bowyer and C. R. Dyer"
, title =	"Aspect graphs: {An} introduction and survey of recent results"
, journal =	"Int. J. of Imaging Systems and Technology"
, volume =	2
, year =	1990
, pages =	"315--328"
, update =	"98.03 agarwal"
}

@article{bm-pccma-89
, author =	"L. Boxer and R. Miller"
, title =	"A parallel circle-cover minimization algorithm"
, journal =	"Inform. Process. Lett."
, volume =	32
, number =	2
, year =	1989
, pages =	"57--60"
, keywords =	"parallel computations, circles, covering, optimization"
, update =	"95.05 korneenko"
}

@article{bm-cip-90
, author =	"L. Boxer and R. Miller"
, title =	"Common intersection of polygons"
, journal =	"Inform. Process. Lett."
, volume =	33
, number =	5
, year =	1990
, pages =	"249--254"
, keywords =	"convex polygons, intersection, parallel computations"
, update =	"95.05 korneenko"
}

@article{bm-ccipi-90
, author =	"L. Boxer and R. Miller"
, title =	"Corrigenda ``{Common} intersections of polygons, {Inf}.{Proc}.{Lett}. 33(1990) 249-254''"
, journal =	"Inform. Process. Lett."
, volume =	35
, number =	1
, year =	1990
, pages =	53
, keywords =	"convex polygons, intersection, parallel computations"
, update =	"95.05 korneenko"
}

@inproceedings{bm-dcgmh-88
, author =	"L. Boxer and R. Miller"
, title =	"Dynamic computational geometry on meshes and hypercubes"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, volume =	1
, year =	1988
, pages =	"323--330"
, keywords =	"parallel computation, proximity, intersection, convex hull, diameter, containment"
, update =	"95.05 korneenko"
}

@inproceedings{bm-dcgpc-88
, author =	"L. Boxer and R. Miller"
, title =	"Dynamic computational geometry on parallel computers"
, booktitle =	"Proc. Conf. Hypercube Concurr. Comput. Appl., Pasadena"
, publisher =	"ACM Press"
, year =	1988
, pages =	"1212--1219"
, keywords =	"parallel computation"
, update =	"95.05 korneenko"
}

@techreport{bm-pdcg-87
, author =	"L. Boxer and R. Miller"
, title =	"Parallel dynamic computational geometry"
, type =	"Report"
, number =	"87-11"
, institution =	"Dept. Comput. Sci., SUNY-Buffalo"
, year =	1987
, update =	"96.09 orourke"
}

@article{bm-pdcg-89
, author =	"L. Boxer and R. Miller"
, title =	"Parallel dynamic computational geometry"
, journal =	"J. New Generation Comput. Syst."
, volume =	2
, number =	3
, year =	1989
, pages =	"227--246"
, keywords =	"parallel computation"
, update =	"95.05 korneenko"
}

@inproceedings{bddg-fep-82
, author =	"J. E. Boyce and D. P. Dobkin and R. L. {Drysdale, III} and Leonidas J. Guibas"
, title =	"Finding extremal polygons"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
, year =	1982
, pages =	"282--289"
, keywords =	"polygons, maximum, dynamic programming"
, precedes =	"bddg-fep-85"
, update =	"98.03 mitchell"
}

@article{bddg-fep-85
, author =	"J. E. Boyce and D. P. Dobkin and R. L. {Drysdale, III} and Leonidas J. Guibas"
, title =	"Finding extremal polygons"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"134--147"
, keywords =	"polygons, maximum, dynamic programming"
, succeeds =	"bddg-fep-82"
, update =	"98.03 mitchell"
}

@article{b-ipfst-77
, author =	"W. M. Boyce"
, title =	"An improved program for the full {Steiner} tree problem"
, journal =	"ACM Trans. Math. Softw."
, volume =	3
, year =	1977
, pages =	"359--385"
}

@techreport{bs-s72iv-73
, author =	"W. M. Boyce and J. E. Seery"
, title =	"{STEINER} 72: {An} improved version of {Cockayne} and {Schiller}'s program {STEINER} for the minimal network problem"
, type =	"Report"
, number =	35
, institution =	"Comput. Sci. Center, Bell Lab."
, address =	"Murray Hill, NJ"
, year =	1973
}

@incollection{b-amm-90
, author =	"D. B. Boyd"
, title =	"Aspects of molecular modeling"
, editor =	"K. Lipkowitz and D. B. Boyd"
, booktitle =	"Reviews in Computational Chemistry"
, volume =	1
, publisher =	"VCH Publishers"
, year =	1990
, pages =	"321--351"
, update =	"98.07 bibrelex"
}

@inproceedings{bp-ri-01
, author =	"Edmond Boyer and Sylvain Petitjean"
, title =	"Regular Interpolants"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"125--128"
, update =	"01.04 icking"
}

@article{bp-adiic-76
, author =	"M. Boyer and L. Paquette"
, title =	"An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior"
, journal =	"BIT"
, volume =	16
, year =	1976
, pages =	"459--461"
}

@article{bs-iftmo-92
, author =	"M. Boyer and N. F. Stewart"
, title =	"Imperfect-form tolerancing on manifold objects: a metric approach"
, journal =	"Internat. J. Robot. Res."
, volume =	11
, number =	5
, year =	1992
, pages =	"482--490"
, update =	"98.07 bibrelex"
}

@article{bs-msto-91
, author =	"M. Boyer and N. F. Stewart"
, title =	"Modeling spaces for toleranced objects"
, journal =	"Internat. J. Robot. Res."
, volume =	10
, number =	5
, year =	1991
, pages =	"570--582"
, update =	"98.07 bibrelex"
}

@book{b-hjfd-89
, title =	"Handbook of Jig and Fixture Design"
, editor =	"W. Boyes"
, edition =	"2nd"
, publisher =	"Society of Manufacturing Engineers"
, year =	1989
, update =	"98.03 bibrelex"
}

@article{b-idss-79
, author =	"J. W. Boyse"
, title =	"Interference detection among solids and surfaces"
, journal =	"Commun. ACM"
, volume =	22
, year =	1979
, pages =	"3--9"
}

@article{bg-gimha-84
, author =	"J. W. Boyse and J. E. Gilchrist"
, title =	"GMSOLID interactive modeling for hull algorithms"
, journal =	"BYTE"
, volume =	"??"
, year =	1984
, pages =	"2--13"
, update =	"98.03 bibrelex"
}

@unpublished{bkmt-nriqp-96
, author =	"P. Bozanis and N. Ktsios and C. Makris and A. Tsakalidis"
, title =	"New results on intersection query problems"
, year =	1996
, note =	"unpublished manuscript"
, update =	"97.07 agarwal"
}

@inproceedings{bkmt-nubgi-95
, author =	"P. Bozanis and N. Ktsios and C. Makris and A. Tsakalidis"
, title =	"New upper bounds for generalized intersection searching problems"
, booktitle =	"Proc. 22nd Inter. Colloq. Auto. Lang. and Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	944
, year =	1995
, pages =	"464--475"
, update =	"97.07 agarwal"
}

@inproceedings{bs-vasoq-00
, author =	"Franti{\v s}ek Brabec and Hanan Samet"
, title =	"Visualizing and Animating Search Operations on Quadtrees on the Worldwide Web"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"70--76"
, update =	"00.03 bibrelex"
}

@techreport{bc-wenph-95
, author =	"P. G. Bradford and V. Capoyleas"
, title =	"Weak $\epsilon$-nets for points on a hypersphere"
, type =	"Report"
, number =	"MPI-I-95-1-029"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1995
, precedes =	"bc-wenph-97"
, update =	"98.07 smid, 96.01 smid"
}

@article{bc-wenph-97
, author =	"P. G. Bradford and V. Capoyleas"
, title =	"Weak $\epsilon$-nets for points on a hypersphere"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"83--91"
, succeeds =	"bc-wenph-95"
, update =	"98.07 smid"
}

@techreport{bfs-ptowp-95
, author =	"P. G. Bradford and R. Fleischer and M. Smid"
, title =	"A polylog-time and $O(n \sqrt{\lg n})$-work parallel algorithm for finding the row minima in totally monotone matrices"
, type =	"Report"
, number =	"MPI-I-95-1-006"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1995
, precedes =	"bfs-meptm-97"
, update =	"97.07 smid, 95.05 smid"
}

@article{bfs-meptm-97
, author =	"P. G. Bradford and R. Fleischer and M. Smid"
, title =	"More efficient parallel totally monotone matrix searching"
, journal =	"J. Algorithms"
, volume =	23
, year =	1997
, pages =	"386--400"
, succeeds =	"bfs-ptowp-95"
, update =	"97.07 smid"
}

@book{b-rmpc-82
, title =	"Robot Motion: Planning and Control"
, editor =	"M. Brady"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1982
, update =	"97.11 bibrelex"
}

@incollection{bb-vrfls-84
, author =	"M. L. Brady and D. J. Brown"
, title =	"VLSI Routing: {Four} Layers Suffice"
, editor =	"Franco P. Preparata"
, booktitle =	"VLSI Theory"
, series =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1984
, pages =	"245--257"
, update =	"01.04 icking, 98.03 bibrelex"
}

@article{b-sctdm-22
, author =	"H. R. Brahana"
, title =	"Systems of circuits on Two-dimensional manifolds"
, journal =	"Annals of Math."
, volume =	23
, year =	1922
, pages =	"144--168"
, update =	"97.11 bibrelex"
}

@techreport{b-ngm-79
, author =	"I. C. Braid"
, title =	"Notes on a geometric modeller"
, type =	"{CAD} {Group} {Document}"
, number =	101
, institution =	"Comput. Lab., Cambridge Univ."
, address =	"Cambridge, England"
, year =	1979
}

@article{b-ssbmf-75
, author =	"I. C. Braid"
, title =	"The synthesis of solids bounded by many faces"
, journal =	"Commun. ACM"
, volume =	18
, number =	4
, year =	1975
, pages =	"209--216"
}

@incollection{bhs-swcpg-80
, author =	"I. C. Braid and R. C. Hillyard and I. A. Stroud"
, title =	"Step-wise construction of polyhedra in geometric modeling"
, editor =	"K. W. Brodlie"
, booktitle =	"Mathematical Methods in Computer Graphics and Design"
, publisher =	"Academic Press"
, address =	"London, England"
, year =	1980
, pages =	"123--141"
, keywords =	"polyhedra, geometric modeling"
, update =	"97.11 bibrelex, 95.05 korneenko"
}

@inproceedings{b-dgdlg-95
, author =	"F. J. Brandenburg"
, title =	"Designing Graph Drawings by Layout Graph Grammars"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"416--427"
, keywords =	"graph drawing, grammar"
, update =	"95.01 tamassia"
}

@inproceedings{b-gc1cc-97
, author =	"F. J. Brandenburg"
, title =	"Graph Clustering {I}: Cycles of Cliques"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"158--168"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@proceedings{b-gd-96
, title =	"Graph Drawing (Proc. GD '95)"
, editor =	"F. J. Brandenburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, keywords =	"graph drawing"
, update =	"98.11 bibrelex, 98.07 bibrelex+vismara, 96.09 tamassia"
}

@techreport{b-ndgta-88
, author =	"F. J. Brandenburg"
, title =	"Nice Drawings of Graphs and Trees are Computationally Hard"
, number =	"MIP-8820"
, institution =	"Fakultat fur Mathematik und Informatik, Univ. Passau"
, year =	1988
, keywords =	"graph drawing"
, update =	"95.01 tamassia, 93.09 tamassia"
}

@inproceedings{bhr-ecfdr-96
, author =	"Franz J. Brandenburg and M. Himsolt and Christoph Rohrer"
, title =	"An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"76--87"
, keywords =	"graph drawing, experiments, straight-line"
, update =	"98.07 vismara, 96.09 tamassia"
}

@techreport{bh-ncrmp-96
, author =	"U. Brandes and D. Handke"
, title =	"{NP}-completeness results for minimum planar spanners"
, type =	"Technical Report"
, number =	16
, institution =	"Fakult{\"a}t f{\"u}r Mathematik und Informatik, Universit{\"a}t Konstanz"
, address =	"Konstanz, Germany"
, year =	1996
, update =	"97.03 smid"
}

@inproceedings{bw-bpdgl-97
, author =	"Ulrik Brandes and Dorothea Wagner"
, title =	"A Bayesian Paradigm for Dynamic Graph Layout"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"236--247"
, keywords =	"graph drawing"
, update =	"99.11 bibrelex, 98.07 patrignani+vismara"
}

@incollection{b-jnpbg-89
, author =	"A. Brandstadt"
, title =	"The jump number problem for biconvex graphs and rectangle covers of rectangular regions"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	380
, year =	1989
, pages =	"68--77"
, keywords =	"isothetic, covering, rectangles"
, update =	"95.05 korneenko"
}

@inproceedings{bcd-auhsm-95
, author =	"A. Brandst{\"a}dt and V. D. Chepoi and F. F. Dragan"
, title =	"The algorithmic use of hypertree structure and maximum neighbourhood orderings"
, booktitle =	"Proc. 20th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	903
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"65--80"
, update =	"99.11 bibrelex, 98.07 bibrelex"
}

@article{b-cccda-94
, author =	"J. W. Brandt"
, title =	"Convergence and continuity criteria for discrete approximations of the continuous planar skeletons"
, journal =	"CVGIP: Image Understanding"
, volume =	59
, number =	1
, year =	1994
, pages =	"116--124"
, update =	"98.07 bibrelex"
}

@inproceedings{ba-cscsd-91
, author =	"Jonathan W. Brandt and V. Ralph Algazi"
, title =	"Computing a Stable, Connected Skeleton From Discrete Data"
, booktitle =	"Proceedings of the 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition"
, publisher =	"IEEE"
, address =	"IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 91CH2983-5)"
, year =	1991
, pages =	"666--667"
, keywords =	"Voronoi diagram"
, abstract =	"The relationship between the skeleton and the Voronoi
		 diagram for the case of morphologically regular sets is
		 described. Using the discrete-point Voronoi diagram, a
		 practical algorithm is developed to compute an
		 approximate skeleton of a continuous shape from sampled
		 data. The analysis also yields a sampling criterion
		 under which the approximation is stable. The algorithm
		 is applied to a simple test image. 4 Refs."
}

@article{ba-cscvd-92
, author =	"J. W. Brandt and V. R. Algazi"
, title =	"Continuous Skeleton Computation by {Voronoi} Diagram"
, journal =	"CVGIP: Image Understanding"
, volume =	55
, number =	3
, year =	1992
, pages =	"329--338"
}

@inproceedings{b-albhp-01
, author =	"Peter Bra{\ss}"
, title =	"Another Lower Bound for {Hopcroft's} Problem"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"70--73"
, update =	"01.04 icking"
}

@article{b-edpns-96
, author =	"P. Brass"
, title =	"Erd{\H o}s distance problems in normed spaces"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"195--214"
, update =	"96.09 devillers"
}

@inproceedings{b-aps-00
, author =	"Peter Brass"
, title =	"On the Approximation of Polygons by Subpolygons"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"59--61"
, update =	"00.03 bibrelex"
}

@inproceedings{bk-tcddp-00a
, author =	"Peter Bra{\ss} and Christian Knauer"
, title =	"Testing the Congruence of $d$-Dimensional Point Sets"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"310--314"
, update =	"00.11 jones"
}

@inproceedings{bk-tcddp-00e
, author =	"Peter Bra{\ss} and Christian Knauer"
, title =	"Testing the Congruence of {$d$}-Dimensional Point Sets"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"104--107"
, update =	"00.03 bibrelex"
}

@book{bb-atp-88
, author =	"G. Brassard and P. Bratley"
, title =	"Algorithmics: Theory and Practice"
, publisher =	"Prentice Hall"
, address =	"Enlewood Cliffs, NJ"
, year =	1988
, update =	"98.07 bibrelex"
}

@article{bf-asrvd-79
, author =	"K. E. Brassel and R. Fegeas"
, title =	"An algorithm for shading of regions on vector display devices"
, journal =	"Comput. Graph."
, volume =	13
, number =	2
, year =	1979
, pages =	"126--133"
, note =	"Proc. SIGGRAPH '79"
}

@article{br-pgtp-79
, author =	"K. E. Brassel and D. Reif"
, title =	"A procedure to generate {Thiessen} polygons"
, journal =	"Geogr. Anal."
, volume =	11
, year =	1979
, pages =	"289--303"
}

@article{bw-arfam-88
, author =	"K. E. Brassel and R. Weibel"
, title =	"A review and framework of automated map generalization"
, journal =	"Intl. J. Geographic. Info. Systems"
, volume =	2
, number =	3
, year =	1988
, pages =	"229--244"
, update =	"98.03 agarwal"
}

@article{bs-nmpde-95
, author =	"J. Braun and M. Sambridge"
, title =	"A numerical method for solving partial differential equations on highly irregular evolving grids"
, journal =	"Nature"
, volume =	376
, year =	1995
, pages =	"655--660"
, keywords =	"Delaunay remeshing, finite element, natural neighbours"
, update =	"95.09 sambridge"
, annote =	"Lagrangian PDE solver using Delaunay remeshing and
natural neighbour interpolation. Able to solve problems mixing fluids
and solids on dynamically evolving grids without remeshing."
}

@article{bs-dlrna-94
, author =	"J. Braun and M. S. Sambridge"
, title =	"Dynamical {Lagrangian} Remeshing (DLR): A new algorithm for solving large strain deformation problems and its application to fault-propagation folding"
, journal =	"Earth and Planet. Sci. Lett."
, volume =	124
, year =	1994
, pages =	"211--220"
, keywords =	"Delaunay remeshing, finite element"
, update =	"94.09 sambridge"
}

@article{b-cvdks-82
, author =	"M. Breen"
, title =	"Clear visibility and the dimension of kernels of starshaped sets"
, journal =	"Proc. Amer. Math. Soc."
, volume =	85
, year =	1982
, pages =	"414--418"
, update =	"98.07 bibrelex"
}

@article{b-iubr-92
, author =	"M. Breen"
, title =	"Illumination for unions of boxes in {$R^d$}"
, journal =	"Proc. Amer. Math. Soc."
, volume =	116
, number =	1
, year =	1992
, pages =	"197--202"
, keywords =	"illumination, visibility, Helly"
}

@article{b-kpccu-88
, author =	"M. Breen"
, title =	"$K$-partitions and a characterization for compact unions of $k$ starshaped sets"
, journal =	"Proc. Amer. Math. Soc."
, volume =	102
, number =	3
, year =	1988
, pages =	"677--680"
, keywords =	"starshaped"
, update =	"95.05 korneenko"
}

@article{bk-gdtmc-76
, author =	"M. Breen and D. C. Kay"
, title =	"General decomposition theorems for $m$-convex sets in the plane"
, journal =	"Israel J. Math."
, volume =	24
, year =	1976
, pages =	"217--233"
, update =	"98.03 bibrelex"
}

@article{bk-sapsr-82
, author =	"U. Brehm and W. K{\"u}hnel"
, title =	"Smooth approximation of polyhedral surfaces regarding curvatures"
, journal =	"Geom. Dedicata"
, volume =	12
, year =	1982
, pages =	"435--461"
}

@incollection{bs-pm-97
, author =	"U. Brehm and E. Schulte"
, title =	"Polyhedral maps"
, chapter =	18
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"345--360"
, update =	"97.11 orourke"
}

@incollection{bw-pm-93
, author =	"U. Brehm and J. M. Wills"
, title =	"Polyhedral Manifolds"
, editor =	"P. M. Gruber and J. M. Wills"
, booktitle =	"Handbook of Convex Geometry"
, publisher =	"North-Holland"
, year =	1993
, update =	"99.11 bibrelex, 96.09 orourke"
}

@book{bfos-crt-84
, author =	"L. Breiman and J. Friedman and R. Olshen and C. Stone"
, title =	"Classification and Regression Trees"
, publisher =	"Wadsworth International Group"
, year =	1984
, update =	"95.05 agarwal"
}

@techreport{bs-parpv-92
, author =	"David Bremmer and Thomas Shermer"
, title =	"Properties and applications of restricted-orientation point visibility graphs"
, type =	"manuscript"
, institution =	"School of Computing Science, Simon Fraser University"
, year =	1992
, update =	"98.11 bibrelex"
}

@inproceedings{b-l2cof-94
, author =	"D. Bremner"
, title =	"Link-$2$-Convex One-Fillable Polygons are Starshaped"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"363--368"
, cites =	"bt-gcaim-92, b-pvgro-93, bs-pvgro-93, cr-occop-89a, k-mchco-86, mrs-pgocc-89, r-erog-87, rw-rocs-91, mrs-copsp-89, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@mastersthesis{b-pvgro-93
, author =	"David Bremner"
, title =	"Point Visibility Graphs and Restricted-Orientation Polygon Covering"
, type =	"M.{Sc}. Thesis"
, school =	"School of Computing Science, Simon Fraser University"
, address =	"Burnaby, BC"
, month =	apr
, year =	1993
, keywords =	"master thesis"
, update =	"94.05 bremner"
}

@inproceedings{bfm-pdmvf-97
, author =	"D. Bremner and K. Fukuda and M. Marzetta"
, title =	"Primal-Dual Methods for Vertex and Facet Enumeration"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"49--56"
, cites =	"af-pachv-92, b-icp-83, bmfn-psbzi-, ck-acp-70, c-lp-83, c-mosga-94, d-cvem-83, e-dum-91, flm-abalv-97, gk-csbpc-94, ic-lp-94, m-mnfcp-70, m-mdscg-84, s-ossac-86, s-fchff-85, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@unpublished{bos-mpams-94
, author =	"D. Bremner and J. O'Rourke and T. Shermer"
, title =	"Motion planning amidst movable square blocks is {PSPACE} complete"
, year =	1994
, note =	"Draft, June"
, update =	"94.09 orourke"
}

@techreport{bs-pvgro-93
, author =	"David Bremner and Thomas Shermer"
, title =	"Point Visibility Graphs and Restricted-Oriention Convex Cover"
, type =	"Technical Report"
, number =	"CMPT TR 93-07"
, institution =	"School of Computing Science, Simon Fraser University"
, year =	1993
, update =	"94.05 bremner"
}

@phdthesis{b-afzef-71
, author =	"R. Brent"
, title =	"Algorithms for finding zeros and extrema of functions without calculating derivatives"
, school =	"Stanford University"
, address =	"Stanford, CA"
, year =	1971
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@article{b-fmpee-76
, author =	"R. P. Brent"
, title =	"Fast multiple-precision evaluation of elementary functions"
, journal =	"J. ACM"
, volume =	23
, year =	1976
, pages =	"242--251"
, update =	"98.03 bibrelex"
}

@article{b-pegae-74
, author =	"R. P. Brent"
, title =	"The Parallel Evaluation of General Arithmetic Expressions"
, journal =	"J. ACM"
, volume =	21
, number =	2
, year =	1974
, pages =	"201--206"
, update =	"96.09 orourke"
}

@article{bk-abtl-80
, author =	"R. P. Brent and H. T. Kung"
, title =	"On the area of binary tree layouts"
, journal =	"Inform. Process. Lett."
, volume =	11
, year =	1980
, pages =	"521--534"
, keywords =	"graph drawing"
, update =	"94.01 tamassia"
}

@article{b-laidd-77
, author =	"J. E. Bresenham"
, title =	"A linear algorithm for incremental digital display of circular arcs"
, journal =	"Commun. ACM"
, volume =	20
, year =	1977
, pages =	"100--106"
}

@article{b-accdp-65
, author =	"J. E. Bresenham"
, title =	"Algorithm for computer control of digital plotter"
, journal =	"IBM Syst. J."
, volume =	4
, year =	1965
, pages =	"25--30"
}

@incollection{b-ailr-88
, author =	"J. E. Bresenham"
, title =	"Ambiguities in incremental line rastering"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"329--358"
, update =	"99.11 bibrelex"
}

@article{bgdw-ltedt-95
, author =	"H. Breu and J. Gil and D. Kirkpatrick and M. Werman"
, title =	"Linear Time {Euclidean} Distance Transform and {Voronoi} Diagram Algorithms"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	17
, year =	1995
, pages =	"529--533"
, update =	"96.01 werman"
}

@article{bk-udgrn-98
, author =	"H. Breu and D. G. Kirkpatrick"
, title =	"Unit Disk Graph Recognition is {NP}-hard"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, number =	"1--2"
, year =	1998
, pages =	"3--24"
, note =	"(special issue on Geometric Representations of Graphs, edited by G. {Di Battista} and R. Tamassia)"
, keywords =	"graph drawing, proximity, NP-hardness"
, update =	"98.07 patrignani, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@inproceedings{bbdltv-trodo-99
, author =	"Stina Bridgeman and Giuseppe Di Battista and Walter Didimo and Guiseppe Liotta and Roberto Tamassia and Luca Vismara"
, title =	"Turn-Regularity and Optimal Drawings of Orthogonal Representations"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"161--164"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{bddltv-ocor-98
, author =	"Stina Bridgeman and Giuseppe {Di Battista} and Walter Didimo and Giuseppe Liotta and Roberto Tamassia and Luca Vismara"
, title =	"Optimal Compaction of Orthogonal Representations"
, booktitle =	"CGC Workshop on Geometric Computing"
, year =	1998
, url =	"http://www.cs.brown.edu/cgc/cgc98/"
, keywords =	"graph drawing, planar, orthogonal"
, update =	"98.11 tamassia"
}

@article{bgt-gdtsw-99
, author =	"Stina Bridgeman and Ashim Garg and Roberto Tamassia"
, title =	"A Graph Drawing and Translation Service on the {World Wide Web}"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, number =	"4--5"
, year =	1999
, pages =	"419--446"
, keywords =	"graph drawing, system"
, succeeds =	"bgt-gdtsw-97"
, update =	"00.03 vismara, 98.11 tamassia"
}

@inproceedings{bgt-gdtsw-97
, author =	"S. Bridgeman and A. Garg and R. Tamassia"
, title =	"A Graph Drawing and Translation Service on the {WWW}"
, editor =	"S. C. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"45--52"
, url =	"http://www.cs.brown.edu/cgc/papers/bgt-gdtsw-97.ps.gz"
, keywords =	"graph drawing, system, WWW, orthogonal, planarization, CGC, Brown"
, update =	"98.07 vismara, 97.03 tamassia"
}

@inproceedings{bt-dmiog-98
, author =	"S. Bridgeman and R. Tamassia"
, title =	"Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms"
, booktitle =	"Proc. Graph Drawing '98"
, publisher =	"Springer-Verlag"
, note =	"to appear"
, keywords =	"graph drawing, interactive, dynamic, system"
, update =	"98.11 tamassia"
}

@article{bddltv-troad-00
, author =	"S. S. Bridgeman and G. {Di Battista} and W. Didimo and G. Liotta and R. Tamassia and L. Vismara"
, title =	"Turn-Regularity and Optimal Area Drawings of Orthogonal Representations"
, journal =	"Comput. Geom. Theory Appl."
, volume =	16
, number =	1
, year =	2000
, pages =	"53--93"
, succeeds =	"bddltv-ocor-98, bbdltv-trodo-99, bddltv-trpod-99"
, update =	"00.11 smid, 00.07 vismara"
, annote =	"Special Issue on the 1998 Workshop on Computational
                  Geometry"
}

@inproceedings{bddltv-trpod-99
, author =	"S. S. Bridgeman and G. {Di Battista} and W. Didimo and G. Liotta and R. Tamassia and L. Vismara"
, title =	"Turn-Regularity and Planar Orthogonal Drawings"
, editor =	"J. Kratochv{\'\i}l"
, booktitle =	"Graph Drawing"
, nickname =	"GD '99"
, series =	"Lecture Notes Comput. Sci."
, volume =	1731
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"8--26"
, precedes =	"bddltv-troad-99"
, update =	"00.03 vismara"
}

@inproceedings{bfgtv-iaiog-97
, author =	"Stina S. Bridgeman and Jody Fanto and Ashim Garg and Roberto Tamassia and Luca Vismara"
, title =	"{InteractiveGiotto}: An Algorithm for Interactive Orthogonal Graph Drawing"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"303--308"
, keywords =	"graph drawing"
, update =	"99.11 bibrelex, 98.07 patrignani+tamassia+vismara"
}

@inproceedings{b-eaosp-89
, author =	"A. J. Briggs"
, title =	"An efficient algorithm for one-step planar compliant motion planning with uncertainty"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"187--196"
, keywords =	"motion planning, compliant motion, uncertainty"
, cites =	"aaghi-vdp-86, c-cfmp-89, cr-nlbtr-87, d-cpcmp-88, d-edrr-89, e-acg-87, e-mpu-84, e-ubfmp-86, lmt-asfms-84, l-spcsa-83, m-mgpo-82, m-apfmc-84, n-moo-86, np-psaig-82, w-ffcmf-77, ZZZ"
, update =	"98.03 bibrelex"
}

@article{bt-odcp-93
, author =	"G. Brightwell and W. T. Trotter"
, title =	"The Order Dimension of Convex Polytopes"
, journal =	"SIAM J. Discrete Math."
, volume =	6
, number =	2
, year =	1993
, pages =	"230--245"
, update =	"95.05 tamassia"
}

@techreport{bt-odpm-92
, author =	"G. Brightwell and W. T. Trotter"
, title =	"The Order Dimension of Planar Maps"
, number =	"LSE--MPS--37"
, institution =	"Dept. of Statistical and Mathematical Sciences, London School of Economics"
, year =	1992
, update =	"95.05 tamassia"
}

@article{bft-bpcpc-95
, author =	"G. R. Brightwell and S. Felsner and W. T. Trotter"
, title =	"Balancing Pairs and the Cross Product Conjecture"
, journal =	"Order"
, volume =	12
, year =	1995
, pages =	"327--349"
, update =	"97.03 gaertner+salinger"
}

@article{bs-rpg-93
, author =	"G. R. Brightwell and E. R. Scheinerman"
, title =	"Representations of Planar Graphs"
, journal =	"SIAM J. Discrete Math."
, volume =	6
, number =	2
, year =	1993
, pages =	"214--229"
, keywords =	"graph drawing, planar, straight-line, disk packing, coin graph"
, update =	"95.05 tamassia"
}

@article{bt-odpm-97
, author =	"Graham R. Brightwell and William T. Trotter"
, title =	"The Order Dimension of Planar Maps"
, journal =	"SIAM J. Discrete Math."
, volume =	10
, number =	4
, year =	1997
, pages =	"515--528"
, update =	"98.07 tamassia+vismara"
}

@inproceedings{bk-igcsd-94
, author =	"T. Brinkhoff and H.-P. Kriegel"
, title =	"The Impact of Global Clusterings on Spatial Database Systems"
, booktitle =	"Proceedings of the International Conference on Very Large Databases"
, publisher =	"Morgan Kauffman"
, month =	sep
, year =	1994
, pages =	"168--179"
, update =	"98.07 agarwal"
}

@inproceedings{bks-epsju-93
, author =	"T. Brinkhoff and H.-P. Kriegel and B. Seeger"
, title =	"Efficient Processing of Spatial Joins Using {R}-Trees"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1993
, pages =	"237--246"
, update =	"97.07 agarwal, 96.09 kreveld"
}

@inproceedings{bgh-cqpst-94
, author =	"A. Brinkman and T. Graf and K. Hinrichs"
, title =	"The colored quadrant priority search tree with an application to the all-nearest-foreign-neighbors problem"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"63--68"
, cites =	"aert-otbsp-92, gh-appcp-93, gs-dfbt-78, hns-arsa2-92, iko-pstsm-88, k-racrn-88, lw-vdllm-80, m-pst-85, o-ncbbs-82, ow-ubtcl-89, ow-ad-93, ps-cgi-85, sh-cpp-75, t-dsna-83, v-oaann-89, clr-ia-90, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{b-pedlp-88
, author =	"M. Brion"
, title =	"Points entires dans les poly{\`e}dres convexes"
, journal =	"Annales Sci. {\'E}c. Norm. Sup., Ser IV"
, volume =	21
, number =	4
, year =	1988
, pages =	"653--663"
, update =	"97.11 bibrelex"
}

@techreport{b-rgsdt-88
, author =	"E. Brisson"
, title =	"Representing geometric structures in $d$ dimensions: Topology and order"
, number =	"88-11-07"
, institution =	"Dept. of Computer Science, Univ. of Washington"
, year =	1988
, update =	"98.03 bibrelex"
}

@inproceedings{b-rgsdd-89
, author =	"E. Brisson"
, title =	"Representing geometric structures in $d$ dimensions: Topology and order"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"218--227"
, cites =	"b-rgsdt-88, dl-pmtds-87, gs-pmgsc-85, lw-tcc-69, m-eat-84, m-tfc-75, ph-chfsp-77, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 95.09 agarwal"
}

@article{b-rgsdd-93
, author =	"E. Brisson"
, title =	"Representing Geometric Structures in $d$ Dimensions: Topology and Order"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"387--426"
, succeeds =	"b-rgsdd-89"
, update =	"95.09 brisson"
}

@techreport{b-edrhu-87
, author =	"D. Broch"
, title =	"Enhancing the dexterity of a robot hand using controlled slip"
, type =	"Technical {Report}"
, number =	"MIT AI-TR-992"
, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1987
, update =	"98.07 bibrelex"
}

@incollection{b-flerg-87
, author =	"J. Brock"
, title =	"Finding the largest empty rectangle on a grated surface"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	247
, year =	1987
, pages =	"66--75"
, keywords =	"isothetic, empty rectangle"
, update =	"95.05 korneenko"
}

@inproceedings{bl-piss-99
, author =	"Christoph Br{\"o}cker and Alejandro L{\'o}pez-Ortiz"
, title =	"Position-Independent Street Searching"
, booktitle =	"Proc. 6th Workshop Algorithms Data Struct."
, nickname =	"WADS '99"
, site =	"Vancouver, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1663
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"241--252"
, update =	"00.03 bibrelex"
}

@inproceedings{bs-srsc-99
, author =	"Christoph Br{\"o}cker and Sven Schuierer"
, title =	"Searching Rectilinear Streets Completely"
, booktitle =	"Proc. 6th Workshop Algorithms Data Struct."
, nickname =	"WADS '99"
, site =	"Vancouver, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1663
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"98--109"
, update =	"00.03 bibrelex"
}

@incollection{bj-dpcho-00
, author =	"Gerth St{\o}lting Brodal and Riko Jacob"
, title =	"Dynamic Planar Convex Hull with Optimal Query Time and $O(\log n\cdot\log\log n)$ Update Time"
, booktitle =	"Proc. 7th Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	1851
, publisher =	"Springer-Verlag"
, year =	2000
, pages =	"57--70"
, update =	"01.07 orourke"
}

@article{bdfru-wcrtr-95
, author =	"A. Z. Broder and M. E. Dyer and A. M. Frieze and P. Raghavan and E. Upfal"
, title =	"The worst-case running time of the random simplex algorithm is exponential in the height"
, journal =	"Inform. Proc. Letters"
, volume =	56
, number =	2
, year =	1995
, pages =	"79--81"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{bpg-cfpa-93
, author =	"M. Brokowski and M. A. Peskin and K. Goldberg"
, title =	"Curved fences for part alignment"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Atlanta, GA"
, volume =	3
, year =	1993
, pages =	"467--473"
, update =	"98.07 bibrelex"
}

@article{bk-facus-73
, author =	"C. Bron and J. Kerbosch"
, title =	"Finding all cliques of an undirected subgraph"
, journal =	"Commun. ACM"
, volume =	16
, year =	1973
, pages =	"575--577"
, update =	"98.07 bibrelex"
}

@proceedings{b-ewcg-99
, title =	"Abstracts 15th European Workshop Comput. Geom."
, editor =	"Herv{\'e} Br{\"o}nnimann"
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, isbn =	"2-7261-1139-4"
, update =	"00.03 bibrelex"
}

@inproceedings{b-aops-94
, author =	"Herv{\'e} Br{\"o}nnimann"
, title =	"Almost Optimal Polyhedral Separators"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"393--394"
, keywords =	"video review"
, cites =	"bg-aoscf-94, d-ascg-90, dt-gascg-94, ms-saps-92, ZZZ"
, update =	"99.07 devillers, 98.03 bibrelex, 94.09 jones"
}

@techreport{b-imhsh-94
, author =	"Herv{\'e} Br{\"o}nnimann"
, title =	"An implementation of {MIN} {HITTING} {SET} heuristics"
, type =	"Manuscript"
, institution =	"??"
, year =	1994
, update =	"99.07 devillers, 98.03 bibrelex"
}

@inproceedings{b-dchol-98
, author =	"Herv{\'e} Br{\"o}nnimann"
, title =	"Degenerate convex hulls on-line in any fixed dimension"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"249--258"
, update =	"99.07 devillers, 98.11 devillers"
}

@phdthesis{b-dga-95
, author =	"Herv{\'e} Br{\"o}nnimann"
, title =	"Derandomization of Geometric Algorithms"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Princeton University"
, address =	"Princeton, NJ"
, month =	may
, year =	1995
, keywords =	"doctoral thesis"
, update =	"99.07 devillers, 96.09 devillers"
}

@inproceedings{bbp-iayea-98cg
, author =	"Herv{\'e} Br{\"o}nnimann and Christoph Burnikel and Sylvain Pion"
, title =	"Interval Arithmetic Yields Efficient Arithmetic Filters for Computational Geometry"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"49--54"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{bbp-iayed-98scg
, author =	"Herv{\'e} Br{\"o}nnimann and Christoph Burnikel and Sylvain Pion"
, title =	"Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"165--174"
, update =	"99.07 devillers, 98.07 tamassia"
}

@inproceedings{bc-hhihr-92
, author =	"Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
, title =	"How hard is halfspace range searching?"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"271--275"
, cites =	"as-anps-91, bfk-ictor-81, c-lbcpr-89, c-lbors1-90, c-lbors2-90, cr-ccpso-91, cr-lbcsr-92, csw-qoubs-90, cw-qorss-89, cs-arscg-89, cy-grp-84, ew-hrsls-86, elr-dlsrd-70, f-lbcor-81, f-lbcso-81, hw-ensrq-87, m-tnhl-52, m-rph-91, m-rsehc-91, m-dsa-84, s-iggp-76, w-pr-82, y-cmps-85, y-3spia-83, yy-gaddg-85, ZZZ"
, update =	"99.07 devillers, 98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{bc-ossc-94
, author =	"Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
, title =	"Optimal Slope Selection Via Cuttings"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"99--103"
, precedes =	"bc-ossc-98"
, cites =	"aks-scps-83, bcm-prsss-93, c-chdc-93 , cegs-dwclp-92, cm-ltdao-93, csss-otass-89, dmn-rass-92, ks-osse-93, m-aogdc-91, m-roass-91, m-apcad-83, ZZZ"
, update =	"99.07 devillers, 98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 94.09 jones"
}

@article{bc-ossc-98
, author =	"Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
, title =	"Optimal Slope Selection Via Cuttings"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, number =	1
, year =	1998
, pages =	"23--29"
, succeeds =	"bc-ossc-94"
, update =	"99.07 devillers, 98.07 bibrelex+mitchell+smid, 98.03 mitchell"
}

@inproceedings{bcm-prsss-93
, author =	"Herv{\'e} Br{\"o}nnimann and Bernard Chazelle and Ji{\v r}{\'\i} Matou{\v s}ek"
, title =	"Product Range Spaces, Sensitive Sampling, and Derandomization"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1993
, pages =	"400--409"
, keywords =	"approximations, epsilon-nets, derandomization, diameter computation, method of conditional probabilities, parametric search"
, update =	"96.09 agarwal, 96.05 agarwal, 94.01 smid, 93.09 matousek+milone+mitchell"
}

@article{bcm-prsss-99
, author =	"H. Br{\"o}nnimann and B. Chazelle and J. Matou{\v s}ek"
, title =	"Product Range Spaces, Sensitive Sampling, and Derandomization"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1999
, pages =	"1552--1575"
, update =	"00.03 smid"
}

@article{bcp-hhihr-93
, author =	"H. Br{\"o}nnimann and Bernard Chazelle and J. Pach"
, title =	"How hard is halfspace range searching"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"143--155"
, succeeds =	"bc-hhihr-92"
, update =	"98.03 mitchell, 97.11 bibrelex, 94.01 matousek"
}

@techreport{bd-uubhq-99
, author =	"Herv{\'e} Br{\"o}nnimann and Olivier Devillers"
, title =	"The union of unit balls has quadratic complexity, even if they all contain the origin"
, type =	"Rapport de recherche"
, number =	3758
, institution =	"INRIA"
, year =	1999
, url =	"http://www.inria.fr/RRRT/RR-3758"
, archive =	"XXX:cs.CG/9907025"
, cites =	"h-bevv-56, bcddy-acchs-96"
, update =	"99.11 devillers"
, abstract =	"We provide a lower bound construction showing that the union of unit balls in $R^3$ has quadratic complexity, even if they all contain the origin. This settles a conjecture of Sharir."
}

@inproceedings{beh-eeeafcs-05
, author =      "Berberich, Eric and Eigenwillig, Arno and Hemmer, Michael and Hert, Susan and Kettner, Lutz and Mehlhorn, Kurt and Reichel, Joachim and Schmitt, Susanne and Sch{\"o}mer, Elmar and Wolpert, Nicola"
, editor =      "Brodal, Gerth S. and Leonardi, Stefano"
, title =       "EXACUS: Efficient and exact algorithms for curves and surfaces"
, booktitle =   "13th Annual European Symposium on Algorithms (ESA 2005)"
, publisher =   "Springer"
, year =        "2005"
, organization = "European Association for Theoretical Computer Science (EATCS)"
, volume =       "3669"
, pages =        "155--166"
, series =       "Lecture Notes in Computer Science"
, address =      "Palma de Mallorca, Spain"
, month =        "October"
, isbn =         "3-540-29118-0"
}

@inproceedings{bepp-cegpu-97
, author =	"Herv{\'e} Br{\"o}nnimann and Ioannis Emiris and Victor Pan and Sylvain Pion"
, title =	"Computing exact geometric predicates using modular arithmetic with single precision"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"174--182"
, precedes =	"bepp-sdrns-99"
, cites =	"ahu-daca-74, abdpy-enmcs-95, bp-fa-94, by-eeesd-97i, bcl-casac-82, bkmnsu-egcl-95, c-sede-92, clr-ia-90, em-sstcd-90, e-cicgd-98, ec-gard-95, f-nsa2d-92, fv-eeacg-93, fv-sayee-96, gkz-drmd-94, gl-mc-83, h-pargc-88, h-hsism-96, hhk-rsops-89, hp-asdmr-94, kkm-ebrgl-96, k-sa-81, l-chi-82, lmc-ecdde-94, pys-antcm-97, p-pcpgs-96, r-cpagt-95, s-rafpg-96, si-rtoia-94, wrg-csdsp-92, y-tegc-97, y-ecgtm-95, yd-ecp-95, ZZZ"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.11 icking, 97.07 efrat"
}

@article{bepp-sdrns-99
, author =	"Herv{\'e} Br{\"o}nnimann and Ioannis Emiris and Victor Pan and Sylvain Pion"
, title =	"Sign Determination in {R}esidue {N}umber {S}ystems"
, journal =	"Theoret. Comput. Sci."
, volume =	210
, number =	1
, year =	1999
, pages =	"173--197"
, note =	"Special Issue on Real Numbers and Computers"
, url =	"https://hal.inria.fr/inria-00344324"
, succeeds =	"bepp-cegpu-97"
, update =	"99.07 devillers"
}

@inproceedings{bg-aoscf-94
, author =	"H. Br{\"o}nnimann and M. T. Goodrich"
, title =	"Almost Optimal Set Covers in Finite {VC}-Dimension"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"293--302"
, cites =	"ammrs-dtgm-93, a-ded-83, b-luhs-90, bglr-epcpa-93, brs-enasc-89, br-t3nnn-88, behw-clgcv-89, b-imhsh-94, bcm-prsss-93, c-ochan-91, c-chdc-93, ceggs-ibwen-93, cf-dvrsi-90, cm-ltdao-93, cw-qorss-89, c-ghscp-79, c-lvalp-88, cs-arscg-89, c-apca-93, clr-ia-90, d-ascg-90, gj-cigtn-79, g-gpmee-93, hw-ensrq-87, h-aascv-82, hm-ascpp-85, j-aacp-74, k-racpc-72, kpw-atben-92, l-lqwia-87, l-roifc-75, ly-hamp-93, m-cen-90, m-aogdc-91, m-cha-91, m-rsehc-92, m-rph-92, msw-hnlls-90, mww-deabv-91, m-ept-92, ms-saps-92, s-dfs-72, vc-ucrfe-71, w-pttco-88, ZZZ"
, update =	"98.03 bibrelex, 96.09 agarwal, 94.09 jones, 94.01 jones"
}

@article{bg-aoscf-95
, author =	"H. Br{\"o}nnimann and M. T. Goodrich"
, title =	"Almost Optimal Set Covers in Finite {VC}-Dimension"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"263--279"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@misc{bikmm-oipcha-01
, author =	"Herv{\'e} Br{\"o}nnimann and John Iacono and Jryki Katajainen and Pat Morin and Jason Morrison"
, title =	"Optimal In-Place Planar Convex Hull Algorithms"
, howpublished =	"11th Annual Fall Workshop on Computational Geometry"
, year =	2001
, note =	"\url{http://geometry.poly.edu/cgwpapers/}"
, url =	"http://geometry.poly.edu/cgwpapers/hbr\_inplace.ps"
, update =	"02.03 orourke"
}

@inproceedings{bp-ergc-97
, author =	"Herv{\'e} Br{\"o}nnimann and Sylvain Pion"
, title =	"Exact rounding for geometric constructions"
, booktitle =	"GAMM/IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics"
, year =	1997
, pages =	""
, url =	"http://www-sop.inria.fr/prisme/publis/bp-ergc-97.ps.gz"
, update =	"99.11 bibrelex, 99.07 devillers, 98.11 devillers"
}

@techreport{by-cacas-96
, author =	"Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
, title =	"A complete analysis of {Clarkson}'s algorithm for safe determinant evaluation"
, type =	"Research {Report}"
, number =	3051
, institution =	"INRIA"
, year =	1996
, url =	"http://www.inria.fr/rapports/sophia/RR-3051.html"
, update =	"99.11 devillers, 99.07 devillers, 97.07 devillers"
, abstract =	"In this paper, we give a complete and self-contained
analysis of Clarkson's algorithm that performs safe and efficient
determinant evaluation of an $n\times n$ matrix with integer
coefficients that can be expressed with $b$ bits. Clarkson's original
paper is generally felt difficult to read. We complete the gaps in his
exposition, simplifying the analysis where we can. The number of extra
bits needed by this analysis is roughly equivalent to the number of bits
needed by Clarkson's analysis. We show that the algorithm performs sign
evaluation correctly if $b+O(n)$ bits are available. We give a table of
the maximum numbers $b$ of bits available for the entries as a function
of $n$, when the arithmetic is performed using a floating point
processor complying with the IEEE 754 standard for double precision
arithmetic (with $53$ bits available for the mantissa). We also gain
some insight into the practical behavior of the algorithm by
experimenting. In particular, we provide experimental evidence that the
algorithm evaluates correctly the sign of determinants of order up to 15
with $48$-bit coefficients."
}

@inproceedings{by-eeesd-97i
, author =	"Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
, title =	"Efficient exact evaluation of signs of determinants"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"166--173"
, precedes =	"by-eeesd-00"
, cites =	"abdpy-esdus-94, abdpy-enmcs-95, bkmnsu-egcl-95, c-accgc-96, c-sede-92, dp-papaf-96, fm-cslas-67, f-nsa2d-92, fv-eeacg-93, hhk-tirgc-88, h-gsm-89, kln-edtur-91, lm-cschu-90, m-dpggt-89, s-rafpg-96, si-smsft-89, si-rtoia-94, y-tegc-93, yd-ecp-95, ZZZ"
, update =	"00.03 devillers, 99.07 devillers, 98.07 bibrelex, 97.11 icking, 97.07 efrat"
}

@article{by-eeesd-00
, author =	"Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
, title =	"Efficient Exact Evaluation of Signs of Determinants"
, journal =	"Algorithmica"
, volume =	27
, year =	2000
, pages =	"21--56"
, keywords =	"determinant, robustness, Clarkson, safe, lattice, exact arithmetic, precision"
, succeeds =	"by-eeesd-97i"
, cites =	"abdpy-esdus-94, abdpy-enmcs-95, bkmnsu-egcl-95, c-accgc-96, c-sede-92, dp-papaf-96, fm-cslas-67, f-nsa2d-92, fv-eeacg-93, hhk-tirgc-88, h-gsm-89, kln-edtur-91, lm-cschu-90, m-dpggt-89, s-rafpg-96, si-smsft-89, si-rtoia-94, y-tegc-93, yd-ecp-95, ZZZ"
, update =	"00.03 devillers"
}

@techreport{by-eeesd-97t
, author =	"Herv{\'e}. Br{\"o}nnimann and Mariette Yvinec"
, title =	"Efficient Exact Evaluation of Signs of Determinants"
, type =	"Research {Report}"
, number =	3140
, institution =	"INRIA"
, year =	1997
, url =	"http://www.inria.fr/rapports/sophia/RR-3140.html"
, update =	"99.07 devillers, 97.07 devillers"
, abstract =	"This paper presents a theoretical and experimental study
on two different methods to evaluate the sign of a determinant with
integer entries. The first one is a method based on the Gram-Schmidt
orthogonalisation process which has been proposed by Clarkson. We review
the analysis of Clarkson and propose a variant of his method. The second
method is an extension to $n \times n$ determinants of the ABDPY method
which works only for $2 \times 2$ and $3 \times 3$ determinants. Both
methods compute the signs of a $n \times n$ determinant whose entries
are integers on $b$ bits, by using an exact arithmetic on only $b +O(n)$
bits. Furthermore, both methods are adaptive, dealing quickly with easy
cases and resorting to the full-length computation only for null
determinants."
}

@book{b-icp-83
, author =	"A. Br{\"o}nsted"
, title =	"An Introduction to Convex Polytopes"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1983
}

@book{bsmm-tdm-93
, author =	"I. N. Bronstein and K. A. Semendjajew and G. Musiol and H. M{\"u}hlig"
, title =	"Taschenbuch der Mathematik"
, publisher =	"Harri Deutsch"
, address =	"Frankfurt am Main"
, year =	1993
, update =	"00.03 bibrelex"
}

@inproceedings{bl-sacsf-83
, author =	"R. Brooks and T. Lozano-P{\'e}rez"
, title =	"A subdivision algorithm in configuration space for findpath with rotation"
, booktitle =	"Proc. 8th Internat. Joint Conf. Artif. Intell."
, site =	"Karlsruhe, West Germany"
, month =	aug
, year =	1983
, update =	"98.03 bibrelex"
}

@techreport{b-fppcr-82
, author =	"R. A. Brooks"
, title =	"Find-path for a {PUMA}-class robot"
, type =	"Manuscript"
, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1982
}

@article{b-pcfmp-83
, author =	"R. A. Brooks"
, title =	"Planning Collision-Free Motions for Pick-and-Place Operations"
, journal =	"Internat. J. Robot. Res."
, volume =	4
, year =	1983
, pages =	"19--44"
, update =	"93.09 milone+mitchell"
}

@article{b-sfppg-83
, author =	"R. A. Brooks"
, title =	"Solving the Find-Path Problem by Good Representation of Free Space"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	13
, number =	3
, year =	1983
, pages =	"190--197"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@techreport{bl-sacsf-82
, author =	"R. A. Brooks and T. Lozano-P{\'e}rez"
, title =	"A subdivision algorithm in configuration space for findpath with rotation"
, type =	"Report"
, number =	684
, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1982
, precedes =	"bl-sacsf-85"
, update =	"95.05 korneenko"
}

@article{bl-sacsf-85
, author =	"R. A. Brooks and T. Lozano-P{\'e}rez"
, title =	"A subdivision algorithm in configuration space for findpath with rotation"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	15
, number =	2
, year =	1985
, pages =	"224--233"
, keywords =	"motion planning"
, succeeds =	"bl-sacsf-82"
, update =	"95.05 korneenko"
}

@phdthesis{b-appmt-91
, author =	"R. Brost"
, title =	"Analysis and planning of planar manipulation tasks"
, school =	"Carnegie Mellon University"
, year =	1991
, note =	"Report CMU-CS-91-149"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@inproceedings{b-agppu-86
, author =	"R. Brost"
, title =	"Automatic grasp planning in the presence of uncertainty"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"San Francisco, CA"
, month =	apr
, year =	1986
, update =	"98.03 bibrelex"
}

@inproceedings{bg-casmf-94
, author =	"R. C. Brost and K. Y. Goldberg"
, title =	"A complete algorithm for synthesizing modular fixtures for polygonal parts"
, booktitle =	"Proc. 11th IEEE Internat. Conf. Robot. Autom."
, month =	may
, year =	1994
, update =	"98.03 bibrelex"
}

@inproceedings{bm-gaprb-89
, author =	"R. C. Brost and M. T. Mason"
, title =	"Graphical Analysis of Planar Rigid Body Dynamics with Multiple Frictional Contacts"
, booktitle =	"Proc. 5th Intl. Symp. on Robotics Research"
, year =	1989
, pages =	"367--374"
, update =	"97.11 bibrelex"
}

@article{bdf-cvp-78
, author =	"W. Brostow and J. P. Dussault and B. L. Fox"
, title =	"Construction of {Voronoi} polyhedra"
, journal =	"J. Comput. Phys."
, volume =	29
, year =	1978
, pages =	"81--92"
}

@article{b-fodm-84
, author =	"P. Brou"
, title =	"Finding Objects in Depth Maps"
, journal =	"Internat. J. Robot. Res."
, volume =	"??"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{b-mp-66
, author =	"U. A. Brousseau"
, title =	"A mathematician's progress"
, journal =	"Math. Teacher"
, volume =	59
, year =	1966
, pages =	"722--727"
, update =	"98.03 agarwal"
}

@book{bcn-drg-89
, author =	"A. E. Brouwer and A. M. Cohen and A. Neumaier"
, title =	"Distance-regular graphs"
, publisher =	"Springer-Verlag"
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{bv-p2p-79
, author =	"C. M. Brown and H. B. Voelcker"
, title =	"The {PADL}-2 project"
, booktitle =	"Proc. 7th NSF Grantees' Conf. Product. Res. Tech."
, site =	"Ithaca, NY"
, year =	1979
, pages =	"??"
}

@article{b-pdsa-65
, author =	"G. S. Brown"
, title =	"Point density in stems per acre"
, journal =	"New Zealand Forestry Service Research Notes"
, volume =	38
, year =	1965
, pages =	"1--11"
, update =	"97.03 schwarzkopf"
}

@article{b-scaps-97
, author =	"J. L. Brown"
, title =	"Systems of coordinates associated with points scattered in the plane"
, journal =	"Comput. Aided Design"
, volume =	14
, year =	1997
, pages =	"547--559"
, update =	"01.07 devillers"
}

@article{b-vbddt-91
, author =	"J. L. Brown"
, title =	"Vertex Based Data Dependent Triangulations"
, journal =	"Comput. Aided Geom. Design"
, volume =	8
, year =	1991
, pages =	"239--251"
, annote =	"Cost of triangulation is sum of costs of nodes (node
		 cost depends on the triangulation). Local optimizations
		 to improve the cost. Reports good results using square
		 of sums of angles between each adjacent facet and
		 average normal at vertex."
}

@article{b-carcg-81
, author =	"K. Q. Brown"
, title =	"Comments on ``{Algorithms} for reporting and counting geometric intersections''"
, journal =	"IEEE Trans. Comput."
, volume =	"C-30"
, year =	1981
, pages =	"147--148"
, succeeds =	"bo-arcgi-79"
}

@techreport{b-fihs-78
, author =	"K. Q. Brown"
, title =	"Fast intersection of half spaces"
, type =	"Report"
, number =	"CMU-CS-78-129"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1978
}

@phdthesis{b-gtfga-80
, author =	"K. Q. Brown"
, title =	"Geometric transforms for fast geometric algorithms"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1980
, note =	"Report CMU-CS-80-101"
, keywords =	"doctoral thesis, geometric transformations"
, comments =	"UMI DA80-12772, 154 pp."
, update =	"93.09 jones, 93.05 jones"
}

@article{b-vdch-79
, author =	"K. Q. Brown"
, title =	"Voronoi diagrams from convex hulls"
, journal =	"Inform. Process. Lett."
, volume =	9
, number =	5
, year =	1979
, pages =	"223--228"
, update =	"98.11 bibrelex"
}

@article{b-lfitm-62
, author =	"M. Brown"
, title =	"Locally flat imbeddings of topological manifolds"
, journal =	"Ann. Math."
, volume =	75
, year =	1962
, pages =	"331--341"
, update =	"97.11 bibrelex"
}

@book{b-aa-87
, author =	"M. H. Brown"
, title =	"Algorithm Animation"
, series =	"ACM Distinguished Dissertations Series"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1987
, update =	"98.03 bibrelex"
}

@article{b-eaub-88
, author =	"M. H. Brown"
, title =	"Exploring algorithms using Balsa-{II}"
, journal =	"Computer"
, volume =	21
, number =	5
, month =	may
, year =	1988
, pages =	"14--36"
, update =	"98.11 bibrelex"
}

@inproceedings{b-1saf-93
, author =	"M. H. Brown"
, title =	"The $1992$ {SRC} animation festival"
, booktitle =	"Proc. IEEE Sympos. on Visual Languages"
, month =	aug
, year =	1993
, pages =	"116--123"
, update =	"98.03 bibrelex"
}

@techreport{b-zsaam-92
, author =	"M. H. Brown"
, title =	"Zeus: {A} system for algorithm animation and multi-view editing"
, type =	"Technical {Report}"
, number =	75
, institution =	"Digital Systems Research Center"
, address =	"Palo Alto, CA"
, month =	feb
, year =	1992
, update =	"98.03 bibrelex"
}

@article{b-zsaam-92a
, author =	"M. H. Brown"
, title =	"Zeus: {A} system for algorithm animation and multi-view editing"
, journal =	"Comput. Graph."
, volume =	18
, number =	3
, year =	1992
, pages =	"177--186"
, update =	"98.07 bibrelex"
}

@inproceedings{b-zsaa-91
, author =	"M. H. Brown"
, title =	"Zeus: {A} system for algorithms animation"
, booktitle =	"Proc. IEEE Workshop on Visual Languages"
, year =	1991
, update =	"98.03 bibrelex"
}

@article{bh-csaa-92
, author =	"M. H. Brown and J. Hershberger"
, title =	"Color and sound in algorithms animation"
, journal =	"IEEE Comput."
, volume =	25
, number =	12
, year =	1992
, pages =	"52--63"
, update =	"98.03 bibrelex"
}

@inproceedings{bn-cat-96
, author =	"M. H. Brown and M. A. Najork"
, title =	"Collaborative Active Textbooks"
, booktitle =	"IEEE Symp. on Visual Languages"
, year =	1996
, update =	"98.07 tamassia"
}

@techreport{bn-catwb-96
, author =	"M. H. Brown and M. A. Najork"
, title =	"Collaborative active textbooks: {A} web-based algorithm animation system for an electronic classroom"
, type =	"Research {Report}"
, number =	142
, institution =	"SRC"
, month =	may
, year =	1996
, update =	"98.07 bibrelex"
}

@article{bs-taa-85
, author =	"M. H. Brown and R. Sedgewick"
, title =	"Techniques for algorithm animation"
, journal =	"IEEE Softw."
, volume =	2
, number =	1
, month =	jan
, year =	1985
, pages =	"28--39"
, update =	"98.07 bibrelex"
}

@article{bt-dadsr-80
, author =	"M. R. Brown and R. E. Tarjan"
, title =	"Design and analysis of a data structure for representing sorted lists"
, journal =	"SIAM J. Comput."
, volume =	9
, year =	1980
, pages =	"594--614"
, update =	"97.11 bibrelex"
}

@inproceedings{bg-ooldg-92
, author =	"P. Brown and T. Gargiulo"
, title =	"An Object Oriented Layout for Directed Graphs"
, booktitle =	"Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
, month =	may
, year =	1992
, pages =	"??"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{b-bdn-87
, author =	"D. Brownawell"
, title =	"Bounds for the degrees in the {Nullstellensatz}"
, journal =	"Annals of Math. Second Series"
, volume =	126
, number =	3
, year =	1987
, pages =	"577--591"
, update =	"98.03 bibrelex"
}

@article{b-lpsl-86
, author =	"D. R. K. Brownrigg"
, title =	"Lattice partitions with a straight line"
, journal =	"Canad. Math. Bull."
, volume =	29
, year =	1986
, pages =	"287--294"
, keywords =	"discrete geometry"
, update =	"95.05 korneenko"
}

@techreport{bdmpw-gas-87
, author =	"A. Browyer and J. Davenport and P. Milne and J. Padget and A. Wallis"
, title =	"A geometric algebra system"
, type =	"Draft"
, institution =	"Schools of Mechanical Engineering and Mathematical Sciences, Univ. Bath"
, address =	"Bath, UK"
, year =	1987
, update =	"98.03 bibrelex"
}

@book{bg-cs2e-92
, author =	"J. W. Bruce and P. J. Giblin"
, title =	"Curves and Singularities (2nd edition)"
, publisher =	"Cambridge University Press"
, address =	"New York"
, year =	1992
, update =	"98.03 agarwal"
}

@article{b-asppg-87
, author =	"M. W. Brucker"
, title =	"Approximation of a set of points by points of a grid"
, journal =	"Computer"
, volume =	38
, number =	4
, year =	1987
, pages =	"341--345"
, keywords =	"discrete geometry, approximation, fitting"
, update =	"95.05 korneenko"
}

@incollection{b-ccp-77
, author =	"P. Brucker"
, title =	"On the Complexity of Clustering Problems"
, editor =	"R. Henn and B. Korte and W. Oletti"
, booktitle =	"Optimizing and Operations Research"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1977
, update =	"98.03 bibrelex"
}

@article{bm-stip-88
, author =	"P. Brucker and W. Meyer"
, title =	"Scheduling two irregular polygons"
, journal =	"Discrete Appl. Math."
, volume =	20
, number =	2
, year =	1988
, pages =	"91--100"
, keywords =	"polygon, proximity, optimization"
, update =	"95.05 korneenko"
}

@techreport{boo-dspir-91
, author =	"A. Bruckstein and L. O'Gorman and A. Orlitsky"
, title =	"Design of shapes for precise image registration"
, type =	"Technical Report"
, institution =	"AT\&T"
, year =	1991
, update =	"98.11 bibrelex"
}

@article{bn-dipcr-95
, author =	"A. M. Bruckstein and A. N. Netravali"
, title =	"On differential invariants of planar curves and recognizing partially occluded planar shapes"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"227--250"
, keywords =	"matching, shape recognition, vision"
, update =	"98.07 bibrelex, 95.09 mitchell"
}

@inproceedings{b-agpc-88
, author =	"B. Br{\"u}derlin"
, title =	"Automatizing geometric proofs and constructions"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"232--252"
, update =	"00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@inproceedings{b-rcga-90
, author =	"Beat Br{\"u}derlin"
, title =	"Robustness of Computational Geometry Algorithms"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	9
, update =	"00.03 bibrelex"
}

@inproceedings{b-afvab-91
, author =	"B. Bruenning"
, title =	"Air Force Vulnerability Analyses from {BRL-CAD} models"
, booktitle =	"Proc. BRL-CAD Symposium `91"
, publisher =	"American Defense Preparadness Assoc."
, address =	"Aberdeen Proving Ground, MD"
, year =	1991
, pages =	"1--13"
, update =	"95.05 agarwal"
}

@misc{bw-dtnt-87
, author =	"A. Bruggemann-Klein and D. Wood"
, title =	"Drawing Trees Nicely with {TEX}"
, institution =	"Department of Computer Science, University of Waterloo"
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{bm-sdcs-71
, author =	"H. Bruggesser and P. Mani"
, title =	"Shellable decompositions of cells and spheres"
, journal =	"Math. Scand."
, volume =	29
, year =	1971
, pages =	"197--205"
}

@article{b-ttt-84
, author =	"G. Br{\"u}gner"
, title =	"Three-triangle-tangram"
, journal =	"BIT"
, volume =	24
, year =	1984
, pages =	"380--382"
}

@book{b-navw-54
, author =	"N. G. de Bruijn"
, title =	"Nieuw Archief voor Wiskunde"
, volume =	2
, publisher =	"??"
, year =	1954
, update =	"98.03 bibrelex"
}

@incollection{b-p11a-55
, author =	"N. G. de Bruijn"
, title =	"Problems 17 and 18. Answers"
, booktitle =	"Opgaven met de oplossingen"
, volume =	20
, publisher =	"??"
, year =	1955
, pages =	"19--20"
, update =	"98.03 bibrelex"
}

@article{be-cp-48
, author =	"N. G. de Bruin and P. Erd{\H o}s"
, title =	"On a combinatorial problem"
, journal =	"Proc. Konink. Nederl. Akad. Wetensch. Ser. A"
, volume =	51
, year =	1948
, pages =	"1277--1279"
, note =	"Indagationes Math. 10, 421-423"
, update =	"98.03 bibrelex"
}

@inproceedings{b-sspds-91
, author =	"A. M. Brukstein"
, title =	"Self-similarity properties of digitized straight lines"
, booktitle =	"Vision Geom.: Proc. AMS Spec. Sess. Hoboken, NJ 1989"
, publisher =	"AMS Press"
, year =	1991
, pages =	"1--20"
, keywords =	"digital geometry"
, update =	"95.05 korneenko"
}

@article{bn-srueo-90
, author =	"P. Brunet and I. Navazo"
, title =	"Solid representations using extended octrees"
, journal =	"ACM Trans. Graph."
, volume =	9
, year =	1990
, pages =	"170--197"
}

@article{bmfn-psbzi-
, author =	"A. Br{\"u}ngger and A. Marzetta and K. Fukuda and J. Nievergelt"
, title =	"The parallel search bench {ZRAM} and its applications"
, journal =	"Ann. Oper. Res."
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@article{bjy-sonop-91
, author =	"D. Bruschi and D. Joseph and P. Young"
, title =	"A structural overview of {NP} optimization problems"
, journal =	"Algorithms Rev."
, volume =	2
, number =	1
, year =	1991
, pages =	"1--26"
}

@inproceedings{bf-fi3dg-96
, author =	"I. Bru{\ss} and A. Frick"
, title =	"Fast Interactive {3-D} Graph Visualization"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"99--110"
, keywords =	"graph drawing, 3D, straight-line"
, update =	"97.03 tamassia, 96.09 tamassia, 96.04 garg"
}

@article{bd-tdsbt-90
, author =	"Elisabetta Bruzzone and Leila {De Floriani}"
, title =	"Two data structures for building tetrahedralizations"
, journal =	"Visual Comput."
, volume =	6
, number =	5
, month =	nov
, year =	1990
, pages =	"266--283"
, keywords =	"solid modeling, decomposition models, tetrahedralization, Delaunay triangulation, data structures"
}

@inproceedings{bdp-mtdt-89
, author =	"Elisabetta Bruzzone and Leila {De Floriani} and Enrico Puppo"
, title =	"Manipulating Three-Dimensional Triangulations"
, editor =	"W. Litwin and H. Scheck"
, booktitle =	"Foundations of Data Organization and Algorithms: 3rd International Conference, FODO 1989"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1989
, update =	"96.09 agarwal"
, annote =	"Describes data structure for representing 3D
		 triangulations. Relationships VE, EV, EF, FE, FT, TF
		 are explicitly represented and the others can be
		 deduced from these in time proportional to the size of
		 the output."
}

@article{bs-ftmsb-85
, author =	"R. Bryant and D. Singerman"
, title =	"Foundations of the theory of maps on surfaces with boundaries"
, journal =	"Quart. J. Math. Oxford"
, volume =	2
, number =	36
, year =	1985
, pages =	"17--41"
, update =	"98.07 bibrelex"
}

@article{b-slrpg-89
, author =	"V. W. Bryant"
, title =	"Straight line representations of planar graphs"
, journal =	"Elem. Math."
, volume =	44
, number =	3
, year =	1989
, pages =	"64--66"
, keywords =	"geometric graphs"
, update =	"95.05 korneenko"
}

@article{bz-trdpo-93
, author =	"T. H. Brylawski and G. M. Ziegler"
, title =	"Topological representation of dual pairs of oriented matroids"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"237--240"
, update =	"96.05 pocchiola"
}

@article{b-omt-74
, author =	"O. Bryngdahl"
, title =	"Optical map transformations"
, journal =	"Optics Commun."
, volume =	10
, number =	2
, year =	1974
, pages =	"164--168"
, update =	"97.11 bibrelex"
}

@article{b-gto-74
, author =	"O. Brynghdahl"
, title =	"Geometrical transformations in optics"
, journal =	"J. Optical Soc. Amer."
, volume =	64
, number =	8
, year =	1974
, pages =	"1092--1099"
, update =	"97.11 bibrelex"
}

@inproceedings{bgmst-ntdfl-96
, author =	"Nader Bshouty and Sally A. Goldman and H. David Mathias and Subhash Suri and Hisao Tamaki"
, title =	"Noise-Tolerant Distribution-Free Learning of General Geometric Concepts"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '96"
, site =	"Philadelphia, PA"
, month =	may
, year =	1996
, pages =	"151--160"
, update =	"00.03 smid, 98.07 bibrelex, 98.03 mitchell"
}

@incollection{b-lbact-91
, author =	"N. H. Bshouty"
, title =	"Lower bounds for algebraic computation trees of functions with finite domains"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	497
, year =	1991
, pages =	"55--65"
, keywords =	"lower bounds"
, update =	"95.05 korneenko"
}

@inproceedings{b-amnlc-88
, author =	"B. Buchberger"
, title =	"Algebraic methods for non-linear computational geometry"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"81--82"
, cites =	"ab-arag-88, acm-cad1b-84, b-eakfd-70, b-gbamp-85, b-agbnc-88, bck-amgr-88, c-qercf-75, e-acg-87, ps-cgi-85, r-da-50, w-bpmtp-84, ZZZ"
, update =	"98.03 bibrelex"
}

@incollection{b-agbnc-88
, author =	"B. Buchberger"
, title =	"Applications of {Gr\"obner} bases in nonlinear computational geometry"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	296
, year =	1988
, pages =	"52--80"
, keywords =	"algebraic geometry, motion planning"
, update =	"95.05 korneenko"
}

@article{b-aklag-70
, author =	"Bruno Buchberger"
, title =	"Ein algorithmisches {Kriterium} f{\"u}r die {L{\"o}sbarkeit} eines algebraischen {Gleichungssystems}"
, journal =	"Aequationes Mathematicae"
, volume =	4
, number =	3
, year =	1970
, pages =	"374--383"
, update =	"00.03 bibrelex"
}

@article{b-eakfd-70
, author =	"B. Buchberger"
, title =	"Ein algorithmisches {Kriterium} f{\"u}r die {L{\"o}sbarkeit} eines algebraischen {Gleichungssystems}"
, journal =	"Aequationes Math."
, volume =	4
, number =	3
, year =	1970
, pages =	"374--383"
, update =	"98.03 bibrelex"
}

@incollection{b-gbamp-85
, author =	"B. Buchberger"
, title =	"{Gr{\"o}bner} Bases: {An} Algorithmic Method in Polynomial Ideal Theory"
, chapter =	6
, editor =	"N. Bose"
, booktitle =	"Multidimensional Systems Theory"
, publisher =	"Reidel Publishing"
, year =	1985
, update =	"01.07 devillers, 97.11 bibrelex"
}

@article{b-hbfcp-87
, author =	"B. Buchberger"
, title =	"History and basic features of the critical-pair/completion procedure"
, journal =	"J. Symbolic Comput."
, volume =	3
, year =	1987
, pages =	"3--38"
, update =	"98.03 bibrelex"
}

@incollection{b-wcgbd-89
, author =	"B. Buchberger"
, title =	"What can {Gr{\"o}bner} bases do for computational geometry and robotics?"
, editor =	"D. Kapur and J. L. Mundy"
, booktitle =	"Geometric Reasoning"
, publisher =	"MIT Press"
, year =	1989
, pages =	"415--447"
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@book{bcl-casac-82
, title =	"Computer Algebra: Symbolic and Algebraic Computation"
, editor =	"B. Buchberger and G. Collins and R. Loos"
, series =	"Computing Supplementum"
, volume =	4
, edition =	"1st"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1982
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{bck-amgr-88
, author =	"B. Buchberger and G. E. Collins and B. Kutzler"
, title =	"Algebraic methods for geometric reasoning"
, journal =	"Annu. Rev. Comput. Sci."
, volume =	3
, year =	1988
, pages =	"85--119"
}

@book{bcla-casac-83
, title =	"Computer Algebra: Symbolic and Algebraic Computation"
, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
, edition =	"2nd"
, publisher =	"Springer-Verlag"
, year =	1983
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@incollection{bl-as-83
, author =	"B. Buchberger and R. Loos"
, title =	"Algebraic simplification"
, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
, publisher =	"Springer-Verlag"
, year =	1983
, pages =	"11--43"
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@proceedings{bs-ewcg-95
, title =	"Abstracts 11th European Workshop Comput. Geom."
, editor =	"Bruno Buchberger and Sabine Stifter"
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, update =	"00.03 bibrelex"
}

@incollection{be-ewcst-83
, author =	"W. Bucher and H. Edelsbrunner"
, title =	"On Expected- and Worst-Case Segment Trees"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"109--125"
, keywords =	"data structuring, searching, segment trees, worst-case analysis, expected-case analysis, intervals"
, update =	"01.04 icking"
}

@article{bv-ev-76
, author =	"Edwin Buchman and F. A. Valentine"
, title =	"External visibility"
, journal =	"Pacific J. Math."
, volume =	64
, number =	2
, year =	1976
, pages =	"333--340"
}

@article{b-crach-86
, author =	"C. Buchta"
, title =	"On a conjecture of {R}. {E}. {Miles} about the convex hull of random points"
, journal =	"Monatsch. Math."
, volume =	102
, year =	1986
, pages =	"91--102"
, keywords =	"convex hull, probabilistic geometry"
, update =	"95.05 korneenko"
}

@article{b-nsrsl-87
, author =	"C. Buchta"
, title =	"On nonnegative solutions of random systems of linear inequalities"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"85--95"
}

@article{b-anmsv-89
, author =	"C. Buchta"
, title =	"On the average number of maxima in a set of vectors"
, journal =	"Inform. Process. Lett."
, volume =	33
, number =	2
, year =	1989
, pages =	"63--66"
, keywords =	"probabilistic geometry"
, update =	"95.05 korneenko"
}

@article{b-ps-43
, author =	"R. C. Buck"
, title =	"Partition of space"
, journal =	"Amer. Math. Monthly"
, volume =	50
, number =	9
, year =	1943
, pages =	"541--544"
, keywords =	"arrangements, $d$-dimensional, partition"
, update =	"95.05 korneenko"
}

@inproceedings{b-dcac4-88
, author =	"C. E. Buckley"
, title =	"A divide-and-conquer algorithm for computing $4$-dimensional convex hulls"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"113--135"
, update =	"00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@inproceedings{bl-pmcpp-85
, author =	"C. E. Buckley and l. J. Leifer"
, title =	"A proximity metric for continuum pah planning"
, booktitle =	"Proc. 9th Internat. Conf. Artificial Intell."
, year =	1985
, pages =	"1096--1102"
, update =	"98.07 bibrelex"
}

@phdthesis{b-ptcms-87
, author =	"S. J. Buckley"
, title =	"Planning and teaching compliant motion strategies"
, school =	"Department of Electrical Engineering and Computer Science, MIT"
, year =	1987
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{befl-evcpp-96
, author =	"B. B{\"u}eler and A. Enge and K. Fukuda and H.-J. L{\"u}thi"
, title =	"Exact Volume Computations for Polytopes: a Practical Study"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"57--64"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{bh-amgfe-90
, author =	"T. D. Bui and V. N. Hanh"
, title =	"Automatic Mesh Generation for Finite-Element Analysis"
, journal =	"Computing"
, volume =	44
, number =	4
, year =	1990
, pages =	"305--329"
, annote =	"Your basic selection algorithm for triangulation."
}

@phdthesis{b-ptrpn-94
, author =	"X.-N. Bui"
, title =	"Planification de trajectoire pour un robot polygonal non-holonome dans un environnement polygonal"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"{\'E}cole Nationale Sup\'erieure des Mines de Paris"
, address =	"France"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"98.07 devillers"
}

@inproceedings{bsbl-spsdn-94
, author =	"X.-N. Bui and P. Sou{\`e}res and J.-D. Boissonnat and J.-P. Laumond"
, title =	"Shortest path synthesis for {Dubins} nonholonomic robot"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"San  Diego, CA"
, year =	1994
, pages =	"2--7"
, update =	"97.11 bibrelex"
}

@techreport{bsbl-spsnr-93
, author =	"Xuan-Nam Bui and Philippe Soueres and Jean-Daniel Boissonnat and Jean-Paul Laumond"
, title =	"The Shortest Path Synthesis for Non-holonomic Robots Moving Forwards"
, type =	"Research {Report}"
, number =	2153
, institution =	"INRIA"
, month =	dec
, year =	1993
, update =	"98.03 mitchell"
, abstract =	"We calculate the partition
 of the configuration space $I\!\!R^2 x S^1$
 of a car-like  robot, only moving forwards,  with respect  to the
 type of the  length optimal paths.  This kind  of robot is  subject to
 kinematic constraints on   its  path curvature and  its   orientation.
 Starting from the results on shortest paths by  [Dub57 ] and [BCL92 ],
 we  give  new optimality conditions  on  these paths, and  compute the
 partition for any horizontal plane of the configuration space."
}

@article{bs-aulbr-66
, author =	"R. Bulirsch and J. Stoer"
, title =	"Asymptotic upper and lower bounds for results of extrapolation methods"
, journal =	"Numer. Math."
, volume =	8
, year =	1966
, pages =	"93--104"
, update =	"98.07 bibrelex"
}

@article{bs-nqe-67
, author =	"R. Bulirsch and J. Stoer"
, title =	"Numerical quadrature by extrapolation"
, journal =	"Numer. Math."
, volume =	9
, year =	1967
, pages =	"271--278"
, update =	"98.07 bibrelex"
}

@article{b-hs1-61
, author =	"R. K. Bullough"
, title =	"On homometric sets, 1"
, journal =	"Acta Crystallogr."
, volume =	14
, year =	1961
, pages =	"257--268"
, keywords =	"reconstruction, points"
, update =	"95.05 korneenko"
}

@article{b-hs2-64
, author =	"R. K. Bullough"
, title =	"On homometric sets, 2"
, journal =	"Acta Crystallogr."
, volume =	17
, year =	1964
, pages =	"295--308"
, keywords =	"reconstruction, points"
, update =	"95.05 korneenko"
}

@article{bsh-sgfgt-84
, author =	"A. B{\"u}low-Olsen and N. R. {Sakevile Hamilton} and M. J. Hutchings"
, title =	"A study of growth form in genets of {Trifolium repens L.} as affected by intra- and interplant contacts"
, journal =	"Oecologia"
, volume =	"??"
, year =	1984
, update =	"97.11 bibrelex"
}

@book{b-mpg-69
, author =	"R. J. Bumcrot"
, title =	"Modern Projective Geometry"
, publisher =	"Holt, Rinehart \& Winston"
, address =	"New York, NY"
, year =	1969
, update =	"97.11 bibrelex"
}

@book{bz-gi-88
, author =	"Y. D. Burago and V. A. Zalgaller"
, title =	"Geometric Inequalities"
, publisher =	"Springer-Verlag"
, year =	1988
, note =	"Translated from the Russian"
, update =	"97.11 bibrelex"
}

@article{b-gafp-74
, author =	"C. A. Burdet"
, title =	"Generating all faces of a polyhedron"
, journal =	"SIAM J. Appl. Math."
, volume =	26
, year =	1974
, pages =	"479--489"
}

@book{bcs-act-96
, author =	"Peter B{\"u}rgisser and Michael Clausen and M. Amin Shokrollahi"
, title =	"Algebraic Complexity Theory"
, series =	"Grundlehren der mathematischen Wissenschaften"
, volume =	315
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1996
, isbn =	"0-387-60582-7"
, update =	"97.07 agarwal+smid"
}

@article{b-ospre-86
, author =	"R. E. Burkard"
, title =	"Optimal schedules for periodically recurring events"
, journal =	"Discrete Appl. Math."
, volume =	15
, year =	1986
, pages =	"167--180"
, keywords =	"scheduling, convex polygons, regular polygons"
, update =	"96.01 mitchell"
, abstract =	"Place two regular polygons in a circle so as to minimize
		the maximum separation between two vertices along the circle."
}

@article{bddvw-wsctsps-98
, author =	"Rainer E. Burkard and Vladimir G. Deineko and Ren{\'e} van Dal and Jack A. A. van der Veen and Gerhard J. Woeginger"
, title =	"Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey"
, journal =	"SIAM Rev."
, volume =	40
, number =	3
, year =	1998
, pages =	"496 -- 546"
, keywords =	"survey paper, traveling salesman problem, combinatorial optimization, polynomial time algorithm, computational complexity"
, update =	"98.11 pocchiola"
, abstract =	"The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\cal NP}$-hard problem, many of its special cases can be solved efficiently in polynomial time. We survey these special cases with emphasis on the results that have been obtained during the decade 1985--1995.  This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler, and Shmoys [The Traveling Salesman Problem---A Guided Tour of Combinatorial Optimization, Wiley, Chichester, pp. 87--143]"
}

@article{bhr-saucf-91
, author =	"R. E. Burkard and H. W. Hamacher and G{\"u}nter Rote"
, title =	"Sandwich approximation of univariate convex functions with an application to separable convex programming"
, journal =	"Naval Res. Logistics"
, volume =	38
, year =	1991
, pages =	"911--924"
, comments =	"final (modified) version of the techreport bhr-acfam-87"
, cites =	"r-crsaa-90"
, update =	"98.03 mitchell, 93.09 rote"
}

@techreport{bkr-pmpo-95
, author =	"Rainer E. Burkard and Bettina Klinz and R{\"u}diger Rudolf"
, title =	"Perspectives of {Monge} Properties in Optimization"
, type =	""
, number =	2
, institution =	"Spezialforschungsbereich F~003, Karl-Franzens-Universit{\"a}t Graz and Technische Universit{\"a}t Graz"
, month =	aug
, year =	1995
, url =	"ftp://ftp.tu-graz.ac.at/pub/papers/math/sfb2.ps.gz"
, update =	"01.04 icking"
}

@article{bryy-spps-90
, author =	"Rainer E. Burkard and G{\"u}nter Rote and En-Yu Yao and Zhong-Liang Yu"
, title =	"Shortest Polygonal Paths in Space"
, journal =	"Computing"
, volume =	45
, year =	1990
, pages =	"51--68"
, update =	"93.09 milone+mitchell+rote"
, annote =	"For a given polygonal chain, find the shortest (open
		 or closed) path that visits every segment of the chain in
		 the given order."
}

@techreport{b-aaipm-75
, author =	"W. A. Burkhard"
, title =	"Associative access and inversion and partial-match file designs"
, type =	"Report"
, number =	"TR-4"
, institution =	"UCSD Comput. Sci. Division, Univ. California"
, address =	"San Diego, La Jolla, CA"
, year =	1975
}

@inproceedings{b-arthc-76
, author =	"W. A. Burkhard"
, title =	"Associative retrieval trie hash-coding"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
, year =	1976
, pages =	"211--219"
, precedes =	"b-arthc-77"
}

@article{b-arthc-77
, author =	"W. A. Burkhard"
, title =	"Associative retrieval trie hash-coding"
, journal =	"J. Comput. Syst. Sci."
, volume =	15
, year =	1977
, pages =	"280--299"
, succeeds =	"b-arthc-76"
}

@inproceedings{b-fdpmr-75
, author =	"W. A. Burkhard"
, title =	"File designs for partial-match retrieval"
, booktitle =	"Proc. Conf. Inform. Sci. Systems"
, publisher =	"Johns Hopkins Univ."
, year =	1975
, pages =	"351--353"
}

@article{b-htapm-76
, author =	"W. A. Burkhard"
, title =	"Hashing and trie algorithms for partial-match retrieval"
, journal =	"ACM Trans. Database Syst."
, volume =	1
, year =	1976
, pages =	"175--187"
}

@article{b-nupmf-77
, author =	"W. A. Burkhard"
, title =	"Non-uniform partial-match file designs"
, journal =	"Theoret. Comput. Sci."
, volume =	5
, year =	1977
, pages =	"1--23"
}

@article{b-pmhcb-79
, author =	"W. A. Burkhard"
, title =	"Partial-match hash coding: benefits and redundancy"
, journal =	"ACM Trans. Database Syst."
, volume =	4
, year =	1979
, pages =	"228--239"
}

@inproceedings{b-pmqfd-75
, author =	"W. A. Burkhard"
, title =	"Partial-match queries and file designs"
, booktitle =	"Proc. Internat. Conf. Very Large Databases"
, year =	1975
, pages =	"523--525"
}

@article{b-pmr-76
, author =	"W. A. Burkhard"
, title =	"Partial-match retrieval"
, journal =	"BIT"
, volume =	16
, year =	1976
, pages =	"13--31"
}

@techreport{b-pmrpb-75
, author =	"W. A. Burkhard"
, title =	"Partial match retrieval: performance bounds"
, type =	"Report"
, number =	"TR-3"
, institution =	"UCSD Comput. Sci. Division, Univ. California"
, address =	"San Diego, La Jolla, CA"
, year =	1975
}

@article{bfk-ictor-81
, author =	"W. A. Burkhard and M. L. Fredman and D. J. Kleitman"
, title =	"Inherent complexity trade-offs for range query problems"
, journal =	"Theoret. Comput. Sci."
, volume =	16
, year =	1981
, pages =	"279--290"
}

@article{bk-sabmf-73
, author =	"W. A. Burkhard and R. M. Keller"
, title =	"Some approaches to best match file searching"
, journal =	"Commun. ACM"
, volume =	16
, year =	1973
, pages =	"230--236"
}

@phdthesis{b-ecvdl-96
, author =	"C. Burnikel"
, title =	"Exact Computation of {Voronoi} Diagrams and Line Segment Intersections"
, type =	"Ph.{D} Thesis"
, school =	"Universit{\"a}t des Saarlandes"
, month =	mar
, year =	1996
, keywords =	"doctoral thesis"
, update =	"96.09 devillers"
}

@article{bfms-secsb-00
, author =	"C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
, title =	"A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals"
, journal =	"Algorithmica"
, volume =	27
, number =	1
, year =	2000
, pages =	"87--99"
, update =	"00.11 smid, 00.07 held"
}

@inproceedings{bfms-secsb-97
, author =	"C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
, title =	"A strong and easily computable separation bound for arithmetic expressions involving square roots"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"702--709"
, update =	"98.07 bibrelex"
}

@inproceedings{bfms-eegcm-99
, author =	"C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
, title =	"Efficient Exact Geometric Computation Made Easy"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"341--350"
, update =	"00.03 vismara"
}

@article{bfs-egcc-01
, author =	"C. Burnikel and S. Funke and M. Seel"
, title =	"Exact Geometric Computation using Cascading"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"245--266"
, update =	"01.07 smid"
}

@inproceedings{bfs-egpuc-98
, author =	"C. Burnikel and S. Funke and M. Seel"
, title =	"Exact Geometric Predicates using Cascaded Computation"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"175--183"
, update =	"99.07 vismara, 98.07 tamassia"
}

@inproceedings{bkmnsu-egcl-95
, author =	"Christoph Burnikel and Jochen K{\"o}nnemann and Kurt Mehlhorn and Stefan N{\"a}her and Stefan Schirra and Christian Uhrig"
, title =	"Exact Geometric Computation in {LEDA}"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C18--C19"
, url =	"http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html"
, keywords =	""
, cites =	"bjmm-lsicg-93, bms-hcvdl-94, fv-eeacg-93, mn-lpcgc-95, m-mca-92, yd-ecp-95, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell, 95.05 agarwal+devillers"
}

@inproceedings{bms-hcvdl-94
, author =	"C. Burnikel and K. Mehlhorn and S. Schirra"
, title =	"How to Compute the {Voronoi} Diagram of Line Segments: Theoretical and Experimental Results"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, nickname =	"ESA '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"227--239"
, update =	"95.01 smid"
}

@inproceedings{bms-dgc-94
, author =	"C. Burnikel and K. Mehlhorn and S. Schirra"
, title =	"On degeneracy in geometric computations"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"16--23"
, update =	"95.01 matousek+smid"
}

@techreport{bms-lcrn-96
, author =	"C. Burnikel and K. Mehlhorn and S. Schirra"
, title =	"The {LEDA} class real number"
, type =	"Technical {Report}"
, number =	"MPI-I-96-1-001"
, institution =	"Max-Planck Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, month =	jan
, year =	1996
, url =	"http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1996-1-001"
, update =	"99.07 vismara, 98.07 bibrelex"
}

@incollection{b-grtgs-74
, author =	"S. A. Burr"
, title =	"Generalized {Ramsey} theory for graphs: a survey"
, editor =	"R. Bari and F. Haray"
, booktitle =	"Graphs Combin."
, series =	"Lecture Notes Math."
, volume =	406
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1974
, pages =	"52--75"
, update =	"97.11 bibrelex"
}

@article{bes-rtmcg-75
, author =	"S. A. Burr and P. Erd{\H o}s and J. H. Spencer"
, title =	"{Ramsey} theorems for multiple copies of graphs"
, journal =	"Trans. Amer. Math. Soc."
, volume =	209
, year =	1975
, pages =	"87--99"
, update =	"97.11 bibrelex"
}

@article{bgs-op-74
, author =	"S. A. Burr and B. Gr{\"u}nbaum and N. J. A. Sloane"
, title =	"The orchard problem"
, journal =	"Geometriae Dedicatia"
, volume =	2
, year =	1974
, pages =	"397--424"
, update =	"98.03 bibrelex"
}

@inproceedings{brs-phpsd-87
, author =	"R. Burridge and V. T. Rajan and J. T. Schwartz"
, title =	"The peg-in-hole problem: {Statistics} and dynamics of nearly rigid bodies in frictional contact"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Raleigh, NC"
, year =	1987
, update =	"98.03 bibrelex"
}

@book{b-pgisl-86
, author =	"P. A. Burrough"
, title =	"Principles of Geographical Information Systems for Land Resourses Assessment"
, publisher =	"Oxford University Press"
, address =	"New York"
, year =	1986
, update =	"96.09 kreveld"
}

@article{bkk-cppt-84
, author =	"F. W. Burton and V. J. Kollias and J. G. Kollias"
, title =	"Consistency in point-in-polygon tests"
, journal =	"Comput. J."
, volume =	27
, number =	4
, year =	1984
, pages =	"375--376"
}

@article{bp-ddnpp-79
, author =	"G. R. Burton and G. B. Purdy"
, title =	"The directions determined by $n$ points in the plane"
, journal =	"J. London Math. Soc."
, volume =	20
, number =	2
, year =	1979
, pages =	"109--114"
, update =	"97.11 bibrelex"
}

@article{bs-hlah-82
, author =	"R. P. Burton and D. R. Smith"
, title =	"A hidden-line algorithm for hyperspace"
, journal =	"SIAM J. Comput."
, volume =	11
, year =	1982
, pages =	"71--80"
}

@article{b-rmspp-77
, author =	"W. Burton"
, title =	"Representation of many-sided polygons and polygonal lines for rapid processing"
, journal =	"Commun. ACM"
, volume =	20
, year =	1977
, pages =	"166--171"
}

@book{b-cs-58
, author =	"H. Buseman"
, title =	"Convex Surfaces"
, publisher =	"Interscience Publishers"
, address =	"New York, NY"
, year =	1958
, update =	"97.11 bibrelex"
}

@book{b-sdg-87
, author =	"H. Busemann"
, title =	"Spaces with distinguished Geodesics"
, publisher =	"M. Dekker"
, address =	"New York"
, year =	1987
, update =	"98.07 bibrelex"
}

@book{b-gog-55
, author =	"H. Busemann"
, title =	"The Geometry of Geodesics"
, publisher =	"Academic Press Inc."
, address =	"New York"
, year =	1955
, update =	"00.03 bibrelex"
}

@book{bgsss-mcm-66
, author =	"N. P. Buslenko and D. I. Golenko and I. M. Sobol and V. G. Sragovi{\v c} and J. A. {\v S}reider"
, title =	"The {Monte} {Carlo} Method"
, editor =	"J. A. Shrider"
, publisher =	"Pergamon Press"
, address =	"Oxford, UK"
, year =	1966
, update =	"98.03 bibrelex"
}

@inproceedings{by-lotmc-94
, author =	"S. Buss and P. Yianilos"
, title =	"Linear and {$O(n \log n)$} time minimum-cost matching algorithms for quasi-convex tours"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"65--76"
, update =	"97.11 bibrelex"
}

@article{by-lotmc-98
, author =	"S. R. Buss and P. N. Yianilos"
, title =	"Linear and {$O(n \log n)$} time minimum-cost matching algorithms for quasi-convex tours"
, journal =	"SIAM J. Comput."
, volume =	27
, year =	1998
, pages =	"170--201"
, update =	"98.07 smid"
}

@inproceedings{bdltvv-gwspt-96
, author =	"L. Buti and G. {Di Battista} and G. Liotta and E. Tassinari and F. Vargiu and L. Vismara"
, title =	"{GD-W}orkbench: A System for Prototyping and Testing Graph Drawing Algorithms"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"111--122"
, keywords =	"graph drawing, system"
, update =	"00.03 vismara, 98.07 vismara, 96.09 tamassia"
}

@inproceedings{bgjr-cdr-96
, author =	"Geoffrey Butlin and Mark Gammon and Maritin Jones and John Rawlinson"
, title =	"CAD data repair"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"7--12"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@article{b-tcl-85
, author =	"B. Buttenfield"
, title =	"Treatment of the Cartographic Line"
, journal =	"Cartographica"
, volume =	22
, year =	1985
, pages =	"1--26"
, update =	"96.09 kreveld"
}

@article{b-aahsf-71
, title = "Alternative Algorithm for {H}ilbert's Space-Filling curve"
, author = "Arthur Butz"
, journal = "IEEE Transactions on computers"
, year = 1971
, pages = "424-425"
}

@article{b-agtg1-76
, author =	"A. Bykat"
, title =	"Automatic generation of triangular grid: {I} --- subdivision of a general polygon into convex subregions; {II} --- triangulation of convex polygons"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	10
, year =	1976
, pages =	"1329--1342"
}

@article{b-chfsp-78
, author =	"A. Bykat"
, title =	"Convex hull of a finite set of points in two dimensions"
, journal =	"Inform. Process. Lett."
, volume =	7
, year =	1978
, pages =	"296--298"
}

@article{b-ps-79
, author =	"A. Bykat"
, title =	"On polygon similarity"
, journal =	"Inform. Process. Lett."
, volume =	9
, year =	1979
, pages =	"23--25"
}

@inproceedings{cgmm-dfglm-01
, author =	"Jos{\'e} C{\'a}ceres and Clara I. Grima and Alberto M{\'a}rquez and Auxiliadora Moreno-Gonz{\'a}lez"
, title =	"Dilation Free Graphs in {$L_1$}-Metric"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"178--182"
, update =	"01.04 icking"
}

@inproceedings{cm-atm-99
, author =	"Jos{\'e} C{\'a}ceres and Alberto M{\'a}rquez"
, title =	"An Aperiodic Tiles Machine"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"55--57"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{c-cepgu-93
, author =	"Jiazhen Cai"
, title =	"Counting Embeddings of Planar Graphs Using {DFS} Trees"
, journal =	"SIAM J. Discrete Math."
, volume =	6
, year =	1993
, pages =	"335--352"
, keywords =	"graph drawing, DFS tree, planarization"
, update =	"98.11 patrignani"
}

@article{cht-otams-93
, author =	"J. Cai and X. Han and R. E. Tarjan"
, title =	"An ${O}(m \log n)$-time Algorithm for the Maximal Subgraph Problem"
, journal =	"SIAM J. Comput."
, volume =	22
, year =	1993
, pages =	"1142--1162"
, keywords =	"graph drawing, planarization"
, update =	"95.05 tamassia, 93.09 tamassia"
}

@inproceedings{ch-rdtps-94
, author =	"J. Cai and M. D. Hirsch"
, title =	"Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"172--180"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
}

@inproceedings{c-apeg-96
, author =	"L. Cai"
, title =	"Algorithms on polygonal embeddings of graphs"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"300--305"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@misc{c-t2s-91
, author =	"L. Cai"
, title =	"Tree 2-Spanners"
, year =	1991
, note =	"manuscript, Simon Fraser University"
, update =	"98.07 bibrelex"
}

@inproceedings{ce-vgpr-95
, author =	"Leizhen Cai and Hazel Everett"
, title =	"Visibility Graphs of Polygonal Rings"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"157--161"
, update =	"95.09 jones"
}

@article{ck-cviis-97
, author =	"L. Cai and J. M. Keil"
, title =	"Computing Visibility Information in an Inaccurate Simple Polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"515--538"
, update =	"98.11 devillers"
}

@article{cxz-cobtcp-99
, author =	"L. Cai and Y. Xu and B. Zhu"
, title =	"Computing the Optimal Bridge between two Convex Polygons"
, journal =	"Inform. Process. Lett."
, volume =	69
, year =	1999
, pages =	"127--130"
, update =	"02.03 cheong"
}

@article{ch-srpfc-68
, author =	"L. Calabi and W. E. Hartnett"
, title =	"Shape recognition, prairie fires, convex deficiencies and skeletons"
, journal =	"Amer. Math. Monthly"
, volume =	75
, year =	1968
, pages =	"335--342"
}

@inproceedings{cm-tdlin-97
, author =	"Tiziana Calamoneri and Annalisa Massini"
, title =	"On Three-Dimensional Layout of Interconnection Networks"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"64--75"
, keywords =	"graph drawing, 3D"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@techreport{cs-d234cg-96
, author =	"T. Calamoneri and A. Sterbini"
, title =	"Drawing $2$-, $3$- and $4$-colorable graphs in $O(n^2)$ volume"
, type =	"report"
, institution =	"Dept. of Computer Sci., Univ of Rome ``La Sapienza''"
, year =	1996
, keywords =	"graph drawing, straight-line, 3D"
, precedes =	"cs-d234c-97"
, update =	"98.07 patrignani, 96.09 tamassia"
}

@inproceedings{cs-d234c-97
, author =	"T. Calamoneri and A. Sterbini"
, title =	"Drawing $2$-, $3$-, and $4$-Colorable Graphs in $O(n^2)$ Volume"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"53--62"
, keywords =	"graph drawing, straight-line, 3D"
, succeeds =	"cs-d234cg-96"
, update =	"98.07 patrignani"
}

@inproceedings{cgg-oiprf-99
, author =	"A. Calatayud and J. Garc{\'\i}a and F. G{\'o}mez"
, title =	"Optimal Illumination of Points with a Restricted Flood-Light"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"87--90"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{cgr-tbtta-95
, author =	"Paul Callahan and Michael T. Goodrich and Kumar Ramaiyer"
, title =	"Topology {B}-Trees and their Applications"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"381--392"
, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
}

@phdthesis{c-dwhdt-95
, author =	"P. B. Callahan"
, title =	"Dealing with higher dimensions: the well-separated pair decomposition and its applications"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Johns Hopkins University"
, address =	"Baltimore, Maryland"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"96.05 smid"
}

@inproceedings{c-opann-93
, author =	"Paul B. Callahan"
, title =	"Optimal Parallel All-Nearest-Neighbors Using the Well-Seated Pair Decomposition"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"332--340"
, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{ck-dmdps-92
, author =	"P. B. Callahan and S. R. Kosaraju"
, title =	"A decomposition of multi-dimensional point-sets with applications to $k$-nearest-neighbors and $n$-body potential fields"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"546--556"
, keywords =	"well-separated pair decomposition"
, update =	"93.09 rote"
}

@article{ck-dmpsa-95
, author =	"P. B. Callahan and S. R. Kosaraju"
, title =	"A decomposition of multidimensional point sets with applications to $k$-nearest-neighbors and $n$-body potential fields"
, journal =	"J. ACM"
, volume =	42
, year =	1995
, pages =	"67--90"
, update =	"96.05 smid"
}

@inproceedings{ck-adcpn-95
, author =	"Paul B. Callahan and S. Rao Kosaraju"
, title =	"Algorithms for Dynamic Closest-Pair and {$n$}-Body Potential Fields"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"263--272"
, keywords =	"dynamic algorithms, closest pair, all nearest neighbors, fast multipole method"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@inproceedings{ck-fasgg-93
, author =	"P. B. Callahan and S. R. Kosaraju"
, title =	"Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"291--300"
, keywords =	"optimization, minimum spanning trees, spanner, well-separated pair decomposition"
, cites =	"ck-dmdps-92"
, update =	"93.09 rote, 93.05 smid"
}

@techreport{cs-mpssr-86
, author =	"K. Cameron and H. Sachs"
, title =	"Monotone Path Systems in Simple Regions"
, type =	"Technical {Report}"
, number =	86429
, institution =	"Management Science Dept., University of Waterloo"
, year =	1986
, update =	"93.09 milone+mitchell"
}

@incollection{c-agg-83
, author =	"P. J. Cameron"
, title =	"Automorphism Groups of Graphs"
, editor =	"B. Wilson"
, booktitle =	"Selected Topics in Graph Theory"
, publisher =	"Academic Press"
, year =	1983
, update =	"97.11 bibrelex"
}

@techreport{c-eactc-??
, author =	"S. Cameron"
, title =	"An efficient algorithm for computing the translational configuration space obstacle of two convex polyhedra"
, type =	"Report"
, number =	"??"
, institution =	"McDonnell Douglas Res. Lab."
, year =	"??"
}

@article{c-cdfdi-90
, author =	"S. Cameron"
, title =	"Collision Detection by Four-Dimensional Intersection Testing"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, number =	3
, year =	1990
, pages =	"291--302"
, update =	"95.01 mitchell"
}

@article{c-ebcsg-91
, author =	"S. Cameron"
, title =	"Efficient bounds in constructive solid geometry"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	11
, number =	3
, year =	1991
, pages =	"68--74"
, keywords =	"data structuring, geometric modeling, constructive solid geometry"
, update =	"95.09 korneenko"
}

@article{cy-rmgbc-92
, author =	"S. Cameron and C.-K. Yap"
, title =	"Refinement methods for geometric bounds in constructive solid geometry"
, journal =	"ACM Trans. Graph."
, volume =	11
, year =	1992
, pages =	"12--39"
, keywords =	"constituents, boolean algebra, simplification"
, update =	"93.09 held"
}

@inproceedings{cc-dmtdb-86
, author =	"S. A. Cameron and R. K. Culley"
, title =	"Determining the minimum translational distance between two convex polyhedra"
, booktitle =	"Proc. of IEEE Inter. Conf. on Robotics and Automation"
, year =	1986
, pages =	"591--596"
, keywords =	"GEOMOD OBSTACLE-AVOID COMPUTATIONAL-GEOMETRY 3D PROXIMITY INTERSECTION CONVEX"
, update =	"98.07 bibrelex"
, annote =	"An algorithm is described to determine the Minimal
		 Translation Distance (MTD) between two polyhedra. One
		 way in which this algorithm differs from others is that
		 it will return a value other than zero if the two
		 objects intersect. This value is the penetration
		 distance and has a negative sign. -WCF"
}

@article{cks-desrt-99
, author =	"S. Campagna and L. Kobbelt and H.-P. Seidel"
, title =	"Directed Edges --- A Scalable Representation for Triangle Meshes"
, journal =	"J. Graphics Tools"
, volume =	3
, number =	4
, year =	1999
, pages =	"1--12"
, update =	"00.03 held"
}

@phdthesis{c-mgdii-91
, author =	"A. T. Campbell"
, title =	"Modeling Global Diffuse Illumination for Image Synthesis"
, school =	"Dept. Comput. Sci., Univ. Texas Austin"
, address =	"Austin, TX"
, year =	1991
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@techreport{c-crsdr-85
, author =	"D. Campbell"
, title =	"The {Cornell} robot system design report"
, type =	"Technical {Report}"
, number =	"85-697"
, institution =	"Cornell Univ."
, address =	"Ithaca, NY"
, year =	1985
, update =	"98.03 bibrelex"
}

@article{ch-mvg-91
, author =	"D. Campbell and J. Higgins"
, title =	"Minimal visibility graphs"
, journal =	"Inform. Process. Lett."
, volume =	37
, number =	1
, year =	1991
, pages =	"49--53"
, keywords =	"visibility, geometric graphs, segments"
, update =	"95.09 korneenko"
}

@article{cf-amggdi-90
, author =	"A. T. {Campbell III} and D. S. Fussell"
, title =	"Adaptive Mesh Generation for Global Diffuse Illumination"
, journal =	"Comput. Graph."
, volume =	24
, month =	aug
, year =	1990
, pages =	"155--164"
, update =	"98.11 ghali"
}

@techreport{cf-aaial-91
, author =	"A. T. {Campbell III} and D. S. Fussell"
, title =	"An Analytic Approach to Illumination with Area Light Sources"
, type =	"Report"
, number =	"TR--91--25"
, institution =	"Department of Computer Sciences, University of Texas at Austin"
, address =	"Austin, Texas"
, month =	aug
, year =	1991
, update =	"99.03 forrest, 98.11 ghali"
}

@article{c-icdir-93
, author =	"F. Can"
, title =	"Incremental clustering for dynamic information retrieval"
, journal =	"ACM Trans. Inform. Syst."
, volume =	11
, year =	1993
, pages =	"143--164"
, update =	"98.07 agarwal"
}

@incollection{cgh-snebc-89
, author =	"L. Canaglia and A. Galligo and J. Heintz"
, title =	"Some new effectivity bounds in computational geometry"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	357
, year =	1989
, pages =	"131--151"
, keywords =	"algebraic geometry, motion planning, parallel computation"
, update =	"95.09 korneenko"
}

@article{c-talp-69
, author =	"R. Canham"
, title =	"A theorem on arrangements of lines in the plane"
, journal =	"Israel J. Math."
, volume =	7
, year =	1969
, pages =	"393--397"
, keywords =	"arrangements, complexity of faces"
}

@techreport{cgh-snebc-88
, author =	"L. Caniglia and A. Galligo and J. Heintz"
, title =	"Some new efficient bounds in computational geometry"
, institution =	"Instituto Argentino de Mathem{\'a}tica"
, address =	"Buenos Aires, Argentina"
, year =	1988
, note =	"Preliminary version"
, update =	"98.03 bibrelex"
}

@article{c-cgts-69
, author =	"J. J. Cannon"
, title =	"Computers in Group Theory: {A} Survey"
, journal =	"Commun. ACM"
, volume =	12
, year =	1969
, pages =	"3--12"
, update =	"97.11 bibrelex"
}

@inproceedings{c-namrm-87
, author =	"J. Canny"
, title =	"A new algebraic method for robot motion planning and real geometry"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"39--48"
}

@inproceedings{c-vmpmp-85
, author =	"J. Canny"
, title =	"A {Voronoi} method for the piano-movers problem"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"St. Louis, MO"
, year =	1985
, pages =	"530--535"
}

@inproceedings{c-emscc-87
, author =	"J. Canny"
, title =	"An efficient method for skeletonizing the connected components of a semi-algebraic set"
, booktitle =	"4th Computational Geometry Day"
, organization =	"New York Univ."
, month =	mar
, year =	1987
, note =	"Presented Talk"
, update =	"98.03 bibrelex"
}

@techreport{c-cdmp-84
, author =	"J. Canny"
, title =	"Collision Detection for Moving Polyhedra"
, type =	"A. {I}. {Memo}"
, number =	806
, institution =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1984
, update =	"98.03 bibrelex"
}

@article{c-cdmp-86
, author =	"John Canny"
, title =	"Collision Detection for Moving Polyhedra"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-8"
, number =	2
, year =	1986
, pages =	"200--209"
, update =	"95.01 mitchell"
}

@article{c-crgss-93
, author =	"J. Canny"
, title =	"Computing roadmaps in general semialgebraic sets"
, journal =	"Comput. J."
, volume =	36
, year =	1993
, pages =	"409--418"
, update =	"98.07 agarwal, 95.05 agarwal"
}

@inproceedings{c-crsas-91
, author =	"J. Canny"
, title =	"Computing roadmaps of semi-algebraic sets"
, booktitle =	"Proc. 9th AAECC"
, site =	"New Orleans"
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{c-crsas-86
, author =	"J. Canny"
, title =	"Constructing roadmaps of semi-algebraic sets"
, booktitle =	"International Workshop on Geometric Reasoning"
, site =	"Oxford University, England"
, year =	1986
, precedes =	"c-crsas-88"
, update =	"95.09 korneenko"
}

@article{c-crsas-88
, author =	"J. Canny"
, title =	"Constructing roadmaps of semi-algebraic sets 1: {Completeness}"
, journal =	"Artif. Intell."
, volume =	37
, year =	1988
, pages =	"203--222"
, keywords =	"motion planning, algebraic geometry"
, succeeds =	"c-crsas-86"
, update =	"96.09 devillers, 95.09 korneenko"
}

@inproceedings{c-gcp-88
, author =	"J. Canny"
, title =	"Generalized Characteristic Poynomials"
, booktitle =	"Proc. ACM Sympos. Symbolic and Algebraic Computation"
, year =	1988
, update =	"97.11 bibrelex"
}

@article{c-iasde-93
, author =	"J. Canny"
, title =	"Improved algorithms for sign determination and existential quantifier elimination"
, journal =	"Comput. J."
, volume =	36
, year =	1993
, pages =	"504--514"
, update =	"98.07 agarwal"
}

@inproceedings{c-dcbp-84
, author =	"J. Canny"
, title =	"On detecting collision between polyhedra"
, booktitle =	"Proc. ECAI"
, year =	1984
, pages =	"533--542"
, update =	"98.03 bibrelex"
}

@inproceedings{c-sagcp-88
, author =	"J. Canny"
, title =	"Some algebraic and geometric computations in {PSPACE}"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"460--467"
, update =	"98.07 agarwal"
}

@book{c-crmp-87
, author =	"J. Canny"
, title =	"The Complexity of Robot Motion Planning"
, series =	"ACM -- MIT Press Doctoral Dissertation Award Series"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1987
, isbn =	"0-262-03136-1"
, keywords =	"doctoral thesis"
, comments =	"revised version of author's Ph.D. thesis, Electrical
		 Engineering and Computer Science Dept., Massachusetts
		 Inst. Tech. 1987"
, update =	"97.11 bibrelex"
}

@inproceedings{cd-svd-87
, author =	"J. Canny and B. R. Donald"
, title =	"Simplified {Voronoi} diagrams"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"153--161"
, precedes =	"cd-svd-88"
, cites =	"c-cdmp-86, c-vmpmp-85, c-crsas-86, d-mpsdf-84, ld-gvdp-81, l-spcsa-83, lw-apcfp-79, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, ss-pmp2g-82, sy-agar-87, w-esrav-57, y-cmsd-84, ZZZ"
, update =	"98.03 bibrelex"
}

@article{cd-svd-88
, author =	"J. Canny and B. R. Donald"
, title =	"Simplified {Voronoi} diagrams"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"219--236"
, succeeds =	"cd-svd-87"
}

@inproceedings{cdrx-ckp-88
, author =	"J. Canny and B. R. Donald and J. Reif and P. Xavier"
, title =	"On the complexity of kinodynamic planning"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, site =	"White Plains, NY"
, year =	1988
, pages =	"306--316"
, precedes =	"dxcr-kmp-93"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{cdr-rrmrg-92
, author =	"J. Canny and B. R. Donald and E. K. Ressler"
, title =	"A rational rotation method for robust geometric algorithms"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"251--260"
, succeeds =	"cdr-rrmrg-91"
, cites =	"ahu-daca-74, b-eaosp-89, bm-gaprb-89, c-cfmp-89, d-edrr-89, d-cpcmp-90, dp-mccrb-90, e-ubfmp-86, afw-fsgvd-88, hhk-tirgc-88, l-spcsa-83, l-rmp-91, lm-cschu-90, mn-fccrp-90i, ps-cgi-85, r-lent-64, s-bag-77, si-smsft-89, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{cdr-rrmrg-91
, author =	"J. Canny and B. R. Donald and G. Ressler"
, title =	"A rational rotation method for robust geometric algorithms"
, type =	"Technical {Report}"
, number =	"TR~91-1247"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	dec
, year =	1991
, keywords =	"robustness"
, comments =	"extended abstract"
, precedes =	"cdr-rrmrg-92"
}

@inproceedings{crr-eakpp-90
, author =	"J. Canny and A. Rege and J. Reif"
, title =	"An exact algorithm for kinodynamic planning in the plane"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"271--280"
, precedes =	"crr-eakpp-91"
, cites =	"bdg-ocrma-83, cdrx-ckp-88, cr-nlbtr-87, fw-pcm-88, h-dsmt-83, jc-pspmr-89, jhcp-pgnto-89, o-mpic-87, rt-akpul-89, r-ccgfo-89, sh-pmttr-84, s-obbtr-87, sd-gtomr-88, sm-mtcrm-85, ZZZ"
, update =	"97.11 bibrelex"
}

@article{crr-eakpp-91
, author =	"J. Canny and A. Rege and J. Reif"
, title =	"An exact algorithm for kinodynamic planning in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"461--484"
, succeeds =	"crr-eakpp-90"
}

@inproceedings{cr-nlbtr-87
, author =	"J. Canny and J. H. Reif"
, title =	"New lower bound techniques for robot motion planning problems"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"49--60"
}

@inproceedings{c-isda-91
, author =	"J. F. Canny"
, title =	"An improved sign determination algorithm"
, booktitle =	"Proc. 9th AAECC"
, site =	"New Orleans"
, year =	1991
, update =	"98.03 bibrelex"
}

@inproceedings{c-cfmp-89
, author =	"J. F. Canny"
, title =	"On the Computability of Fine-Motion Plans"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, publisher =	"IEEE Computer Society Press"
, address =	"Scottsdale, Arizona"
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{cg-rirrr-94
, author =	"J. F. Canny and K. Y. Goldberg"
, title =	"RISC for Industrial Robotics: Recent Results and Open Problems"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"San Diego, CA"
, month =	may
, year =	1994
, update =	"95.01 held"
}

@article{cgv-fccsa-92
, author =	"John F. Canny and Dima Grigor{\'e}v and Nicolai Vorobjov"
, title =	"Finding connected components of a semi-algebraic set in subexponential time"
, journal =	"Appl. Algebra Emg. Commun. Comput."
, volume =	2
, year =	1992
, pages =	"217--238"
, update =	"98.07 agarwal"
}

@techreport{ckl-sspef-89
, author =	"J. F. Canny and E. Kaltofen and Y. Lakshman"
, title =	"Solving Systems of Polynomial Equations Faster"
, type =	"Technical {Report}"
, number =	"89-14"
, institution =	"Dept. Comput. Sci., Rensselaer Polytech. Inst."
, address =	"Troy, NY"
, year =	1989
, update =	"97.11 bibrelex"
}

%, number =	"8"
@article{cj-nepiu-98
, author =	"J. Cantarella and H. Johnston"
, title =	"Nontrivial embeddings of polygonal intervals and unknots in 3-space"
, journal =	"J. Knot Theory Ramifications"
, volume =	7
, year =	1998
, pages =	"1027--1039"
, update =	"99.07 orourke"
}

@article{c-ocfpl-71
, author =	"A. Cantoni"
, title =	"Optimal curve fitting with piecewise linear functions"
, journal =	"IEEE Trans. Comput."
, volume =	"C-20"
, year =	1971
, pages =	"59--67"
, update =	"98.07 bibrelex"
}

@inproceedings{cgt-pumlp-96
, author =	"F. Cao and J. R. Gilbert and S. H. Teng"
, title =	"Partitioning Unstructured Meshes with Lines and Planes"
, booktitle =	"9th Internat. Conf. Domain Decomposition"
, year =	1996
, note =	"submitted"
, update =	"97.11 bibrelex"
}

@book{cm-ecgt-78
, author =	"M. Capobianco and J. C. Molluzzo"
, title =	"Examples and Counterexamples in Graph Theory"
, publisher =	"North-Holland"
, year =	1978
, update =	"97.11 bibrelex"
}

@article{c-cpo-93
, author =	"V. Capoyleas"
, title =	"Clamping of polygonal objects"
, journal =	"Pattern Recogn. Lett."
, volume =	14
, year =	1993
, pages =	"704--714"
, update =	"95.01 smid"
}

@article{c-aidp-96
, author =	"V. Capoyleas"
, title =	"On the area of the intersection of disks in the plane"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"393--396"
, update =	"97.03 devillers"
}

@article{cch-gngcb-96
, author =	"V. Capoyleas and X. Chen and C. M. Hoffmann"
, title =	"Generic naming in generative, constraint-based design"
, journal =	"Comput. Aided Design"
, volume =	28
, number =	1
, year =	1996
, pages =	"17--26"
, update =	"98.07 bibrelex"
}

@techreport{cp-tttcc-90
, author =	"V. Capoyleas and J. Pach"
, title =	"A {Tur{\'a}n}-type theorem on chords of a convex polygon"
, type =	"Technical {Report}"
, number =	"90-30"
, institution =	"DIMACS"
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{cp-ppsp-91
, author =	"V. Capoyleas and J. Pach"
, title =	"On the perimeter of a point set in the plane"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"54--57"
}

@inproceedings{crw-gc-90
, author =	"V. Capoyleas and G. Rote and G. Woeginger"
, title =	"Geometric clusterings"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"28--31"
, succeeds =	"rw-gc-89"
, precedes =	"crw-gc-91"
, cites =	"abky-cabmm-88, a-pdpaa-87, bh-cpcoe-89, b-ak-74, crw-gc-91, d-pcpho-84, e-acg-87, ers-ccsno-90, e-anccp-82, hs-ftp-89, hs-ftp-91, iim-vdlgi-85, j-nccog-82, ms-cscgl-84, ms-ppgmm-91, s-tcg-81, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@article{crw-gc-91
, author =	"V. Capoyleas and G{\"u}nter Rote and G. Woeginger"
, title =	"Geometric clusterings"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"341--356"
, keywords =	"cluster analysis"
, succeeds =	"crw-gc-90, rw-gc-89"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 rote, 93.09 rote"
, abstract =	"A k-clustering of a given set of points in the plane is
		 a partition of the points into k subsets (clusters). For any
		 fixed k, we can find a k-clustering which minimizes any monotone
		 function of the diameters or the radii of the
		 clusters in polynomial time. The algorithm is based on the
		 fact that any two clusters in an optimal solution can
		 be separated by a line."
}

@article{cgppsw-ctct-94
, author =	"S. E. Cappell and J. E. Goodman and J. Pach and R. Pollack and Micha Sharir and R. Wenger"
, title =	"Common tangents and common transversals"
, journal =	"Adv. Math."
, volume =	106
, year =	1994
, pages =	"198--215"
, succeeds =	"cgppsw-ccht-90"
, update =	"98.03 mitchell, 96.09 devillers, 95.09 wenger"
}

@inproceedings{cgppsw-ccht-90
, author =	"S. E. Cappell and J. E. Goodman and J. Pach and R. Pollack and Micha Sharir and R. Wenger"
, title =	"The combinatorial complexity of hyperplane transversals"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"83--91"
, note =	"(A revised version, entitled ``Common tangents and common
		 transversals,'' {\it Advance in Math.} 106 (1994), 198--215.)"
, precedes =	"cgppsw-ctct-94"
, cites =	"ab-eact-87, a-pdpaa-87, ad-ahdsp-90, blwsz-om-93, bf-tdkk-34, c-npbct-71, e-ftssg-85, e-acg-87, egs-ueplf-89, es-mnwsn-87, ew-spdtl-89, gp-ms-83, gp-htthd-88, hiir-wolla-89, klz-gpcs-85, ks-sbtat-77, m-tom-82, w-ubgpc-90, w-gpcc-90, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex, 95.09 wenger, 95.05 agarwal"
}

% ### others?
@article{c-mvor-87
, author =	"V. Cappellini and others"
, title =	"From multiple views to object recognition"
, journal =	"IEEE Trans. Circuits Syst."
, volume =	34
, year =	1987
, pages =	"1344--1350"
, update =	"98.11 bibrelex"
}

@article{c-ud5df-11
, author =	"C. Carath{\'e}odory"
, title =	"{\"U}ber den {V}ariabilit{\"a}tsbereich der {F}ourierschen {K}onstanten von positiven harmonischen {F}unktionen"
, journal =	"Rendiconto del Circolo Matematico di Palermo"
, volume =	32
, year =	1911
, pages =	"193--217"
, update =	"95.01 mitchell"
}

@article{csw-cds2d-88
, author =	"G. Carey and M. Sharna and K. Wang"
, title =	"A class of data structures for $2$-d and $3$-d adaptive mesh refinements"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	26
, year =	1988
, pages =	"2607--2622"
, update =	"97.11 bibrelex"
}

@techreport{cc-hdsrs-??
, author =	"I. Carlbom and I. Chakravaty"
, title =	"A hierarchical data structure for representing the spatial decomposition of $3$-d objects"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@article{cp-gpvt-78
, author =	"I. Carlbom and J. Paciorek"
, title =	"Geometric projection and viewing transformations"
, journal =	"ACM Comput. Surv."
, volume =	10
, year =	1978
, pages =	"465--502"
}

@inproceedings{cgrw-pgfip-94
, author =	"B. Carlisle and K. Y. Goldberg and A. S. Rao and J. Wiegley"
, title =	"A pivoting gripper for feeding industrial parts"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, month =	may
, year =	1994
, pages =	"1650--1655"
, update =	"98.03 bibrelex"
}

@article{cr-sdspv-87
, author =	"E. C. Carlson and R. A. Rutenbar"
, title =	"A scanline data structure processor for {VLSI} geometry checking"
, journal =	"IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
, volume =	5
, number =	5
, year =	1987
, pages =	"780--794"
, keywords =	"data structuring, VLSI design, parallel computation"
, update =	"95.09 korneenko"
}

@article{c-ddehi-87
, author =	"Svante Carlsson"
, title =	"The Deap: a Double-Ended Heap to Implement Double-Ended Priority Queries"
, journal =	"Inform. Process. Lett."
, volume =	26
, number =	1
, year =	1987
, pages =	"33--36"
, keywords =	"data structuring"
, update =	"99.07 bibrelex, 95.09 korneenko"
}

@article{ccs-ncdsd-89
, author =	"Svante Carlsson and Jingsen Chen and Thomas Strothotte"
, title =	"A Note on the Construction of the Data Structure ``Deap''"
, journal =	"Inform. Process. Lett."
, volume =	31
, year =	1989
, pages =	"315--317"
, keywords =	"data structuring"
, update =	"99.07 bibrelex, 95.09 korneenko"
}

@inproceedings{cj-cswps-95
, author =	"Svante Carlsson and Hakan Jonsson"
, title =	"Computing a Shortest Watchman Path in a Simple Polygon in Polynomial Time"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"122--134"
, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
}

@inproceedings{cj-gt-93
, author =	"Svante Carlsson and Hakan Jonsson"
, title =	"Guarding a Treasury"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"85--90"
, cites =	"b-vsp-91, ce-oails-92, dj-tag-92, ea-lacvp-81, h-ovgat-89, ll-cvpe-86, gmr-rlptd-92, o-agta-87, ps-cgi-85, c-ctpg-75, s-rrag-92, ZZZ"
, update =	"01.04 icking, 99.07 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{cjn-fswrs-93
, author =	"Svante Carlsson and Hakan Jonsson and Bengt J. Nilsson"
, title =	"Finding the Shortest Watchman Route in a Simple Polygon"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"58--67"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@article{cjn-fswrs-99
, author =	"S. Carlsson and H. Jonsson and B. J. Nilsson"
, title =	"Finding the Shortest Watchman Route in a Simple Polygon"
, journal =	"Discrete Comput. Geom."
, volume =	22
, number =	3
, year =	1999
, pages =	"377--402"
, update =	"99.11 held"
}

@article{cn-cvpp-99
, author =	"S. Carlsson and B. J. Nilsson"
, title =	"Computing Vision Points in Polygons"
, journal =	"Algorithmica"
, volume =	24
, year =	1999
, pages =	"50--75"
, update =	"00.03 bibrelex"
}

@inproceedings{cnn-ogcmw-91
, author =	"Svante Carlsson and Bengt J. Nilsson and Simeon Ntafos"
, title =	"Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"367--378"
, keywords =	"polygons, visibility"
, precedes =	"cnn-ogcmw-93"
, update =	"99.07 bibrelex, 98.03 mitchell, 96.09 devillers"
}

@article{cnn-ogcmw-93
, author =	"Svante Carlsson and Bengt J. Nilsson and Simeon Ntafos"
, title =	"Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"85--105"
, keywords =	"Visibility, art gallery, watchman route, dynamic programming"
, succeeds =	"cnn-ogcmw-91"
, update =	"99.07 bibrelex, 98.03 mitchell, 96.09 devillers"
}

@inproceedings{ck-mchlt-01
, author =	"Paz Carmi and Matthew J. Katz"
, title =	"Minimizing the Convex Hull via Local Transfers"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"105--108"
, update =	"01.04 icking"
}

@book{c-dgcs-76
, author =	"M. de Carmo"
, title =	"Differential Geometry of Curves and Surfaces"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1976
, update =	"98.03 bibrelex"
}

@article{c-dkhvn-70
, author =	"H. Carnal"
, title =	"Die konvexe {H{\"u}lle} von $n$ rotationssymmetrisch verteilten {Punkten}"
, journal =	"Z. Wahrsch. Verw. Gebiete"
, volume =	15
, year =	1970
, pages =	"168--176"
}

@article{c-gesc96
, author =	"Y. Caro"
, title =	"On the generalized {Erd{\H{o}}s-Szekeres} conjecture"
, journal =	"Discrete Math."
, volume =	160
, year =	1996
, pages =	"229--233"
, update =	"02.03 devillers"
}

@article{c-adhgc-80
, author =	"M. J. Carpano"
, title =	"Automatic Display of Hierarchized Graphs for Computer Aided Decision Analysis"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-10"
, number =	11
, year =	1980
, pages =	"705--715"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

%  what is this??
@article{cd-adtgi-80
, author =	"M. J. Carpano and M. Delarche"
, title =	"Apport des Techniques Graphiques Interactives a l'Analyse Structurale de Systemes. {II}-Exemples de Realization et d'Application"
, journal =	"RAIRO Sept. Anal. Cont. June"
, volume =	"??"
, year =	1980
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{cms-sssa-01
, author =	"Hamish Carr and Torsten M{\"o}ller and Jack Snoeyink"
, title =	"Simplicial Subdivisions and Sampling Artifacts"
, booktitle =	"Proceedings IEEE Visualization 2001"
, year =	2001
, pages =	"99--106"
, update =	"02.03 wenger"
}

@article{c-csma-87
, author =	"L. Carstensen"
, title =	"A comparison of simple mathematical approaches to spot symbols"
, journal =	"Cartographica"
, volume =	24
, number =	3
, year =	1987
, pages =	"46--63"
, update =	"97.07 agarwal"
}

@incollection{cc-pptus-95
, author =	"P. C. P. Carvalho and P. R. Cavalcanti"
, title =	"Point in polyhedron testing using spherical polygons"
, editor =	"A. W. Paeth"
, booktitle =	"Graphics Gems V"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1995
, pages =	"42--54"
, update =	"98.07 orourke, 98.03 orourke"
}

@article{c-egssn-96
, author =	"M. Casale"
, title =	"Evaluating geometric sensitivities at singular and non-singular points of variational {CAD} models for design optimization"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"443--460"
, update =	"97.03 devillers"
}

@book{c-ign-59
, author =	"J. Cassels"
, title =	"An Introduction to the Geometry of Numbers"
, publisher =	"Springer-Verlag"
, year =	1959
, update =	"96.05 pocchiola"
}

@inproceedings{csm-nocpt-95
, author =	"T. Cassen and K. R. Subramanian and Z. Michalewicz"
, title =	"Near-Optimal Construction of Partitioning Trees by Evolutionary Techniques"
, booktitle =	"Proc. of Graphics Interface '95"
, year =	1995
, pages =	"263--271"
, update =	"97.07 agarwal"
}

@inproceedings{cu-slepg-96
, author =	"N. Castaneda and J. Urrutia"
, title =	"Straight line embeddings of planar graphs on point sets"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"312--318"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{chm-npaga-95
, author =	"M. J. Castro-Diaz and F. Hecht and B. Mohammadi"
, title =	"New Progress in Anisotropic Grid Adaptation for Inviscid and Viscid Flows Simulations"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"73--86"
, update =	"96.01 samitchell"
}

@inproceedings{ccdm-rdbrc-99
, author =	"Natalia de Castro and Francisco Javier Cobos and Juan Carlos Dana and Alberto M{\'a}rquez"
, title =	"Rectangular Duals and Box-Representation in the Cylinder"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"145--147"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{c-ahcr-95
, author =	"T. Catarci"
, title =	"The Assignment Heuristic for Crossing Reduction"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	25
, number =	3
, year =	1995
, pages =	"515--521"
, succeeds =	"c-ahcrb-88"
, update =	"98.07 vismara"
}

@inproceedings{c-ahcrb-88
, author =	"T. Catarci"
, title =	"The Assignment Heuristic for Crossing Reduction in Bipartite Graphs"
, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{c-sacdc-74
, author =	"E. Catmull"
, title =	"A Subdivision Algorithm for Computer Display of Curved Surfaces"
, number =	"UTEC-CSC-74-133"
, institution =	"Dept. Comput. Sci., Univ. Utah"
, address =	"Salt Lake City"
, year =	1974
, update =	"97.11 bibrelex"
}

@article{cc-rgbss-78
, author =	"E. Catmull and J. Clark"
, title =	"Recursively generated {B}-spline surfaces on arbitrary topological meshes"
, journal =	"Comput. Aided Design"
, volume =	10
, year =	1978
, pages =	"350--365"
}

@article{c-spp-1813
, author =	"Augustin L. Cauchy"
, title =	"Sur les polygones et les poly{\`e}dres, seconde m{\'e}moire"
, journal =	"J. {\'E}cole Polytechnique"
, volume =	"XVIe Cahier, Tome IX"
, year =	1813
, pages =	"113--148"
, note =	"OEuvres Compl{\`e}tes, IIe S{\`e}rie, Vol. 1, Paris, 1905, 26--38."
, update =	"01.11 orourke"
}

@inproceedings{ca-hadla-86
, author =	"H. J. Caulfield and M. A. G. Abushagur"
, title =	"Hybrid analog-digital linear algebra processors"
, booktitle =	"Proc. of SPIE"
, volume =	634
, year =	1986
, pages =	"86--95"
, update =	"98.07 bibrelex"
}

@article{c-atapd-74
, author =	"J. C. Cavendish"
, title =	"Automatic triangulation of arbitrary planar domains for the finite element method"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	8
, year =	1974
, pages =	"679--696"
}

@article{cff-aatdf-85
, author =	"J. C. Cavendish and D. A. Field and W. H. Frey"
, title =	"An approach to automatic three-dimensional finite element mesh generation"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	21
, year =	1985
, pages =	"329--347"
}

@article{cfm-fbdfe-91
, author =	"J. C. Cavendish and W. H. Frey and S. P. Marin"
, title =	"Feature-Based Design And Finite Element Mesh Generation For Functional Surfaces"
, journal =	"Advances in Engineering Software and Workstations"
, volume =	13
, number =	"5--6"
, month =	sep
, year =	1991
, pages =	"226--237"
, keywords =	"feature based design, finite element mesh generation, functional surfaces, Delaunay surface triangulation, surface modeling systems, downstream mesh generation"
, annote =	"Watson's alg for tri. Constraint edges are forced by
		 ensuring that no generated points falls in their
		 circumcircles."
, abstract =	"This paper describes an approach to feature-based
		 design and feature-based mesh generation for
		 multi-featured functional surfaces. Unlike standard
		 free-form parametric surface representation where the
		 parametric surface patch plays the key role in both
		 surface design and finite element mesh generation, we
		 propose an approach to these two tasks which proceeds
		 from the level of a complete feature (for example, a
		 pocket or channel). The result is a more direct method
		 for modeling functional surface characteristics and a
		 more efficient feature-based implementation of Delaunay
		 surface triangulation. (Author abstract) 10 Refs."
}

@article{c-te-48
, author =	"A. Cayley"
, title =	"On the Theory of Elimination"
, journal =	"Cambridge and Dublin Math. J."
, volume =	3
, year =	1948
, pages =	"116--120"
, update =	"97.11 bibrelex"
}

@article{c-tggr-95
, author =	"A. Cayley"
, title =	"The Theory of Groups Graphical Representation"
, journal =	"Math. Papers"
, volume =	10
, year =	1895
, pages =	"26--28"
, update =	"97.11 bibrelex"
}

@article{c-cpoda-97
, author =	"F. Cazals"
, title =	"Combinatorial properties of one-dimensional arrangements"
, journal =	"Experimental Math."
, volume =	6
, number =	1
, year =	1997
, update =	"98.07 bibrelex"
}

@inproceedings{c-ennsh-98
, author =	"F. Cazals"
, title =	"Effective nearest neighbors searching on the hyper-cube, with a pplications to molecular clustering"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"222--230"
, update =	"98.11 devillers"
}

@inproceedings{cdp-fchcn-95
, author =	"F. Cazals and G. Drettakis and C. Puech"
, title =	"Filtering, clustering and hierarchy construction: a new solution for ray-tracing complex scenes"
, booktitle =	"EG'95"
, site =	"Maastricht, Netherlands"
, year =	1995
, update =	"98.07 bibrelex"
}

@inproceedings{cp-blspd-97
, author =	"F. Cazals and C. Puech"
, title =	"Bucket-like space partitioning data structures with applications to ray tracing"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"11--20"
, cites =	"a-fcagi-94, aeiim-pubtc-85, c-cpoda-97, cdp-fchcn-95, cs-sigte-97, bkos-cge-95, d-lnba-86, d-mddtd-88, glm-othsr-96, jl-rrt-92, ks-frtua-97, bwy-oetac-80, mms-qsrs-94, nhs-gfasm-84, o-cgc-94, ps-cgi-85, s-iggp-76, s-igbmf-93, sd-fbcve-95, sd-csdta-95, w-ltsbv-92, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@unpublished{cs-sigte-97
, author =	"F. Cazals and M. Sbert"
, title =	"Some integral geometry tools to estimate the complexity of 3d scenes"
, year =	1997
, note =	"In preparation"
, update =	"98.07 bibrelex"
}

@article{cd-fsgr-00
, author =	"D. Cazier and J.-F. Dufourd"
, title =	"A formal specification of geometric refinements"
, journal =	"Visual Comput."
, volume =	""
, year =	2000
, pages =	""
, update =	"00.03 devillers"
}

@inproceedings{cd-rsbps-95
, author =	"David Cazier and Jean-Fran{\c c}ois Dufourd"
, title =	"A Rewrite System to Build Planar Subdivisions"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"235--240"
, update =	"00.03 bibrelex, 95.09 jones"
}

@article{cgaf-gstlm-94
, author =	"G. Ceder and G. Garbulsky and D. Avis and K. Fukuda"
, title =	"Ground states of a ternany lattice model with nearest and next-nearest neighbor interactions"
, journal =	"Physical Review B"
, volume =	49
, year =	1994
, pages =	"1--7"
, update =	"98.03 bibrelex"
}

@article{css-mfcud-83
, author =	"Z. J. Cendes and D. N. Shenton and H. Shahnasser"
, title =	"Magnetic Field Computation using {Delaunay} Triangulation and Complementary Finite Element Methods"
, journal =	"IEEE Trans. Magn."
, volume =	"MAG-19"
, number =	6
, year =	1983
, annote =	"Uses incremental switching algorithm. Triangles are
		 refined by adding point at the centroid."
}

@techreport{b-dgs-70
, author =	"Bureau of the Census"
, title =	"The DIME Geocoding System"
, type =	"Report"
, number =	4
, institution =	"U.S. Department of Commerce, Bureau of the Census"
, address =	"Washington"
, year =	1970
, note =	"Census use Study"
, update =	"98.11 bibrelex"
}

@inproceedings{ca-prfr-88
, author =	"R. Chadha and D. Allison"
, title =	"Partitioning rectilinear figures into rectangles"
, booktitle =	"Proc. ACM Annu. Computer Sci. Conf."
, year =	1988
, pages =	"102--106"
, keywords =	"partition, isothetic"
, update =	"95.09 korneenko"
}

@inproceedings{ces-hmpmd-96
, author =	"T. Chadzelek and J. Eckstein and E. Sch{\"o}mer"
, title =	"Heuristic motion planning with many degrees of freedom"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"167--172"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{ces-hmpmo-96
, author =	"T. Chadzelek and J. Eckstein and E. Sch{\"o}mer"
, title =	"Heuristic motion planning with movable obstacles"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"131--136"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@mastersthesis{c-hbvf-95
, author =	"Th. Chadzelek"
, title =	"Heuristische {Bewegungsplanung} mit vielen {Freiheitsgraden}"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Comput. Sci., University Saarland"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1995
, url =	"http://hamster.cs.uni-sb.de/~chadzele/publications/Diplom-Chadzelek.ps.Z"
, keywords =	"master thesis, motion planning, collision detection, heuristic, quaternion"
, update =	"95.09 chadzelek"
}

@techreport{c-hmpmd-95
, author =	"Th. Chadzelek and G. Hotz and E. Sch{\"o}mer"
, title =	"Heuristic Motion Planning with Many Degrees of Freedom"
, type =	"Report"
, number =	"95-08"
, institution =	"Dept. Comput. Sci., University Saarland"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1995
, url =	"http://hamster.cs.uni-sb.de/~chadzele/publications/TechReport.ps.gz"
, keywords =	"motion planning, collision detection, heuristic, quaternion"
, update =	"95.09 chadzelek"
}

@inproceedings{ck-tmaub-95
, author =	"Soo-Won Chae and Jong-Soo Kim"
, title =	"Tetrahedral Meshing Algorithm Using Basic Operators"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"305--319"
, update =	"96.01 samitchell"
}

@article{ckss-crr-81
, author =	"S. Chaiken and D. J. Kleitman and M. Saks and I. Shearer"
, title =	"Covering regions by rectangles"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	2
, number =	4
, year =	1981
, pages =	"394--410"
, keywords =	"isothetic, covering"
, update =	"95.09 korneenko"
}

@article{cl-csptp-91
, author =	"Don Chakerian and Dave Logothetti"
, title =	"Cube Slices, Pictorial Triangles, and Probability"
, journal =	"Math. Mag."
, volume =	64
, year =	1991
, pages =	"219--241"
, update =	"94.05 aich"
}

@article{cf-mpc-86
, author =	"G. D. Chakerian and P. Filliman"
, title =	"The Measures of the Projections of a Cube"
, journal =	"Studia Scientiarum Mathematicum Hungarica"
, volume =	21
, year =	1986
, pages =	"103--110"
, update =	"94.05 aich"
}

@article{cg-fpms-85
, author =	"G. D. Chakerian and M. A. Ghandehari"
, title =	"The {Fermat} problem in {Minkowski} space"
, journal =	"Geom. Dedicata"
, volume =	17
, year =	1985
, pages =	"227--238"
, update =	"98.03 bibrelex"
}

@article{cl-gep-71
, author =	"G. D. Chakerian and L. H. Lange"
, title =	"Geometric extremum problems"
, journal =	"Math. Mag."
, volume =	44
, year =	1971
, pages =	"57--69"
}

@inproceedings{cf-cvbtd-82
, author =	"I. Chakravarty and H. Freeman"
, title =	"Characteristic views as a basis for three-demensional object recognition"
, booktitle =	"Proc. SPIE: Robot Vision"
, volume =	336
, year =	1982
, pages =	"37--45"
, update =	"98.11 bibrelex"
}

@inproceedings{cr-gaha-87
, author =	"S. B. Chalasani and C. S. Raghavendra"
, title =	"Geometric algorithms on a mesh architecture"
, booktitle =	"Computer Architecture in Pattern Analysis and Machine Intelligence"
, site =	"Seattle"
, publisher =	"IEEE Computer Society"
, month =	oct
, year =	1987
, pages =	"169--175"
, keywords =	"parallel computation"
, update =	"97.11 bibrelex, 95.09 korneenko"
}

@article{cfk-fesrd-81
, author =	"L. C. Chalmet and R. L. Francis and A. Kolen"
, title =	"Finding efficient solutions for rectilinear distance location problems efficiently"
, journal =	"European J. Oper. Res."
, volume =	6
, year =	1981
, pages =	"117--124"
, keywords =	"facility location, $L_1$-metric"
, update =	"95.09 korneenko"
}

@inproceedings{cdlss-frceu-96
, author =	"Bradford Chamberlain and Tony DeRose and Dana Lischinski and David Salesin and John Snyder"
, title =	"Fast Rendering of Complex Environments Using a Spatial Hierarchy"
, booktitle =	"Proceedings of Graphics Interface '96"
, year =	1996
, pages =	""
, update =	"98.03 agarwal"
}

@inproceedings{cf-pasdp-91
, author =	"I. W. Chan and D. K. Friesen"
, title =	"Parallel algorithms for some dominance problems based on a {CREW} {PRAM}"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"375--384"
, precedes =	"cf-pasdp-93"
, update =	"96.09 devillers"
}

@article{cf-pasdp-93
, author =	"I. W. Chan and D. K. Friesen"
, title =	"Parallel algorithms for some dominance problems based on the {PRAM} model"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"367--382"
, keywords =	"parallel algorithms, computational geometry, isothetic rectangles, direct dominance"
, succeeds =	"cf-pasdp-91"
, update =	"96.09 devillers"
}

@inproceedings{cl-flwsf-90
, author =	"K. Chan and T. Lam"
, title =	"Finding least-weight subsequences with fewer processors"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"318--327"
, update =	"98.03 bibrelex"
}

@article{ct-hswes-88
, author =	"K. C. Chan and S. T. Tan"
, title =	"Hierarchical structure of winged-edge structure: $A$ conversion algorithm"
, journal =	"Visual Comput."
, volume =	4
, year =	1988
, pages =	"133--141"
, keywords =	"data structuring"
, update =	"95.09 korneenko"
}

@article{cl-olanu-93
, author =	"K. F. Chan and T. W. Lam"
, title =	"An on-line algorithm for navigating in unknown environment"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"227--244"
, keywords =	"on-line algorithms, motion-planning, competitiveness, shortest paths, computational geometry"
, succeeds =	"cl-olanu-91"
, update =	"98.03 mitchell, 96.09 devillers"
, annote =	"They consider on-line navigation among a disjoint set of
                  non-aligned rectangular obstacles, having aspect
                  ratio at most $r$.  They give a strategy that has
                  competitive ratio $({r\over 2}+1)$, and show that
                  this is tight."
}

@inproceedings{cl-olanu-91
, author =	"K. F. Chan and T. W. Lam"
, title =	"An on-line algorithm for navigating in unknown terrain"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"127--136"
, precedes =	"cl-olanu-93"
, update =	"96.09 devillers"
}

@inproceedings{cc-ompa-97
, author =	"K. W. Chan and Francis Y. L. Chin"
, title =	"Optimal Multiresolution Polygonal Approximation"
, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '97"
, site =	"Shanghai, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	1276
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"32--41"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@article{c-nrdma-85
, author =	"M. Y. Chan"
, title =	"A note on redundant disk modulo allocation"
, journal =	"Inform. Process. Lett."
, volume =	20
, year =	1985
, pages =	"121--123"
}

@inproceedings{c-stsar-94
, author =	"T. M. Chan"
, title =	"A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"263--268"
, cites =	"a-fcagi-94, bo-arcgi-79, ce-oails-92, m--83, m-rlsi-81, ps-crrbs-93, e-ftssg-85, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{c-annqr-97
, author =	"Timothy M. Chan"
, title =	"Approximate Nearest Neighbor Queries Revisited"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"352--358"
, cites =	"aesw-emstb-91, am-rsps-93, am-annqf-93, am-ars-95, amnsw-oaann-94, amn-abenn-96, b-acpqh-93, ck-fasgg-93, c-oaitd-92, c-aacpq-94, ks-ntead-96, ms-rscp-93, ps-cgi-85, s-cmsga-91, v-sgagc-91, y-cmstk-82, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{c-adwse-00
, author =	"Timothy M. Chan"
, title =	"Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"300--309"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{c-dpcho-99
, author =	"Timothy M. Chan"
, title =	"Dynamic planar convex hull operations in near-logarithmic amortized time"
, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '99"
, year =	1999
, pages =	"92--99"
, update =	"00.03 smid"
}

@article{c-dpcho-01
, author =	"T. M. Chan"
, title =	"Dynamic planar convex hull operations in near-logarithmic amortized time"
, journal =	"J. ACM"
, volume =	48
, year =	2001
, pages =	"1--12"
, update =	"01.07 smid"
}

@inproceedings{c-fdlpq-96
, author =	"Timothy M. Chan"
, title =	"Fixed-Dimensional Linear Programming Queries Made Easy"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"284--290"
, cites =	"aes-vdsl3-95, am-rsps-93, am-dhsrr-95, as-erasg-95, ako-iqco-93, bcm-prsss-93, cg-fc2a-86, c-osrch-95, c-lvali-95, cm-ltdao-93, dk-dsppu-90, dmn-rass-91, esz-cskec-94, hw-ensrq-87, m-roass-91, m-ept-92, m-rph-92, m-loq-93, m-rsehc-93, m-grs-94, m-ekpc-95, m-gofvc-95, m-apcad-83, m-lpltw-84, ms-rscp-93, m-cgitr-93, p-slpab-90, s-sdlpc-91, st-ecdmp-95, sw-cblpr-92, t-mnlcf-92, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{c-garot-98
, author =	"T. M. Chan"
, title =	"Geometric Applications of a Randomized Optimization Technique"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"269--278"
, update =	"98.07 agarwal"
}

@article{c-garot-99
, author =	"T. M. Chan"
, title =	"Geometric Applications of a Randomized Optimization Technique"
, journal =	"Discrete Comput. Geom."
, volume =	22
, number =	4
, year =	1999
, pages =	"547--567"
, update =	"99.11 held"
}

@article{c-mptca-99
, author =	"T. M. Chan"
, title =	"More planar two-center algorithms"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"189--198"
, update =	"99.11 smid"
}

@inproceedings{c-oesd-98
, author =	"T. M. Chan"
, title =	"On enumerating and selecting distances"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"279--286"
, update =	"00.03 smid"
}

@article{c-oesd-01
, author =	"T. M. Chan"
, title =	"On enumerating and selecting distances"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"291--304"
, update =	"01.07 smid"
}

@inproceedings{c-lac-00
, author =	"Timothy M. Chan"
, title =	"On Levels in Arrangements of Curves"
, booktitle =	"Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS 2000"
, year =	2000
, pages =	"219--227"
, update =	"01.11 pocchiola"
}

@article{c-oosch-96
, author =	"Timothy M. Chan"
, title =	"Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"361--368"
, update =	"98.03 agarwal+smid"
}

% also claimed, pages = "369--388"
@article{c-osrch-96
, author =	"Timothy M. Chan"
, title =	"Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"369--387"
, update =	"98.03 agarwal+smid"
}

@inproceedings{c-rshrr-98
, author =	"T. M. Chan"
, title =	"Random Sampling, Halfspace Range Reporting, and Construction of $(\le k)$-Levels in Three Dimensions"
, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1998
, pages =	"586--595"
, update =	"99.03 agarwal"
}

@article{c-rshrr-00
, author =	"T. M. Chan"
, title =	"Random sampling, halfspace range reporting, and construction of $(\le k)$-levels in three dimensions"
, journal =	"SIAM J. Comput."
, volume =	30
, year =	2000
, pages =	"561--575"
, update =	"01.07 smid"
}

@article{c-rcsiu-00
, author =	"T. M. Chan"
, title =	"Reporting curve segment intersections using restricted predicates"
, journal =	"Comput. Geom. Theory Appl."
, volume =	16
, number =	4
, year =	2000
, pages =	"245--256"
, update =	"01.07 devillers, 01.04 smid"
}

@inproceedings{cgkt-oaars-97
, author =	"T. M. Chan and M. T. Goodrich and S. R. Kosaraju and R. Tamassia"
, title =	"Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"63--75"
, url =	"http://www.cs.brown.edu/cgc/papers/cgkt-oaars-97.ps.gz"
, keywords =	"graph drawing, upward, tree, planar, straight-line, orthogonal, CGC, Brown"
, update =	"98.07 agarwal, 98.03 smid, 97.11 bibrelex, 97.03 tamassia"
}

@inproceedings{csy-oscpf-95
, author =	"Timothy M. Chan and Jack Snoeyink and Chee-Keng Yap"
, title =	"Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped {Voronoi} Diagrams in Three"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"282--291"
, keywords =	"convex hulls, Voronoi diagram, ultimate convex hull algorithm"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@article{csy-pddpo-97
, author =	"T. M. Chan and J. Snoeyink and C. K. Yap"
, title =	"Primal dividing and dual pruning: Output-sensitive construction of $4$-d polytopes and $3$-d {Voronoi} diagrams"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"433--454"
, update =	"98.03 agarwal"
}

@inproceedings{c-osrch-95
, author =	"Timothy M. Y. Chan"
, title =	"Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"10--19"
, cites =	"am-rsps-92, bkst-anmsv-78, bs-dsp1s-80, csy-oscpf-95, c-clps-85, c-chdc-93, ck-acp-70, cm-dosch-92, c-mosga-94, cs-arscg-89, dk-fdpi-83, e-acg-87, es-otatd-91, em-sstcd-90, ew-cbtda-86, ec-eargd-92, g-eadch-72, j-ichfs-73, ks-upcha-86, m-loq-93, m-gofvc-94, ms-rscp-93, m-mnfcp-70, m-lpltw-84, m-osclv-90, m-cgitr-93, o-cgc-94, ol-mcp-81, ph-chfsp-77, ps-cgi-85, r-slcdn-70, r-dcikc-88a, s-chaop-81, s-chdch-86, sw-cblpr-92, s-fchff-85, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
}

% ### What is it?
@misc{c-lrfsf-??
, author =	"W. K. Chan"
, title =	"On the largest {RAT}-free subset of a finite set of points"
, year =	"??"
, pages =	"357--367"
, keywords =	"triangle, points, extremal figures"
, update =	"95.09 korneenko"
, annote =	"RAT is right-angle triangle"
}

@inproceedings{cc-apcmn-92
, author =	"W. S. Chan and F. Chin"
, title =	"Approximation of Polygonal Curves with Minimum Number of Line Segments"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"378--387"
, precedes =	"cc-apcmn-96"
, update =	"96.09 devillers, 94.09 smid, 93.09 milone+mitchell"
}

@article{cc-apcmn-96
, author =	"W. S. Chan and F. Chin"
, title =	"Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"59--77"
, succeeds =	"cc-apcmn-92"
, update =	"96.09 devillers"
}

@inproceedings{cc-afodp-97
, author =	"Wun-Tat Chan and Francis Y. L. Chin"
, title =	"Algorithms for Finding Optimal Disjoint Paths Around a Rectangle"
, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '97"
, site =	"Singapore"
, series =	"Lecture Notes Comput. Sci."
, volume =	1350
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"314--323"
, update =	"99.11 bibrelex, 99.03 bibrelex, 98.07 mitchell, 98.03 mitchell"
}

@inproceedings{cc-eafdp-97
, author =	"W.-T. Chan and F. Y. L. Chin"
, title =	"Efficient algorithms for finding disjoint paths in grids"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Alogrithms"
, year =	1997
, pages =	"454--463"
, update =	"98.07 bibrelex"
}

@article{ck-acp-70
, author =	"D. R. Chand and S. S. Kapur"
, title =	"An algorithm for convex polytopes"
, journal =	"J. ACM"
, volume =	17
, number =	1
, month =	jan
, year =	1970
, pages =	"78--86"
, update =	"98.11 bibrelex"
}

@article{chw-bpgcc-78
, author =	"A. K. Chandra and D. S. Hirschberg and C. K. Wong"
, title =	"Bin packing with geometric constraints in computer network design"
, journal =	"Oper. Res."
, volume =	26
, number =	5
, year =	1978
, pages =	"760--772"
, keywords =	"packing"
, update =	"95.09 korneenko"
}

@article{c-cssmg-94
, author =	"B. Chandra"
, title =	"Constructing sparse spanners for most graphs in higher dimensions"
, journal =	"Inform. Process. Lett."
, volume =	51
, year =	1994
, pages =	"289--294"
, update =	"95.01 smid"
}

@inproceedings{cdns-nsrgs-92
, author =	"B. Chandra and G. Das and G. Narasimhan and J. Soares"
, title =	"New sparseness results on graph spanners"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"192--201"
, precedes =	"cdns-nsrgs-95"
, cites =	"addjs-sswg-93, a-cns-85, ap-sp-90, bd-rstod-86, bclr-ostm-86, b-egt-78, c-tipga-86, d-ascg-90, dj-wtacg-89, d-ntpcg-59, dfs-dgaag-90, k-aceg-88, kg-cgwac-92, ll-tapga-89, ps-gs-89, pu-osh-89, pu-tbser-88, r-cpscn-55, r-css-63, rs-addce-91, s-cmsga-91, s-aedsd-92, s-s-91, v-sgagc-91, v-mstkd-88, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers, 94.05 smid"
}

@article{cdns-nsrgs-95
, author =	"B. Chandra and G. Das and G. Narasimhan and J. Soares"
, title =	"New sparseness results on graph spanners"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"125--144"
, keywords =	"spanners, geometric graphs, greedy algorithm, transformational method, sparse spanners, euclidean graphs"
, succeeds =	"cdns-nsrgs-92"
, update =	"96.09 devillers"
}

@article{ckt-nroko-99
, author =	"B. Chandra and H. Karloff and C. Tovey"
, title =	"New results on the old $k$-opt algorithm for the traveling salesman problem"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1999
, pages =	"1998--2029"
, update =	"00.03 smid"
}

@inproceedings{ckt-nroko-94
, author =	"B. Chandra and H. Karloff and C. Tovey"
, title =	"New results on the old $k$-opt algorithm for the {TSP}"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"150--159"
, update =	"97.07 smid"
}

@techreport{cv-crcns-91
, author =	"B. Chandra and S. Vishwanathan"
, title =	"Constructing reliable communication networks of small weight on-line"
, type =	"Manuscript"
, institution =	"??"
, year =	1991
, update =	"97.11 bibrelex"
}

@article{cm-paeet-92
, author =	"S. Chandran and D. M. Mount"
, title =	"A parallel algorithm for enclosed and enclosing triangles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"191--214"
, keywords =	"minimum enclosures, convex polygons, parallel algorithms, rotating calipers"
, update =	"93.05 jones"
}

@article{c-we1cp-82
, author =	"R. Chandrasekaran"
, title =	"The weighted {Euclidean} $1$-center problem"
, journal =	"Oper. Res. Lett."
, volume =	1
, number =	3
, year =	1982
, pages =	"111--112"
, keywords =	"facility location, $d$-dimensional, linear programming"
, update =	"95.09 korneenko"
}

@article{ct-aofwl-90
, author =	"R. Chandrasekaran and A. Tamir"
, title =	"Algebraic optimization: the {Fermat}-{Weber} location problem"
, journal =	"Math. Program."
, volume =	46
, number =	2
, year =	1990
, pages =	"219--224"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@techreport{cd-cpo-87
, author =	"V. Chandru and D. Dutta"
, title =	"Composition of planar offsets"
, type =	"Technical {Report}"
, institution =	"Purdue Univ."
, address =	"W. Lafayette, IN"
, month =	jun
, year =	1987
, update =	"93.09 milone+mitchell"
}

@article{cdh-gdc-89
, author =	"V. Chandru and D. Dutta and C. Hoffmann"
, title =	"On the geometry of Dupin cyclides"
, journal =	"Visual Comput."
, volume =	5
, year =	1989
, pages =	"227--290"
}

@techreport{cgmrs-namlp-90
, author =	"V. Chandru and S. K. Ghosh and A. Maheshwari and V. T. Rajan and S. Saluja"
, title =	"{$NC$}-algorithms for minimum link path and related problems"
, type =	"Technical {Report}"
, number =	"CS-90/3"
, institution =	"TATA inst."
, address =	"Bombay, India"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{cgmrs-namlp-95
, author =	"V. Chandru and S. K. Ghosh and A. Maheshwari and V. T. Rajan and S. Saluja"
, title =	"{$NC$}-algorithms for minimum link path and related problems"
, journal =	"J. Algorithms"
, volume =	19
, year =	1995
, pages =	"173--203"
, update =	"97.03 smid"
}

@inproceedings{crs-mpc-90
, author =	"V. Chandru and V. T. Rajan and R. Swaminathan"
, title =	"Monotone pieces of chains"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"156--159"
, cites =	"ll-ccmp-84, ZZZ"
, update =	"98.07 bibrelex"
}

@article{crs-mpc-92
, author =	"V. Chandru and V. T. Rajan and R. Swaminathan"
, title =	"Monotone Pieces of Chains"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"439--446"
, succeeds =	"crs-mpc-90"
, update =	"98.03 mitchell"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@techreport{cs-hdcg-87
, author =	"V. Chandru and R. Samuel"
, title =	"How to draw a circumscribing gleichdick"
, type =	"Technical {Report}"
, number =	"CC-87-36"
, institution =	"School Indust. Engrg., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1987
}

@inproceedings{cv-chosp-91
, author =	"V. Chandru and R. Venkataraman"
, title =	"Circular hulls and orbiforms of simple polygons"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"433--440"
}

@article{cld-sgcpm-82
, author =	"C. C. Chang and R. C. T. Lee and M. W. Du"
, title =	"Symbolic gray code as a perfect multiattribute hashing scheme for partial match queries"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-8"
, year =	1982
, pages =	"235--249"
}

@inproceedings{cy-wafi-97
, author =	"E.-C. Chang and C. K. Yap"
, title =	"A wavelet approach to foveating images"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"397--399"
, cites =	"awb-av-88, b-ap-88, b-msvav-92, crd-isasv-96, hw-rffam-68, hw-srgoc-74, j-euimp-89, kg-ifics-96, r-svcvc-89, rs-dcsvv-90, s-dsvpm-77, s-smpsp-77, sgb-svavd-95, wbs-vbvct-92, ZZZ"
, update =	"98.07 agarwal+bibrelex, 97.07 efrat"
}

@article{cst-nddds-92
, author =	"F. R. K. Chang and E. Szemeredi and W. T. Trotter"
, title =	"The number of different distances determined by a set of points in the {Euclidean} plane"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"1--11"
}

@article{cgs-icmcm-89
, author =	"G. Chang and W. Guida and W. Still"
, title =	"An internal coordinate {Monte}-{Carlo} method for searching conformational space"
, journal =	"J. Amer. Chem. Soc."
, volume =	111
, year =	1989
, pages =	"4379--4386"
, update =	"98.07 bibrelex"
}

@inproceedings{cm-euleg-93
, author =	"J. Chang and V. Milenkovic"
, title =	"An experiment using {LN} for exact geometric computations"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"67--72"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation, exact arithmetic"
, cites =	"m-cacau-89, dbs-gttd-92, fm-nsala-91, fv-eeacg-93, h-gsm-89, kln-edtur-91, m-vigau-88t, m-cacau-89, m-rfldd-90, m-rflp-89, fw-lnum-93, si-cvdom-89, f-pcg-93, ZZZ"
, update =	"98.11 bibrelex, 97.03 daniels, 93.09 milone+mitchell"
}

@article{cf-ekdtd-81
, author =	"J. M. Chang and K. S. Fu"
, title =	"Extended {$K$}-d tree database organization: a dynamic multiattribute clustering method"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-7"
, year =	1981
, pages =	"284--290"
}

@techreport{c-pop-86
, author =	"J. S. Chang"
, title =	"Polygon optimization problems"
, type =	"Report"
, number =	240
, institution =	"Comput. Sci. Div., New York Univ."
, address =	"New York, NY"
, year =	1986
}

@inproceedings{cy-psppo-84
, author =	"J. S. Chang and C. K. Yap"
, title =	"A polynomial solution for the potato-peeling and other polygon inclusion and enclosure problems"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"408--416"
, precedes =	"cy-psppp-86"
}

@article{cy-psppp-86
, author =	"J. S. Chang and C. K. Yap"
, title =	"A polynomial solution for the potato-peeling problem"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"155--182"
, succeeds =	"cy-psppo-84"
}

@article{cht-oacov-90
, author =	"Maw Shang Chang and Nen-Fu Huang and Chuan-Yi Tang"
, title =	"An Optimal Algorithm For Constructing Oriented {Voronoi} Diagrams And Geographic Neighborhood Graphs"
, journal =	"Inform. Process. Lett."
, volume =	35
, number =	5
, month =	aug
, year =	1990
, pages =	"255--260"
, keywords =	"computational geometry, Voronoi diagrams, geographic neighborhood graphs"
, update =	"97.07 smid"
, annote =	"OVD is just a cdfVD with a wedge shaped distance
		 function. Sweepline algorithm given."
, abstract =	"Given n points on the plane, we propose an O(n log n)
		 algorithm to construct the oriented Voronoi diagram and
		 the geographic neighborhood graph of these n points. We
		 also show that both problems have the same lower bound
		 of Omega (n log n) and hence the proposed algorithm is
		 optimal. (Author abstract) 4 Refs."
}

@article{ctl-sebmp-92
, author =	"M. S. Chang and C. Y. Tang and C. T. Lee"
, title =	"Solving the {Euclidean} Bottleneck Matching Problem by $k$-Relative Neighborhood Graphs"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"177--194"
, update =	"96.05 efrat"
}

@inproceedings{ctl-20rng-90
, author =	"M. S. Chang and C. Y. Tang and R. C. T. Lee"
, title =	"$20$-relative neighborhood graphs are {Hamiltonian}"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"53--65"
}

@article{cl-fmsic-92
, author =	"R. C. Chang and H. S. Lee"
, title =	"Finding a maximal set of independent chords in a circle"
, journal =	"Inform. Process. Lett."
, volume =	41
, number =	2
, year =	1992
, pages =	"99--102"
, keywords =	"geometric graphs, polygons, decomposition"
, update =	"95.09 korneenko"
}

@article{cl-omsta-86
, author =	"R. C. Chang and R. C. T. Lee"
, title =	"An {$O(n \log n)$} minimal spanning tree algorithm for $n$ points in the plane"
, journal =	"BIT"
, volume =	26
, year =	1986
, pages =	"7--16"
, annote =	"See \cite{sl-pdcms-88} for a discussion of lots of
		 errors."
}

@article{cl-aldt-84
, author =	"R. C. Chang and R. C. T. Lee"
, title =	"On the average length of {Delaunay} triangulations"
, journal =	"BIT"
, volume =	24
, year =	1984
, pages =	"269--273"
}

@article{cl-acpac-84
, author =	"R. C. Chang and R. C. T. Lee"
, title =	"The average-case performance analysis of a closest-pair problem"
, journal =	"Internat. J. Comput. Math."
, volume =	16
, number =	2
, year =	1984
, pages =	"125--130"
, keywords =	"proximity, average-case analysis"
, update =	"95.09 korneenko"
}

@book{cgglmw-fltim-92
, author =	"B. W. Char and K. O. Geddes and G. H. Gonnet and B. L. Leong and M. B. Monagan and S. M. Watt"
, title =	"First leaves: a tutorial introduction to Maple {V}"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1992
, update =	"00.03 bibrelex"
}

@book{cgglmw-m5lrm-91
, author =	"B. W. Char and K. O. Geddes and G. H. Gonnet and B. L. Leong and M. B. Monagan and S. M. Watt"
, title =	"Maple {V} Language Reference Manual"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1991
, update =	"98.11 bibrelex, 96.09 agarwal, 95.05 agarwal"
}

@book{cgglmw-mvlrm-91
, author =	"Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet and Benton L. Leong and Micheal B. Monagan and Stephen M. Watt"
, title =	"Maple V Language Reference Manual"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1991
, update =	"00.03 bibrelex"
}

@inproceedings{ccfm-icdir-97
, author =	"Moses Charikar and Chandra Chekuri and Tom{\'a}s Feder and Rajeev Motwani"
, title =	"Incremental Clustering and Dynamic Information Retrieval"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, year =	1997
, pages =	"626--635"
, update =	"98.07 agarwal+bibrelex"
}

@inproceedings{ccgg-rvtda-98
, author =	"M. Charikar and C. Chekuri and A. Goel and S. Guha"
, title =	"Rounding via trees: {D}eterministic approximation algorithms for group {S}teiner trees and $k$-median"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, year =	1998
, pages =	"114--123"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{cg-icafl-99
, author =	"M. Charikar and S. Guha"
, title =	"Improved combinatorial algorithms for facility location and $k$-median problems"
, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1999
, pages =	"378--388"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{cgts-cfaak-99
, author =	"M. Charikar and S. Guha and E. Tardos and D. Shmoys"
, title =	"A constant-factor approximation algorithm for the $k$-median problem"
, booktitle =	"Proc. 31st Annu. ACM Sympos. Theory Comput."
, year =	1999
, pages =	"1--10"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{chm-dsp-98
, author =	"Moses Charikar and Dan Halperin and Rajeev Motwani"
, title =	"The Dynamic Servers Problem"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"410--419"
, keywords =	"minimum-length monotone subdivision, approximation algorithms"
, update =	"99.07 bibrelex, 98.07 mitchell"
}

@article{c-odlp-52
, author =	"A. Charnes"
, title =	"Optimality and degeneracy in linear programming"
, journal =	"Econometrica"
, volume =	20
, number =	2
, year =	1952
, pages =	"160--170"
, update =	"98.03 bibrelex"
}

@article{cg-pspca-84
, author =	"P. Charrot and J. A. Gregory"
, title =	"A pentagonal surface patch for computer aided geometric design"
, journal =	"Comput. Aided Design"
, volume =	1
, year =	1984
, pages =	"87--94"
, update =	"98.03 bibrelex"
}

@book{co-aagt-93
, author =	"G. Chartrand and O. R. Oellermann"
, title =	"Applied and Algorithmic Graph Theory"
, publisher =	"McGraw-Hill"
, address =	"New York"
, year =	1993
}

@inproceedings{c-dcgaa-89
, author =	"J.-M. Chassery"
, title =	"Discrete and computational geometric approaches applied to a problem of finite approximation"
, booktitle =	"Proc. Scand. Conf. Image Anal."
, site =	"Oulu, Finland"
, volume =	2
, year =	1989
, pages =	"856--859"
, keywords =	"convex, fitting, discrete geometry"
, update =	"95.09 korneenko"
}

@inproceedings{cg-ipcis-83
, author =	"J. M. Chassery and C. Garbay"
, title =	"Iterative process for colour image segmentation using a convexity criterion"
, editor =	"A. Oosterline and A. G. Tescher"
, booktitle =	"Applications of Digital Image Processing"
, series =	"Proc. SPIE"
, volume =	397
, publisher =	"??"
, year =	1983
, pages =	"165--172"
}

@inproceedings{cm-smvde-89
, author =	"J.-M. Chassery and A. Montanvert"
, title =	"Segmentation methods in a {Voronoi} diagram environment"
, booktitle =	"Proc. Scand. Conf. Image Anal."
, site =	"Oulu, Finland"
, volume =	1
, year =	1989
, pages =	"408--415"
, keywords =	"Voronoi diagram"
, update =	"95.09 korneenko"
}

@article{cc-nfepm-90
, author =	"S. Chatterjee and S. Chatterjee"
, title =	"A note on finding extreme points in multivariare space"
, journal =	"Comput. Statist. Data Anal."
, volume =	10
, number =	1
, year =	1990
, pages =	"87--92"
, keywords =	"convex hull, $d$-dimensional, peeling, extremal points"
, update =	"95.09 korneenko"
}

@article{cd-kdcp-90
, author =	"S. Chattopadhyay and P. Das"
, title =	"The {$k$}-dense corridor problems"
, journal =	"Pattern Recogn. Lett."
, volume =	11
, year =	1990
, pages =	"463--469"
, update =	"98.11 bibrelex"
}

@article{cd-ctbtc-91
, author =	"S. Chattopadhyay and P. P. Das"
, title =	"Counting thin and bushy triangulations of convex polygons"
, journal =	"Pattern Recogn. Lett."
, volume =	12
, year =	1991
, pages =	"139--144"
, update =	"95.09 korneenko, 93.09 milone+mitchell"
, annote =	"Computes formulae for number of thin triangulations (2
		 ears) and bushy triangulations (max ears) of a convex
		 polygon."
}

@inproceedings{c-fbfpf-98
, author =	"Vasiliki Chatzi"
, title =	"Finding Basis Functions for Pyramidal Finite Elements"
, booktitle =	"CGC Workshop on Geometric Computing"
, year =	1998
, url =	"http://www.cs.brown.edu/cgc/cgc98/"
, update =	"98.11 tamassia"
}

@article{c-fchdt-91
, author =	"B. B. Chaudhuri"
, title =	"Fuzzy convex hull determination in two-dimensional space"
, journal =	"Pattern Recogn. Lett."
, volume =	12
, number =	10
, year =	1991
, pages =	"591--594"
, keywords =	"convex hull"
, update =	"95.09 korneenko"
}

@article{c-ocfod-90
, author =	"B. B. Chaudhuri"
, title =	"Optimal circular fit to objects in two and hree dimensions"
, journal =	"Pattern Recogn. Lett."
, volume =	11
, year =	1990
, pages =	"571--574"
, update =	"98.11 bibrelex"
}

@article{ck-ocfwd-93
, author =	"B. B. Chaudhuri and P. Kundu"
, title =	"Optimum circular fit to weighted data in multi-dimensional space"
, journal =	"Pattern Recogn. Lett."
, volume =	14
, year =	1993
, pages =	"1--6"
, update =	"98.11 bibrelex"
}

@inproceedings{cn-lerps-99
, author =	"J. Chaudhuri and S. C. Nandy"
, title =	"Largest empty rectangle among a point set"
, booktitle =	"Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1738
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"34--46"
, update =	"00.03 smid"
}

@article{c-dpopp-83
, author =	"Bernard Chazelle"
, title =	"A decision procedure for optimal polyhedron partitioning"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, pages =	"75--78"
, update =	"98.03 mitchell"
}

@inproceedings{c-fdams-97
, author =	"Bernard Chazelle"
, title =	"A Faster Deterministic Algorithm for Minimum Spanning Trees"
, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '97"
, year =	1997
, pages =	"To appear"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@techreport{c-fadsi-85
, author =	"Bernard Chazelle"
, title =	"A functional approach to data structures and its use in multidimensional searching"
, type =	"Report"
, number =	"CS-85-16"
, institution =	"Comput. Sci. Dept., Brown Univ."
, address =	"Providence, RI"
, year =	1985
, precedes =	"c-fadsi-88"
, update =	"98.03 mitchell"
}

@article{c-fadsi-88
, author =	"Bernard Chazelle"
, title =	"A functional approach to data structures and its use in multidimensional searching"
, journal =	"SIAM J. Comput."
, volume =	17
, number =	3
, month =	jun
, year =	1988
, pages =	"427--462"
, succeeds =	"c-fadsi-85"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@techreport{c-sptgd-93
, author =	"Bernard Chazelle"
, title =	"A Simple Proof Technique for Geometric Discrepancy"
, institution =	"Princeton University"
, month =	feb
, year =	1993
, comments =	"DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
, update =	"93.09 milone+mitchell"
}

@inproceedings{c-salb-94
, author =	"Bernard Chazelle"
, title =	"A spectral approach to lower bounds"
, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1994
, pages =	"674--682"
, update =	"98.03 mitchell, 95.01 matousek+smid"
}

@article{c-salb-98
, author =	"Bernard Chazelle"
, title =	"A spectral approach to lower bounds with applications to geometric searching"
, journal =	"SIAM J. Comput."
, volume =	27
, number =	2
, year =	1998
, pages =	"545--556"
, update =	"98.11 pocchiola"
}

@inproceedings{c-tpca-82
, author =	"Bernard Chazelle"
, title =	"A theorem on polygon cutting with applications"
, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1982
, pages =	"339--349"
, keywords =	"decomposition, polygons, divide-and-conquer, triangulation, visibility"
, update =	"98.03 mitchell"
}

@inproceedings{c-acdl-83
, author =	"Bernard Chazelle"
, title =	"Algorithms for computing depths and layers"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1983
, pages =	"427--436"
, keywords =	"points, convex"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@article{c-asdii-88
, author =	"Bernard Chazelle"
, title =	"An algorithm for segment-dragging and its implementation"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"205--221"
, update =	"98.03 mitchell"
}

@article{c-iafrn-83
, author =	"Bernard Chazelle"
, title =	"An improved algorithm for the fixed-radius neighbor problem"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, pages =	"193--198"
, update =	"98.03 mitchell"
}

@inproceedings{c-oaitd-89
, author =	"Bernard Chazelle"
, title =	"An optimal algorithm for intersecting three-dimensional convex polyhedra"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"586--591"
, keywords =	"intersection, polyhedra, polytopes, duality, convex hulls, Voronoi diagrams"
, precedes =	"c-oaitd-92"
, update =	"98.03 mitchell, 93.09 devillers"
}

@article{c-oaitd-92
, author =	"Bernard Chazelle"
, title =	"An optimal algorithm for intersecting three-dimensional convex polyhedra"
, journal =	"SIAM J. Comput."
, volume =	21
, number =	4
, year =	1992
, pages =	"671--696"
, succeeds =	"c-oaitd-89"
, update =	"98.03 mitchell, 93.09 devillers"
}

@techreport{c-oaitd-89t
, author =	"B. Chazelle"
, title =	"An optimal algorithms for intersecting three-dimensional convex polyhedra"
, type =	"Technical {Report}"
, institution =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	1989
, update =	"98.03 bibrelex"
}

@inproceedings{c-ochan-91
, author =	"Bernard Chazelle"
, title =	"An optimal convex hull algorithm and new results on cuttings"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"29--38"
, update =	"98.03 mitchell"
}

@techreport{c-ochap-91
, author =	"Bernard Chazelle"
, title =	"An optimal convex hull algorithm for point sets in any fixed dimension"
, type =	"Technical {Report}"
, number =	"CS-TR-336-91"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1991
, update =	"98.03 mitchell"
}

@article{c-ochaa-93
, author =	"Bernard Chazelle"
, title =	"An optimal convex hull algorithm in any fixed dimension"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"377--409"
, succeeds =	"c-ochan-91"
, update =	"98.03 mitchell, 94.05 matousek"
}

@incollection{c-ads-87
, author =	"Bernard Chazelle"
, title =	"Approximation and decomposition of shapes"
, editor =	"J. T. Schwartz and C.-K. Yap"
, booktitle =	"Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
, publisher =	"Lawrence Erlbaum Associates"
, address =	"Hillsdale, NJ"
, year =	1987
, pages =	"145--185"
, keywords =	"survey paper, polygons, two-dimensional, three-dimensional, approximation, decomposition, covering, partition, triangulation"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{c-cgr-94
, author =	"Bernard Chazelle"
, title =	"Computational Geometry: A Retrospective"
, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"75--94"
, update =	"98.03 mitchell, 95.01 smid, 94.05 matousek"
}

@incollection{c-cgr-95
, author =	"Bernard Chazelle"
, title =	"Computational geometry: a retrospective"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, year =	1995
, pages =	"22--46"
, keywords =	"survey paper"
, update =	"98.07 icking, 98.03 mitchell, 97.11 bibrelex, 97.03 pocchiola, 96.05 pocchiola"
}

@phdthesis{c-cgc-79
, author =	"Bernard Chazelle"
, title =	"Computational geometry and convexity"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Yale Univ."
, address =	"New Haven, CT"
, year =	1979
, note =	"Carnegie-Mellon Univ. Report CS-80-150"
, keywords =	"doctoral thesis"
, comments =	"UMI KRA81-10021, 313 pp."
, update =	"98.03 mitchell, 93.09 jones, 93.05 jones"
}

@incollection{c-cggof-91
, author =	"Bernard Chazelle"
, title =	"Computational geometry for the gourmet: old fare and new dishes"
, booktitle =	"Automata, Languages and Programming (Proc. 18th ICALP)"
, series =	"Lecture Notes Comput. Sci."
, volume =	510
, year =	1991
, pages =	"686--696"
, update =	"98.03 mitchell, 97.03 aronov, 94.05 matousek"
}

@article{c-cgsc-84
, author =	"Bernard Chazelle"
, title =	"Computational Geometry on a Systolic Chip"
, journal =	"IEEE Trans. Comput."
, volume =	"C-33"
, number =	9
, month =	sep
, year =	1984
, pages =	"774--785"
, keywords =	"parallel computation, VLSI design"
, update =	"98.03 mitchell, 93.09 held"
}

@inproceedings{c-cftvc-84
, author =	"Bernard Chazelle"
, title =	"Computing on a free tree via complexity preserving mappings"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"358--368"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{c-cftcp-87
, author =	"Bernard Chazelle"
, title =	"Computing on a free tree via complexity-preserving mappings"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"337--361"
, update =	"98.03 mitchell"
}

@inproceedings{c-cdp-81
, author =	"Bernard Chazelle"
, title =	"Convex decompositions of polyhedra"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
, year =	1981
, pages =	"70--79"
, precedes =	"c-cpplb-84"
, update =	"98.03 mitchell"
}

@article{c-cpplb-84
, author =	"Bernard Chazelle"
, title =	"Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm"
, journal =	"SIAM J. Comput."
, volume =	13
, year =	1984
, pages =	"488--507"
, succeeds =	"c-cdp-81"
, update =	"98.03 mitchell"
}

@inproceedings{c-ccdga-84
, author =	"Bernard Chazelle"
, title =	"Criticality considerations in the design of geometric algorithms"
, booktitle =	"Proc. 22nd Allerton Conf. Commun. Control Comput."
, year =	1984
, pages =	"71--80"
, update =	"98.03 mitchell"
}

@techreport{c-chdc-91
, author =	"Bernard Chazelle"
, title =	"Cutting hyperplanes for divide-and-conquer"
, type =	"Manuscript"
, institution =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	1991
, keywords =	"partition, divide-and-conquer, hyperplanes"
, update =	"98.03 mitchell"
}

@article{c-chdc-93
, author =	"Bernard Chazelle"
, title =	"Cutting hyperplanes for divide-and-conquer"
, journal =	"Discrete Comput. Geom."
, volume =	9
, number =	2
, year =	1993
, pages =	"145--158"
, keywords =	"partition, divide-and-conquer, hyperplanes"
, succeeds =	"c-chdc-91"
, update =	"98.03 mitchell, 93.09 matousek"
}

@techreport{c-ept-90
, author =	"Bernard Chazelle"
, title =	"Efficient Polygon Trinangulation"
, number =	"CS-TR-249-90"
, institution =	"Princeton Univ."
, year =	1990
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{c-fsram-84
, author =	"B. Chazelle"
, title =	"Fast searching in a real algebraic manifold with applications to geometric complexity"
, type =	"Technical {Report}"
, number =	"84-13"
, institution =	"Dept. Comput. Sci., Brown Univ."
, address =	"Providence, RI"
, year =	1984
, update =	"98.07 bibrelex"
}

@inproceedings{c-fsram-85
, author =	"Bernard Chazelle"
, title =	"Fast searching in a real algebraic manifold with applications to geometric complexity"
, booktitle =	"Proc. Internat. Colloq. on Trees in Algebra and Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	185
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"145--156"
, update =	"98.03 mitchell"
}

@inproceedings{c-fsnaq-83
, author =	"Bernard Chazelle"
, title =	"Filtering search: {A} new approach to query-answering"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"122--132"
, precedes =	"c-fsnaq-86"
, update =	"98.03 mitchell, 97.07 agarwal"
}

@article{c-fsnaq-86
, author =	"Bernard Chazelle"
, title =	"Filtering search: a new approach to query-answering"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"703--724"
, succeeds =	"c-fsnaq-83"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{c-gcdm-99
, author =	"Bernard Chazelle"
, title =	"Geometric Complexity and the Discrepancy Method"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"21--23"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{c-gdr-93
, author =	"Bernard Chazelle"
, title =	"Geometric Discrepancy Revisited"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"392--399"
, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@incollection{c-hsh-83
, author =	"Bernard Chazelle"
, title =	"How to search in history"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	158
, year =	1983
, pages =	"52--63"
, precedes =	"c-hsh-85"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@article{c-hsh-85
, author =	"Bernard Chazelle"
, title =	"How to search in history"
, journal =	"Inform. Control"
, volume =	64
, year =	1985
, pages =	"77--99"
, keywords =	"data structuring, search, dynamizing"
, succeeds =	"c-hsh-83"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@inproceedings{c-iies-84
, author =	"Bernard Chazelle"
, title =	"Intersecting is easier than sorting"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"125--134"
, precedes =	"c-rcsi-86"
, update =	"98.03 mitchell"
}

@inproceedings{c-lbolr-95
, author =	"Bernard Chazelle"
, title =	"Lower bounds for off-line range searching"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, year =	1995
, pages =	"733--740"
, update =	"98.03 mitchell, 95.09 smid"
}

@article{c-lbolr-97
, author =	"B. Chazelle"
, title =	"Lower bounds for off-line range searching"
, journal =	"Discrete Comput. Geom."
, volume =	17
, number =	1
, year =	1997
, pages =	"53--66"
, update =	"98.07 bibrelex"
}

@article{c-lbors1-90
, author =	"Bernard Chazelle"
, title =	"Lower bounds for orthogonal range searching, {I}: {T}he reporting case"
, journal =	"J. ACM"
, volume =	37
, year =	1990
, pages =	"200--212"
, succeeds =	"c-lbcms-86"
, precedes =	"c-lbors2-90"
, update =	"98.03 mitchell, 97.07 agarwal"
}

@article{c-lbors2-90
, author =	"Bernard Chazelle"
, title =	"Lower bounds for orthogonal range searching, {II}: {T}he arithmetic model"
, journal =	"J. ACM"
, volume =	37
, year =	1990
, pages =	"439--463"
, succeeds =	"c-lbors1-90"
, update =	"98.03 mitchell, 97.07 agarwal"
}

@inproceedings{c-lbcms-86
, author =	"Bernard Chazelle"
, title =	"Lower bounds on the complexity of multidimensional searching"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"87--96"
, precedes =	"c-lbors1-90"
, update =	"98.03 mitchell"
}

@article{c-lbcpr-89
, author =	"Bernard Chazelle"
, title =	"Lower bounds on the complexity of polytope range searching"
, journal =	"J. Amer. Math. Soc."
, volume =	2
, year =	1989
, pages =	"637--666"
, keywords =	"simplex range searching, integral geometry, lower bounds"
, succeeds =	"c-prsig-87"
, update =	"98.03 mitchell"
}

@inproceedings{c-ntcos-85
, author =	"Bernard Chazelle"
, title =	"New techniques for computing order statistics in {Euclidean} space"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"125--134"
, precedes =	"c-stgsi-87"
, cites =	"bs-dcms-76, bfprt-tbs-73, bddg-fep-82, cgl-pgd-83, cw-mvdbs-84, c-sssl-83, dl-msp-76, eos-calha-83, fj-csrxm-82, fj-fkppc-83, fj-gsrsm-84, gm-fsapo-79, h-acca-77, jm-sktex-78, mt-fmvdb-83, mtzc-oaktn-81, oamb-oafme-84, ph-chfsp-77, s-gspi-76, t-oacmv-83, y-cmstk-82, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
}

@article{c-clps-85
, author =	"Bernard Chazelle"
, title =	"On the convex layers of a planar set"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-31"
, number =	4
, month =	jul
, year =	1985
, pages =	"509--517"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@inproceedings{c-pt-90i
, author =	"B. Chazelle"
, title =	"Polygon Triangulation"
, booktitle =	"Proceedings of FOCCS"
, year =	1990
, precedes =	"c-ept-90, c-tsplt-90t"
, update =	"98.07 bibrelex"
}

@inproceedings{c-prsig-87
, author =	"Bernard Chazelle"
, title =	"Polytope range searching and integral geometry"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"1--10"
, precedes =	"c-lbcpr-89"
, update =	"98.03 mitchell"
}

@article{c-rcsi-86
, author =	"Bernard Chazelle"
, title =	"Reporting and counting segment intersections"
, journal =	"J. Comput. Syst. Sci."
, volume =	32
, year =	1986
, pages =	"156--182"
, succeeds =	"c-iies-84"
, update =	"98.03 mitchell"
}

@inproceedings{c-sdssf-85
, author =	"Bernard Chazelle"
, title =	"Slimming down search structures: {A} functional approach to algorithm design"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"165--174"
, keywords =	"searching, data structuring"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@article{c-stgsi-87
, author =	"Bernard Chazelle"
, title =	"Some techniques for geometric searching with implicit set representations"
, journal =	"Acta Inform."
, volume =	24
, year =	1987
, pages =	"565--582"
, succeeds =	"c-ntcos-85"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@article{c-blbph-83
, author =	"Bernard Chazelle"
, title =	"The bottom-left bin-packing heuristic: an efficient implementation"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, year =	1983
, pages =	"697--707"
, update =	"98.03 mitchell"
}

@incollection{c-pcp-83
, author =	"Bernard Chazelle"
, title =	"The Polygon Containment Problem"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"1--33"
, update =	"01.04 icking, 98.03 mitchell"
}

@techreport{c-ptapv-82
, author =	"Bernard Chazelle"
, title =	"The power of triangulation: applications to problems of visibility and internal distance"
, type =	"Report"
, number =	"CMU-CS-82-121"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1982
, update =	"98.03 mitchell"
}

@techreport{c-tbsns-88
, author =	"Bernard Chazelle"
, title =	"Tight bounds on the stabbing number of spanning trees in {Euclidean} space"
, type =	"Report"
, number =	"CS-TR-155-88"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1988
, update =	"98.03 mitchell"
}

@techreport{c-tsplt-90t
, author =	"Bernard Chazelle"
, title =	"Triangulating a simple polygon in linear time"
, type =	"Technical {Report}"
, number =	"CS-TR-264-90"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1990
, succeeds =	"c-pt-90i"
, precedes =	"c-tsplt-90i"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{c-tsplt-90i
, author =	"Bernard Chazelle"
, title =	"Triangulating a simple polygon in linear time"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"220--230"
, succeeds =	"c-tsplt-90t"
, precedes =	"c-tsplt-91a"
, update =	"98.03 mitchell"
}

@article{c-tsplt-91a
, author =	"Bernard Chazelle"
, title =	"Triangulating a simple polygon in linear time"
, journal =	"Discrete Comput. Geom."
, volume =	6
, number =	5
, year =	1991
, pages =	"485--524"
, succeeds =	"c-tsplt-90i"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@inproceedings{c-vigt-82
, author =	"Bernard Chazelle"
, title =	"{VLSI} implementations of geometric tasks"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1982
, pages =	"615--624"
, keywords =	"parallel computation"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@techreport{cb-tsnis-92
, author =	"Bernard Chazelle and R. Bar-Yehuda"
, title =	"Triangulating a set of non-intersecting and simple polygonal chains"
, type =	"Technical {Report}"
, year =	1992
, keywords =	"simple polygons, visibility, triangulation"
, precedes =	"bc-tdjc-94"
, update =	"98.03 mitchell, 95.09 mitchell, 93.09 milone+mitchell"
}

@techreport{ccpy-nubns-84
, author =	"Bernard Chazelle and R. Cole and F. P. Preparata and C. K. Yap"
, title =	"New upper bounds for neighbor searching"
, number =	"CS-84-11"
, institution =	"Brown Univ."
, address =	"Providence, RI"
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ccpy-nubns-86
, author =	"Bernard Chazelle and R. Cole and F. P. Preparata and C. K. Yap"
, title =	"New upper bounds for neighbor searching"
, journal =	"Inform. Control"
, volume =	68
, year =	1986
, pages =	"105--124"
, keywords =	"locus approach, reporting, subdivisions, points, circles"
, succeeds =	"cp-hrsaa-85"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{cdhmst-sdtlt-01
, author =	"Bernard Chazelle and Olivier Devillers and Ferran Hurtado and Merc{\`e} Mora and Vera Sacrist{\'a}n and Monique Teillaud"
, title =	"Splitting a {Delaunay} Triangulation in Linear Time"
, booktitle =	"Proc. 9th. European Symposiun on Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	2161
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"312--320"
, update =	"01.11 devillers"
}

@article{cdst-spsde-97
, author =	"Bernard Chazelle and D. Dobkin and N. Shouraboura and A. Tal"
, title =	"Strategies for polyhedral surface decomposition: An experimental study"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"327--342"
, succeeds =	"cdst-spsde-95"
, update =	"98.03 mitchell, 97.07 devillers"
}

@inproceedings{cd-dpicp-79
, author =	"Bernard Chazelle and D. P. Dobkin"
, title =	"Decomposing a polygon into its convex parts"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
, year =	1979
, pages =	"38--48"
, precedes =	"cd-ocd-85"
, update =	"98.03 mitchell"
}

@inproceedings{cd-diec-80
, author =	"Bernard Chazelle and D. P. Dobkin"
, title =	"Detection is easier than computation"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
, year =	1980
, pages =	"146--153"
, precedes =	"cd-icott-87"
, update =	"98.03 mitchell"
}

@article{cd-icott-87
, author =	"Bernard Chazelle and D. P. Dobkin"
, title =	"Intersection of convex objects in two and three dimensions"
, journal =	"J. ACM"
, volume =	34
, number =	1
, month =	jan
, year =	1987
, pages =	"1--27"
, keywords =	"polygons, polyhedra, intersection, detection"
, succeeds =	"cd-diec-80"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@incollection{cd-ocd-85
, author =	"Bernard Chazelle and D. P. Dobkin"
, title =	"Optimal convex decompositions"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"63--133"
, succeeds =	"cd-dpicp-79"
, update =	"98.03 mitchell"
}

@inproceedings{cdst-csd-95
, author =	"Bernard Chazelle and David P. Dobkin and Nadia Shouraboura and Ayellet Tal"
, title =	"Convex Surface Decomposition"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"V9--V10"
, keywords =	"video review"
, cites =	"cdst-spsde-95, dt-gascg-94, td-gsvga-94, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{cdst-spsde-95
, author =	"Bernard Chazelle and David P. Dobkin and Nadia Shouraboura and Ayellet Tal"
, title =	"Strategies for Polyhedral Surface Decomposition: {An} Experimental Study"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"297--305"
, keywords =	"convex surfaces"
, precedes =	"cdst-spsde-97"
, cites =	"as-tsbac-90, as-car-92, -arm-92, bd-cdpr-92, b-ct-93, be-mgot-92i, beg-pgmg-90, c-cpplb-84, cp-tncp-90, cp-dag-94, cp-dbnp-92, cs-bst-94, dk-fdpi-83, fkn-vsgpt-80, o-agta-87, mv-qmgtd-92i, rs-dttdn-92, sh-ffbtp-93, swfcb-immcb-93, ZZZ"
, update =	"98.03 bibrelex, 97.07 devillers, 95.09 mitchell"
}

@inproceedings{cdl-cler-84
, author =	"Bernard Chazelle and R. L. {Drysdale, III} and D. T. Lee"
, title =	"Computing the largest empty rectangle"
, booktitle =	"Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
, nickname =	"STACS '84"
, series =	"Lecture Notes Comput. Sci."
, volume =	166
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"43--54"
, keywords =	"rectangles, Voronoi diagrams"
, precedes =	"cdl-cler-86"
, update =	"98.11 bibrelex, 98.03 mitchell, 93.09 drysdale"
}

@article{cdl-cler-86
, author =	"Bernard Chazelle and R. L. {Drysdale, III} and D. T. Lee"
, title =	"Computing the largest empty rectangle"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"300--315"
, keywords =	"rectangles, Voronoi diagrams"
, succeeds =	"cdl-cler-84"
, update =	"98.03 mitchell, 93.09 drysdale"
}

@techreport{ce-falsi-87
, author =	"B. Chazelle and H. Edelsbrunner"
, title =	"A fast algorithm for line segment intersection and its extensions"
, type =	"Manuscript"
, institution =	"??"
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{ce-iacko-85
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"An improved algorithm for constructing $k$th-order {Voronoi} diagrams"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"228--234"
, precedes =	"ce-iacko-87"
, cites =	"b-vdch-79, cgl-pgd-83, csy-khrp-84, e-cestd-84, eos-calha-83, ew-cbtda-86, l-knnvd-82, ol-mcp-81, s-cg-78, sh-cpp-75, v-nadpc-08, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ce-iacko-87
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"An improved algorithm for constructing $k$th-order {Voronoi} diagrams"
, journal =	"IEEE Trans. Comput."
, volume =	"C-36"
, year =	1987
, pages =	"1349--1354"
, keywords =	"discrete geometry, design of algorithms, construction, geometric transformations, repeated search, Voronoi diagrams, two-dimensional, three-dimensional"
, succeeds =	"ce-iacko-85"
, update =	"98.03 mitchell"
}

@techreport{ce-oails-88t
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"An optimal algorithm for intersecting line segments in the plane"
, type =	"Technical {Report}"
, number =	"UIUCDCS-R-1419"
, institution =	"Dept. Comput. Sci., Univ. of Illinois"
, address =	"Urbana, IL"
, month =	mar
, year =	1988
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{ce-oails-88
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"An optimal algorithm for intersecting line segments in the plane"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"590--600"
, keywords =	"intersection, topological sweep, segments"
, precedes =	"ce-oails-92"
, update =	"98.03 mitchell"
}

@article{ce-oails-92
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"An optimal algorithm for intersecting line segments in the plane"
, journal =	"J. ACM"
, volume =	39
, number =	1
, year =	1992
, pages =	"1--54"
, keywords =	"intersection, topological sweep, segments"
, succeeds =	"ce-oails-88"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@inproceedings{ce-lsdst-86
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"Linear space data structures for two types of range search"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"293--302"
, precedes =	"ce-lsdst-87"
, cites =	"b-mdc-80, c-fsnaq-83, c-fadsi-85, ce-oscpr-85a, cg-fcdst-84, cgl-pgd-83, de-ssio-84, egs-oplms-86, ew-hrsls-83, gbt-srtgp-84, gs-pmgsc-83, k-osps-83, klp-fmsv-75, lt-apst-80, m-pst-81, mp-fitcp-78, ns-picg-79, w-pr-82, y-3spia-83, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{ce-lsdst-87
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"Linear space data structures for two types of range search"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"113--126"
, keywords =	"data structuring, reporting, domination, range search, point location, directed acyclic graphs, two-dimensional, three-dimensional"
, succeeds =	"ce-lsdst-86"
, update =	"98.03 mitchell"
}

@incollection{ce-oscpr-85a
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"Optimal solutions for a class of point retrieval problems"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	194
, year =	1985
, pages =	"80--89"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@article{ce-oscpr-85
, author =	"Bernard Chazelle and H. Edelsbrunner"
, title =	"Optimal solutions for a class of point retrieval problems"
, journal =	"J. Symbolic Comput."
, volume =	1
, year =	1985
, pages =	"47--56"
, keywords =	"data structuring, reporting, range search, directed acyclic graphs, translates"
, update =	"98.03 mitchell"
}

@inproceedings{cegghss-rspug-91
, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and J. Hershberger and Micha Sharir and J. Snoeyink"
, title =	"Ray shooting in polygons using geodesic triangulations"
, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	510
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"661--673"
, keywords =	"ray shooting, simple polygon, geodesics"
, update =	"98.03 mitchell, 93.09 rote"
}

@article{cegghss-rspug-94
, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and J. Hershberger and Micha Sharir and J. Snoeyink"
, title =	"Ray shooting in polygons using geodesic triangulations"
, journal =	"Algorithmica"
, volume =	12
, year =	1994
, pages =	"54--68"
, keywords =	"ray shooting, simple polygon, geodesics"
, succeeds =	"cegghss-rspug-91"
, update =	"98.03 mitchell, 96.05 pocchiola+ramkumar"
}

@inproceedings{ceggs-ibwen-93
, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir"
, title =	"Improved Bounds on Weak $\epsilon$-Nets for Convex Sets"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '93"
, year =	1993
, pages =	"495--504"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal+gaertner+salinger, 93.09 milone+mitchell"
}

@techreport{ceggss-rspug-90
, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
, title =	"Ray shooting in polygons using geodesic triangulations"
, type =	"Manuscript"
, year =	1990
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ceggsw-ibwen-95
, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
, title =	"Improved bounds on weak $\epsilon$-nets for convex sets"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"1--15"
, update =	"98.03 mitchell, 96.05 smid"
}

@article{ceghss-shcp-94
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and J. Hershberger and R. Seidel and M. Sharir"
, title =	"Selecting heavily covered points"
, journal =	"SIAM J. Comput."
, volume =	23
, year =	1994
, pages =	"1138--1151"
, update =	"98.07 bibrelex"
}

@article{cegs-plrav-89
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. Sharir"
, title =	"Point location in real-algebraic varieties and its applications"
, journal =	"ICALP"
, volume =	"??"
, year =	1989
, update =	"98.03 bibrelex"
}

@article{ceg-ccc-89
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas"
, title =	"The complexity of cutting complexes"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"139--181"
, keywords =	"discrete geometry, optimization, visibility, cell complexes, arrangements, polytopes, convex, three-dimensional, directed acyclic graphs"
, succeeds =	"ceg-cccp-87"
, update =	"98.03 mitchell"
}

@inproceedings{ceg-cccp-87
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas"
, title =	"The complexity of cutting convex polytopes"
, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
, year =	1987
, pages =	"66--76"
, keywords =	"discrete geometry, optimization, visibility, cell complexes, arrangements, polytopes, convex, three-dimensional, directed acyclic graphs"
, precedes =	"ceg-ccc-89"
, update =	"98.03 mitchell"
}

@inproceedings{ceghss-sdash-90
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and J. E. Hershberger and R. Seidel and Micha Sharir"
, title =	"Slimming down by adding; selecting heavily covered points"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"116--127"
, cites =	"cff-aatdf-85, acegsw-ptphp-90, d-slsv-34, dv-cprac-77, e-narip1-83, e-acg-87, em-sstcd-90, f-ldead-72, gs-nsagv-69, ht-fafnc-84, h-uzztu-53, ms-pggrg-80, ps-cgi-85, sf-afem-73, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{cegpsss-cccll-??
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
, title =	"Counting and Cutting Cycles of Lines and Line Segments in Space"
, type =	"Technical {Report}"
, year =	"??"
, keywords =	"discrete and computational geometry, three dimensions, hidden surface removal, depth sort, line segments, lines, cycles, incidences"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{cegpsss-ccclr-90
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
, title =	"Counting and cutting cycles of lines and rods in space"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"242--251"
, keywords =	"arrangements of lines in 3D, Plucker coordinates, convex hulls"
, update =	"98.03 mitchell"
}

@article{cegpsss-ccclr-92
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
, title =	"Counting and cutting cycles of lines and rods in space"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1992
, pages =	"305--323"
, update =	"98.03 mitchell"
}

@inproceedings{cegs-sessr-89
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"A singly-exponential stratification scheme for real semi-algebraic varieties and its applications"
, booktitle =	"Proc. 16th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	372
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"179--193"
, keywords =	"cell decomposition, random sampling, triangulation"
, precedes =	"cegs-sessr-91"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@article{cegs-sessr-91
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"A singly-exponential stratification scheme for real semi-algebraic varieties and its applications"
, journal =	"Theoret. Comput. Sci."
, volume =	84
, year =	1991
, pages =	"77--105"
, keywords =	"cell decomposition, random sampling, triangulation"
, succeeds =	"cegs-sessr-89"
, update =	"98.03 mitchell"
}

@techreport{cegs-ablsp-89
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"Algorithms for bichromatic line segment problems and polyhedral terrains"
, type =	"Report"
, number =	"UIUCDCS-R-90-1578"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1989
, keywords =	"arrangements, terrains, intersection problems"
, update =	"98.03 mitchell"
}

@article{cegs-ablsp-94
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"Algorithms for bichromatic line segment problems and polyhedral terrains"
, journal =	"Algorithmica"
, volume =	11
, year =	1994
, pages =	"116--132"
, succeeds =	"cegs-ablsp-89"
, update =	"98.03 mitchell, 94.05 matousek+sharir"
}

@inproceedings{cegs-dwclp-92
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"Diameter, width, closest line pair, and parametric searching"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"120--129"
, cites =	"aass-sdp-90, aesw-emstb-91, aest-cscpp-91, am-rsps-92, as-pglp-90, ast-apsgo-92, aps-zsha-93, c-ochan-91, cegs-lscaa-89, cegs-sessr-89, cegs-ablsp-94, cs-arscg-89, c-sdsno-87, csss-otass-89, csy-khrp-87, dmn-rass-92, egs-oplms-86, hw-ensrq-87, ht-cws-85, k-osps-83, m-ept-91, m-roass-91, m-aogdc-91, m-ccpps-91, m-loq-93, m-apcad-83, ns-cpcps-90, sw-frmrl-92, t-epcp-91, v-pcp-75, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{cegs-dwclp-93
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"Diameter, width, closest line pair and parametric searching"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"183--196"
, succeeds =	"cegs-dwclp-92"
, update =	"98.03 mitchell, 94.01 matousek"
}

@inproceedings{cegs-lscaa-89
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"Lines in space: combinatorics, algorithms, and applications"
, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
, year =	1989
, pages =	"382--393"
, keywords =	"arrangements of lines in 3D, Plucker coordinates, random sampling, convex hulls"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.09 smid"
}

@inproceedings{cegss-cfals-91
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
, title =	"Computing a face in an arrangement of line segments"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"441--448"
, keywords =	"arrangements, randomized incremental algorithm"
, precedes =	"cegss-cfals-93"
, update =	"98.03 mitchell, 94.05 aronov"
}

@article{cegss-cfals-93
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
, title =	"Computing a face in an arrangement of line segments and related problems"
, journal =	"SIAM J. Comput."
, volume =	22
, year =	1993
, pages =	"1286--1302"
, succeeds =	"cegss-cfals-91"
, update =	"98.03 mitchell, 95.09 agarwal, 94.05 sharir, 94.01 matousek"
}

@article{cegss-lsca-96
, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Stolfi"
, title =	"Lines in space: {C}ombinatorics and algorithms"
, journal =	"Algorithmica"
, volume =	15
, year =	1996
, pages =	"428--447"
, update =	"98.03 mitchell, 97.03 agarwal, 96.09 smid"
}

@techreport{cf-dvrsi-88t
, author =	"Bernard Chazelle and J. Friedman"
, title =	"A deterministic view of random sampling and its use in geometry"
, type =	"Report"
, number =	"CS-TR-181-88"
, institution =	"??"
, year =	1988
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{cf-dvrsi-88
, author =	"Bernard Chazelle and J. Friedman"
, title =	"A deterministic view of random sampling and its use in geometry"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"539--549"
, keywords =	"point location, range search, $d$-dimensional"
, precedes =	"cf-dvrsi-90"
, update =	"98.03 mitchell"
, annote =	"derandomizes with polynomial overhead"
}

@article{cf-dvrsi-90
, author =	"Bernard Chazelle and J. Friedman"
, title =	"A deterministic view of random sampling and its use in geometry"
, journal =	"Combinatorica"
, volume =	10
, number =	3
, year =	1990
, pages =	"229--249"
, keywords =	"point location, range search, $d$-dimensional"
, succeeds =	"cf-dvrsi-88"
, update =	"98.03 mitchell"
, annote =	"derandomizes with polynomial overhead"
}

@techreport{cf-plh-91
, author =	"Bernard Chazelle and J. Friedman"
, title =	"Point location among hyperplanes"
, type =	"Manuscript"
, year =	1991
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{cf-plhur-94
, author =	"Bernard Chazelle and J. Friedman"
, title =	"Point Location among Hyperplanes and Unidirectional Ray-Shooting"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"53--62"
, update =	"98.03 mitchell, 97.11 bibrelex, 95.01 matousek+smid"
}

@inproceedings{cg-fc-85
, author =	"Bernard Chazelle and Leonidas J. Guibas"
, title =	"Fractional Cascading"
, booktitle =	"Proc. Internat. Colloq. Automata Lang. Program."
, year =	1985
, note =	"To appear"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{cg-fcdst-84
, author =	"Bernard Chazelle and Leonidas J. Guibas"
, title =	"Fractional Cascading: {A} data structuring technique with geometric applications"
, booktitle =	"Efficicent Algorithms Workshop"
, site =	"Oberwolfach, Germany"
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{cg-fc1ds-86
, author =	"Bernard Chazelle and Leonidas J. Guibas"
, title =	"Fractional cascading: {I}. {A} data structuring technique"
, journal =	"Algorithmica"
, volume =	1
, number =	3
, year =	1986
, pages =	"133--162"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@article{cg-fc2a-86
, author =	"Bernard Chazelle and Leonidas J. Guibas"
, title =	"Fractional cascading: {II}. {Applications}"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"163--191"
, update =	"98.03 mitchell"
}

@inproceedings{cg-vippg-85
, author =	"Bernard Chazelle and Leonidas J. Guibas"
, title =	"Visibility and intersection problems in plane geometry"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"135--146"
, precedes =	"cg-vippg-89"
, cites =	"c-tpca-82, c-cftvc-84, cg-fcdst-84, e-eacwv-84, grs-kfcg-83, ll-cvpe-84, egs-oplms-84, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{cg-vippg-88
, author =	"Bernard Chazelle and Leonidas J. Guibas"
, title =	"Visibility and Intersection Problems in Plane Geometry"
, type =	"Report"
, number =	"CS-TR-167-88"
, institution =	"Princeton Univ."
, year =	1988
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{cg-vippg-89
, author =	"Bernard Chazelle and Leonidas J. Guibas"
, title =	"Visibility and intersection problems in plane geometry"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"551--581"
, succeeds =	"cg-vippg-85"
, update =	"98.03 mitchell"
}

@inproceedings{cgl-pgd-83
, author =	"Bernard Chazelle and Leonidas J. Guibas and D. T. Lee"
, title =	"The power of geometric duality"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"217--225"
, precedes =	"cgl-pgd-85"
, update =	"98.03 mitchell"
}

@article{cgl-pgd-85
, author =	"Bernard Chazelle and Leonidas J. Guibas and D. T. Lee"
, title =	"The power of geometric duality"
, journal =	"BIT"
, volume =	25
, year =	1985
, pages =	"76--90"
, succeeds =	"cgl-pgd-83"
, update =	"98.03 mitchell"
}

@article{ci-cccdr-84
, author =	"Bernard Chazelle and J. Incerpi"
, title =	"Computing connected components of {$D$}-ranges"
, journal =	"Bull. EATCS"
, volume =	22
, year =	1984
, pages =	"9--11"
, update =	"98.03 mitchell"
}

@inproceedings{ci-tpdc-83
, author =	"Bernard Chazelle and J. Incerpi"
, title =	"Triangulating a Polygon by Divide and Conquer"
, booktitle =	"Proc. 21st Allerton Conf. Commun. Control Comput."
, year =	1983
, pages =	"447--456"
, update =	"98.03 mitchell"
, annote =	"$O(n\log s)$ divide and conquer algorithm for Vertical
		 Decomposition of a polygon (obtained by drawing a
		 vertical line through each vertex). $s$ is sinuosity
		 (number of times polygon alternates twists in different
		 directions.)"
}

@article{ci-tsc-84
, author =	"Bernard Chazelle and J. Incerpi"
, title =	"Triangulation and shape-complexity"
, journal =	"ACM Trans. Graph."
, volume =	3
, number =	2
, year =	1984
, pages =	"135--152"
, keywords =	"triangulation, polygons, simple, decomposition, divide-and-conquer"
, update =	"98.03 mitchell"
}

@article{cl-cpp-86
, author =	"Bernard Chazelle and D. T. Lee"
, title =	"On a circle placement problem"
, journal =	"Computing"
, volume =	36
, year =	1986
, pages =	"1--16"
, update =	"98.03 mitchell, 95.09 agarwal"
}

@inproceedings{cl-tbhd-00
, author =	"Bernard Chazelle and Alexey Lvov"
, title =	"A Trace Bound for the Hereditary Discrepancy"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"64--69"
, update =	"00.11 jones"
}

@techreport{cm-dosch-92
, author =	"Bernard Chazelle and J. Matou{\v s}ek"
, title =	"Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, year =	1992
, precedes =	"cm-dosch-95"
, update =	"98.03 mitchell, 96.09 agarwal+devillers"
}

@article{cm-dosch-95
, author =	"Bernard Chazelle and J. Matou{\v s}ek"
, title =	"Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"27--32"
, succeeds =	"cm-dosch-92"
, update =	"98.03 mitchell, 96.09 devillers+orourke"
}

@inproceedings{cm-ltdao-93
, author =	"Bernard Chazelle and J. Matou{\v s}ek"
, title =	"On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"281--290"
, update =	"98.03 mitchell, 96.09 agarwal, 93.05 smid"
}

@article{cm-ltdao-96
, author =	"Bernard Chazelle and J. Matou{\v s}ek"
, title =	"On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"579--597"
, update =	"98.03 mitchell, 97.03 agarwal+smid, 96.09 agarwal, 93.05 smid"
}

@inproceedings{cm-mcvrc-81
, author =	"Bernard Chazelle and L. Monier"
, title =	"A model of computation for {VLSI} with related complexity results"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
, year =	1981
, pages =	"318--325"
, precedes =	"cm-mcvrc-85"
, update =	"98.03 mitchell"
}

@article{cm-mcvrc-85
, author =	"Bernard Chazelle and L. Monier"
, title =	"A model of computation for {VLSI} with related complexity results"
, journal =	"J. ACM"
, volume =	32
, year =	1985
, pages =	"573--588"
, succeeds =	"cm-mcvrc-81"
, update =	"98.03 mitchell"
}

@techreport{c-accgc-96
, author =	"Bernard Chazelle and others"
, title =	"Application Challenges to Computational Geometry: {CG} Impact Task Force Report"
, type =	"Technical {Report}"
, number =	"TR-521-96"
, institution =	"Princeton Univ."
, month =	apr
, year =	1996
, url =	"http://www.cs.princeton.edu/~chazelle/taskforce/CGreport.ps"
, comments =	"Also at \url{http://www.cs.duke.edu/~jeffe/compgeom/taskforce.html}"
, update =	"98.03 mitchell, 97.03 pocchiola+tamassia, 96.09 orourke"
}

@incollection{c-accgc-99
, author =	"Bernard Chazelle and others"
, title =	"Application Challenges to Computational Geometry: {CG} Impact Task Force Report"
, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
, booktitle =	"Advances in Discrete and Computational Geometry"
, series =	"Contemporary Mathematics"
, volume =	223
, publisher =	"American Mathematical Society"
, address =	"Providence"
, year =	1999
, pages =	"407--463"
, update =	"00.03 smid"
}

@inproceedings{cosw-cds-84
, author =	"Bernard Chazelle and T. Ottmann and E. Soisalon-Soininen and D. Wood"
, title =	"The complexity and decidability of {${\rm SEPARATION}^{\rm TM}$}"
, booktitle =	"Proc. 11th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	172
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"119--127"
, update =	"98.03 mitchell"
}

@inproceedings{cp-dbnp-92
, author =	"Bernard Chazelle and L. Palios"
, title =	"Decomposing the boundary of a nonconvex polyhedron"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"364--375"
, update =	"98.03 mitchell"
}

@incollection{cp-dag-94
, author =	"B. Chazelle and L. Palios"
, title =	"Decomposition algorithms in geometry"
, chapter =	27
, editor =	"C. Bajaj"
, booktitle =	"Algebraic Geometry and its Applications"
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"419--447"
, update =	"98.03 bibrelex"
}

@inproceedings{cp-tncp-89
, author =	"Bernard Chazelle and L. Palios"
, title =	"Triangulating a non-convex polytope"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"393--400"
, precedes =	"cp-tncp-90"
, cites =	"as-tsbac-88, b-tdmgt-87, bgr-ntp-88, b-prcv-75, c-namrm-87, c-cpplb-84, c-ads-87, cegs-plrav-89, c-qercf-75, dl-pmtds-87, eos-calha-86, fp-dpscf-75, gs-pmgsc-85, l-pnrh-82, m-dsa-84, mp-fitcp-78, o-agta-87, ps-cgi-85, p-aicad-86, s-dpcs-78, ss-pmp2g-83, s-scgmm-88, w-esrav-57, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{cp-tncp-90
, author =	"Bernard Chazelle and L. Palios"
, title =	"Triangulating a non-convex polytope"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"505--526"
, succeeds =	"cp-tncp-89"
, update =	"98.03 mitchell"
}

@inproceedings{cp-hrsaa-85
, author =	"Bernard Chazelle and F. P. Preparata"
, title =	"Halfspace range search: {An} algorithmic application of $k$-sets"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"107--115"
, precedes =	"cp-hrsaa-86, ccpy-nubns-86"
, cites =	"bm-nenns-79, c-fsnaq-83, c-ccdga-84, ccpy-nubns-84, cgl-pgd-83, cy-grp-83, e-agc-, eos-calha-83, elss-dgpps-73, l-knnvd-82, ps-cgi-85, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
}

@article{cp-hrsaa-86
, author =	"Bernard Chazelle and F. P. Preparata"
, title =	"Halfspace range search: {An} algorithmic application of $k$-sets"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"83--93"
, succeeds =	"cp-hrsaa-85"
, update =	"98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{cr-cpsma-89
, author =	"Bernard Chazelle and B. Rosenberg"
, title =	"Computing partial sums in multidimensional arrays"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"131--139"
, precedes =	"cr-ccpso-91"
, cites =	"ass-sulbl-89, as-opaol-87, b-dsp-79, b-mdc-80, bm-ewcds-80, c-fsnaq-86, c-lbcms-86, cg-fc2a-86, c-fadsi-88, f-lbcor-81, hs-ndssg-86, l-dsorq-78, m-dsa-84, o-ddds-83, t-egbnl-75, t-cmncc-78, v-sttor-85, w-ndsor-85, wl-arrcd-85, w-lbdrq-86, y-sttoa-82, y-cmps-85, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@incollection{cr-lbcsr-92
, author =	"Bernard Chazelle and B. Rosenberg"
, title =	"Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine"
, booktitle =	"Proc. 19th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	623
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"439--449"
, note =	"Also to appear in {\em Comput. Geom. Theory Appl.}"
, update =	"98.03 mitchell, 94.01 smid, 93.09 matousek+milone+mitchell"
}

@article{cr-srrpm-96
, author =	"Bernard Chazelle and B. Rosenberg"
, title =	"Simplex range reporting on a pointer machine"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1996
, pages =	"237--247"
, update =	"98.03 mitchell, 96.09 devillers"
}

@article{cr-ccpso-91
, author =	"Bernard Chazelle and B. Rosenberg"
, title =	"The complexity of computing partial sums off-line"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	1
, year =	1991
, pages =	"33--45"
, keywords =	"partial sums, lower bounds, orthogonal range searching"
, succeeds =	"cr-cpsma-89"
, update =	"98.03 mitchell"
}

@article{cs-agpli-90
, author =	"Bernard Chazelle and Micha Sharir"
, title =	"An algorithm for generalized point location and its application"
, journal =	"J. Symbolic Comput."
, volume =	10
, year =	1990
, pages =	"281--309"
, keywords =	"algebraic varieties, point location, cylindrical algebraic decomposition"
, update =	"98.03 mitchell"
}

@techreport{cs-agpli-88
, author =	"Bernard Chazelle and Micha Sharir"
, title =	"An algorithm for generalized point location and its applications"
, type =	"Technical {Report}"
, number =	153
, institution =	"Robotics Lab., Courant Inst. Math. Sci."
, address =	"New York, NY"
, month =	may
, year =	1988
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{csw-qoubs-90
, author =	"Bernard Chazelle and Micha Sharir and Emo Welzl"
, title =	"Quasi-optimal upper bounds for simplex range searching and new zone theorems"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"23--33"
, cites =	"a-idaac-89, as-tsbac-88, c-lbcpr-89, cegs-sessr-89, cf-dvrsi-90, cp-tncp-89, cw-qorss-89, c-narsc-87, c-racpq-88, cegsw-ccbac-88, cs-arscg-89, c-sssl-86, cy-grp-84, e-acg-87, e-ueplf-89, eghsssw-irals-88, egs-ueplf-89, eos-calha-86, ew-hrsls-86, hw-ensrq-87, m-mdscg-84, ps-ueplf-89, py-prp-86, pss-stsps-88, w-pr-82, y-3spia-83, yy-gaddg-85, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{csw-qoubs-92
, author =	"Bernard Chazelle and Micha Sharir and Emo Welzl"
, title =	"Quasi-optimal upper bounds for simplex range searching and new zone theorems"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"407--429"
, succeeds =	"csw-qoubs-90"
, update =	"98.03 mitchell, 93.09 matousek"
}

@inproceedings{cs-bst-94
, author =	"Bernard Chazelle and N. Shouraboura"
, title =	"Bounds on the Size of Tetrahedralizations"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"231--239"
, cites =	"as-tsbac-90, as-ucptd-93, as-car-92, bd-cdpr-92, b-ct-93, c-cpplb-84, c-oaitd-92, cp-tncp-90, d-tcrpa-91, dk-fdpi-83, dl-pmtds-89, m-spai3-91, m-mdscg-84, m-cgitr-93, p-bcspi-93, rs-dttdn-92, s-udzvd-28, ZZZ"
, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
}

@article{cw-qorss-89
, author =	"Bernard Chazelle and Emo Welzl"
, title =	"Quasi-optimal range searching in spaces of finite {VC}-dimension"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"467--489"
, succeeds =	"cw-rsvdc-88"
, update =	"98.03 mitchell"
}

@techreport{cw-rsvdc-88
, author =	"Bernard Chazelle and Emo Welzl"
, title =	"Range searching and {VC}-dimension: a characterization of efficiency"
, type =	"Report"
, number =	"B-88-09"
, institution =	"Fachber. Math., Free Univ. Berlin"
, address =	"Berlin, West Germany"
, month =	nov
, year =	1988
, precedes =	"cw-qorss-89"
, update =	"98.03 mitchell"
}

@inproceedings{cdgp-icms-2014
, author =	{Panagiotis Cheilaris and Sandeep Kumar Dey and
                 Maria Gabrani and Evanthia Papadopoulou}
, title =	{Implementing the {L}$\infty$ segment {Voronoi} diagram
                 in {CGAL} and an application in {VLSI} pattern analysis}
, booktitle =	{Proc. 4th International Congress on Mathematical
                 Software (ICMS)}
, year =	2014
, pages =	"198--205"
}

@article{cs-rpudr-83
, author =	"O. Chein and L. Steinberg"
, title =	"Routing past unions of disjoint rectilinear barriers"
, journal =	"Networks"
, volume =	13
, number =	3
, year =	1983
, pages =	"389--398"
, keywords =	"isothetic, routing, VLSI design"
, update =	"95.09 korneenko"
}

@article{cld-patip-91
, author =	"?. Chen and T. Ling and L. S. Davis"
, title =	"Parallel algorithms for testing if a point is inside a closed curve"
, journal =	"Pattern Recogn. Lett."
, volume =	12
, number =	2
, year =	1991
, pages =	"73--77"
, keywords =	"point location, parallel computation, digital geometry"
, update =	"95.09 korneenko"
}

@article{cc-mpt-90
, author =	"Chiuyuan Chen and Ruei-Chuan Chang"
, title =	"On the Minimality of Polygon Triangulation"
, journal =	"BIT"
, volume =	30
, year =	1990
, pages =	"570--582"
, annote =	"Triangulate polygon into minimum number of triangles.
		 $O(n\log^2 n+DK^2)$. $D$ is maximum number of vertices
		 on same line. $K$ is number of degenerate triangles."
}

@article{c-cchsp-89
, author =	"C.-L. Chen"
, title =	"Computing the convex hull of a simple polygon"
, journal =	"Pattern Recogn. Lett."
, volume =	22
, number =	5
, year =	1989
, pages =	"561--566"
, note =	"erratic"
, keywords =	"convex hull, simple, polygon"
, update =	"95.09 korneenko"
}

@article{c-egaep-95
, author =	"D. Chen"
, title =	"Efficient geometric algorithms on the {EREW PRAM}"
, journal =	"IEEE Trans. Parallel Distrib. Syst."
, volume =	6
, number =	1
, year =	1995
, pages =	"41--47"
, update =	"96.09 orourke"
}

@inproceedings{c-opadw-92
, author =	"D. Z. Chen"
, title =	"An optimal parallel algorithm for detecting weak visibility of a simple polygon"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"63--72"
, precedes =	"c-opadw-95"
, cites =	"ag-pasft-88, at-oadvp-81, bmt-ltacs-91, cg-vippg-89, c-egaep-90, ckt-cgp-89, cg-opapp-88, g-fchsp-87, g-tpp-89, g-psppt-92, gsg-pmvsp-90, ghlst-ltavs-87, gmpsv-cwvpr-90t, hm-svpap-90, k-dwvsp-88, krs-ppp-85a, lf-ppc-80, ll-cvpe-84, lp-oafkp-79, ol-mcp-81, ps-cgi-85, ss-oadwv-90, t-ltass-86a, y-ptptc-88, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@article{c-opadw-95
, author =	"D. Z. Chen"
, title =	"An optimal parallel algorithm for detecting weak visibility of a simple polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"93--124"
, keywords =	"computational geometry, CREW PRAM, parallel algorithms, simple polygons, weak visibility"
, succeeds =	"c-opadw-92"
, update =	"96.09 devillers"
}

@inproceedings{c-dwevp-94
, author =	"D. Z. Chen"
, title =	"Determining Weak External Visibility of Polygons in Parallel"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"375--380"
, precedes =	"c-dwvpe-98"
, cites =	"bcetsu-csts-91, bkt-dsvp-89, bt-cst-90t, c-ptpvr-92, c-egaep-90, c-opadw-92, c-ocswv-93, g-fchsp-87, ta-chapi-82, acw-opavs-91, bmt-ltacs-91, ZZZ"
, update =	"98.11 bibrelex+devillers, 94.09 jones"
}

@article{c-dwvpe-98
, author =	"D. Z. Chen"
, title =	"Determining Weak Visibility of a Polygon from an Edge in Parallel"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"277--304"
, succeeds =	"c-dwevp-94"
, update =	"98.11 devillers"
}

@inproceedings{c-egaep-90
, author =	"D. Z. Chen"
, title =	"Efficient geometric algorithms in the {EREW}-{PRAM}"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1990
, pages =	"818--827"
, keywords =	"parallel computation"
, update =	"95.09 korneenko"
}

@inproceedings{c-apesp-95
, author =	"Danny Z. Chen"
, title =	"On the All-Pairs {Euclidean} Short Path Problem"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"292--301"
, keywords =	"shortest paths among obstacles, two-point query, approximation algorithm"
, update =	"98.03 mitchell, 96.09 agarwal, 96.05 mitchell"
, abstract =	"
Given a set of polygonal obstacles of $n$ vertices in the plane,
the problem of processing the all-pairs Euclidean {\em short} path
queries is that of reporting an obstacle-avoiding path $P$ (or
its length) between two arbitrary query points $p$ and $q$ in the
plane, such that the length of $P$ is within a small factor of the
length of a Euclidean {\em shortest} obstacle-avoiding path between
$p$ and $q$.  The goal is to answer each short path query quickly
by constructing data structures that capture path information in
the obstacle-scattered plane.  For the related all-pairs Euclidean
{\em shortest} path problem, the best known algorithms for even
very simple cases (e.g., {\em rectilinear} shortest paths among
disjoint {\em rectangular} obstacles in the plane) require
at least quadratic space and time to construct a data structure,
so that a length query can be answered in polylogarithmic time.
The previously best known solution to the all-pairs Euclidean
{\em short} path problem also uses a data structure of quadratic
space and superquadratic construction time, in order to answer a
length query in polylogarithmic time.  In this paper, we present a
data structure that requires nearly linear space and takes subquadratic
time to construct.  Precisely, for any given $\epsilon$ satisfying
$0$ $<$ $\epsilon$ $\leq$ $1$, our data structure can be built
in $o(q^{3/2})$ $+$ $O((n\log n)/\epsilon)$ time and
$O(n\log n+n/\epsilon)$ space, where $q$, $1$ $\leq$ $q$ $\leq$ $n$,
is the minimum number of faces needed to cover all the vertices of
a certain planar graph we use.  This data structure enables us to
report the length of a short path between two arbitrary query points
in $O((\log n)/\epsilon+1/\epsilon^2)$ time and the actual path
in $O((\log n)/\epsilon+1/\epsilon^2+L)$ time, where $L$ is the
number of edges of the output path.  The constant approximation
factor, $6+\epsilon$, for the short paths that we compute is quite
small.  Our techniques are parallelizable and can also be used
to improve the previously best known results on several related
graphic and geometric problems."
}

@techreport{c-ocswv-92
, author =	"D. Z. Chen"
, title =	"Optimally computing the shortest weakly visible subedge of a simple polygon"
, type =	"Technical {Report}"
, number =	"92-028"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, month =	may
, year =	1992
, update =	"98.03 bibrelex"
}

@inproceedings{c-ocswv-93
, author =	"Danny Z. Chen"
, title =	"Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"323--332"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@article{c-ocswv-96
, author =	"Danny Z. Chen"
, title =	"Optimally computing the shortest weakly visible subedge of a simple polygon"
, journal =	"J. Algorithms"
, volume =	20
, year =	1996
, pages =	"459--478"
, update =	"97.03 smid"
}

@techreport{c-ptpvr-92
, author =	"D. Z. Chen"
, title =	"Parallel techniques for paths, visibility, and related problems"
, type =	"Technical Report"
, number =	"92-051"
, institution =	"Dept. of Computer Sciences, Purdue University"
, month =	jul
, year =	1992
, note =	"Ph.D. Thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{ccwk-papss-96
, author =	"D. Z. Chen and W. Chen and K. Wada and K. Kawaguchi"
, title =	"Parallel algorithms for partitioning sorted sets and related problems"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"234--245"
, update =	"97.03 smid"
}

@inproceedings{cd-mvpmp-96
, author =	"D. Z. Chen and O. Daescu"
, title =	"Maintaining visibility of a polygon with a moving point of view"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"240--245"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{cdk-gpqp-97
, author =	"Danny Z. Chen and Ovidiu Daescu and Kevin S. Klenk"
, title =	"On Geometric Path Query Problems"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"248--257"
, update =	"99.07 bibrelex, 98.03 mitchell"
}

@techreport{cds-lbcgs-96t
, author =	"D. Z. Chen and G. Das and M. Smid"
, title =	"Lower bounds for computing geometric spanners and approximate shortest paths"
, type =	"Report"
, number =	"TR 96-09"
, institution =	"Department of Computer Science, King's College"
, address =	"London, UK"
, year =	1996
, update =	"96.09 mitchell, 96.05 smid"
}

@inproceedings{cds-lbcgs-96i
, author =	"D. Z. Chen and G. Das and M. Smid"
, title =	"Lower bounds for computing geometric spanners and approximate shortest paths"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"155--160"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{cds-lbcgs-01
, author =	"D. Z. Chen and G. Das and M. Smid"
, title =	"Lower bounds for computing geometric spanners and approximate shortest paths"
, journal =	"Discrete Appl. Math."
, volume =	110
, year =	2001
, pages =	"151--167"
, update =	"01.07 smid"
}

@inproceedings{ceu-ogpmc-95
, author =	"Danny Z. Chen and Vladimir Estivill-Castro and Jorge Urrutia"
, title =	"Optimal Guarding of Polygons and Monotone Chains"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"133--138"
, update =	"95.09 jones"
}

@inproceedings{cg-tspmo-93
, author =	"Danny Z. Chen and Sumanta Guha"
, title =	"Testing a Simple Polygon for Monotonicity Optimally in Parallel"
, booktitle =	"Proc. 7th IEEE Internat. Parallel Process. Sympos."
, publisher =	"IEEE Computer Society"
, year =	1993
, pages =	"326--330"
, precedes =	"cg-tspmo-93a"
, update =	"98.07 bibrelex, 98.03 mitchell, 94.05 devillers"
}

@article{cg-tspmo-93a
, author =	"Danny Z. Chen and Sumantha Guha"
, title =	"Testing a Simple Polygon for Monotonicity Optimally in Parallel"
, journal =	"Inform. Process. Lett."
, volume =	47
, number =	6
, month =	oct
, year =	1993
, pages =	"325--331"
, succeeds =	"cg-tspmo-93"
, update =	"98.03 mitchell"
}

@inproceedings{ck-rspqr-95
, author =	"Danny Z. Chen and Kevin S. Klenk"
, title =	"Rectilinear Short Path Queries among Rectangular Obstacles"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"169--174"
, update =	"95.09 jones"
}

@article{ck-rspqr-96
, author =	"D. Z. Chen and K. S. Klenk"
, title =	"Rectilinear Short Path Queries among Rectangular Obstacles"
, journal =	"Inform. Process. Lett."
, volume =	57
, year =	1996
, pages =	"313--319"
, update =	"98.03 mitchell, 96.05 smid"
}

@inproceedings{ckt-spqwo-95
, author =	"Danny Z. Chen and Kevin S. Klenk and Hung-Yi T. Tu"
, title =	"Shortest Path Queries among Weighted Obstacles in the Rectilinear Plane"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"370--379"
, keywords =	"weighted regions, rectilinear paths, all-pairs paths"
, precedes =	"ckt-spqwo-96"
, cites =	"akmsw-gamsa-87, ac-prspr-91, ac-proap-93a, cg-fc1ds-86, c-apesp-95, cpt-uadpl-93, ckv-rsptp-, ckv-rsptp-87, bkn-spqrw-91, rlw-rsppr-89, em-osrqa-94, ft-fhtui-87, gmmn-pp0wr-88, gt-drssp-93, gh-ospqs-87, ghlst-ltavs-87, h-ndssp-91, hs-ecesp-93, isn-spapr-94, k-rspqw-94, ll-fmrdp-81, lp-esppr-84, lyc-srpwo-91, m-naspo-88, m-oasrp-89, m-lsppo-92, m-spop-93, mp-wrpfs-91, ps-cgi-85, sr-spppo-94, w-cvgnl-85, w-ndiv-89, lyc-srpwo-91, wwsw-rspms-87, ycl-srpwr-90, ZZZ"
, update =	"98.03 bibrelex+mitchell, 95.09 mitchell"
}

@techreport{ckt-spqwo-96
, author =	"D. Z. Chen and K. S. Klenk and H.-Y. T. Tu"
, title =	"Shortest path queries among weighted obstacles in the rectilinear plane"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1996
, succeeds =	"ckt-spqwo-95"
, update =	"00.11 smid, 98.07 bibrelex, 98.03 mitchell"
}

@article{ckt-spqwo-00
, author =	"D. Z. Chen and K. S. Klenk and H.-Y. T. Tu"
, title =	"Shortest path queries among weighted obstacles in the rectilinear plane"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"1223--1246"
, update =	"00.11 smid"
}

@article{cx-edacs-01
, author =	"D. Z. Chen and J. Xu"
, title =	"An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"155--166"
, update =	"01.07 smid"
}

@inproceedings{cx-tvlpp-98
, author =	"Danny Z. Chen and Jinhui Xu"
, title =	"Two-variable Linear Programming in Parallel"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"169--180"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

@article{ccml-nsach-87
, author =	"G. H. Chen and M.-S. Chern and R. C. T. Lee"
, title =	"A new systolic algorithm for convex hull and half-plane intersection problems"
, journal =	"BIT"
, volume =	27
, number =	2
, year =	1987
, pages =	"141--147"
, keywords =	"parallel computation, convex hull, intersection, halfplanes"
, update =	"95.09 korneenko"
}

@article{ch-scmo-88
, author =	"H. H. Chen and T. S. Huang"
, title =	"A survey of construction and manipulation of octrees"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	43
, year =	1988
, pages =	"409--431"
, keywords =	"survey, octree, data structuring"
, update =	"95.09 korneenko"
}

@article{ch-mmtdp-88
, author =	"H. H. Chen and T. S. Huang"
, title =	"Maximum matching of three-dimensional points for multiobject motion estimation"
, journal =	"Pattern Recogn."
, volume =	21
, number =	2
, year =	1988
, pages =	"75--90"
, keywords =	"pattern recognition, points, motion planning"
, succeeds =	"ch-mmttd-86"
, update =	"97.11 bibrelex, 95.09 korneenko"
}

@inproceedings{ch-mmttd-86
, author =	"H. H. Chen and T. S. Huang"
, title =	"Maximum matching of two three-dimensional point sets"
, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn."
, year =	1986
, pages =	"1048--1050"
, precedes =	"ch-mmtdp-88"
, update =	"95.09 korneenko"
}

@inproceedings{ch-spp-90
, author =	"J. Chen and Y. Han"
, title =	"Shortest paths on a polyhedron"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"360--369"
, precedes =	"ch-spp-96"
, cites =	"aaos-supa-90, c-namrm-87, ch-sppp2-90, cr-nlbtr-87, d-ntpcg-59, gjpt-tsp-78, hct-faspe-89, k-osps-83, m-spppo-84, m-psp-86, mmp-dgp-87, m-fspcp-85, m-nspsp-86, osb-spps-84, p-nappl-81, rs-spesp-85, rs-dsppp-88, sh-cpp-75, so-nmesc-88, ss-spps-86, ZZZ"
, update =	"98.07 bibrelex, 97.11 bibrelex, 96.09 devillers"
}

@article{ch-spp-96
, author =	"J. Chen and Y. Han"
, title =	"Shortest paths on a polyhedron"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"127--144"
, succeeds =	"ch-spp-90"
, update =	"96.09 devillers"
}

@techreport{ch-sppp2-90
, author =	"J. Chen and Y. Han"
, title =	"Shortest paths on a polyhedron, {Part} II: storing shortest paths"
, type =	"Technical {Report}"
, number =	"161-90"
, institution =	"Comput. Sci. Dept., Univ. Kentucky"
, address =	"Lexington, KY"
, month =	feb
, year =	1990
, update =	"97.11 bibrelex"
}

% Affiliation: Dept. Comput. Sci., Kentucky Univ., Lexington, KY, USA
@inproceedings{ch-sspp-91
, author =	"J. Chen and Y. Han"
, title =	"Storing shortest paths for a polyhedron"
, editor =	"F. Dehne and F. Fiala and W. W. Koczkodaj"
, booktitle =	"Advances in Computing and Information --- ICCI '91 International Conference Proceedings"
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"169--80"
, update =	"93.09 rote"
}

@inproceedings{ckk-cge-93
, author =	"Jianer Chen and Saroja P. Kanchi and Arkady Kanevsky"
, title =	"On the Complexity of Graph Embeddings"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"234--245"
, update =	"93.09 milone+mitchell"
}

@article{c-lpc-63
, author =	"J. R. Chen"
, title =	"The lattice points in a circle"
, journal =	"Sci. Sinica"
, volume =	12
, year =	1963
, pages =	"633--649"
, update =	"97.11 bibrelex"
}

@inproceedings{c-edpai-90
, author =	"L. Chen"
, title =	"Efficient deterministic parallel algorithms for integer sorting"
, editor =	"S. G. Akl and F. Fiala and W. W. Koczkodaj"
, booktitle =	"Advances in Computing and Information -- Proc. International Conference on Computing and Information"
, year =	1990
, pages =	"367--371"
, update =	"98.07 bibrelex"
}

@inproceedings{c-epasi-89
, author =	"L. Chen"
, title =	"Efficient parallel algorithms for several intersection graphs"
, booktitle =	"Proc. IEEE Internat. Symp. Circuits and Systems"
, volume =	2
, year =	1989
, pages =	"973--976"
, keywords =	"geometric graphs, parallel computation, intersection"
, update =	"95.09 korneenko"
}

@inproceedings{c-epaca-90
, author =	"L. Chen"
, title =	"Efficient parallel algorithms on circular arcs"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"66--69"
, cites =	"c-nacag-89, c-edpai-90, cy-ptcop-89, c-pms-88, cv-fopps-89, g-acag-74, k-pafmc-89, krs-ppp-85a, lf-ppc-80, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{c-nacag-89
, author =	"L. Chen"
, title =	"NC algorithms for circular-arc graphs"
, editor =	"F. Dehne and J.-R. Sack and N. Santoro"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"291--302"
, update =	"98.07 bibrelex"
}

@article{ccw-pdmdd-93
, author =	"L. Chen and S. Chou and T. Woo"
, title =	"Parting directions for mould and die design"
, journal =	"Comput. Aided Design"
, volume =	25
, year =	1993
, pages =	"762--768"
, update =	"98.07 bibrelex"
}

@inproceedings{cy-ptcop-89
, author =	"L. Chen and Y. Yesha"
, title =	"Parallel testing for the consecutive ones property and transformable convex bipartite graphs and finding a maximum matching"
, booktitle =	"Proc. 27th Allerton Conf. Commun. Control Comput."
, site =	"Urbana, IL"
, year =	1989
, pages =	"756--765"
, update =	"98.07 bibrelex"
}

@article{cw-cgsaa-92
, author =	"L.-L. Chen and T. C. Woo"
, title =	"Computational geometry on the sphere with application to automated machining"
, journal =	"Journal of Mechanical Design"
, volume =	114
, year =	1992
, pages =	"288--295"
, update =	"98.07 smid"
}

@inproceedings{ct-ecadc-87
, author =	"M. Chen and P. Townsend"
, title =	"Efficient and consistent algorithms for determining the containment of points in polygons and polyhedra"
, editor =	"G. Marechal"
, booktitle =	"EUROGRAPHICS '87"
, publisher =	"North-Holland"
, month =	aug
, year =	1987
, pages =	"423--437"
, keywords =	"point location"
, update =	"98.07 bibrelex, 95.09 korneenko"
}

@inproceedings{c-nastg-83
, author =	"N.-P. Chen"
, title =	"New algorithms for {Steiner} tree on graphs"
, booktitle =	"IEEE Sympos. Circuits Systems"
, year =	1983
, pages =	"1217--1219"
}

@article{chj-ololv-91
, author =	"P.-C. Chen and P. Hansen and B. Jaumard"
, title =	"On-line and off-line vertex enumeration by adjacency lists"
, journal =	"Oper. Res. Lett."
, volume =	10
, year =	1991
, pages =	"403--409"
, update =	"97.11 bibrelex"
}

@article{c-irepr-90
, author =	"S. E. Chen"
, title =	"Incremental radiosity: An extension of progressive radiosity to an interactive image synthesis system"
, journal =	"Comput. Graph."
, volume =	24
, number =	4
, month =	aug
, year =	1990
, pages =	"135--144"
, note =	"Proc. SIGGRAPH '90"
, update =	"97.11 bibrelex"
}

@inproceedings{cdwk-cscsp-97
, author =	"Wei Chen and Xiao Wen Deng and Koichi Wada and Kimio Kawaguchi"
, title =	"Constructing a Strongly Convex Superhull of Points"
, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '97"
, site =	"Shanghai, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	1276
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"42--51"
, update =	"99.11 bibrelex, 98.11 bibrelex, 98.03 mitchell"
}

@inproceedings{cwk-pracs-96
, author =	"Wei Chen and Koichi Wada and Kimio Kawaguchi"
, title =	"Parallel Robust Algorithms for Constructing Strongly Convex Hulls"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"133--140"
, cites =	"acgoy-pcg-88, ds-rgnap-88, f-smpst-89, gr-epa-88, gy-frcg-86, gss-egbra-89, gss-cscah-93, h-pargc-89, lm-cschu-92, m-vigau-88a, m-cacau-89, m-dpggt-89, otu-nsga-87, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex, 96.05 efrat"
}

@article{cwkc-fchdp-98
, author =	"Wei Chen and Koichi Wada and Kimio Kawaguchi and Danny Chen"
, title =	"Finding the Convex Hull of Discs in Parallel"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"305--320"
, update =	"98.11 devillers"
}

@mastersthesis{c-rsbo-91
, author =	"X. Chen"
, title =	"Robust Solid Boolean Operations"
, school =	"Agricultural and Mech. College, Louisiana State Univ., USA"
, year =	1991
, keywords =	"numerical precision, stability, robustness"
, update =	"93.09 held"
}

@article{ch-efbd-96
, author =	"X. Chen and C. M. Hoffmann"
, title =	"On editability of feature-based design"
, journal =	"Comput. Aided Design"
, volume =	27
, number =	12
, year =	1996
, pages =	"905--914"
, update =	"98.07 bibrelex"
}

@article{cy-ptapc-89
, author =	"Xiangping Chen and Daoning Ying"
, title =	"Polygon Triangulation Algorithm As a Powerful Core Processor Of Plan-1"
, journal =	"Comput. Graph. Forum"
, volume =	8
, number =	3
, month =	sep
, year =	1989
, pages =	"193--198"
, keywords =	"polygon triangulation, plan-i (production layout automation nucleus) system, non-self-intersecting polygon, triangular splitting algorithm, triangular- faceted structure, boundary representation"
, annote =	"$O(n^2)$ search for an empty triangle on a particular
		 edge. Hence an $O(n^3)$ algorithm."
, abstract =	"A concise, complete and reliable algorithm for
		 triangulating an arbitrary polygon is presented as a
		 powerful core processor of PLAN-I (Production Layout
		 Automation Nucleus) system. A polygon with inner loops
		 is converted into a non-self-intersecting polygon (NIP)
		 through adding 'Bridge Edges'. A triangular splitting
		 algorithm for NIP is described and implemented. The
		 program is about 300 lines in FORTRAN-77. Sweeping and
		 local operations with respect to the triangular-faceted
		 boundary representation are designed with the algorithm
		 to improve functions of solid modeling in PLAN-I. The
		 algorithm of triangulation can also be applied to
		 Boolean operations and other issues. (Author abstract)
		 9 Refs."
}

@inproceedings{cs-frsoe-94
, author =	"Y. Chen and T. R. Smith"
, title =	"Finitely representable Spatial Objects and Efficient Computation"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"181--189"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
}

@article{clc-saknn-92
, author =	"Y.-A. Chen and Y.-L. Lin and L.-W. Chang"
, title =	"A systolic algorithm for the k-nearest neighbors problem"
, journal =	"IEEE Trans. Comput."
, volume =	41
, number =	1
, year =	1992
, pages =	"103--108"
, keywords =	"proximity, parallel computation"
, update =	"95.09 korneenko"
}

@inproceedings{chil-pcrat-90
, author =	"Y.-B. Chen and M. Hsieh and A. Inselberg and H. Q. Lee"
, title =	"Planar conflict resolution for air traffic control"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"160--163"
, cites =	"ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{ci-opodp-92
, author =	"Y.-B. Chen and D. Ierardi"
, title =	"Oblivious plans for orienting and distinguishing polygonal parts"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"204--209"
, cites =	"gme-gsppp-91, g-oppws-93, mw-posfp-85, n-spadp-89, rg-rspid-91, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{ci-omprp-
, author =	"Y. B. Chen and D. Ierardi"
, title =	"Optimal Motion Planning for a Rod in the Plane Subject to Acceleration and Velocity Constraints"
, type =	"Technical {Report}"
, institution =	"Univ. Southern California"
, year =	"??"
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@techreport{ci-omprp-92
, author =	"Y. B. Chen and D. Ierardi"
, title =	"Optimal Motion Planning for a Rod in the Plane Subject to Velocity Constraints"
, type =	"Technical {Report}"
, number =	"USC-CS-92-529"
, institution =	"Univ. Southern California"
, year =	1992
, update =	"98.03 bibrelex"
}

@inproceedings{ci-omprp-93
, author =	"Y.-B. Chen and D. Ierardi"
, title =	"Optimal motion planning for a rod in the plane subject to velocity constraints"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"143--152"
, precedes =	"ci-totrp-97"
, cites =	"cdrx-ckp-88, ci-omprp-92, ci-omprp-, d-upoml-85, g-mpmmm-73, g-meds-75, h-ei-17, h-cvoct-66, irwy-spls-91, l-rmp-91, ls-esmpa-85, o-mpic-87, rt-akpul-89, ss-pmp1c-83, u-pcv-60, ZZZ"
, update =	"98.03 bibrelex+mitchell, 93.09 jones"
}

@article{ci-totrp-97
, author =	"Y.-B. Chen and D. Ierardi"
, title =	"Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints"
, journal =	"Algorithmica"
, volume =	18
, number =	2
, month =	jun
, year =	1997
, pages =	"165--197"
, succeeds =	"ci-omprp-93"
, update =	"98.03 mitchell"
}

@article{ci-copod-95
, author =	"Y.-B. Chen and D. J. Ierardi"
, title =	"The complexity of oblivious plans for orienting and distinguishing polygonal parts"
, journal =	"Algorithmica"
, volume =	14
, year =	1995
, pages =	"367--397"
, update =	"98.07 bibrelex"
}

@techreport{c-sohpm-85
, author =	"Y. C. Chen"
, title =	"Set operations in hierarchical probe model"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Math. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1985
}

% also claimed pages =	"257--265"
@article{cr-esppo-91
, author =	"Y.-M. Chen and P. Ramanan"
, title =	"Euclidean shortest path with presence of obstacles"
, journal =	"Networks"
, volume =	21
, year =	1991
, pages =	"257--267"
, keywords =	"path planning"
, update =	"93.09 milone+mitchell"
}

@inproceedings{c-lutrp-93
, author =	"Zhixiang Chen"
, title =	"Learning Unions of Two Rectangles in the Plane with Equivalence Queries"
, booktitle =	"Proc. 6th ACM Conf. Comput. Learning Theory"
, nickname =	"COLT '93"
, month =	jul
, year =	1993
, pages =	"??"
, update =	"98.07 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{cg-ssvip-88
, author =	"Z. Chen and J. A. Guevara"
, title =	"System selection of very important points ({VIP}) from digital terrain models for constructing triangular irregular networks"
, booktitle =	"Proc. 8th Internat. Sympos. Comput. Assist. Cartography"
, nickname =	"Auto-Carto"
, year =	1988
, pages =	"50--56"
, update =	"98.07 bibrelex"
}

@inproceedings{chmsb-nrm-95
, author =	"Z. Chen and A. T. Holle and B. M. E. Moret and J. Saia and A. Boroujerdi"
, title =	"Network routing models applied to aircraft routing problems"
, booktitle =	"Proc. Winter Simulation Conf."
, year =	1995
, pages =	"1200--1206"
, update =	"98.03 moret"
}

@inproceedings{ct-qrdt-86
, author =	"Z. T. Chen and W. R. Tobler"
, title =	"Quadtree Representation of Digital Terrain"
, booktitle =	"Proc. Autocarto"
, site =	"London"
, year =	1986
, pages =	"475--484"
, update =	"98.11 bibrelex"
}

@inproceedings{cj-fiplp-86
, author =	"Fuhua Cheng and Wein Chung Jiaan"
, title =	"Finding the Intersection Points of a Line With a Polygon and its Applications"
, booktitle =	"Proc. 14th ACM Annu. Computer Sci. Conf."
, nickname =	"CSC '86"
, site =	"Cincinnati"
, year =	1986
, pages =	"448--448"
, keywords =	"intersection, polygon"
, succeeds =	"clc-fiplp-85"
, update =	"01.04 icking, 97.11 bibrelex, 95.09 korneenko"
}

@techreport{clc-fiplp-85
, author =	"F. Cheng and J.-Y. Lu and H.-S. Chang"
, title =	"Finding the intersection points of a line with a polygon and its applications"
, type =	"Report"
, number =	"??"
, institution =	"Inst. Comput. Decision Sci., National Tsing Hua Univ."
, address =	"Taiwan"
, year =	1985
, precedes =	"cj-fiplp-86"
, update =	"95.09 korneenko"
}

@article{cef-ssd-01
, author =	"H.-L. Cheng and H. Edelsbrunner and P. Fu"
, title =	"Shape space from deformation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"191--204"
, update =	"01.11 smid"
}

@article{ccs-cspao-00
, author =	"Q. Cheng and M. Chrobak and G. Sundaram"
, title =	"Computing simple paths among obstacles"
, journal =	"Comput. Geom. Theory Appl."
, volume =	16
, year =	2000
, pages =	"223--233"
, update =	"01.04 smid"
}

@inproceedings{c-stptb-97
, author =	"Siu-Wing Cheng"
, title =	"The {Steiner} Tree Problem for Terminals on the Boundary of a Rectilinear Polygon"
, booktitle =	"Proc. of the DIMACS Workshop on Network Design: Connectivity and Facilities Location"
, site =	"Princeton, NJ"
, month =	apr
, year =	1997
, update =	"98.03 mitchell"
, annote =	"Submitted to Theoretical Computer Science.  They give an
                  $O(k^3n)$ algorithm for finding a min rectilinear
                  Steiner tree
                  for n points on the boundary of a rectilinear
                  k-gon.  They use dynamic programming."
}

@inproceedings{c-wecml-94
, author =	"S.-W. Cheng"
, title =	"Widest Empty Corridor with Multiple Links and Right-Angle Turns"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"57--62"
, cites =	"cd-kdcp-90, hm-fwecs-88, jp-wcp-93t, st-pplup-86, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{c-welsc-96
, author =	"S.-W. Cheng"
, title =	"Widest empty {L}-shaped corridor"
, journal =	"Inform. Process. Lett."
, volume =	58
, year =	1996
, pages =	"277--283"
, update =	"96.09 smid"
}

@article{cefl-dapsd-01
, author =	"S.-W. Cheng and H. Edelsbrunner and P. Fu and K.-P. Lam"
, title =	"Design and analysis of planar shape deformation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"205--218"
, update =	"01.11 smid"
}

@inproceedings{cgt-ecabs-95
, author =	"Siu Wing Cheng and Mordecai J. Golin and Jeffrey C. F. Tsang"
, title =	"Expected Case Analysis of $\Beta$-Skeletons with Applications to the Construction of Minimum-Weight Triangulations"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"279--284"
, update =	"95.09 jones"
}

@article{cj-arsis-92
, author =	"S. W. Cheng and R. Janardan"
, title =	"Algorithms for ray-shooting and intersection searching"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"670--692"
, update =	"93.09 smid"
}

@article{cj-edasg-90
, author =	"S. W. Cheng and R. Janardan"
, title =	"Efficient dynamic algorithms for some geometric intersection problems"
, journal =	"Inform. Process. Lett."
, volume =	36
, year =	1990
, pages =	"251--258"
}

@inproceedings{cj-emuil-90
, author =	"S. W. Cheng and R. Janardan"
, title =	"Efficient maintenance of the union intervals on a line, with applications"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"74--83"
, precedes =	"cj-emuil-91"
}

@article{cj-emuil-91
, author =	"S. W. Cheng and R. Janardan"
, title =	"Efficient maintenance of the union intervals on a line, with applications"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"57--74"
, succeeds =	"cj-emuil-90"
}

@techreport{cj-nrdpp-90
, author =	"S. W. Cheng and R. Janardan"
, title =	"New Results on Dynamic Planar Point Location"
, type =	"Technical {Report}"
, number =	"TR 90-13"
, institution =	"Dept. Comput. Sci., Univ. Minnesota"
, address =	"Minneapolis, MN"
, year =	1990
, update =	"97.11 bibrelex"
}

@article{cj-nrdpp-92
, author =	"S. W. Cheng and R. Janardan"
, title =	"New results on dynamic planar point location"
, journal =	"SIAM J. Comput."
, volume =	21
, year =	1992
, pages =	"972--999"
, keywords =	"point location, dynamization"
}

@inproceedings{cj-nrdpl-90
, author =	"S. W. Cheng and R. Janardan"
, title =	"New results on dynamic point location"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"96--105"
, keywords =	"point location, dynamization"
}

@inproceedings{cj-sersi-91
, author =	"S. W. Cheng and R. Janardan"
, title =	"Space-efficient ray shooting and intersection searching: algorithms, dynamization and applications"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"7--16"
, keywords =	"ray tracing, dynamization, spanning trees of low stabbing number"
}

@inproceedings{cl-qrsam-98
, author =	"Siu-Wing Cheng and Kam-Hing Lee"
, title =	"Quadtree Decomposition, {S}teiner Triangulation, and Ray Shooting"
, booktitle =	"ISAAC: 9th Internat. Sympos. Algorithms Computation"
, year =	1998
, pages =	"367--376"
, url =	"citeseer.nj.nec.com/cheng98quadtree.html"
, update =	"01.07 orourke"
}

@inproceedings{clw-orste-93
, author =	"Siu-Wing Cheng and Andrew Lim and Ching-Ting Wu"
, title =	"Optimal Rectilinear {Steiner} Tree for Extremal Point Sets"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"523--532"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@inproceedings{ct-facor-95
, author =	"Siu-Wing Cheng and Chi-Keung Tang"
, title =	"A Fast Algorithm for Computing Optimal Rectilinear {Steiner} Trees for Extremal Point Sets"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"322--331"
, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@inproceedings{cx-alesw-96
, author =	"Siu-Wing Cheng and Yin-Feng Xu"
, title =	"Approaching the Largest $\beta$-Skeleton within a Minimum Weight Triangulation"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"196--203"
, cites =	"aatr-tin-95, beemt-eiot-93, dmm-naefm-95, dg-aivib-70, e-acg-87, g-nrpt-79, gmi-hibef-90, hp-nrmwt-94, k-csmwt-94, kr-fcm-85, lk-qgtam-96, l-nhmwt-87, ph-hta-87, y-bsmwt-95, yxy-cdapp-94, y-cdcrc-75, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{cx-cistp-95
, author =	"Siu-Wing Cheng and Yin-Feng Xu"
, title =	"Constrained independence systems and triangulations of planar point sets"
, editor =	"Ding-Zhu Du and Ming Li"
, booktitle =	"Proc. 1st Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '95"
, site =	"Xi'an, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	959
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"275--291"
, precedes =	"aacktrx-tin-96"
, update =	"99.11 bibrelex, 97.03 rote"
}

@article{cfnwlm-moopb-95
, author =	"W. Cheng and J. Y. H. Fu and A. Y. C. Nee and Y. S. Wong and H. T. Loh and T. Miyazawa"
, title =	"Multi-objective optimization of part-building orientation in stereolithography"
, journal =	"Rapid Prototyping Journal"
, volume =	1
, year =	1995
, pages =	"12--23"
, update =	"99.07 smid"
}

@article{cik-nmicu-88
, author =	"Y. Cheng and S. S. Iyengar and R. L. Kashyap"
, title =	"A new method of image compression using irreducible cover of maximal rectangles"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	14
, number =	5
, year =	1988
, pages =	"651--658"
, keywords =	"isothetic, covering"
, update =	"95.09 korneenko"
}

@inproceedings{cu-spcsw-95
, author =	"Christian Chenier and Jorge Urrutia"
, title =	"Shortest Paths in Convex and Simple Weighted Polygons"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"175--179"
, update =	"95.09 jones"
}

@article{co-rpwdu-01
, author =	"Otfried Cheong and Ren{\'e} van Oostrum"
, title =	"Reaching a Polygon With Directional Uncertainty"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"197--214"
, update =	"01.07 smid, 01.04 icking"
}

@article{ch-dspc2-90
, author =	"C. Cherfils and F. Hermeline"
, title =	"Diagonal Swap Procedures and Characterizations of 2{D}-{Delaunay} Triangulations"
, journal =	"RAIRO-Mathematical Modelling And Numerical Analysis-Modelisation Mathematique Et Analyse Numerique"
, volume =	24
, number =	5
, year =	1990
, pages =	"613--625"
, annote =	"Proves that Delaunay switchings converge to DT."
}

@article{ct-fmst-76
, author =	"D. Cheriton and R. E. Tarjan"
, title =	"Finding minimum spanning trees"
, journal =	"SIAM J. Comput."
, volume =	5
, year =	1976
, pages =	"724--742"
}

@techreport{ct-apkvc-??
, author =	"J. Cheriyan and R. Thurimella"
, title =	"Algorithms for Parallel $k$-Vertex Connectivity and Sparse Certificates"
, institution =	"Eng. and Theory Center, Cornell Univ."
, address =	"Ithaca, New York"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@article{c-afspm-86
, author =	"B. Cherkassky"
, title =	"An algorithm for finding shortest paths in a maze"
, journal =	"Optimization"
, volume =	17
, number =	2
, year =	1986
, pages =	"237--242"
, keywords =	"motion planning, shortest paths"
, update =	"95.09 korneenko"
}

@incollection{c-cses-67
, author =	"S. S. Chern"
, title =	"Curves and Surfaces in {E}ucidean Space"
, editor =	"S. S. Chern"
, booktitle =	"Studies in Global Geometry and Analaysis"
, series =	"MAA Studies in Mathmatics"
, volume =	4
, publisher =	"Math. Assoc. Amer."
, year =	1967
, pages =	"16--56"
, update =	"01.04 orourke"
}

@incollection{c-cses-89
, author =	"S. S. Chern"
, title =	"Curves and Surfaces in {E}ucidean Space"
, editor =	"S. S. Chern"
, booktitle =	"Global Differential Geometry"
, series =	"Studies in Mathmatics"
, volume =	27
, publisher =	"Math. Assoc. Amer."
, year =	1989
, pages =	"99--139"
, comments =	"Explains/extends s-usedkkk-21"
, update =	"00.11 smid, 00.07 orourke"
}

@article{c-maeth-52
, author =	"H. Chernoff"
, title =	"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of the observations"
, journal =	"Ann. Math. Statist."
, volume =	23
, year =	1952
, pages =	"493--509"
, update =	"96.09 orourke"
}

@article{co-eacf-84
, author =	"N. I. Chernov and G. A. Ososkov"
, title =	"Effective algorithms for circle fitting"
, journal =	"Comput. Phys. Comm."
, volume =	33
, year =	1984
, pages =	"329--333"
, keywords =	"facility location, optimization, fitting, center"
, update =	"96.09 devillers, 95.09 korneenko"
}

@article{cv-fas-92
, author =	"Jean-Marie Chesneaux and Jean Vignes"
, title =	"Les fondements de l'arithm{\'e}tique stochastique"
, journal =	"Compte-rendus de l'acad{\'e}mie des Sciences, Paris"
, volume =	307
, year =	1992
, pages =	"1435--1440"
, update =	"00.03 devillers"
}

@book{c-sm-61
, author =	"N. Chetayav"
, title =	"The stability of motion"
, publisher =	"Pergamon Press"
, address =	"New York, NY"
, year =	1961
, update =	"98.07 bibrelex"
}

@article{c-fnspp-91
, author =	"D. Chetverikov"
, title =	"Fast neighborhood search in planar point sets"
, journal =	"Pattern Recogn. Lett."
, volume =	12
, number =	7
, year =	1991
, pages =	"409--412"
, keywords =	"proximity, points, searching"
, update =	"95.09 korneenko"
}

@inproceedings{c-gqdm3-97
, author =	"L. Chew"
, title =	"Guaranteed quality {Delaunay} meshing in 3D"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"391--393"
, cites =	"be-mgot-92i, beg-pgmg-94, c-gqtm-89, c-gqmgc-93, mv-qmgtd-92i, r-nsaq2-93, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{c-bvdcp-86
, author =	"L. P. Chew"
, title =	"Building {Voronoi} diagrams for convex polygons in linear expected time"
, type =	"Technical Report"
, number =	"PCS-TR90-147"
, institution =	"Dept. Math. Comput. Sci., Dartmouth College"
, address =	"Hanover, NH"
, year =	1986
, succeeds =	"c-bvdcp-86t"
, update =	"98.11 bibrelex, 94.09 lambert, 93.09 devillers"
}

@techreport{c-bvdcp-86t
, author =	"L. P. Chew"
, title =	"Building {Voronoi} diagrams for convex polygons in linear expected time"
, type =	"manuscript"
, year =	1986
, precedes =	"c-bvdcp-86"
, update =	"98.11 bibrelex"
}

@inproceedings{c-cdt-87
, author =	"L. P. Chew"
, title =	"Constrained {Delaunay} triangulations"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"215--222"
, precedes =	"c-cdt-89"
, cites =	"cd-vdbcd-85, c-tipga-86, c-pgsge-, f-savd-86, k-eccs-79, l-prp-78, ls-tacdt-80, ps-cgi-85, y-oavds-84, ZZZ"
, update =	"98.03 bibrelex"
}

@article{c-cdt-89
, author =	"L. P. Chew"
, title =	"Constrained {Delaunay} triangulations"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"97--108"
, succeeds =	"c-cdt-87"
}

@inproceedings{c-gqmgc-93
, author =	"L. P. Chew"
, title =	"Guaranteed-quality mesh generation for curved surfaces"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"274--280"
, cites =	"r-nsaq2-92, be-mgot-92i, beg-pgmg-90, c-gqtm-89, mv-qmgtd-92i, ms-cinap-92, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@techreport{c-gqtm-89
, author =	"L. P. Chew"
, title =	"Guaranteed-quality triangular meshes"
, type =	"Technical {Report}"
, number =	"TR-89-983"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	apr
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{c-nqblv-93
, author =	"L. P. Chew"
, title =	"Near-quadratic bounds for the {$L_1$} {Voronoi} diagram of moving points"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"364--369"
, precedes =	"c-nqblv-97"
, cites =	"ass-sulbl-89, a-vdsfg-91, cd-vdbcd-85, ck-plscc-89, ck-cppop-93, gmr-vdmpp-92, kti-mmstl-92, ZZZ"
, update =	"98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
}

@article{c-nqblv-97
, author =	"L. P. Chew"
, title =	"Near-quadratic bounds for the {$L_1$} {Voronoi} diagram of moving points"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"73--80"
, succeeds =	"c-nqblv-93"
, update =	"97.03 devillers"
}

@techreport{c-pgsge-
, author =	"L. P. Chew"
, title =	"Planar Graphs and Sparse Graphs for Efficient Motion Planning in the Plane"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, update =	"98.03 bibrelex"
}

@inproceedings{c-pspdo-85
, author =	"L. P. Chew"
, title =	"Planning the shortest path for a disc in {$O(n^{2} \log n)$} time"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"214--220"
}

@article{c-tapga-89
, author =	"L. P. Chew"
, title =	"There are planar graphs almost as good as the complete graph"
, journal =	"J. Comput. Syst. Sci."
, volume =	39
, year =	1989
, pages =	"205--219"
, succeeds =	"c-tipga-86"
}

@inproceedings{c-tipga-86
, author =	"L. P. Chew"
, title =	"There is a planar graph almost as good as the complete graph"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"169--177"
, precedes =	"c-tapga-89"
, cites =	"aaghi-vpses-85, cd-vdbcd-85, h-oarms-79, ls-tacdt-80, p-aspmt-85, sh-cpp-75, s-spacp-85, ss-spps-84, w-cvgnl-85, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{cdek-gpmds-95
, author =	"L. P. Chew and D. Dor and A. Efrat and K. Kedem"
, title =	"Geometric pattern matching in $d$-dimensional space"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	979
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"264--279"
, update =	"97.03 agarwal, 96.09 agarwal, 96.05 agarwal"
}

@inproceedings{cd-vdbcd-85
, author =	"L. P. Chew and R. L. {Drysdale, III}"
, title =	"Voronoi diagrams based on convex distance functions"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"235--244"
, keywords =	"Voronoi diagrams, points, two-dimensional, $L_{1}$ metric, $L_{p}$ metric, $L_{\infty}$ metric"
, cites =	"c-ign-59, cdl-cler-84, d-gvdgs-79, h-oarms-79, k-eccs-79, kn-lts-63, k-ss-73, l-csta-82, l-tdvdl-80, l-knnvd-82, lw-vdllm-80, osy-rnamp-83, sh-cpp-75, y-oavds-84, ZZZ"
, update =	"97.11 bibrelex, 93.09 drysdale"
}

@techreport{cd-vdsle-84
, author =	"L. P. Chew and R. L. {Drysdale, III}"
, title =	"Voronoi Diagrams to Solve Largest Empty Oriented-Convex-Shape Problems"
, type =	"Extended {Abstract}"
, institution =	"Dept. Math. Comput. Sci., Dartmouth College"
, address =	"Hanover, NH"
, year =	1984
, update =	"97.11 bibrelex"
}

@inproceedings{cf-shvd-88
, author =	"L. P. Chew and S. Fortune"
, title =	"Sorting helps for {Voronoi} diagrams"
, booktitle =	"Proc. 13th Symposium on Mathematical Programming, Japan"
, publisher =	""
, year =	1988
, pages =	""
, update =	"93.09 devillers"
}

@article{cf-shvd-97
, author =	"L. P. Chew and S. Fortune"
, title =	"Sorting helps for {Voronoi} diagrams"
, journal =	"Algorithmica"
, volume =	18
, year =	1997
, pages =	"217--228"
, update =	"97.11 smid"
}

@inproceedings{cghkkk-gpmem-93
, author =	"L. P. Chew and M. T. Goodrich and D. P. Huttenlocher and K. Kedem and J. M. Kleinberg and D. Kravets"
, title =	"Geometric pattern matching under {Euclidean} motion"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"151--156"
, precedes =	"cghkkk-gpmem-97"
, cites =	"ast-apsgo-92, abb-amps-91, ag-mrpc-92, amww-cssgo-88, aiit-mlcop-90, achkm-ecmcp-90, akmsw-mpnrc-91, ab-pptr-88, c-tsplt-91a, cegs-dwclp-92, c-sdsno-87, c-pms-88, csss-otass-89, clr-ia-90, e-acg-87, gjpt-tsp-78, gs-dfbt-78, hs-adaps-92, hks-uevsi-91, isi-mgftc-89, m-apcad-83, r-lbchd-93, ck-igpmp-92, hkk-dvdmh-92i, ps-cgi-85, t-dsna-83, ZZZ"
, update =	"99.03 forrest, 98.11 bibrelex, 97.03 devillers, 94.01 rote, 93.09 milone+mitchell"
}

@article{cghkkk-gpmem-97
, author =	"L. P. Chew and M. T. Goodrich and D. P. Huttenlocher and K. Kedem and J. M. Kleinberg and D. Kravets"
, title =	"Geometric pattern matching under {Euclidean} motion"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"113--124"
, succeeds =	"cghkkk-gpmem-93"
, update =	"97.03 devillers"
}

@article{ck-cppop-93
, author =	"L. P. Chew and K. Kedem"
, title =	"A convex polygon among polygonal obstacles: {Placement} and high-clearance motion"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"59--89"
, succeeds =	"ck-plscc-89"
, update =	"96.09 devillers, 95.05 agarwal"
}

@article{ck-glbmh-98
, author =	"L. Paul Chew and Klara Kedem"
, title =	"Getting around a lower bound for the minimum {Hausdorff} distance"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"197--202"
, update =	"98.11 devillers"
}

@inproceedings{ck-hcmpc-89
, author =	"L. P. Chew and K. Kedem"
, title =	"High-clearance motion planning for a convex polygon among polygonal obstacles"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	20
, succeeds =	"ck-hcmpc-90"
}

@techreport{ck-hcmpc-90
, author =	"L. P. Chew and K. Kedem"
, title =	"High-clearance motion planning for a convex polygon among polygonal obstacles"
, type =	"Technical {Report}"
, number =	"184/90"
, institution =	"Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
, address =	"Tel-Aviv, Israel"
, year =	1990
, keywords =	"robotics, motion planning, Voronoi diagrams"
, comments =	"Also Cornell Technical Report TR~90-1133"
, precedes =	"ck-hcmpc-89"
}

@inproceedings{ck-igpmp-92
, author =	"L. P. Chew and K. Kedem"
, title =	"Improvements on geometric pattern matching problems"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"318--325"
}

@inproceedings{ck-plscc-89
, author =	"L. P. Chew and K. Kedem"
, title =	"Placing the largest similar copy of a convex polygon among polygonal obstacles"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"167--174"
, precedes =	"ck-cppop-93"
, cites =	"ab-pptr-88, ass-sulbl-89, a-dcg-83, cd-vdbcd-85, c-pcp-83, c-cdt-89, f-fapct-85, f-savd-87, ks-empac-90, ll-gdtpg-86, ls-pptmc-87, scklps-gadss-86, y-oavds-87, ZZZ"
, update =	"98.03 bibrelex, 94.05 devillers"
}

@techreport{cks-ocpad-94t
, author =	"L. P. Chew and K. Kedem and S. Schirra"
, title =	"On characteristic points and approximate decision algorithms for the minimum {Hausdorff} distance"
, type =	"Report"
, number =	"MPI-I-94-150"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"95.01 smid"
}

@inproceedings{ckstw-vdl3s-95
, author =	"L. Paul Chew and Klara Kedem and Micha Sharir and Boaz Tagansky and Emo Welzl"
, title =	"Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"197--204"
, precedes =	"ckstw-vdl3s-98"
, update =	"00.03 bibrelex, 96.09 agarwal, 96.05 mitchell"
}

@article{ckstw-vdl3s-98
, author =	"L. Paul Chew and Klara Kedem and Micha Sharir and Boaz Tagansky and Emo Welzl"
, title =	"{Voronoi} Diagrams of Lines in 3-Space under Polyhedral Convex Distance Functions"
, journal =	"J. Algorithms"
, volume =	29
, number =	2
, year =	1998
, pages =	"238--255"
, succeeds =	"ckstw-vdl3s-95"
, update =	"00.03 bibrelex"
}

@techreport{cf-shvd-91
, author =	"P. Chew and S. Fortune"
, title =	"Sorting Helps for {Voronoi} Diagrams"
, type =	"Manuscript"
, institution =	"AT\&T Bell Laboratories"
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{cc-rhesc-89
, author =	"D. Chhajed and V. Chandru"
, title =	"Rectilinear hull, efficient sets, convex hull: relationship and algorithms"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	37
}

@inproceedings{c-mnrpd-88
, author =	"G. C.-P. Chi"
, title =	"Method for net representation with polygon decomposition"
, booktitle =	"Proc. Internat. Conf. Computer-Aided Design"
, year =	1988
, pages =	"222--225"
, keywords =	"polygon, decomposition"
, update =	"95.09 korneenko"
}

@phdthesis{c-edt-92
, author =	"C.-S. Chiang"
, title =	"The {Euclidean} distance transform"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, month =	aug
, year =	1992
, note =	"Report CSD-TR 92-050"
, keywords =	"doctoral thesis, geometric transformations, medial axis, two-dimensional, three-dimensional"
, update =	"93.05 jones"
, abstract =	"The medial-axis transform (MAT), also called skeleton, is a
shape abstraction proposed by computer vision, and has a number of important
engineering applications such as finite-element mesh generation.  The theory
for the MAT of 2D solids is investigated.  We prove the uniqueness,
divisibility and connectedness properties of the MAT of 2D solids.
Algorithms are proposed to extract the MAT based on two criteria,
the maximal circle criterion and the equal distance criterion. [....]
The algorithms can be extended to 3D with more complex data structures."
}

@article{c-epioe-98
, author =	"Yi-Jen Chiang"
, title =	"Experiments on the Practical {I/O} Efficiency of Geometric Algorithms: {Distribution} Sweep Versus Plane Sweep"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, number =	4
, year =	1998
, pages =	"211--236"
, succeeds =	"c-epioe-95"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{c-epioe-95
, author =	"Yi-Jen Chiang"
, title =	"Experiments on the Practical {I/O} Efficiency of Geometric Algorithms: {Distribution} Sweep vs. Plane Sweep"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"346--357"
, precedes =	"c-epioe-98"
, update =	"99.07 bibrelex, 98.03 mitchell, 96.01 smid, 95.05 mitchell"
}

@inproceedings{cggtvv-emga-95
, author =	"Y.-J. Chiang and M. T. Goodrich and E. F. Grove and R. Tamassia and D. E. Vengroff and J. S. Vitter"
, title =	"External-Memory Graph Algorithms"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"139--149"
, url =	"http://www.cs.brown.edu/cgc/papers/cggtvv-emga-95.ps.gz"
, update =	"97.03 tamassia, 95.05 tamassia, 95.01 tamassia"
}

@inproceedings{cklm-gacdr-97
, author =	"Y.-J. Chiang and J. T. Klosowski and C. Lee and Joseph S. B. Mitchell"
, title =	"Geometric Algorithms for Conflict Detection/Resolution in ATM"
, booktitle =	"36th IEEE Conference on Decision and Control"
, site =	"San Diego, CA"
, month =	dec
, year =	1997
, pages =	"1835--1840"
, keywords =	"air traffic control, conflict resolution, nearest neighbors"
, update =	"98.03 mitchell"
}

@techreport{cm-tpesp-97
, author =	"Yi-Jen Chiang and Joseph S. B. Mitchell"
, title =	"Two-Point {Euclidean} Shortest Path Queries in the Plane"
, type =	"Technical {Report}"
, institution =	"University at Stony Brook"
, year =	1997
, keywords =	"all-pairs shortest paths, geodesic paths, point location, shortest path maps, visibility"
, update =	"98.03 mitchell"
}

@inproceedings{cm-tpesp-98
, author =	"Yi-Jen Chiang and Joseph S. B. Mitchell"
, title =	"Two-Point {Euclidean} Shortest Path Queries in the Plane"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"55--57"
, update =	"00.03 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{cpt-uadpl-93
, author =	"Y.-J. Chiang and F. P. Preparata and R. Tamassia"
, title =	"A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"44--53"
, precedes =	"cpt-uadpl-96"
, update =	"96.05 smid, 93.05 smid"
}

@article{cpt-uadpl-96
, author =	"Y.-J. Chiang and F. P. Preparata and R. Tamassia"
, title =	"A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"207--233"
, url =	"http://www.cs.brown.edu/cgc/papers/cpt-uadpl-96.ps.gz"
, succeeds =	"cpt-uadpl-93"
, update =	"97.03 tamassia, 96.05 smid, 95.01 tamassia"
}

@inproceedings{cs-ioie-97
, author =	"Y.-J. Chiang and C. T. Silva"
, title =	"{I/O} Optimal Isosurface Extraction"
, booktitle =	"Proc. IEEE Visualization"
, site =	"Phoenix, AZ"
, year =	1997
, pages =	"293--300"
, update =	"98.03 mitchell"
}

@techreport{cs-ielsv-97
, author =	"Y.-J. Chiang and C. T. Silva"
, title =	"Isosurface Extraction in Large Scientific Visualization Applications Using the {I/O}-filter Technique"
, type =	"Manuscript"
, institution =	"University at Stony Brook"
, month =	nov
, year =	1997
, update =	"98.03 mitchell"
}

@techreport{css-iocie-98
, author =	"Yi-Jen Chiang and Claudio T. Silva and William Schroeder"
, title =	"Interactive Out-of-Core Isosurface Extraction"
, institution =	"University at Stony Brook"
, year =	1998
, comments =	"Submitted for publication"
, update =	"98.07 mitchell"
}

@techreport{ct-dacg-91
, author =	"Y.-J. Chiang and R. Tamassia"
, title =	"Dynamic algorithms in computational geometry"
, type =	"Report"
, number =	"CS-91-24"
, institution =	"Comput. Sci. Dept., Brown Univ."
, address =	"Providence, RI"
, year =	1991
, keywords =	"survey paper"
}

@article{ct-dacg-92
, author =	"Y.-J. Chiang and R. Tamassia"
, title =	"Dynamic algorithms in computational geometry"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1412--1434"
, keywords =	"survey paper"
}

@inproceedings{ct-dtmpp-91
, author =	"Y.-J. Chiang and R. Tamassia"
, title =	"Dynamization of the trapezoid method for planar point location"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"61--70"
, keywords =	"point location, subdivision, dynamizing data structures"
, precedes =	"ct-dtmpp-92"
, cites =	"bst-bst-85, cj-nrdpp-90, ct-dacg-91, egs-oplms-86, f-zepud-85, fmn-dgds-85, gt-dtdpl-91, k-osps-83, lp-lppsi-77, m-pst-85, m-dsa-84, ol-mcp-81, o-ddds-83, o-rssls-85, p-nappl-81, ps-cgi-85, pt-fdplm-89, pt-dpplo-90, st-pplup-86, t-irmdp-91, ZZZ"
, update =	"97.11 bibrelex"
}

@article{ct-dtmpp-92
, author =	"Y.-J. Chiang and R. Tamassia"
, title =	"Dynamization of the trapezoid method for planar point location in monotone subdivisions"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"311--333"
, keywords =	"planar point location, dynamic data structures, monotone subdivision, analysis of algorithm"
, succeeds =	"ct-dtmpp-91"
, update =	"94.05 tamassia"
}

@techreport{ct-ospml-94t
, author =	"Y.-J. Chiang and R. Tamassia"
, title =	"Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence of Obstacles"
, type =	"Report"
, number =	"CS-94-03"
, institution =	"Comput. Sci. Dept., Brown Univ."
, address =	"Providence, RI"
, year =	1994
, update =	"94.05 tamassia"
}

@article{ct-ospml-97
, author =	"Y.-J. Chiang and R. Tamassia"
, title =	"Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"85--121"
, url =	"http://www.cs.brown.edu/cgc/papers/ct-ospml-.ps.gz"
, keywords =	"Shortest Path, Minimum-Link Path, dynamic algorithm, CGC, Brown"
, succeeds =	"ct-ospml-94i"
, update =	"98.07 mitchell, 97.11 bibrelex, 97.07 devillers, 97.03 tamassia, 96.09 tamassia, 95.01 tamassia"
}

@inproceedings{ct-ospml-94i
, author =	"Y.-J. Chiang and R. Tamassia"
, title =	"Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, nickname =	"ESA '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"266--277"
, keywords =	"Shortest Path, Minimum-Link Path, dynamic algorithm"
, update =	"95.01 tamassia"
}

@inproceedings{cnytf-ahmgs-96
, author =	"N. Chiba and I. Nisbigaki and Y. Yamasbita and C. Takizawa and K. Fujisbiro"
, title =	"Automatic hexahedral mesh generation system based on shape-recognition and boundary-fit method"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"281--290"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{cns-ampg-79
, author =	"N. Chiba and I. Nishioka and I. Shirakawa"
, title =	"An Algorithm of Maximal Planarization of Graphs"
, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
, year =	1979
, pages =	"649--652"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{cn-asla-85
, author =	"N. Chiba and T. Nishizeki"
, title =	"Arboricity and subgraph listing algorithms"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"210--223"
, update =	"97.11 bibrelex"
}

@article{cn-hcpls-89
, author =	"N. Chiba and T. Nishizeki"
, title =	"The {Hamiltonian} cycle problem is linear-time solvable for 4-connected planar graphs"
, journal =	"J. Algorithms"
, volume =	10
, number =	2
, month =	jun
, year =	1989
, pages =	"187--211"
, update =	"98.11 bibrelex"
}

@article{cnao-laepg-85
, author =	"N. Chiba and T. Nishizeki and S. Abe and T. Ozawa"
, title =	"A Linear Algorithm for Embedding Planar Graphs Using {PQ}-Trees"
, journal =	"J. Comput. Syst. Sci."
, volume =	30
, number =	1
, year =	1985
, pages =	"54--76"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{cns-l5cap-81
, author =	"N. Chiba and T. Nishizeki and N. Saito"
, title =	"A linear $5$-coloring algorithm of planar graphs"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"317--327"
, update =	"98.07 bibrelex"
}

@article{con-dpgn-85
, author =	"N. Chiba and K. Onoguchi and T. Nishizeki"
, title =	"Drawing Planar Graphs Nicely"
, journal =	"Acta Inform."
, volume =	22
, year =	1985
, pages =	"187--201"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@incollection{cyn-lacdp-84
, author =	"N. Chiba and T. Yamanouchi and T. Nishizeki"
, title =	"Linear Algorithms for Convex Drawings of Planar Graphs"
, editor =	"J. A. Bondy and U. S. R. Murty"
, booktitle =	"Progress in Graph Theory"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1984
, pages =	"153--173"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ca-mrsro-89
, author =	"C. Chien and J. Aggarwal"
, title =	"Model reconstruction and shape recognition from occluding contours"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	11
, year =	1989
, pages =	"372--389"
, update =	"98.11 bibrelex"
}

@article{ca-vsort-86
, author =	"C. H. Chien and J. K. Aggarwal"
, title =	"Volume/surface octrees for the representation of three-dimensional objects"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	36
, year =	1986
, pages =	"100--113"
, update =	"98.11 bibrelex"
}

@inproceedings{cs-sglb-95
, author =	"Hank Chien and William Steiger"
, title =	"Some Geometric Lower Bounds"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"72--81"
, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@article{csw-uacpc-85
, author =	"F. Chin and J. Sampson and C. A. Wang"
, title =	"A unifying approach for a class of problems in the computational geometry of polygons"
, journal =	"Visual Comput."
, volume =	1
, year =	1985
, pages =	"124--132"
}

@inproceedings{csw-fmasp-95
, author =	"Francis Chin and Jack Snoeyink and Cao-An Wang"
, title =	"Finding the Medial Axis of a Simple Polygon in Linear Time"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"382--391"
, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@article{csw-fmasp-99
, author =	"F. Chin and J. Snoeyink and C. A. Wang"
, title =	"Finding the Medial Axis of a Simple Polygon in Linear Time"
, journal =	"Discrete Comput. Geom."
, volume =	21
, number =	3
, year =	1999
, pages =	"405--420"
, update =	"99.07 held"
}

@article{cw-fcdtc-98
, author =	"F. Chin and C. A. Wang"
, title =	"Finding the constrained {Delaunay} triangulation and constrained {Voronoi} diagram of a simple polygon in linear time"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1998
, pages =	"471--486"
, update =	"99.07 smid"
}

@article{cw-mvdbs-84
, author =	"F. Chin and C. A. Wang"
, title =	"Minimum vertex distance between separable convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	18
, year =	1984
, pages =	"41--45"
}

@article{cw-oaimd-83
, author =	"F. Chin and C. A. Wang"
, title =	"Optimal Algorithms for the Intersection and the Minimum Distance Problems between Planar Polygons"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, number =	12
, year =	1983
, pages =	"1203--1207"
, update =	"93.09 held"
}

@article{ckl-eicrs-84
, author =	"F. Y. Chin and P. Kossowki and S. C. Loh"
, title =	"Efficient interference control for range sum queries"
, journal =	"Theoret. Comput. Sci."
, volume =	32
, year =	1984
, pages =	"77--86"
}

@inproceedings{cw-dgtp3-95
, author =	"Francis Y. Chin and Cao An Wang"
, title =	"On the Difficulty of Greedy Tetrahedralization of Points in $3$-D"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"285--290"
, update =	"95.09 jones"
}

@article{cf-fopsg-92
, author =	"Norman Chin and Steven Feiner"
, title =	"Fast object-precision shadow generation for areal light sources using {BSP} trees"
, journal =	"Comput. Graph."
, volume =	25
, month =	mar
, year =	1992
, pages =	"21--30"
, note =	"Proc. 1992 Sympos. Interactive 3D Graphics"
, keywords =	"shadow volume, area light source, penumbra, umbra"
, update =	"98.07 bibrelex, 97.07 agarwal"
}

@inproceedings{cf-nrtsg-89
, author =	"Norman Chin and Steven Feiner"
, title =	"Near Real-Time Shadow Generation Using {BSP} Trees"
, booktitle =	"Proc. SIGGRAPH '89"
, volume =	23
, number =	3
, publisher =	"ACM SIGGRAPH"
, address =	"New York"
, month =	aug
, year =	1989
, pages =	"99--106"
, update =	"98.11 bibrelex, 97.07 agarwal, 97.03 schwarzkopf"
}

@article{cd-mbrrv-86
, author =	"R. T. Chin and C. R. Dyer"
, title =	"Model-based recognition in robot vision"
, journal =	"ACM Comput. Surv."
, volume =	18
, year =	1986
, pages =	"67--108"
, update =	"97.11 bibrelex"
}

@inproceedings{cn-owr-86
, author =	"W. Chin and S. Ntafos"
, title =	"Optimum watchman routes"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"24--33"
, precedes =	"cn-owr-88"
, cites =	"at-eadps-81, c-ctpg-75, cw-oaimd-83, e-cedbt-85, eow-sgrag-84, f-spcwt-78, gj-cigtn-79, gjpt-tsp-78, kkk-tgrfw-83, ll-ccagp-86, lp-esppr-84, ln-prpss-91, l-dprcq-85, o-aprag-83, o-gnfmg-83, p-etspi-77, s-oadrp-82, ZZZ"
, update =	"97.11 bibrelex"
}

@article{cn-owr-88
, author =	"W. Chin and S. Ntafos"
, title =	"Optimum watchman routes"
, journal =	"Inform. Process. Lett."
, volume =	28
, year =	1988
, pages =	"39--44"
, succeeds =	"cn-owr-86"
, precedes =	"cn-wrsp-91"
}

@article{cn-ozkr-89
, author =	"W. Chin and S. Ntafos"
, title =	"Optimum zoo-keeper routes"
, journal =	"Congr. Numer."
, volume =	"??"
, year =	1989
, update =	"98.11 bibrelex"
}

@article{cn-ozr-87
, author =	"W.-P. Chin and S. Ntafos"
, title =	"Optimum zookeeper routes"
, journal =	"Congr. Numer."
, volume =	58
, year =	1987
, pages =	"257--266"
, note =	"Combinatorics, Graph Theory and Computing. Proc. 20th South-East Conf., Boca Raton"
, keywords =	"visibility"
, update =	"95.09 korneenko"
}

@techreport{cn-swrsp-
, author =	"W. P. Chin and S. Ntafos"
, title =	"Shortest Watchman Routes in simple polygons"
, type =	"Technical Report"
, precedes =	"cn-wrsp-91, cn-wrsp-87"
, update =	"98.11 bibrelex"
}

@article{cn-wrsp-91
, author =	"W.-P. Chin and S. Ntafos"
, title =	"Shortest Watchman routes in simple polygons"
, journal =	"Discrete Comput. Geom."
, volume =	6
, number =	1
, year =	1991
, pages =	"9--31"
, keywords =	"visibility"
, succeeds =	"cn-owr-88, cn-swrsp-"
, update =	"98.11 bibrelex"
}

@techreport{cn-wrsp-87
, author =	"W. P. Chin and S. Ntafos"
, title =	"Watchman routes in simple polygons"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Univ. Texas"
, address =	"Dallas, TX"
, year =	1987
, succeeds =	"cn-swrsp-"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@techreport{ckt-cgp-89
, author =	"Y. T. Ching and M. T. Ko and H. Y. Tu"
, title =	"On the cruising guard problems"
, type =	"Technical {Report}"
, institution =	"Inst. Inform. Sci., Academia Sinica"
, address =	"Taipei, Taiwan"
, year =	1989
, update =	"97.11 bibrelex"
}

@techreport{cl-fdsl-83
, author =	"Y. T. Ching and D. T. Lee"
, title =	"Finding the diameter of a set of lines"
, type =	"Manuscript"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
, address =	"Evanston, IL"
, year =	1983
, precedes =	"cl-fdsl-85"
, update =	"95.09 korneenko"
}

@article{cl-fdsl-85
, author =	"Y. T. Ching and D. T. Lee"
, title =	"Finding the diameter of a set of lines"
, journal =	"Pattern Recogn. Lett."
, volume =	18
, number =	"3--4"
, year =	1985
, pages =	"249--255"
, succeeds =	"cl-fdsl-83"
, update =	"95.09 korneenko, 95.01 smid"
}

@article{cms-ddds-90
, author =	"Y.-T. Ching and K. Mehlhorn and M. Smid"
, title =	"Dynamic deferred data structuring"
, journal =	"Inform. Process. Lett."
, volume =	35
, number =	1
, year =	1990
, pages =	"37--40"
, keywords =	"data structuring, deferred data structures"
, update =	"00.03 smid, 95.09 korneenko"
}

@book{cs-fctgm-66
, author =	"W. G. Chinn and N. E. Steenrod"
, title =	"First Concepts of Topology: The Geometry of Mappings of Segments, Curves, Circles, and Disks"
, publisher =	"Mathematical Association of America"
, address =	"Washington, DC"
, year =	1966
}

@inproceedings{cky-ommmu-88
, author =	"A. E. Chiou and M. Khoshnevisan and P. Yeh"
, title =	"Optical matrix-matrix multiplication using multicolor four-wave mixing"
, booktitle =	"Proc. SPIE"
, volume =	881
, year =	1988
, pages =	"250--257"
, update =	"97.11 bibrelex"
}

@techreport{cg-stssa-83
, author =	"A. Chistov and d. Grigoryev"
, title =	"Subexponential-Time Solving Systems of Algebraic Equations I"
, type =	"Preprint"
, number =	"E-9-83"
, institution =	"Steklov Inst."
, year =	1983
, update =	"97.11 bibrelex"
}

@article{cw-mpcp-90
, author =	"J.-S. Chiu and J.-S. Wang"
, title =	"Monotone polygon containment problem"
, journal =	"J. Inform. Process."
, volume =	13
, number =	4
, year =	1990
, pages =	"486--493"
, keywords =	"monotone polygon, containment"
, update =	"95.09 korneenko"
}

@inproceedings{cw-mpcpu-89
, author =	"J.-S. Chiu and J.-S. Wang"
, title =	"Monotone polygon containment problems under translation"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"123--130"
, keywords =	"monotone polygons, rectilinear polygons, polygon containment"
, update =	"95.09 mitchell"
}

@incollection{csw-mjs-94
, author =	"Kenneth Chiu and Peter Shirley and Changyaw Wang"
, title =	"Multi-Jittered Sampling"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"370--374"
, keywords =	"antialiasing, jitter, stochastic sampling"
, update =	"94.09 heckbert"
, annote =	"Presents a new technique for high quality stochastic
sampling. This is useful for antialiasing. Contains C code."
}

@inproceedings{ck-dsffs-83
, author =	"H. Chiyokura and F. Kimura"
, title =	"Design of Solids with free-form surfaces"
, booktitle =	"Proc. Siggraph"
, site =	"Detroit"
, year =	1983
, pages =	"289--298"
, update =	"98.03 bibrelex"
}

@article{cdk-otigc-95
, author =	"B. S. Chlebus and K. Diks and M. Kowaluk"
, title =	"$O(\log\log n)$-time integer geometry on the CRCW PRAM"
, journal =	"Algorithmica"
, volume =	14
, year =	1995
, pages =	"52--69"
, update =	"95.09 smid"
}

@article{cf-irtvc-99
, author =	"F. S. Cho and D. Forsyth"
, title =	"Interactive Ray Tracing with the Visibility Complex"
, journal =	"Computers and Graphics (Special Issue on Visibility - Techniques and Applications)"
, volume =	23
, number =	5
, year =	1999
, pages =	"703--717"
, update =	"01.04 pocchiola"
}

@article{ckj-csatp-97
, author =	"B. K. Choi and D. H. Kim and R. B. Jerard"
, title =	"C-Space Approach to Tool-path Generation for Die and Mould Machining"
, journal =	"Comput. Aided Design"
, volume =	29
, number =	9
, month =	sep
, year =	1997
, pages =	"657--669"
, update =	"97.11 held"
}

@article{csyl-tsd3d-88
, author =	"B. K. Choi and H. Y. Shin and Y. I. Yoon and J. W. Lee"
, title =	"Triangulation Of Scattered Data In 3d Space"
, journal =	"Comput. Aided Design"
, volume =	20
, number =	5
, month =	jun
, year =	1988
, pages =	"239--248"
, keywords =	"three-dimensional triangulation procedure, Thiessen polygonization, optimal partitioning, surface interpolation, 3d space"
, annote =	"Incremental algorithm for 3D triangulation. Points are
		 sorted by angle from a particular point and then joined
		 to all the visible points. Then switchings are done to
		 insert constrained edges. (I don't see how this is
		 possible, because of non-convex quads.) Switchings are
		 then done to minimize the angle between adjacent
		 triangles."
, abstract =	"Triangular interpolants are widely used to construct
		 smooth surfaces from scattered data in 3D. To apply
		 smooth triangular interpolants, the input 3D points
		 have to be triangulated. An algorithmic procedure for
		 3D triangulation is presented. Relevant algorithms and
		 datastructures are described in detail. Existing
		 methods of 2D triangulation are based on Thiessen
		 polygonization, which is an optimal partitioning of a
		 geometric domain. To obtain an optimal triangular grid
		 on the domain, the max-min angle criterion is
		 frequently used. As there is no domain for 3D points, a
		 new criterion called the smoothness criterion is
		 proposed. (Edited author abstract). 15 Refs."
}

@article{ccm-mtmat-97
, author =	"Hyeong In Choi and Sung Woo Choi and Hwan Pyo Moon"
, title =	"Mathematical theory of medial axis transform"
, journal =	"Pacific Journal of Mathematics"
, volume =	181
, number =	1
, year =	1997
, pages =	"57--88"
, update =	"01.07 devillers"
}

@article{ccm-namat-97
, author =	"H. I. Choi and S. W. Choi and H. P. Moon"
, title =	"New Algorithm for Medial Axis Transform of Plane Domain"
, journal =	"Graph. Models Image Process."
, volume =	59
, number =	6
, month =	nov
, year =	1997
, pages =	"463--483"
, update =	"98.07 held"
}

@article{chmrw-matoc-99
, author =	"H. I. Choi and C. Y. Han and H. P. Moon and K. H. Roh and N. S. Wee"
, title =	"Medial Axis Transform and Offset Curves by {Minkowski} {Pythagorean} Hodograph Curves"
, journal =	"Comput. Aided Design"
, volume =	31
, number =	1
, month =	mar
, year =	1999
, pages =	"59--72"
, update =	"99.07 held"
}

@article{ck-stasr-92
, author =	"H. K. Choi and C. M. Kyung"
, title =	"A shadow-testing acceleration scheme for ray tracing"
, journal =	"Comput. Aided Design"
, volume =	24
, number =	2
, year =	1992
, pages =	"93--104"
, keywords =	"ray tracing, computer graphics"
, update =	"95.09 korneenko"
}

@inproceedings{csy-aesp3-94
, author =	"J. Choi and J. Sellen and C. K. Yap"
, title =	"Approximate {Euclidean} Shortest Path in $3$-Space"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"41--48"
, keywords =	"ray shooting, octrees, quadtress, simple cover complexity"
, precedes =	"csy-aesp3-97"
, cites =	"b-fmpee-76, cr-nlbtr-87, c-aaspm-87, egppss-acptc-92, l-vta-50, p-aspmt-85, hs-ecesp-93, y-tegc-93, y-fpaa-93, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex+mitchell, 95.09 agarwal, 94.09 jones, 94.01 jones"
}

@article{csy-aesp3-97
, author =	"J. Choi and J. Sellen and C. K. Yap"
, title =	"Approximate {Euclidean} Shortest Paths in $3$-Space"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, number =	4
, month =	aug
, year =	1997
, pages =	"271--295"
, keywords =	"shortest paths, geodesics, approximation algorithm, bit complexity, precision"
, succeeds =	"csy-aesp3-94"
, update =	"98.03 mitchell"
, annote =	"Special issue devoted to SoCG'94"
}

@inproceedings{csy-psesp-95
, author =	"Joonsoo Choi and J{\"u}rgen Sellen and Chee-Keng Yap"
, title =	"Precision-Sensitive {Euclidean} Shortest Path in 3-Space"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"350--359"
, keywords =	"bit complexity, shortest paths"
, cites =	"b-earsh-92, b-hsrr-90, cr-nlbtr-87, csy-aesp3-94, g-cra-67, r-ccgfo-89, p-aspmt-85, p-cc-94, r-ca-70, ss-spps-86, vv-niedu-86, w-aep-65, y-tegc-93, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{cy-mrgds-96
, author =	"Joonsoo Choi and Chee-Keng Yap"
, title =	"Monotonicity of Rectilinear Geodesics in $d$-Space"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"339--348"
, cites =	"aaghi-vdp-86, ac-prspr-91, acm-mpoap-89, c-gphd-95, cy-rg3s-95, rlw-rsprb-85, rlw-rsppr-89, em-osrqa-94, hs-ecesp-93, lp-esppr-84, m-psp-86, mrw-mlpop-92, w-cvgnl-85, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{cy-rg3s-95
, author =	"Joonsoo Choi and Chee-Keng Yap"
, title =	"Rectilinear Geodesics in 3-Space"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"380--389"
, keywords =	"shortest paths, monotonicity, boxes"
, cites =	"aaghi-vdp-86, ckv-rsptp-87, bkno-spqrw-92, rlw-rsppr-89, e-acg-87, em-osrqa-94, gm-osacv-91, hs-ecesp-93, l-tdvdl-80, m-wcohs-87, m-lsppo-92, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@phdthesis{c-gphd-95
, author =	"J. S. Choi"
, title =	"Geodesic problems in high dimensions"
, school =	"Courant Institute, New York University"
, address =	"New York"
, month =	jun
, year =	1995
, keywords =	"shortest paths"
, update =	"96.05 mitchell"
}

@mastersthesis{c-vpgr-92
, author =	"S.-H. Choi"
, title =	"Visibility Properties of Graphs and Their Recognition"
, school =	"Department of Computer Science, Korea Advanced Institute of Science and Technology"
, year =	1992
, keywords =	"master thesis"
, update =	"98.11 bibrelex"
}

@article{csc-crvgf-95
, author =	"S. H. Choi and S. Y. Shin and K. Y. Chwa"
, title =	"Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon"
, journal =	"Algorithmica"
, volume =	14
, year =	1995
, pages =	"27--51"
, update =	"95.09 smid"
}

@inproceedings{csc-crvgf-92
, author =	"S. H. Choi and S. Y. Shin and K. Y. Chwa"
, title =	"Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"219--228"
, update =	"94.09 smid, 94.01 choi, 93.09 milone+mitchell"
}

@article{cp-htamp-94
, author =	"Y.-K. Choi and K. H. Park"
, title =	"A Heuristic Triangulation Algorithm for Multiple Planar Contours Using an Extended Double Branching Procedure"
, journal =	"Visual Comput."
, volume =	10
, number =	7
, year =	1994
, pages =	"372--387"
, update =	"96.01 held"
}

@inproceedings{cr-gfsso-99
, author =	"J. Chomicki and P. Z. Revesz"
, title =	"A geometric framework for specifying spatiotemporal objects"
, booktitle =	"Proc. 6th Intl. Workshop on Time Representation and Reasoning"
, year =	1999
, pages =	"41--46"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{cl-fccot-93
, author =	"K. W. Chong and T. W. Lam"
, title =	"Finding connected components in $O(\log n \log \log n)$ time on the {EREW PRAM}"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"11--20"
, update =	"96.09 orourke"
}

@inproceedings{ck-scisc-93
, author =	"A. Chou and K. Ko"
, title =	"Some Complexity Issues on the Simply Connected Regions of the Two-Dimensional Plane"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"??"
}

@phdthesis{c-ncmmt-89
, author =	"J. J. Chou"
, title =	"Numerical control milling machine toll path generation for regions bounded by free form curves and surfaces"
, type =	"Ph.{D}. Thesis"
, school =	"Univ. Utah"
, year =	1989
, keywords =	"doctoral thesis"
, update =	"93.05 freimer"
}

@article{c-vdps-95
, author =	"J. J. Chou"
, title =	"Voronoi Diagrams for Planar Shapes"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	15
, number =	2
, month =	mar
, year =	1995
, pages =	"52--59"
, update =	"96.01 held"
}

@article{c-opcrt-91
, author =	"P. Chou"
, title =	"Optimal partitioning for classification and regression trees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	13
, year =	1991
, pages =	"340--354"
, update =	"98.07 bibrelex, 96.09 agarwal"
}

@book{c-mgtp-88
, author =	"S.-C. Chou"
, title =	"Mechanical Geometry Theorem Proving"
, publisher =	"D. Reidel"
, year =	1988
, update =	"98.03 bibrelex"
}

@incollection{c-pegtu-84
, author =	"S.-C. Chou"
, title =	"Proving elementary geometry theorems using {Wu}'s algorithm"
, booktitle =	"Contemporary Mathematics"
, volume =	29
, publisher =	"American Mathematical Society"
, year =	1984
, pages =	"243--286"
, update =	"98.03 bibrelex"
}

@incollection{cr-mpgt-92
, author =	"S.-C. Chou and M. Rathi"
, title =	"Machine proofs of geometry theorems"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"91--115"
, keywords =	"survey paper, machine proofs"
, precedes =	"cr-mpgt-95"
, update =	"98.07 icking, 93.09 erickson"
}

@incollection{cr-mpgt-95
, author =	"Shang-Ching Chou and Mahesh Rathi"
, title =	"Machine Proofs of Geometry Theorems"
, editor =	"Ding-Zhu Du and Frank Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"124--148"
, keywords =	"survey paper"
, succeeds =	"h-dqgpg-92"
, update =	"98.07 icking"
}

@article{ct-lsm3d-93
, author =	"Sheng-Lin Chou and Wen-Hsiang Tsai"
, title =	"Line segment matching for 3d computer vision using a new iteration scheme"
, journal =	"Mach. Vison Appl."
, volume =	6
, year =	1993
, pages =	"191--205"
, update =	"97.11 bibrelex"
}

@article{cwcts-shio-94
, author =	"S.-Y. Chou and T. C. Woo and L.-L. Chen and K. Tang and S. Y. S hin"
, title =	"Scallop Hull and Its Offset"
, journal =	"Comput. Aided Design"
, volume =	26
, number =	7
, month =	jul
, year =	1994
, pages =	"537--542"
, update =	"97.11 held"
}

@article{ccb-maacm-89
, author =	"Y.-C. Chou and V. Chandru and M. M. Barash"
, title =	"A mathematical approach to automatic configuration of machining fixtures: {Analysis} and synthesis"
, journal =	"J. of Engineering for Industry"
, volume =	111
, month =	nov
, year =	1989
, update =	"98.03 bibrelex"
}

% ### What is it?
@inproceedings{cm-pacms-87
, author =	"S. Choudhury and M. Murty"
, title =	"A parallel architecture for constructing the minimal spanning tree in {Euclidean} space"
, booktitle =	"Tencon'87"
, volume =	2
, year =	1987
, pages =	"793--795"
, keywords =	"parallel computation, minimal spanning tree"
, update =	"95.09 korneenko"
}

@inproceedings{c-padch-81
, author =	"A. L. Chow"
, title =	"A parallel algorithm for determining convex hulls of sets of points in two dimensions"
, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
, year =	1981
, pages =	"214--223"
}

@inproceedings{c-ppari-81
, author =	"A. L. Chow"
, title =	"A Practical Parallel Algorithm for Reporting Intersections of Rectangles"
, booktitle =	"IEEE Sympos. Parallel Processing"
, year =	1981
, pages =	"304--305"
, update =	"93.09 held"
}

@phdthesis{c-pagp-80
, author =	"A. L. Chow"
, title =	"Parallel algorithms for geometric problems"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1980
, keywords =	"doctoral thesis"
, comments =	"UMI KRA81-08465, 163 pp."
, update =	"93.09 jones"
}

% March 29--April 3
@inproceedings{c-ftcl-87
, author =	"Albert H. J. Christensen"
, title =	"Fitting a Triangulation to Contour Lines"
, booktitle =	"Proceedings, AUTOCARTO 8"
, site =	"Baltimore, MD"
, year =	1987
, pages =	"57--67"
, annote =	"Constrained Delaunay triangulation of contours +
		 medial axes of contours. This avoids the problem of a
		 triangle with all three vertices on the same contour."
}

@article{c-kiikf-50
, author =	"C. Christensen"
, title =	"Kvadrat indskrevet i konveks figur"
, journal =	"Matematisk Tiddskrifft B"
, volume =	1950
, year =	1950
, pages =	"22--26"
, update =	"98.07 bibrelex"
}

@inproceedings{cfms-etavs-97
, author =	"J. Christensen and S. Friedman and J. Marks and S. Shieber"
, title =	"Empirical Testing of Algorithms for Variable-Sized Label Placement"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"415--417"
, cites =	"cms-esapf-95, ecms-gcla-97, ww-pmla-97, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{cms-aclp-93
, author =	"J. Christensen and J. Marks and S. Shieber"
, title =	"Algorithms for cartographics label placement"
, booktitle =	"Proc. 1993 ASPRS/ACSM Annual Convention and Exposition"
, volume =	1
, year =	1993
, pages =	"75--89"
, update =	"98.07 bibrelex"
}

@article{cms-esapf-95
, author =	"J. Christensen and J. Marks and S. Shieber"
, title =	"An empirical study of algorithms for point-feature label placement"
, journal =	"ACM Trans. Graph."
, volume =	14
, year =	1995
, pages =	"202--232"
, update =	"97.07 agarwal"
}

@incollection{cms-ptlmd-94
, author =	"Jon Christensen and Joe Marks and Stuart Shieber"
, title =	"Placing Text Labels on Maps and Diagrams"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"497--504"
, keywords =	"cartography, label placement, layout, relaxation, simulated annealing"
, update =	"94.09 heckbert"
, annote =	"Presents an algorithm to arrange text labels in a way that
avoids overlap. This is useful in cartography."
}

@article{cs-cccld-78
, author =	"N. N. Christiansen and T. W. Sederberg"
, title =	"Conversion of complex contour line definitions into polygonal element mosaic"
, journal =	"Comput. Graphics"
, volume =	12
, number =	2
, year =	1978
, pages =	"187--192"
, keywords =	"computer graphics, contours, shape, polyhedra, surfaces, approximation"
, update =	"95.09 korneenko"
}

@techreport{cjr-cdtsp-90
, author =	"T. Christof and M. J{\"u}nger and G. Reinelt"
, title =	"A complete description of the traveling salesman polytope on $8$ nodes"
, type =	"Report"
, number =	"249-1990"
, institution =	"Institut f{\"u}r Mathematik, Universit{\"a}t Augsburg"
, address =	"Augsburg, Germany"
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{c-wcanh-76
, author =	"N. Christofides"
, title =	"Worst-case analysis of a new heuristic for the traveling salesman problem"
, editor =	"J. F. Traub"
, booktitle =	"Sympos. on New Directions and Recent Results in Algorithms and Complexity"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1976
, pages =	441
}

@misc{cdh-p5cpg-87
, author =	"M. Chrobak and K. Diks and T. Hagerup"
, title =	"Parallel $5$-colouring of planar graphs"
, year =	1987
, note =	"Preprint"
, update =	"98.03 bibrelex"
}

@inproceedings{cgt-cdgtt-96
, author =	"Marek Chrobak and Michael T. Goodrich and Roberto Tamassia"
, title =	"Convex Drawings of Graphs in Two and Three Dimensions"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"319--328"
, url =	"http://www.cs.brown.edu/cgc/papers/cgt-cdgtt-96.ps.gz"
, keywords =	"graph drawing, straight-line, 3D, convex, CGC, Brown"
, cites =	"a-lbvsc-63, bh-olpgf-87, bo-lwbl-87, con-dpgn-85, cyn-lacdp-84, ck-cgd3c-93, cn-mwgdp-95, cp-ltadp-95, celr-tdgd-95, c-re-82, cw-mmap-90, cw-sfmps-82, dg-caitd-95, fpp-sssfe-88, fpp-hdpgg-90, dett-adgab-94, dtt-arsdp-92, dtv-olcpt-95, ds-ltati-92, eg-dspg-96, esw-tkbtd-95, f-slrpg-48, fhhklsww-dgphr-93, gt-pdara-94, gt-anda-87, g-cp-67, hr-udfs-94, hrs-cchpc-92, ht-dgtc-73, ht-ept-74, hk-prga-92, jj-3dlrg-95, k-dpguc-96, k-dpgul-92, ls-cavg-92, ld-cpdt3-95, lrt-gnd-79, lt-apst-80, mp-arpg-94, m-orfdf-64, ps-cgi-85, r-3dvpi-95, r-e3vpi-95, s-epgg-90, st-ce3cp-92, s-cm-51, sr-vudtd-34, t-pdfip-80, t-prg-84, t-crg-60, t-hdg-63, w-mspp-82, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 tamassia, 96.09 tamassia"
}

@techreport{ck-cgd3c-93
, author =	"M. Chrobak and G. Kant"
, title =	"Convex grid drawings of 3-connected planar graphs"
, type =	"Technical {Report}"
, number =	"RUU-93-45"
, institution =	"Dept. of Computer Sci., Utrecht Univ."
, year =	1993
, keywords =	"graph drawing, planar, convex, straight-line"
, update =	"97.11 bibrelex, 96.09 tamassia"
}

@article{ck-cgd3c-97
, author =	"M. Chrobak and G. Kant"
, title =	"Convex grid drawings of 3-connected planar graphs"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, number =	3
, year =	1997
, pages =	"211--223"
, succeeds =	"ck-cgd3c-93"
, update =	"98.07 tamassia, 97.07 devillers"
}

@techreport{cn-mwgd-94
, author =	"M. Chrobak and S. Nakano"
, title =	"Minimum-width grid drawings of plane graphs"
, type =	"Technical {Report}"
, number =	"UCR-CS-94-5"
, institution =	"Dept.\ of Computer Sci., Univ.\ California, Riverside"
, year =	1994
, keywords =	"graph drawing, planar, straight-line"
, update =	"96.09 tamassia"
}

@inproceedings{cn-mwgdp-95
, author =	"M. Chrobak and S. Nakano"
, title =	"Minimum-Width Grid Drawings of Plane Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"104--110"
, keywords =	"graph drawing, planar, straight-line"
, update =	"95.01 tamassia"
}

@article{cn-mwgdp-98
, author =	"Marek Chrobak and Shin-ichi Nakano"
, title =	"Minimum-Width Grid Drawings of Plane Graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	11
, year =	1998
, pages =	"29--54"
, succeeds =	"cn-mwgd-94, cn-mwgdp-95"
, update =	"99.11 bibrelex, 98.11 devillers+vismara"
}

@article{cp-ltadp-95
, author =	"M. Chrobak and T. Payne"
, title =	"A linear-time algorithm for drawing planar graphs"
, journal =	"Inform. Process. Lett."
, volume =	54
, year =	1995
, pages =	"241--246"
, keywords =	"graph drawing"
, succeeds =	"cp-ltadp-90"
, update =	"96.09 tamassia"
}

@techreport{cp-ltadp-90
, author =	"M. Chrobak and T. H. Payne"
, title =	"A Linear Time Algorithm for Drawing a Planar Graph on a Grid"
, number =	"UCR-CS-90-2"
, institution =	"Dept. of Math. and Comput. Sci., Univ. California Riverside"
, year =	1990
, keywords =	"graph drawing"
, precedes =	"cp-ltadp-95"
, update =	"93.09 tamassia"
}

@inproceedings{cs-ppisp-95
, author =	"Marek Chrobak and G. Sundaram"
, title =	"Paths among points inside a simple polygon"
, booktitle =	"Proc. 5th MSI Stony Brook Workshop on Computational Geometry"
, year =	1995
, url =	"??"
, update =	"96.05 mitchell"
}

@article{csk-dsufh-90
, author =	"M. Chrobak and T. Szymacha and A. Krawczyk"
, title =	"A data structure useful for finding {Hamiltonian} cycles"
, journal =	"Theoret. Comput. Sci."
, volume =	71
, number =	3
, year =	1990
, pages =	"419--424"
, keywords =	"data structuring"
, update =	"95.09 korneenko"
}

@phdthesis{c-sc3di-96
, author =	"Yiorgos Chrysanthou"
, title =	"Shadow Computation for 3D Interaction and Animation"
, type =	"Ph.{D}. Thesis"
, school =	"Queen Mary and Westfield College, University of London"
, year =	1996
, keywords =	"bsp trees, shadow, radiosity"
, update =	"97.07 agarwal"
}

@inproceedings{c-caics-74
, author =	"C. Chryssostomidis"
, title =	"Computer Aided Interference Control and Space Reservation"
, editor =	"Y. Fujita, K. Lind and T. J. Williams"
, booktitle =	"Proc. IFIP/IFAC/JSNA Joint Conference on Computer Applications in the Automation of Shipyard Operation and Ship Design"
, year =	1974
, pages =	"507--513"
, update =	"95.05 abrams"
}

@inproceedings{c-casde-76
, author =	"C. Chryssostomidis"
, title =	"Computer Aided Ship Design Education at the Massachusetts Institute of Technology"
, editor =	"A. Jacobsson, F. Borgstr{\"o}m and T. J. Williams"
, booktitle =	"Proc. IFIP/IFAC/SSI/City of Gothenburg Scandinavian Joint Conference on Computer Applications in the Automation of Shipyard Operation and Ship Design"
, year =	1976
, pages =	"65--71"
, update =	"95.05 abrams"
}

@inproceedings{cp-gmcad-87
, author =	"C. Chryssostomidis and N. M. Patrikalakis"
, title =	"Geometric Modeling in Computer Aided Design of Marine Systems"
, booktitle =	"Proc. 3rd International Symposium on Practical Design of Ships and Mobile Units"
, volume =	"II"
, year =	1987
, pages =	"861--870"
, update =	"95.05 abrams"
}

@article{cp-gmica-88
, author =	"C. Chryssostomidis and N. M. Patrikalakis"
, title =	"Geometric Modeling Issues in Computer Aided Design of Marine Structures"
, journal =	"Marine Technology Society Journal"
, volume =	22
, number =	2
, year =	1988
, pages =	"15--33"
, update =	"95.05 abrams"
}

% yes, 1885
@article{c-pcmce-85
, author =	"G. Chrystal"
, title =	"On the problem to construct the minimal circle enclosing $n$ given points in the plane"
, journal =	"Proc. Edinburgh Math. Soc."
, volume =	3
, year =	1885
, pages =	"30--33"
, note =	"pre-Shamos"
, keywords =	"points, extremal figures, center"
, update =	"95.09 korneenko"
}

@techreport{ch-ccsns-90
, author =	"J. H. Chuang and C. M. Hoffmann"
, title =	"Curvature computations on surfaces in $n$-space"
, number =	"90.2"
, institution =	"ITC"
, address =	"Trento, Italy"
, month =	aug
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{c-rsops-96
, author =	"A. Chubarev"
, title =	"Robust set operations on polyhedral solids: a fixed precision approach"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"187--204"
, update =	"96.09 devillers"
}

@book{c-mss-88
, author =	"C. K. Chui"
, title =	"Multivariate spline spaces"
, publisher =	"Soc. for Industrial \& Applied Mathematics"
, address =	"Philadelphia, PA"
, year =	1988
, update =	"98.07 bibrelex"
}

@article{cgg-stc-89
, author =	"F. Chung and M. Gardner and R. Graham"
, title =	"Steiner trees on a checkerboard"
, journal =	"Math. Mag."
, volume =	62
, number =	2
, year =	1989
, pages =	"83--96"
, keywords =	"Steiner tree"
, update =	"95.09 korneenko"
}

@article{c-lat-84
, author =	"F. R. K. Chung"
, title =	"On linear arrangements of trees"
, journal =	"Comput. Math. Appl."
, volume =	10
, year =	1984
, pages =	"43--60"
, update =	"98.03 bibrelex"
}

@article{c-spirh-89
, author =	"F. R. K. Chung"
, title =	"Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"183--190"
}

@article{cg-nbesm-85
, author =	"F. R. K. Chung and R. L. Graham"
, title =	"A new bound for {Euclidean} {Steiner} minimal trees"
, journal =	"Ann. New York Acad. Sci."
, volume =	440
, year =	1985
, pages =	"328--346"
, keywords =	"Steiner tree"
, update =	"96.09 devillers, 95.09 korneenko"
}

@article{cg-stbps-81
, author =	"F. R. K. Chung and R. L. Graham"
, title =	"On {Steiner} trees for bounded point sets"
, journal =	"Geom. Dedicata"
, volume =	11
, year =	1981
, pages =	"353--361"
, update =	"97.11 bibrelex"
}

@article{cg-stl-78
, author =	"F. R. K. Chung and R. L. Graham"
, title =	"Steiner trees for ladders"
, journal =	"Ann. Discrete Math."
, volume =	2
, year =	1978
, pages =	"173--200"
, keywords =	"Steiner tree"
, update =	"96.09 devillers, 95.09 korneenko"
}

@article{ch-lmrst-79
, author =	"F. R. K. Chung and F. K. Hwang"
, title =	"The largest minimal rectilinear {Steiner} trees for a set of $n$ points enclosed in a rectangle with given perimeter"
, journal =	"Networks"
, volume =	9
, year =	1979
, pages =	"19--36"
, update =	"97.11 bibrelex"
}

@article{c-ctpg-75
, author =	"V. Chv\'atal"
, title =	"A combinatorial theorem in plane geometry"
, journal =	"J. Combin. Theory Ser. B"
, volume =	18
, year =	1975
, pages =	"39--41"
, update =	"94.05 devillers"
}

@article{c-ghscp-79
, author =	"V. Chv{\'a}tal"
, title =	"A greedy heuristic for the set-covering problem"
, journal =	"Math. Oper. Res."
, volume =	4
, year =	1979
, pages =	"233--235"
, keywords =	"approximation"
, update =	"94.05 devillers"
}

@incollection{c-hc-85
, author =	"V. Chvatal"
, title =	"{Hamiltonian} Cycles"
, booktitle =	"The Traveling Salesman Problem"
, publisher =	"John Wiley \& Sons"
, year =	1985
, pages =	"403--429"
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@techreport{c-lnnas-92
, author =	"V. Chv{\'a}tal"
, title =	"Lecture Notes on the New {AKS} Sorting Network"
, type =	"{Report}"
, number =	"DCS-TR-294"
, institution =	"Computer Science Dept., Rutgers University"
, year =	1992
, note =	"Available at
	\url{ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-294.ps.Z}"
, update =	"96.09 orourke"
}

@book{c-lp-83
, author =	"V. Chv{\'a}tal"
, title =	"Linear Programming"
, publisher =	"W. H. Freeman"
, address =	"New York, NY"
, year =	1983
}

@article{c-tghc-73
, author =	"V. Chv{\'a}tal"
, title =	"Tough graphs and {Hamiltonian} circuits"
, journal =	"Discrete Math."
, volume =	5
, number =	3
, month =	jul
, year =	1973
, pages =	"215--228"
, update =	"97.11 bibrelex"
}

@article{ck-flcs-80
, author =	"V. Chv{\'a}tal and G. Klincsek"
, title =	"Finding largest convex subsets"
, journal =	"Congr. Numer."
, volume =	29
, year =	1980
, pages =	"453--460"
, note =	"Combinatorics, Graph Theory and Computing. Proc. South-East Conf., Boca Raton, vol. 2"
, keywords =	"convex, extremal figures, peeling"
, update =	"95.09 korneenko"
}

@article{cs-mdld-90
, author =	"S. Chynoweth and M. J. Sewell"
, title =	"Mesh Duality and Legendre Duality"
, journal =	"Proceedings Of The Royal Society Of London Series A-Mathematical And Physical Sciences"
, volume =	428
, number =	1875
, year =	1990
, pages =	"351--377"
, annote =	"Another proof of mapping between convex hull on
		 paraboloid and DT in k dimensions."
}

@article{ck-drtdp-87
, author =	"M. J. Cieselski and E. Kinnen"
, title =	"Digraph relaxation for two-dimensional placement of {IC} blocks"
, journal =	"IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
, volume =	6
, number =	1
, year =	1987
, pages =	"55--66"
, keywords =	"geometric graphs, decomposition, placement, VLSI design, isothetic"
, update =	"95.09 korneenko"
}

@article{c-fswpm-88
, author =	"D. Cieslik"
, title =	"The {Fermat}-{Steiner}-{Weber} problem in {Minkowski} spaces"
, journal =	"Optimization"
, volume =	19
, number =	4
, year =	1988
, pages =	"485--489"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@incollection{c-srbmp-90
, author =	"D. Cieslik"
, title =	"The {Steiner} ratio of {Banach}-{Minkowski} planes"
, editor =	"R. Bodendiek"
, booktitle =	"Contemporary Methods in Graph Theory"
, publisher =	"BI-Wissenschaftsverlag"
, address =	"Mannheim, Germany"
, year =	1990
, pages =	"231--248"
, update =	"98.03 bibrelex"
}

@article{cgms-rtcat-00
, author =	"P. Cignoni and F. Ganovelli and C. Montani and R. Scopigno"
, title =	"Reconstruction of topologically correct and adaptive trilinear isosurfaces"
, journal =	"Computers \& Graphics"
, volume =	24
, number =	3
, year =	2000
, pages =	"399--418"
, update =	"02.03 wenger"
}

@inproceedings{cmps-oieiv-96
, author =	"P. Cignoni and C. Montani and E. Puppo and R. Scopigno"
, title =	"Optimal isosurface extraction from irregular volume data"
, booktitle =	"Proc. IEEE Symposium on Volume Visuatization"
, year =	1996
, update =	"98.07 bibrelex"
}

@incollection{cms-cmsa-98
, author =	"P. Cignoni and C. Montani and R. Scopigno"
, title =	"A Comparison of Mesh Simplification Algorithms"
, booktitle =	"Computers \& Graphics"
, volume =	22
, publisher =	"Pergamon Press"
, note =	"To appear;
                 \url{http://miles.cnuce.cnr.it/cg/bibliography.html}."
, update =	"98.07 orourke"
}

@article{cms-cmsa-98-b
, author =	"P. Cignoni and C. Montani and R. Scopigno"
, title =	"A Comparison of Mesh Simplification Algorithms"
, journal =	"Comput. \& Graphics"
, volume =	22
, number =	1
, year =	1998
, pages =	"37--54"
, update =	"02.03 wenger"
}

@techreport{cms-mfdca-94
, author =	"P. Cignoni and C. Montani and R. Scopigno"
, title =	"A merge-first divide \& conquer algorithm for {$E^d$} {Delaunay} triangulations"
, institution =	"Consiglio Nazionale delle Ricerche, Pisa, Italy"
, year =	1994
, update =	"00.03 bibrelex"
}

@article{cms-tcpht-96
, author =	"P. Cignoni and C. Montani and R. Scopigno"
, title =	"Triangulating Convex Polygons Having T-Vertices"
, journal =	"J. Graphics Tools"
, volume =	1
, number =	2
, year =	1996
, pages =	"1--4"
, update =	"97.11 held"
}

@inproceedings{c-actp-89
, author =	"V. {\v C}ik"
, title =	"The algorithm of constructing the triangulation of points"
, booktitle =	"Po{\v c}ita{\v c}ova grafika'89. Zb. Konf."
, site =	"Smolenice, Chech."
, year =	1989
, pages =	"26--30"
, keywords =	"point-set triangulation"
, update =	"95.09 korneenko"
}

@article{c-fhccp-90
, author =	"R. J. Cimikowski"
, title =	"Finding {Hamiltonian} cycles in certain planar graphs"
, journal =	"Inform. Process. Lett."
, volume =	35
, year =	1990
, pages =	"249--254"
, keywords =	"geometric graphs, Delaunay triangulation"
, update =	"95.09 korneenko"
}

@article{c-psepg-92
, author =	"R. J. Cimikowski"
, title =	"Properties of some {Euclidian} proximity graphs"
, journal =	"Pattern Recogn. Lett."
, volume =	13
, number =	6
, month =	jun
, year =	1992
, pages =	"417--423"
, update =	"98.11 bibrelex"
}

@article{cd-epc3d-94
, author =	"A. R. Clare and A. M. Day"
, title =	"Experiments in the Parallel Computation of 3D Convex Hulls"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	1
, month =	mar
, year =	1994
, pages =	"21--36"
, update =	"96.01 held"
}

@article{ccj-udg-90
, author =	"B. N. Clark and C. J. Colbourn and D. S. Johnson"
, title =	"Unit disk graphs"
, journal =	"Discrete Math."
, volume =	86
, number =	"1--3"
, year =	1990
, pages =	"165--178"
, keywords =	"geometric graphs, computational complexity, disks"
, update =	"95.09 korneenko"
}

@inproceedings{cb-dedsn-96
, author =	"Brett W. Clark and Steven E. Benzley"
, title =	"Development and evaluation of a degenerate seven-node hexahedron finite element"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"321--331"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@article{c-vgpg-80
, author =	"J. Clark"
, title =	"A ``VLSI'' geometry processor for graphics"
, journal =	"Lambda"
, volume =	1
, number =	2
, year =	1980
, keywords =	"parallel computation, computer graphics"
, update =	"95.09 korneenko"
}

@inproceedings{c-farps-79
, author =	"J. H. Clark"
, title =	"A fast algorithm for rendering parametric surfaces"
, booktitle =	"Proc. SIGGRAPH '79"
, year =	1979
, pages =	"289--299"
, update =	"97.11 bibrelex"
}

@article{c-ds3d-76
, author =	"J. H. Clark"
, title =	"Designing surfaces in $3$-d"
, journal =	"Commun. ACM"
, volume =	19
, year =	1976
, pages =	"454--460"
}

@article{c-hgmvs-76
, author =	"J. H. Clark"
, title =	"Hierarchical geometric models for visible surface algorithms"
, journal =	"Commun. ACM"
, volume =	19
, year =	1976
, pages =	"547--554"
}

@techreport{c-pcsvc-78
, author =	"J. H. Clark"
, title =	"Parametric curves, surfaces and volumes in computer graphics and computer-aided geometric design"
, type =	"Typescript"
, institution =	"NASA Ames Res. Center"
, year =	1978
}

@article{c-gevgs-82
, author =	"J. H. Clark"
, title =	"The geometry engine: a {VLSI} geometric system for graphics"
, journal =	"Comput. Graph."
, volume =	16
, number =	3
, year =	1982
, pages =	"127--133"
, keywords =	"parallel computation, elementary geometry"
, update =	"95.09 korneenko"
}

@book{c-acc-95
, author =	"K. C. Clarke"
, title =	"Analytical and Computer Cartography"
, edition =	"2nd"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1995
, update =	"97.03 schwarzkopf, 96.09 kreveld"
}

@techreport{c-csfas-90
, author =	"K. Clarkson"
, title =	"Computing a single face in arrangements of segments"
, type =	"Unpublished Manuscript"
, institution =	"??"
, year =	1990
, keywords =	"arrangements, randomized algorithms"
, update =	"95.09 agarwal"
}

@article{cegsw-ccbac-90
, author =	"K. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
, title =	"Combinatorial complexity bounds for arrangements of curves and spheres"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"99--160"
, keywords =	"arrangements, complexity of faces, combinatorial geometry"
, succeeds =	"cegsw-ccbac-88"
, update =	"98.03 mitchell"
}

@techreport{c-blmat-92
, author =	"K. L. Clarkson"
, title =	"A bound on local minima of arrangements that implies the upper bound theorem"
, type =	"Manuscript"
, year =	1992
, comments =	"proves that the number of local minima of k-level in hyperplane arrangement is $O(k^{d-1})$, derives upper bound thm from it"
, update =	"93.09 matousek"
}

@article{c-blmat-93
, author =	"K. L. Clarkson"
, title =	"A bound on local minima of arrangements that implies the upper bound theorem"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"427--233"
, url =	"http://cm.bell-labs.com/who/clarkson/kmins.html"
, update =	"97.03 clarkson"
, abstract =	"
This paper shows that the $i$-level of an arrangement of hyperplanes in
$E^d$ has at most ${{i+d-1}\choose {d-1}}$ local minima.
This bound follows from ideas previously used to prove bounds on $(\leq k)$-sets.
Using linear programming duality,
the Upper Bound Theorem is obtained as a corollary,
giving yet another proof of this
celebrated bound on the number of vertices of a simple polytope
in $E^d$ with $n$ facets.
"
}

@inproceedings{c-lvalp-88
, author =	"K. L. Clarkson"
, title =	"A {Las} {Vegas} algorithm for linear programming when the dimension is small"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"452--456"
, url =	"http://netlib.bell-labs.com/netlib/att/cs/doc/88/2-lp2.ps"
, keywords =	"convex, optimization, $d$-dimensional, design of algorithms, random sampling, expected-case analysis"
, annote =	"finds smallest enclosing sphere of n points, d
		 dimensions; expected time for n constraints, d
		 variables is $O(d^{2}n)+(\lg(n/d^{2}))^{\lg
		 d+2}O(d)^{d/2+O(1)}$"
}

@inproceedings{c-papop-85
, author =	"K. L. Clarkson"
, title =	"A probabilistic algorithm for the post office problem"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"175--184"
, keywords =	"proximity, data structuring, probabilistic analysis, Voronoi diagrams, simplices"
, precedes =	"c-racpq-88"
}

@article{c-racpq-88
, author =	"K. L. Clarkson"
, title =	"A randomized algorithm for closest-point queries"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"830--847"
, keywords =	"proximity, data structuring, probabilistic analysis, Voronoi diagrams, simplices"
, succeeds =	"c-papop-85"
}

@inproceedings{c-apca-93
, author =	"Kenneth L. Clarkson"
, title =	"Algorithms for Polytope Covering and Approximation"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"246--252"
, update =	"97.03 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
}

@inproceedings{c-aacpq-94
, author =	"K. L. Clarkson"
, title =	"An Algorithm for Approximate Closest-Point Queries"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"160--164"
, cites =	"am-annqf-93, amnsw-oaann-94, as-rssua-90, b-acpqh-93, c-lvalp-88, c-apca-93, d-mescs-74, p-slpab-90, s-sosl-, v-namcf-89, y-cmstk-82, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@article{c-agmst-89
, author =	"K. L. Clarkson"
, title =	"An algorithm for geometric minimum spanning trees requiring nearly linear expected time"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"461--469"
, keywords =	"minimum spanning trees, approximation, $d$-dimensional, bucketing, expected-case analysis, geometric graphs"
, succeeds =	"c-fetaa-84"
, update =	"98.03 mitchell"
, annote =	"He gives a nearly linear expected time algorithm for $n$
                  points uniformly distributed in a $d$-cube; time is
                  $O(n\alpha(cn,n)$, with $c>6$.  See also
                  \cite{v-mstkd-88}"
}

@inproceedings{c-arscg-88
, author =	"K. L. Clarkson"
, title =	"Applications of random sampling in computational geometry, {II}"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"1--11"
, precedes =	"cs-arscg-89"
, cites =	"ag-nssfs-86, ahw-pgers-87, cegsw-ccbac-88, c-papop-85, c-narsc-87, cp-hrsaa-86, cs-adpch-88, csy-khrp-84, ctv-flvat-88i, e-acg-87, em-sstcd-88, es-pmc-74, gp-nkssn-84, hw-ensrq-87, ks-upcha-86, tv-otats-88, w-mksfs-86, y-gctsp-88, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{c-aapts-91
, author =	"K. L. Clarkson"
, title =	"Approximation algorithms for planar traveling salesman tours and minimum-length triangulations"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"17--23"
}

@inproceedings{c-aaspm-87
, author =	"K. L. Clarkson"
, title =	"Approximation algorithms for shortest path motion planning"
, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
, year =	1987
, pages =	"56--65"
, keywords =	"motion planning, approximation, two-dimensional, three-dimensional, Voronoi diagrams"
}

@inproceedings{c-faann-83
, author =	"K. L. Clarkson"
, title =	"Fast algorithms for the all nearest neighbors problem"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"226--232"
, keywords =	"proximity, bucketing, approximation, probabilistic analysis"
}

@inproceedings{c-fetaa-84
, author =	"K. L. Clarkson"
, title =	"Fast expected time and approximation algorithms for geometric minimum spanning trees"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"342--348"
, keywords =	"minimum spanning trees, approximation, $d$-dimensional, bucketing, expected-case analysis, geometric graphs"
, precedes =	"c-agmst-89"
}

@inproceedings{c-farsc-86
, author =	"K. L. Clarkson"
, title =	"Further applications of random sampling to computational geometry"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"414--423"
, precedes =	"c-narsc-87"
}

@article{c-lvali-95
, author =	"K. L. Clarkson"
, title =	"{Las} {Vegas} algorithms for linear and integer programming"
, journal =	"J. ACM"
, volume =	42
, year =	1995
, pages =	"488--499"
, keywords =	"convex, optimization, $d$-dimensional, random sampling"
, update =	"96.05 agarwal"
}

@techreport{c-lvali-89
, author =	"K. L. Clarkson"
, title =	"{Las} {Vegas} Algorithms for Linear and Integer Programming When the Dimension is Small"
, type =	"Manuscript"
, institution =	"??"
, month =	oct
, year =	1989
, update =	"97.11 bibrelex"
}

@article{c-lpot-86
, author =	"K. L. Clarkson"
, title =	"Linear programming in {$O(n 3^{d^{2}})$} time"
, journal =	"Inform. Process. Lett."
, volume =	22
, year =	1986
, pages =	"21--24"
, keywords =	"linear programming, $d$-dimensional, prune-and-search"
}

@inproceedings{c-mosga-94
, author =	"K. L. Clarkson"
, title =	"More output-sensitive geometric algorithms"
, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1994
, pages =	"695--702"
, update =	"95.01 matousek+smid"
}

@inproceedings{c-nnqms-97
, author =	"K. L. Clarkson"
, title =	"Nearest Neighbor Queries in Metric Spaces"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '97"
, year =	1997
, pages =	"609--617"
, update =	"98.07 bibrelex, 97.07 agarwal"
}

@article{c-narsc-87
, author =	"K. L. Clarkson"
, title =	"New applications of random sampling in computational geometry"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"195--222"
, keywords =	"combinatorial geometry, data structuring, reporting, searching, separation, range search, point location, probabilistic analysis, triangulations, $d$-dimensional"
, succeeds =	"c-farsc-86"
}

@incollection{c-rga-92
, author =	"K. L. Clarkson"
, title =	"Randomized geometric algorithms"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"117--162"
, keywords =	"survey paper, randomized algorithms, range spaces, VC dimension, incremental algorithms, $k$-sets, cuttings"
, precedes =	"c-rga-95"
, update =	"98.07 icking, 93.09 erickson"
}

@incollection{c-rga-95
, author =	"Kenneth L. Clarkson"
, title =	"Randomized Geometric Algorithms"
, editor =	"Ding-Zhu Du and Frank Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"149--194"
, keywords =	"survey paper, randomized algorithms, range spaces, VC dimension, incremental algorithms, $k$-sets, cuttings"
, succeeds =	"c-rga-92"
, update =	"98.07 icking"
}

@inproceedings{c-sede-92
, author =	"K. L. Clarkson"
, title =	"Safe and effective determinant evaluation"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, month =	oct
, year =	1992
, pages =	"387--395"
, update =	"98.11 bibrelex"
}

@article{cct-erpat-92
, author =	"K. L. Clarkson and R. Cole and R. E. Tarjan"
, title =	"Erratum: Randomized parallel algorithms for trapezoidal diagrams"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"341--343"
, keywords =	"randomized, parallel, trapezoidal diagram, triangulation"
, succeeds =	"cct-rpatd-92"
}

@inproceedings{cct-rpatd-91
, author =	"K. L. Clarkson and R. Cole and R. E. Tarjan"
, title =	"Randomized parallel algorithms for trapezoidal diagrams"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"152--161"
, keywords =	"random sampling, polygon, triangulation"
, precedes =	"cct-rpatd-92"
, cites =	"acg-cdctd-89, am-dplr-88, ce-oails-88, c-tsplt-90i, ci-tsc-84, c-pms-88, cs-arscg-89, ctv-flvat-89, cv-dctao-86, e-acg-87, fm-tspep-84, g-ilspo-89, g-tpp-89, gsg-pmvsp-89, hjw-epcah-90, m-fppa1-88, rr-ostrp-89, s-sfira-90, ZZZ"
, update =	"97.11 bibrelex"
}

@article{cct-rpatd-92
, author =	"K. L. Clarkson and R. Cole and R. E. Tarjan"
, title =	"Randomized parallel algorithms for trapezoidal diagrams"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"117--133"
, keywords =	"randomized, parallel, trapezoidal diagram, triangulation"
, succeeds =	"cct-rpatd-91"
, precedes =	"cct-erpat-92"
}

@techreport{cegsw-ccbac-88t
, author =	"K. L. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
, title =	"Combinatorial Complexity Bounds and Arrangements of Curves and Surfaces"
, type =	"Technical {Report}"
, number =	"R88/1470"
, institution =	"Univ. Illinois"
, address =	"Urbana, IL"
, month =	nov
, year =	1988
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{cegsw-ccbac-88
, author =	"K. L. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
, title =	"Combinatorial complexity bounds for arrangements of curves and surfaces"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"568--579"
, keywords =	"discrete geometry, extremal problems, bipartite graphs, arrangements of curves and surfaces, triangulations, probabilistic counting, zones, Davenport-Schinzel sequences, counting distances"
, precedes =	"cegsw-ccbac-90"
, update =	"98.03 mitchell"
}

@inproceedings{cemst-acpir-93
, author =	"K. L. Clarkson and D. Eppstein and G. L. Miller and C. Sturtivant and S.-H. Teng"
, title =	"Approximating center points with iterated {Radon} points"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"91--98"
, precedes =	"cemst-acpir-96"
, cites =	"abfk-pswen-91, b-rg-85, c-lvalp-88, cm-ltdao-93, csy-khrp-87, dgk-htir-63, d-ltatt-84, e-acg-87, fmt-sbpdc-92, gmt-gampi-92, hw-ensrq-87, jm-ccfps-93, lrt-gnd-79, m-aogdc-91, m-ltalp-83, mt-cppd-90, mt-sttd-90, mttv-amp-92, mtv-ugags-91, mv-dgs-91, t-pssug-90, v-smfmf-84, vc-ucrfe-71, y-3spia-83, ZZZ"
, update =	"98.03 bibrelex, 97.03 devillers, 93.09 jones"
}

@article{cemst-acpir-96
, author =	"K. L. Clarkson and D. Eppstein and G. L. Miller and C. Sturtivant and S.-H. Teng"
, title =	"Approximating center points with iterative {Radon} points"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"357--377"
, succeeds =	"cemst-acpir-93"
, update =	"97.03 devillers"
}

@unpublished{ckv-rsptp-
, author =	"K. L. Clarkson and S. Kapoor and P. M. Vaida"
, title =	"Rectilinear shortest paths through polygonal obstacles in {$O(n \log^{3/2}n$} time"
, year =	"??"
, note =	"Submitted for publication"
, update =	"98.03 bibrelex"
}

@inproceedings{ckv-rsptp-87
, author =	"K. L. Clarkson and S. Kapoor and P. M. Vaidya"
, title =	"Rectilinear shortest paths through polygonal obstacles in {$O(n (\log n)^{2})$} time"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"251--257"
, cites =	"d-ntpcg-59, gs-canen-83, ll-fmrdp-81, lp-esppr-84, lw-apcfp-79, rlw-rsprb-85, ZZZ"
, update =	"98.03 bibrelex"
}

@techreport{cms-frric-92t
, author =	"K. L. Clarkson and K. Mehlhorn and R. Seidel"
, title =	"Four results on randomized incremental constructions"
, type =	"Report"
, number =	"MPI-I-92-112"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
, precedes =	"cms-frric-92i"
}

@inproceedings{cms-frric-92i
, author =	"K. L. Clarkson and K. Mehlhorn and R. Seidel"
, title =	"Four results on randomized incremental constructions"
, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	577
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"463--474"
, succeeds =	"cms-frric-92t"
, precedes =	"cms-frric-93"
, update =	"99.11 bibrelex, 98.11 bibrelex, 94.05 devillers"
}

@article{cms-frric-93
, author =	"K. L. Clarkson and K. Mehlhorn and R. Seidel"
, title =	"Four results on randomized incremental constructions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, number =	4
, year =	1993
, pages =	"185--212"
, succeeds =	"cms-frric-92i"
, update =	"94.05 devillers+schwarzkopf"
}

@inproceedings{cs-adpch-88
, author =	"K. L. Clarkson and P. W. Shor"
, title =	"Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"12--17"
, keywords =	"random sampling, $k$-sets, convex hulls, diameter"
, cites =	"c-bvdcp-86, c-arscg-88, e-acg-87, eks-sspp-83, eos-calha-86, h-bevv-56, ph-chfsp-77, ps-cgi-85, ZZZ"
, update =	"98.03 bibrelex"
}

@article{cs-arscg-89
, author =	"K. L. Clarkson and P. W. Shor"
, title =	"Applications of random sampling in computational geometry, {II}"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"387--421"
, succeeds =	"c-arscg-88"
}

@techreport{ctv-flvat-88t
, author =	"K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
, title =	"A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
, type =	"Technical {Report}"
, number =	"CS-TR-157-88"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1988
, precedes =	"ctv-flvat-88i"
, annote =	"$O(n \log^{*} n)$ expected time"
}

@inproceedings{ctv-flvat-88i
, author =	"K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
, title =	"A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"18--22"
, succeeds =	"ctv-flvat-88t"
, precedes =	"ctv-flvat-89"
, cites =	"c-narsc-87, c-arscg-88, ci-tsc-84, es-pmc-74, fm-tspep-84, gjpt-tsp-78, hw-ensrq-87, hmrt-sjslt-86, ps-cgi-85, r-pta-84, tv-otats-88, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex"
, annote =	"$O(n \log^{*} n)$ expected time"
}

@article{ctv-flvat-89
, author =	"K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
, title =	"A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"423--432"
, keywords =	"triangulation, simple polygon, random sampling"
, succeeds =	"ctv-flvat-88i"
, update =	"97.03 schwarzkopf"
}

@article{c-aafnn-79
, author =	"J. G. Cleary"
, title =	"Analysis of an algorithm for finding nearest neighbors in {Euclidean} space"
, journal =	"ACM Trans. Math. Softw."
, volume =	5
, year =	1979
, pages =	"183--192"
}

@article{cwbv-mrt-86
, author =	"J. G. Cleary and B. Wyvill and G. M. Birtwistle and R. Vatti"
, title =	"Multiprocessor ray tracing"
, journal =	"Comput. Graph. Forum"
, volume =	5
, year =	1986
, pages =	"3--12"
}

@article{c-aafrt-88
, author =	"J. L. Cleary"
, title =	"Analysis of an algorithm for fast ray tracing using uniform space subdivision"
, journal =	"Visual Comput."
, volume =	4
, number =	2
, year =	1988
, pages =	"65--83"
, keywords =	"ray tracing, computer graphics"
, update =	"95.09 korneenko"
}

@incollection{cot-liais-87
, author =	"C. W. Clenshaw and F. W. J. Olver and P. R. Turner"
, title =	"Level-index arithmetic: an introductory survey"
, editor =	"P. R. Turner"
, booktitle =	"Numerical Analysis and Parallel Processing"
, series =	"Lecture Notes Math."
, volume =	1397
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"95--168"
, update =	"98.11 bibrelex"
}

@article{cr-c2dts-90
, author =	"A. K. Cline and R. J. Renka"
, title =	"A Constrained 2-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers"
, journal =	"SIAM J. Numer. Anal."
, volume =	27
, number =	5
, year =	1990
, pages =	"1305--1321"
, annote =	"Algorithm for CDT. Compute DT. Sequentially insert
		 constraint edges. Uses selection algorithm to
		 retriangulate resulting polygons in time $O(k^3)$ which
		 seems rather pessimistic. ($k$ is number of triangles
		 intersected by inserted edge.)"
, abstract =	"A Delaunay triangulation of a set of nodes is a
		 collection of triangles whose vertices are at the nodes
		 and whose union fills the convex hull of the set of
		 nodes. It also has several geometrical properties,
		 making it useful for solving closest point problems.
		 The generalization presented here allows the
		 triangulation to cover nonconvex regions including
		 those with holes. Although a variety of such
		 generalizations are possible, the one presented here is
		 shown to retain important closest point
		 characteristics. Thus it is useful for determining
		 shortest paths within planar regions with polygonal
		 boundaries. (Author abstract) 11 Refs."
}

@techreport{cr-gdtsc-85
, author =	"A. K. Cline and R. J. Renka"
, title =	"A generalized {Delaunay} triangulation and the solution of closest node problems in the presence of barriers"
, type =	"Report"
, number =	"??"
, institution =	"Univ. Texas Austin"
, address =	"Austin, TX"
, year =	1985
}

@article{cr-semct-84
, author =	"A. K. Cline and R. L. Renka"
, title =	"A storage-efficient method for construction of a {Thiessen} triangulation"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"119--140"
}

@article{cllct-tatdr-88
, author =	"H. E. Cline and W. E. Lorensen and S. Ludke and C. R. Crawford and B. C. Teeter"
, title =	"Two algorithms for the three-dimensional reconstruction of tomograms"
, journal =	"Medical Physics"
, volume =	15
, year =	1988
, pages =	"320--327"
, update =	"98.03 bibrelex"
}

@inproceedings{cb-tchos-93
, author =	"J. Cloutier and I. Bennour"
, title =	"Topological characterization of {Hwang's} optimal {Steiner} tree"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"157--162"
, cites =	"gj-rstpi-77, ggj-ccsmt-77, h-sprd-66, h-smtrd-76, p-tncfs-92, s-rgrsm-91, as-escrs-90, bc-arstp-92, crs-ostan-90, hr-stp-92, rs-sphtr-91, p-cstp-88, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{cmwms-feps-93
, author =	"R. du Cloux and G. P. J. F. M. Maas and A. J. H. Wachters and R. F. Milsom and K. J. Scott"
, title =	"FASTERIX, an environment for {PCB} simulation"
, booktitle =	"Proc. 11th Internat. Conf. on EMC"
, site =	"Z{\"u}rich, Switzerland"
, year =	1993
, update =	"98.03 bibrelex"
}

@article{cbb-scmrt-91
, author =	"E. Clufff and R. Burton and W. A. Barrett"
, title =	"A survey and characterization of multidimensional representation techniques"
, journal =	"J. Imag. Technol."
, volume =	17
, number =	4
, year =	1991
, pages =	"142--153"
, keywords =	"survey data structuring, $d$-dimensional"
, update =	"95.09 korneenko"
}

@inproceedings{cdgm-dsc-97
, author =	"F. Javier Cobos and J. Carlos Dana and Clara I. Grima and Alberto Marquez"
, title =	"Diameter of a Set on the Cylinder"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"164--168"
, update =	"97.11 jones"
}

@inproceedings{cdgm-wcss-97
, author =	"F. Javier Cobos and J. Carlos Dana and Clara I. Grima and Alberto Marquez"
, title =	"The Width of a Convex Set on the Sphere."
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"159--163"
, update =	"97.11 jones"
}

@techreport{co-pccl4d-99a
, author =	"R. Cocan and J. O'Rourke"
, title =	"Polygonal chains cannot lock in {4D}"
, number =	063
, institution =	"Smith College, Northampton, MA"
, month =	jul
, year =	1999
, note =	"Full version LANL arXive cs.CG/9908005 (Revised Feb. 01);
                to appear in {\em Comput. Geom. Theory Appl.}"
, archive =	"XXX:cs.CG/9908005"
, update =	"01.04 orourke, 00.03 orourke"
}

@inproceedings{co-pccl4d-99b
, author =	"R. Cocan and J. O'Rourke"
, title =	"Polygonal chains cannot lock in {4D}"
, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
, year =	1999
, pages =	"5--8"
, update =	"00.03 orourke"
}

@article{co-pccl4d-01
, author =	"R. Cocan and J. O'Rourke"
, title =	"Polygonal chains cannot lock in {4D}"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"105--129"
, succeeds =	"co-pccl4d-99a"
, update =	"02.03 orourke"
}

@article{c-cmlfs-69
, author =	"E. J. Cockayne"
, title =	"Computation of minimal length full {Steiner} trees on the vertices of a convex polygon"
, journal =	"Math. Comput."
, volume =	23
, year =	1969
, pages =	"521--531"
}

@article{c-easmt-70
, author =	"E. J. Cockayne"
, title =	"On the efficiency of the algorithm for {Steiner} minimal trees"
, journal =	"SIAM J. Appl. Math."
, volume =	18
, year =	1970
, pages =	"150--159"
}

@article{c-sp-67
, author =	"E. J. Cockayne"
, title =	"On the {Steiner} problem"
, journal =	"Canad. Math. Bull."
, volume =	10
, year =	1967
, pages =	"431--450"
}

@article{ch-pmpsc-75
, author =	"E. J. Cockayne and G. W. C. Hall"
, title =	"Plane Motion of a Particle Subject to Curvature Constraints"
, journal =	"SIAM J. Control"
, volume =	13
, number =	1
, year =	1975
, pages =	"197--220"
, update =	"93.09 devillers"
}

@article{ch-ecsmt-86
, author =	"E. J. Cockayne and D. E. Hewgill"
, title =	"Exact computation of {Steiner} minimal trees in the plane"
, journal =	"Inform. Process. Lett."
, volume =	22
, number =	3
, year =	1986
, pages =	"151--156"
, keywords =	"Steiner tree"
, update =	"95.09 korneenko"
}

@article{ch-icpsm-92
, author =	"E. J. Cockayne and D. E. Hewgill"
, title =	"Improved computation of plane {Steiner} minimal trees"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"219--229"
, update =	"98.11 bibrelex"
}

@article{cm-spst-68
, author =	"E. J. Cockayne and Z. A. Melzak"
, title =	"On {Steiner}'s problem for set-terminals"
, journal =	"Appl. Math."
, volume =	26
, year =	1968
, pages =	"213--218"
}

@inproceedings{cs-csmt-72
, author =	"E. J. Cockayne and D. G. Schiller"
, title =	"Computation of {Steiner} minimal trees"
, editor =	"D. J. A. Welsh and D. R. Woodall"
, booktitle =	"Combinatorics (Conference on Combinatorial Mathematics)"
, publisher =	"Institute of Math. and its applications"
, address =	"Southend-on-Sea, Essex, England"
, year =	1972
, pages =	"53--71"
}

@book{c-pwpd-91
, author =	"S. T. Coffin"
, title =	"The Puzzling World of Polyhedral Dissections"
, publisher =	"Oxford University Press"
, year =	1991
, update =	"98.03 bibrelex"
}

@article{cgjt-pblot-80
, author =	"E. G. Coffman and Jr. M. R. Garey and D. S. Johnson and R. E. Tarjan"
, title =	"Performance Bounds for Level-Oriented two-dimensional Packing Algorithms"
, journal =	"SIAM J. Comput."
, volume =	9
, year =	1980
, pages =	"808--826"
, update =	"98.11 bibrelex"
}

@article{cg-ptmr-92
, author =	"E. G. Coffman and E. N. Gilbert"
, title =	"Paths Through a Maze of Rectangles"
, journal =	"Networks"
, volume =	22
, number =	4
, month =	jul
, year =	1992
, pages =	"349--367"
, keywords =	"competitive analysis, shortest paths, on-line navigation"
, update =	"98.03 mitchell"
}

@article{cl-apspa-89
, author =	"E. G. {Coffman, Jr.} and J. C. Lagarias"
, title =	"Algorithms for packing squares: {A} probabilistic analysis"
, journal =	"SIAM J. Comput."
, volume =	18
, year =	1989
, pages =	"166--185"
}

@article{cjs-spoum-91
, author =	"E. G. {Coffman, Jr.} and P. W. Shor"
, title =	"A simple proof of the ${O}(\sqrt{n}\log^{3/4}(n))$ upright matching bound"
, journal =	"SIAM J. Discrete Math."
, volume =	4
, number =	1
, year =	1991
, pages =	"48--57"
, keywords =	"points"
, update =	"95.09 korneenko"
}

@incollection{c-vta3d-94
, author =	"Daniel Cohen"
, title =	"Voxel Traversal along a 3{D} Line"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"366--369"
, keywords =	"digital line drawing, grid traversal, ray tracing, scan conversion"
, update =	"94.09 heckbert"
, annote =	"Visits all the voxels along a 3D line segment with integer
endpoints, something like a 3D Bresenham's algorithm. This code could be
modified to take endpoints with fixed point coordinates. Then the algorithm
could be very useful for ray tracing, when a uniform grid is being used as a
spatial data structure for optimization, or for volume rendering of grid
data. Contains C code."
}

@article{c-nlbdt-87
, author =	"E. Cohen"
, title =	"A new local basis for designing with tensioned splines"
, journal =	"ACM Trans. Graph."
, volume =	6
, year =	1987
, pages =	"81--122"
}

@inproceedings{c-facts-93
, author =	"E. Cohen"
, title =	"Fast algorithms for constructing $t$-spanners and paths with stretch $t$"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1993
, update =	"98.03 bibrelex"
}

@article{c-facts-98
, author =	"E. Cohen"
, title =	"Fast algorithms for constructing $t$-spanners and paths with stretch $t$"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1998
, pages =	"210--236"
, update =	"99.07 smid"
}

@article{clr-dbsst-80
, author =	"E. Cohen and T. Lyche and R. Riesenfeld"
, title =	"Discrete {B}-splines and subdivison techniques in computer-aided geometric design and computer graphics"
, journal =	"Comput. Graph. Image Process."
, volume =	14
, number =	2
, year =	1980
, pages =	"87--110"
, update =	"97.11 bibrelex"
}

@article{cls-adrs-85
, author =	"E. Cohen and T. Lyche and L. L. Schumaker"
, title =	"Algorithms for degree-raising of splines"
, journal =	"ACM Trans. Graph."
, volume =	4
, year =	1985
, pages =	"171--181"
}

@inproceedings{cm-ialit-91
, author =	"E. Cohen and N. Megiddo"
, title =	"Improved algorithms for linear inequalities with two variables per inequality"
, booktitle =	"Proc. 23th Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"145--155"
, keywords =	"linear programming, Monte Carlo"
, update =	"95.09 korneenko"
}

@incollection{cm-mcffd-93
, author =	"E. Cohen and N. Megiddo"
, title =	"Maximizing concave functions in fixed dimension"
, editor =	"P. Pardalos"
, booktitle =	"Complexity in Numeric Computation"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1993
, pages =	"74--87"
, update =	"98.11 bibrelex, 96.09 agarwal, 96.05 agarwal"
}

@inproceedings{cm-sptna-89
, author =	"E. Cohen and N. Megiddo"
, title =	"Strongly polynomial time and {NC} algorithms for detecting cycles in dynamic graphs"
, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
, year =	1989
, pages =	"523--534"
, update =	"97.11 bibrelex"
}

@article{ch-tadvc-79
, author =	"J. Cohen and T. Hickey"
, title =	"Two algorithms for determining volumes of convex polyhedra"
, journal =	"J. ACM"
, volume =	26
, year =	1979
, pages =	"401--414"
}

@inproceedings{cmo-spmusm-97
, author =	"J. Cohen and D. Manocha and M. Olano"
, title =	"Simplifying polygonal models using successive mappings"
, booktitle =	"Proc. IEEE Visualization '97"
, year =	1997
, pages =	"395--402"
, update =	"98.07 orourke"
}

@inproceedings{com-aps-98
, author =	"J. Cohen and M. Olano and D. Manocha"
, title =	"Appearance-Preserving Simplification"
, booktitle =	"Proc. SIGGRAPH '98"
, site =	"Orlando, FL"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, month =	jul
, year =	1998
, pages =	"115--122"
, update =	"98.11 held"
}

@inproceedings{cvmtwabw-se-96
, author =	"J. Cohen and A. Varshney and D. Manocha and G. Turk and H. Weber and Pankaj Agarwal and F. P. {Brooks, Jr.} and W. V. Wright"
, title =	"Simplification Envelopes"
, booktitle =	"Proceedings of SIGGRAPH '96 (New Orleans, LA, August 4--9, 1996)"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"ACM Press"
, month =	aug
, year =	1996
, pages =	"119--128"
, update =	"98.03 agarwal+mitchell"
}

@inproceedings{clmp-ecdie-94
, author =	"J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
, title =	"Exact Collision Detection for Interactive Environments"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"391--392"
, keywords =	"video review"
, cites =	"clmp-iecdl-94, l-ecdar-93, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones"
}

@inproceedings{clmp-iciec-95
, author =	"J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
, title =	"I-COLLIDE: An Interactive and Exact Collision Detection System for Large-Scale Environments"
, booktitle =	"Proc. ACM Interactive 3D Graphics Conf."
, year =	1995
, pages =	"189--196"
, succeeds =	"clmp-iecdl-94"
, update =	"96.05 klosowski, 96.01 held"
}

@techreport{clmp-iecdl-94
, author =	"J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
, title =	"Interactive and Exact Collision Detection for Large-Scaled Environments"
, type =	"Technical {Report}"
, number =	"TR94-005"
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, year =	1994
, precedes =	"clmp-iciec-95"
, update =	"96.05 klosowski"
}

@article{cg-asgpf-83
, author =	"M. Cohen and S. Grossberg"
, title =	"Absolute stability of global pattern formation and parallel memory storage by competitive neural networks"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	13
, year =	1983
, pages =	"815--825"
, update =	"98.07 bibrelex"
}

@book{cw-rris-93
, author =	"M. Cohen and J. Wallace"
, title =	"Radiosity and Realistic Image Synthesis"
, publisher =	"Academic Press"
, year =	1993
, update =	"96.05 pocchiola"
}

@article{cbwg-bbaer-86
, author =	"M. F. Cohen and D. R. Baum and J. R. Wallace and D. P. Greenberg"
, title =	"The back-buffer algorithm: An extension of the radiosity method to dynamic environments"
, journal =	"Visual Comput."
, volume =	2
, number =	5
, month =	sep
, year =	1986
, pages =	"298--306"
, update =	"97.11 bibrelex"
}

@article{cg-hrsce-85
, author =	"M. F. Cohen and D. P. Greenberg"
, title =	"The hemicube: a radiosity solution for complex environments"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, year =	1985
, pages =	"31--40"
, note =	"Proc. SIGGRAPH '85"
, update =	"98.03 bibrelex"
}

@article{cfhz-cvsov-98
, author =	"D. Cohen-Or and G. Fibich and D. Halperin and E. Zadicario"
, title =	"Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes"
, journal =	"Comput. Graph. Forum"
, volume =	17
, year =	1998
, pages =	"C243--C253"
, note =	"Eurographics '98"
, update =	"98.11 halperin"
}

@inproceedings{cdkt-rwods-93
, author =	"R. F. Cohen and G. {Di Battista} and A. Kanevsky and R. Tamassia"
, title =	"Reinventing the Wheel: an Optimal Data Structure for Connectivity Queries"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"194--200"
, update =	"94.05 tamassia"
}

@article{cdtt-dgdts-95
, author =	"R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar {$ST$}-Digraphs"
, journal =	"SIAM J. Comput."
, volume =	24
, number =	5
, year =	1995
, pages =	"970--1001"
, url =	"http://www.cs.brown.edu/cgc/papers/cdtt-dgdts-95.ps.gz"
, keywords =	"graph drawing, dynamic, planar, trees, series-parallel"
, succeeds =	"cdttb-fdgd-92"
, update =	"97.03 tamassia, 96.09 tamassia, 95.09 tamassia, 95 tamassia"
}

@inproceedings{cdttb-fdgd-92
, author =	"R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis and P. Bertolazzi"
, title =	"A framework for dynamic graph drawing"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"261--270"
, keywords =	"graph drawing"
, cites =	"bst-bst-85, bd-udttd-91, bdtt-hdspd-91, cnao-laepg-85, ct-detta-91, dt-aprad-88, dt-ipt-89, dtt-arsdd-89, dlt-pepg-84, el-hddg-89, et-adgab-89, egs-oplms-86, eittwy-mmsfd-92, fhhklsww-dgphr-90i, fpp-hdpgg-90, gt-dtdpl-91, gy-tsr-83, hl-updss-91, lec-aptg-67, m-ddt-90, o-agta-87, pt-fdplm-89, rt-tdt-81, rt-rplbo-86, s-epgg-90, st-dsdt-83, stt-mvuhs-81, sr-cdtn-83, t-eggmn-87, t-ddspg-88, tp-dmpda-90, tt-uavrp-86, tt-pgelt-89, tt-trpg-89, tt-rgc-91, tv-ptcpl-91, t-paog-89, vtl-rspd-82, kw-wvgbr-89, ZZZ"
, update =	"01.04 icking, 97.11 bibrelex, 93.09 tamassia"
}

@inproceedings{celr-tdgd-95
, author =	"R. F. Cohen and P. Eades and T. Lin and F. Ruskey"
, title =	"Three-Dimensional Graph Drawing"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"1--11"
, keywords =	"graph drawing, 3D"
, precedes =	"celr-tdgd-96"
, update =	"98.07 patrignani, 95.01 tamassia"
}

@article{celr-tdgd-96
, author =	"R. F. Cohen and P. Eades and T. Lin and F. Ruskey"
, title =	"Three-Dimensional Graph Drawing"
, journal =	"Algorithmica"
, volume =	17
, year =	1997
, pages =	"199--208"
, succeeds =	"celr-tdgd-95"
, update =	"98.07 patrignani"
}

@inproceedings{cstv-daopb-93
, author =	"R. F. Cohen and S. Sairam and R. Tamassia and J. S. Vitter"
, title =	"Dynamic Algorithms for Optimization Problems in Bounded Tree-Width Graphs"
, booktitle =	"Proc. of the Third Conference on Integer Programming and Combinatorial Optimization"
, year =	1993
, pages =	"99--112"
, update =	"94.01 tamassia"
}

@techreport{ct-cc-92
, author =	"R. F. Cohen and R. Tamassia"
, title =	"Combine and conquer"
, type =	"Report"
, number =	"CS-92-19"
, institution =	"Comput. Sci. Dept., Brown Univ."
, address =	"Providence, RI"
, year =	1992
, update =	"93.05 smid"
}

@article{ct-cc-97
, author =	"Robert F. Cohen and Roberto Tamassia"
, title =	"Combine and Conquer"
, journal =	"Algorithmica"
, volume =	18
, year =	1997
, pages =	"342--362"
, succeeds =	"ct-ccgtd-93"
, update =	"98.07 tamassia"
}

@incollection{ct-ccgtd-93
, author =	"Robert F. Cohen and Roberto Tamassia"
, title =	"Combine and Conquer: {A} General Technique for Dynamic Algorithms"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"97--108"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@article{ct-det-95
, author =	"R. F. Cohen and R. Tamassia"
, title =	"Dynamic Expression Trees"
, journal =	"Algorithmica"
, volume =	13
, year =	1995
, pages =	"245--265"
, url =	"http://www.cs.brown.edu/cgc/papers/ct-det-95.ps.gz"
, succeeds =	"ct-detta-91"
, update =	"97.03 tamassia, 95.01 tamassia, 95.01 tamassia"
}

@inproceedings{ct-detta-91
, author =	"R. F. Cohen and R. Tamassia"
, title =	"Dynamic Expression Trees and their Applications"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"52--61"
, update =	"93.09 goodrich"
}

@inproceedings{cg-pmpps-97
, author =	"S. D. Cohen and Leonidas J. Guibas"
, title =	"Partial Matching of Planar Polylines Under Similarity Transformations"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1997
, pages =	"777--786"
, update =	"98.03 mitchell, 97.03 held"
}

@inproceedings{ccy-cdt3-02
, author =	"David {Cohen-Steiner} and Eric {Colin de Verdi{\`e}re} and Mariette Yvinec"
, title =	"Conforming {Delaunay} Triangulations in 3D"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Comput. Geom."
, year =	2002
, pages =	""
, update =	"02.03 devillers"
}

@article{crs-ostan-90
, author =	"J. P. Cohoon and D. S. Richards and J. S. Salowe"
, title =	"An optimal {Steiner} tree algorithm for a net whose terminals lie on the perimeter of a rectangle"
, journal =	"IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
, volume =	9
, number =	4
, year =	1990
, pages =	"398--407"
, keywords =	"Steiner tree"
, update =	"98.11 bibrelex, 96.09 devillers, 95.09 korneenko"
}

@inproceedings{crg-uasgl-92
, author =	"A. C. F. Colchester and G. P. Robinson and L. D. Griffin"
, title =	"A unified approach to the segmentation of grey-level and dot-pattern"
, booktitle =	"Proc. 11th IEEE Internat. Conf. Pattern Recogn."
, year =	1992
, pages =	"319--322"
, update =	"98.07 bibrelex"
}

@article{c-nsc-83
, author =	"A. J. Cole"
, title =	"A note on spacefilling curves"
, journal =	"Softw. -- Pract. Exp."
, volume =	13
, number =	12
, year =	1983
, pages =	"1181--1189"
, update =	"95.09 korneenko"
}

@article{c-oesa-87
, author =	"R. Cole"
, title =	"An optimally efficient selection algorithm"
, journal =	"Inform. Process. Lett."
, volume =	26
, year =	1987
, pages =	"295--299"
, update =	"98.07 mitchell, 97.11 bibrelex"
}

@inproceedings{c-pms-86
, author =	"R. Cole"
, title =	"Parallel merge sort"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"511--516"
, update =	"97.11 bibrelex"
}

@article{c-pms-88
, author =	"R. Cole"
, title =	"Parallel merge sort"
, journal =	"SIAM J. Comput."
, volume =	17
, number =	4
, year =	1988
, pages =	"770--785"
}

@inproceedings{c-pps4d-85
, author =	"R. Cole"
, title =	"Partitioning point sets in $4$ dimensions"
, booktitle =	"Proc. 12th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	194
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"111--119"
, keywords =	"data structuring, $4$-dimensional, points, counting"
, succeeds =	"c-ppsad-??"
, precedes =	"c-ppsad-87"
}

@techreport{c-ppsad-??
, author =	"R. Cole"
, title =	"Partitioning point sets in arbitrary dimensions"
, type =	"Report"
, number =	184
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, year =	"??"
, keywords =	"data structuring, $d$-dimensional, points, counting"
, precedes =	"c-pps4d-85"
}

@article{c-ppsad-87
, author =	"R. Cole"
, title =	"Partitioning point sets in arbitrary dimensions"
, journal =	"Theoret. Comput. Sci."
, volume =	49
, year =	1987
, pages =	"239--265"
, keywords =	"data structuring, $d$-dimensional, points, counting"
, succeeds =	"c-pps4d-85"
}

@techreport{c-sssl-83
, author =	"R. Cole"
, title =	"Searching and storing similar lists"
, type =	"Technical {Report}"
, number =	88
, institution =	"New York Univ."
, month =	oct
, year =	1983
, precedes =	"c-sssl-86"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@article{c-sssl-86
, author =	"R. Cole"
, title =	"Searching and storing similar lists"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"202--220"
, keywords =	"searching, data structuring, point location"
, succeeds =	"c-sssl-83"
, update =	"98.11 bibrelex"
}

@inproceedings{c-sdsno-84
, author =	"R. Cole"
, title =	"Slowing down sorting networks to obtain faster sorting algorithms"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"255--260"
, keywords =	"parallel computation, network algorithms, sorting, searching, design of algorithms"
, precedes =	"c-sdsno-87"
}

@article{c-sdsno-87
, author =	"R. Cole"
, title =	"Slowing down sorting networks to obtain faster sorting algorithms"
, journal =	"J. ACM"
, volume =	34
, number =	1
, year =	1987
, pages =	"200--208"
, succeeds =	"c-sdsno-84"
, update =	"98.11 bibrelex"
}

@inproceedings{cg-opapp-88
, author =	"R. Cole and M. T. Goodrich"
, title =	"Optimal parallel algorithms for polygon and point-set problems"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"201--210"
, precedes =	"cg-opapp-92"
, cites =	"acgoy-pcg-85, acg-cdctd-87, ag-epssg-86, ag-pasft-88, bs-dcms-76, bn-absop-86, c-pagp-80, c-pms-86, g-eptcg-87, g-fchsp-87, grs-kfcg-83, krs-ppp-85, lf-ppc-80, lp-annpc-78, lp-oafkp-79, pm-finhs-79, s-gc-75, t-sgprc-83, w-opach-85, ZZZ"
, update =	"98.03 bibrelex, 94.01 jones"
}

@article{cg-opapp-92
, author =	"R. Cole and M. T. Goodrich"
, title =	"Optimal parallel algorithms for polygon and point-set problems"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"3--23"
, succeeds =	"cg-opapp-88"
, update =	"94.01 jones"
}

@article{cgo-anodp-96
, author =	"R. Cole and M. T. Goodrich and C. {\'O}'D{\'u}nlaing"
, title =	"A Nearly Optimal Deterministic Parallel {Voronoi} Diagram Algorithm"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"569--617"
, update =	"97.03 smid"
}

@inproceedings{cgo-mftpe-90
, author =	"R. Cole and M. T. Goodrich and C. {\'O}'D{\'u}nlaing"
, title =	"Merging free trees in parallel for efficient {Voronoi} diagram construction"
, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	443
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"432--445"
}

@article{csss-otass-89
, author =	"R. Cole and J. Salowe and W. Steiger and E. Szemer{\'e}di"
, title =	"An optimal-time algorithm for slope selection"
, journal =	"SIAM J. Comput."
, volume =	18
, number =	4
, year =	1989
, pages =	"792--810"
, keywords =	"arrangements, $d$-dimensional, points, counting, parametric search technique"
, update =	"98.11 bibrelex"
}

@incollection{csss-oss-88
, author =	"R. Cole and J. Salowe and W. Steiger and E. Szemer{\'e}di"
, title =	"Optimal slope selection"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, year =	1988
, pages =	"133--146"
, update =	"98.03 bibrelex"
}

@techreport{cs-vppt-86
, author =	"R. Cole and Micha Sharir"
, title =	"Visibility problems for polyhedral terrains"
, type =	"Technical {Report}"
, number =	266
, institution =	"??"
, month =	dec
, year =	1986
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{cs-vppt-89
, author =	"R. Cole and Micha Sharir"
, title =	"Visibility problems for polyhedral terrains"
, journal =	"J. Symbolic Comput."
, volume =	7
, year =	1989
, pages =	"11--30"
, keywords =	"locus approach, decomposition, searching, rays, visibility, three-dimensional, polyhedra, polyhedral terrain"
, update =	"98.03 mitchell"
}

@inproceedings{csy-khrp-84
, author =	"R. Cole and Micha Sharir and C. K. Yap"
, title =	"On $k$-hulls and related problems"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"154--166"
, precedes =	"csy-khrp-87"
, update =	"98.03 mitchell"
}

@article{csy-khrp-87
, author =	"R. Cole and Micha Sharir and C. K. Yap"
, title =	"On $k$-hulls and related problems"
, journal =	"SIAM J. Comput."
, volume =	16
, year =	1987
, pages =	"61--77"
, keywords =	"design of algorithms, searching, two-dimensional, three-dimensional"
, succeeds =	"csy-khrp-84"
, update =	"98.03 mitchell"
}

@inproceedings{cs-rreww-83
, author =	"R. Cole and A. Siegel"
, title =	"River routing every which way, but loose"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, month =	nov
, year =	1983
, pages =	"112--121"
, update =	"98.03 bibrelex"
}

@inproceedings{cs-rreww-84
, author =	"R. Cole and A. Siegel"
, title =	"River routing every which way, but loose"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"65--73"
}

@inproceedings{cv-aepsa-86
, author =	"R. Cole and U. Vishkin"
, title =	"Approximate and Exact Parallel Scheduling with Applications to List, Tree, and Graph Problems"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"478--491"
, update =	"95.01 tamassia"
}

@article{cv-apsp1-88
, author =	"R. Cole and U. Vishkin"
, title =	"Approximate parallel scheduling, Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time"
, journal =	"SIAM J. Comput."
, volume =	17
, number =	1
, year =	1988
, pages =	"128--142"
, update =	"98.07 bibrelex, 96.09 orourke"
}

@inproceedings{cv-dctac-86i
, author =	"R. Cole and U. Vishkin"
, title =	"Deterministic Coin Tossing and Accelerating Cascades: {Micro} and Macro Techniques for Designing Parallel Algorithms"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"206--219"
, update =	"98.03 bibrelex"
}

@article{cv-dctao-86
, author =	"R. Cole and U. Vishkin"
, title =	"Deterministic coin tossing with applications to optimal list ranking"
, journal =	"Inform. Control"
, volume =	1
, year =	1986
, pages =	"153--174"
, update =	"97.11 bibrelex"
}

@article{cv-fopps-89
, author =	"R. Cole and U. Vishkin"
, title =	"Faster optimal parallel prefix sums and list ranking"
, journal =	"Inform. Comput."
, volume =	81
, number =	3
, month =	jun
, year =	1989
, pages =	"334--352"
, update =	"98.07 bibrelex"
}

@article{cv-acdto-88
, author =	"R. Cole and U. Vishkin"
, title =	"The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"329--346"
, update =	"97.11 bibrelex"
}

@inproceedings{cy-grp-83
, author =	"R. Cole and C. K. Yap"
, title =	"Geometric retrieval problems"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"112--121"
, precedes =	"cy-grp-84"
, update =	"97.11 bibrelex"
}

@article{cy-grp-84
, author =	"R. Cole and C. K. Yap"
, title =	"Geometric retrieval problems"
, journal =	"Inform. Control"
, volume =	63
, year =	1984
, pages =	"39--57"
, keywords =	"locus approach, reporting, subdivisions, points"
, succeeds =	"cy-grp-83"
, update =	"97.11 bibrelex"
}

@techreport{cy-sp-83
, author =	"R. Cole and C.-K. Yap"
, title =	"Shape from Probing"
, type =	"Technical {Report}"
, number =	15
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, month =	dec
, year =	1983
, update =	"98.03 bibrelex"
}

@article{cy-sp-87
, author =	"R. Cole and C. K. Yap"
, title =	"Shape from probing"
, journal =	"J. Algorithms"
, volume =	8
, number =	1
, month =	mar
, year =	1987
, pages =	"19--38"
, keywords =	"detection, probing, two-dimensional, worst-case analysis, lower bounds"
, update =	"98.11 bibrelex"
}

@article{cz-opabd-90
, author =	"R. Cole and O. Zajicek"
, title =	"An optimal parallel algorithm for building a data structure for planar point location"
, journal =	"J. Parallel Distrib. Comput."
, volume =	8
, year =	1990
, pages =	"280--285"
, update =	"93.05 devillers"
}

@inproceedings{cz-aiapm-89
, author =	"R. Cole and O. Zajicek"
, title =	"The {APRAM}: Incorporating asynchrony into the {PRAM} model"
, booktitle =	"Proc. 1st ACM Sympos. Parallel Algorithms Architect."
, year =	1989
, pages =	"169--178"
, update =	"96.09 orourke"
}

@inproceedings{cz-eaa-90
, author =	"R. Cole and O. Zajicek"
, title =	"The expected advantage of asynchrony"
, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"85--94"
, update =	"96.09 orourke"
}

@inproceedings{ca-isc-79
, author =	"G. Coleman and H. Andrews"
, title =	"Image Segmentation by Clustering"
, booktitle =	"Proceedings of the IEEE."
, year =	1979
, pages =	"773--785"
, update =	"98.07 agarwal"
}

@inproceedings{cs-psrrs-01
, author =	"Narcis Coll and Joan Antoni Sellar{\`e}s"
, title =	"Planar Shape Reconstruction from Random Sections"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"121--124"
, update =	"01.04 icking"
}

@mastersthesis{c-vgump-91
, author =	"P. Colley"
, title =	"Visibility graphs of uni-monotone polygons"
, school =	"Univ. Waterloo"
, year =	1991
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@article{cls-vgt-97
, author =	"P. Colley and A. Lubiw and J. Spinrad"
, title =	"Visibility graphs of towers"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"161--172"
, update =	"97.03 devillers"
}

@inproceedings{cmr-mlg-95
, author =	"Paul Colley and Hank Meijer and David Rappaport"
, title =	"Motivating Lazy Guards"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"121--126"
, update =	"95.09 jones"
}

@techreport{cmr-onsps-94t
, author =	"P. Colley and H. Meijer and D. Rappaport"
, title =	"Optimal Nearly-Similar Polygon Stabbers of Convex Polygons"
, type =	"Technical Report"
, number =	"CISC-94-357"
, institution =	"Queen's University"
, year =	1994
, precedes =	"cmr-onsps-94"
, update =	"98.11 bibrelex"
}

@inproceedings{cmr-onsps-94
, author =	"P. Colley and H. Meijer and D. Rappaport"
, title =	"Optimal Nearly-Similar Polygon Stabbers of Convex Polygons"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"269--274"
, succeeds =	"cmr-onsps-94t"
, cites =	"ab-eact-87, ad-ahdsp-87, bcetsu-csts-91, mkb-caocp-93, cmr-onsps-94t, e-acg-87, emprww-sls-82, ew-spdtl-89, gpw-gtt-91, mr-mpcpl-90, o-olafs-81, r-mptls-92, aw-plts-88, e-ftssg-85, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{c-rvgum-92
, author =	"P. A. Colley"
, title =	"Recognizing visibility graphs of uni-monotone polygons"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"29--34"
, cites =	"ae-vgspu-91, aek-rvgsp-91, ahu-daca-74, c-vgump-91, e-vgr-90, ht-dgtc-73, ps-coac-82, o-agta-87, ZZZ"
, update =	"98.07 bibrelex"
}

@article{c-cmpr-71
, author =	"G. Collins"
, title =	"The Calculation of Multivariate Polynomial Resultants"
, journal =	"J. ACM"
, volume =	18
, number =	4
, year =	1971
, pages =	"515--532"
, update =	"98.03 bibrelex"
}

@inproceedings{c-qercf-75
, author =	"G. E. Collins"
, title =	"Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition"
, booktitle =	"Proc. 2nd GI Conference on Automata Theory and Formal Languages"
, series =	"Lecture Notes Comput. Sci."
, volume =	33
, publisher =	"Springer-Verlag"
, year =	1975
, pages =	"134--183"
, update =	"99.11 bibrelex, 98.03 bibrelex, 97.03 schwarzkopf, 96.09 agarwal, 93.09 rote"
}

@article{ch-mrsp-74
, author =	"G. E. Collins and E. Horowitz"
, title =	"The minimum root separation of a polynomial"
, journal =	"Math. Comput."
, volume =	28
, year =	1974
, pages =	"589--597"
, update =	"98.03 bibrelex"
}

@incollection{cl-rzp-82
, author =	"G. E. Collins and R. Loos"
, title =	"Real zeros of polynomials"
, editor =	"B. Buchberger and G. E. Collins and R. Loos"
, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1982
, pages =	"83--94"
, update =	"99.11 bibrelex, 97.11 bibrelex"
}

@incollection{crd-isasv-96
, author =	"C. Colombo and M. Rucci and P. Dario"
, title =	"Integrating selective attention and space-variant sensing in machine vision"
, editor =	"J. L. C. Sanz"
, booktitle =	"Image Technology: Advances in Image Processing, Multimedia and Machine Vision"
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"109--128"
, update =	"98.07 bibrelex"
}

@article{c-pditd-68
, author =	"P. G. Comba"
, title =	"A procedure for detecting intersections of three-dimensional objects"
, journal =	"J. ACM"
, volume =	15
, year =	1968
, pages =	"354--366"
}

@article{c-ubt-79
, author =	"D. Comer"
, title =	"The ubiquitous {B-tree}"
, journal =	"ACM Comput. Surv."
, volume =	11
, year =	1979
, pages =	"121--137"
, update =	"95.01 devillers"
}

@article{co-gpah-82
, author =	"D. Comer and M. J. O'Donnell"
, title =	"Geometric problems with applications to hashing"
, journal =	"SIAM J. Comput."
, volume =	11
, year =	1982
, pages =	"217--226"
}

@phdthesis{c-emnr-89
, author =	"M. A. Conger"
, title =	"Energy-minimizing networks in {$R^{n}$}"
, school =	"Williams College"
, year =	1989
, note =	"Honors thesis"
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@phdthesis{c-spdp-90
, author =	"H. Conn"
, title =	"Some polygon decomposition problems"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"96.09 orourke"
}

@techreport{co-srrcp-87
, author =	"H. Conn and J. O'Rourke"
, title =	"Some restricted rectangle covering problems"
, type =	"Technical {Report}"
, number =	"JHU 87-13"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1987
, keywords =	"covering, rectangles, NP-completeness"
, precedes =	"co-srrcp-87i"
, update =	"95.09 korneenko"
}

@inproceedings{co-mwqot-90
, author =	"H. E. Conn and J. O'Rourke"
, title =	"Minimum weight quadrilaterization in {$O(n^{3} \log n)$} time"
, booktitle =	"Proc. 28th Allerton Conf. Commun. Control Comput."
, month =	oct
, year =	1990
, pages =	"788--797"
, keywords =	"partitioning"
}

@inproceedings{co-srrcp-87i
, author =	"H. E. Conn and J. {O'Rourke}"
, title =	"Some restricted rectangular covering problems"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1987
, pages =	"898--907"
, keywords =	"covering, rectangles, NP-completeness, isothetic"
, succeeds =	"co-srrcp-87"
, update =	"95.09 korneenko"
}

@article{c-npbct-71
, author =	"R. Connelly"
, title =	"A new proof of {Brown}'s Collaring Theorem"
, journal =	"Proc. Amer. Math. Soc."
, volume =	27
, year =	1971
, pages =	"180--182"
, update =	"97.11 bibrelex"
}

@inproceedings{c-ggr-91
, author =	"R. Connelly"
, title =	"On generic global rigidity"
, editor =	"P. Gritzman and B. Sturmfels"
, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	4
, publisher =	"AMS Press"
, year =	1991
, pages =	"147--155"
, keywords =	"geometric graphs, $d$-dimensional, rigidity"
, update =	"95.09 korneenko"
}

@article{c-re-82
, author =	"R. Connelly"
, title =	"Rigidity and Energy"
, journal =	"Invent. Math."
, volume =	66
, year =	1982
, pages =	"11--33"
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@inproceedings{cdr-epcbu-00
, author =	"Robert Connelly and Erik D. Demaine and G{\"u}nter Rote"
, title =	"Every Polygon Can Be Untangled"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"62--65"
, update =	"00.03 bibrelex"
}

@inproceedings{cdr-spacp-00
, author =	"R. Connelly and E. D. Demaine and G. Rote"
, title =	"Straightening polygonal arcs and convexifying polygonal cycles"
, booktitle =	"Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS 2000"
, site =	"Redondo Beach, California"
, publisher =	"IEEE"
, month =	nov
, year =	2000
, pages =	"432--442"
, update =	"01.04 orourke+pocchiola"
}

@techreport{cf-ctdci-91
, author =	"R. Connelly and R. Freimer"
, title =	"Covering a triangle with disks centered on its boundary"
, type =	"Technical {Report}"
, number =	"TR~91-1242"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	nov
, year =	1991
, keywords =	"covering, disks, triangles"
}

@techreport{cw-sorps-90
, author =	"R. Connelly and W. Whiteley"
, title =	"Second-Order Rigidity and Pre-Stress Stability"
, type =	"Technical {Report}"
, institution =	"Dept. of Math, Cornell Univ"
, month =	jan
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{c-tr-92
, author =	"J. F. Connett"
, title =	"Trapped Reflections?"
, journal =	"Amer. Math. Monthly"
, volume =	99
, year =	1992
, pages =	"178--179"
, update =	"01.04 orourke"
}

@article{c-msr-96
, author =	"M. Connolly"
, title =	"Molecular surfaces: {A} review"
, journal =	"Network Science"
, volume =	"??"
, year =	1996
, url =	"http://www.awod.com/netsci/Issues/Apr96/feature1.html"
, update =	"98.07 bibrelex"
}

@article{c--85
, author =	"M. L. Connolly"
, title =	"??"
, journal =	"J. Appl. Cryst."
, volume =	18
, year =	1985
, pages =	"499--505"
, update =	"98.03 bibrelex"
}

@article{c--93
, author =	"M. L. Connolly"
, title =	"??"
, journal =	"J. Mol. Graphics"
, volume =	11
, year =	1993
, pages =	"139--141"
, update =	"98.03 bibrelex"
}

% ### or is it T. H. Connolly
@article{c-amsc-83
, author =	"M. L. Connolly"
, title =	"Analytical molecular surface calculation"
, journal =	"J. Appl. Cryst."
, volume =	16
, year =	1983
, pages =	"548--558"
, update =	"98.03 agarwal+bibrelex"
}

@article{c-saspn-83
, author =	"M. L. Connolly"
, title =	"Solvent-accessible surfaces of proteins and nucleic acids"
, journal =	"Science"
, volume =	221
, year =	1983
, pages =	"709--713"
, update =	"98.03 bibrelex"
}

@article{c-mis-91
, author =	"T. H. Connolly"
, title =	"Molecular interstitial skeleton"
, journal =	"Computer Chem."
, volume =	15
, year =	1991
, pages =	"37--45"
, update =	"98.03 agarwal"
}

@inproceedings{c-lct-95
, author =	"Joel Conraud"
, title =	"Lazy Constrained Tetrahedralization"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"15--27"
, update =	"96.01 samitchell"
}

@article{cehmnrv-aahvs-94
, author =	"M. P. Consens and F. C. Eigler and M. Z. Hasan and A. O. Mendelzon and E. G. Noik and A. G. Ryman and D. Vista"
, title =	"Architecture and Applications of the {HY+} Visualization System"
, journal =	"IBM Syst. J."
, volume =	33
, year =	1994
, pages =	"458--476"
, keywords =	"graph drawing, system"
, update =	"96.09 tamassia, 96.04 garg"
}

@inproceedings{cmr-vqss-92
, author =	"M. P. Consens and A. O. Mendelzon and A. G. Ryman"
, title =	"Visualizing and Querying Software Structures"
, booktitle =	"Proc. 14th Intl. Conference on Software Engineering"
, year =	1992
, pages =	"138--156"
, keywords =	"graph drawing"
, update =	"96.09 tamassia, 96.04 garg"
}

@book{cb-enaaa-80
, author =	"S. D. Conte and C. de Boor"
, title =	"Elementary Numerical Analysis: An Algorithmic Approach"
, edition =	"3rd"
, publisher =	"McGraw-Hill"
, address =	"New York"
, year =	1980
, update =	"96.09 orourke"
}

@article{chs-plppgs-96
, author =	"J. H. Conway and R. H. Hardin and N. J. A. Sloane"
, title =	"Packing lines, planes, etc.: {Packings} in {Grassmannian} spaces"
, journal =	"Experimental Math."
, volume =	5
, year =	1996
, pages =	"139--159"
, update =	"97.07 orourke"
}

@book{cs-splg-88
, author =	"J. H. Conway and N. J. A. Sloane"
, title =	"Sphere Packings, Lattices and Groups"
, edition =	"1st"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1988
, update =	"97.11 bibrelex"
}

@book{cs-splg-93
, author =	"J. H. Conway and N. J. A. Sloane"
, title =	"Sphere Packings, Lattices and Groups"
, edition =	"2nd"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1993
, update =	"97.11 bibrelex, 97.07 orourke"
}

@article{cclbwfodbt-avebp-80
, author =	"L. T. Cook and P. N. Cook and K. R. Lee and S. Batnitzky and B. Y. S. Wong and S. L. Fritz and J. Ophir and S. J. {Dwyer, III} and L. R. Bigongiari and A. W. Tempelton"
, title =	"An algorithm for volume estimation based on polyhedral approximation"
, journal =	"IEEE Trans. Biomedical Engineering"
, volume =	27
, year =	1980
, pages =	"493--500"
, update =	"98.03 bibrelex"
}

@article{c-sscg-86
, author =	"R. L. Cook"
, title =	"Stochastic sampling in computer graphics"
, journal =	"ACM Trans. Grpah."
, volume =	5
, year =	1986
, pages =	"51--72"
, update =	"98.03 bibrelex"
}

@article{cpc-drt-84
, author =	"R. L. Cook and T. Porter and L. Carpenter"
, title =	"Distributed ray tracing"
, journal =	"Comput. Graph."
, volume =	18
, year =	1984
, pages =	"137--145"
, update =	"98.03 bibrelex"
}

@article{cdr-ultbp-86
, author =	"S. A. Cook and C. Dwork and R. Reischuk"
, title =	"Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"87--97"
, update =	"96.09 orourke"
}

@article{chkm-ipp-92
, author =	"W. Cook and M. Hartman and R. Kannan and C. McDiarmid"
, title =	"On integer points in polyhedra"
, journal =	"Combinatorica"
, volume =	12
, year =	1992
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@techreport{crss-igbra-91
, author =	"W. Cook and T. Rugherford and H. E. Scarf and D. Shallcross"
, title =	"An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming"
, number =	990
, institution =	"Yale University"
, month =	aug
, year =	1991
, note =	"Cowles Foundation Discussion Paper"
, update =	"98.11 bibrelex"
}

@book{cf-hcc-67
, author =	"G. E. Cooke and R. L. Finney"
, title =	"Homology of cell complexes"
, publisher =	"Princeton University Press"
, year =	1967
, update =	"98.03 bibrelex"
}

@techreport{c-scads-67
, author =	"S. A. Coons"
, title =	"Surfaces for Computer Aided Design of Space Forms"
, type =	"Technical {Report}"
, number =	"MAC-TR-41"
, institution =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, month =	jun
, year =	1967
, update =	"98.03 bibrelex"
}

@techreport{ct-stcos-96
, author =	"S. Coorg and S. Teller"
, title =	"A Spatially and Temporally Coherent Object Space Visibility Algorithm"
, number =	"TM-546"
, institution =	"Laboratory of Computer Science, MIT"
, year =	1996
, update =	"97.11 bibrelex"
}

@inproceedings{ct-rtocm-97
, author =	"S. Coorg and S. Teller"
, title =	"Real-time occlusion culling for models with large occluders"
, booktitle =	"Proc. 1997 Sympos. Interactive 3D Graphics"
, year =	1997
, update =	"98.07 bibrelex"
}

@inproceedings{ct-tccv-96
, author =	"Satyan Coorg and Seth Teller"
, title =	"Temporally Coherent Conservative Visibility"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"78--87"
, update =	"96.05 efrat"
}

@article{clw-epnib-79
, author =	"D. Coppersmith and D. T. Lee and C. K. Wong"
, title =	"An elementary proof of nonexistence of isometries between {$L_p$} and {$L_q$}"
, journal =	"IBM J. Res. Develop."
, volume =	23
, number =	6
, year =	1979
, pages =	"696--699"
, keywords =	"$L_p$-metric"
, update =	"99.03 bibrelex, 95.09 korneenko"
}

@inproceedings{cw-mmap-87
, author =	"D. Coppersmith and S. Winograd"
, title =	"Matrix multiplication via arithmetic progressions"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Theory Comput."
, year =	1987
, pages =	"1--6"
, update =	"97.11 bibrelex"
}

@article{cw-mmap-90
, author =	"D. Coppersmith and S. Winograd"
, title =	"Matrix multiplication via arithmetic progressions"
, journal =	"J. Symbolic Comput."
, volume =	9
, year =	1990
, pages =	"251--280"
, update =	"97.11 bibrelex"
}

@techreport{cn-ifvda-85
, author =	"A. J. Coppola and J. Nave"
, title =	"Implementing a fast {Voronoi} diagram algorithm for theoretical experimentation"
, type =	"Report"
, number =	"??"
, institution =	"Intel Corporation"
, address =	"Hillsboro, NJ"
, year =	1985
}

@inproceedings{cmr-avdsc-93
, author =	"A. G. Corbalan and Marisa Mazon and Tomas Recio"
, title =	"About {Voronoi} Diagrams For Strictly Convex Distances"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"17--22"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{cmr-gbscd-96
, author =	"A. G. Corbalan and M. Mazon and T. Recio"
, title =	"Geometry of bisectors for strictly convex distances"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"45--58"
, update =	"96.09 devillers"
}

@inproceedings{cmrs-tspvd-93
, author =	"A. G. Corbalan and M. Mazon and T. Recio and F. Santos"
, title =	"On the topological shape of planar {Voronoi} diagrams"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"109--115"
, cites =	"cmrs-tspvd-93c, ab-rdt-85, ab-gdt-86, cd-vdbcd-85, gs-pmgsc-85, k-cavd-89, k-tvs1-69, l-tdvdl-80, m-ddvec-92, ZZZ"
, update =	"00.03 bibrelex, 98.03 bibrelex, 97.11 icking, 93.09 jones"
}

@inproceedings{cmrs-tspvd-93c
, author =	"A. G. Corbalan and Marisa Mazon and Tomas Recio and Francisco Santos"
, title =	"On The Topological Shape Of Planar {Voronoi} Diagrams"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"23--25"
, precedes =	"cmrs-tspvd-93"
, cites =	"ab-rdt-85, ab-gdt-86, cd-vdbcd-85, gs-pmgsc-85, k-cavd-89, k-tvs1-69, l-tdvdl-80, m-ddvec-92, ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex, 98.03 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@techreport{c-tpc-79
, author =	"J. Corbett"
, title =	"Topological Principles in Cartography"
, type =	"Technical {Paper}"
, number =	48
, institution =	"Bureau of the Census"
, address =	"Washington, DC"
, year =	1979
, update =	"98.03 bibrelex"
}

@article{cd-oapa-85
, author =	"L. P. Cordella and G. Dettori"
, title =	"An ${O}(n)$ algorithm for polygonal approximation"
, journal =	"Pattern Recogn. Lett."
, volume =	3
, number =	2
, year =	1985
, pages =	"93--97"
, keywords =	"polygon, fitting"
, update =	"95.09 korneenko"
}

@article{cr-lpvgf-86
, author =	"C. Cordes and K. B. Reid"
, title =	"Largest polygons with vertices in a given finite set"
, journal =	"Discrete Appl. Math."
, volume =	14
, number =	3
, year =	1986
, pages =	"255--262"
, keywords =	"extremal figures, polygon, points"
, update =	"95.09 korneenko"
}

@article{c-omgs-83
, author =	"R. Cordovil"
, title =	"Oriented matroids and geometric sorting"
, journal =	"Canad. Math. Bull."
, volume =	26
, number =	3
, year =	1983
, pages =	"51--354"
, keywords =	"sorting, oriented matroids"
, update =	"95.09 korneenko"
}

@article{c-sutds-82
, author =	"R. Cordovil"
, title =	"Sur un th{\'e}oreme de s{\'e}paration des matroides orient{\'e}s de rang trois"
, journal =	"Discrete Math."
, volume =	40
, year =	1982
, pages =	"163--169"
, update =	"97.11 bibrelex"
}

@article{c-ddnpp-83
, author =	"R. Cordovil"
, title =	"The directions determined by $n$ points in the plane: a matroidal generalization"
, journal =	"Discrete Math."
, volume =	43
, year =	1983
, pages =	"131--137"
, update =	"97.11 bibrelex"
}

@article{cdc-poaca-86
, author =	"R. Cordovil and R. Dil{\~a}o and A. N. da Costa"
, title =	"Periodic orbits for additive cellular automata"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"277--288"
}

@article{clm-ermfm-82
, author =	"R. Cordovil and M. {Las Vergnas} and A. Mandel"
, title =	"Euler's relation, {M{\"o}bius} functions, and matroid identities"
, journal =	"Geom. Dedicata"
, volume =	12
, year =	1982
, pages =	"147--162"
}

@article{c-ucplg-75
, author =	"R. Cori"
, title =	"Un code pour les graphes planaires et ses applications"
, journal =	"Ast{\'e}risque"
, volume =	27
, year =	1975
, update =	"98.07 bibrelex"
}

@misc{cw-pi-90
, author =	"B. T. Corkum and J. A. Wyllie"
, title =	"Program for insidepolytope"
, howpublished =	"Newsgroup comp.graphics"
, year =	1990
, note =	"Message 1990{O}ct3.121706.11932
		 jarvis.csri.toronto.edu"
, update =	"98.11 bibrelex"
}

@article{cghj-lwfm-93
, author =	"Robert M. Corless and Gaston H. Gonnet and D. E. G. Hare and David J. Jeffrey"
, title =	"{Lambert's} {W} function in {Maple}"
, journal =	"The Maple Techical Newsletter"
, volume =	"Issue 9"
, year =	1993
, pages =	"12--22"
, update =	"00.03 bibrelex"
}

@inproceedings{c-atbpb-93
, author =	"T. H. Cormen"
, title =	"Asymptotically Tight Bounds for Performing {BMMC} Permutations on Parallel Disk Systems"
, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
, year =	1993
, pages =	"130--139"
, update =	"96.09 orourke"
}

@article{c-fpda-93
, author =	"T. H. Cormen"
, title =	"Fast Permuting on Disk Arrays"
, journal =	"J. Parallel Distrib. Comput."
, volume =	17
, year =	1993
, pages =	"41--57"
, update =	"96.09 orourke"
}

@book{clr-ia-90
, author =	"T. H. Cormen and C. E. Leiserson and R. L. Rivest"
, title =	"Introduction to Algorithms"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1990
, update =	"97.03 schwarzkopf, 93.09 tamassia"
}

@book{clrs-ia-01
, author =	"T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein", title = "Introduction to Algorithms"
, edition =	"2nd"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	2001
, update =	"01.11 smid"
}

@article{cn-tbcts-78
, author =	"G. Cornuejol and G. L. Nemhauser"
, title =	"Tight bounds for {Christofides}' traveling salesman heuristic"
, journal =	"Math. Program."
, volume =	14
, year =	1978
, pages =	"116--121"
}

@article{c-vdabt-22
, author =	"J. G. von der Corput"
, title =	"Versch{\"a}rfung der {Absch{\"a}tzung} beim {Teilerproblem}"
, journal =	"Math. Annalen"
, volume =	87
, year =	1922
, pages =	"39--65"
, update =	"97.11 bibrelex"
}

@article{cc-fcdt-87
, author =	"Y. Correc and E. Chapuis"
, title =	"Fast Computation of {Delaunay} Triangulations"
, journal =	"Adv. Eng. Softw."
, volume =	9
, number =	2
, year =	1987
, pages =	"77--83"
, annote =	"Claims $O(n \log n)$ measured performance. Points are
		 sorted by one coordinate and a Lawson style incremental
		 algorithm is used. Triangle list is maintained in
		 sorted by one coordinate of barycentre."
}

@inproceedings{cghmsv-ttpnp-01
, author =	"Carmen Cort{\'e}s and Clara I. Grima and Ferran Hurtado and Alberto M{\'a}rquez and Francisco Santos and Jes{\'u}s Valenzuela"
, title =	"Transforming Triangulations of Polygons on Non Planar Surfaces"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"31--34"
, update =	"01.04 icking"
}

@inproceedings{cgm-fetc-99
, author =	"Carmen Cort{\'e}s and Clara I. Grima and Alberto M{\'a}rquez"
, title =	"Flipping Edges in Triangulations on the Cylinder"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"77--79"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{chmn-efts-98
, author =	"C. Cort{\'e}s and F. Hurtado and A. M{\'a}rquez and A. Nakamoto"
, title =	"Edge Flipping on Triangulations of Surfaces"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"59--60"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@techreport{cj-ffdgt-85
, author =	"M. Corthout and H. Jonkers"
, title =	"A formal framework for discrete geometry: theory and graphics applications"
, type =	"Report"
, number =	"??"
, institution =	"Philips Lab."
, address =	"Briarcliff Manor, NY"
, year =	1985
}

@article{cj-tdnpc-86
, author =	"M. E. Corthout and H. B. M. Jonkers"
, title =	"The transformational development of a new point containment algorithm"
, journal =	"Philips J. Res. Devel."
, volume =	41
, year =	1986
, pages =	"83--174"
, keywords =	"point location"
, update =	"95.09 korneenko"
}

@incollection{c-vfgf-89
, author =	"D. Cortolezzis"
, title =	"The virtual floating grid file"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	381
, year =	1989
, pages =	"116--127"
, keywords =	"data structuring"
, update =	"95.09 korneenko"
}

@article{cdf-csxy-89
, author =	"M. Cosnard and J. Duprat and A. G. Ferreira"
, title =	"Complexity of selection in $X+Y$"
, journal =	"Theoret. Comput. Sci."
, volume =	67
, number =	1
, year =	1989
, pages =	"115--120"
, keywords =	"lower bounds, searching"
, update =	"95.09 korneenko"
}

@article{cdf-csxyo-90
, author =	"M. Cosnard and J. Duprat and A. G. Ferreira"
, title =	"The complexity of searching in $X+Y$ and other multisets"
, journal =	"Inform. Process. Lett."
, volume =	34
, number =	2
, year =	1990
, pages =	"103--109"
, keywords =	"lower bounds, searching"
, update =	"95.09 korneenko"
}

@article{cr-tlcra-88
, author =	"M. Cost and M. F. Roy"
, title =	"Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets"
, journal =	"J. Symbolic Comput."
, volume =	5
, year =	1988
, pages =	"121--129"
, update =	"98.03 bibrelex"
}

@article{cs-wnnal-93
, author =	"S. Cost and S. Salzberg"
, title =	"A weighted nearest neighbor algorithm for learning with symbolic features"
, journal =	"Machine Learning"
, volume =	10
, year =	1993
, pages =	"57--67"
, update =	"97.07 agarwal"
}

@incollection{c-esg-89
, author =	"M. Coste"
, title =	"Effective semialgebraic geometry"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, year =	1989
, pages =	"1--27"
, keywords =	"algebraic geometry, motion planning"
, update =	"95.09 korneenko"
}

@inproceedings{cs-smuvi-96
, author =	"H. L. de Cougny and M. S. Shephard"
, title =	"Surface meshing using vertex insertion"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"243--256"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{cl-dvg-91
, author =	"C. Coullard and A. Lubiw"
, title =	"Distance visibility graphs"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"289--296"
, keywords =	"visibility, geometric graphs"
, cites =	"acp-cfekt-87, ap-crp3t-86, c-tsplt-90i, ec-rvgsp-90, e-hdpa-85, g-rcvgs-88, h-fvgsp-87, ht-dgtc-73, o-agta-87, o-rcvg-90, ow-nmcvg-88, ps-cgi-85, rs-gm2aa-86, s-tpgep-80, t-ktgtc-89, ty-sltat-84, y-edp-81, y-stapl-79, ZZZ"
, update =	"97.11 bibrelex"
}

@article{cl-dvg-92
, author =	"C. Coullard and A. Lubiw"
, title =	"Distance visibility graphs"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	4
, year =	1992
, pages =	"349--362"
, keywords =	"visibility, geometric graphs"
, succeeds =	"cl-dvg-91"
, update =	"98.11 bibrelex, 96.05 pocchiola"
}

@article{cdm-ffepm-85
, author =	"J. L. Coulomb and Y. {Du Terrail} and G. Meunier"
, title =	"Flux3d: {A} Finite Element Package For Magnetic Computation"
, journal =	"IEEE Trans. Magn."
, volume =	"MAG-21"
, number =	6
, month =	nov
, year =	1985
, pages =	"2499--2502"
, keywords =	"computer program flux3d"
, annote =	"Uses 3D DT by insertion."
, abstract =	"A finite element package for the computation of
		 three-dimensional magnetostatic field is described. The
		 finite element mesh is automatically built in two steps
		 using a Delaunay tetrahedrization. In step 1, the user
		 gives interactively a first set of nodes located on
		 interfaces and boundaries, and the program computes a
		 coarse tetrahedral mesh. In step 2, the program adds
		 new nodes automatically to refine the initial mesh and
		 regularizes it. The implemented finite element
		 formulations use either scalar or vector potential. The
		 postprocessor allows interactive computation and
		 visualization of any local or global quantities given
		 by closed formulas. 9 refs."
}

@book{c-dic-36
, author =	"R. Courant"
, title =	"Differential and integral calculus"
, volume =	2
, publisher =	"Interscience Publishers"
, address =	"New York, NY"
, year =	1936
, update =	"98.03 bibrelex"
}

@article{cb-accwf-86
, author =	"S. M. Courter and J. A. {Brewer III}"
, title =	"Automated Conversion of Curvilinear Wire-Frame Models to Surface Boundary Models"
, journal =	"Comput. Graph."
, volume =	20
, number =	4
, month =	aug
, year =	1986
, pages =	"171--178"
, note =	"Proc. SIGGRAPH '86"
, update =	"98.03 bibrelex"
}

@article{ch-nnpc-67
, author =	"T. M. Cover and P. E. Hart"
, title =	"Nearest neighbor pattern classification"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	13
, year =	1967
, pages =	"21--27"
, update =	"97.07 agarwal"
}

@book{ct-eit-91
, author =	"T. M. Cover and J. A. Thomas"
, title =	"Elements of Information Theory"
, publisher =	"Wiley-Interscience"
, address =	"New York, NY"
, year =	1991
, update =	"98.07 bibrelex"
}

@book{clo-iva-92
, author =	"D. Cox and J. Little and D. {O'Shea}"
, title =	"Ideals, Varieties, and Algorithms"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1992
, keywords =	"book"
, update =	"95.01 devillers"
}

@techreport{cy-olmpm-89
, author =	"J. Cox and C. Yap"
, title =	"On-line motion planning: {Moving} a planar arm by probing an unknown environment"
, type =	"Manuscript"
, year =	1989
, update =	"97.11 bibrelex"
}

% ### what is it?
@techreport{ch-aldcs-88
, author =	"M. G. Cox and P. M. Harris"
, title =	"An algorithm for loop detection in cursive script recognition"
, type =	"Report"
, number =	120
, institution =	"Div. Inf. Techn. and Comput., Nat. Phys. Lab."
, year =	1988
, pages =	"i--ii, 1--16"
, keywords =	"intersection"
, update =	"95.09 korneenko"
}

@article{cmmr-omcp-89
, author =	"P. Cox and H. Maitre and M. Minoux and C. Ribeiro"
, title =	"Optimal matching of convex polygons"
, journal =	"Pattern Recogn. Lett."
, volume =	9
, number =	5
, year =	1989
, pages =	"327--334"
, keywords =	"convex polygon, similarity"
, update =	"95.09 korneenko"
}

@article{c-czmpd-62
, author =	"H. S. M. Coxeter"
, title =	"A classification of zonohedra by means of projective diagrams"
, journal =	"J. Math. Pure Appl."
, volume =	41
, year =	1962
, pages =	"137--156"
, update =	"94.05 devillers"
}

@book{c-ig-61
, author =	"H. S. M. Coxeter"
, title =	"Introduction to Geometry"
, edition =	"1st"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1961
, update =	"99.11 bibrelex"
}

@book{c-ig-69
, author =	"H. S. M. Coxeter"
, title =	"Introduction to Geometry"
, edition =	"2nd"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1969
, update =	"98.11 bibrelex"
}

@inproceedings{c-ot-91
, author =	"H. S. M. Coxeter"
, title =	"Orthogonal trees"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"89--97"
, cites =	"b-geadl-68, cs-splg-88, c-rp-73, c-rsrp-88, c-to-89, ZZZ"
, update =	"97.11 bibrelex"
}

@article{c-rsrp-88
, author =	"H. S. M. Coxeter"
, title =	"Regular and semi-regular polytopes, 3"
, journal =	"Math. Z."
, volume =	200
, year =	1988
, pages =	"3--45"
, update =	"97.11 bibrelex"
}

@book{c-rcp-91
, author =	"H. S. M. Coxeter"
, title =	"Regular Complex Polytopes"
, edition =	"2nd"
, publisher =	"Cambridge University Press"
, address =	"Cambridge, England"
, year =	1991
}

@book{c-rp-73
, author =	"H. S. M. Coxeter"
, title =	"Regular Polytopes"
, edition =	"2nd"
, publisher =	"Dover"
, address =	"New York, NY"
, year =	1973
}

@article{c-sdcrg-50
, author =	"H. S. M. Coxeter"
, title =	"Self-Dual Configurations and Regular Graphs"
, journal =	"Bull. Amer. Math. Soc."
, volume =	56
, year =	1950
, pages =	"413--455"
, update =	"97.11 bibrelex"
}

@book{c-rpp-49
, author =	"H. S. M. Coxeter"
, title =	"The real projective plane"
, publisher =	"McGraw-Hill"
, year =	1949
, update =	"98.03 bibrelex"
}

@article{c-to-89
, author =	"H. S. M. Coxeter"
, title =	"Trisecting an orthoscheme"
, journal =	"Comput. Math. Appl."
, volume =	17
, year =	1989
, pages =	"59--71"
, update =	"97.11 bibrelex"
}

@book{cfp-zsg-81
, author =	"H. S. M. Coxeter and R. Frucht and D. L. Powers"
, title =	"Zero Symmetric Graphs"
, publisher =	"Academic Press"
, year =	1981
, update =	"97.11 bibrelex"
}

@book{cg-gr-67
, author =	"H. S. M. Coxeter and S. L. Greitzer"
, title =	"Geometry Revisited"
, publisher =	"Mathematical Association of America"
, address =	"Washington, DC"
, year =	1967
}

@book{cm-grdg-72
, author =	"H. S. M. Coxeter and W. O. J. Moser"
, title =	"Generators and Relations for Discrete Groups"
, edition =	"3rd"
, publisher =	"Springer-Verlag"
, year =	1972
, precedes =	"cm-grdg-80"
, update =	"97.11 bibrelex"
}

@book{cm-grdg-80
, author =	"H. S. M. Coxeter and W. O. J. Moser"
, title =	"Generators and Relations for Discrete Groups"
, publisher =	"Springer-Verlag"
, year =	1980
, succeeds =	"cm-grdg-72"
, update =	"97.11 bibrelex"
}

@article{c-mcsrv-72
, author =	"I. K. Crain"
, title =	"{Monte}-{Carlo} Simulation of the Random {Voronoi} Polygons: Preliminary Results"
, journal =	"Search"
, volume =	3
, year =	1972
, pages =	"220--221"
, annote =	"Measures various statistics for random Voronoi
		 polygons."
}

@article{c-mcgrp-78
, author =	"I. K. Crain"
, title =	"The {Monte}-{Carlo} Generation of Random Polygons"
, journal =	"Comput. Geosci."
, volume =	4
, year =	1978
, pages =	"131--141"
, annote =	"Statistics on 46000 random Voronoi polygons. Simple
		 method to determine 1 polygon. Closest point gives
		 initial side---intersection with all other bisectors
		 gives endpoints. Then walk around boundary."
}

@techreport{c-llpqb-72
, author =	"C. Crane"
, title =	"Linear lists and priority queues as balanced binary trees"
, type =	"Technical Report"
, number =	"CS-72-259"
, institution =	"Dept. of Computer Science, Stanford University"
, address =	"CA"
, year =	1972
, update =	"98.11 bibrelex"
}

@article{c-sr-79
, author =	"H. Crapo"
, title =	"Structural rigidity"
, journal =	"Structural Topology"
, volume =	1
, year =	1979
, pages =	"26--45"
, update =	"97.11 bibrelex"
}

@techreport{chsww-scg-88
, author =	"H. Crapo and T. F. Havel and B. Sturmfels and W. Whiteley and N. L. White"
, title =	"Symbolic computations in geometry"
, type =	"{IMA} {Preprint} {Series}"
, number =	389
, institution =	"Inst. Math. Appl., Univ. Minnesota"
, address =	"Minneapolis, MN"
, year =	1988
}

@incollection{cl-hcdc-88
, author =	"H. Crapo and J. P. Laumond"
, title =	"{Hamiltonian} Cycles in {Delaunay} Complexes"
, booktitle =	"??"
, series =	"Lect. Notes in Comp. Sci."
, volume =	1416
, institution =	"LAAS/CNRS"
, year =	1988
, update =	"98.11 bibrelex"
}

@inproceedings{cl-hcdc-89
, author =	"Henry Crapo and Jean-Paul Laumond"
, title =	"{Hamiltonian} Cycles in {Delaunay} Complexes"
, booktitle =	"Proc. of the Workshop on Geometry and Robotics"
, site =	"Toulouse, France"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"292--305"
, update =	"99.11 bibrelex, 98.11 bibrelex, 96.09 agarwal, 93.09 smid"
}

@inproceedings{cr-sagh-86
, author =	"H. Crapo and J. Ryan"
, title =	"Scene analysis and geometric homology"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"125--132"
, cites =	"b-j-79, c-sr-79, cr-srls-86, cw-sfmps-82, c-gs-90, c-gs-66, drs-fctcm-74, dh-pcsa-73, dh-pcsa-73, h-dcaps-77, m-orfdf-64, s-msldp-81, t-rprbj-83, tw-rdgrs-84, w-rp-79, ZZZ"
, update =	"97.11 bibrelex"
}

@article{cr-srls-86
, author =	"H. Crapo and J. Ryan"
, title =	"Spatial realizations of linear scenes"
, journal =	"Structural Topology"
, volume =	13
, year =	1986
, pages =	"33--68"
}

@techreport{cw-pspp-86
, author =	"H. Crapo and W. Whiteley"
, title =	"Plane stresses and projected polyhedra"
, type =	"Technical {Report}"
, institution =	"Univ. Montreal"
, address =	"Montreal, PQ"
, year =	1986
, succeeds =	"w-tapp-86"
, update =	"00.03 bibrelex, 93.09 milone+mitchell"
}

@article{cw-sfmps-82
, author =	"H. Crapo and W. Whitely"
, title =	"Statics of Frameworks and Motions of Panel Structures, a Projective Geometric Introduction"
, journal =	"Structural Topology"
, volume =	6
, year =	1982
, pages =	"42--82"
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@article{csy-smico-95
, author =	"D. Crass and I. Suzuki and M. Yamashita"
, title =	"Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"397--412"
, keywords =	"geometry, visibility, search"
, update =	"00.03 bibrelex, 96.09 devillers"
}

@inproceedings{cfmmr-remas-98
, author =	"A. Crauser and P. Ferragina and K. Mehlhorn and U. Meyer and E. Ramos"
, title =	"Randomized external-memory algorithms for some geometric problems"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"269--268"
, update =	"99.03 agarwal"
}

@article{cfmmr-remal-01
, author =	"A. Crauser and P. Ferragina and K. Mehlhorn and U. Meyer and E. A. Ramos"
, title =	"Randomized external-memory algorithms for line segment intersection and other geometric problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"305--337"
, update =	"01.07 smid"
}

@inproceedings{c-agrv-85
, author =	"C. Crawford"
, title =	"Aspect graphs and robot vision"
, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
, year =	1985
, pages =	"382--384"
, update =	"98.11 bibrelex"
}

@article{cl-slp-90a
, author =	"J. Cremona and S. Landau"
, title =	"Shrinking lattice polyhedra"
, journal =	"SIAM J. Discrete Math."
, volume =	3
, number =	3
, year =	1990
, pages =	"338--348"
, keywords =	"discrete geometry, $d$-dimensional, polyhedra, similarity"
, succeeds =	"cl-slp-90i"
, update =	"97.11 bibrelex, 95.09 korneenko"
}

@inproceedings{cl-slp-90i
, author =	"J. Cremona and S. Landru"
, title =	"Shrinking lattice polyhedra"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"188--193"
, precedes =	"cl-slp-90a"
, update =	"95.09 korneenko"
}

@book{c-gs-90
, author =	"L. Cremona"
, title =	"Graphical Statics"
, publisher =	"Oxford University Press"
, address =	"London"
, year =	1890
, update =	"97.11 bibrelex"
}

@techreport{cdp-noaau-91
, author =	"P. Crescenzi and G. {Di Battista} and A. Piperno"
, title =	"A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees"
, number =	"11.91"
, institution =	"Dipartimento di Informatica e Sistemistica, Univ. di Roma ``La Sapienza''"
, year =	1991
, keywords =	"graph drawing"
, precedes =	"cdp-noaau-92"
, update =	"94.01 tamassia, 93.09 tamassia"
}

@article{cdp-noaau-92
, author =	"P. Crescenzi and G. {Di Battista} and A. Piperno"
, title =	"A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, year =	1992
, pages =	"187--200"
, keywords =	"graph drawing"
, succeeds =	"cdp-noaau-91"
, update =	"94.01 tamassia"
}

@inproceedings{cp-mahvd-97
, author =	"Pierluigi Crescenzi and Paolo Penna"
, title =	"Minimum-Area $h$-$v$ Drawings of Complete Binary Trees"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"371--382"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{cpp-lauda-98
, author =	"P. Crescenzi and P. Penna and A. Piperno"
, title =	"Linear-Area Upward Drawings of {AVL} Trees"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, year =	1998
, pages =	"25--42"
, note =	"(special issue on Graph Drawing, edited by G.~{Di Battista} and R.~Tamassia)"
, succeeds =	"cp-oauda-95"
, update =	"98.11 devillers+patrignani, 98.07 vismara"
}

@inproceedings{cp-oauda-95
, author =	"P. Crescenzi and A. Piperno"
, title =	"Optimal-Area Upward Drawings of {AVL} Trees"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"307--317"
, keywords =	"graph drawing, planar, upward, trees"
, update =	"95.01 tamassia"
}

@article{chs-gmolr-88
, author =	"T. Creutzburg and A. H{\"u}bler and O. Sykora"
, title =	"Geometric methods for on-line recognition of digital straight line segments"
, journal =	"Computers Artif. Intel."
, volume =	7
, number =	3
, year =	1988
, pages =	"253--276"
, keywords =	"digital geometry"
, update =	"95.09 korneenko"
}

@book{ch-dgmc-88
, author =	"G. Crippen and T. Havel"
, title =	"Distance Geometry and Molecular Conformation"
, publisher =	"Research Studies Press"
, address =	"Letchworth, UK"
, year =	1988
, update =	"98.07 bibrelex"
}

@book{ch-dgmc-88b
, author =	"G. M. Crippen and T. F. Havel"
, title =	"Distance Geometry and Molecular Conformation"
, publisher =	"John Wiley \& Sons"
, year =	1988
, update =	"99.11 bibrelex, 98.11 orourke"
}

@book{cfg-upg-90
, author =	"H. P. Croft and K. J. Falconer and R. K. Guy"
, title =	"Unsolved Problems in Geometry"
, publisher =	"Springer-Verlag"
, year =	1990
}

@inproceedings{c-vsanl-88
, author =	"R. G. Cromley"
, title =	"A Vertex Substitution Approach to Numerical Line Simplification"
, booktitle =	"Proc. 3rd Internat. Sympos. Spatial Data Handling"
, year =	1988
, pages =	"57--64"
, update =	"96.09 kreveld"
}

@inproceedings{c-cbsut-87
, author =	"R. G. Cromley"
, title =	"Calculating Bisector Skeletons Using a {Thiessen} Data Structure"
, booktitle =	"Proceedings, AUTOCARTO 8"
, site =	"Baltimore, MD, March 29--April 3"
, year =	1987
, pages =	"719--724"
, update =	"93.09 devillers"
, annote =	"Vd of simple polygon. Selection algorithm."
}

@book{c-dc-92
, author =	"R. G. Cromley"
, title =	"Digital Cartography"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs"
, year =	1992
, update =	"96.09 kreveld"
}

@article{cg-pistd-85
, author =	"R. G. Cromley and D. Grogan"
, title =	"A Procedure for Identifying and Storing a {Thiessen} Diagram within a Convex Boundary"
, journal =	"Geogr. Anal."
, volume =	17
, number =	2
, month =	apr
, year =	1985
, pages =	"167--175"
, update =	"93.09 devillers"
, annote =	"Circumcircle algorithm. Only computes the part of the
		 Vd within a convex polygon."
}

@book{c-p-97
, author =	"P. Cromwell"
, title =	"Polyhedra"
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1997
, update =	"00.11 smid, 00.07 icking, 98.07 orourke"
}

@incollection{c-eev-94
, author =	"Robert L. Cromwell"
, title =	"Efficient Eigenvalues for Visualization"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"193--198"
, keywords =	"scatterplot, matrix of central moments"
, update =	"94.09 heckbert"
, annote =	"Answers the question: if I have a set of points in 3D,
from what direction should I view them to get the best view (minimizing
bunching in the projection)? Solving this involves the eigenvalues of a 3x3
matrix. Optimized formulas are given for computing the eigenvalues."
}

@article{cr-tbtdo-99
, author =	"A. Crosnier and J. R. Rossignac"
, title =	"Tribox Bounds for Three-Dimensional Objects"
, journal =	"Comput. \& Graphics"
, volume =	23
, number =	3
, month =	jun
, year =	1999
, pages =	"429--437"
, update =	"00.03 held"
}

@article{c-sacg-77
, author =	"F. C. Crow"
, title =	"Shadow Algorithms for Computer Graphics"
, journal =	"Comput. Graph."
, volume =	11
, number =	2
, year =	1977
, pages =	"242--248"
, update =	"97.11 bibrelex"
}

@book{cf-ikt-65
, author =	"R. H. Crowell and R. H. Fox"
, title =	"Introduction to Knot Theory"
, publisher =	"Blaisdell Publishing Co."
, address =	"New York, NY"
, year =	1965
, update =	"97.11 bibrelex"
}

@inproceedings{c-dvloo-92
, author =	"I. F. Cruz"
, title =	"{DOODLE}: A visual language for object-oriented databases"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1992
, pages =	"71--80"
, keywords =	"graph drawing"
, update =	"97.07 agarwal, 94.01 tamassia"
}

@inproceedings{c-uvcld-93
, author =	"I. F. Cruz"
, title =	"Using a visual constraint language for data display specification"
, editor =	"P. C. Kanellakis and J.-L. Lassez and V. Saraswat"
, booktitle =	"First Workshop on Principles and Practice of Constraint Programming"
, site =	"Newport, RI"
, month =	apr
, year =	1993
, keywords =	"graph drawing"
, update =	"94.01 tamassia"
}

% ### seems no way to do special issue cleanly?
% bibtex book can't have volume+number
% bibtex article can, but can't have editor
% hacks like {P. Eades, editors} break if printing trailing initials
@book{ce-sigv-95
, title =	"Special Issue on Graph Visualization"
, editor =	"I. F. Cruz and P. Eades"
, series =	"J. Visual Lang. Comput."
, volume =	"6:3"
, year =	1995
, keywords =	"graph drawing, collection"
, update =	"96.01 jones, 95.09 tamassia"
}

@inproceedings{cg-dgeet-95
, author =	"I. F. Cruz and A. Garg"
, title =	"Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"404--415"
, keywords =	"graph drawing, planar, visual language, declarative"
, update =	"95.01 tamassia"
}

@techreport{cgt-ecrvg-96
, author =	"I. F. Cruz and A. Garg and R. Tamassia"
, title =	"Efficient Constraint Resolution in Visual Graph Drawing"
, type =	"Manuscript"
, institution =	"Dept. of Computer Sci., Brown University"
, year =	1996
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@inproceedings{ctv-vagd-93
, author =	"I. F. Cruz and R. Tamassia and P. {Van Hentenryk}"
, title =	"A Visual approach to graph drawing"
, booktitle =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
, site =	"Paris, France"
, month =	sep
, year =	1993
, keywords =	"graph drawing"
, update =	"94.01 tamassia"
}

@inproceedings{ct-3gdsa-96
, author =	"I. F. Cruz and J. P. Twarog"
, title =	"3D Graph Drawing with Simulated Annealing"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"162--165"
, keywords =	"graph drawing, straight-line, 3D"
, update =	"96.09 tamassia, 96.04 garg"
}

@article{cr-cfhpe-84
, author =	"J. Csima and T. A. Ralston"
, title =	"Crossing-free {Hamiltonian} paths in {Euclidean} spaces"
, journal =	"Ars Combin."
, volume =	18
, year =	1984
, pages =	"87--97"
, keywords =	"geometric graphs, TSP"
, update =	"95.09 korneenko"
}

@article{cf-dvbp-90
, author =	"J. Csirik and J. B. Frenk"
, title =	"A dual version of bin packing"
, journal =	"Algorithms Rev."
, volume =	1
, number =	2
, year =	1990
, pages =	"87--95"
}

@article{cflz-mdbp-90
, author =	"J. Csirik and J. B. G. Frenk and M. Labbe and S. Zhang"
, title =	"On the multi-dimensional bin packing"
, journal =	"Acta Cybern."
, volume =	"??"
, year =	1990
, pages =	"361--369"
, keywords =	"$d$-dimensional, packing, heuristics"
, update =	"96.09 devillers, 95.09 korneenko"
}

@article{ct-nagp-98
, author =	"Gy{\"o}rgy Csizmadia and G. T{\'o}th"
, title =	"Note on an Art Gallery Problem"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, number =	1
, year =	1998
, pages =	"47--55"
, keywords =	"visibility"
, update =	"98.07 bibrelex, 98.03 orourke, 96.09 orourke"
}

@inproceedings{cdjn-dcvdc-94
, author =	"Lucian Cucu and Mircea Dragan and Tudor Jebelean and Viorel Negru"
, title =	"Divide-and-Conquer {Voronoi} Diagram Construction"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"5--7"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{cdjn-pi3dt-95
, author =	"Lucian Cucu and Mircea Dragan and Tudor Jebelean and Viorel Negru"
, title =	"Parallel Implementation of {3D} {Delaunay} Triangulation"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"25--28"
, update =	"00.03 bibrelex"
}

@inproceedings{cdnm-tddtu-95
, author =	"Lucian Cucu and Mircea Dragan and Viorel Negru and Dorin Mangu"
, title =	"Three Dimensional {Delaunay} Triangulation Using an Uniform Grid"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"21--23"
, update =	"00.03 bibrelex"
}

@inproceedings{c-spc-99
, author =	"J. Culberson"
, title =	"Sokoban is {PSPACE}-complete"
, editor =	"E. Lodi, L. Pagli, N. Santoro"
, booktitle =	"Proc. Internat. Conf. Fun with Algorithms"
, publisher =	"Carelton Scientific"
, address =	"Elba, Italy"
, month =	jun
, year =	1998
, pages =	"65--76"
, update =	"00.03 orourke"
}

@inproceedings{cr-tgsps-85
, author =	"J. Culberson and G. J. E. Rawlins"
, title =	"Turtlegons: generating simple polygons from sequences of angles"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"305--310"
, cites =	"fm-nbkck-78, h-srlp-82, p-mccpi-80, s-rcg-84, sh-srppi-72, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{cr-uaopc-89
, author =	"Joseph Culberson and Robert Reckhow"
, title =	"A Unified Approach to Orthogonal Polygon Covering Problems via {Dent} Diagrams"
, type =	"report"
, number =	"TR 89-6"
, institution =	"Department of Computing Science, University of Alberta"
, address =	"Edmonton,  Alberta, Canada"
, month =	feb
, year =	1989
, succeeds =	"cr-dduap-87"
, precedes =	"cr-occop-89a"
, update =	"98.07 bibrelex"
}

@techreport{cr-dduap-87
, author =	"J. Culberson and R. Reckhow"
, title =	"Dent Diagrams: {A} Unified Approach to Polygon Covering Problems"
, institution =	"Dept. Comput. Sci., Univ. Alberta"
, address =	"Edmonton, Alberta, Canada"
, month =	jul
, year =	1987
, precedes =	"cr-uaopc-89"
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@article{cr-occop-89a
, author =	"J. Culberson and R. A. Reckhow"
, title =	"Orthogonally convex coverings of orthogonal polygons without holes"
, journal =	"J. Comput. Syst. Sci."
, volume =	39
, year =	1989
, pages =	"166--204"
, succeeds =	"rc-csopm-87"
, update =	"98.07 bibrelex"
}

@inproceedings{cr-cpih-88
, author =	"J. C. Culberson and R. A. Reckhow"
, title =	"Covering polygons is hard"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"601--611"
, keywords =	"complexity theory, covering, polygons, rectangles, NP-completeness, two-dimensional"
, comments =	"Submitted J. Algorithms"
}

@article{cw-nstsm-82
, author =	"K. Culik and D. Wood"
, title =	"A note on some tree similarity measure"
, journal =	"IPL"
, volume =	15
, year =	1982
, pages =	"39--42"
, update =	"98.03 bibrelex"
}

@inproceedings{ckpssssv-ltrmp-93
, author =	"D. E. Culler and R. M. Karp and D. A. Patterson and A. Sahay and K. E. Schauser and E. Santos and R. Subramonian and T. von Eicken"
, title =	"{LogP}: Towards a Realistic Model of Parallel Computation"
, booktitle =	"Proc. 4th ACM SIGPLAN Symp. on Princ. and Practice of Parallel Programming"
, year =	1993
, pages =	"1--12"
, update =	"96.09 orourke"
}

@book{c-gs-66
, author =	"C. Culmann"
, title =	"Graphische Statik"
, publisher =	"Mayer and Zeller"
, address =	"Z{\"u}rich"
, year =	1866
, update =	"97.11 bibrelex"
}

@article{c-oarn-85
, author =	"W. Cunningham"
, title =	"Optimal attack and reinforcement of a network"
, journal =	"J. ACM"
, volume =	32
, year =	1985
, update =	"97.11 bibrelex"
}

@inproceedings{cy-gtbtt-92
, author =	"W. Cunto and V. Yriarte"
, title =	"{GKD}-trees: {Binary} trees that combine multi-dimensional data handling, node size and fringe reorganization"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"192--211"
}

@techreport{cbhh-sspes-87
, author =	"J. E. Cuny and D. A. Bayley and J. W. Hagerman and A. A. Hough"
, title =	"The Simple Simon Programming Environment: {A} Status Report"
, number =	"87-22"
, institution =	"Department of Computer and Information Science, University of Massachusetts"
, month =	may
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{cr-wim-41
, author =	"R. Curant and H. Robbins"
, title =	"What is Mathematics?"
, publisher =	"Oxford University Press"
, year =	1941
, update =	"97.11 bibrelex"
}

@inproceedings{cl-vmbcm-96
, author =	"B. Curless and M. Levoy"
, title =	"A volumetric method for building complex models from range images"
, booktitle =	"Proc. SIGGRAPH 96"
, year =	1996
, pages =	"303--312"
, update =	"00.03 devillers"
}

@article{cbc-ndlia-91
, author =	"D. B. Curtis and R. P. Burton and D. M. Campbell"
, title =	"An $n$-dimensional line intersection algorithm"
, journal =	"J. Imag. Technol."
, volume =	17
, number =	4
, year =	1991
, pages =	"175--177"
, keywords =	"$d$-dimensional, intersection"
, update =	"95.09 korneenko"
}

@article{cbc-pagnd-91
, author =	"D. B. Curtis and R. P. Burton and D. M. Campbell"
, title =	"Parallel axis geometry for $n$-dimensional computer graphics"
, journal =	"J. Imag. Technol."
, volume =	17
, number =	4
, year =	1991
, pages =	"168--175"
, keywords =	"$d$-dimensional, data structuring"
, update =	"95.09 korneenko"
}

@book{c-rgfm-85
, author =	"M. Cutkosky"
, title =	"Robotic grasping and fine manipulation"
, publisher =	"Kluwer Academic Publishers"
, year =	1985
, update =	"98.07 bibrelex"
}

@article{clpp-odpfs-60
, author =	"L. J. Cutrona and E. N. Leight and C. J. Palermo and L. J. Porcello"
, title =	"Optical data processing and filtering systems"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	6
, number =	3
, month =	jun
, year =	1960
, pages =	"386--400"
, update =	"97.11 bibrelex"
}

@inproceedings{ckp-citsg-93
, author =	"D. R. Cutting and D. R. Karger and J. O. Pedersen"
, title =	"Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections"
, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
, year =	1993
, pages =	"126--134"
, update =	"98.07 agarwal"
}

@inproceedings{ckp-sgcba-92
, author =	"D. R. Cutting and D. R. Karger and J. O. Pedersen and J. W. Tukey"
, title =	"Scatter/Gather: {A} Cluster-Based Approach to Browsing Large Document Collections"
, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
, year =	1992
, pages =	"318--329"
, update =	"98.07 agarwal"
}

@article{ckv-fhe-87
, author =	"G. Cybenko and D. W. Krumme and K. N. Venkataraman"
, title =	"Fixed Hypercube Embedding"
, journal =	"Inf. Proc. Lett."
, volume =	25
, year =	1987
, pages =	"35--39"
, update =	"98.07 bibrelex"
}

@incollection{c-ebitu-94
, author =	"Joseph M. Cychosz"
, title =	"Efficient Binary Image Thinning Using Neighborhood Maps"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"465--473"
, keywords =	"image skeleton, image filter"
, update =	"94.09 heckbert"
, annote =	"Provides fast code to thin a bitmap image and find its
``skeleton.'' Image thinning is used for pattern recognition. Contains C
code."
}

@incollection{cw-irc-94
, author =	"Joseph M. Cychosz and Warren N. {Waggenspack Jr.}"
, title =	"Intersecting a Ray with a Cylinder"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"356--365"
, keywords =	"quadric surface, ray tracing"
, update =	"94.09 heckbert"
, annote =	"Geometric method for intersecting a ray with a cylinder.
Contains C code."
}

@inproceedings{cp-dsnlt-90
, author =	"R. Cypher and C. G. Plaxton"
, title =	"Deterministic sorting in nearly logarithmic time on the hypercupe and related computers"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"193--203"
, update =	"98.03 bibrelex"
}

@article{cs-cpasn-92
, author =	"R. Cypher and J. L. C. Sanz"
, title =	"Cubesort: A Parallel Algorithm for Sorting {$N$} Data Items with {$S$}-Sorters"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"211--234"
, update =	"96.09 orourke"
}

@article{cp-dsnlt-93
, author =	"R. E. Cypher and C. G. Plaxton"
, title =	"Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers"
, journal =	"J. Comput. Syst. Sci."
, volume =	47
, year =	1993
, pages =	"501--548"
, update =	"98.03 bibrelex, 96.09 orourke"
}

@inproceedings{c-pamcp-93
, author =	"A. Czumaj"
, title =	"Parallel algorithm for the matrix chain product and the optimal triangulation problems"
, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	665
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"294--305"
, update =	"93.05 smid"
}

% see http://www.cs.auc.dk/icalp98/
@inproceedings{cl-ptase-98
, author =	"Artur Czumaj and Andrzej Lingas"
, title =	"A Polynomial Time Approximation Scheme for {Euclidean} Minimum Cost {$k$}-Connectivity"
, booktitle =	"Proc. 25th Internat. Colloq. Automata Lang. Prog."
, nickname =	"ICALP '98"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"??"
, update =	"98.03 mitchell"
, annote =	"To appear, July 13-17 in Aalborg, Denmark"
}

@techreport{csu-is-90
, author =	"C. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
, title =	"Immobilizing a shape"
, number =	"rr 90/11-18"
, institution =	"dept. d'informatique, univ. du qu{\'e}bec {\`a} hull"
, year =	1990
, precedes =	"csu-isp-91"
, update =	"98.07 bibrelex"
}

@inproceedings{csu-isp-91
, author =	"C. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
, title =	"Immobilizing a shape in the plane"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"41--45"
, succeeds =	"csu-is-90"
, cites =	"bfg-sptf-85, csu-is-90, e-acg-87, k-dwp-90, mnp-ogp-89, mss-esmpg-87, o-cgc9-90, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{c-ldfs-87
, author =	"J. Czyzowicz"
, title =	"Lattice Diagrams with Few Slopes"
, number =	3
, institution =	"Departement D'Informatique, University of Quebec at Hull"
, year =	1987
, keywords =	"graph drawing"
, update =	"98.07 patrignani, 93.09 tamassia"
}

@techreport{c-plsp-87
, author =	"J. Czyzowicz"
, title =	"Planar Lattices and the Slope Problem"
, number =	4
, institution =	"Departement D'Informatique, University of Quebec at Hull"
, year =	1987
, keywords =	"graph drawing"
, update =	"98.07 patrignani, 93.09 tamassia"
}

@inproceedings{ceersstu-akp-91
, author =	"J. Czyzowicz and P. Egyed and H. Everett and D. Rappaport and T. Shermer and D. Souvaine and G. Toussaint and J. Urrutia"
, title =	"The aquarium keeper's problem"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1991
, pages =	"459--464"
, update =	"98.07 bibrelex"
}

@techreport{cer-stpcba-94
, author =	"J. Czyzowicz and H. Everett and J.-M. Robert"
, title =	"Separating Translates in the Plane: Combinatorial Bounds and an Algorithm"
, type =	"Report"
, number =	"DIM-94-2"
, institution =	"Universit\'e du Qu\'ebec \`a Chicoutimi"
, address =	"Chicoutimi"
, year =	1994
, precedes =	"cer-stpcba-97"
, update =	"98.11 devillers, 97.03 pocchiola"
}

@article{cer-stpcba-97
, author =	"J. Czyzowicz and H. Everett and J.-M. Robert"
, title =	"Separating Translates in the Plane: Combinatorial Bounds and an Algorithm"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"551--562"
, succeeds =	"cer-stpcba-94"
, update =	"98.11 devillers"
}

@inproceedings{chuz-peps-92
, author =	"J. Czyzowicz and F. Hurtado and J. Urrutia and N. Zaguia"
, title =	"On polygons enclosing point sets"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"132--136"
, cites =	"e-acg-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{ckku-drcig-97
, author =	"Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Jorge Urrutia"
, title =	"Discrete Realizations of Contact and Intersection Graphs"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"359--370"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{ckku-mlcni-96
, author =	"J. Czyzowicz and E. Kranakis and D. Krizanc and J. Urrutia"
, title =	"Maximal length common non-intersecting paths"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"185--189"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{cku-dttts-97
, author =	"Jurek Czyzowicz and Evangelos Kranakis and Jorge Urrutia"
, title =	"Domino Tilings and Two--by--Two Squares"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"25--32"
, update =	"97.11 jones"
}

@techreport{cpr-dofs-87
, author =	"J. Czyzowicz and A. Pelc and I. Rival"
, title =	"Drawing Orders with Few Slopes"
, number =	"TR-87-12"
, institution =	"Department of Computer Science, University of Ottawa"
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{cpr-poswt-87
, author =	"J. Czyzowicz and A. Pelc and I. Rival"
, title =	"Planar Ordered Sets of Width Two"
, number =	"TR-87-31"
, institution =	"Department of Computer Science, University of Ottawa"
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{cpru-cdfs-87
, author =	"J. Czyzowicz and A. Pelc and I. Rival and J. Urrutia"
, title =	"Crooked Diagrams with Few Slopes"
, number =	"TR-87-26"
, institution =	"Department of Computer Science, University of Ottawa"
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{cru-glmfc-91
, author =	"J. Czyzowicz and I. Rival and J. Urrutia"
, title =	"Galleries and light matchings: {Fat} cooperative guards"
, editor =	"R. A. Melter and A. Rosenfeld and P. Bhattacharya"
, booktitle =	"Vision Geometry"
, series =	"Contemporary Mathematics"
, volume =	119
, publisher =	"American Mathematical Society"
, year =	1991
, pages =	"21--28"
, keywords =	"visibility, watchman problem"
, update =	"99.11 bibrelex, 95.09 korneenko"
}

@inproceedings{cru-glmvg-89
, author =	"J. Czyzowicz and I. Rival and J. Urrutia"
, title =	"Galleries, light matchings and visibility graphs"
, editor =	"F. Dehne and J.-R. Sack and N. Santoro"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"316--324"
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@unpublished{crsuz-grag
, author =	"J. Czyzowicz and E. Rivera-Campo and N. Santoro and J. Urrutia and J. Zaks"
, title =	"Guarding rectangular art galleries"
, note =	"to appear in Disc. Math."
, succeeds =	"crsuz-grag-89"
, update =	"99.07 bibrelex, 98.11 bibrelex"
}

@techreport{crsuz-grag-89
, author =	"J. Czyzowicz and E. Rivera-Campo and N. Santoro and J. Urrutia and J. Zaks"
, title =	"Guarding rectangular art galleries"
, type =	"Technical Report"
, number =	"89-27"
, institution =	"Dept. Comput. Sci., Univ. of Ottawa"
, year =	1989
, note =	"to appear in {\em Discr. Applied Math.}"
, precedes =	"crsuz-grag"
, update =	"99.07 bibrelex, 98.11 bibrelex, 94.05 devillers"
}

@techreport{cru-irtp-89
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
, title =	"Illuminating rectangles and triangles in the plane"
, type =	"report"
, number =	"TR-89-50"
, institution =	"Department of Computer Science, University of Ottawa"
, month =	dec
, year =	1989
, precedes =	"cru-irtp-93"
, update =	"98.07 bibrelex"
}

@article{cru-irtp-93
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
, title =	"Illuminating rectangles and triangles in the plane"
, journal =	"J. Combin. Theory Ser. B"
, volume =	57
, number =	1
, year =	1993
, pages =	"1--17"
, succeeds =	"cru-irtp-89"
, update =	"98.07 bibrelex, 94.05 devillers"
}

@inproceedings{cru-ofipt-93
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
, title =	"Optimal floodlight illumination in polynomial time"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"393--398"
, cites =	"bglosu-fp-93, c-ctpg-75, cru-irtp-93, crsuz-grag, f-icd-77, o-agta-87, ps-cgi-85, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{cruz-gcs-90
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
, title =	"Guarding convex sets"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"265--268"
, note =	"to appear in {\em Graphs and Combinatorics}"
, cites =	"b-slcmd-58, crsuz-grag-89, cru-irtp-93, cruz-ilcp-89, f-icd-77, o-agta-87, n-lbcmm-77, t-flg-47, uz-ics-89, ZZZ"
, update =	"98.07 bibrelex, 94.05 devillers"
}

@techreport{cruz-igsp-90
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
, title =	"Illuminating and guarding segments in the plane"
, type =	"Technical Report"
, number =	"RR 90/09-13"
, institution =	"Dept. d'informatique, Univ. du Qu\'ebec \`a Hull"
, year =	1990
, note =	"to appear in {\em Geometriae Dedicata} [This is wrong!-JOR]"
, update =	"98.03 orourke, 94.05 devillers"
}

@article{cruz-igsp-95
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
, title =	"Illuminating and guarding segments in the plane"
, journal =	"Discrete Math."
, volume =	137
, year =	1995
, pages =	"147--153"
, update =	"98.03 orourke"
}

@techreport{cruz-ilcp-89
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
, title =	"Illuminating lines and circles in the plane"
, type =	"Technical {Report}"
, number =	"89-49"
, institution =	"Univ. Ottawa"
, address =	"Ottawa, Canada"
, month =	dec
, year =	1989
, update =	"98.07 bibrelex"
}

@article{cruz-scsp-92
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
, title =	"Separating convex sets in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"189--195"
, succeeds =	"cruz-scsp-90"
}

@inproceedings{cruz-scsp-90
, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
, title =	"Separating convex sets on the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"50--54"
, precedes =	"cruz-scsp-92"
, cites =	"akp-cddsl-89, ers-ccsno-90, hk-spcs-90, t-sppcs-79, uz-ics-89, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{css-pip-96
, author =	"J. Czyzowicz and I. Stojmenovic and T. Szymacha"
, title =	"On a problem of immobilizing polygons"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"283--288"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{csu-ip-91
, author =	"J. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
, title =	"Immobilizing a polytope"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"214--227"
, keywords =	"polytopes"
}

@mastersthesis{d-hahsp-82
, author =	"N. Dadoun"
, title =	"Hierarchical Approaches to the Hidden Surface Problem"
, school =	"Univ. British Columbia"
, address =	"Vancouver, BC"
, month =	dec
, year =	1982
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{dk-cssaa-89
, author =	"N. Dadoun and D. G. Kirkpatrick"
, title =	"Cooperative subdivision search algorithms with applications"
, booktitle =	"Proc. 27th Allerton Conf. Commun. Control Comput."
, year =	1989
, pages =	"538--547"
, update =	"93.05 devillers"
}

@article{dk-pcsh-89
, author =	"N. Dadoun and D. G. Kirkpatrick"
, title =	"Parallel construction of subdivision hierarchies"
, journal =	"J. Comput. Syst. Sci."
, volume =	39
, year =	1989
, pages =	"153--165"
, succeeds =	"dk-ppess-87"
}

@inproceedings{dk-ppess-87
, author =	"N. Dadoun and D. G. Kirkpatrick"
, title =	"Parallel processing for efficient subdivision search"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"205--214"
, keywords =	"parallel computation, graph theory, searching, point location, subdivisions"
, precedes =	"dk-pcsh-89"
, cites =	"acgoy-pcg-85, acgoy-pcg-88, ag-epsp-86i, cdh-p5cpg-87, cv-dctac-86i, dk-fdpi-82, dk-fdpi-83, dk-ladsc-85, dk-fappi-, eka-nplai-84, kw-fpami-84, k-osps-83, lm-bmcpg-78, l-spami-85, mr-ptcia-85, ph-chfsp-77, sh-cpp-75, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{dkw-hahst-82
, author =	"N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
, title =	"Hierarchical approaches to hidden surface testing"
, booktitle =	"Proc. Graphics Interface '82"
, site =	"Toronto, ON"
, year =	1982
, pages =	"49--56"
, keywords =	"data structuring, detection, visibility, hidden line/surface elimination, computer graphics"
}

@techreport{dkw-hmbt-85
, author =	"N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
, title =	"Hierarchical Methods for Beam Tracing"
, institution =	"??"
, year =	1985
, note =	"In Preparation"
, update =	"97.11 bibrelex"
}

@inproceedings{dkw-gbt-85
, author =	"N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
, title =	"The geometry of beam tracing"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"55--61"
, keywords =	"design of algorithms, computer graphics, intersection, hidden line/surface elimination, hierarchical representations"
, cites =	"a-rtc-84, cd-diec-80, c-hgmvs-76, d-hahsp-82, dkw-hahst-82, dkw-hmbt-85, dk-fdpi-83, fkn-vsgpt-80, fag-nrtsd-83, g-ssfrt-84, hh-btpo-84, k-osps-83, ph-chfsp-77, r-rcms-82, rw-3drfr-80, sh-rpc-74, sss-cthsa-74, w-sdssr-79, wd-ddgsr-81, wd-wawwd-82, w-pcugr-80, wa-hsrup-77, w-iimsd-80, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{d-fetow-01
, author =	"Ovidiu Daescu"
, title =	"From Experiments to Theory: Optimal Weighted Links"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"158--161"
, update =	"01.04 icking"
}

@inproceedings{dlmv-ppglf-88
, author =	"P. Dagum and M. Luby and M. Mihal and U. Vazirani"
, title =	"Polytopes, permanents and graphs with large factors"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"412--421"
, comments =	"To appear in Combinatorica as two papers"
}

@book{dba-nm-74
, author =	"G. Dahlquist and A. Bj{\"o}rk and N. Anderson"
, title =	"Numerical Methods"
, publisher =	"Prentice Hall"
, year =	1974
, update =	"97.11 bibrelex"
}

@incollection{d-spqs-
, author =	"W. Dahmen"
, title =	"Smooth piecewise quadratic surfaces"
, editor =	"T. Lyche and L. Schumaker"
, booktitle =	"Mathematical Methods in CAGD"
, publisher =	"??"
, year =	"??"
, update =	"98.07 bibrelex"
}

@article{dak-rrdos-85
, author =	"W.-M. Dai and Te. Asano and E. S. Kuh"
, title =	"Routing region definition and ordering scheme for building block layout"
, journal =	"IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
, volume =	4
, year =	1985
, pages =	"189--197"
, keywords =	"VLSI design, plane-sweep, design of algorithms, plane graph representation"
, update =	"96.09 devillers"
}

@inproceedings{dks-rrbs-91
, author =	"W. W.-M. Dai and R. Kong and M. Sata"
, title =	"Routability of a rubber-band sketch"
, booktitle =	"Proc. 28th ACM-IEEE Design Automation Conf."
, year =	1991
, pages =	"45--48"
, update =	"98.07 bibrelex"
}

@article{dkc-lmtsh-00
, author =	"Y. Dai and N. Katoh and S.-W. Cheng"
, title =	"{LMT}-skeleton heuristics for several classes of optimal triangulations"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"51--68"
, update =	"01.04 smid"
}

@inproceedings{delw-mmps-89
, author =	"Paul Dale and Peter Eades and Xuemin Lin and Nicolas C. Wormald"
, title =	"Measuring motion planning strategies"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	8
, update =	"98.07 bibrelex"
}

@article{d-gcpcg-89
, author =	"P. Damaschke"
, title =	"The {Hamiltonian} circuit problem for circle graphs is {NP}-complete"
, journal =	"Inform. Process. Lett."
, volume =	32
, number =	1
, year =	1989
, pages =	"1--2"
, keywords =	"geometric graphs, NP-completeness"
, update =	"95.09 korneenko"
}

@inproceedings{df-obpps-92p
, author =	"F. d'Amore and P. G. Franciosa"
, title =	"On the optimal binary plane partition for sets of isothetic rectangles"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"1--5"
, precedes =	"df-obpps-92j"
, cites =	"fkn-vsgpt-80, m-pst-85, py-bpahs-89, py-obspo-90t, ps-cgi-85, vw-rlsil-82, ZZZ"
, update =	"98.07 bibrelex, 94.05 franciosa"
}

@article{df-obpps-92j
, author =	"F. d'Amore and P. G. Franciosa"
, title =	"On the optimal binary plane partition for sets of isothetic rectangles"
, journal =	"Inform. Process. Lett."
, volume =	44
, year =	1992
, pages =	"255--259"
, succeeds =	"df-obpps-92p"
, update =	"94.05 franciosa"
}

@inproceedings{df-ssh-90
, author =	"F. d'Amore and P. G. Franciosa"
, title =	"Separating sets of hyperrectangles"
, booktitle =	"Proc. 15th Internat. Sympos. Math. Found. Comput. Sci."
, nickname =	"MFCS '90"
, series =	"Lecture Notes Comput. Sci."
, volume =	452
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"165--172"
, keywords =	"$d$-dimensional, hyperrectangle, separation"
, precedes =	"df-ssh-93"
, update =	"98.07 bibrelex, 97.11 bibrelex, 94.05 franciosa"
}

@article{df-ssh-93
, author =	"F. d'Amore and P. G. Franciosa"
, title =	"Separating sets of hyperrectangles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, number =	2
, year =	1993
, pages =	"155--165"
, keywords =	"rectangles, separator, binary space partition"
, succeeds =	"df-ssh-90"
, update =	"94.05 franciosa"
, annote =	"Pictures are missing. They appeared on Internat. J. Comput.
			Geom. Appl., volume 3, number 3, 1993, page 345"
}

@inproceedings{afgt-mmbu-97
, author =	"F. d'Amore and P. G. Franciosa and R. Giaccio and M. Talamo"
, title =	"Maintaining Maxima under Boundary Updates"
, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1203
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"100--109"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{afl-rracg-98
, author =	"F. d'Amore and P. G. Franciosa and G. Liotta"
, title =	"A Robust Region Approach to the Computation of Geometric Graphs"
, editor =	"G. Bilardi and G. F. Italiano and A. Pietracaprina and G. Pucci"
, booktitle =	"Algorithms -- ESA~'98"
, series =	"Lecture Notes Comput. Sci."
, volume =	1461
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"175--186"
, succeeds =	"dfl-rcems-98"
, update =	"99.07 vismara"
}

@inproceedings{dfl-rcems-98
, author =	"Fabrizio d'Amore and Paolo G. Franciosa and Guiseppe Liotta"
, title =	"Robust Computation of {Euclidean} Minimum Spanning Trees"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"29--31"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{dghm-mrcgc-98
, author =	"J. C. Dana and C. I. Grima and F. Hurtado and A. M{\'a}rquez"
, title =	"More Results on Computational Geometry on the Cylinder"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"61--63"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{dgm-chnps-97
, author =	"J. C. Dana and C. I. Grima and A. M{\'a}rquez"
, title =	"Convex Hull in Non-Planar Surfaces"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"39--41"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{dk-rtdpm-78
, author =	"J. Danaraj and V. Klee"
, title =	"A representation of two-dimensional pseudo-manifolds and its use in the design of a linear time sheling algorithm"
, journal =	"Ann. Discrete Math."
, volume =	2
, year =	1978
, update =	"98.07 bibrelex"
}

@incollection{d-rddca-90
, author =	"J. Dangermond"
, title =	"A Review of Digital Data Commonly Available and some of the Practical Problems of Entering them into a GIS"
, editor =	"D. J. Peuquet and D. F. Marble"
, booktitle =	"Introductory Readings in Geographic Information Systems"
, publisher =	"Tayler \& Francis"
, address =	"London"
, year =	1990
, pages =	"222--232"
, update =	"96.09 kreveld"
}

@phdthesis{d-canpa-95
, author =	"K. Daniels"
, title =	"Containment algorithms for nonconvex polygons with applications to layout"
, type =	"Ph.{D}. Thesis"
, school =	"Harvard University"
, address =	"Cambridge, MA"
, year =	1995
, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
, keywords =	"doctoral thesis, concave, polygons, packing, nesting, placement, optimization, enclosure, Minkowski sum, configuration space"
, comments =	"is also Harvard DAS TechReport number: 12-95"
, update =	"97.03 daniels"
}

@inproceedings{dm-cbspu-96
, author =	"K. Daniels and V. Milenkovic"
, title =	"Column-based strip packing using ordered and compliant containment"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, year =	1996
, pages =	"33--38"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"layout, nesting, placement, Minkowski sum, configuration space"
, comments =	"to appear in Lecture Notes in Computer Science; submitted to
		  Internat. J. Comput. Geom. Appl."
, update =	"97.03 daniels"
}

@inproceedings{dm-lg-94
, author =	"K. Daniels and V. Milenkovic"
, title =	"Limited Gaps"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"225--230"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"layout, packing, nesting, placement, reachability, Minkowski sum, configuration space, decomposition"
, cites =	"dmr-fmaap-93, f-savd-87, l-tdvdl-80, lm-ccp-93, ZZZ"
, update =	"98.11 bibrelex, 97.03 daniels, 94.09 jones"
}

@inproceedings{dm-mtcae-95
, author =	"Karen Daniels and Victor Milenkovic"
, title =	"Multiple Translational Containment: {Approximate} and Exact Algorithms"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"205--214"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"packing, layout, placement, nesting, Minkowski sum, configuration space"
, update =	"97.03 daniels, 96.09 agarwal, 96.05 mitchell"
}

@techreport{dml-mcm-94
, author =	"K. Daniels and V. Milenkovic and Z. Li"
, title =	"Multiple containment methods"
, type =	"Technical {Report}"
, number =	"12-94"
, institution =	"Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
, address =	"Cambridge, MA"
, year =	1994
, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
, keywords =	"polygons, concave, packing, layout, nesting, placement, mixed integer programming, Minkowski sum, configuration space"
, update =	"97.03 daniels"
}

@article{dmr-flaap-97
, author =	"K. Daniels and V. Milenkovic and D. Roth"
, title =	"Finding the largest area axis-parallel rectangle in a polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"125--148"
, url =	"http://www.cs.bc.edu/~daniels"
, keywords =	"optimization, monotone matrices, polygons, inclusion"
, succeeds =	"dmr-fmaap-93"
, update =	"97.11 bibrelex, 97.03 daniels"
}

@techreport{dmr-flrsc-95
, author =	"K. Daniels and V. Milenkovic and D. Roth"
, title =	"Finding the largest rectangle in several classes of polygons"
, type =	"Technical {Report}"
, number =	"22-95"
, institution =	"Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
, address =	"Cambridge, MA"
, year =	1995
, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
, keywords =	"optimization, monotone matrices, polygons, inclusion"
, comments =	"to appear in Computational Geometry, Theory and
		  Applications"
, update =	"97.03 daniels"
}

@inproceedings{dmr-fmaap-93
, author =	"K. Daniels and V. Milenkovic and D. Roth"
, title =	"Finding the maximum area axis-parallel rectangle in a polygon"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"322--327"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"optimization, monotone matrices, polygons, inclusion"
, precedes =	"dmr-flaap -97"
, cites =	"akmsw-gamsa-87, as-facle-87, aw-cg-88, c-tsplt-90i, cdl-cler-86, kk-altag-90, mos-fmrio-85, mdl-amm-91, mdl-pcnpc-92, ow-rv-88, ps-cgi-85, srw-gsv-cccg-91, nhl-merp-84, wy-ocsp-88, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 daniels+devillers, 93.09 milone+mitchell"
}

@inproceedings{dm-dbstl-96
, author =	"K. Daniels and V. J. Milenkovic"
, title =	"Distance-based subdivision for translational {LP} containment"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"196--201"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"concave, polygons, decomposition"
, update =	"97.03 agarwal+daniels, 96.09 mitchell"
}

@article{dm-mtcp1-97
, author =	"K. Daniels and V. J. Milenkovic"
, title =	"Multiple Translational Containment, Part I: An Approximate Algorithm"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"148--182"
, update =	"98.07 bibrelex, 97.07 held"
}

@article{d-ccs2c-52
, author =	"M. E. Daniels"
, title =	"The covering circle of a sample from $2$ circular normal distribution"
, journal =	"Biometrika"
, volume =	39
, year =	1952
, pages =	"137--143"
}

@article{dt-edsar-90
, author =	"H. H. Dannelongue and P. A. Tanguy"
, title =	"Efficient Data-Structures for Adaptive Remeshing with the {FEM}"
, journal =	"J. Comput. Phys."
, volume =	91
, number =	1
, year =	1990
, pages =	"94--109"
, annote =	"Advancing front method. To build a new triangle on an
		 edge, find closest point to the third vertex of an
		 equilateral triangle. $x$ and $y$ binary trees are used
		 to speed the search."
}

@inproceedings{dh-favrt-92
, author =	"John Danskin and Pat Hanrahan"
, title =	"Fast Algorithms for Volume Ray Tracing"
, booktitle =	"1992 Workshop on Volume Visualization"
, year =	1992
, pages =	"91--98"
, update =	"98.03 agarwal"
}

@book{d-lpe-63
, author =	"G. B. Dantzig"
, title =	"Linear Programming and Extensions"
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1963
}

@article{dow-gsmml-55
, author =	"G. B. Dantzig and A. Orden and P. Wolfe"
, title =	"The generalized simplex method for minimizing a linear form under linear inequality restrictions"
, journal =	"Pacific J. Math."
, volume =	5
, year =	1955
, pages =	"183--195"
, update =	"98.03 bibrelex"
}

@article{dg-ipbr-82
, author =	"L. Danzer and B. Gr{\"u}nbaum"
, title =	"Intersection properties of boxes in {$R^{n}$}"
, journal =	"Combinatorica"
, volume =	2
, number =	3
, year =	1982
, pages =	"237--246"
, update =	"97.11 bibrelex"
}

@incollection{dgk-htir-63
, author =	"Ludwig Danzer and Branko Gr{\"u}nbaum and Victor Klee"
, title =	"Helly's Theorem and its Relatives"
, booktitle =	"Convexity"
, series =	"Proc. Symp. Pure Math."
, volume =	7
, publisher =	"American Mathematical Society"
, address =	"Providence"
, year =	1963
, pages =	"101--180"
, update =	"98.03 bibrelex, 95.09 wenger"
}

@article{dll-udleu-57
, author =	"L. Danzer and D. Laugwitz and H. Lenz"
, title =	"{\"U}ber das {L{\"o}wnersche} {Ellipsoid} und sein {Analogon} unter den einem {Eik{\"o}rper} eingeschriebenen {Ellipsoiden}"
, journal =	"Arch. Math."
, volume =	8
, year =	1957
, pages =	"214--219"
, update =	"97.11 bibrelex"
}

% Bernierd June 1986
@inproceedings{dhrt-cisgm-87
, author =	"M. Dao and M. Habib and J. Richard and D. Tallot"
, title =	"{CABRI} an Interactive System for Graph Manipulation"
, editor =	"G. Tinhofer and G. Schmidt"
, booktitle =	"Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	246
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"58--67"
, keywords =	"graph drawing"
, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
}

@article{dkn-pacps-87
, author =	"F. Darema and S. Kirkpatrick and V. A. Norton"
, title =	"Parallel algorithms for chip placement by simulated annealing"
, journal =	"IBM J. Res. Develop."
, volume =	31
, year =	1987
, pages =	"391--402"
}

@phdthesis{d-ascg-90
, author =	"G. Das"
, title =	"Approximation schemes in computational geometry"
, type =	"Ph.{D}. Thesis"
, school =	"University of Wisconsin"
, year =	1990
, keywords =	"doctoral thesis"
}

@inproceedings{d-vgcbd-97
, author =	"Gautam Das"
, title =	"The Visibility Graph Contains a Bounded-Degree Spanner"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"70--75"
, update =	"97.11 jones"
}

@inproceedings{dg-caitd-95
, author =	"Gautam Das and Michael T. Goodrich"
, title =	"On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"74--85"
, keywords =	"graph drawing, 3D, convex, polyhedron"
, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell+tamassia"
}

@techreport{dg-ocop3-97t
, author =	"G. Das and M. T. Goodrich"
, title =	"On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees"
, type =	"Research {Report}"
, institution =	"Center for Geometric Computing"
, address =	"Johns Hopkins Univ."
, year =	1997
, update =	"98.03 smid, 97.03 tamassia"
}

@article{dg-ocop3-97a
, author =	"G. Das and M. T. Goodrich"
, title =	"On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"123--137"
, update =	"98.03 smid"
}

@techreport{dgr-tdcgd-94
, author =	"G. Das and M. T. Goodrich and K. Ramayier"
, title =	"Three-Dimensional Convex Graph Drawing"
, type =	"Technical {Report}"
, institution =	"Dept. of Computer Sci., Johns Hopkins Univ."
, year =	1994
, keywords =	"graph drawing, 3D, convex, straight-line"
, update =	"96.09 tamassia"
}

@techreport{dgm-fsts-96
, author =	"G. Das and D. Gunopulos and H. Mannila"
, title =	"Finding similar time series"
, institution =	"??"
, year =	1996
, note =	"Manuscript"
, update =	"98.07 bibrelex"
}

@techreport{dhn-fwvcp-93
, author =	"G. Das and P. Heffernan and G. Narasimhan"
, title =	"Finding all weakly-visible chords of a polygon in linear time"
, type =	"Manuscript"
, institution =	"Memphis State University"
, year =	1993
, precedes =	"dhn-fwvcp-94"
, update =	"99.07 bibrelex, 98.03 bibrelex"
}

@inproceedings{dhn-lvp-93
, author =	"G. Das and P. Heffernan and G. Narasimhan"
, title =	"{LR}-Visibility in Polygons"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"303--308"
, precedes =	"dhn-lvp-97"
, cites =	"at-oadvp-81, c-tsplt-91a, cg-vippg-89, dhn-fwvcp-93, ghlst-ltavs-87, h-oatgp-93, ik-tgp-91, k-dwvsp-88, ss-oadwv-90, tl-tgwsp-93, ZZZ"
, update =	"98.11 bibrelex, 98.07 icking, 97.03 devillers, 93.09 milone+mitchell"
}

@article{dhn-lvp-97
, author =	"G. Das and P. Heffernan and G. Narasimhan"
, title =	"{LR}-Visibility in Polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"37--57"
, succeeds =	"dhn-lvp-93"
, update =	"98.07 icking, 97.03 devillers"
}

@inproceedings{dhn-oss3d-93
, author =	"G. Das and P. Heffernan and G. Narasimhan"
, title =	"Optimally sparse spanners in $3$-dimensional {Euclidean} space"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"53--62"
, cites =	"addjs-sswg-93, cdns-nsrgs-92, dj-wtacg-89, ll-tapga-89, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@inproceedings{dh-cd3so-93
, author =	"Gautam Das and Paul J. Heffernan"
, title =	"Constructing Degree-$3$ Spanners with other Sparseness Properties"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"11--20"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@article{dh-cd3so-96
, author =	"G. Das and P. J. Heffernan"
, title =	"Constructing degree-$3$ spanners with other sparseness properties"
, journal =	"Internat. J. Found. Comput. Sci."
, volume =	7
, year =	1996
, pages =	"121--135"
, update =	"98.11 smid"
}

@article{dhn-fwvcp-94
, author =	"G. Das and P. J. Heffernan and G. Narasimhan"
, title =	"Finding All Weakly-Visible Chords of a Polygon in Linear Time"
, journal =	"Nordic J. Comput."
, volume =	1
, year =	1994
, pages =	"433--457"
, succeeds =	"dhn-fwvcp-93"
, update =	"99.07 bibrelex, 98.11 smid, 95.05 smid"
}

@inproceedings{dj-mvhpd-90
, author =	"G. Das and D. Joseph"
, title =	"Minimum vertex hulls for polyhedral domains"
, booktitle =	"Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	415
, publisher =	"Springer-Verlag"
, year =	1990
, precedes =	"dj-mvhpd-92"
, update =	"95.01 mitchell"
}

@article{dj-mvhpd-92
, author =	"G. Das and D. Joseph"
, title =	"Minimum vertex hulls for polyhedral domains"
, journal =	"Theoret. Comput. Sci."
, volume =	103
, year =	1992
, pages =	"107--135"
, succeeds =	"dj-mvhpd-90"
, update =	"95.01 mitchell, 95.01 mitchell"
}

@inproceedings{dj-cmcnp-90
, author =	"G. Das and D. Joseph"
, title =	"The complexity of minimum convex nested polyhedra"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"296--301"
, cites =	"abosy-fmcnp-85, cy-psppo-84, dj-mvhpd-90, kl-fstcg-85, l-pftu-82, o-cgc4-88, o-cgc5-88, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{dj-wtacg-89
, author =	"G. Das and D. Joseph"
, title =	"Which Triangulations Approximate the Complete Graph?"
, booktitle =	"Proc. International Symposium on Optimal Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	401
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"168--192"
, update =	"00.03 smid, 96.05 smid"
, abstract =	"It has been shown in the literature that the Delaunay
		 triangulation and its variants are sparse
		 approximations of the complete graph, in that the
		 shortest distance between two sites within the
		 triangulation is bounded by a constant multiple of
		 their Euclidean separation. The present paper shows
		 that other classical triangulation algorithms, such as
		 the greedy triangulation, and more notably, the minimum
		 weight triangulation, also approximate the complete
		 graph in this sense. It also designs an algorithm for
		 constructing extremely sparse (nontriangular) planar
		 graphs that approximate the complete graph. It defines
		 a sufficiency condition and shows that any Euclidean
		 planar graph constructing algorithm which satisfies
		 this condition always produces good approximations of
		 the complete graph."
}

@techreport{dks-ocaet-96t
, author =	"G. Das and S. Kapoor and M. Smid"
, title =	"On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
, type =	"Report"
, number =	"TR 96-02"
, institution =	"Department of Computer Science, King's College"
, address =	"London, UK"
, year =	1996
, update =	"97.03 smid, 96.05 smid"
}

@incollection{dks-ocaet-96i
, author =	"G. Das and S. Kapoor and M. Smid"
, title =	"On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1180
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"64--75"
, update =	"97.03 smid"
}

@article{dks-ocaet-97
, author =	"G. Das and S. Kapoor and M. Smid"
, title =	"On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
, journal =	"Algorithmica"
, volume =	19
, year =	1997
, pages =	"447--460"
, update =	"97.11 smid"
}

@inproceedings{dn-facse-94
, author =	"G. Das and G. Narasimhan"
, title =	"A Fast Algorithm for Constructing Sparse {Euclidean} Spanners"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"132--139"
, cites =	"addjs-sswg-93, ap-sp-90, c-facts-93, cdns-nsrgs-95, dhn-oss3d-93, dh-cd3so-93, ll-tapga-89, s-cmsga-91, s-gs-92, v-sgagc-91, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@article{dn-facse-97
, author =	"G. Das and G. Narasimhan"
, title =	"A Fast Algorithm for Constructing Sparse {Euclidean} Spanners"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"297--315"
, update =	"98.07 smid"
}

@inproceedings{dn-gsld-91
, author =	"G. Das and G. Narasimhan"
, title =	"Geometric searching and link distances"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"261--272"
, keywords =	"distance"
}

@inproceedings{dn-oltas-94
, author =	"G. Das and G. Narasimhan"
, title =	"Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"259--266"
, keywords =	"visibility"
, cites =	"at-oadvp-81, bmt-ltacs-91, c-tsplt-91a, ghlst-ltavs-87, c-ocswv-92, cn-wrsp-91, dhn-lvp-93, dhn-fwvcp-93, dc-advsp-93, h-oatgp-93, ik-tgp-92, k-dwvsp-88, lp-oafkp-79, n-wrlv-92, o-cgc18-93, kv-swtwv-93, ss-oadwv-90, st-pplup-86, tl-tgwsp-93, ZZZ"
, update =	"98.03 bibrelex, 94.09 orourke, 94.01 jones"
}

@inproceedings{dn-schds-95
, author =	"Gautam Das and Giri Narasimhan"
, title =	"Short Cuts in Higher Dimensional Space"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"103--108"
, update =	"95.09 jones"
}

@inproceedings{dns-nwwme-95
, author =	"Gautam Das and Giri Narasimhan and Jeffrey Salowe"
, title =	"A New Way to Weigh Malnourished {Euclidean} Graphs"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"215--222"
, keywords =	"Steiner trees, t-spanners"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@article{ds-lbagm-00
, author =	"G. Das and M. Smid"
, title =	"A lower bound for approximating the geometric minimum weight matching"
, journal =	"Inform. Process. Lett."
, volume =	74
, year =	2000
, pages =	"253--255"
, update =	"01.04 smid"
}

@inproceedings{d-cmpt-89
, author =	"P. P. Das"
, title =	"Characterization of metricity preserving transformations"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	31
}

@article{dcc-dfdg-87
, author =	"P. P. Das and P. P. Chakrabarti and B. N. Chatterji"
, title =	"Distance functions in digital geometry"
, journal =	"Inform. Sci."
, volume =	42
, number =	2
, year =	1987
, pages =	"113--136"
, keywords =	"distance, digital geometry"
, update =	"95.09 korneenko"
}

@article{dcc-gddg-87
, author =	"P. P. Das and P. P. Chakrabarti and B. N. Chatterji"
, title =	"Generalized distances in digital geometry"
, journal =	"Inform. Sci."
, volume =	42
, year =	1987
, pages =	"51--67"
}

@article{dc-hdg-90
, author =	"P. P. Das and B. N. Chatterji"
, title =	"Hyperplanes in digital geometry"
, journal =	"Inform. Sci."
, volume =	50
, number =	1
, year =	1990
, pages =	"73--91"
, keywords =	"digital geometry, hyperplanes, $d$-dimensional"
, update =	"95.09 korneenko"
}

@article{dvpm-sahsr-90
, author =	"S. R. Das and P. Vaidya and L. Patniak and P. C. Mathias"
, title =	"A systolic algorithm for hidden surface removal"
, journal =	"Parallel Comput."
, volume =	15
, number =	"1--3"
, year =	1990
, pages =	"277--290"
, keywords =	"parallel computation, hidden line/surface elimination"
, update =	"95.09 korneenko"
}

@article{dv-aamvn-89
, author =	"B. Dasgupta and C. E. {Veni Madhavan}"
, title =	"An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem"
, journal =	"Inform. Process. Lett."
, volume =	33
, year =	1989
, pages =	"35--44"
, keywords =	"computational geometry, graphs, shortest paths"
, update =	"94.09 lambert, 93.09 milone+mitchell"
}

@incollection{dcd-noaec-95
, author =	"P. Dasgupta and P. P. Chakrabarti and S. C. DeSarkar"
, title =	"A near optimal algorithm for the extended cow-path problem in the presence of relative errors"
, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1026
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"22--36"
, update =	"96.01 smid"
}

@incollection{dcd-ncaas-96
, author =	"P. Dasgupta and P. P. Chakrabarti and S. C. DeSarkar"
, title =	"A new competitive algorithm for agent searching in unknown streets"
, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1180
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"147--155"
, update =	"97.03 smid"
}

@techreport{dg-epjll-99
, author =	"S. Dasgupta and A. Gupta"
, title =	"An elementary proof of the {Johnson-Lindenstrauss} lemma"
, number =	"TR-99-06"
, institution =	"Intl. Comput. Sci. Inst."
, address =	"Berkeley, CA"
, year =	1999
, update =	"00.11 smid, 00.07 agarwal"
}

@book{d-ndl-95
, title =	"Network and Discrete Location"
, editor =	"Mark S. Daskin"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1995
, isbn =	"0-471-01897-X"
, update =	"99.11 bibrelex, 95.09 mitchell"
}

@techreport{dgb-smgtd-85
, author =	"N. N. Datar and U. G. Gujar and V. C. Bhavsar"
, title =	"Some methods for generating three-dimensional objects"
, type =	"Report"
, number =	"??"
, institution =	"School Comput. Sci., Univ. New Brunswick"
, address =	"Fredericton, NB"
, year =	1985
}

@article{d-ealrp-92
, author =	"A. Datta"
, title =	"Efficient algorithms for the largest rectangle problem"
, journal =	"Inform. Sci."
, volume =	64
, year =	1992
, pages =	"121--141"
, update =	"93.09 datta"
}

@inproceedings{d-epagk-94
, author =	"A. Datta"
, title =	"Efficient parallel algorithms for geometric $k$-clustering problems"
, booktitle =	"Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	""
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	""
, update =	"95.01 smid, 94.01 datta"
}

@inproceedings{dhs-cspbg-95
, author =	"Amitava Datta and Christoph A. Hipke and Sven Schuierer"
, title =	"Competitive Searching in Polygons: {Beyond} Generalised Streets"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"32--41"
, update =	"98.11 bibrelex, 98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@inproceedings{di-csgs-94
, author =	"Amitava Datta and Christian Icking"
, title =	"Competitive Searching in a Generalized Street"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"175--182"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
, precedes =	"di-csgs-95"
, cites =	"bcr-sp-93, brs-nugt-91, dhn-lvp-93, dkp-hlue1-93, ik-tgp-92, k-wusbd-92, k-olssp-94, ls-ppspm-87, py-spwm-91, st-aelup-85, ZZZ"
, update =	"00.03 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@techreport{di-csgs-95
, author =	"Amitava Datta and Christian Icking"
, title =	"Competitive Searching in a Generalized Street"
, number =	191
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1995
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
, succeeds =	"di-csgs-94"
, precedes =	"di-csgs-99"
, update =	"99.07 bibrelex, 98.11 bibrelex"
}

@article{di-csgs-99
, author =	"Amitava Datta and Christian Icking"
, title =	"Competitive Searching in a Generalized Street"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"109--120"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
, succeeds =	"di-csgs-95"
, cites =	"aks-eueo-99, bcr-sp-93, brs-nugt-97, dhn-lvp-97, dhs-cspbg-95, ds-mpupe-99, dkp-hlue1-98, drw-lrmt-98, gs-oolaw-97, gmr-rlp-97, hikk-cslp-97, hikk-pepns-98, ik-tgp-92, ik-csas-95, ik-skpcs-95, ikl-ocsws-99, ilss-ghtus-98, krt-sueor-96, knw-rlti-97, k-wusbd-92, k-olssp-94, lc-tasso-98, lsksc-ncssu-97, l-oltsb-96, ls-ghtus-95, ls-gsr-96, ls-wsf-96, ls-pinos-97, ls-lbsgs-98, ls-ppspm-87, py-spwm-91, s-ersls-97, ss-ossus-99, st-aelup-85, thl-tgwsp-98, ZZZ"
, update =	"00.03 bibrelex, 99.11 bibrelex, 99.07 bibrelex"
}

@inproceedings{dk-eamer-91
, author =	"A. Datta and K. Krithivasan"
, title =	"An efficient algorithm for the maximum empty rectangle problem in three dimensions"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"78--83"
, cites =	"as-facle-87, cdl-cler-86, d-ealrp-92, gno-faded-89, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{dk-eamer-90
, author =	"A. Datta and K. Krithivasan"
, title =	"Efficient algorithms for the maximum empty rectangle problem in shared memory and other architectures"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, volume =	3
, year =	1990
, pages =	"344--345"
, update =	"93.09 datta"
}

@inproceedings{dk-ppli-88
, author =	"A. Datta and K. Krithivasan"
, title =	"Path Planning with Local Information"
, booktitle =	"Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"New Delhi, India"
, series =	"Lecture Notes Comput. Sci."
, volume =	338
, publisher =	"Springer-Verlag"
, month =	dec
, year =	1988
, pages =	"108--121"
, update =	"99.11 bibrelex, 95.01 smid, 93.09 datta"
}

@inproceedings{dko-oaoss-97
, author =	"A. Datta and K. Krithivasan and T. Ottmann"
, title =	"An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons"
, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1203
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	""
, update =	"00.03 devillers, 98.03 mitchell"
}

@techreport{dlss-sdakp-93t
, author =	"A. Datta and H. P. Lenhof and C. Schwarz and M. Smid"
, title =	"Static and dynamic algorithms for $k$-point clustering problems"
, type =	"Report"
, number =	"MPI-I-93-108"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, update =	"93.05 smid"
}

@inproceedings{dlss-sdakp-93i
, author =	"A. Datta and H.-P. Lenhof and C. Schwarz and M. Smid"
, title =	"Static and Dynamic Algorithms for $k$-Point Clustering Problems"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"265--276"
, update =	"95.01 smid, 93.09 milone+mitchell+smid, 93.05 jones"
}

@article{dlss-sdakp-95
, author =	"A. Datta and H.-P. Lenhof and C. Schwarz and M. Smid"
, title =	"Static and dynamic algorithms for $k$-point clustering problems"
, journal =	"J. Algorithms"
, volume =	19
, year =	1995
, pages =	"474--503"
, update =	"96.01 smid"
}

@inproceedings{dms-ocpad-93
, author =	"A. Datta and A. Maheshwari and J.-R. Sack"
, title =	"Optimal {CREW}-{PRAM} algorithms for direct dominance problems"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, nickname =	"ESA '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"109--120"
, update =	"95.01 smid, 94.01 smid, 93.09 datta+milone+mitchell"
}

@article{dms-opadd-96
, author =	"A. Datta and A. Maheshwari and J.-R. Sack"
, title =	"Optimal Parallel Algorithms for Direct Dominance Problems"
, journal =	"Nordic J. Comput."
, volume =	3
, year =	1996
, pages =	"72--88"
, update =	"97.11 sack"
}

@inproceedings{dr-sleop-90
, author =	"A. Datta and G. D. S. Ramkumar"
, title =	"On some largest empty orthoconvex polygons in a point set"
, booktitle =	"Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"Bangalore, India"
, series =	"Lecture Notes Comput. Sci."
, volume =	472
, publisher =	"Springer-Verlag"
, month =	dec
, year =	1990
, pages =	"270--285"
, update =	"98.07 smid, 93.09 datta"
}

@inproceedings{ds-mpupe-99
, author =	"Amitava Datta and Subbiah Soundaralakshmi"
, title =	"Motion Planning in an Unknown Polygonal Environment with Bounded Performance Guarantee"
, booktitle =	"Proc. 1999 IEEE Internat. Conf. Robot. Autom."
, nickname =	"ICRA '99"
, site =	"Detroit"
, year =	1999
, update =	"99.07 bibrelex"
}

@article{dsk-fspaf-90
, author =	"A. Datta and R. Srikant and K. Krithivasan"
, title =	"Fast sequential and parallel algorithms for finding the largest rectangle separating two sets"
, journal =	"Internat. J. Comput. Math."
, volume =	37
, year =	1990
, pages =	"49--61"
, update =	"93.09 datta"
}

@inproceedings{d-sgvdc-94
, author =	"A. Dattasharma"
, title =	"On the Size of a Generalized {Voronoi} Diagram for Convex Polyhedra in $d$ dimensions"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"357--362"
, cites =	"dk-tmpcp-93, dk-avr3t-, d-sccgv-, ls-pptmc-87, ksd-ttute-92, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{d-sqpgv-94
, author =	"A. Dattasharma"
, title =	"Some Qualitative Properties of a Generalized {Voronoi} Diagram for Convex Polyhedra in $d$ dimensions"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"134--139"
, cites =	"ps-cgi-85, dk-tmpcp-93, dk-avr3t-, d-sccgv-, ls-pptmc-87, ksd-ttute-92, c-vmpmp-85, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@phdthesis{d-sccgv-
, author =	"A. Dattasharma"
, title =	"Structure and Computation of a Class of Generalized {Voronoi} Diagrams with application to Translational Motion Planning"
, school =	"Dept. of Computer Science and Automation, Indian Institute of Science"
, address =	"Bangalore, India"
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{dk-tmpcp-93
, author =	"A. Dattasharma and S. Keerthi"
, title =	"Translational motion planning for a convex polyhedron in a 3D polyhedral world using an efficient and new roadmap"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"449--454"
, cites =	"osy-gvdl-87, b-sfppg-83, ls-pptmc-87, cd-svd-88, s-aavd3-91, ksd-ttute-92, ls-pptmc-87, cd-svd-88, s-aavd3-91, c-vmpmp-85, dk-rvrtm-93, bms-plpco-93, m-lpltw-84, c-crmp-87, r-ca-70, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@unpublished{dk-avr3t-
, author =	"A. Dattasharma and S. S. Keerthi"
, title =	"An Augmented {Voronoi} Roadmap for {3D} Translational Motion Planning for a Convex Polyhedron Moving Amidst Convex Polyhedral Obstacles"
, journal =	"Theoret. Comput. Sci."
, note =	"to appear"
, update =	"98.11 bibrelex"
}

@techreport{dk-rvrtm-93
, author =	"A. Dattasharma and S. S. Keerthi"
, title =	"Rectilinear {Voronoi} like Roadmap for Translational Motion of a Convex Polyhedron Amidst Convex Polyhedra in a 3D {Euclidean} World"
, type =	"Technical Report"
, number =	"02-93"
, institution =	"Indian Institute of Science"
, month =	jun
, year =	1993
, update =	"98.11 bibrelex"
}

@article{d-cpcde-71
, author =	"H. Davenport"
, title =	"A combinatorial problem connected with differential equations {II}"
, journal =	"Acta Arithmetica"
, volume =	17
, year =	1971
, pages =	"363--372"
, update =	"95.05 agarwal"
}

@book{d-haitn-83
, author =	"H. Davenport"
, title =	"The Higher Arithmetic: An Introduction to the Theory of Numbers"
, publisher =	"Dover Publications"
, address =	"New York"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{ds-cpcde-65
, author =	"H. Davenport and A. Schinzel"
, title =	"A combinatorial problem connected with differential equations"
, journal =	"Amer. J. Math."
, volume =	87
, year =	1965
, pages =	"684--689"
, keywords =	"Davenport-Schinzel sequences"
}

@inproceedings{d-cag-79
, author =	"J. Davenport"
, title =	"The Computerization of Algebraic Geometry"
, booktitle =	"Proc. Internat. Sympos. Symbolic Algebraic Comput."
, volume =	72
, publisher =	"Springer-Verlag"
, year =	1979
, pages =	"119--133"
, update =	"97.11 bibrelex"
}

@article{d-pmp-86
, author =	"J. H. Davenport"
, title =	"A ``piano movers'' problem"
, journal =	"SIGSAM Bull."
, volume =	20
, number =	"1--2"
, year =	1986
, pages =	"15--17"
, keywords =	"motion planning"
, update =	"95.09 korneenko"
}

@book{dst-casaa-88
, author =	"J. H. Davenport and Y. Siret and E. Tournier"
, title =	"Computer Algebra: systems and algorithms for algebraic computation"
, publisher =	"Acacdemic Press"
, year =	1988
, update =	"98.11 bibrelex"
}

@book{d-os-70
, author =	"H. A. David"
, title =	"Order Statistics"
, publisher =	"John Wiley \& Sons"
, year =	1970
, update =	"99.11 bibrelex, 98.07 bibrelex"
}

@article{dh-dgnus-96
, author =	"Ron Davidson and David Harel"
, title =	"Drawing Graphics Nicely Using Simulated Annealing"
, journal =	"ACM Trans. Graph."
, volume =	15
, number =	4
, year =	1996
, pages =	"301--331"
, keywords =	"graph drawing, straight-line, force-directed"
, update =	"97.03 tamassia"
}

@techreport{dh-dgnus-89
, author =	"R. Davidson and D. Harel"
, title =	"Drawing Graphs Nicely Using Simulated Annealing"
, institution =	"Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot"
, year =	1989
, keywords =	"graph drawing"
, update =	"95.05 smid+tamassia, 93.09 tamassia"
}

@techreport{d-sfsos-84
, author =	"E. Davis"
, title =	"Shape and function of solid objects: some examples"
, type =	"Report"
, number =	"TR137"
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, year =	1984
}

@inproceedings{d-csppd-85
, author =	"G. Davis"
, title =	"Computing separating planes for a pair of disjoint polytopes"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"8--14"
, cites =	"a-rmli-54, bgm-sma-65, b-mpg-69, c-lp-83, dh-pcsa-73, d-cvem-83, g-cpcli-51, g-spaph-82, g-rmssl-80, ns-picg-79, ph-chfsp-77, w-etcp-50, ZZZ"
, update =	"97.11 bibrelex, 93.05 jones"
}

@book{dm-dasd-75
, author =	"J. C. Davis and M. J. McCullagh"
, title =	"Display and analysis of spatial data"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1975
, update =	"99.11 bibrelex"
}

@article{db-cmsii-79
, author =	"L. Davis and M. Benedikt"
, title =	"Computational models of space: isovists and isovist fields"
, journal =	"Comput. Graph. Image Process."
, volume =	11
, year =	1979
, pages =	"49--72"
}

@book{d-ia-63
, author =	"P. J. Davis"
, title =	"Interpolation and Approximation"
, publisher =	"Blaisdell Publishing Co."
, address =	"New York"
, year =	1963
, update =	"96.09 orourke"
}

@book{dr-mni-75
, author =	"P. J. Davis and P. Rabinivitz"
, title =	"Methods of numerical integration"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1975
, update =	"98.03 bibrelex"
}

@inproceedings{dd-nipdt-89
, author =	"J. R. Davy and P. M. Dew"
, title =	"A Note on Improving the Performance of {Delaunay} Triangulation"
, booktitle =	"New Advances in Computer Graphics: Proceedings of Computer Graphics International '89"
, publisher =	"Springer-Verlag"
, address =	"Tokyo"
, year =	1989
, pages =	"209--226"
, annote =	"Experiments on coarse grain parallel implementations
		 of Guibas Stolfi divide and conquer algorithm."
}

@article{d-rbwdo-84
, author =	"R. J. Dawson"
, title =	"On removing a ball without disturbing the others"
, journal =	"Math. Mag."
, volume =	57
, year =	1984
, pages =	"27--30"
}

@article{d-pchat-88
, author =	"A. M. Day"
, title =	"Planar convex hull algorithms in theory and practice"
, journal =	"Comput. Graph. Forum"
, volume =	7
, number =	3
, year =	1988
, pages =	"177--193"
, keywords =	"convex hull"
, update =	"95.09 korneenko"
}

@article{d-i2dch-90
, author =	"A. M. Day"
, title =	"The Implementation of a 2{D} Convex Hull Algorithm Using Pertubation"
, journal =	"Comput. Graph. Forum"
, volume =	9
, number =	4
, month =	dec
, year =	1990
, pages =	"309--316"
, update =	"93.09 held"
}

@article{d-iafch-90
, author =	"A. M. Day"
, title =	"The implementation of an algorithm to find the convex hull of a set of $3$-d points"
, journal =	"ACM Trans. Graph."
, volume =	9
, number =	1
, year =	1990
, pages =	"105--132"
, keywords =	"implementing algorithms, three-dimensional, convex hull, points"
, cites =	"ph-chfsp-77"
, update =	"93.09 held"
}

@techreport{de-eaahc-83
, author =	"W. H. E. Day and H. Edelsbrunner"
, title =	"Efficient algorithms for agglomerative hierarchical clustering methods"
, type =	"Report"
, number =	"F122"
, institution =	"Inst. Informationsverarb., Univ. Graz"
, address =	"Graz, Austria"
, year =	1983
, update =	"98.07 smid, 97.11 bibrelex"
}

@article{de-eaahc-84
, author =	"W. H. E. Day and H. Edelsbrunner"
, title =	"Efficient algorithms for agglomerative hierarchical clustering methods"
, journal =	"J. Classif."
, volume =	1
, year =	1984
, pages =	"7--24"
, keywords =	"design of algorithms, cluster analysis, discrete geometry, construction, packing, worst-case analysis"
}

@article{de-ipllc-85
, author =	"W. H. E. Day and H. Edelsbrunner"
, title =	"Investigation of proportional link linkage clustering methods"
, journal =	"J. Classif."
, volume =	2
, year =	1985
, pages =	"239--254"
, keywords =	"design of algorithms, cluster analysis, worst-case analysis"
}

@article{d-otmgc-91
, author =	"E. F. {D'Azevedo}"
, title =	"Optimal triangular mesh generation by coordinate transformation"
, journal =	"SIAM J. Sci. Statist. Comput."
, volume =	12
, number =	4
, year =	1991
, pages =	"755--786"
, keywords =	"triangulation"
, update =	"95.09 korneenko"
}

@article{ds-oiti-89
, author =	"E. F. {D'Azevedo} and R. B. Simpson"
, title =	"On optimal interpolation triangle incidences"
, journal =	"SIAM J. Sci. Statist. Comput."
, volume =	10
, number =	6
, year =	1989
, pages =	"1063--1075"
, keywords =	"Delaunay triangulation"
, update =	"95.09 korneenko"
, annote =	"What triangulation minimizes error if we are
		 interpolating a convex quadratic function? First we
		 scale so that contours of the function are turned from
		 ellipses into circles. Error is proportional to area of
		 minimum containing circle. Another proof that DT
		 minimizes circumradii."
}

@inproceedings{d-gbaof-87
, author =	"L. {De Floriani}"
, title =	"A graph based approach to object feature recognition"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"100--109"
, cites =	"adf-efgrs-84, adf-gmsou-85, bj-tdor-85, h-efitd-84, ht-dgtc-73, k-sccad-80, r-rrstm-80, s-adfbr-81, t-dfslg-72, w-ebdss-85, w-tsgm-86, w-fevd-82, ZZZ"
, update =	"98.03 bibrelex"
}

@article{d-pdstb-89
, author =	"L. {De Floriani}"
, title =	"A Pyramidal Data Structure for Triangle-Based Surface Description"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	9
, number =	2
, month =	mar
, year =	1989
, pages =	"67--78"
, update =	"97.03 agarwal, 95.09 korneenko, 93.09 held"
}

@article{d-dseti-87
, author =	"Leila {De Floriani}"
, title =	"Data Structures for Encoding Triangulated Irregular Networks"
, journal =	"Adv. Eng. Softw."
, volume =	9
, number =	3
, year =	1987
, pages =	"122--128"
, annote =	"Describes some choices for data structures for
		 representing a triangulation, and methods for
		 point-location, edge-neighbour and vertex-neighbour
		 problems."
}

@article{d-srbtg-87
, author =	"Leila {De Floriani}"
, title =	"Surface representations based on triangular grids"
, journal =	"Visual Comput."
, volume =	3
, number =	1
, month =	feb
, year =	1987
, pages =	"27--50"
, keywords =	"triangulation, trees, data structures"
}

@article{df-hbmso-88
, author =	"L. {De Floriani} and B. Falcidieno"
, title =	"A hierarchical boundary model for solid object representation"
, journal =	"ACM Trans. Graph."
, volume =	7
, year =	1988
, pages =	"42--60"
}

@article{dfnp-hssa-84
, author =	"Leila {De Floriani} and Bianca Falcidieno and George Nagy and Caterina Pienovi"
, title =	"Hierarchical Structure For Surface Approximation"
, journal =	"Comput. Graph. (UK)"
, volume =	8
, number =	2
, year =	1984
, pages =	"183--193"
, keywords =	"surface approximation, hierarchical triangulation, tree data structure, data points, structured graph representation"
, update =	"96.09 devillers"
, annote =	"3 way division into triangles."
, abstract =	"Hierarchical triangulation is a method for point
		 selection and surface representation where the surface
		 is approximated at successively finer levels of detail
		 by triangular patches whose projections in the
		 horizontal plane are nested. A tree data structure for
		 this representation can be constructed in O(n**2) worst
		 case and O(n log n) average case time, where n is the
		 number of data points considered. Efficient algorithms
		 for approximation of the elevation of an arbitrary
		 point, contour extraction, and conversion of the
		 hierarchical structure into an ordinary triangulated
		 irregular network, are demonstrated. The convergence
		 and the optimality of the approximation and the
		 relationship of the hierarchical triangulation to a
		 structured graph representation are examined. 9 refs."
}

@article{dfnp-stdt-91
, author =	"L. {De Floriani} and B. Falcidieno and G. Nagy and C. Pienovi"
, title =	"On sorting triangles in a {Delaunay} tessellation"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"522--532"
}

@techreport{dfnp-ptduv-89
, author =	"L. {De Floriani} and B. Falcidieno and G. Nagy and C. Pienovi"
, title =	"Polyhedral terrain description using visibility criteria"
, number =	"17/89"
, institution =	"CNR, Genova"
, year =	1989
, update =	"95.09 korneenko"
}

@article{dfp-dbrsd-85
, author =	"L. {De Floriani} and B. Falcidieno and C. Pienovi"
, title =	"{Delaunay}-based Representation of Surfaces Defined over Arbitrarily Shaped Domains"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	32
, year =	1985
, pages =	"127--140"
, annote =	"CDT for surface fitting. Incremental algorithm. Points
		 (where greatest error occurs) added until desired
		 accuracy reached. ($O(N\log N)$) average, $O(N^2)$
		 worst."
}

@inproceedings{dfp-grhsm-84
, author =	"L. {De Floriani} and B. Falcidieno and C. Pienovi"
, title =	"Graph Representation Of a Hierarchical Surface Model"
, booktitle =	"Proc. 7th IEEE Internat. Conf. Pattern Recogn."
, publisher =	"IEEE"
, address =	"New York, NY"
, year =	1984
, pages =	"1093--1096"
, keywords =	"triangulation, hierarchical structures, surface models, graph representation"
, annote =	"Nested triangulation for surface representation."
, abstract =	"The paper describes a hierarchical structure for
		 representing surfaces defined at arbitrarily
		 distributed data points. The surface is approximated at
		 increasing levels of accuracy by a network of
		 triangular, planar faces whose projections in the plane
		 are nested, which is called hierarchical triangulation.
		 A dual representation of this triangulation as a
		 vertex- structured graph is defined, and some basic
		 properties of this representation are discussed.
		 Algorithms for constructing a hierarchical
		 triangulation and for converting it to its dual form
		 are given. 12 refs."
}

@article{dfp-sgrht-89
, author =	"L. {De Floriani} and B. Falcidieno and C. Pienovi"
, title =	"Structured Graph Representation of a Hierarchical Triangulation"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	45
, number =	2
, month =	feb
, year =	1989
, pages =	"215--226"
, keywords =	"hierarchical triangulation, structured graph representation, surface representation"
, annote =	"Each triangle is split into three."
, abstract =	"The problem of representing a 2 1/2-dimensional
		 surface at variable degrees of accuracy is considered.
		 A hierarchical model, called a hierarchical
		 triangulation, is described which approximates a
		 surface by a network of triangular, planar facets whose
		 projections in the plane are nested. In the paper, a
		 dual representation of such a triangulation in the form
		 of a structured graph is defined and the fundamental
		 properties of this representation are discussed. An
		 algorithm for converting a hierarchical triangulation
		 into its dual form is given. As an example of
		 application, an algorithm is described for the
		 conversion of the dual graph into the standard
		 triangle-oriented structure used for encoding
		 triangulated irregular networks. (Author abstract) 15
		 Refs."
}

@techreport{dfpn-stdt-88
, author =	"L. {De Floriani} and B. Falcidieno and C. Pienovi and G. Nagy"
, title =	"On sorting triangles in a {Delaunay} tessellation"
, institution =	"Instituto per la Matematica Applicata, Consiglio Nazionale delle Richerche"
, address =	"Genova, Italy"
, year =	1988
, update =	"98.03 bibrelex"
}

@article{dm-hchtt-95
, author =	"L. {De Floriani} and P. Magillo"
, title =	"Horizon computation on a hierarchical triangulated terrain model"
, journal =	"Visual Comput."
, volume =	11
, year =	1995
, pages =	"134--149"
, update =	"95.05 smid"
}

@incollection{dmp-acggi-00
, author =	"Leila {de Floriani} and Paola Magillo and Enrico Puppo"
, title =	"Applications of Computational Geometry to Geographic Information Systems"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"333--388"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 7 of su-hcg-00"
}

@inproceedings{dmp-htmsf-94
, author =	"L. {De Floriani} and P. Marzano and E. Puppo"
, title =	"Hierarchical terrain models: {Survey} and formalization"
, booktitle =	"Proc. IEEE Sympos. Applied Comput."
, year =	1994
, pages =	"323--327"
, update =	"98.03 bibrelex"
}

@inproceedings{dn-tarod-89
, author =	"L. {De Floriani} and G. Nagy"
, title =	"Two algorithms for radial ordering of {Delaunay} triangles"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	40
}

@techreport{dn-vpts-88
, author =	"L. {De Floriani} and G. Nagy"
, title =	"Visibility problems on a topographic surface"
, number =	59
, institution =	"CNR, Genova"
, year =	1988
, update =	"95.09 korneenko"
}

@inproceedings{dnj-vcgsi-89
, author =	"L. {De Floriani} and G. Nagy and P. Jeanne"
, title =	"Visibility characteristics of grey-scale images"
, booktitle =	"Fifth International Conference on Image Analysis and Processing"
, site =	"Positano, Italy"
, month =	sep
, year =	1989
, update =	"95.09 korneenko"
}

@techreport{dnn-vocsc-88
, author =	"L. {De Floriani} and G. Nagy and H. Nair"
, title =	"Visibility oriented criteria for surface characterization"
, number =	"CGL-88-824"
, institution =	"Rensselaer Polytechnic Institute"
, year =	1988
, update =	"95.09 korneenko"
}

@incollection{fp-htbmt-92
, author =	"L. {De Floriani} and E. Puppo"
, title =	"A hierarchical triangle-based model for terrain description"
, booktitle =	"Theories and Methods of Spatio-Temporal Reasoning in Geographic Space"
, publisher =	"??"
, address =	"Pisa"
, month =	sep
, year =	1992
, pages =	"236--251"
, update =	"98.11 bibrelex"
}

@incollection{dp-scdta-89
, author =	"L. {De Floriani} and E. Puppo"
, title =	"A survey of constrained {Delaunay} triangulation algorithms for surface representaion"
, editor =	"G. G. Pieroni"
, booktitle =	"Issues on Machine Vision"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1989
, pages =	"95--104"
, update =	"94.09 bernal"
}

@unpublished{dp-olacd-91
, author =	"L. {De Floriani} and E. Puppo"
, title =	"An on-line algorithm for constrained {Delaunay} triangulation"
, month =	may
, year =	1991
, note =	"Unpublished manuscipts"
, precedes =	"dp-olacd-92"
, update =	"98.07 bibrelex"
}

@article{dp-olacd-92
, author =	"L. {De Floriani} and E. Puppo"
, title =	"An on-line algorithm for constrained {Delaunay} triangulation"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	54
, number =	3
, year =	1992
, pages =	"290--300"
, succeeds =	"dp-olacd-91"
, update =	"98.11 bibrelex, 98.07 bibrelex, 95.09 mitchell"
, annote =	"In this paper you will find the definition of a Constrained
		 Delaunay Triangulation, some theorems and the pseudocode of
		 the algorithms to program it. On-Line means that you can
		 insert points and required edges in any order. With this
		 algorithm you can update an old CDT without retriangulating
		 the old data."
}

@inproceedings{dp-cdtms-88
, author =	"Leila {De Floriani} and Enrico Puppo"
, title =	"Constrained {Delaunay} Triangulation for Multiresolution Surface Description"
, booktitle =	"Proc. Ninth IEEE International Conference on Pattern Recognition"
, publisher =	"CS Press"
, address =	"Los Alamitos, California"
, year =	1988
, pages =	"566--569"
, annote =	"Incremental algorithm for the CDT. Point insertion is
		 done by joining to vertices of the containing triangle,
		 and then using switches. Segment insertion is done by
		 deleting intersected triangles, triangulating the two
		 resulting polygons (non-Delaunay) and switching on the
		 resulting mess."
}

@inproceedings{dw-vmdrc-00
, author =	"Jes{\'u}s A. {De Loera} and Frederick J. Wicklin"
, title =	"Viro's Method Disproves {Ragsdale}'s Conjecture: a Story"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"371--372"
, keywords =	"video review"
, update =	"00.11 jones"
}

@article{dd-esrpi-00
, author =	"C. N. {De Meneses} and C. C. {De Souza}"
, title =	"Exact solutions of rectangular partitions via integer programming"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"477--522"
, update =	"01.04 smid"
}

@article{dr-twcbp-90
, author =	"C. C. {De Souza} and C. C. Ribeiro"
, title =	"A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear {Steiner} tree problem"
, journal =	"OR Spektrum"
, volume =	12
, year =	1990
, pages =	"109--111"
, keywords =	"Steiner tree, $L_{1}$ metric, heuristics"
, update =	"95.09 korneenko"
}

@article{dr-hmrst-93
, author =	"C. C. {De Souza} and C. C. Ribeiro"
, title =	"Heuristics for the minimum rectilinear {Steiner} tree problem: new algorithms and a computational study"
, journal =	"Discrete Appl. Math."
, volume =	45
, number =	3
, year =	1993
, pages =	"205--220"
, keywords =	"Steiner tree, $L_{1}$ metric, heuristics"
, update =	"95.09 korneenko"
}

@inproceedings{dh-rvrbg-95
, author =	"A. M. Dean and J. P. Hutchinson"
, title =	"Rectangle-Visibility Representations of Bipartite Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"159--166"
, keywords =	"graph drawing, visibility"
, update =	"95.01 tamassia"
}

@inproceedings{dls-rphe-86
, author =	"J. A. Dean and A. Lingas and J.-R. Sack"
, title =	"Recognizing polygons: or how to eavesdrop"
, booktitle =	"Proc. 24th Allerton Conf. Commun. Control Comput."
, year =	1986
, pages =	"324--333"
, precedes =	"dls-rphs-88"
}

@article{dls-rphs-88
, author =	"J. A. Dean and A. Lingas and J.-R. Sack"
, title =	"Recognizing polygons, or how to spy"
, journal =	"Visual Comput."
, volume =	3
, year =	1988
, pages =	"344--355"
, keywords =	"computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
, succeeds =	"dls-rphe-86"
}

@inproceedings{ds-ehlec-85
, author =	"J. A. Dean and J.-R. Sack"
, title =	"Efficient hidden-line elimination by capturing winding information"
, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
, year =	1985
, pages =	"496--505"
, keywords =	"computer graphics, visibility, convex hull, hidden line/surface elimination, polygons, two-dimensional"
}

@techreport{d-mes-90
, author =	"N. Dean"
, title =	"The Matching Extendability of Surfaces"
, type =	"Technical {Report}"
, number =	"90-14"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"93.09 milone+mitchell"
}

@techreport{dmm-nigsn-??
, author =	"N. Dean and M. Mevenkamp and C. Monma"
, title =	"Netpad: {An} interactive graphics system for network modeling and optimization"
, institution =	"Bellcore"
, year =	"??"
, keywords =	"user interface, graph algorithms, windows, graphics, networks, crossing number"
, update =	"93.09 milone+mitchell"
}

@article{d-htrt-81
, author =	"S. R. Deans"
, title =	"Hough Transform from the {Radon} transform"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-3"
, number =	2
, month =	mar
, year =	1981
, pages =	"185--188"
, update =	"97.11 bibrelex"
}

@article{d-lp-85
, author =	"P. M. Dearing"
, title =	"Location problems"
, journal =	"Oper. Res. Lett."
, volume =	4
, number =	3
, year =	1985
, pages =	"95--98"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@book{del-avceb-83
, author =	"Donald P. DeBoer and Frederick T. Evers and Douglas Garfield Link"
, title =	"Analysis of Variance: Comparative Examples, {BALANOVA}, {BMDP} and {SPSS}"
, publisher =	"Social Science Computing Laboratory, University of Western Ontario"
, address =	"London, Ontario, Canada"
, year =	1983
, isbn =	"0-7714-0427-1"
, update =	"95.05 agarwal"
}

@article{d-httdb-70
, author =	"H. Debrunner"
, title =	"Helly type theorems derived from basic singular homology"
, journal =	"Amer. Math. Monthly"
, volume =	77
, year =	1970
, pages =	"375--380"
, update =	"95.01 matousek"
}

@article{dm-cycys-86
, author =	"H. E. Debrunner and P. Mani-Levitska"
, title =	"Can you cover your shadows?"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"45--58"
}

@article{d-gc-95
, author =	"Michael Deering"
, title =	"Geometry compression"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1995
, pages =	"13--20"
, note =	"Proc. SIGGRAPH '95"
, keywords =	"triangulation, surface approximation, computer graphics, hardware, graphics pipeline"
, update =	"95.09 mitchell"
}

@article{d-eaclm-77
, author =	"D. Defays"
, title =	"An efficient algorithm for a complete link method"
, journal =	"Comput. J."
, volume =	20
, year =	1977
, pages =	"364--366"
, update =	"00.03 bibrelex"
}

@article{df-cabcc-74
, author =	"V. U. Degtyar and M. Ya. Finkel'shteyn"
, title =	"Classification algorithms based on construction of convex hulls of sets"
, journal =	"Eng. Cybern."
, volume =	12
, year =	1974
, pages =	"150--154"
, update =	"96.01 korneenko"
}

@article{dz-sorpa-91
, author =	"M. J. {DeHaemer, Jr.} and M. J. Zyda"
, title =	"Simplification of objects rendered by Polygonal Approximations"
, journal =	"Computers \& Graphics"
, volume =	15
, number =	2
, year =	1991
, pages =	"175--184"
, keywords =	"surface approximation, simplification"
, update =	"97.11 bibrelex, 95.01 mitchell"
}

@article{d-tdkaz-12
, author =	"M. Dehn"
, title =	"Transformation der {Kurven} auf zweiseitigen {Fl{\"a}chen}"
, journal =	"Math. Ann."
, volume =	72
, year =	1912
, pages =	"413--421"
, update =	"97.11 bibrelex"
}

@article{d-uudg-12
, author =	"M. Dehn"
, title =	"{\"U}ber unendliche diskontinuierliche {Gruppen}"
, journal =	"Math. Ann."
, volume =	71
, number =	"104--116"
, year =	1912
, update =	"97.11 bibrelex"
}

@inproceedings{d-odsal-85
, author =	"F. Dehne"
, title =	"A one dimensional systolic array for the largest empty rectangle problem"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1985
, pages =	"518--524"
, update =	"94.01 dehne"
}

@inproceedings{d-oacav-83
, author =	"F. Dehne"
, title =	"An ${O}(n^4)$ algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching in the {Euclidean} plane"
, booktitle =	"Proc. Internat. Colloq. Automata Lang. Program."
, year =	1983
, pages =	""
, update =	"94.01 dehne"
}

@inproceedings{d-oacav-82
, author =	"F. Dehne"
, title =	"An optimal algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching in the {Euclidean} plane"
, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
, year =	1982
, pages =	"85--93"
}

@inproceedings{d-cgv-87
, author =	"F. Dehne"
, title =	"Computational geometry and VLSI"
, booktitle =	"Proc. CompEuro Conference"
, year =	1987
, pages =	"870--875"
, update =	"94.01 dehne"
}

@inproceedings{d-cdvds-89
, author =	"F. Dehne"
, title =	"Computing digitized {Voronoi} diagrams on a systolic screen and applications to clustering"
, booktitle =	"Proc. International Symposium on Optimal Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	401
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"14--24"
, update =	"96.05 smid, 94.01 dehne"
}

@article{d-clero-90
, author =	"F. Dehne"
, title =	"Computing the largest empty rectangle on one- and two-dimensional processor arrays"
, journal =	"J. Parallel Distrib. Comput."
, volume =	9
, number =	1
, year =	1990
, pages =	"63--68"
, update =	"94.01 dehne"
}

@article{d-oamee-86
, author =	"F. Dehne"
, title =	"$O(n^{1/2})$ algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer"
, journal =	"Inform. Process. Lett."
, volume =	22
, number =	6
, year =	1986
, pages =	"303--306"
, update =	"94.01 dehne"
}

@article{d-oc-86
, author =	"Frank Dehne"
, title =	"Optical clustering"
, journal =	"Visual Comput."
, volume =	2
, number =	1
, month =	jan
, year =	1986
, pages =	"39--43"
, keywords =	"picture analysis"
}

@techreport{d-pcgcm-86
, author =	"F. Dehne"
, title =	"Parallel computational geometry and clustering methods"
, type =	"Report"
, number =	"SCS-TR-104"
, institution =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1986
}

@inproceedings{d-sgpmc-85
, author =	"F. Dehne"
, title =	"Solving geometric problems on mesh-connected and one-dimensional processor arrays"
, booktitle =	"Proc. 11th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '85"
, year =	1985
, pages =	"43--59"
, update =	"98.07 bibrelex, 94.01 dehne"
}

@article{d-svspm-88
, author =	"F. Dehne"
, title =	"Solving visibility and separability problems on a mesh of processors"
, journal =	"Visual Comput."
, volume =	3
, year =	1988
, pages =	"356--370"
, keywords =	"parallel computation, polygons, two-dimensional"
}

@techreport{d-vdzbk-82
, author =	"F. Dehne"
, title =	"Voronoi-{Diagramme} zur {Bestimmung} $k$ n{\"a}chster {Nachbarn}"
, type =	"Report"
, number =	"??"
, institution =	"Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
, address =	"Aachen, West Germany"
, year =	1982
}

@inproceedings{dddfk-rp3dc-95
, author =	"F. Dehne and X. Deng and P. Dymond and A. Fabri and A. A. Khokhar"
, title =	"A Randomized Parallel {3D} Convex Hull Algorithm for Coarse Grained Multicomputers"
, booktitle =	"Proc. 7th ACM Sympos. Parallel Algorithms Architect."
, year =	1995
, pages =	"27--33"
, update =	"98.11 kuehn, 96.09 orourke"
}

@inproceedings{dds-opapc-93
, author =	"F. Dehne and H. Djidjev and J.-R. Sack"
, title =	"An Optimal {PRAM} Algorithm for Planar Convex Embedding"
, booktitle =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
, year =	1993
, pages =	"75--77"
, keywords =	"graph drawing, convex, straight-line"
, update =	"95.09 tamassia"
}

@inproceedings{dfnrv-hcsh-92
, author =	"F. Dehne and A. Fabri and M. Nassar and A. Rau-Chaplin and R. Valiveti"
, title =	"Hyperoctree Construction from Slices on a Hypercube"
, booktitle =	"Proc. 13th Allerton Conf. Commun. Control Comput."
, year =	1992
, pages =	"??"
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1752"
, update =	"95.09 devillers, 95.01 devillers"
}

@article{dfnr-cddhh-94
, author =	"F. Dehne and A. Fabri and M. Nasser and A. Rau-Chaplin"
, title =	"Construction of $d$-dimensional hyperoctrees on a hypercube multiprocessor"
, journal =	"J. Parallel Distrib. Comput."
, volume =	"??"
, year =	"1993/94"
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1752"
, comments =	"to appear"
, update =	"95.09 devillers, 95.01 devillers, 94.01 dehne"
}

@techreport{dfr-dsdcg-
, author =	"F. Dehne and A. Fabri and A. Rau-Chaplin"
, title =	"Data structure decomposition for coarse grained multicomputers"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, update =	"98.03 bibrelex"
}

@article{dfr-spcgc-96
, author =	"F. Dehne and A. Fabri and A. Rau-Chaplin"
, title =	"Scalable parallel computational geometry for coarse grained multicomputers"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"379--400"
, succeeds =	"dfr-spgac-93"
, update =	"97.11 bibrelex, 97.03 devillers"
}

@inproceedings{dfr-spgac-93
, author =	"F. Dehne and A. Fabri and A. Rau-Chaplin"
, title =	"Scalable parallel geometric algorithms for coarse grained multicomputers"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"298--307"
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1819"
, precedes =	"dfr-spcgc-96"
, cites =	"at-pdgp-89, b-snta-68, b-skrp-77, bt-pdcnm-89, cp-dsnlt-90, -gchpc-92, gl-rrft-89, ds-tssp-87, dfr-dsdcg-, hs-ndssg-86, h-fuenl-89, l-ipaaa-92, ol-mcp-81, ps-cgi-85, rv-ltsls-87, lw-mprrd-81, ZZZ"
, update =	"98.03 bibrelex, 97.03 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
}

@article{dfr-pbbfg-90
, author =	"F. Dehne and A. Ferreira and A. Rau-Chaplin"
, title =	"Parallel branch and bound on fine grained hypercube multiprocessors"
, journal =	"Parallel Comput."
, volume =	15
, number =	""
, year =	1990
, pages =	"201--209"
, update =	"94.01 dehne"
}

@inproceedings{dfr-pfchm-89
, author =	"F. Dehne and A. Ferreira and A. Rau-Chaplin"
, title =	"Parallel fractional cascading on a hypercube multiprocessor"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1989
, pages =	"1084--1093"
, update =	"94.01 dehne"
}

@article{dfr-pfchm-92
, author =	"F. Dehne and A. Ferreira and A. Rau-Chaplin"
, title =	"Parallel fractional cascading on hypercube multiprocessors"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"141--167"
}

@inproceedings{dfr-pppbq-91
, author =	"F. Dehne and A. Ferreira and A. Rau-Chaplin"
, title =	"Parallel processing of pointer based quadtrees"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1991
, pages =	"255--262"
, update =	"94.01 dehne"
}

@inproceedings{df-ecgmd-89
, author =	"F. Dehne and L. Ficocelli"
, title =	"An efficient computational geometry method for detecting dotted lines in noisy images"
, booktitle =	"Proc. Vision Interface '89"
, year =	1989
, pages =	"88--93"
, update =	"94.01 dehne"
}

@article{df-ddlni-90
, author =	"F. Dehne and L. Ficocelli"
, title =	"Detecting dotted lines in noisy images"
, journal =	"Comput. J."
, volume =	33
, number =	5
, year =	1990
, pages =	"424--428"
, update =	"94.01 dehne"
}

@article{dfsv-apacg-94
, author =	"F. Dehne and B. Flach and J.-R. Sack and N. Valiveti"
, title =	"Analog Parallel Algorithms for Computational Geometry"
, journal =	"Journal of Parallel Algorithms and Applications"
, volume =	5
, year =	1994
, pages =	"1--14"
, update =	"97.11 sack"
}

@inproceedings{dfsv-apcg-92
, author =	"F. Dehne and B. Flach and J.-R. Sack and N. Valiveti"
, title =	"Analog parallel computational geometry"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"143--153"
, cites =	"c-sm-61, cg-asgpf-83, gj-cigtn-79, h-ngrhc-84, ht-ncdop-85, ht-cncm-86, k-mtpd-80, lls-hobst-89, l-pnrh-82, lprs-melpr-82, l-tspp-77, m-avns-89, ps-cgi-85, s-ansiu-87, stw-annic-86, s-ansfp-90, sem-vainn-86, th-snona-86, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{dh-padkw-90
, author =	"F. Dehne and S. E. Hambrusch"
, title =	"Parallel algorithms for determining $k$-width-connectivity in binary images"
, booktitle =	"Proc. 2nd IEEE Symposium on Parallel and Distributed Processing"
, year =	1990
, pages =	"488--496"
, update =	"94.01 dehne"
}

@article{dh-padkw-91
, author =	"F. Dehne and S. E. Hambrusch"
, title =	"Parallel algorithms for determining $k$-width-connectivity in binary images"
, journal =	"J. Parallel Distrib. Comput."
, volume =	12
, number =	1
, year =	1991
, pages =	"12--23"
, update =	"94.01 dehne"
}

@inproceedings{dhs-ccsrm-89i
, author =	"F. Dehne and A. Hassenklover and J.-R. Sack"
, title =	"Computing the configuration space for a robot on a mesh-of-processors"
, booktitle =	"Proc. 1989 Internat. Conf. Parallel Process."
, site =	"Chicago"
, volume =	3
, year =	1989
, pages =	"40--48"
, update =	"97.11 sack"
}

@article{dhs-ccsrm-89a
, author =	"F. Dehne and A. Hassenklover and J.-R. Sack"
, title =	"Computing the configuration space for a robot on a mesh-of-processors"
, journal =	"Parallel Comput."
, volume =	12
, number =	2
, year =	1989
, pages =	"221--231"
, keywords =	"motion planning, configuration space, parallel computations"
, update =	"95.09 korneenko"
}

@inproceedings{dhss-pvmcp-87
, author =	"F. Dehne and A. Hassenklover and J.-R. Sack and N. Santoro"
, title =	"Parallel visibility on a mesh-connected parallel computer"
, booktitle =	"Proc. International Conference on Parallel Processing and Applications"
, year =	1987
, pages =	"203--210"
, update =	"94.01 dehne"
}

@article{dhss-cgass-91
, author =	"F. Dehne and A.-L. Hassenklover and J.-R. Sack and N. Santoro"
, title =	"Computational geometry algorithms for the systolic screen"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"734--761"
}

@inproceedings{dkf-saipg-94
, author =	"F. Dehne and C. Kenyon and A. Fabri"
, title =	"Scalable and architecture independent parallel geometric algorithms with high probability optimal time"
, booktitle =	"Proc. 6th IEEE Symp. on Parallel and Distributed Processing"
, nickname =	"SPDP"
, year =	1994
, pages =	"586--593"
, update =	"96.09 orourke"
}

@inproceedings{dk-savd-87
, author =	"Frank Dehne and Rolf Klein"
, title =	"A Sweepcircle Algorithm for {Voronoi} diagrams"
, booktitle =	"Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '87"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"59--70"
, update =	"99.07 bibrelex, 98.07 bibrelex, 94.01 dehne"
}

@techreport{dk-oacvd-87
, author =	"Frank Dehne and Rolf Klein"
, title =	"An Optimal Algorithm for Computing the {Voronoi} Diagram on a Cone"
, type =	"Report"
, number =	"SCS-TR-122"
, institution =	"School of Comput. Sci., Carleton Univ."
, year =	1987
, update =	"99.07 bibrelex, 94.09 bernal"
}

@techreport{dk-bsbav-92
, author =	"Frank Dehne and Rolf Klein"
, title =	"``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
, number =	136
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1992
, succeeds =	"dk-bsbav-91"
, precedes =	"dk-bspwa-94"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{dk-bspwa-94
, author =	"Frank Dehne and Rolf Klein"
, title =	"``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
, booktitle =	"Proc. Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	841
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"296--305"
, succeeds =	"dk-bsbav-92"
, precedes =	"dk-bspwa-97"
, update =	"00.11 smid, 00.07 icking, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 97.03 icking"
}

@article{dk-bspwa-97
, author =	"Frank Dehne and Rolf Klein"
, title =	"``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
, journal =	"Algorithmica"
, volume =	17
, number =	1
, year =	1997
, pages =	"19--32"
, succeeds =	"dk-bspwa-94"
, update =	"98.11 bibrelex+held"
}

@techreport{dk-bsbav-91
, author =	"Frank Dehne and Rolf Klein"
, title =	"{The} {Big} {Sweep}: {The} Beachline Approach for {Voronoi} Diagrams in Nice Metrics"
, type =	"Manuscript"
, institution =	"FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1991
, precedes =	"dk-bspwa-92"
, update =	"00.11 smid, 00.07 icking, 99.07 bibrelex, 98.07 icking, 97.11 bibrelex"
}

@article{dmr-ocmcc-91
, author =	"Frank Dehne and Russ Miller and Andrew Rau-Chaplin"
, title =	"Optical Clustering on a Mesh-Connected Computer"
, journal =	"Internat. J. Parallel Program."
, volume =	20
, number =	6
, year =	1991
, update =	"98.07 icking, 94.01 dehne"
}

@inproceedings{dn-cgacp-85
, author =	"F. Dehne and H. Noltemeier"
, title =	"A computational geometry approach to clustering problems"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"245--250"
}

@inproceedings{dn-cgoal-85
, author =	"F. Dehne and H. Noltemeier"
, title =	"Clustering geometric objects and applications to layout problems"
, booktitle =	"Proc. Computer Graphics Tokyo '85"
, year =	1985
, pages =	"35--40"
, update =	"94.01 dehne"
}

@article{dn-cmgoa-86
, author =	"F. Dehne and H. Noltemeier"
, title =	"Clustering methods for geometric objects and applications to design problems"
, journal =	"Visual Comput."
, volume =	2
, number =	1
, month =	jan
, year =	1986
, pages =	"31--38"
, keywords =	"layout problems"
}

@article{dn-vtcp-87
, author =	"F. Dehne and H. Noltemeier"
, title =	"Voronoi trees and clustering problems"
, journal =	"Inform. Syst."
, volume =	12
, number =	2
, year =	1987
, pages =	"171--175"
, update =	"94.01 dehne"
}

@inproceedings{dp-vabih-88
, author =	"F. Dehne and Q. T. Pham"
, title =	"Visibility algorithms for binary images on the hypercube and the perfect-shuffle computer"
, booktitle =	"Proc. IFIP WG 10.3 Working Conf. on Parallel Processing"
, year =	1988
, pages =	"117--124"
, update =	"94.01 dehne"
}

@article{dps-ovabi-90
, author =	"F. Dehne and Q. T. Pham and I. Stojmenovi{\'c}"
, title =	"Optimal visibility algorithms for binary images on the hypercube"
, journal =	"Internat. J. Parallel Program."
, volume =	19
, number =	3
, year =	1990
, pages =	"213--224"
, update =	"94.01 dehne"
}

@inproceedings{dps-ovabi-88
, author =	"F. Dehne and Q. T. Pham and I. Stojmenovi{\'c}"
, title =	"Optimal visibility algorithms for binary images on the hypercube --- preliminary version"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1988
, pages =	"1035--1036"
, update =	"94.09 lambert, 94.01 dehne"
}

@inproceedings{dr-idshm-89
, author =	"F. Dehne and A. Rau-Chaplin"
, title =	"Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry"
, booktitle =	"Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '89"
, year =	1989
, pages =	"316--329"
, update =	"98.07 bibrelex, 94.01 dehne"
}

@article{dr-idshm-90
, author =	"F. Dehne and A. Rau-Chaplin"
, title =	"Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry"
, journal =	"J. Parallel Distrib. Comput."
, volume =	8
, number =	4
, year =	1990
, pages =	"367--375"
, update =	"94.01 dehne"
}

@inproceedings{ds-spcga-88
, author =	"F. Dehne and J.-R. Sack"
, title =	"A survey of parallel computational geometry algorithms"
, booktitle =	"Proc. International Workshop on Parallel Processing by Cellular Automata and Arrays"
, series =	"Lecture Notes Comput. Sci."
, volume =	342
, year =	1988
, pages =	"73--88"
, keywords =	"parallel computations, survey"
, update =	"02.03 icking, 95.09 korneenko, 94.01 dehne"
}

@inproceedings{ds-sspts-87
, author =	"F. Dehne and J.-R. Sack"
, title =	"Separability of Sets of Polygons Through Single Translations"
, booktitle =	"Proc WG'87"
, site =	"Bernried, FRG"
, series =	"Lecture Notes Comput. Sci."
, volume =	246
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"237--251"
, update =	"97.11 sack"
}

@inproceedings{ds-ssp-86
, author =	"F. Dehne and J.-R. Sack"
, title =	"Separabilty of sets of polygons"
, booktitle =	"Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '86"
, year =	1986
, pages =	"237--251"
, update =	"98.07 bibrelex, 94.01 dehne"
}

@article{ds-tssp-87
, author =	"F. Dehne and J.-R. Sack"
, title =	"Translation separability of sets of polygons"
, journal =	"Visual Comput."
, volume =	3
, year =	1987
, pages =	"227--235"
, keywords =	"robotics, motion planning, detection, reporting, separation, path planning, segment trees, polygons, two-dimensional"
}

@inproceedings{dss-csshc-87
, author =	"F. Dehne and J.-R. Sack and N. Santoro"
, title =	"Computing on a systolic screen: hulls, contours and applications"
, booktitle =	"Conf. Parallel Architectures Languages Europe"
, series =	"Lecture Notes Comput. Sci."
, volume =	258
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"121--133"
, keywords =	"parallel computation, computer graphics, convex hull, polygons, two-dimensional"
}

@proceedings{dss-pwads-89
, title =	"Proc. 1st Workshop on Algorithms Data Struct."
, editor =	"F. Dehne and J.-R. Sack and N. Santoro"
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, update =	"98.11 bibrelex, 97.11 sack"
}

@proceedings{dss-p2wad-91
, title =	"Proc. 2nd Workshop Algorithms Data Struct."
, editor =	"F. Dehne and J.-R. Sack and N. Santoro"
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, update =	"98.07 bibrelex, 97.11 sack"
}

@proceedings{dssw-p3wad-93
, title =	"Proc. 3rd Workshop on Algorithms and Data Structures"
, editor =	"F. Dehne and J.-R. Sack and N. Santoro and S. Whitesides"
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, update =	"97.11 sack"
}

@inproceedings{dss-nd3dc-88
, author =	"F. Dehne and J. R. Sack and I. Stojmenovi{\'c}"
, title =	"A note on determining the $3$-dimensional convex hull of a set of points on a mesh of processors"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"154--162"
}

@article{ds-oaesp-88
, author =	"F. Dehne and I. Stojmenovi{\'c}"
, title =	"An ${O}(n)$ algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors"
, journal =	"Inform. Process. Lett."
, volume =	28
, number =	2
, year =	1988
, pages =	"67--70"
, update =	"94.01 dehne"
}

@inproceedings{ds-opses-87
, author =	"F. Dehne and I. Stojmenovi{\'c}"
, title =	"An optimal parallel solution to the ECDF searching problem for higher dimensions on a mesh-of-processors"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1987
, pages =	"660--661"
, update =	"94.01 dehne"
}

@inproceedings{dt-cpasd-89
, author =	"F. Dehne and R. Tamassia"
, title =	"Cutting polygons to achieve separability, with dynamization"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	32
}

@techreport{ddr-chlts-92
, author =	"V. G. De{\u\i}neko and Ren{\'e} van Dal and G{\"u}nter Rote"
, title =	"The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case"
, type =	"Report"
, number =	233
, institution =	"Inst. Math., Tech. Univ. Graz"
, address =	"Graz, Austria"
, month =	sep
, year =	1992
, precedes =	"ddr-chlts-94"
, update =	"98.03 mitchell, 97.03 rote"
}

@article{ddr-chlts-94
, author =	"V. G. De{\u\i}neko and Ren{\'e} van Dal and G{\"u}nter Rote"
, title =	"The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case"
, journal =	"Inform. Process. Lett."
, volume =	51
, year =	1994
, pages =	"141--148"
, succeeds =	"ddr-chlts-92"
, cites =	"akmsw-gamsa-87, r-nltsp-92"
, update =	"98.03 mitchell, 97.03 rote"
, abstract =	"We solve the special case of the Euclidean Traveling
		 Salesman Problem where $n-m$ cities lie on the boundary
		 of the convex hull of all $n$ cities, and the other
		 $m$ cities lie on a line segment inside this convex hull
		 by an algorithm which needs $O(mn)$ time and $O(n)$ space."
}

@article{d-fptea-71
, author =	"T. J. Dekker"
, title =	"A floating-point technique for extending the available precision"
, journal =	"Numerische Mathematik"
, volume =	18
, year =	1971
, pages =	"224--242"
, update =	"97.11 bibrelex"
}

@article{d-argon-92
, author =	"B. V. Dekster"
, title =	"Assembling $r$-gons out of $n$ given segments"
, journal =	"Math. Mag."
, volume =	65
, number =	1
, month =	feb
, year =	1992
, pages =	"44--48"
, update =	"98.07 bibrelex"
}

@article{d-uardr-80
, author =	"C. Delannoy"
, title =	"Un algorithme rapide de recherche de plus proches voisins"
, journal =	"RAIRO Inform. Theor."
, volume =	14
, year =	1980
, pages =	"275--286"
, keywords =	"nearest neighbors"
, update =	"95.09 korneenko"
}

@article{d-slsv-34
, author =	"B. Delaunay"
, title =	"Sur la sph{\`e}re vide. {A} la memoire de {Georges} {Voronoi}"
, journal =	"Izv. Akad. Nauk SSSR, Otdelenie Matematicheskih i Estestvennyh Nauk"
, volume =	7
, year =	1934
, pages =	"793--800"
, keywords =	"Delaunay triangulation"
, comments =	"Translated as Bull. Acad. Sci. USSR: Class. Sci. Math. Nat."
, update =	"95.09 korneenko, 93.09 jones"
}

@inproceedings{de-iabns-93
, author =	"C. J. A. Delfinado and H. Edelsbrunner"
, title =	"An incremental algorithm for {Betti} numbers of simplicial complexes"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"232--239"
, cites =	"ah-t1-35, b-ct-93, clr-ia-90, dc-cchtt-91, e-acg-87, e-was-92, eks-sspp-83, em-tdas-94, g-gsh-81, kb-ptacs-79, m-eat-84, r-iat-88, s-siec-61, ZZZ"
, update =	"98.07 agarwal, 98.03 bibrelex, 93.09 jones"
}

@article{d-agtgp-90
, author =	"K. Deljouie-Rakhshandeh"
, title =	"An Approach to the Generation of Triangular Grids Possessing Few Obtuse Triangles"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	29
, year =	1990
, pages =	"1299--1321"
, annote =	"Wants triangulation with very few obtuse angles.
		 Combines ad-hoccery for node generation with switching
		 rules. Also decomposes complex shape into convex
		 pieces."
}

@unpublished{dg-bop-01
, author =	"Charles Delman and Gregory Galperin"
, title =	"Billiards on polyhedra: {A} separation principle and a calculus for the number of trajectories"
, year =	2001
, note =	"Univ. Eastern Illinois"
, update =	"01.04 orourke"
}

@inproceedings{ddo-pp1an-00
, author =	"E. D. Demain and M. L. Demaine and J. O'Rourke"
, title =	"{PushPush} and {Push-1} are {NP}-hard in {2D}"
, booktitle =	"Proc. 12th Canad. Conf. Comput. Geom."
, site =	"New Brunswick"
, month =	aug
, year =	2000
, pages =	"??--??"
, url =	"http://cs.smith.edu/~orourke/papers.html"
, cites =	"ddo-ppnph2d-00"
, update =	"01.04 icking, 00.11 smid, 00.07 orourke"
}

@techreport{ddo-ppnph2d-00
, author =	"E. D. Demain and M. L. Demaine and J. O'Rourke"
, title =	"{PushPush} is {NP}-hard in {2D}"
, number =	065
, institution =	"Smith College, Northampton, MA"
, month =	jan
, year =	2000
, archive =	"XXX:cs.CG/0001019"
, cites =	"os-ppnph3d-99"
, update =	"00.03 orourke"
}

@inproceedings{dlo-sil-01
, author =	"Erik D. Demain and Stefan Langerman and Joseph O'Rourke"
, title =	"Short Interlocked Linkages"
, booktitle =	"Proc. 13th Canad. Conf. Comput. Geom."
, site =	"Waterloo"
, year =	2001
, pages =	"??--??"
, update =	"02.03 icking, 01.07 orourke"
}

@inproceedings{ddlop-mc-99
, author =	"E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and I. Pashchenko"
, title =	"Metamorphosis of the Cube"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"409--410"
, note =	"Video and abstract"
, update =	"00.03 orourke"
}

@article{do-cgc37-99
, author =	"E. Demaine and J. O'Rourke"
, title =	"Computational geometry column 37"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"??"
, year =	1999
, pages =	"??--??"
, note =	"Also in SIGACT News, 30(3):39--42 (1999), Issue 112; LANL XXX archive cs.CG/9908007"
, archive =	"XXX:cs.CG/9908007"
, update =	"00.03 orourke"
, annote =	"Open problems from the 15th Annual ACM Symposium on Computational Geometry."
}

@article{ddk-pccs-01
, author =	"E. D. Demaine and M. L. Demaine and C. S. Kaplan"
, title =	"Polygons cuttable by a circular saw"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"69--84"
, update =	"01.11 smid"
}

@inproceedings{ddl-fcp-98
, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw"
, title =	"Folding and Cutting Paper"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom."
, site =	"Tokyo, Japan"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1998
, url =	"http://ranran.cis.ibaraki.ac.jp/jcdcg98/jcdcg98.html"
, update =	"99.11 bibrelex, 99.07 orourke"
}

@inproceedings{ddl-foscs-99
, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw"
, title =	"Folding and One Straight Cut Suffice"
, booktitle =	"Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg."
, nickname =	"SODA'99"
, site =	"Baltimore, Maryland"
, month =	jan
, year =	1999
, pages =	"891--892"
, url =	"http://www.siam.org/meetings/da99/"
, update =	"99.07 orourke"
}

@inproceedings{ddao-efupp-00
, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
, title =	"Enumerating foldings and unfoldings between polygons and polytopes"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
, site =	"Tokyo"
, month =	dec
, year =	2000
, pages =	"9--12"
, note =	"Revised version to appear in LNCS"
, update =	"01.04 orourke"
}

@inproceedings{ddlo-efupp-01
, author =	"Erik D. Demaine and Martin L. Demaine and Anna Lubiw and Joseph O'Rourke"
, title =	"Enumerating Foldings and Unfoldings between Polygons and Polytopes"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '00"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"??--??"
, note =	"Tokyo, Nov. 2000, pp. 9--12."
, succeeds =	"ddlo-ecerfu-00"
, update =	"01.07 orourke"
}

@inproceedings{o-fucg-01
, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
, title =	"Enumerating foldings and unfoldings between polygons and polytopes"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	2001
, pages =	"??--??"
, note =	"To appear"
, succeeds =	"ddao-efupp-00"
, update =	"02.03 icking, 01.04 orourke"
}

@techreport{ddlo-ecerfu-00
, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
, title =	"Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes"
, number =	069
, institution =	"Smith College, Northampton, MA"
, month =	jul
, year =	2000
, note =	"LANL ArXive cs.CG/0007019"
, update =	"01.04 orourke"
}

@inproceedings{ddm-ffswp-99
, author =	"E. D. Demaine and M. L. Demaine and J. S. B. Mitchell"
, title =	"Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, site =	"Miami Beach, Florida"
, month =	jun
, year =	1999
, pages =	"105--114"
, url =	"http://www.cs.miami.edu/events/SCG99"
, update =	"99.07 orourke"
}

@techreport{deeho-vusm-01
, author =	"E. D. Demaine and D. Eppstein and J. Erickson and G. W. Hart and J. O'Rourke"
, title =	"Vertex-Unfoldings of Simplicial Manifolds"
, type =	"Technical {Report}"
, number =	072
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA, USA"
, month =	oct
, year =	2001
, url =	"http://arXiv.org/abs/cs/0110054/"
, succeeds =	"deeho-vusp-01"
, update =	"01.11 orourke"
}

@techreport{deeho-vusp-01
, author =	"E. D. Demaine and D. Eppstein and J. Erickson and G. W. Hart and J. O'Rourke"
, title =	"Vertex-Unfoldings of Simplicial Polyhedra"
, type =	"Technical {Report}"
, number =	071
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA, USA"
, month =	jul
, year =	2001
, url =	"http://arXiv.org/abs/cs/0107023/"
, update =	"01.11 orourke"
}

@inproceedings{do-op99-01
, author =	"Erik D. Demaine and Joseph O'Rourke"
, title =	"Open Problems from {CCCG}'00"
, booktitle =	"Proc. 13th Canad. Conf. Comput. Geom."
, site =	"Waterloo"
, year =	2001
, pages =	"??--??"
, update =	"02.03 icking, 01.07 orourke"
}

@inproceedings{do-op99-00
, author =	"Erik D. Demaine and J. O'Rourke"
, title =	"Open Problems from {CCCG}'99"
, booktitle =	"Proc. 12th Canad. Conf. Comput. Geom."
, site =	"New Brunswick"
, month =	aug
, year =	2000
, pages =	"269--272"
, update =	"02.03 icking, 01.07 orourke"
}

@article{d-iw-86
, author =	"H{\"u}seyin Demir"
, title =	"Incircles within"
, journal =	"Math. Mag."
, volume =	59
, year =	1986
, pages =	"77--83"
, update =	"98.11 bibrelex"
}

@techreport{d-eaavr-86
, author =	"J. Demmel"
, title =	"On Error Analysis in Arithmetic with Varying Relative Precision"
, type =	"Technical {Report}"
, number =	251
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, month =	oct
, year =	1986
, update =	"98.03 bibrelex"
}

@article{d-cdnsm-92
, author =	"J. Demmel"
, title =	"The componentwise distance to the nearest singular matrix"
, journal =	"SIAM J. Matrix Anal. Appl."
, volume =	13
, number =	1
, year =	1992
, pages =	"10--19"
, update =	"98.03 bibrelex"
}

@article{ds-ppsp-88
, author =	"L. Deneen and G. Shute"
, title =	"Polygonizations of point sets in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"77--87"
, keywords =	"counting, arrangements, star-shaped, two-dimensional, combinatorial geometry"
}

@inproceedings{dd-upctg-90
, author =	"L. L. Deneen and J. B. Dezell"
, title =	"Using partitioning and clustering techniques to generate rectilinear {Steiner} trees"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"315--318"
, cites =	"b-tprrs-88, ds-psars-89, dw-spg-72, jd-acd-88, dh-pcsa-73, ggj-ccsmt-77, gj-rstpi-77, h-oasrs-79, k-papat-77, ks-ppars-85, lw-vdllm-80, ps-cgi-85, r-fhars-89, s-harst-81, s-cg-78, sdt-opsal-91, sll-ohars-80, yw-ossaw-72, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{dj-tag-92
, author =	"L. L. Deneen and S. Joshi"
, title =	"Treasures in an art gallery"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"17--22"
, cites =	"at-oadvp-81, c-ctpg-75, ea-lacvp-81, js-clvpa-87, ll-ccagp-86, l-vsp-83, o-agta-87, ZZZ"
, update =	"98.07 bibrelex"
}

@unpublished{ds-psars-89
, author =	"L. L. Deneen and G. M. Shute"
, title =	"A plane-sweep algorithm for rectilinear {Steiner} trees with deferred connections"
, year =	1989
, note =	"Unpublished Manuscript"
, update =	"98.07 bibrelex"
}

@inproceedings{dst-pfpoa-92
, author =	"L. L. Deneen and G. M. Shute and C. D. Thomborson"
, title =	"A probably fast, provably optimal algorithm for rectilinear {Steiner} trees"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"299--304"
, cites =	"br-iastp-92, d-os-70, dw-spg-72, gj-rstpi-77, h-sprd-66, h-smtrd-76, k-fa-73, tds-crsmt-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{d-chacg-94
, author =	"X. Deng"
, title =	"A Convex Hull Algorithm on Course-Grained Multicomputer"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, year =	1994
, pages =	"634--642"
, update =	"98.07 bibrelex, 96.09 orourke"
}

@article{d-opalp-90
, author =	"X. Deng"
, title =	"An optimal parallel algorithm for linear programming in the plane"
, journal =	"Inform. Process. Lett."
, volume =	35
, year =	1990
, pages =	"213--217"
, keywords =	"parallel computations, linear programming, two-dimensional"
, update =	"95.09 korneenko"
}

@inproceedings{dkp-hlue-91
, author =	"X. Deng and T. Kameda and C. Papadimitriou"
, title =	"How to learn an unknown environment"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"298--303"
}

@article{dkp-hlue1-98
, author =	"Xiaotie Deng and Tiko Kameda and Christos Papadimitriou"
, title =	"How to Learn an Unknown Environment {I}: The Rectilinear Case"
, journal =	"J. ACM"
, volume =	45
, number =	2
, year =	1998
, pages =	"215--245"
, succeeds =	"dkp-hlue1-93"
, update =	"98.11 bibrelex"
}

@techreport{dkp-hlue1-93
, author =	"Xiaotie Deng and Tiko Kameda and Christos H. Papadimitriou"
, title =	"How to learn an unknown environment {I}: the rectilinear case"
, number =	"CS-93-04"
, institution =	"Department of Computer Science, York University"
, address =	"Canada"
, year =	1993
, precedes =	"dkp-hlue1-98"
, update =	"98.11 bibrelex, 97.03 icking"
}

@inproceedings{dm-rmfpv-93
, author =	"Xiaotie Deng and Andy Mirzaian"
, title =	"Robot Mapping: {Foot}-prints vs Tokens"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"353--362"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@inproceedings{dfm-cddl-93
, author =	"E. Dengler and M. Friedell and J. Marks"
, title =	"Constraint-Driven Diagram Layout"
, booktitle =	"Proc. IEEE Sympos. on Visual Languages"
, nickname =	"VL '93"
, year =	1993
, pages =	"330--335"
, keywords =	"graph drawing, constraints"
, update =	"95.09 agarwal, 95.05 tamassia, 95.01 tamassia"
}

@inproceedings{ds-etpip-97
, author =	"Markus Denny and Christian Sohler"
, title =	"Encoding a Triangulation as a Permutation of its Point Set"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"39--43"
, update =	"97.11 jones"
}

@article{d-nhtpa-76
, author =	"N. Deo"
, title =	"Note on {Hopcroft} and {Tarjan}'s planarity algorithm"
, journal =	"J. ACM"
, volume =	23
, year =	1976
, pages =	"74--75"
, keywords =	"graph drawing"
, update =	"97.11 bibrelex, 93.09 tamassia"
}

@article{dp-spata-84
, author =	"N. Deo and C.-Y. Pany"
, title =	"Shortest-path algorithms: taxonomy and annotation"
, journal =	"Networks"
, volume =	14
, year =	1984
, pages =	"275--323"
}

@inproceedings{dko-fliet-87
, author =	"A. DePano and Y. Ke and J. O'Rourke"
, title =	"Finding largest inscribed equilateral triangles and squares"
, booktitle =	"Proc. 25th Allerton Conf. Commun. Control Comput."
, month =	oct
, year =	1987
, pages =	"869--878"
, keywords =	"two-dimensional, inscribed, regular polygons, maximal area, optimization"
, comments =	"submitted to Internat. J. Comput. Geom. Appl."
}

@incollection{d-bret-88
, author =	"N. A. A. {DePano}"
, title =	"Best regular enclosures of triangles"
, booktitle =	"IEEE SOUTHEASTCON, 1988, Knoxville"
, year =	1988
, pages =	"368--372"
, keywords =	"triangles, enclosure"
, update =	"95.09 korneenko"
}

@phdthesis{d-paope-87
, author =	"N. A. A. {DePano}"
, title =	"Polygon approximation with optimized polygonal enclosures: applications and algorithms"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Johns Hopkins Univ."
, year =	1987
, keywords =	"polygons, approximation, enclosure, doctoral thesis"
, update =	"97.11 bibrelex, 95.09 korneenko"
}

@inproceedings{da-frkec-84
, author =	"N. A. A. DePano and A. Aggarwal"
, title =	"Finding restricted $k$-envelopes for convex polygons"
, booktitle =	"Proc. 22nd Allerton Conf. Commun. Control Comput."
, year =	1984
, pages =	"81--90"
}

@inproceedings{dbkl-apecg-90
, author =	"N. Adlai A. DePano and Farinaz D. Boudreau and Philip Katner and Brian Li"
, title =	"Algorithmic Paradigms. Examples In Computational Geometry {II}"
, booktitle =	"21st SIGCSE Technical Symposium on Computer Science Education"
, publisher =	"ACM"
, address =	"Fort Collins Computer Center, Fort Collins, CO"
, year =	1990
, pages =	"186--191"
, keywords =	"computational geometry, algorithmic paradigms"
, annote =	"Generates random polygons by taking convex hull of $M$
		 points from uniform distribution over circle. Use these
		 to test if minimum area and minimum perimeter enclosing
		 rectangles are different."
, abstract =	"We discuss two problems from the relatively new field
		 of computational geometry to illustrate two advanced
		 notions in algorithm design and analysis. One problem
		 deals with the triangulation of convex polygons while
		 the other delves into minimum enclosing rectangles. Our
		 work continues with the objective set forth in an
		 earlier paper of a similar title. (Author abstract) 11
		 Refs."
}

@inproceedings{d-gpcfa-89
, author =	"A. D. DeRose"
, title =	"Geometric Programming: {A} Coordinate-Free Approach"
, booktitle =	"Theory and Practice of Geometric Modeling"
, publisher =	"Springer-Verlag"
, address =	"Blaubeuren, FRG (Oct 1988)"
, year =	1989
, pages =	""
, update =	"93.09 held"
}

@phdthesis{d-pimcc-85
, author =	"T. DeRose"
, title =	"Geometric Continuity: A parameterization independent measure of continuity for computer aided design"
, school =	"Computer Science, Unioversity of California, Berkeley"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@techreport{dlw-masat-93
, author =	"T. D. DeRose and M. Lounsbery and J. Warren"
, title =	"Multiresolution Analysis for Surface of Arbitrary Topological Type"
, type =	"Report"
, number =	"93-10-05"
, institution =	"Department of Computer Science, University of Washington"
, address =	"Seattle, WA"
, year =	1993
, update =	"95.01 mitchell"
}

@techreport{d-spclr-94
, author =	"G. Desaulniers"
, title =	"On Shortest Paths for a Car-Like Robot Maneuvering Around Obstacles"
, type =	"Les Cahiers du GERAD"
, number =	"G-94-35"
, institution =	"Ecole des Hautes Etudes Commerciales"
, address =	"Montreal, Canada"
, year =	1994
, update =	"98.03 mitchell"
}

@article{ds-rnmgc-
, author =	"H. Desaulniers and N. F. Steward"
, title =	"Robustness of numerical methods in geometric computation when problem data is uncertain"
, journal =	"CAD"
, volume =	25
, number =	9
, year =	"??"
, pages =	"539--545"
, update =	"98.07 bibrelex"
}

@article{ds-embrr-92
, author =	"H. Desaulniers and N. F. Stewart"
, title =	"An extension of manifold boudary representations to the $r$-sets"
, journal =	"ACM Trans. Graph."
, volume =	11
, number =	1
, month =	jan
, year =	1992
, pages =	"40--60"
, update =	"98.07 bibrelex"
}

@techreport{ds-beafp-93
, author =	"H. Desaulniers and N. F. Stewart"
, title =	"Backward error analysis for floating-point operations on rectilinear $r$-sets"
, type =	"Technical {Report}"
, number =	816
, institution =	"Univ. Montreal"
, year =	1993
, keywords =	"Computer-aided design."
, update =	"98.07 bibrelex"
}

@inproceedings{ds-qrrs-92
, author =	"H. Desaulniers and N. F. Stewart"
, title =	"Quasi-rectilinear $r$-sets"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"52--58"
, cites =	"r-mmrso-79, r-rrstm-80, rv-smcsr-83, m-ism-88, -isbfp-85, g-rssm-87, h-gsm-89, s-drpga-90, s-rsasf-91, ds-embrr-92, lth-csgpo-86, w-restr-88, m-rfldd-90, hhk-rsops-89, hk-prga-89, mn-fccrp-90i, r-cirfd-89, m-vigau-88p, w-aedfd-34, m-erf-34, a-efslc-67, l-tsas-64, ds-beafp-93, w-aep-65, k-sa-69, bs-msto-91, bs-iftmo-92, s-scctf-92, ZZZ"
, update =	"98.07 bibrelex"
}

@book{d-pp-44
, author =	"R. Descartes"
, title =	"Principia Philosophiae"
, publisher =	"Ludovicus Elzevirius"
, address =	"Amsterdam"
, year =	1644
, update =	"00.03 bibrelex"
}

@phdthesis{d-tq-96
, author =	"P. Desnogu{\`e}s"
, title =	"Triangulations et quadriques"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"Universit\'e de Nice-Sophia Antipolis"
, address =	"France"
, year =	1996
, url =	"http://www-sop.inria.fr/prisme/publis/these-desnogues.ps.gz"
, keywords =	"doctoral thesis"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers"
}

@inproceedings{dd-lothp-95
, author =	"Pascal Desnogu{\`e}s and Olivier Devillers"
, title =	"A Locally Optimal Triangulation of the Hyperbolic Paraboloid"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"49--54"
, url =	"http://www-sop.inria.fr/prisme/publis/dd-lothp-95.ps.gz"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 jones"
}

@inproceedings{dlm-mlrca-93
, author =	"A. Dessmark and A. Lingas and A. Maheshwari"
, title =	"Multi-list ranking: complexity and applications"
, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	665
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"306--316"
, update =	"93.05 smid"
}

@article{d-rrpa-86
, author =	"G. Dettori"
, title =	"Recent results in polygonal approximation"
, journal =	"Adv. Modell. Simul."
, volume =	6
, number =	2
, year =	1986
, pages =	"35--57"
, keywords =	"polygons, approximation"
, update =	"95.09 korneenko"
}

@inproceedings{d-ctdvc-84
, author =	"F. D{\'e}vai"
, title =	"Complexity of two-dimensional visibility computations"
, booktitle =	"Proc. 3rd European Conference on CAD'CAM and Computer Graphics"
, site =	"Paris, France"
, volume =	"827--841"
, year =	1984
, update =	"98.03 bibrelex"
}

@phdthesis{d-cvc-81
, author =	"F. D{\'e}vai"
, title =	"Complexity of visibility computations"
, school =	"University of Budapest"
, address =	"Budapest, Hungary"
, year =	1981
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{d-qbhle-86
, author =	"F. D{\'e}vai"
, title =	"Quadratic bounds for hidden line elimination"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"269--275"
, keywords =	"hidden line/surface elimination"
, cites =	"a-nqimr-67, b-lbact-83, bm-gta-76, cgl-pgd-83, d-cvc-81, d-ctdvc-84, eos-calha-83t, f-cgpractice-85, f-ltehs-80, fw-ccmb-78, gm-ahle-69, hc-gi-52, l-shlpc-70, n-flsah-85, s-tsbhl-81, sss-cthsa-74, wa-hsrup-77, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex"
}

@article{ds-cchfs-79
, author =	"F. D{\'e}vai and T. Szendr{\'e}nyi"
, title =	"Comments on convex hull of a finite set of points in two dimensions"
, journal =	"Inform. Process. Lett."
, volume =	9
, year =	1979
, pages =	"141--142"
}

@book{d-icds-86
, author =	"R. L. Devaney"
, title =	"Introduction to Chaotic Dynamical Systems"
, publisher =	"Benjamin Cummins"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{dd-idamd-82
, author =	"P. A. Devijver and M. Dekesel"
, title =	"Insert and delete algorithms for maintaining dynamic {Delaunay} triangulations"
, journal =	"Pattern Recogn. Lett."
, volume =	1
, year =	1982
, pages =	"73--77"
, update =	"93.05 freimer"
}

@book{dk-prsa-82
, author =	"P. A. Devijver and J. Kittler"
, title =	"Pattern Recognition: {A} Statistical Approach"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1982
, update =	"97.03 schwarzkopf"
}

@inproceedings{dm-cdtcp-82
, author =	"P. A. Devijver and S. Maybank"
, title =	"On the computation of the {Delaunay} triangulation of a convex polygon"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
, year =	1982
, pages =	"420--422"
, update =	"94.09 lambert"
}

@article{d-ircg-96
, author =	"Olivier Devillers"
, title =	"An introduction to randomization in computational geometry"
, journal =	"Theoret. Comput. Sci."
, volume =	157
, year =	1996
, pages =	"35--52"
, url =	"http://www-sop.inria.fr/prisme/publis/d-ircg-96.ps.gz"
, cites =	"as-solri-92, bd-rcuet-92, bdsty-arsol-92, bdt-schov-93, bt-hrodt-86, bt-rcdt-93, prisme-by-ga-95, ce-oails-92, cegss-cfals-93, c-ochaa-93, c-narsc-87, cms-frric-93, cs-arscg-89, prisme-2626, bds-lric-94, d-rysoa-92, dg-dbppl-93, dmt-fddtl-92, dty-dlals-92, dy-rchyd-93, gks-ricdv-92, ms-dplah-91, m-lavd-91, m-rmstd-91, m-rmstf-91, m-rmstl-91, m-cgitr-93, ol-mcp-81, ps-cgi-85, p-slpab-90, s-dmgsm-91, s-dmcpr-92, s-sfira-91, t-tdrac-93"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.05 smid, 96.01 devillers"
, abstract =	"This paper is not a complete survey on randomized algorithms in computational geometry, but an introduction to this subject providing intuitions and references.  In a first time, some basic ideas are illustrated by the sorting problem, and in a second time few results on computational geometry are briefly explained."
}

@inproceedings{d-cgdc-96
, author =	"O. Devillers"
, title =	"Computational geometry and discrete computations"
, booktitle =	"Proc. 6th Discrete Geometry for Computer Imagery conf."
, series =	"Lecture Notes Comput. Sci."
, volume =	1176
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"317--324"
, note =	"(invited paper)"
, update =	"02.03 devillers"
}

@inproceedings{d-iirdt-98
, author =	"Olivier Devillers"
, title =	"Improved incremental randomized {Delaunay} triangulation"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"106--115"
, url =	"https://hal.inria.fr/hal-01179446"
, archive =	"XXX:cs.CG/9907024"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.11 devillers"
, abstract =	"We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the triangulation of a small sample of the levels below. Point location is done by marching in a triangulation to determine the nearest neighbor of the query at that level, then the march restarts from that neighbor at the level below. Using a small sample (3 {\%}) allows a small memory occupation; the march and the use of the nearest neighbor to change levels quickly locate the query."
}

@phdthesis{d-mddtd-88
, author =	"Olivier Devillers"
, title =	"M{\'e}thodes d'optimisation du trac{\'e} de rayon"
, school =	"Universit{\'e} Paris Sud"
, address =	"Paris, France"
, year =	1988
, keywords =	"doctoral thesis"
, update =	"99.07 devillers, 98.07 bibrelex"
}

@techreport{d-ddt-98
, author =	"Olivier Devillers"
, title =	"On Deletion in {Delaunay} Triangulation"
, type =	"Research {Report}"
, number =	3451
, institution =	"INRIA"
, year =	1998
, url =	"http://www.inria.fr/RRRT/RR-3451"
, precedes =	"d-ddt-99"
, update =	"99.11 bibrelex, 99.07 devillers, 98.11 devillers"
, 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         = "https://hal.inria.fr/inria-00433107/"
}

@inproceedings{d-ddt-99
, author =	"Olivier Devillers"
, title =	"On Deletion in {Delaunay} Triangulation"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"181--188"
, url =	"http://www-sop.inria.fr/prisme/publis/d-ddt-99.ps.gz"
, archive =	"XXX:cs.CG/9907023"
, succeeds =	"d-ddt-98"
, cites =	"agss-ltacv-89, a-pdpaa-87, bbp-iayed-98scg, bd-irgo-95, bm-sdcs-71, c-bvdcp-86, ads-rdppw-98, d-iirdt-98, dmt-ssgtu-92i, dp-papaf-98, es-itfwr-96, gs-cdtp-78, h-taatm-90, l-tdam-97, m-smdnt-93, msz-frplw-96, obs-stcav-92, p-gcc-70, s-chdch-86, s-nmpgc-98"
, update =	"99.11 bibrelex+devillers, 99.07 devillers"
, 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."
}

% also claimed pages = "621--635"
@article{d-rysoa-92
, author =	"Olivier Devillers"
, title =	"Randomization yields simple {$O(n \log^{*} n)$} algorithms for difficult {$\Omega(n)$} problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	1
, year =	1992
, pages =	"97--111"
, url =	"https://hal.inria.fr/inria-00167206"
, archive =	"XXX:cs.CG/9810007"
, keywords =	"randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon"
, succeeds =	"d-sroa-91"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
, abstract =	"We use here the results on the influence graph
\cite{bdsty-arsol-92} to adapt them for particular cases where additional
information is available.  In some cases, it is possible to improve the
expected randomized complexity of algorithms from $O(n\log n)$ to
$O(n\log^{\star} n)$.  This technique applies in the following
applications~: triangulation of a simple polygon, skeleton of a simple
polygon, Delaunay triangulation of points knowing the EMST (euclidean
minimum spanning tree)."
}

@techreport{d-reidt-92
, author =	"Olivier Devillers"
, title =	"Robust and efficient implementation of the {Delaunay} tree"
, type =	"Report"
, number =	1619
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1992
, url =	"http://www.inria.fr/RRRT/RR-1619"
, keywords =	"randomized algorithms, Delaunay triangulation, practical issue, degenerate cases"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@inproceedings{d-sroa-91
, author =	"Olivier Devillers"
, title =	"Simple randomized {$O(n \log^{*} n)$} algorithms"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"141--144"
, keywords =	"randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon"
, precedes =	"d-rysoa-92"
, cites =	"agss-ltacv-89, bdsty-olgag-91a, c-tsplt-90i, cs-arscg-89, s-sfira-90, ZZZ"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@techreport{d-scspa-90
, author =	"Olivier Devillers"
, title =	"Simultaneous containment of several polygons: analysis of the contact configurations"
, type =	"Report"
, number =	1179
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1990
, url =	"http://www.inria.fr/RRRT/RR-1179"
, keywords =	"polygon placement, contact configurations"
, precedes =	"d-scspa-93"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
}

@article{d-scspa-93
, author =	"Olivier Devillers"
, title =	"Simultaneous containment of several polygons: analysis of the contact configurations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, number =	4
, year =	1993
, pages =	"429--442"
, url =	"http://www-sop.inria.fr/prisme/publis/d-scspa-93.ps.gz"
, keywords =	"motion planning, polygon containment, robotics"
, succeeds =	"d-scspa-90"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
, abstract =	"The main concern of this paper is the detection of double
contact configurations for some polygons moving in translation in a
polygonal environment.  We first establish some general properties about
such configurations and give conditions of existence of double contacts
for two or three objects.  For three convex polygons moving in a polygonal
environment or three simple polygons moving in a rectangle there always
exists a double contact. Two examples without possibility of double
contacts are given, one with three polygons (not convex) moving in a
polygonal environment, and one with four convex polygons moving in a
rectangle.  We deduce an algorithm detecting a double contact position in
time $O(n^2)$ (resp $O(n^3)$) for two (resp three) convex polygons of
constant sizes moving in a non-convex polygon of size $n$."
}

@inproceedings{df-sabls-93
, author =	"Olivier Devillers and Andreas Fabri"
, title =	"Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, year =	1993
, pages =	"277--288"
, precedes =	"df-sabls-96"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell+smid, 93.05 jones"
, abstract =	"We present output-sensitive scalable parallel algorithms
for bichromatic line segment intersection problems for the Coarse Grained
Multicomputer model.  Under the assumption that $n\geq p^2$, where $n$ is
the number of line segments and $p$ the number of processors, we obtain an
intersection counting algorithm with a time complexity of $O(\frac {n \log
n\log p} p + T_s(n\log p,p))$, where $T_s(m,p)$ is the time used to sort
$m$ items on a $p$ processor machine. An additional $O(\frac k p)$ time is
spent on the reporting of the $k$ intersections.  As the sequential
complexity is $O(n\log n)$ and $O(k)$ for counting and reporting,
respectively, we obtain a speedup of $\frac p{\log p}$."
}

@article{df-sabls-96
, author =	"Olivier Devillers and Andreas Fabri"
, title =	"Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"487--506"
, url =	"http://www-sop.inria.fr/prisme/publis/df-sabls-96.ps.gz"
, succeeds =	"df-sabls-93"
, cites =	"adh-cgaiaccl-93, b-sna-68, bt-pdcnm-89, cegs-ablsp-89, cp-dsnlthrc-90, dfr-spgac-93, gsg-pmvsppsp-92, grand-ch, gl-rrft-89, l-ipaa-92, ps-crrbsi-92, ps-cgi-85, rv-ltslsn-87"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers"
, abstract =	"We present output-sensitive scalable parallel algorithms
for bichromatic line segment intersection problems for the Coarse Grained
Multicomputer model.  Under the assumption that $n\geq p^2$, where $n$ is
the number of line segments and $p$ the number of processors, we obtain an
intersection counting algorithm with a time complexity of $O(\frac {n \log
n\log p} p + T_s(n\log p,p))$, where $T_s(m,p)$ is the time used to sort
$m$ items on a $p$ processor machine. An additional $O(\frac k p)$ time is
spent on the reporting of the $k$ intersections.  As the sequential
complexity is $O(n\log n)$ and $O(k)$ for counting and reporting,
respectively, we obtain a speedup of $\frac p{\log p}$."
}

@inproceedings{dfmt-amafe-00
, author =	"Olivier Devillers and Alexandra Fronville and Bernard Mourrain and Monique Teillaud"
, title =	"Algebraic methods and arithmetic filtering for exact predicates on circle arcs"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"139--147"
, cites =	"bp-rpsis-97, bs-ealcs-99, bv-earic-99, svy-crm-99, clo-iva-92, lpt-rpqid-99, p-gacg-99p-iaeia-99, y-tegc-97, y-fpaa-00"
, update =	"02.03 devillers, 00.11 smid, 00.07 devillers, 00.03 devillers"
, abstract =	"The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae of two intersection points of circle arcs, which is known to be a difficult predicate involved in the computation of arrangements of circle arcs. We present an algorithm for deciding the $x$-order of intersections from the signs of the coefficients of a polynomial, obtained by a general approach based on resultants. This method allows the use of efficient arithmetic and filtering techniques leading to fast implementation as shown by the experimental results."
}

@inproceedings{dfmt-amafe-00i
, author =	"Olivier Devillers and Alexandra Fronville and Bernard Mourrain and Monique Teillaud"
, title =	"Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"117--120"
, update =	"02.03 devillers, 00.03 bibrelex"
}

@techreport{dg-cgtp-99
, author =	"Olivier Devillers and Pierre-Marie Gandoin"
, title =	"Compression g\'eom\'etrique pour une transmission progressive"
, type =	"Rapport de recherche"
, number =	3766
, institution =	"INRIA"
, year =	1999
, url =	"http://www-sop.inria.fr/prisme/biblio/"
, archive =	"XXX:cs.CG/9909018"
, cites =	"bb-srmua-97, bg-tdrcs-93, sk-ltrdt-97"
, update =	"99.11 devillers"
, abstract =	"The compression of geometric structures is a relatively new field of data compression. Since about 1995, several articles have dealt with the coding of meshes, using for most of them the following approach: the vertices of the mesh are coded in an order such that it contains partially the topology of the mesh. In the same time, some simple rules attempt to predict the position of the current vertex from the positions of its neighbours that have been previously coded. In this article, we describe a compression algorithm whose principle is completely different: the order of the vertices is used to compress their coordinates, and then the topology of the mesh is reconstructed from the vertices. This algorithm, particularly suited for terrain models, achieves compression factors that are slightly greater than those of the currently available algorithms, and moreover, it allows progressive and interactive transmission of the meshes."
}

@inproceedings{dg-cgit-00
, author =	"Olivier Devillers and Pierre-Marie Gandoin"
, title =	"Geometric Compression for Interactive Transmission"
, booktitle =	"Proc. of IEEE Visualization 2000"
, year =	2000
, pages =	"319--326"
, update =	"01.11 devillers"
}

@inproceedings{dg-dbppl-93
, author =	"Olivier Devillers and Mordecai Golin"
, title =	"Dog Bites Postman: {Point} Location in the Moving {Voronoi} Diagram and Related Problems"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, nickname =	"ESA '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"133--144"
, keywords =	"Voronoi, Delaunay, moving points, randomized algorithms, dynamic algorithms, localisation"
, precedes =	"dg-dbppl-98"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers+smid, 94.01 smid, 93.09 devillers+milone+mitchell"
}

@article{dg-dbppl-98
, author =	"Olivier Devillers and Mordecai Golin"
, title =	"Dog Bites Postman: Point Location in the Moving {Voronoi} Diagram and Related Problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"321--342"
, url =	"http://www-sop.inria.fr/prisme/publis/dg-dbppl.ps.gz"
, succeeds =	"dg-dbppl-93"
, cites =	"ar-vdmph-92, a-vdsfg-91, bdsty-arsol-92, bt-rcdt-93, c-bvdcp-86, cms-frric-92i, cs-arscg-89, d-rysoa-92, dg-dbppl-93, dmt-fddtl-92, dty-dlals-92, egs-oplms-86, fl-vdmpp-91, gt-dtdpl-91, gmr-vdmpp-91, gks-ricdv-92, iklm-cdf3s-93, m-rmstd-91, ms-dplah-91, p-pplr-90, r-dvd-91, r-vdds-92, rn-dvdmp-91, s-dmgsm-91, s-barga-91, s-vdr-92"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.07 devillers"
, abstract =	"In this paper, we discuss two variations of the two-dimensional post-office problem that arise when the post-offices are $n$ postmen moving  with constant velocities.  The first variation addresses the question: given a point $q_0$ and time $t_0$ who is the nearest postman to $q_0$ at  time $t_0?$ We present a randomized incremental data structure that answers the query in expected $O(\log^2 n)$ time.  The second variation views a query point as a dog searching for a postman to bite and finds the  postman that a dog running with speed $v_d$ could reach first.  While it is quite straightforward to design a data structure for the first problem, designing one for the second appears more difficult.  We show that if the dog is quicker than all of the postmen then there is a nice correspondence between the problems. This correspondence will permit us to use the data structure developed for the first problem to solve the second one in $O(\log^2 n)$ time as well.  The proposed structure is semi-dynamic, that is the set of postmen can be modified by inserting new postmen. A fully dynamic structure that also supports deletions can be obtained, but in that case the query time becomes  $O(\log^3 n)$."
}

@inproceedings{dg-iafch-94
, author =	"Olivier Devillers and Mordecai Golin"
, title =	"Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"153--158"
, precedes =	"dg-iafch-95"
, cites =	"a-sdcgp-85, bcddy-acchs-92, r-chada-92, ZZZ"
, update =	"00.03 bibrelex, 99.07 devillers, 98.11 bibrelex, 96.01 devillers, 94.09 jones"
}

@article{dg-iafch-95
, author =	"Olivier Devillers and Mordecai Golin"
, title =	"Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas"
, journal =	"Inform. Process. Lett."
, volume =	56
, number =	3
, year =	1995
, pages =	"157--164"
, url =	"https://hal.inria.fr/inria-00074391"
, succeeds =	"dg-iafch-94"
, cites =	"a-dcgp-85, bcddy-acchs-92, r-chada-92"
, update =	"99.11 devillers, 99.07 devillers, 96.01 devillers"
, abstract =	"The existing $O(n \log n)$ algorithms for finding the convex hulls of circles and the lower envelope of parabolas follow the divide-and-conquer paradigm.  The difficulty with developing incremental algorithms for these problems is that the introduction of a new circle or parabola can cause $\Theta(n)$ structural changes, leading to $\Theta(n^2)$ total structural changes during the running of the algorithm.  In this note we examine the geometry of these problems and show that, if the circles or parabolas are first sorted by appropriate parameters before constructing the  convex hull or  lower envelope incrementally, then each new addition may cause at most 3 changes in an amortized sense.  These observations are then used to develop $O(n \log n)$ incremental algorithms for these problems."
}

@article{dgks-qvdmp-96
, author =	"Olivier Devillers and Mordecai Golin and Klara Kedem and Stefan Schirra"
, title =	"Queries on {Voronoi} Diagrams of Moving Points"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"315--327"
, url =	"http://www-sop.inria.fr/prisme/biblio/search.html"
, succeeds =	"dgks-rdqvd-94i"
, cites =	"ar-vdmph-92, c-sssl-86, dg-dbppl-93, dsst-mdsp-89, fl-vdmpp-91, gt-dtdpl-91, gks-ricdv-92, gmr-vdmpp-91, m-apcad-83, r-vdds-90, r-dvd-91, rn-dvdmp-91, st-pplup-86, sa-dsstg-95, s-vdr-92"
, update =	"99.11 devillers, 99.07 devillers, 97.03 devillers+smid"
, abstract =	"Suppose we are given $n$ moving postmen described by their motion equations $p_i(t) = s_i + v_it,$ $i=1,\ldots, n$, where $s_i \in R^2$ is the position of the $i$'th postman at time $t=0$, and $v_i \in R^2$ is his velocity.  The problem we address is how to preprocess the postmen data so as to be able to efficiently answer two types of nearest-neighbor queries.  The first one asks ``who is the nearest postman at time $t_q$ to a dog located at point $s_q$. In the second type a query dog is located at point $s_q$ at time $t_q$, its speed is $v_q>|v_i|$ (for all $i=1, \ldots , n$), and we want to know which postman the dog can catch first.    The first type of query is relatively simple to address, the second type at first seems much more complicated.  We show that the problems are very closely related, with  efficient solutions to the first type of query leading to efficient solutions to the second.  We then present two solutions to these problems, with tradeoff between preprocessing time and query time.  Both solutions use deterministic data structures."
}

@techreport{dgks-rdqvd-94t
, author =	"Olivier Devillers and Mordecai Golin and Klara Kedem and Stefan Schirra"
, title =	"Revenge of the Dog: Queries on {Voronoi} Diagrams of Moving Points"
, type =	"Report"
, number =	"MPI-I-94-149"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, note =	"also INRIA-2329"
, precedes =	"dgks-rdqvd-94i"
, update =	"99.07 devillers, 97.03 devillers, 95.01 smid"
}

@inproceedings{dgks-rdqvd-94i
, author =	"Olivier Devillers and Mordecai Golin and K. Kedem and S. Schirra"
, title =	"Revenge of the Dog: Queries on {Voronoi} Diagrams of Moving Points"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"122--127"
, succeeds =	"dgks-rdqvd-94t"
, precedes =	"dgks-qvdmp-96"
, cites =	"c-sssl-86, dg-dbppl-93, dsst-mdsp-89, fl-vdmpp-91, gks-ricdv-92, gmr-vdmpp-92, gt-dtdpl-91, m-apcad-83, st-pplup-86, ZZZ"
, update =	"99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers+smid, 95.01 smid, 94.09 jones"
}

@article{dg-sb-01
, author =	"Olivier Devillers and Philippe Guigue"
, title =	"The shuffling buffer"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"555--572"
, update =	"02.03 devillers"
}

@article{dk-olbps-99
, author =	"Olivier Devillers and Matthew Katz"
, title =	"Optimal Line Bipartitions of Point Sets"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, year =	1999
, pages =	"39--51"
, url =	"http://www-sop.inria.fr/prisme/biblio/search.html"
, succeeds =	"dk-olbps-96"
, cites =	"as-pglp-94, abky-cabmm-88, a-dp-86, cms-frric-93, gks-sgsop-95, hr-tcpp-93, hs-ftp-91, jk-eaetc-94, k-iagoe-95, ks-ebago-93, mw-fobpp-91, ms-ppgmm-91, ol-mcp-81, ps-cgi-85, rww-obps-92, s-nlap2-96"
, update =	"99.11 devillers, 99.07 devillers, 99.03 devillers, 97.11 katz"
, abstract =	"Let $S$ be a set of $n$ points in the plane.  We study the following problem: Partition $S$ by a line into two subsets $S_a$ and $S_b$ such that $max\{f(S_a), f(S_b)\}$ is minimal, where $f$ is any monotone function defined over $2^S$.  We first present a solution to the case where the points in $S$ are the vertices of a convex polygon and apply it to some common cases --- $f(S')$ is the perimeter, area, or width of the convex hull of $S' \subseteq S$ --- to obtain linear solutions (or $O(n\log n)$ solutions if the convex hull of $S$ is not given) to the corresponding problems.  This solution is based on an efficient procedure for finding a minimal entry in matrices of some special type, which we believe is of independent interest.  For the general case we present a linear space solution which is in some sense output sensitive. It yields solutions to the perimeter and area cases that are never slower and often faster than the best previous solutions."
}

@inproceedings{dk-olbps-96
, author =	"Olivier Devillers and Matthew J. Katz"
, title =	"Optimal line bipartitions of point sets"
, booktitle =	"Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
, year =	1996
, pages =	"45--54"
, precedes =	"dk-olbps-99"
, update =	"99.07 devillers, 99.03 devillers, 97.11 katz"
}

@inproceedings{dlpt-ccpps-97
, author =	"Olivier Devillers and Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
, title =	"Checking the Convexity of Polytopes and the Planarity of Subdivisions"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"186--199"
, precedes =	"dlpt-ccpps-98"
, update =	"99.07 bibrelex, 99.03 devillers, 98.07 tamassia+vismara"
}

@article{dlpt-ccpps-98
, author =	"Olivier Devillers and Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
, title =	"Checking the Convexity of Polytopes and the Planarity of Subdivisions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	11
, year =	1998
, pages =	"187--208"
, url =	"http://www-sop.inria.fr/prisme/biblio/search.html"
, keywords =	"graph drawing, planar, straight-line, checking"
, succeeds =	"dlpt-ccpps-97"
, cites =	"-dcgs-, bbdgt-ccgg-97, bo-arcgi-79, bk-dpcw-95, b-ecvdl-96, c-tsplt-91a, dtv-olcpt-95, dtv-olcpt-95t, dv-aptg-96, f-slrpg-48, glm-othsr-96, h-gt-72, ht-ept-74, k-eops-88, ll-abgtc-87, lpt-rpqid-97, lpt-rpqid-99, mn-cgs-96, mnssssu-cgpvg-96, mnssssu-cgpvg-97, swm-ccr-95, y-tegc-97"
, update =	"99.11 devillers, 99.03 devillers, 98.11 tamassia"
, abstract =	"This paper considers the problem of verifying the correctness of geometric structures. In particular, we design simple optimal checkers for convex polytopes in two and higher dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Their performance is analyzed also in terms of the algorithmic degree, which characterizes the arithmetic precision required."
}

@techreport{dmt-fddtl-91t
, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
, title =	"Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
, type =	"Technical Report"
, number =	1349
, institution =	"INRIA"
, year =	1991
, succeeds =	"dmt-fddtl-92"
, precedes =	"dmt-fddtl-91"
, update =	"99.07 devillers, 98.11 bibrelex"
}

@inproceedings{dmt-fddtl-91
, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
, title =	"Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"42--53"
, keywords =	"randomized algorithms, Delaunay triangulation, dynamizing datastructures"
, succeeds =	"dmt-fddtl-91t"
, precedes =	"dmt-fddtl-92"
, update =	"02.03 icking, 99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@article{dmt-fddtl-92
, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
, title =	"Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"55--80"
, url =	"http://www-sop.inria.fr/prisme/publis/dmt-fddtl-92.ps.gz"
, keywords =	"randomized algorithms, Delaunay triangulation, dynamizing datastructures"
, succeeds =	"dmt-fddtl-91"
, precedes =	"dmt-fddtl-91t"
, update =	"02.03 icking, 99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
, abstract =	"The Delaunay Tree is a hierarchical data structure that has been introduced in \cite{bt-hrodt-86} and analyzed in\cite{bt-rcdt-93,bdsty-arsol-92}.  For a given set of sites  in the planeand an order of insertion for these sites, the Delaunay Tree stores allthe successive Delaunay triangulations.  As proved before, the DelaunayTree allows the insertion of a site in logarithmic expected time andlinear expected space, when the insertion sequence is randomized.  In thispaper, we describe an algorithm maintaining the Delaunay Tree underinsertions and deletions of sites.  This can be done in $O(\log n)$expected time for an insertion and $O(\log\log n)$ expected time for adeletion, where $n$ is the number of sites currently present in thestrucuture.  For deletions, by expected time, we mean averaging over allalready inserted sites for the choice of the deleted sites.  The algorithmhas been effectively coded and experimental results are given."
}

@techreport{dmt-ssgtu-92t
, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
, title =	"The space of spheres, a geometric tool to unify duality results on {Voronoi} diagrams"
, type =	"Report"
, number =	1620
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1992
, url =	"http://www.inria.fr/RRRT/RR-1620"
, precedes =	"dmt-ssgtu-92i"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@inproceedings{dmt-ssgtu-92
, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
, title =	"The Space of Spheres, a Geometric Tool to Unify Duality Results on {Voronoi} Diagrams"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"45--49"
, update =	"00.03 bibrelex"
}

@inproceedings{dmt-ssgtu-92i
, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
, title =	"The space of spheres, a geometric tool to unify duality results on {Voronoi} diagrams"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"263--268"
, keywords =	"duality results, generalized Voronoi diagrams, geometric transforms, upper/lower envelopes"
, succeeds =	"dmt-ssgtu-92t"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.05 smid"
}

@inproceedings{dm-gvvge-92
, author =	"Olivier Devillers and Naji Mouawad"
, title =	"Guarding vertices versus guarding edges in a simple polygon"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"99--102"
, cites =	"c-ctpg-75, ll-ccagp-86, ea-lacvp-81, gj-cigtn-79, o-agta-87, ZZZ"
, update =	"99.07 devillers, 98.07 bibrelex"
}

@article{dm-focoh-99
, author =	"Olivier Devillers and Asish Mukhopadhyay"
, title =	"Finding an ordinary conic and an ordinary hyperplane"
, journal =	"Nordic J. Comput."
, volume =	6
, year =	1999
, pages =	"422--428"
, url =	"http://www-sop.inria.fr/prisme/biblio/"
, archive =	"XXX/cs.CG/9909017"
, succeeds =	"dm-focm-98"
, update =	"00.03 devillers"
}

@techreport{dm-focm-98
, author =	"Olivier Devillers and Asish Mukhopadhyay"
, title =	"Finding an ordinary conic and more"
, type =	"Research {Report}"
, number =	3517
, institution =	"INRIA"
, year =	1998
, url =	"http://www-sop.inria.fr/prisme/biblio/"
, archive =	"XXX:cs.CG/9909017"
, precedes =	"dm-focoh-99"
, update =	"00.03 devillers, 99.11 devillers"
, abstract =	"Given a finite set of non-collinear points in the plane there exists a line that passes through exactly two points. Such a line is called an {\em ordinary line}. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et al.  In this note we extend this result in two directions. We first show how to use this algorithm to compute an {\em ordinary conic}, that is, a conic passing through exactly five points, assuming that all the points do not lie onthe same conic. Our proof of existence and the consequent algorithm is simpler than previous ones. We also show how to compute an ordinary hyperplane in three and higher dimensions."
}

@inproceedings{dpt-wt-01
, author =	"Olivier Devillers and Sylvain Pion and Monique Teillaud"
, title =	"Walking in a triangulation"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"106--114"
, update =	"01.07 devillers"
}

@techreport{dp-papaf-96
, author =	"Olivier Devillers and Franco P. Preparata"
, title =	"A Probabilistic Analysis of the Power of Arithmetic Filters"
, type =	"Technical Report"
, number =	"CS-96-27"
, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-27.ps.Z"
, keywords =	"arithmetic filter, robustness, probabilistic analysis, geometric predicate, CGC, Brown"
, precedes =	"dp-papaf-98"
, update =	"99.11 devillers, 99.07 devillers, 97.07 devillers, 97.03 tamassia"
}

@article{dp-papaf-98
, author =	"Olivier Devillers and Franco P. Preparata"
, title =	"A probabilistic analysis of the power of arithmetic filters"
, journal =	"Discrete Comput. Geom."
, volume =	20
, year =	1998
, pages =	"523--547"
, url =	"https://hal.inria.fr/inria-00090653"
, archive =	"XXX:cs.CG/9907029"
, succeeds =	"dp-papaf-96"
, cites =	"b-g-87, bkmnsu-egcl-95, bms-hcvdl-94, fv-eeacg-93, lpt-rpqiv-96, mn-iga-94, y-tegc-97"
, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.11 devillers+tamassia, 97.07 devillers"
, abstract =	"The assumption of real-number arithmetic, which is at the
basis of conventional geometric algorithms, has been seriously
challenged in recent years, since digital computers do not exhibit such
capability.  A geometric predicate  usually consists of evaluating the
sign of some algebraic expression.  In most cases, rounded computations
yield a reliable result, but sometimes rounded arithmetic introduces
errors which may invalidate the algorithms. The rounded arithmetic may
produce an incorrect result only if the exact  absolute value of the
algebraic expression is smaller than some (small) $\varepsilon$, which
represents the largest error that may arise in the evaluation of the
expression. The threshold $\varepsilon$ depends on the  structure of the
expression and on the adopted computer arithmetic, assuming that the
input operands are error-free.  A pair (arithmetic engine,threshold) is
an {\em arithmetic filter}.  In this paper we develop a general
technique for assessing the efficacy of an arithmetic filter. The
analysis consists of evaluating both the threshold and the probability
of failure of the filter.  To exemplify the approach, under the
assumption that the input points be chosen randomly in a unit ball or
unit cube with uniform density, we analyze the two important predicates
``which-side'' and ``insphere''.  We show that the probability that the
absolute values of the corresponding determinants be no larger than some
positive value $V$, with emphasis on small $V$, is $\Theta(V)$ for the
which-side predicate, while for the insphere predicate it is
$\Theta(V^{\frac{2}{3}})$ in dimension 1,$O(V^{\frac{1}{2}})$ in
dimension 2, and $O(V^{\frac{1}{2}}\ln \frac{1}{V})$ in higher
dimensions.  Constants are small, and are given in the paper."
}

@inproceedings{dp-ecncp-00
, author =	"Olivier Devillers and Franco P. Preparata"
, title =	"Evaluating the cylindricity of a nominally cylindrical point set"
, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA"
, year =	2000
, pages =	"518--527"
, update =	"00.03 devillers"
}

@inproceedings{dp-frafg-99i
, author =	"Olivier Devillers and Franco P. Preparata"
, title =	"Further Results on Arithmetic Filters for Geometric Predicates"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"113--116"
, archive =	"XXX:cs.CG/9907028"
, precedes =	"dp-frafg-99a"
, update =	"00.03 bibrelex, 99.11 devillers, 99.07 bibrelex"
}

@article{dp-frafg-99a
, author =	"Olivier Devillers and Franco P. Preparata"
, title =	"Further Results on Arithmetic Filters for Geometric Predicates"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"141--148"
, url =	"http://www-sop.inria.fr/prisme/biblio/search.html"
, archive =	"XXX:cs.CG/9907028"
, succeeds =	"dp-frafg-99i"
, cites =	"dp-papaf-98"
, update =	"00.03 devillers, 99.11 devillers"
, abstract =	"An efficient technique to solve precision problems consists in using exact computations.  For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters.  The predicate is first evaluated using rounding computations, and an error estimation gives a certificate of the validity of the result.  In this note, we studies the statistical efficiency of filters for cosphericity predicate with an assumption of regular distribution of the points. We prove that the expected value of the polynomial corresponding to the in sphere test is greater than $\epsilon$ with probability $O(\epsilon \log \frac{1}{\epsilon})$ improving the results of a previous paper \cite{dp-papaf-98}."
}

@article{dty-dlals-92
, author =	"Olivier Devillers and Monique Teillaud and Mariette Yvinec"
, title =	"Dynamic location in an arrangement of line segments in the plane"
, journal =	"Algorithms Rev."
, volume =	2
, number =	3
, year =	1992
, pages =	"89--103"
, keywords =	"randomized algorithms, arrangement of line-segments, dynamizing data structures"
, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@article{dw-sddsm-89
, author =	"M. P. Devine and D. Wood"
, title =	"{SEPARATION} in $d$ dimensions, or strip mining in asteroid fields"
, journal =	"Comput. Graph."
, volume =	13
, year =	1989
, pages =	"329--336"
}

@book{d-lnba-86
, author =	"L. Devroye"
, title =	"Lecture Notes on Bucket Algorithms"
, publisher =	"Birkh{\"a}user Verlag"
, address =	"Boston, MA"
, year =	1986
, keywords =	"book"
}

@article{d-essgc-88
, author =	"L. Devroye"
, title =	"On the expected size of some graphs in computational geometry"
, journal =	"Comput. Math. Appl."
, volume =	15
, year =	1988
, pages =	"53--64"
}

@article{d-oenpr-91
, author =	"L. Devroye"
, title =	"On the oscillation of the expected number of points on a random convex hull"
, journal =	"Statistics and Probability Letters"
, volume =	11
, year =	1991
, pages =	"281--286"
}

@article{des-grih-93
, author =	"Luc Devroye and P. Epstein and J.-R. Sack"
, title =	"On Generating Random Intervals and Hyperrectangles"
, journal =	"J. Computat. Graph. Statistics"
, volume =	2
, number =	3
, year =	1993
, pages =	"291--307"
, update =	"96.01 held"
}

@article{dl-arddq-90
, author =	"L. Devroye and L. Laforest"
, title =	"An analysis of random $d$-dimensional quadtrees"
, journal =	"SIAM J. Comput."
, volume =	19
, year =	1990
, pages =	"821--832"
}

@article{dmz-npldt-98
, author =	"Luc Devroye and Ernst Peter M{\"u}cke and Binhai Zhu"
, title =	"A Note on Point Location in {Delaunay} Triangulations of Random Points"
, journal =	"Algorithmica"
, volume =	22
, year =	1998
, pages =	"477--482"
, comments =	"replaces the old, wrong entry dmz-npldt-95"
, update =	"99.03 bibrelex, 97.11 bibrelex"
}

@incollection{dw-nnmd-82
, author =	"L. Devroye and T. J. Wagner"
, title =	"Nearest neighbor methods in discrimination"
, editor =	"P. R. Krishnan and L. N. Kanal"
, booktitle =	"Handbook of Statistics"
, volume =	2
, publisher =	"North-Holland"
, year =	1982
, update =	"97.07 agarwal"
}

@article{dz-irls-94
, author =	"L. Devroye and B. Zhu"
, title =	"Intersections of random line segments"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"261--274"
, keywords =	"probabilistic analysis, computational geometry, intersections of line segments, asymptotic analysis, algorithmic complexity, incidence graph"
, update =	"96.09 devillers"
}

@article{d-nfchm-80
, author =	"L. P. Devroye"
, title =	"A note on finding convex hulls via maximal vectors"
, journal =	"Inform. Process. Lett."
, volume =	11
, year =	1980
, pages =	"53--56"
}

@article{d-netrc-85
, author =	"L. P. Devroye"
, title =	"A note on the expected time required to construct the outer layer"
, journal =	"Inform. Process. Lett."
, volume =	20
, year =	1985
, pages =	"255--257"
}

@incollection{d-etaac-85
, author =	"L. P. Devroye"
, title =	"Expected time analysis of algorithms in computational geometry"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"135--151"
}

@article{d-hracc-81
, author =	"L. P. Devroye"
, title =	"How to reduce the average complexity of convex hull finding algorithms"
, journal =	"Comput. Math. Appl."
, volume =	7
, year =	1981
, pages =	"299--308"
}

@article{d-mirvc-83
, author =	"L. P. Devroye"
, title =	"Moment inequalities for random variables in computational geometry"
, journal =	"Computing"
, volume =	30
, year =	1983
, pages =	"111--119"
}

@article{d-acsba-81
, author =	"L. P. Devroye"
, title =	"On the average complexity of some bucketing algorithms"
, journal =	"Comput. Math. Appl."
, volume =	7
, year =	1981
, pages =	"407--412"
}

@article{d-cgrch-82
, author =	"L. P. Devroye"
, title =	"On the computer generation of random convex hulls"
, journal =	"Comput. Math. Appl."
, volume =	8
, year =	1982
, pages =	"1--13"
}

@inproceedings{d-rratb-81
, author =	"L. P. Devroye"
, title =	"Recent results on the average time behavior of some algorithms in computational geometry"
, booktitle =	"Proc. 13th Sympos. Interface: Comput. Sci. Statist."
, year =	1981
, pages =	"76--82"
}

@techreport{d-srats-81
, author =	"L. P. Devroye"
, title =	"Some results on the average time for sorting and searching in {$R^{2}$}"
, type =	"Report"
, number =	"??"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1981
}

@article{dt-nleta-81
, author =	"L. P. Devroye and G. T. Toussaint"
, title =	"A note on linear expected time algorithms for finding convex hulls"
, journal =	"Computing"
, volume =	26
, year =	1981
, pages =	"361--366"
, succeeds =	"dt-eafch-78"
}

@techreport{dt-eafch-78
, author =	"L. P. Devroye and G. T. Toussaint"
, title =	"Elimination algorithms for finding convex hulls in linear expected running time with radial densities"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1978
, precedes =	"dt-nleta-81"
}

@techreport{d-cnnst-77
, author =	"A. K. Dewdney"
, title =	"Complexity of nearest neighbour searching in three and higher dimensions"
, type =	"Report"
, number =	28
, institution =	"Dept. Comput. Sci., Univ. Western Ontario"
, address =	"London, ON"
, year =	1977
}

@article{d-ege3s-77
, author =	"A. K. Dewdney"
, title =	"Embedding graphs in {Euclidean} $3$-space"
, journal =	"Amer. Math. Monthly"
, volume =	84
, year =	1977
, pages =	"372--373"
}

@article{d-egtds-80
, author =	"A. K. Dewdney"
, title =	"Embedding graphs in three-dimensional space"
, journal =	"Ars Combin."
, volume =	9
, year =	1980
, pages =	"77--90"
, update =	"95.09 korneenko"
}

@article{d-edg-80
, author =	"A. K. Dewdney"
, title =	"The embedding dimension of a graph"
, journal =	"Ars Combin."
, volume =	9
, year =	1980
, pages =	"77--90"
}

@article{dv-cprac-77
, author =	"A. K. Dewdney and J. K. Vranch"
, title =	"A convex partition of {$R^{3}$} with applications to {Crum}'s problem and {Knuth}'s post-office problem"
, journal =	"Utilitas Math."
, volume =	12
, year =	1977
, pages =	"193--199"
, keywords =	"Voronoi diagram, proximity, searching"
, update =	"97.11 bibrelex"
}

@inproceedings{dvw-chtma-95
, author =	"Don Dewhirst and Sreedhar Vangavolu and Harley Wattrick"
, title =	"The Combination of Hexahedral and Tetrahedral Meshing Algorithms"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"291--304"
, update =	"96.01 samitchell"
}

@inproceedings{dbs-gttd-91
, author =	"T. Dey and C. Bajaj and K. Sugihara"
, title =	"On Good Triangulations in Three Dimensions"
, booktitle =	"Proc. Symposium on Solid Modeling and CAD/CAM Applications"
, organization =	"ACM/SIGGRAPH"
, month =	jun
, year =	1991
, note =	"To appear"
, update =	"97.11 bibrelex"
}

@article{degn-tpec-98
, author =	"Tamal Dey and Herbert Edelsbrunner and Sumanta Guha and Dmitry Nekhayev"
, title =	"Topology preserving edge contraction. Geometric combinatorics"
, journal =	"Publ. Inst. Math. (Beograd) (N.S.)"
, volume =	66
, year =	1999
, pages =	"23--45"
, update =	"01.07 wenger"
}

@techreport{dp-epgh-94
, author =	"T. Dey and J. Pach"
, title =	"Extremal problems for geometric hypergraphs"
, type =	"Manuscipt"
, institution =	"??"
, year =	1994
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@techreport{d-ntcpd-93
, author =	"T. K. Dey"
, title =	"A new technique to compute polygonal schema for 2-manifolds and null-homotopy detection"
, type =	"manuscript"
, year =	1993
, precedes =	"ds-ntcps-94, d-ntcps-94"
, update =	"98.11 bibrelex"
}

@inproceedings{d-ntcps-94
, author =	"T. K. Dey"
, title =	"A New Technique to Compute Polygonal Schema for $2$-Manifolds with Application to Null-Homotopy Detection"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"277--284"
, succeeds =	"d-ntcpd-93"
, cites =	"ds-ntcps-94, de-iabns-93, g-gsh-77, hs-aacsl-91, my-chthu-88, s-dcc-92, s-tacg-90, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@phdthesis{d-dptd-91
, author =	"T. K. Dey"
, title =	"Decompositions of polyhedra in three dimensions"
, school =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1991
, note =	"Technical Report CSD-TR-91-056"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{d-gtp-90
, author =	"T. K. Dey"
, title =	"Good triangulations in the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"102--106"
, cites =	"ba-acfem-76, bgr-ntp-88, c-gqtm-89, e-stdac-89, f-cfemg-72, ll-gdtpg-86, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{d-ibkkl-97
, author =	"T. K. Dey"
, title =	"Improved Bounds for {$k$-Sets} and {$k$-th} levels"
, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '97"
, year =	1997
, pages =	"156--161"
, update =	"98.07 agarwal+bibrelex, 98.03 agarwal+mitchell"
}

@article{d-ibpks-98
, author =	"T. K. Dey"
, title =	"Improved bounds on planar $k$-sets and related problems"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"373--382"
, update =	"98.07 agarwal"
}

@inproceedings{d-ctdd-92
, author =	"T. K. Dey"
, title =	"On counting triangulations in $d$ dimensions"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"280--285"
, precedes =	"d-ctdd-93"
, cites =	"acns-cfs-82, de-cschh-92, gp-ubcpr-86, k-mts-88, s-ubccr-75, ZZZ"
, update =	"98.07 agarwal+bibrelex, 96.09 devillers"
}

@article{d-ctdd-93
, author =	"T. K. Dey"
, title =	"On counting triangulations in $d$ dimensions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"315--325"
, succeeds =	"d-ctdd-92"
, update =	"98.07 agarwal, 96.09 devillers"
}

@inproceedings{d-oadnh-93
, author =	"T. K. Dey"
, title =	"Optimal algorithms to detect null-homologous cycles on $2$-manifolds"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"273--278"
, precedes =	"d-oadnh-97"
, cites =	"d-ntcpd-93, de-iabns-93, m-ati-77, m-eat-84, s-dcc-92, s-tacg-90, vy-cccs-90, ZZZ"
, update =	"98.11 bibrelex, 98.07 agarwal, 97.07 devillers, 93.09 milone+mitchell"
}

@article{d-oadnh-97
, author =	"T. K. Dey"
, title =	"Optimal algorithms to detect null-homologous cycles on $2$-manifolds"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"167--174"
, succeeds =	"d-oadnh-93"
, update =	"98.07 agarwal, 97.07 devillers"
}

@inproceedings{d-tcrpa-91
, author =	"T. K. Dey"
, title =	"Triangulation and {CSG} representation of polyhedra with arbitrary genus"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"364--372"
, keywords =	"polyhedron"
, cites =	"bd-pnr-90, bd-cdpr-90, c-cpplb-84, cp-tncp-90, dbs-gttd-91, dghs-eafcr-88, egs-ccmfa-90, e-acg-87, egppss-acptc-88, k-rmrs-89, py-ebsph-90, p-hresr-84, rs-dt3dn-89, ZZZ"
, update =	"98.07 agarwal+bibrelex, 97.11 bibrelex"
}

@article{dbs-gttd-92
, author =	"T. K. Dey and C. L. Bajaj and K. Sugihara"
, title =	"On good triangulations in three dimensions"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	1
, year =	1992
, pages =	"75--95"
, keywords =	"Delaunay triangulation, mesh generation"
}

@inproceedings{ddg-thc-94
, author =	"T. K. Dey and M. B. Dillencourt and S. K. Ghosh"
, title =	"Triangulating with High Connectivity"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"339--343"
, precedes =	"ddgc-thc-97"
, cites =	"c-clps-85, dett-adgab-93t, d-hcptn-90, l-cpt-90, ys-fpgdc-93, ZZZ"
, update =	"98.11 bibrelex, 97.07 devillers, 94.09 jones"
}

@article{ddgc-thc-97
, author =	"T. K. Dey and M. B. Dillencourt and S. K. Ghosh and J. Cahill"
, title =	"Triangulating with High Connectivity"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"39--56"
, succeeds =	"ddg-thc-94"
, update =	"97.07 devillers"
}

@techreport{de-cschh-92
, author =	"T. K. Dey and H. Edelsbrunner"
, title =	"Counting simplex crossings and halving hyerplanes"
, type =	"Manuscript"
, institution =	"??"
, year =	1992
, update =	"98.07 bibrelex"
}

@inproceedings{de-ctchp-93
, author =	"T. K. Dey and H. Edelsbrunner"
, title =	"Counting triangle crossings and halving planes"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"270--273"
, cites =	"acns-cfs-82, abfk-pswen-91, acegsw-ptphp-91, bfl-nhp-89, e-acg-87, e-ibith-91, elss-dgpps-73, r-mkkde-21, vz-ctpci-92, ZZZ"
, update =	"98.03 bibrelex, 95.01 smid, 93.09 jones"
}

@article{de-ctchp-94
, author =	"T. K. Dey and H. Edelsbrunner"
, title =	"Counting triangle crossings and halving planes"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"281--289"
, update =	"95.01 smid"
}

@inproceedings{deg-ct-99
, author =	"Tamal K. Dey and Herbert Edelsbrunner and Sumanta Guha"
, title =	"Computational topology"
, editor =	"Bernard Chazelle and Jacob E. Goodman and Richard Pollack"
, booktitle =	"Advances in Discrete and Computational Geometry - Proc. 1996 AMS-IMS-SIAM Joint Summer Research Conf. Discrete and Computational Geometry: Ten Years Later"
, series =	"Contemporary Mathematics"
, number =	223
, publisher =	"American Mathematical Society"
, year =	1999
, pages =	"109--143"
, update =	"01.07 devillers"
}

@inproceedings{dfr-sralt-01
, author =	"Tamal K. Dey and Stefan Funke and Edgar A. Ramos"
, title =	"Surface Reconstruction in Almost Linear Time under Locally Uniform Sampling"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"129--132"
, update =	"01.04 icking"
}

@inproceedings{dg-amsce-96
, author =	"Tamal K. Dey and Sumanta Guha"
, title =	"Algorithms for Manifolds and Simplicial Complexes in {Euclidean} 3-Space"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '96"
, site =	"Philadelphia, PA"
, month =	may
, year =	1996
, pages =	"398--407"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{dg-oacs-95
, author =	"Tamal K. Dey and Sumanta Guha"
, title =	"Optimal algorithms for curves on surfaces"
, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '95"
, site =	"Milwaukee, Wisconsin"
, year =	1995
, pages =	"266--274"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 95.09 mitchell"
, annote =	"To appear in JCSS, with new title: Transforming Curves on Surfaces"
}

@inproceedings{dk-spacr-99
, author =	"T. K. Dey and P. Kumar"
, title =	"A simple provable algorithm for curve reconstruction"
, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '99"
, month =	jan
, year =	1999
, pages =	"893--894"
, update =	"00.03 orourke"
}

@unpublished{dl-srs-99
, author =	"T. K. Dey and N. Leekha"
, title =	"Surface reconstruction simplified"
, month =	dec
, year =	1999
, note =	"Manuscript"
, update =	"00.03 orourke"
}

@inproceedings{dmr-crcdgr-99
, author =	"T. K. Dey and K. Mehlhorn and E. A. Ramos"
, title =	"Curve reconstruction: {C}onnecting dots with good reason"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"197--206"
, update =	"00.03 orourke"
}

@article{dmr-crcdg-00
, author =	"T. K. Dey and K. Mehlhorn and E. A. Ramos"
, title =	"Curve reconstruction: {Connecting} dots with good reason"
, journal =	"Comput. Geom. Theory Appl."
, volume =	15
, year =	2000
, pages =	"229--244"
, succeeds =	"ekns-ddsfo-97"
, update =	"00.03 smid"
}

@unpublished{dpp-agpvr-95
, author =	"T. K. Dey and S. P. Pal and D. C. Prasad"
, title =	"Art gallery problems for visibility with reflection"
, year =	1995
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@techreport{ds-ntcps-94
, author =	"T. K. Dey and H. Schipper"
, title =	"A new technique to compute polygonal schema for $2$-manifolds with application to null-homotopy detection"
, type =	"Manuscript"
, institution =	"??"
, year =	1994
, succeeds =	"d-ntcpd-93"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{ds-nscr-95
, author =	"Tamal K. Dey and Nimish R. Shah"
, title =	"On the Number of Simplicial Complexes in {$\Re^d$}"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"31--36"
, update =	"95.09 jones"
}

@article{dsb-dttdf-92
, author =	"T. K. Dey and K. Sugihara and C. L. Bajaj"
, title =	"Delaunay triangulations in three dimensions with finite precision arithmetic"
, journal =	"Comput. Aided Geom. Design"
, volume =	9
, year =	1992
, pages =	"457--470"
, keywords =	"Delaunay triangulation, robustness"
, update =	"93.09 dey"
}

@inproceedings{dw-rcsc-00
, author =	"Tamal K. Dey and Rephael Wenger"
, title =	"Reconstructing Curves with Sharp Corners"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"233--241"
, update =	"00.11 jones"
}

@article{dw-rcsc-01
, author =	"T. K. Dey and R. Wenger"
, title =	"Reconstructing Curves with Sharp Corners"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"89--99"
, update =	"01.11 smid"
}

@article{df-sd-86
, author =	"M. Deza and P. Frankl"
, title =	"On squashed designs"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"379--390"
}

@inproceedings{do-mpams-92
, author =	"A. Dhagat and J. O'Rourke"
, title =	"Motion planning amidst movable square blocks"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"188--191"
, keywords =	"motion planning"
, cites =	"w-mppmo-91, ZZZ"
, update =	"00.03 orourke, 98.07 bibrelex"
, abstract =	"Proves that planning motion for a robot who can
		push square blocks, when some blocks are moveable and
		others immobile, is NP-hard.  The paper erroneously claims
		to establish NP-completeness but never establishes
		membership in NP.  Subsequently the result was
		strengthened in bos-mpams-94 to PSPACE hard."
}

@article{dj-cccsp-73
, author =	"S. W. Dharmadhikari and K. Jogdeo"
, title =	"A characterization of convexity and central symmetry for planar polygonal sets"
, journal =	"Israel J. Math."
, volume =	15
, year =	1973
, pages =	"356--366"
, update =	"97.11 bibrelex"
}

@proceedings{d-gd-97
, title =	"Graph Drawing (Proc. GD '97)"
, editor =	"G. {Di Battista}"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, keywords =	"graph drawing, collection"
, update =	"99.07 vismara, 98.11 bibrelex, 98.07 patrignani+tamassia+vismara"
}

@proceedings{defrt-gd93p-93
, title =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
, editor =	"G. {Di Battista} and P. Eades and H. de Fraysseix and P. Rosenstiehl and R. Tamassia"
, year =	1993
, url =	"ftp://ftp.cs.brown.edu/pub/gd94/gd-92-93/gd93-v2.ps.Z"
, keywords =	"graph drawing, collection"
, update =	"98.11 bibrelex, 98.07 vismara, 95.09 tamassia, 94.05 schwarzkopf, 94.01 tamassia, 95 tamassia"
}

@techreport{dett-adgab-93
, author =	"G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
, title =	"Algorithms for drawing graphs: an annotated bibliography"
, type =	"Preprint"
, number =	""
, institution =	"Dept. Comput. Sci., Brown Univ."
, address =	"Providence, RI"
, month =	nov
, year =	1993
, note =	"Preliminary version available via anonymous {\tt ftp} from
		{\tt wilma.cs.brown.edu}, {\tt gdbiblio.tex.Z} and
		{\tt gdbiblio.ps.Z} in {\tt /pub/papers/compgeo}."
, keywords =	"graph drawing, graph theory, computer graphics, bibliography"
, succeeds =	"et-adgab-89, dett-adgab-93t"
, precedes =	"dett-adgab-94"
, update =	"98.11 bibrelex, 95.01 smid, 94.01 tamassia"
}

@techreport{dett-adgab-93t
, author =	"G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
, title =	"Algorithms for drawing graphs: an annotated bibliography"
, type =	"manuscript"
, month =	jun
, year =	1993
, precedes =	"dett-adgab-93, dett-adgab-94"
, update =	"98.11 bibrelex"
}

%, number =	5
@article{dett-adgab-94
, author =	"G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
, title =	"Algorithms for drawing graphs: an annotated bibliography"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"235--282"
, keywords =	"graph drawing, graph theory, computer graphics, bibliography"
, succeeds =	"dett-adgab-93, dett-adgab-93t"
, update =	"98.11 bibrelex, 95.01 smid+tamassia"
}

@book{dett-gd-99
, author =	"G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
, title =	"Graph Drawing"
, publisher =	"Prentice Hall"
, address =	"Upper Saddle River, NJ"
, year =	1999
, keywords =	"graph drawing"
, update =	"98.11 vismara, 98.07 tamassia"
}

@techreport{dglpttvv-ddage-96
, author =	"G. {Di Battista} and A. Garg and G. Liotta and A. Parise and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
, title =	"Drawing Directed Acyclic Graphs: An Experimental Study"
, type =	"Technical Report"
, number =	"CS-96-24"
, institution =	"Center for Geometric Computing, Dept. Comput. Sci., Brown Univ."
, month =	oct
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-24.ps.Z"
, keywords =	"graph drawing, upward, experiments, CGC, Brown"
, update =	"98.07 vismara, 97.11 bibrelex, 97.03 tamassia"
}

@inproceedings{dglpttvv-ddage-97
, author =	"G. {Di Battista} and A. Garg and G. Liotta and A. Parise and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
, title =	"Drawing Directed Acyclic Graphs: An Experimental Study"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"76--91"
, url =	"http://www.cs.brown.edu/cgc/papers/dglpttvv-ddges-97.ps.gz"
, keywords =	"graph drawing, upward, experiments, CGC, Brown"
, update =	"98.07 patrignani+tamassia+vismara, 97.11 bibrelex, 97.03 tamassia"
}

@article{dglpttvv-ddage-00
, author =	"Giuseppe {Di Battista} and Ashim Garg and Giuseppe Liotta and Armando Parise and Roberto Tamassia and Emanuele Tassinari and Francesco Vargiu and Luca Vismara"
, title =	"Drawing Directed Acyclic Graphs: An Experimental Study"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, number =	6
, year =	2000
, pages =	"623--648"
, succeeds =	"dglpttvv-ddage-96, dglpttvv-ddage-97"
, update =	"01.04 vismara"
}

@unpublished{dglttv-ecfgd-96
, author =	"G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
, title =	"An Experimental Comparison of Four Graph Drawing Algorithms"
, type =	"Manuscript"
, institution =	"Dept. of Computer Sci., Brown University"
, year =	1996
, url =	"http://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
, keywords =	"graph drawing, experiments, orthogonal"
, precedes =	"dglttv-ecfgd-97"
, update =	"97.03 tamassia, 96.09 tamassia"
}

% also claimed, pages =	"303--326"
@article{dglttv-ecfgd-97
, author =	"G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
, title =	"An Experimental Comparison of Four Graph Drawing Algorithms"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"303--325"
, url =	"http://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
, keywords =	"graph drawing, experiments, orthogonal, CGC, Brown"
, succeeds =	"dglttv-ecfgd-96"
, update =	"98.07 patrignani+tamassia+vismara, 97.07 devillers, 97.03 tamassia, 96.09 tamassia"
}

@inproceedings{dglttv-ectgd-95
, author =	"G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
, title =	"An Experimental Comparison of Three Graph Drawing Algorithms"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"306--315"
, url =	"http://www.cs.brown.edu/cgc/papers/dglttv-ectgd-95.ps.gz"
, keywords =	"graph drawing, experiments, orthogonal"
, cites =	"bcn-cdder-92, bfn-wigdp-85, bnt-ladfd-86, bbdl-tealf-91, bk-bhogd-94, con-dpgn-85, cp-ltadp-90, celr-tdgd-95, dh-dgnus-89, fpp-sssfe-88, fr-scpdt-84, dett-adgab-94, dgst-ads-90, dlv-sorod-93, dlt-pepg-84, eg-rpdfb-94, eg-glbdb-95, fr-gdfdp-91, gs-ssa-79, gnv-dptdd-88, h-celag-94, h-ggpig-95, jemwdt-npgda-91, jm-mpsne-96, k-vaor-89, kk-adgug-89, k-dpgul-92, k-adpg-93, k-mcvr-93, kb-pgap-92, l-aeglv-80, lmp-sbeac-94, lmps-trm1b-90, lms-gtrre-91, lms-la3be-93, nt-fapsd-84, pt-iabod-95, r-nmdpg-87, rt-rplbo-86, s-mncpe-84, stt-mvuhs-81, t-eggmn-87, tdb-agdrd-88, tt-uavrp-86, tt-pgelt-89, tt-gd-95, t-dgds-88, t-hdg-63, v-ucvc-81, w-npagt-90, w-cblsg-85, w-dpg-82, ZZZ"
, update =	"01.04 icking, 98.11 bibrelex, 98.03 bibrelex, 97.03 tamassia, 96.09 tamassia, 95.05 tamassia"
}

@techreport{dglttvv-ddges-96
, author =	"G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
, title =	"Drawing Directed Graphs: An Experimental Study"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Brown Univ."
, year =	1996
, keywords =	"graph drawing, experiments, upward"
, update =	"98.07 vismara, 96.09 tamassia"
}

@inproceedings{dgst-ads-90
, author =	"G. {Di Battista} and A. Giammarco and G. Santucci and R. Tamassia"
, title =	"The Architecture of {Diagram} {Server}"
, booktitle =	"Proc. IEEE Workshop on Visual Languages"
, nickname =	"VL '90"
, year =	1990
, pages =	"60--65"
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 95.05 tamassia, 93.09 tamassia"
}

@inproceedings{dll-pds-95
, author =	"G. {Di Battista} and W. Lenhart and G. Liotta"
, title =	"Proximity Drawability: a Survey"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"328--339"
, keywords =	"graph drawing, proximity, survey"
, update =	"95.01 tamassia"
}

@inproceedings{dl-upcfm-98
, author =	"G. {Di Battista} and G. Liotta"
, title =	"Upward Planarity Checking: ``{F}aces Are More than Polygons''"
, editor =	"S. H. Whitesides"
, booktitle =	"Graph Drawing (Proc. GD~'98)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1547
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"72--86"
, update =	"99.07 vismara, 99.03 patrignani+vismara, 98.11 vismara"
}

@inproceedings{dlsv-ds-92
, author =	"G. {Di Battista} and G. Liotta and M. Strani and F. Vargiu"
, title =	"{Diagram} {Server}"
, booktitle =	"Proc. Advanced Visual Interfaces"
, series =	"World Scientific Series in Computer Science"
, volume =	36
, year =	1992
, pages =	"415--417"
, keywords =	"graph drawing"
, update =	"95.05 tamassia, 94.01 tamassia, 93.09 tamassia"
}

@article{dlv-ds-95
, author =	"G. {Di Battista} and G. Liotta and F. Vargiu"
, title =	"{Diagram Server}"
, journal =	"J. Visual Lang. Comput."
, volume =	6
, number =	3
, year =	1995
, pages =	"275--298"
, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
, keywords =	"graph drawing, system"
, update =	"96.09 tamassia, 95.09 agarwal+devillers, 95.05 tamassia"
}

@article{dlv-sood-98
, author =	"G. {Di Battista} and G. Liotta and F. Vargiu"
, title =	"Spirality and Optimal Orthogonal Drawings"
, journal =	"SIAM J. Comput."
, volume =	27
, number =	6
, year =	1998
, pages =	"1764--1811"
, succeeds =	"dlv-sorod-93,lvd-odmnb-94"
, update =	"99.03 vismara"
}

@inproceedings{dlv-sorod-93
, author =	"G. {Di Battista} and G. Liotta and F. Vargiu"
, title =	"Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and $3$-Planar Graphs"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"151--162"
, update =	"99.11 bibrelex, 94.05 tamassia"
}

@inproceedings{dlw-swp-96
, author =	"G. {Di Battista} and G. Liotta and S. H. Whitesides"
, title =	"The Strength of Weak Proximity"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, nickname =	"GD '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"178--189"
, url =	"http://www.cs.brown.edu/cgc/papers/dlw-swp-96.ps.gz"
, keywords =	"graph drawing"
, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 tamassia, 96.09 tamassia"
}

@article{dlr-bgudp-90
, author =	"G. {Di Battista} and W. P. Liu and I. Rival"
, title =	"Bipartite Graphs Upward Drawings and Planarity"
, journal =	"Inform. Process. Lett."
, volume =	36
, year =	1990
, pages =	"317--322"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{dm-ntgds-99
, title =	"New Trends in Graph Drawing: Special Issue on Selected Papers from the 1997 {S}ymposium on {G}raph {D}rawing"
, editor =	"Giuseppe {Di Battista} and Petra Mutzel"
, journal =	"J. Graph Algorithms Appl."
, volume =	"3:4"
, year =	1999
, url =	"http://www.cs.brown.edu/publications/jgaa/papers.html"
, update =	"00.03 vismara"
}

@book{dm-spgd-
, title =	"Special Issue on Selected Papers from the 1997 Symposium on Graph Drawing"
, editor =	"G. {Di Battista} and P. Mutzel"
, series =	"J. Graph Algorithms Appl."
, note =	"To appear"
, keywords =	"graph drawing, collection"
, update =	"98.11 tamassia"
}

% Bernierd June 1986
@inproceedings{dn-atphg-87
, author =	"G. {Di Battista} and E. Nardelli"
, title =	"An Algorithm for Testing Planarity of Hierarchical Graphs"
, editor =	"G. Tinhofer and G. Schmidt"
, booktitle =	"Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	246
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"277--289"
, keywords =	"graph drawing"
, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
}

@article{dn-hpt-88
, author =	"G. {Di Battista} and E. Nardelli"
, title =	"Hierarchies and Planarity Theory"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	18
, number =	6
, year =	1988
, pages =	"1035--1046"
, keywords =	"graph drawing upward planar"
, update =	"95.05 tamassia, 93.09 tamassia"
}

@inproceedings{dpv-spa3d-98
, author =	"Giuseppe {Di Battista} and Maurizio Patrignani and Francesco Vargiu"
, title =	"A {Split \& Push} Approach to {3D} Orthogonal Drawing"
, editor =	"S. H. Whitesides"
, booktitle =	"Graph Drawing (Proc. GD '98)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1547
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"87--101"
, keywords =	"graph drawing, orthogonal, three-dimensional"
, update =	"99.03 patrignani"
}

@inproceedings{dptt-alpdx-89
, author =	"G. {Di Battista} and E. Pietrosanti and R. Tamassia and I. G. Tollis"
, title =	"Automatic Layout of {PERT} Diagrams with {XPERT}"
, booktitle =	"Proc. IEEE Workshop on Visual Languages"
, nickname =	"VL '89"
, year =	1989
, pages =	"171--176"
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 93.09 tamassia"
}

@article{dt-aprad-88
, author =	"G. {Di Battista} and R. Tamassia"
, title =	"Algorithms for Plane Representations of Acyclic Digraphs"
, journal =	"Theoret. Comput. Sci."
, volume =	61
, year =	1988
, pages =	"175--198"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{dt-igsda-86
, author =	"G. {Di Battista} and R. Tamassia"
, title =	"An Integrated Graphic System for Designing and Accessing Statistical Data Bases"
, booktitle =	"Proc. 7th Sympos. on Computational Statistics"
, nickname =	"COMPSTAT 1986"
, publisher =	"Physica-Verlag"
, year =	1986
, pages =	"231--236"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{dt-ipt-89
, author =	"G. {Di Battista} and R. Tamassia"
, title =	"Incremental Planarity Testing"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"436--441"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{dt-olgas-90
, author =	"G. {Di Battista} and R. Tamassia"
, title =	"On-Line Graph Algorithms with {SPQR}-Trees"
, editor =	"M. S. Paterson"
, booktitle =	"Automata, Languages and Programming (Proc. 17th ICALP)"
, series =	"Lecture Notes Comput. Sci."
, volume =	443
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"598--611"
, update =	"98.07 tamassia+vismara, 95.05 tamassia, 94.01 tamassia"
}

@techreport{dt-olmtc-92
, author =	"G. {Di Battista} and R. Tamassia"
, title =	"On-Line Maintenance of Triconnected Components with {SPQR}-Trees"
, type =	"Report"
, number =	"CS-92-40"
, institution =	"Comput. Sci. Dept., Brown Univ."
, address =	"Providence, RI"
, year =	1992
, note =	"Submitted for publication."
, succeeds =	"dt-olgas-90"
, update =	"95.05 tamassia, 94.05 tamassia"
}

@article{dt-olmtc-96
, author =	"G. {Di Battista} and R. Tamassia"
, title =	"On-Line Maintenance of Triconnected Components with {SPQR}-Trees"
, journal =	"Algorithmica"
, volume =	15
, year =	1996
, pages =	"302--318"
, succeeds =	"dt-olgas-90, dt-olmtc-92"
, update =	"98.07 vismara, 97.11 bibrelex, 97.03 tamassia"
}

@techreport{dt-olpt-92
, author =	"G. {Di Battista} and R. Tamassia"
, title =	"On-Line Planarity Testing"
, type =	"Report"
, number =	"CS-92-39"
, institution =	"Comput. Sci. Dept., Brown Univ."
, address =	"Providence, RI"
, year =	1992
, succeeds =	"dt-ipt-89"
, precedes =	"dt-olpt-96"
, update =	"97.03 smid, 94.05 tamassia"
}

@article{dt-olpt-96
, author =	"G. {Di Battista} and R. Tamassia"
, title =	"On-Line Planarity Testing"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"956--997"
, keywords =	"graph drawing"
, succeeds =	"dt-ipt-89, dt-olpt-92"
, update =	"97.03 smid+tamassia, 95.01 tamassia"
}

@book{dt-sigrg-98
, title =	"Special Issue on Geometric Representations of Graphs"
, editor =	"G. {Di Battista} and R. Tamassia"
, series =	"Comput. Geom. Theory Appl."
, volume =	"9:1--2"
, year =	1998
, keywords =	"graph drawing, collection"
, update =	"98.07 vismara, 95.09 tamassia"
}

@book{dt-sigd-96
, title =	"Special Issue on Graph Drawing"
, editor =	"G. {Di Battista} and R. Tamassia"
, series =	"Algorithmica"
, volume =	"16:1"
, year =	1996
, keywords =	"graph drawing, collection"
, update =	"98.07 vismara, 95.09 tamassia"
}

@inproceedings{dtt-arsdd-89
, author =	"G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"Area requirement and symmetry display in drawing graphs"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"51--60"
, keywords =	"graph drawing"
, cites =	"con-dpgn-85, cnao-laepg-85, cp-ltadp-90, dt-aprad-88, dlt-pepg-84, e-hgd-84, et-adgab-89, f-slrpg-48, fpp-sssfe-88, gy-tsr-83, ht-ept-74, hp-callc-79, k-vrrpd-75, kr-pl-75, k-fpos-87, lec-aptg-67, lns-mdg-85, ma-fddso-86, ma-fddst-88, r-nmdpg-87, rt-tdt-81, ru-roptc-88, rt-rplbo-86, s-epgg-90, s-cm-51, sr-vudtd-34, s-mncpe-84, sr-cdtn-83, tt-uavrp-86, t-eggmn-87, tt-eepgl-87, tdb-agdrd-88, t-hdg-63, w-bzv-36, w-dpg-82, ZZZ"
, update =	"01.04 icking, 98.03 bibrelex, 93.09 tamassia"
}

@article{dtt-arsdp-92
, author =	"G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"Area Requirement and Symmetry Display of Planar Upward Drawings"
, journal =	"Discrete Comput. Geom."
, volume =	7
, number =	4
, year =	1992
, pages =	"381--401"
, keywords =	"graph drawing"
, update =	"98.11 bibrelex, 93.09 tamassia"
}

@article{dtt-cvrg-92
, author =	"G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"Constrained Visibility Representations of Graphs"
, journal =	"Inform. Process. Lett."
, volume =	41
, year =	1992
, pages =	"1--7"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{dtt-pdad-88
, author =	"G. {Di Battista} and R. Tamassia and I. G. Tollis"
, title =	"On planar drawings of acyclic digraphs"
, type =	"Report"
, number =	"UTDCS 7-88"
, institution =	"Comput. Sci. Program., Univ. Texas Dallas"
, address =	"Richardson, TX"
, year =	1988
}

@techreport{dtv-olcpt-95t
, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
, title =	"On-Line Convex Planarity Testing"
, type =	"Technical Report"
, number =	"CS-95-26"
, institution =	"Dept. Comput. Sci., Brown Univ."
, month =	aug
, year =	1995
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/95/cs95-26.ps.Z"
, update =	"98.07 vismara, 97.03 tamassia"
}

@inproceedings{dtv-olcpt-95
, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
, title =	"On-Line Convex Planarity Testing"
, booktitle =	"Graph-Theoretic Concepts in Computer Science (Proc. WG '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	903
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"242--255"
, keywords =	"graph drawing"
, update =	"98.07 vismara, 94.05 tamassia"
}

@techreport{dtv-osrdp-96t
, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
, title =	"Output-Sensitive Reporting of Disjoint Paths"
, type =	"Technical Report"
, number =	"CS-96-25"
, institution =	"Dept. Computer Science, Brown Univ."
, month =	aug
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-25.ps.Z"
, update =	"98.07 vismara"
}

@inproceedings{dtv-osrdp-96i
, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
, title =	"Output-Sensitive Reporting of Disjoint Paths"
, booktitle =	"Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '96"
, site =	"Hong Kong"
, series =	"Lecture Notes Comput. Sci."
, volume =	1090
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"81--91"
, url =	"http://www.cs.brown.edu/cgc/papers/dtv-osrdp-96.ps.gz"
, update =	"99.11 bibrelex, 98.07 vismara, 97.03 tamassia"
}

@article{dtv-osrdp-99
, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
, title =	"Output-Sensitive Reporting of Disjoint Paths"
, journal =	"Algorithmica"
, volume =	23
, number =	4
, year =	1999
, pages =	"302--340"
, succeeds =	"dtv-osrdp-96i, dtv-osrdp-96t"
, update =	"99.03 vismara, 98.11 tamassia"
, annote =	"Special Issue of Selected Papers from the 2nd Annual International Computing and Combinatorics Conference"
}

@inproceedings{dv-aptg-93
, author =	"G. {Di Battista} and L. Vismara"
, title =	"Angles of Planar Triangular Graphs"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '93"
, year =	1993
, pages =	"431--437"
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 97.03 agarwal, 93.09 milone+mitchell+tamassia"
}

@article{dv-aptg-96
, author =	"G. {Di Battista} and L. Vismara"
, title =	"Angles of Planar Triangular Graphs"
, journal =	"SIAM J. Discrete Math."
, volume =	9
, number =	3
, year =	1996
, pages =	"349--359"
, update =	"97.03 tamassia"
}

@inproceedings{dm-dfich-86
, author =	"V. {Di Gesu} and M. C. Maccarone"
, title =	"Description of fuzzy images by convex hull technique"
, booktitle =	"Proc. 8th IEEE Internat. Conf. Pattern Recogn."
, year =	1986
, pages =	"1276--1278"
}

@inproceedings{d-islas-94
, author =	"Mario Dias"
, title =	"Intersection of Straight Lines with Algebraic Surfaces in {NC-SAVE}"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"38--40"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{do-accac-89
, author =	"M. D{\'\i}az and J. O'Rourke"
, title =	"Algorithms for computing the center of area of a convex polygon"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	46
}

@article{do-accac-94
, author =	"M. D{\'\i}az and J. O'Rourke"
, title =	"Algorithms for computing the center of area of a convex polygon"
, journal =	"Visual Comput."
, volume =	10
, year =	1994
, pages =	"432--442"
, keywords =	"convexity, centerpoints"
, succeeds =	"do-accac-89"
, update =	"95.01 smid"
}

@incollection{do-cccp-91
, author =	"M. D{\'\i}az and J. O'Rourke"
, title =	"Chord center for convex polygons"
, editor =	"B. Melter and A. Rosenfeld and P. Bhattacharyai"
, booktitle =	"Computational Vision"
, publisher =	"American Mathematical Society"
, year =	1991
, pages =	"29--44"
, keywords =	"convexity, centerpoints"
, update =	"94.01 orourke"
}

@inproceedings{do-ccap-89
, author =	"M. D{\'\i}az and J. O'Rourke"
, title =	"Computing the center of area of a polygon"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"171--182"
, keywords =	"convexity, centerpoints"
, update =	"95.01 smid, 94.01 smid"
}

@techreport{do-ccasp-89
, author =	"M. D{\'\i}az and J. O'Rourke"
, title =	"Computing the center of area of a simple polygon"
, type =	"Technical {Report}"
, number =	"89-03"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1989
, keywords =	"convexity, centerpoints"
, update =	"95.01 smid"
}

@inproceedings{do-hssp-90
, author =	"M. D{\'\i}az and J. O'Rourke"
, title =	"Ham-sandwich sectioning of polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"282--286"
, keywords =	"convexity, centerpoints, ham-sandwich"
, cites =	"do-hssp-90t, e-acg-87, eos-calha-86, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{do-hssp-90t
, author =	"M. G. D{\'\i}az and J. O'Rourke"
, title =	"Ham-sandwich sectioning of polygons"
, type =	"Technical {Report}"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1990
, note =	"In preparation"
, update =	"98.07 bibrelex"
}

@techreport{dm-fnalm-94
, author =	"M. Dickerson and M. Montague"
, title =	"Fast new algorithms for locally minimum triangulations - and a platform for testing them"
, type =	"Manuscript"
, institution =	"??"
, year =	1994
, update =	"98.03 bibrelex"
}

@inproceedings{ds-opcpm-96
, author =	"Matthew Dickerson and Daniel Scharstein"
, title =	"Optimal placement of convex polygons to maximize point containment"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"114--121"
, keywords =	"motion planning, polygon containment, arrangements, output-sensitive algorithms, bucketing"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@article{ds-opcpm-98
, author =	"Matthew Dickerson and Daniel Scharstein"
, title =	"Optimal placement of convex polygons to maximize point containment"
, journal =	"Comput. Geom. Theory Appl."
, volume =	11
, year =	1998
, pages =	"1--16"
, succeeds =	"ds-opcpm-96"
, update =	"98.11 devillers"
}

@inproceedings{ds-rdocp-96
, author =	"Matthew Dickerson and Daniel Scharstein"
, title =	"The rotation diagram and optimal containing placements of a convex polygon"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V9--V10"
, cites =	"ds-opcpm-96, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{d-rlegt-92
, author =	"M. T. Dickerson"
, title =	"Rank of the longest edge in the greedy triangulation"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"182--187"
, cites =	"dd-frnns-90, dd-ekdnp-91, g-nrpt-79, g-segta-89, k-ndot-80, ll-abgtc-87, l-abigt-86, l-tspp-77, mz-ngndt-79, ps-cgi-85, mz-pmhfa-83, r-slcdn-70, s-sisie-91, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{dd-ekdnp-91
, author =	"M. T. Dickerson and R. L. Drysdale"
, title =	"Enumerating $k$ distances for $n$ points in the plane"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"234--238"
, keywords =	"Delaunay triangulation, proximity, enumeration"
, precedes =	"dds-saeid-92"
, cites =	"aass-sdp-90, bfprt-tbs-73, c-ntcos-85, dd-frnns-90, s-mmdpsl-90t, sh-cpp-75, y-cmstk-82, ZZZ"
, update =	"97.11 bibrelex, 93.09 drysdale"
}

@article{dds-saeid-92
, author =	"M. T. Dickerson and R. L. Drysdale and J. R. Sack"
, title =	"Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"221--239"
, keywords =	"enumeration, selection, Delaunay triangulation, nearest neighbors"
, succeeds =	"dd-ekdnp-91"
, update =	"94.01 smid"
}

@inproceedings{ddmw-fgta-94
, author =	"M. T. Dickerson and R. L. S. Drysdale and S. A. McElfresh and Emo Welzl"
, title =	"Fast Greedy Triangulation Algorithms"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"211--220"
, cites =	"agss-ltacv-89, bsw-cffrn-77, c-cdt-87, cl-aldt-84, dfsv-apcg-92, d-rlegt-92, dd-frnns-90, dds-saeid-92, dg-aivib-70, g-nrpt-79, g-segta-89, hp-nrmwt-92, k-ndot-80, k-mtpd-80, ll-gdtpg-86, ls-ekcpo-92i, l-olbng-87, ll-abgtc-87, ll-fagt-92, ll-gtamw-92, l-gdtan-86, l-abigt-86, l-nhmwt-87, l-gtcbe-89, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, ph-hta-87, ps-cgi-85, s-eis-92, w-eucdt-93, wa-srr3d-86, ws-oacdt-87, y-cdcrc-75, ZZZ"
, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
}

@article{dd-frnns-90
, author =	"M. T. Dickerson and R. S. Drysdale"
, title =	"Fixed-radius near neighbor search algorithms for points and segments"
, journal =	"Inform. Process. Lett."
, volume =	35
, year =	1990
, pages =	"269--273"
, keywords =	"near neighbor search, Delaunay triangulation"
, update =	"93.09 drysdale"
}

@article{de-apphd-96
, author =	"M. T. Dickerson and D. Eppstein"
, title =	"Algorithms for proximity problems in higher dimensions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1996
, pages =	"277--291"
, update =	"96.05 smid"
}

@inproceedings{dmm-naefm-95
, author =	"Matthew T. Dickerson and Scott A. McElfresh and Mark H. Montague"
, title =	"New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"238--247"
, keywords =	"greedy triangulation, experimental"
, cites =	"bs-plibp-94, bsw-cffrn-77, ddmw-fgta-94, dm-fnalm-94, dra-sltgt-95, g-nrpt-79, g-segta-89, hp-nrmwt-94, k-mtpd-80, ll-fagt-92, l-nhmwt-87, l-gtcbe-89, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, o-cgc-94, w-eucdt-93, w-oagts-94, wa-srr3d-86, y-cdcrc-75, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 97.03 schwarzkopf, 95.09 mitchell"
}

@inproceedings{dm-ucsmw-96
, author =	"Matthew T. Dickerson and Mark H. Montague"
, title =	"A (Usually?) Connected Subgraph of the Minimum Weight Triangulation"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"204--213"
, cites =	"aatr-tin-95, cx-alesw-96, cgt-ecabs-95, cn-asla-85, dj-wtacg-89, ddmw-fgta-94, dmm-naefm-95, eorw-fmakg-92, gj-cigtn-79, g-nrpt-79, k-csmwt-94, k-mtpd-80, yxy-cdapp-94, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{ds-ekldn-92
, author =	"M. T. Dickerson and J. Shugart"
, title =	"Enumerating $k$ longest distances for $n$ points in the plane"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"137--142"
, cites =	"aass-sdp-90, bey-eedt-91a, bfprt-tbs-73, c-ntcos-85, c-mcsrv-72, dd-ekdnp-91, d-hdvdl-91, ki-fkbdn-91, mz-pmhfa-83, ps-cgi-85, s-lisps-89, s-sisie-91, sh-cpp-75, y-cmstk-82, yb-cf-61, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{dl-gitco-97
, author =	"Walter Didimo and Antonio Leonforte"
, title =	"{GRID}: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"309--315"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{dl-codve-98
, author =	"W. Didimo and G. Liotta"
, title =	"Computing Orthogonal Drawings in a Variable Embedding Setting"
, editor =	"K.-Y. Chwa and O. H. Ibarra"
, booktitle =	"Algorithms and Computation (Proc. ISAAC~'98)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1533
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"79--88"
, update =	"00.03 vismara, 99.03 vismara"
}

@article{dk-rpipt-91
, author =	"V. J. Dielissen and A. Kaldewaij"
, title =	"Rectangular partition is polynomial in two dimensions but {NP}-complete in three"
, journal =	"Inform. Process. Lett."
, volume =	38
, year =	1991
, pages =	"1--6"
, update =	"94.09 franciosa"
, abstract =	"The inherent computational complexity of polygon
decomposition problems is of importance in the field of
computational geometry. For one of these problems it is shown that
the three dimensional version is NP-complete whereas its two
dimensional version is polynomial. This provides an example for the
conjecture posed by O'Rourke and Supowit \cite{os-snhpd-83}."
}

@book{d-csfs-93
, author =	"P. Dierckx"
, title =	"Curve and Surface Fitting with Splines"
, publisher =	"Clarendon Press"
, address =	"New York"
, year =	1993
, update =	"96.09 orourke"
}

@article{bdv-snest-91
, author =	"A. Bialostocki, P. Dierken and B. Voxman"
, title =	"Some notes on the {Erd{\H{o}}s-Szekeres} theorem"
, journal =	"Discrete Math."
, volume =	91
, year =	1991
, pages =	"231--238"
, update =	"02.03 devillers"
}

@article{d-sppt-87
, author =	"R. Diestel"
, title =	"A separating property of planar triangulations"
, journal =	"J. Graph Theory"
, volume =	11
, number =	1
, year =	1987
, pages =	"43--52"
, keywords =	"triangulation"
, update =	"95.09 korneenko"
}

@article{dnsg-toosp-89
, author =	"W. C. Dietrich and L. R. Nackman and C. J. Sundaresan and F. Gracer"
, title =	"{TGMS}: {An} object-oriented system for programming geometry"
, journal =	"Softw. -- Pract. Exp."
, volume =	19
, number =	10
, year =	1989
, pages =	"978--1013"
, keywords =	"implementation"
, update =	"95.09 korneenko"
}

@phdthesis{d-iga-84
, author =	"P. Dietz"
, title =	"Intersection graph algorithms"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1984
, note =	"Technical Report TR 84-628"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@incollection{d-fpa-89
, author =	"P. F. Dietz"
, title =	"Fully persistent arrays"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, year =	1989
, pages =	"67--74"
, keywords =	"data structuring, persistent"
, update =	"97.11 smid, 95.09 korneenko"
}

@incollection{dr-par-91
, author =	"P. F. Dietz and R. Raman"
, title =	"Persistence, amortization and randomization"
, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"78--88"
, keywords =	"data structuring, persistent, probabilistic analysis, amortized analysis"
, update =	"95.09 korneenko"
}

@inproceedings{ds-tamol-87
, author =	"P. F. Dietz and D. D. Sleator"
, title =	"Two Algorithms for Maintaining Order in a List"
, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
, year =	1987
, pages =	"365--372"
, update =	"95.05 tamassia"
}

@article{d-lbss-89
, author =	"M. Dietzfelbinger"
, title =	"Lower Bounds for Sorting of Sums"
, journal =	"Theoret. Comput. Sci."
, volume =	66
, year =	1989
, pages =	"137--155"
, keywords =	"lower bounds, comparison trees, sorting {$X+Y$}"
, update =	"93.09 erickson"
}

@inproceedings{dgmp-phfr-92
, author =	"M. Dietzfelbinger and J. Gil and Y. Matias and N. Pippenger"
, title =	"Polynomial hash functions are reliable"
, booktitle =	"ICALP"
, month =	jul
, year =	1992
, pages =	"235--246"
, update =	"98.11 bibrelex"
}

@techreport{dhkp-rracp-93
, author =	"M. Dietzfelbinger and T. Hagerup and J. Katajainen and M. Penttonen"
, title =	"A reliable randomized algorithm for the closest-pair problem"
, type =	"Report"
, number =	513
, institution =	"Dept. Comput. Sci., Univ. Dortmund"
, address =	"Dortmund, Germany"
, year =	1993
, update =	"94.05 smid"
}

@article{dhkp-rracp-97
, author =	"M. Dietzfelbinger and T. Hagerup and J. Katajainen and M. Penttonen"
, title =	"A reliable randomized algorithm for the closest-pair problem"
, journal =	"J. Algorithms"
, volume =	25
, year =	1997
, pages =	"19--51"
, update =	"97.11 smid"
}

@inproceedings{dkmmrt-dphul-88
, author =	"M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. {Meyer auf der Heide} and H. Rohnert and R. E. Tarjan"
, title =	"Dynamic perfect hashing --- upper and lower bounds"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"524--531"
, update =	"93.09 erickson"
}

@article{dkmmrt-dphul-94
, author =	"M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. {Meyer auf der Heide} and H. Rohnert and R. E. Tarjan"
, title =	"Dynamic perfect hashing: upper and lower bounds"
, journal =	"SIAM J. Comput."
, volume =	23
, year =	1994
, pages =	"738--761"
, update =	"98.03 smid"
}

@misc{dm-tlbai-86
, author =	"M. Dietzfelbinger and W. Maass"
, title =	"Two lower bound arguments with inaccessible numbers"
, year =	1986
, pages =	"163--183"
, keywords =	"lower bounds"
, update =	"95.09 korneenko"
}

@inproceedings{dm-nuchf-90
, author =	"M. Dietzfelbinger and F. {Meyer auf der Heide}"
, title =	"A new universal class of hash functions and dynamic hashing in real time"
, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	443
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"6--19"
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@inproceedings{dm-sesms-93
, author =	"M. Dietzfelbinger and F. {Meyer auf der Heide}"
, title =	"Simple, Efficient Shared Memory Simulations"
, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
, year =	1993
, pages =	"110--119"
, update =	"96.09 orourke"
}

% yes, "connexion"
@article{d-ntpcg-59
, author =	"E. W. Dijkstra"
, title =	"A Note on Two Problems in Connexion with Graphs"
, journal =	"Numerische Mathematik"
, volume =	1
, year =	1959
, pages =	"269--271"
, update =	"93.09 rote"
}

@incollection{d-pchtd-77
, author =	"E. W. Dijkstra"
, title =	"The problem of the convex hull in three dimensions"
, chapter =	24
, editor =	"E. W. Dijkstra"
, booktitle =	"A Discipline of Programming"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1977
, pages =	"168--191"
}

@inproceedings{ddsv-espgt-88
, author =	"K. Diks and H. N. Dijdjev and O. Sykora and I. Vrto"
, title =	"Edge separators for planar graphs and their applications"
, booktitle =	"Proc. 13th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	324
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"280--290"
, update =	"98.03 bibrelex"
}

@article{d-fpfnh-93
, author =	"K. Dill"
, title =	"Folding proteins: {Finding} a needle in a haystack"
, journal =	"Current Opinion in Structural Biology"
, volume =	3
, year =	1993
, pages =	"99--103"
, update =	"98.07 bibrelex"
}

@techreport{d-nhndt-86
, author =	"M. Dillencourt"
, title =	"A non-{Hamiltonian}, nondegenerate {Delaunay} Triangulation"
, type =	"Technical {Report}"
, number =	"CS-TR-1732"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1986
, update =	"98.03 bibrelex"
}

@techreport{d-tdt-87t
, author =	"M. Dillencourt"
, title =	"Toughness and {Delaunay} Triangulations"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1987
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@inproceedings{dms-mnitp-93
, author =	"M. Dillencourt and D. M. Mount and A. Saalfeld"
, title =	"On the maximum number of intersections of two polyhedra in $2$ and $3$ dimensions"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"49--54"
, cites =	"fdfh-cgpp-90, ps-cgi-85, ZZZ"
, update =	"98.11 bibrelex, 95.09 agarwal, 93.09 milone+mitchell"
}

@article{d-nhndt-87
, author =	"M. B. Dillencourt"
, title =	"A non-{Hamiltonian}, nondegenerate {Delaunay} triangulation"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"149--151"
}

@techreport{d-ubsei-87
, author =	"M. B. Dillencourt"
, title =	"An upper bound on the shortness exponent of inscribable polytopes"
, type =	"Report"
, number =	"CS-TR-1868"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1987
}

@article{d-ubsei-89
, author =	"M. B. Dillencourt"
, title =	"An upper bound on the shortness exponent of inscribable polytopes"
, journal =	"J. Combin. Theory Ser. B"
, volume =	46
, number =	1
, month =	feb
, year =	1989
, pages =	"66--83"
, update =	"98.11 bibrelex"
}

@inproceedings{d-fhcdt-92
, author =	"M. B. Dillencourt"
, title =	"Finding {Hamiltonian} cycles in {Delaunay} triangulations is {NP}-complete"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"223--228"
}

@techreport{d-gtpaidt-88
, author =	"M. B. Dillencourt"
, title =	"Graph-Theoretical Properties of Algorithms Involving {D}elaunay Triangulations"
, number =	"CS-TR-2059"
, institution =	"Institute for Advanced Computer Studies, University of Maryland"
, year =	1988
, update =	"98.07 tamassia+vismara"
}

@article{d-hcptn-90
, author =	"M. B. Dillencourt"
, title =	"Hamiltonian cycles in planar triangulations with no separating triangles"
, journal =	"J. Graph Theory"
, volume =	14
, number =	1
, year =	1990
, pages =	"31--49"
, update =	"98.11 bibrelex"
}

@techreport{d-psoth-
, author =	"M. B. Dillencourt"
, title =	"Polytopes of small order and their {Hamiltonian} properties"
, type =	"Technical {Report}"
, institution =	"Univ. California"
, address =	"Irvine, CA"
, year =	"??"
, update =	"97.11 bibrelex"
}

@article{d-rdt-90
, author =	"M. B. Dillencourt"
, title =	"Realizability of {Delaunay} triangulations"
, journal =	"Inform. Process. Lett."
, volume =	33
, number =	6
, month =	feb
, year =	1990
, pages =	"283--287"
, update =	"98.11 bibrelex"
}

@inproceedings{d-tdt-87
, author =	"M. B. Dillencourt"
, title =	"Toughness and {Delaunay} triangulations"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, site =	"Waterloo, ON"
, year =	1987
, pages =	"186--194"
, precedes =	"d-tdt-90"
, cites =	"b-hg-78, b-gstds-84, b-vdch-79, c-tghc-73, d-slsv-34, d-tscan-87, d-nhndt-86, d-tdt-87t, es-vda-85, h-gt-69, k-tscan-83, obw-cdnh-84, ps-cgi-85, s-cg-78, ZZZ"
, update =	"98.03 bibrelex"
}

@article{d-tdt-90
, author =	"M. B. Dillencourt"
, title =	"Toughness and {Delaunay} triangulations"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"575--601"
, succeeds =	"d-tdt-87"
}

@article{d-tscan-87
, author =	"M. B. Dillencourt"
, title =	"Traveling salesman cycles are not always subgraphs of {Delaunay} triangulations or of minimum weight triangulations"
, journal =	"Inform. Process. Lett."
, volume =	24
, year =	1987
, pages =	"339--342"
}

@techreport{dmn-rass-90
, author =	"M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
, title =	"A randomized algorithm for slope selection"
, type =	"report"
, number =	"CS-TR-2431"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	mar
, year =	1990
, precedes =	"dmn-rass-91, dmn-rass-92"
, update =	"98.07 bibrelex"
}

@inproceedings{dmn-rass-91
, author =	"M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
, title =	"A randomized algorithm for slope selection"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"135--140"
, succeeds =	"dmn-rass-90"
, cites =	"ahu-daca-74, b-etsh-90, csss-otass-89, dba-nm-74, dmn-rass-90, dh-nbp-83, em-sstcd-90, es-cmsrl-90, iky-ltall-89, m-ltalp-83, r-msr-84, s-gspi-76, ss-tseal-87, t-mlpra1-50, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@article{dmn-rass-92
, author =	"M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
, title =	"A randomized algorithm for slope selection"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, year =	1992
, pages =	"1--27"
, keywords =	"slope selection, randomized algorithm, Theil Sen estimator, line fitting, robust estimation"
, succeeds =	"dmn-rass-90, dmn-rass-91"
, update =	"98.07 bibrelex"
}

@techreport{drs-csdtp-91
, author =	"M. B. Dillencourt and I. Rivin and W. D. Smith"
, title =	"Combinatorial structure of {Delaunay} triangulations of the plane"
, type =	"Manuscript"
, institution =	"??"
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{ds-erbms-88
, author =	"M. B. Dillencourt and H. Samet."
, title =	"Extracting Region Boundaries from Maps Stored as Linear Quadtrees"
, booktitle =	"Proc. 3rd Internat. Sympos. Spatial Data Handling"
, site =	"Sydney, Australia"
, month =	aug
, year =	1988
, pages =	"65--77"
, update =	"96.05 efrat"
}

@article{ds-utseb-96
, author =	"M. B. Dillencourt and H. Samet"
, title =	"Using Topological Sweep To Extract the Boundaries of Regions in Maps Represented by Region Quadtrees"
, journal =	"Algorithmica"
, volume =	15
, number =	1
, month =	jan
, year =	1996
, pages =	"82--102"
, update =	"96.05 efrat"
}

@article{dst-gaccl-92
, author =	"M. B. Dillencourt and H. Samet and M. Tamminen"
, title =	"A general approach to connected--component labeling for arbitrary image representations"
, journal =	"J. ACM"
, volume =	39
, number =	2
, month =	apr
, year =	1992
, pages =	"253--280"
, comments =	"also Corrigendum, Journal of the ACM 39:4 (October 1992), 985;
	University of Maryland Computer Science TR-2303"
, update =	"96.05 efrat"
}

@inproceedings{ds-ltati-92
, author =	"M. B. Dillencourt and W. D. Smith"
, title =	"A linear-time algorithm for testing the inscribability of trivalent polyhedra"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"177--185"
, precedes =	"ds-ltati-95"
, cites =	"b-vdch-79, c-tghc-73, cfg-upg-90, d-psoth-, d-tdt-90, drs-csdtp-91, ds-gtpig-, e-acg-87, f-dpsds-82, g-cp-67, gs-spp-87, hrs-cchpc-92, nc-pgta-88, ps-cgi-85, r-giph3-, r-ciph3-92, rs-ig-91, s-ptadi-92, s-sedag-81, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 96.09 devillers"
}

@article{ds-ltati-95
, author =	"M. B. Dillencourt and W. D. Smith"
, title =	"A linear-time algorithm for testing the inscribability of trivalent polyhedra"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"21--36"
, keywords =	"inscribability, polyhedra, toughness, planar graphs, Delaunay triangulation"
, succeeds =	"ds-ltati-92"
, update =	"96.09 devillers"
}

@inproceedings{ds-smrdd-93
, author =	"M. B. Dillencourt and W. D. Smith"
, title =	"A Simple Method for Resolving Degeneracies in {Delaunay} Triangulation"
, booktitle =	"Proc. 20th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	700
, publisher =	"Springer-Verlag"
, month =	jul
, year =	1993
, pages =	"177--188"
, update =	"98.11 bibrelex, 93.09 milone+mitchell+rote"
}

@inproceedings{ds-gtcid-94
, author =	"M. B. Dillencourt and W. D. Smith"
, title =	"Graph-Theoretical Conditions for Inscribability and {Delaunay}Realizability"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"287--292"
, cites =	"a-vdsfg-91, bll-cpt-93t, bm-gta-76, b-vdch-79, cn-hcpls-89, c-tghc-73, c-psepg-92, cl-hcdc-89, d-ubsei-89, d-rdt-90, d-tdt-90, d-fhcdt-92, ds-ltati-92, ds-smrdd-93, e-acg-87, e-dnng-92, e-hcsc-73, f-dpsds-82, g-cp-67, hr-cccph-93, hrs-cchpc-92, js-niqpr-91, ls-mogar-93, ms-tgmst-91, o-cgc2-87, py-nng-92, ps-cgi-85, r-ciph3-92, r-ahvfl-92, r-giph3-, rs-iphdd-91, rs-ig-91, s-sedag-81, t-pihhg-76, t-tppg-83, t-tpg-56, t-bhcpg-77, c-ig-69, gmr-vdmpp-92, ZZZ"
, update =	"99.11 bibrelex, 98.11 bibrelex, 94.09 jones"
}

@techreport{ds-gtpig-
, author =	"M. B. Dillencourt and W. D. Smith"
, title =	"Graph-theoretical properties of inscribable graphs"
, type =	"Technical {Report}"
, institution =	"Univ. California"
, address =	"Irvine, CA"
, year =	"??"
, update =	"97.11 bibrelex"
}

@article{d-dtpos-50
, author =	"R. P. Dilworth"
, title =	"A decomposition theorem for partially ordered sets"
, journal =	"Annals of Math."
, volume =	51
, year =	1950
, pages =	"161--166"
, update =	"97.11 bibrelex"
}

@techreport{di-rms-85
, author =	"B. Dimsdale and A. Inselberg"
, title =	"Representing multidimensional surfaces"
, type =	"Report"
, number =	"??"
, institution =	"IBM Sci. Center"
, address =	"Los Angeles, CA"
, year =	1985
}

@article{dm-fadds-90
, author =	"C. Ding and P. Mateti"
, title =	"A Framework for the Automated Drawing of Data Structure Diagrams"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-16"
, number =	5
, year =	1990
, pages =	"543--557"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{dsw-bvcnh-
, author =	"G. Ding and P. Seymour and P. Winkler"
, title =	"Bounding the vertex cover number of a hypergraph"
, journal =	"Combinatorica"
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@article{dr-alpac-87
, author =	"R. Ding and J. R. Reay"
, title =	"Areas of lattice polygons applied to computer graphics"
, journal =	"Zastos. Math. (Poland)"
, volume =	19
, number =	"3--4"
, year =	1987
, pages =	"547--556"
, keywords =	"polygons, area, discrete geometry"
, update =	"95.09 korneenko"
}

@inproceedings{dw-kdhem-93
, author =	"Y. Ding and M. A. Weiss"
, title =	"The $k$-D Heap: An Efficient Multi-Dimensional Priority Queue"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, year =	1993
, pages =	"302--313"
, update =	"93.09 smid, 93.05 jones"
}

@article{d-aspmf-70
, author =	"E. A. Dinitz"
, title =	"Algorithm for solution of a problem of maximum flow in a network with power estimation"
, journal =	"Soviet Math. Dokl."
, volume =	"??"
, year =	1970
, pages =	"248--264"
, update =	"97.11 bibrelex"
}

@inproceedings{dv-ccvsg-94
, author =	"Ye. Dinitz and A. Vainshtein"
, title =	"The Connectivity Carcass of a Vertex Subset in a Graph and its Incremental Maintenance"
, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"716--725"
, update =	"95.05 tamassia"
}

@article{d-udrdp-50
, author =	"G. L. Dirichlet"
, title =	"{\"U}ber die {Reduktion} der positiven quadratischen {Formen} mit drei unbestimmten ganzen {Zahlen}"
, journal =	"J. Reine Angew. Math."
, volume =	40
, year =	1850
, pages =	"209--227"
, keywords =	"Voronoi diagrams"
, update =	"00.03 bibrelex, 93.09 held"
, annote =	"Voronoi diagrams used for the first time"
}

@article{do-lbsri-85
, author =	"E. Dittert and M. J. {O'Donnell}"
, title =	"Lower bounds for sorting with realistic instruction sets"
, journal =	"IEEE Trans. Comput."
, volume =	34
, year =	1985
, pages =	"311--317"
, keywords =	"lower bounds"
, update =	"95.09 korneenko"
}

@inproceedings{dr-ctmep-96
, author =	"A. A. Diwan and S. Rane and S. Seshadri and S. Sudarshan"
, title =	"Clustering Techniques for Minimizing External Path Length."
, booktitle =	"Proceedings of the International Conference on Very Large Databases"
, publisher =	"Morgan Kauffman"
, year =	1996
, update =	"98.07 agarwal"
}

@article{dk-ebsrs-88
, author =	"T. I. Dix and D. H. Kieronska"
, title =	"Errors between sites in restriction site mapping"
, journal =	"Comput. Appl. Biol. Sci."
, volume =	4
, number =	1
, year =	1988
, pages =	"117--123"
, update =	"97.11 bibrelex"
}

@article{d-etqti-08
, author =	"A. Dixon"
, title =	"The Eliminant of Three Quantics in Two Independent Variables"
, journal =	"Proc. London Math. Soc."
, volume =	2
, number =	6
, year =	1908
, pages =	"468--478"
, update =	"98.03 bibrelex"
}

@article{dkw-dsatg-94
, author =	"A. R. Dixon and G. H. Kirby and D. P. M. Wills"
, title =	"A Data Structure for Artificial Terrain Generation"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	1
, month =	mar
, year =	1994
, pages =	"37--48"
, update =	"96.01 held"
}

@inproceedings{dl-cvdrp-91
, author =	"H. Djidjev and A. Lingas"
, title =	"On computing the {Voronoi} diagram for restricted planar figures"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"54--64"
, keywords =	"Voronoi diagram, Delaunay triangulation, simple polygon, histogram"
, precedes =	"dl-cvdsp-95"
, update =	"96.09 devillers"
}

@article{dl-cvdsp-95
, author =	"H. Djidjev and A. Lingas"
, title =	"On computing {Voronoi} diagrams for sorted point sets"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"327--337"
, keywords =	"Voronoi diagram, Delaunay triangulation, monotone histogram, tine complexity"
, succeeds =	"dl-cvdrp-91"
, update =	"96.09 devillers"
}

@inproceedings{d-lamps-95
, author =	"H. N. Djidjev"
, title =	"A Linear Algorithm for the Maximal Planar Subgraph Problem"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"369--380"
, keywords =	"graph drawing, planarization"
, update =	"99.07 bibrelex, 95.05 tamassia"
}

@inproceedings{d-dgcp-95
, author =	"H. N. Djidjev"
, title =	"On Drawing a Graph Convexly in the Plane"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"76--83"
, keywords =	"graph drawing, planar, straight-line"
, update =	"95.01 tamassia"
}

@article{d-pppg-82
, author =	"H. N. Djidjev"
, title =	"On the problem of partitioning planar graphs"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	3
, number =	2
, year =	1982
, pages =	"229--240"
, update =	"97.11 bibrelex"
}

@techreport{dls-oaclc-88
, author =	"H. N. Djidjev and A. Lingas and J. Sack"
, title =	"An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
, number =	"SCS-TR-148"
, institution =	"School of Computer Science, Carleton University"
, year =	1988
, update =	"98.03 bibrelex"
}

@inproceedings{dls-oaclc-89
, author =	"H. N. Djidjev and A. Lingas and J. Sack"
, title =	"An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
, editor =	"B. Monien and R. Cori"
, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	349
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"96--107"
, keywords =	"link distance"
}

@article{dls-oaclc-92
, author =	"H. N. Djidjev and A. Lingas and J. Sack"
, title =	"An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
, journal =	"Discrete Comput. Geom."
, volume =	8
, number =	2
, year =	1992
, pages =	"131--152"
, keywords =	"visibility"
, update =	"94.09 orourke"
}

@inproceedings{dpz-cspdp-91
, author =	"H. N. Djidjev and G. E. Pantziou and C. D. Zaroliagis"
, title =	"Computing Shortest Paths and Distances in Planar Graphs"
, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	510
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"327--338"
, keywords =	"Dijkstra, on-line"
, update =	"93.09 rote"
}

@inproceedings{dbs-gacpp-00
, author =	"Martin Dlouh{\'y} and Franti{\v s}ek Brabec and Petr {\v S}vestka"
, title =	"A Genetic Approach to the Cleaning Path Planning Problem"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"126--131"
, update =	"00.03 bibrelex"
}

@techreport{de-opstt-84
, author =	"D. Dobkin and H. Edelsbrunner"
, title =	"Organizing point sets in two and three dimensions"
, type =	"Tech.\ Report"
, number =	"F130"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1984
, update =	"97.07 agarwal"
}

@inproceedings{de-cd-93
, author =	"D. Dobkin and D. Eppstein"
, title =	"Computing the discrepancy"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"47--52"
, cites =	"bc-id-87, cpc-drt-84, dm-redsp-93, eg-tsa-89, g-irt-89, h-ecqsp-60, hs-ompc-91, k-re-86, n-med-71, ol-mcp-81, oy-nubkm-91, r-id-54, s-id7-72, w-cildp-71, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{dhks-cidp-93
, author =	"D. Dobkin and J. Hershberger and D. Kirkpatrick and Subhash Suri"
, title =	"Computing the intersection-depth of polyhedra"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"518--533"
, update =	"98.03 mitchell, 96.05 ramkumar"
}

@inproceedings{dhks-isccd-90
, author =	"D. Dobkin and J. Hershberger and D. Kirkpatrick and Subhash Suri"
, title =	"Implicitly searching convolutions and computing depth of collision"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"165--180"
, update =	"98.03 mitchell"
}

@article{dlr-lpils-79
, author =	"D. Dobkin and R. J. Lipton and S. Reiss"
, title =	"Linear programming is log-space hard for {$P$}"
, journal =	"Inform. Process. Lett."
, volume =	8
, year =	1979
, pages =	"96--97"
}

@inproceedings{dm-redsp-93
, author =	"D. Dobkin and D. Mitchell"
, title =	"Random-edge discrepancy of supersampling patterns"
, booktitle =	"Graphics Interface '93"
, year =	1993
, keywords =	"discrepancy"
, update =	"97.03 schwarzkopf"
}

@inproceedings{dnt-vmss3-90
, author =	"D. Dobkin and S. North and N. Thurston"
, title =	"A viewer for Mathematical structures and surfaces in 3D"
, booktitle =	"Sympos. on Interactive 3D Graphics"
, month =	may
, year =	1990
, pages =	"141--142"
, update =	"99.03 forrest, 98.11 bibrelex"
}

@techreport{dnt-sug-??
, author =	"D. Dobkin and S. North and N. Thurston"
, title =	"Salem User's Guide"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ds-dcmdf-89
, author =	"D. Dobkin and Subhash Suri"
, title =	"Dynamically computing the maxima of decomposable functions, with applications"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"488--493"
, keywords =	"semi-online model, dynamization, amortized analysis"
, precedes =	"ds-mge-91"
, update =	"98.03 mitchell"
}

@article{ds-mge-91
, author =	"D. Dobkin and Subhash Suri"
, title =	"Maintenance of geometric extrema"
, journal =	"J. ACM"
, volume =	38
, year =	1991
, pages =	"275--298"
, keywords =	"semi-online model, dynamization, amortized analysis"
, succeeds =	"ds-dcmdf-89"
, update =	"98.03 mitchell"
}

@inproceedings{dt-buph-93
, author =	"D. Dobkin and A. Tal"
, title =	"Building and using polyhedral hierarchies"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	394
, keywords =	"video review"
, cites =	"dk-ladsc-85, dk-dsppu-90, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@inproceedings{dt-gascg-94
, author =	"D. Dobkin and A. Tel"
, title =	"GASP - an Animation System for Computational Geometry"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"243--249"
, cites =	"-pltc-85, b-aa-87, b-eaub-88, b-zsaam-92a, bs-taa-85, ce-oails-92, dk-ladsc-85, dk-dsppu-90, dnt-vmss3-90, dt-buph-93, ekkmns-wcg-94, l-dpslu-86, mn-lledt-89, r-mdbp-91, s-mdbp-93, s-a-88, s-iipg-92, s-votcb-93, ss-otcbt-93, s-ptppm-90, s-tfsaa-90, tcd-njlsm-92, s-raplg-91t, ZZZ"
, update =	"99.11 bibrelex, 99.03 forrest, 98.11 bibrelex, 94.09 jones"
}

@article{dltw-ctpla-90
, author =	"D. A. Dobkin and Silvio V. F. Levy and William P. Thurston and Allan R. Wilks"
, title =	"Contour Tracing by Piecewise Linear Approximations"
, journal =	"ACM Trans. Graph."
, volume =	9
, number =	4
, month =	oct
, year =	1990
, pages =	"389--423"
, annote =	"Algorithm for contour of a function that can be
		 computed at any point. Space is (regularly)
		 triangulated and a linear approximation is used on each
		 simplex. Three goodness of triangle measures are
		 considered: Minimize the number of triangles crossed by
		 a random line (In 2D this is same as shortest
		 diagonal). Minimize ratio of circum and in spheres.
		 Minimize condition number of covariance matrix of a
		 random point, uniformly distributed in a circle. (Ratio
		 between largest and smallest eigenvalues.)"
}

@article{d-cgcg-92
, author =	"D. P. Dobkin"
, title =	"Computational Geometry and Computer Graphics"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1400--1411"
, update =	"93.09 goodrich+held"
}

@incollection{d-cgtn-88
, author =	"D. P. Dobkin"
, title =	"Computational geometry: then and now"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"71--109"
, keywords =	"survey paper, convex hull, design of algorithms"
, update =	"99.11 bibrelex"
}

@techreport{d-kslcg-78
, author =	"D. P. Dobkin"
, title =	"Keyword structures in a language for computer geometry"
, type =	"Report"
, number =	"TM 78-1271-9"
, institution =	"Bell Lab."
, address =	"Murray Hill, NJ"
, year =	1978
}

@techreport{d-vag-??
, author =	"D. P. Dobkin"
, title =	"{VLSI}, algorithms and graphics"
, type =	"Report"
, number =	"??"
, institution =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	"??"
}

@incollection{ddg-fsp-83
, author =	"David P. Dobkin and Robert L. {Drysdale, III} and Leonidas J. Guibas"
, title =	"Finding Smallest Polygons"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"181--214"
, keywords =	"optimization, smallest perimeter, convex polygon, $k$-gon, Voronoi diagrams, dynamic programming"
, update =	"01.04 icking, 98.03 mitchell"
}

@inproceedings{de-hstai-84
, author =	"D. P. Dobkin and H. Edelsbrunner"
, title =	"Ham-sandwich theorems applied to intersection problems"
, booktitle =	"Proc. 10th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '84"
, year =	1984
, pages =	"88--99"
, keywords =	"data structuring, discrete geometry, combinatorial geometry, partition, range search, trees, two-dimensional, three-dimensional"
, update =	"98.07 bibrelex"
}

@inproceedings{de-ssio-84
, author =	"D. P. Dobkin and H. Edelsbrunner"
, title =	"Space searching for intersecting objects"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"387--392"
, precedes =	"de-ssio-87"
}

@article{de-ssio-87
, author =	"D. P. Dobkin and H. Edelsbrunner"
, title =	"Space searching for intersecting objects"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"348--361"
, keywords =	"data structuring, discrete geometry, searching, intersection, partition, range search, geometric transformations, trees, two-dimensional, three-dimensional"
, succeeds =	"de-ssio-84"
}

@inproceedings{deo-secp-88
, author =	"D. P. Dobkin and H. Edelsbrunner and M. H. Overmars"
, title =	"Searching for empty convex polygons"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"224--228"
, succeeds =	"ar-clecs-85"
, precedes =	"deo-secp-90"
, cites =	"ar-clecs-85, bf-eses-86, cgl-pgd-85, eg-tsa-86, eos-calha-86, e-cpgnt-79, h-kfiep-78, h-fvgsp-87, h-snec7-83, klp-fmsv-75, osv-swec6-88, ZZZ"
, update =	"98.03 bibrelex, 93.09 milone+mitchell"
}

@article{deo-secp-90
, author =	"D. P. Dobkin and H. Edelsbrunner and M. H. Overmars"
, title =	"Searching for empty convex polygons"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"561--571"
, succeeds =	"deo-secp-88, ar-clecs-85"
, update =	"93.09 milone+mitchell"
}

@unpublished{dey-3spa-84
, author =	"D. P. Dobkin and H. Edelsbrunner and F. Yao"
, title =	"A 3-space partition and its applications"
, year =	1984
, note =	"manuscript"
, update =	"97.11 bibrelex"
}

@inproceedings{dey-pcp-86
, author =	"D. P. Dobkin and H. Edelsbrunner and C. K. Yap"
, title =	"Probing convex polytopes"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"424--432"
, keywords =	"discrete geometry, robotics, probing, worst-case analysis, polytopes, convex, $d$-dimensional"
, comments =	"To appear in Autonomous Robot Vehicles, Cox and
		 Wilfong, ed."
}

@inproceedings{dfs-dgaag-87
, author =	"D. P. Dobkin and S. J. Friedman and K. J. Supowit"
, title =	"Delaunay graphs are almost as good as complete graphs"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"20--26"
, precedes =	"dfs-dgaag-90"
}

@article{dfs-dgaag-90
, author =	"D. P. Dobkin and S. J. Friedman and K. J. Supowit"
, title =	"Delaunay graphs are almost as good as complete graphs"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"399--407"
, succeeds =	"dfs-dgaag-87"
}

@inproceedings{dgkn-igper-97
, author =	"David P. Dobkin and Emden R. Gansner and Eleftherios Koutsofios and Stephen C. North"
, title =	"Implementing a General-Purpose Edge Router"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"262--271"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{dghs-eafcr-93
, author =	"D. P. Dobkin and L. Guibas and J. Hershberger and J. Snoeyink"
, title =	"An efficient algorithm for finding the {CSG} representation of a simple polygon"
, journal =	"Algorithmica"
, volume =	10
, year =	1993
, pages =	"1--23"
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@article{dghs-eafcr-88
, author =	"D. P. Dobkin and Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
, title =	"An efficient algorithm for finding the {CSG} representation of a simple polygon"
, journal =	"Comput. Graph."
, volume =	22
, number =	4
, year =	1988
, pages =	"31--40"
, note =	"Proc. SIGGRAPH '88"
, update =	"98.07 agarwal, 98.03 mitchell, 96.09 devillers+orourke, 93.09 goodrich"
}

@techreport{dg-crd-94t
, author =	"D. P. Dobkin and D. Gunopulos"
, title =	"Computing the rectangle discrepancy"
, type =	"Technical {Report}"
, number =	"443-94"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1994
, update =	"98.03 bibrelex"
}

@inproceedings{dg-crd-94
, author =	"D. P. Dobkin and D. Gunopulos"
, title =	"Computing the Rectangle Discrepancy"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"385--386"
, keywords =	"video review"
, cites =	"de-cd-93, dg-crd-94t, td-gsfag-94, m-eapls-94, p-ortap-79, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones"
}

@article{dk-ladsc-85
, author =	"D. P. Dobkin and D. G. Kirkpatrick"
, title =	"A linear algorithm for determining the separation of convex polyhedra"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"381--392"
, keywords =	"design of algorithms, construction, separation, convex, polyhedra, hierarchical representations"
}

@inproceedings{dk-dsppu-90
, author =	"D. P. Dobkin and D. G. Kirkpatrick"
, title =	"Determining the separation of preprocessed polyhedra -- a unified approach"
, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	443
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"400--413"
, update =	"97.11 bibrelex"
}

@misc{dk-fappi-
, author =	"D. P. Dobkin and D. G. Kirkpatrick"
, title =	"Fast Algorithms for Preprocessed Polyhedral Intersection Detection"
, precedes =	"dk-fdpi-82, dk-fdpi-83"
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{dk-fdpi-82
, author =	"D. P. Dobkin and D. G. Kirkpatrick"
, title =	"Fast detection of polyhedral intersection"
, booktitle =	"Proc. 9th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	140
, publisher =	"Springer-Verlag"
, year =	1982
, pages =	"154--165"
, keywords =	"design of algorithms, data structuring, detection, intersection, polyhedra, three-dimensional, convex, hierarchical representations"
, succeeds =	"dk-fappi-"
, precedes =	"dk-fdpi-83"
, update =	"98.03 bibrelex"
}

@article{dk-fdpi-83
, author =	"D. P. Dobkin and D. G. Kirkpatrick"
, title =	"Fast detection of polyhedral intersection"
, journal =	"Theoret. Comput. Sci."
, volume =	27
, number =	3
, month =	dec
, year =	1983
, pages =	"241--253"
, keywords =	"design of algorithms, data structuring, detection, intersection, polyhedra, three-dimensional, convex, hierarchical representations"
, succeeds =	"dk-fappi-, dk-fdpi-82"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{dl-pmtds-87
, author =	"D. P. Dobkin and M. J. Laszlo"
, title =	"Primitives for the manipulation of three-dimensional subdivisions"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"86--99"
, keywords =	"data structuring"
, precedes =	"dl-pmtds-89"
, cites =	"ab-acddv-83, b-prcv-75, b-acgpr-82, b-vdch-79, bhs-swcpg-80, c-cpplb-84, cd-diec-80, ck-acp-70, ew-gmueo-79, gs-pmgsc-85, jb-iaem-87, l-dsmtd-87, w-vt-??, ZZZ"
, update =	"98.03 bibrelex"
}

@article{dl-pmtds-89
, author =	"D. P. Dobkin and M. J. Laszlo"
, title =	"Primitives for the manipulation of three-dimensional subdivisions"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"3--32"
, succeeds =	"dl-pmtds-87"
}

@article{dl-msp-76
, author =	"D. P. Dobkin and R. J. Lipton"
, title =	"Multidimensional searching problems"
, journal =	"SIAM J. Comput."
, volume =	5
, year =	1976
, pages =	"181--186"
}

@article{dl-ccvsp-79
, author =	"D. P. Dobkin and R. J. Lipton"
, title =	"On the complexity of computations under varying sets of primitives"
, journal =	"J. Comput. Syst. Sci."
, volume =	18
, year =	1979
, pages =	"86--91"
}

@techreport{dl-cslp-76
, author =	"D. P. Dobkin and R. J. Lipton"
, title =	"The complexity of searching lines in the plane"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Yale Univ."
, address =	"New Haven, CT"
, year =	1976
}

@techreport{dlr-eg-76
, author =	"D. P. Dobkin and R. J. Lipton and S. P. Reiss"
, title =	"Excursions into geometry"
, type =	"Report"
, number =	71
, institution =	"Dept. Comput. Sci., Yale Univ."
, address =	"New Haven, CT"
, year =	1976
}

@inproceedings{dm-eup-80
, author =	"D. P. Dobkin and J. I. Munro"
, title =	"Efficient Uses of the Past"
, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1980
, pages =	"200--206"
, precedes =	"dm-eup-85"
, annote =	"Data structure to keep track of history of a data
		 structure. Basically adds $\log t$ space and time by
		 keeping $\log t$ history lists."
}

@article{dm-eup-85
, author =	"D. P. Dobkin and J. I. Munro"
, title =	"Efficient uses of the past"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"455--465"
, succeeds =	"dm-eup-80"
}

@article{dr-clp-80
, author =	"D. P. Dobkin and S. P. Reiss"
, title =	"The complexity of linear programming"
, journal =	"Theoret. Comput. Sci."
, volume =	11
, year =	1980
, pages =	"1--18"
}

@article{ds-acgtr-89
, author =	"D. P. Dobkin and D. Silver"
, title =	"Applied computational geometry: {Towards} robust solutions of basic problems"
, journal =	"J. Comput. Syst. Sci."
, volume =	40
, number =	1
, year =	1989
, pages =	"70--87"
, succeeds =	"ds-rgnap-88"
, update =	"98.07 tamassia"
}

@inproceedings{ds-rgnap-88
, author =	"D. P. Dobkin and D. Silver"
, title =	"Recipes for geometry and numerical analysis, {Part} {I}: an empirical study"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"93--105"
, precedes =	"ds-acgtr-89"
, cites =	"d-eaavr-86, fv-sappm-85, f-cgpractice-85, f-gcest-88, gy-frcg-86, hhk-rsops-87, kj-pdwtl-87, km-fpraa-83, km-catp-81, mk-impgo-84, m-mddlp-79, ms-rcibt-88, mm-sscep-73, m-vigau-86, mw-srama-80, m-ia-66, otu-nsga-87, r-cnebf-82, ss-ccsm-85, s-ggna-88, v-inc-78, v-nmevr-78, vl-eac-74, w-reap-63, ZZZ"
, update =	"99.11 bibrelex, 99.03 forrest, 98.03 bibrelex"
}

@inproceedings{ds-gmmmc-79
, author =	"D. P. Dobkin and L. Snyder"
, title =	"On a general method for maximizing and minimizing among certain geometric problems"
, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1979
, pages =	"9--17"
}

@incollection{ds-cgug-87
, author =	"D. P. Dobkin and D. L. Souvaine"
, title =	"Computational geometry: a user's guide"
, editor =	"J. T. Schwartz and C.-K. Yap"
, booktitle =	"Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
, publisher =	"Lawrence Erlbaum Associates"
, address =	"Hillsdale, NJ"
, year =	1987
, pages =	"43--93"
, keywords =	"survey paper, design of algorithms, convex hull, point location, intersection, binary search, divide-and-conquer, geometric transformations, dynamizing data structures"
}

@article{ds-cgcw-90
, author =	"D. P. Dobkin and D. L. Souvaine"
, title =	"Computational geometry in a curved world"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"421--457"
, keywords =	"design of algorithms, intersection, convex, monotone, simple, curved polygon, splinegon"
, succeeds =	"s-cgcw-86"
}

@article{ds-dicop-91
, author =	"D. P. Dobkin and D. L. Souvaine"
, title =	"Detecting the intersection of convex objects in the plane"
, journal =	"Comput. Aided Geom. Design"
, volume =	8
, year =	1991
, pages =	"181--200"
, keywords =	"design of algorithms, intersection, convex, polygon, splinegon"
}

@techreport{dsv-diss-86
, author =	"D. P. Dobkin and D. L. Souvaine and C. J. {Van Wyk}"
, title =	"Decomposition and intersection of simple splinegons"
, type =	"Report"
, number =	"CS-TR-051-86"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1986
, keywords =	"design of algorithms, decomposition, intersection, simple, curved polygon, splinegon"
, precedes =	"dsv-diss-88"
}

@article{dsv-diss-88
, author =	"D. P. Dobkin and D. L. Souvaine and C. J. {Van Wyk}"
, title =	"Decomposition and intersection of simple splinegons"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"473--486"
, keywords =	"design of algorithms, decomposition, intersection, simple, curved polygon, splinegon"
, succeeds =	"dsv-diss-86"
}

@inproceedings{dt-esrla-01
, author =	"David P. Dobkin and Ayellet Tal"
, title =	"Efficient and Small Representation of Line Arrangements with Applications"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"293--301"
, update =	"01.11 pocchiola"
}

@incollection{dt-cg-97
, author =	"D. P. Dobkin and S. Teller"
, title =	"Computer graphics"
, chapter =	42
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"779--796"
, update =	"98.07 agarwal, 97.11 orourke"
}

@mastersthesis{d-afp-90
, author =	"Katrin Dobrindt"
, title =	"Algorithmen f{\"u}r {Polyeder}"
, school =	"Fachbereich Informatik, Universit{\"a}t Saarbr{\"u}cken"
, address =	"Saarbr{\"u}cken, Germany"
, month =	may
, year =	1990
, keywords =	"master thesis"
, update =	"99.07 devillers, 97.11 bibrelex"
}

@phdthesis{d-adraa-94
, author =	"Katrin Dobrindt"
, title =	"Algorithmes Dynamiques Randomis{\'e}s pour les Arrangements: Application \`a la Planification de Trajectoires"
, type =	"Th{\`e}se de Doctorat en Sciences"
, school =	"Ecole des Mines de Paris"
, address =	"Paris"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"99.07 devillers, 96.01 devillers, 95.09 agarwal"
}

@techreport{dmy-ceaig-93t
, author =	"Katrin Dobrindt and Kurt Mehlhorn and Mariette Yvinec"
, title =	"A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron"
, type =	"Report"
, number =	"MPI-I-93-140"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, update =	"99.07 devillers, 94.01 smid"
}

@inproceedings{dmy-ceaig-93
, author =	"Katrin Dobrindt and Kurt Mehlhorn and Mariette Yvinec"
, title =	"A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, year =	1993
, pages =	"314--324"
, update =	"99.07 devillers, 93.09 devillers+milone+mitchell+smid, 93.05 jones"
}

@inproceedings{dy-rchyd-93
, author =	"Katrin Dobrindt and Mariette Yvinec"
, title =	"Remembering conflicts in history yields dynamic algorithms"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"21--30"
, update =	"99.07 devillers, 98.07 bibrelex, 94.05 devillers+smid"
}

@article{dm-lblds-74
, author =	"A. Dobson and S. Macdonald"
, title =	"Lower bounds for lengths of {Davenport}-{Schinzel} sequences"
, journal =	"Utilitas Math."
, volume =	6
, year =	1974
, pages =	"251--257"
, update =	"95.05 agarwal"
}

@article{dt-dtoeo-81
, author =	"L. J. Doctor and J. G. Toborg"
, title =	"Display techniques for octree-encoded objects"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	1
, number =	3
, month =	jul
, year =	1981
, pages =	"29--38"
, update =	"97.11 bibrelex"
}

@inproceedings{dmmmz-mlig-97
, author =	"S. Doddi and M. Marathe and A. Mirzaian and B. Moret and B. Zhu"
, title =	"Map labeling and its generalization"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"148--157"
, update =	"97.07 agarwal"
}

@inproceedings{dmm-pslsp-00
, author =	"Srinivas Doddi and Madhav V. Marathe and Bernard M. E. Moret"
, title =	"Point Set Labeling with Specified Positions"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"182--190"
, update =	"00.11 jones"
}

@book{d-egt-72
, author =	"C. W. Dodge"
, title =	"Euclidean geometry and transformations"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1972
}

@inproceedings{d-civc3-96
, author =	"D. Dodson"
, title =	"{COMAIDE}: Information Visualization using Cooperative {3D} Diagram Layout"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"190--201"
, keywords =	"graph drawing, 3D"
, update =	"98.07 patrignani"
}

@inproceedings{dhs-ievaa-97
, author =	"J. Doellner and K. Hinrichs and H. Spiegel"
, title =	"An interactive environment for visualizing and animating algorithms"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"409--411"
, cites =	"bw-rphs-88, dh-vrsto-95, dh-oo3dm-97, d-oo3dm-96, es-vda-86, f-savd-87, hss-uccli-94, nb-o3dhl-95, o-cgc-94, o-ttt-94, m-ioopt-93, td-vga-95, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{df-rbsdm-92
, author =	"J. S. Doerschler and H. Freeman"
, title =	"A rule-based system for dense-Map name placement"
, journal =	"Commun. ACM"
, volume =	35
, year =	1992
, pages =	"68--79"
, update =	"97.07 agarwal"
}

@article{dc-advsp-93
, author =	"Jeong-In Doh and Kyung-Yong Chwa"
, title =	"An algorithm for determining visibility of a simple polygon from an internal line segment"
, journal =	"J. Algorithms"
, volume =	14
, year =	1993
, pages =	"139--168"
, update =	"94.01 choi, 93.09 milone+mitchell"
}

@article{dc-vpoot-88
, author =	"Jeong-In Doh and Kyung-Yong Chwa"
, title =	"Visibility problems for orthogonal objects in two or three dimensions"
, journal =	"Visual Comput."
, volume =	4
, number =	2
, month =	jul
, year =	1988
, pages =	"84--97"
, keywords =	"hidden line/surface elimination"
}

@article{d-fibsr-85
, author =	"T. Dokken"
, title =	"Finding intersections of {B}-spline represented geometric entities using recursive subdivsion techniques"
, journal =	"Comput. Aided Geom. Design"
, volume =	2
, year =	1985
, pages =	"189--195"
, update =	"97.11 bibrelex"
}

@article{dwms-mltnu-91
, author =	"J. Dolan and R. Weiss and {MacGregor} and J. Smith"
, title =	"Minimal length tree networks on the unit circle"
, journal =	"Ann. Oper. Res."
, volume =	33
, number =	"1--4"
, year =	1991
, pages =	"503--535"
, keywords =	"proximity, Steiner tree, minimal spanning tree, Voronoi diagram, Delaunay triangulation, heuristics"
, update =	"95.09 korneenko"
}

@techreport{dm-otps-91
, author =	"A. Dolenc and I. M{\"a}kel{\"a}"
, title =	"Optimized triangulation of parametric surfaces"
, type =	"Technical {Report}"
, number =	"TKO-B74"
, institution =	"Helsinki University of Technology"
, address =	"Helsinki, Finland"
, year =	1991
, update =	"98.07 bibrelex"
}

@article{dkssu-oasa-82
, author =	"D. Dolev and K. Karplus and A. Siegel and A. Strong and J. D. Ullman"
, title =	"Optimal algorithms for structural assembly"
, journal =	"{VLSI} Design"
, volume =	3
, year =	1982
, pages =	"38--43"
, succeeds =	"dkssu-owbr-81"
}

@inproceedings{dkssu-owbr-81
, author =	"D. Dolev and K. Karplus and A. Siegel and A. Strong and J. D. Ullman"
, title =	"Optimal wiring between rectangles"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
, year =	1981
, pages =	"312--317"
, precedes =	"dkssu-oasa-82"
}

@incollection{dlt-pepg-84
, author =	"D. Dolev and F. T. Leighton and H. Trickey"
, title =	"Planar Embedding of Planar Graphs"
, editor =	"Franco P. Preparata"
, booktitle =	"VLSI Theory"
, series =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1984
, pages =	"147--161"
, keywords =	"graph drawing"
, update =	"01.04 icking, 98.07 vismara, 93.09 tamassia"
}

@techreport{dt-laepg-81
, author =	"D. Dolev and H. Trickey"
, title =	"On linear area embedding of planar graphs"
, type =	"report"
, number =	"cs--81--876"
, institution =	"Stanford Univ."
, year =	1981
, keywords =	"plane graph representation, triangulation, area, discrete geometry, NP-completeness"
, update =	"98.07 bibrelex, 95.09 korneenko"
}

@phdthesis{d-oo3dm-96
, author =	"J. D{\"o}llner"
, title =	"Object-oriented $3$d modeling, animation and interaction"
, school =	"Universit{\"a}t M{\"u}nster"
, address =	"M{\"u}nster, Germany"
, year =	1996
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@article{dh-oo3dm-97
, author =	"J. D{\"o}llner and K. Hinrichs"
, title =	"Object-oriented $3$d modeling, animation and interaction"
, journal =	"J. Visualization and Comput. Animation"
, volume =	8
, number =	1
, year =	1997
, pages =	"33--64"
, update =	"98.07 bibrelex"
}

@inproceedings{dh-vrsto-95
, author =	"J. D{\"o}llner and K. Hinrichs"
, title =	"The virtual rendering system - {A} toolkit for object oriented $3$D rendering"
, booktitle =	"EduGraphics/ComputGraphics, Combined Proceedings"
, year =	1995
, pages =	"309--318"
, update =	"98.07 bibrelex"
}

@article{d-cp-72
, author =	"V. L. Dol'nikov"
, title =	"A coloring problem"
, journal =	"Siberian Math. J."
, volume =	13
, year =	1972
, pages =	"886--894"
, update =	"97.11 bibrelex"
}

@inproceedings{dg-patcp-91
, author =	"Salvador Dominguez and Oliver G{\"u}nther"
, title =	"Performance analysis of three curve presentation schemes"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"37--56"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{dmbrm-dram-96
, author =	"R. J. Donaghy and W. McCune and S. J. Bridgett and C. G. Armstrong and D. J. Robinson and R. M. McKeag"
, title =	"Dimensional reduction of analysis models"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"307--320"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@techreport{dx-pgaao-90t
, author =	"B. Donald and P. Xavier"
, title =	"Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators"
, type =	"Technical {Report}"
, number =	"TR-1095"
, institution =	"Cornell Univ."
, address =	"Ithaca, NY"
, year =	1990
, update =	"97.11 bibrelex"
}

% paper and info from Donald's web site:
@article{dx-pgaao-95
, author =	"B. Donald and P. Xavier"
, title =	"Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators"
, journal =	"Algorithmica"
, volume =	14
, number =	6
, year =	1995
, pages =	"480--530"
, succeeds =	"dx-pgaao-90"
, cites =	"as-rac-86, bdg-tocrm-85, b-rmpc-82, c-cdmp-86, d-samps-87, cdrx-ckp-88, cr-nlbtr-87, dx-pgaao-89, dx-nokpr-89, dx-pgaao-90t, fw-pcm-88, gl-mc-83, hp-brd-89, h-dsmt-83t, jc-pspmr-89, jhcp-pgnto-89i, l-spcsa-83, o-mpic-86, p-aspmt-85, ps-coac-82, pt-ipct-86, rt-akpul-89, sh-pmttr-85, s-obbtr-87, sd-gtomr-88, ss-rtoct-85, ss-tocm-86, w-mpav-88, y-amp-87, ZZZ"
, update =	"98.03 mitchell"
}

@article{d-gaedr-88
, author =	"B. R. Donald"
, title =	"A geometric approach to error detection and recovery for robot motion planning with uncertainty"
, journal =	"Artif. Intell."
, volume =	37
, number =	"1--3"
, year =	1988
, pages =	"223--271"
, keywords =	"compliance, motion planning"
}

@article{d-samps-87
, author =	"B. R. Donald"
, title =	"A search algorithm for motion planning with six degrees of freedom"
, journal =	"Artif. Intell."
, volume =	31
, number =	3
, year =	1987
, pages =	"295--353"
, keywords =	"motion planning"
}

@inproceedings{d-tedrr-86
, author =	"B. R. Donald"
, title =	"A theory of error detection and recovery for robot motion planning with uncertainty"
, booktitle =	"International Workshop on Geometric Reasoning"
, site =	"Oxford, UK"
, year =	1986
, update =	"98.03 bibrelex"
}

@techreport{d-edrrm-87
, author =	"B. R. Donald"
, title =	"Error detection and recovery for robot motion planning with uncertainty"
, institution =	"Artificial Intelligence Laboratory, MIT"
, year =	1987
, update =	"98.03 bibrelex"
}

@book{d-edrr-89
, author =	"B. R. Donald"
, title =	"Error Detection and Recovery in Robotics"
, series =	"Lecture Notes Comput. Sci."
, volume =	336
, publisher =	"Springer-Verlag"
, year =	1989
, keywords =	"doctoral thesis"
, comments =	"revised version of author's thesis, Massachusetts
		 Inst. Tech. 1987"
}

@inproceedings{d-mpsdf-85
, author =	"B. R. Donald"
, title =	"On motion planning with six degrees of freedom: solving the intersection problems in configuration space"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1985
, pages =	"536--541"
}

@inproceedings{d-pmsed-88
, author =	"B. R. Donald"
, title =	"Planning multi-step error detection and recovery strategies"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1988
, pages =	"892--897"
, precedes =	"d-pmsed-90"
}

@article{d-pmsed-90
, author =	"B. R. Donald"
, title =	"Planning multi-step error detection and recovery strategies"
, journal =	"Internat. J. Robot. Res."
, volume =	9
, year =	1990
, pages =	"3--60"
, keywords =	"compliance, motion planning"
, succeeds =	"d-pmsed-88"
}

@inproceedings{d-rmpug-86
, author =	"B. R. Donald"
, title =	"Robot motion planning with uncertainty in the geometric models of the robot and environment: a formal framework for error detection and recovery"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1986
, pages =	"1588--1593"
}

@inproceedings{d-cpcmp-88
, author =	"B. R. Donald"
, title =	"The complexity of planar compliant motion planning under uncertainty"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"309--318"
, precedes =	"d-cpcmp-90"
, cites =	"bk-cmpgm-87, bl-sacsf-83, b-rmpc-82, b-agppu-86, b-ptcms-87, brs-phpsd-87, c-namrm-87, cd-svd-87, cd-svd-88, cr-nlbtr-87, ad-tg-80, d-samps-87, d-rmpug-86, d-tedrr-86, d-edrrm-87, d-gaedr-88, d-ttlrp-87, e-ubfmp-86, em-esm-86, g-cdta-87, hw-moc-86, k-ernmp-87, k-grsmo-85, l-spcsa-83, l-rp-83, lmt-asfms-84, l-cmpue-86, m-cfccc-81, m-apfmc-84, n-moo-86, n-aaadp-86, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, hss-pgcrm-87, sy-agar-87, t-smcpt-76, y-cmsd-84, y-amp-87, ZZZ"
, update =	"98.03 bibrelex"
}

@article{d-cpcmp-90
, author =	"B. R. Donald"
, title =	"The complexity of planar compliant motion planning under uncertainty"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"353--382"
, succeeds =	"d-cpcmp-88"
}

@inproceedings{d-mpasd-83
, author =	"B. R. Donald"
, title =	"The mover's problem in automated structural design"
, booktitle =	"Proc. Harvard Computer Graphics Conference"
, year =	1983
, pages =	"??"
}

@techreport{d-ttlrp-87
, author =	"B. R. Donald"
, title =	"Towards task-level robot programming"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{dbb-r-90
, author =	"B. R. Donald and J. Baillieul and R. Brockett"
, title =	"Robotics"
, booktitle =	"Symposia in Applied Mathematics"
, volume =	41
, year =	1990
, pages =	"??"
, update =	"97.11 bibrelex"
}

@techreport{dc-chtt-91
, author =	"B. R. Donald and D. R. Chang"
, title =	"On computing the homology type of a triangulation"
, type =	"Technical {Report}"
, number =	"TR-91-1183"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1991
, update =	"98.03 bibrelex"
}

@inproceedings{dc-cchtt-91
, author =	"B. R. Donald and D. R. Chang"
, title =	"On the complexity of computing the homology type of a triangulation"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"650--662"
}

@inproceedings{dj-sitdp-91
, author =	"B. R. Donald and J. Jennings"
, title =	"Sensor interpretation and task-directed planning using perceptual equivalence classes"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1991
, pages =	"190--197"
}

@inproceedings{djc-tevac-89
, author =	"B. R. Donald and J. Jennings and D. Campbell"
, title =	"Towards experimental verification of an automated compliant motion planner based on a geometric theory of error detection and recovery"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1989
, pages =	"632--637"
}

@article{dlrg-rtrmp-90
, author =	"B. R. Donald and J. Lengyel and M. Reichert and D. Greenberg"
, title =	"Real-time robot motion planning using rasterizing computer graphics hardware"
, journal =	"Comput. Graph."
, volume =	24
, number =	4
, year =	1990
, pages =	"327--335"
, note =	"Proc. SIGGRAPH '90"
}

@inproceedings{dp-mccrb-90
, author =	"B. R. Donald and D. K. Pai"
, title =	"On the motion of compliantly-connected rigid bodies in contact: a system for analyzing designs for assembly"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1990
, pages =	"1756--1762"
, keywords =	"motion planning, compliance"
}

@inproceedings{dx-pgaao-89
, author =	"B. R. Donald and P. Xavier"
, title =	"A provably good approximation algorithm for optimal-time trajectory planning"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1989
, pages =	"958--963"
, keywords =	"motion planning"
}

@inproceedings{dx-nokpr-89
, author =	"B. R. Donald and P. Xavier"
, title =	"Near-optimal kinodynamic planning for robots with coupled dynamics bounds"
, booktitle =	"Proc. 4th IEEE International Symposium on Intelligent Control"
, year =	1989
, pages =	"??"
, keywords =	"motion planning"
}

@inproceedings{dx-tstob-91
, author =	"B. R. Donald and P. Xavier"
, title =	"Time-safety trade-offs and a bang-bang algorithm for kinodynamic planning"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1991
, pages =	"525--527"
, keywords =	"motion planning"
}

% paper and info from Donald's web site:
@article{dxcr-kmp-93
, author =	"B. R. Donald and P. Xavier and J. Canny and J. Reif"
, title =	"Kinodynamic Motion Planning"
, journal =	"J. ACM"
, volume =	40
, number =	5
, month =	nov
, year =	1993
, pages =	"1048--1066"
, succeeds =	"cdrx-ckp-88"
, update =	"98.03 mitchell"
}

@inproceedings{dx-pgaao-90
, author =	"B. R. Donald and P. G. Xavier"
, title =	"Provably good approximation algorithms for optimal kinodynamic planning for {Cartesian} robots and open chain manipulators"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"290--300"
, precedes =	"dx-pgaao-95"
, cites =	"as-rac-86, bdg-tocrm-85, b-rmpc-82, c-cdmp-86, d-samps-87, cdrx-ckp-88, cr-nlbtr-87, dx-pgaao-89, dx-nokpr-89, dx-pgaao-90t, fw-pcm-88, gl-mc-83, hp-brd-89, h-dsmt-83t, jc-pspmr-89, jhcp-pgnto-89i, l-spcsa-83, o-mpic-86, p-aspmt-85, ps-coac-82, pt-ipct-86, rt-akpul-89, sh-pmttr-85, s-obbtr-87, sd-gtomr-88, ss-rtoct-85, ss-tocm-86, w-mpav-88, y-amp-87, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex"
}

@techreport{d-mpsdf-84
, author =	"R. B. Donald"
, title =	"Motion Planning with Six Degrees of Freedom"
, number =	"AI-TR-791"
, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1984
, update =	"98.03 bibrelex"
}

@inproceedings{dw-eabmo-83
, author =	"W. E. Donath and C. K. Wong"
, title =	"An efficient algorithm for boolean mask operations"
, booktitle =	"Internat. Conf. Computer Design"
, year =	1983
, pages =	"358--360"
, keywords =	"polygons, Boolean operations"
, update =	"95.09 korneenko"
}

@inproceedings{dcl-cfdfb-89
, author =	"S. Dong and J. Cong and C. L. Liu"
, title =	"Constraint Floorplan Design for Flexible Blocks"
, booktitle =	"IEEE Int. Conf. on Computer-Aided Design"
, year =	1989
, pages =	"488--491"
, update =	"98.11 bibrelex"
}

@incollection{dmss-imt3d-94
, author =	"W. P. Dong and E. Mainsah and P. F. Sullivan and K. F. Stout"
, title =	"Instruments and Measurement Techniques of 3-Dimensional Surface Topography"
, editor =	"K. F. Stout"
, booktitle =	"Three-Dimensional Surface Topography: Measurement, Interpretation and Applications"
, publisher =	"Penton Press"
, address =	"Bristol, Penn."
, year =	1994
, update =	"96.09 orourke"
}

@article{dw-mgvfs-91
, author =	"X. Dong and M. J. Wozny"
, title =	"A method for generating volumetric features from surface features"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	3
, year =	1991
, pages =	"281--297"
, keywords =	"computer aided design, computer aided manufacturing, geometric modeling, feature extraction"
}

@book{dmbs-lug-79
, author =	"J. J. Dongarra and C. B. Moler and J. R. Bunch and G. W. Stewart"
, title =	"{LINPACK} Users' Guide"
, publisher =	"SIAM Press"
, address =	"Philadelphia, PA"
, year =	1979
, update =	"95.05 agarwal"
}

@incollection{dh-nbp-83
, author =	"D. L. Donoho and P. J. Huber"
, title =	"The notion of breakdown point"
, editor =	"P. J. Bickel and K. Doksun and J. L. Hodges"
, booktitle =	"A Festschrift for Erich L. Lehmann"
, publisher =	"Wadsworth International Group"
, address =	"Belmont, CA"
, year =	1983
, pages =	"157--184"
, update =	"98.07 bibrelex"
}

@techreport{do-npbr-01
, author =	"Melody Donoso and Joseph O'Rourke"
, title =	"Nonorthogonal Polyhedra Built from Rectangles"
, type =	"Technical {Report}"
, number =	073
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA, USA"
, month =	oct
, year =	2001
, url =	"http://arXiv.org/abs/cs/0110059/"
, comments =	"Answers a question posed in bls-wcnfp-99"
, update =	"01.11 orourke"
}

@incollection{dh-docfc-94
, author =	"Walt Donovan and Tim Van Hook"
, title =	"Direct Outcode Calculation for Faster Clip Testing"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"125--131"
, keywords =	"IEEE floating point arithmetic, line clipping"
, update =	"94.09 heckbert"
, annote =	"A clever optimization of clip testing that exploits the
properties of IEEE floating point format. Techniques are described to
compute the ``outcodes'' needed for line clipping using only integer
arithmetic. Contains C code."
}

@article{ds-brdsn-78
, author =	"D. Doo and M. Sabin"
, title =	"Behaviour of recursive division surfaces near extraordinary points"
, journal =	"Comput. Aided Design"
, volume =	10
, year =	1978
, pages =	"356--360"
}

@inproceedings{d-sasdi-78
, author =	"D. H. Doo"
, title =	"A subdivision algorithm for smoothing down irregularly shaped polyhedrons"
, booktitle =	"Proc. IEEE Internat. Conf. Techniques Comput.-Aided Design"
, year =	1978
, pages =	"157--165"
}

@unpublished{dz-sompp-99
, author =	"D. Dor and U. Zwick"
, title =	"Sokaban and other motion planning problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, url =	"http://www.math.tau.ac.il/~ddorit/"
, update =	"00.03 orourke"
}

@inproceedings{dlpw-stmas-97
, author =	"Carsten Dorgerloh and Jens L{\"u}ssem and Morakot Pilouk and J{\"u}rgen Wirtgen"
, title =	"Some Tools for Modeling and Analysis of Surfaces"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"263--267"
, update =	"97.11 jones"
}

@article{db-ccppf-83
, author =	"D. Dori and M. Ben-Bassat"
, title =	"Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	24
, year =	1983
, pages =	"131--159"
, keywords =	"polygons, extremal figures, area"
, update =	"95.09 korneenko, 93.09 held"
, annote =	"erratic"
}

@article{db-enccf-84
, author =	"D. Dori and M. Ben-Bassat"
, title =	"Efficient nesting of congruent convex figures"
, journal =	"Commun. ACM"
, volume =	27
, year =	1984
, pages =	"228--235"
}

@article{d-mdcm-93
, author =	"D. Dorling"
, title =	"Map design for census mapping"
, journal =	"The Geographic J."
, volume =	30
, year =	1993
, pages =	"167--179"
, update =	"98.03 bibrelex"
}

@article{d-naplc-90
, author =	"M. Dorr"
, title =	"A new approach to parametric line clipping"
, journal =	"Computers \& Graphics"
, volume =	14
, number =	"3--4"
, year =	1990
, pages =	"449--464"
, keywords =	"polygons, clipping"
, update =	"95.09 korneenko"
}

@article{d-dslsp-89
, author =	"L. Dorst"
, title =	"Discrete straight line segments: parameters, primitives and properties"
, journal =	"Math. Res."
, volume =	51
, year =	1989
, pages =	"11--18"
, note =	"Proc. Geobild '89"
, keywords =	"digital geometry"
, update =	"95.09 korneenko"
}

@inproceedings{dmt-grppp-89
, author =	"L. Dorst and I. Mandhyan and K. Trovato"
, title =	"Geometrical representation of path planning problems"
, booktitle =	"Proc. 2nd International Conference on Intelligent Autonomous Systems"
, month =	dec
, year =	1989
, update =	"96.05 efrat, 93.09 milone+mitchell"
, abstract =	"The path planning problem for arbitrary devices is first and
foremost a geometrical problem.  For the field of control theory, advanced
mathematical techniques have been developed to describe and use geometrical
structure.  In this paper we use the notions of the flow of vector fields and
geodesics in metric spaces to formalize and unify path planning problems.  A
path planning algorithm based on flow propagation is briefly discussed.
Applications of the theory to motion planning for a robot arm, a maneuvering
car, and Rubik's Cube are given.  These very different problems (holomic, non-
holomic and discrete, respectively) are all solved by the same unified
procedure."
}

@article{ds-drsl-84
, author =	"L. Dorst and A. W. M. Smeulders"
, title =	"Discrete representation of straight lines"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	6
, year =	1984
, pages =	"450--463"
, keywords =	"digital geometry"
, update =	"95.09 korneenko"
}

@inproceedings{ds-dslsp-91
, author =	"L. Dorst and A. W. M. Smeulders"
, title =	"Discrete straight line segments: parameters, primitives and properties"
, booktitle =	"Vision Geom.: Proc. AMS Spec. Sess. Hoboken, NJ 1989. Providence, R.I."
, year =	1991
, pages =	"45--62"
, keywords =	"digital geometry"
, update =	"95.09 korneenko"
}

@techreport{d-soshs-91
, author =	"S. E. Dorward"
, title =	"A survey of object-space hidden surface removal"
, type =	"Technical Memorandum"
, number =	"11271-911009-11TM"
, institution =	"AT\&T Bell Laboratories, Murray Hill, NJ"
, year =	1991
, precedes =	"d-soshs-94"
, update =	"99.07 smid"
}

@article{d-soshs-94
, author =	"S. E. Dorward"
, title =	"A survey of object-space hidden surface removal"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"325--362"
, succeeds =	"d-soshs-91"
, update =	"95.01 orourke"
}

@article{drs-fctcm-74
, author =	"P. Doubilet and G.-C. Rota and J. Stein"
, title =	"On the foundations of combinatorial theory: ix, combinatorial methods in invariant theory"
, journal =	"Studies in Applied Math"
, volume =	53
, year =	1974
, pages =	"185--216"
, update =	"97.11 bibrelex"
}

@incollection{d-cvmar-94
, author =	"Jean-Fran{\c c}ois Dou{\'e}"
, title =	"{C}++ Vector and Matrix Algebra Routines"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"534--557"
, keywords =	"vector algebra, transformation, ray tracing"
, update =	"94.09 heckbert"
, annote =	"A C++ subroutine library for 2D, 3D, and 4D vector and
matrix operations. Contains C++ code. The Floppy disk that comes with the
book and the FTP collection contain a simple ray tracer written using the
library."
}

@article{dcn-accac-85
, author =	"J. A. Dougenik and N. R. Chrisman and D. R. Niemeyer"
, title =	"An algorithm to construct continous area cartograms"
, journal =	"Professional Geographer"
, volume =	37
, year =	1985
, pages =	"75--81"
, update =	"98.03 bibrelex"
}

@techreport{d-lcpgi-93
, author =	"David H. Douglas"
, title =	"Least Cost Path in Geographic Information Systems"
, type =	"Research Note No. 61"
, institution =	"Department of Geography, University of Ottawa"
, address =	"Ottawa, Ontario"
, month =	aug
, year =	1993
, keywords =	"shortest paths, weighted region problem, GIS, Snell's Law"
, update =	"98.03 mitchell"
, annote =	"paper was submitted to a journal. Has it appeared??"
}

@article{d-vcpcp-72
, author =	"David H. Douglas"
, title =	"Viewblock: A Computer Program for Constructing Perspective View Block Diagrams"
, journal =	"Revue de Geographie de Montreal"
, volume =	"XXVI"
, number =	1
, month =	jan
, year =	1972
, pages =	"102--104"
, update =	"93.09 franklin"
}

% ### check: vol. 13, pp. 167--184
@article{dp-arnpr-73
, author =	"David H. Douglas and Thomas K. Peucker"
, title =	"Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature"
, journal =	"Canadian Cartographer"
, volume =	10
, number =	2
, month =	dec
, year =	1973
, pages =	"112--122"
, update =	"95.09 korneenko, 93.09 franklin"
}

@article{dd-pp-92
, author =	"K. A. Dowsland and W. B. Dowsland"
, title =	"Packing problems"
, journal =	"European J. Oper. Res."
, volume =	56
, year =	1992
, pages =	"2--14"
, update =	"98.07 bibrelex"
}

@article{dd-sdai-96
, author =	"John Doyle and Thomas Dean and others"
, title =	"Strategic Directions in Artificial Intelligence"
, journal =	"ACM Comput. Surv."
, volume =	28
, number =	4
, year =	1996
, update =	"97.03 tamassia"
}

@techreport{dbd-fshp-79
, author =	"J. Dozier and J. Bruno and P. Downey"
, title =	"A faster solution to the horizon problem"
, type =	"Report"
, number =	"TR-CSL-7907"
, institution =	"Comput. Syst. Lab., Univ. California"
, address =	"Santa Barbara, CA"
, year =	1979
}

@inproceedings{db-dcghs-94
, author =	"F. F. Dragan and A. Brandst{\"a}dt"
, title =	"Dominating cliques in graphs with hypertree structure"
, booktitle =	"Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	775
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"735--746"
, update =	"98.07 bibrelex"
}

@article{dm-cblnm-97
, author =	"D. Dragomatz and S. Mann"
, title =	"A Classified Bibliography of Literature on {NC} Milling Path Generation"
, journal =	"Comput. Aided Design"
, volume =	29
, number =	3
, month =	mar
, year =	1997
, pages =	"239--247"
, update =	"97.07 held"
}

@techreport{d-ec-83
, author =	"J.-M. Drappier"
, title =	"Enveloppes Convexes"
, institution =	"Centre CPAO, ENSTA Palaiseau"
, year =	1983
, comments =	"Survey about convex hull algorithms in 2D and experimental results, in french"
, update =	"97.03 icking"
}

@book{d-sagd-64
, author =	"A. Dresden"
, title =	"Solid Analytic Geometry and Determinants"
, publisher =	"Dover"
, address =	"New York, NY"
, year =	1964
, update =	"98.03 bibrelex"
}

@inproceedings{df-fsaal-94
, author =	"G. Drettakis and E. Fiume"
, title =	"A fast shadow algorithm for area light sources using back projection"
, editor =	"A. Glassner"
, booktitle =	"Proc. SIGGRAPH '94"
, site =	"Orlando, FL"
, publisher =	"ACM Press"
, month =	jul
, year =	1994
, pages =	"223--230"
, update =	"98.07 bibrelex"
}

@article{dw-spg-72
, author =	"S. E. Dreyfus and R. A. Wagner"
, title =	"The {Steiner} problem in graphs"
, journal =	"Networks"
, volume =	1
, year =	1972
, pages =	"195--207"
, update =	"98.07 bibrelex"
}

@article{d-clstf-82
, author =	"Z. Drezner"
, title =	"Competitive location strategies for two facilities"
, journal =	"Region. Sci. Urban Econ."
, volume =	12
, year =	1982
, pages =	"485--493"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@article{d-cpcp-89
, author =	"Z. Drezner"
, title =	"Conditional $p$-centre problems"
, journal =	"Transp. Sci."
, volume =	23
, number =	1
, year =	1989
, pages =	"51--53"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@book{d-fl-95
, title =	"Facility Location"
, editor =	"Z. Drezner"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1995
, update =	"96.05 agarwal"
}

@article{d-mmsas-88
, author =	"Z. Drezner"
, title =	"Maximizing the minimum sight angle of a set of shapes"
, journal =	"IIE Trans."
, volume =	20
, number =	2
, year =	1988
, pages =	"194--200"
, keywords =	"optimization"
, update =	"95.09 korneenko"
}

@article{d-m1cp-81
, author =	"Z. Drezner"
, title =	"On a modified $1$-center problem"
, journal =	"Manage. Sci."
, volume =	27
, year =	1981
, pages =	"838--851"
}

@article{d-rpcp-87
, author =	"Z. Drezner"
, title =	"On the rectangular $p$-center problem"
, journal =	"Naval Res. Logist. Q."
, volume =	34
, year =	1987
, pages =	"229--234"
, keywords =	"facility location, $l_1$-metric"
, update =	"95.09 korneenko"
}

@article{d-pcp-86
, author =	"Z. Drezner"
, title =	"The $p$-center problem"
, journal =	"European J. Oper. Res."
, volume =	26
, number =	2
, year =	1986
, pages =	"312--313"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@article{d-pcpho-84
, author =	"Z. Drezner"
, title =	"The $p$-centre problems --- {Heuristic} and optimal algorithms"
, journal =	"J. Oper. Res. Soc."
, volume =	35
, year =	1984
, pages =	"741--748"
, keywords =	"facility location"
, update =	"96.05 agarwal"
}

@article{d-ptctm-84
, author =	"Z. Drezner"
, title =	"The planar two-center and two-median problem"
, journal =	"Transp. Sci."
, volume =	18
, year =	1984
, pages =	"351--361"
, keywords =	"facility location"
, update =	"96.05 agarwal"
}

@article{dmw-flpld-91
, author =	"Z. Drezner and A. Mehrez and G. O. Wesolowsky"
, title =	"The facility location problems with limited distances"
, journal =	"Transp. Sci."
, volume =	25
, year =	1992
, pages =	"183--187"
, keywords =	"facility location"
, update =	"96.05 agarwal"
}

@article{ds-ceha1-87
, author =	"Z. Drezner and S. Shelah"
, title =	"On the complexity of the {Elzinga-Hearn} algorithm for the $1$-center problem"
, journal =	"Math. Oper. Res."
, volume =	12
, number =	2
, year =	1987
, pages =	"255--261"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@article{dw-lor-89
, author =	"Z. Drezner and G. O. Wesolowski"
, title =	"Location of an obnoxious route"
, journal =	"J. Oper. Res. Society"
, volume =	40
, number =	11
, year =	1989
, pages =	"1011--1018"
, keywords =	"facility location, points, convex polygon"
, update =	"95.09 korneenko"
}

@article{dw-lmof-??
, author =	"Z. Drezner and G. O. Wesolowsky"
, title =	"Location of multiple obnoxious facilities"
, year =	"??"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@article{dw-mmflp-83
, author =	"Z. Drezner and G. O. Wesolowsky"
, title =	"Minmax and maxmin facility location problems on a sphere"
, journal =	"Naval Res. Logist. Q."
, volume =	30
, year =	1983
, pages =	"305--312"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@article{dgrt-rhafh-88
, author =	"J. R. Driscoll and H. N. Gabow and R. Shrairaman and R. E. Tarjan"
, title =	"Relaxed heaps: {An} alternative to {Fibonacci} heaps with applications to parallel computation."
, journal =	"Commun. ACM"
, volume =	31
, year =	1988
, pages =	"1343--1354"
, keywords =	"shortest paths, Dijkstra, priority queue"
, update =	"96.05 mitchell"
}

@article{dsst-mdsp-89
, author =	"J. R. Driscoll and N. Sarnak and D. D. Sleator and R. E. Tarjan"
, title =	"Making data structures persistent"
, journal =	"J. Comput. Syst. Sci."
, volume =	38
, year =	1989
, pages =	"86--124"
}

@inproceedings{dsst-mdsp-86
, author =	"J. R. Driscoll and N. Sarnak and S. Sleator and R. E. Tarjan"
, title =	"Making Data Structures Persistent"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"109--121"
, update =	"98.03 bibrelex"
}

@inproceedings{dms-idpmw-98
, author =	"R. L. Drysdale and Scott McElfresh and Jack Scott Snoeyink"
, title =	"An Improved Diamond Property for Minimum-Weight Triangulations"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"65--67"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{dq-ivw5a-94
, author =	"R. L. Drysdale and J. Quinn"
, title =	"Intersecting Vectors with 5-Axis Machine Toll Movements"
, booktitle =	"Proc. 1995 NSF Design and Manufacturing Grantees Conference"
, year =	1994
, pages =	"201--202"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{d-pacdt-90
, author =	"R. L. {Drysdale, III}"
, title =	"A practical algorithm for computing the {Delaunay} triangulation for convex distance functions"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"159--168"
, keywords =	"Delaunay triangulation, $L_{1}$ metric, $L_{p}$ metric, $L_{\infty}$ metric, divide-and-conquer, points"
, update =	"93.09 drysdale"
}

@phdthesis{d-gvdgs-79
, author =	"R. L. {Drysdale, III}"
, title =	"Generalized {Voronoi} Diagrams and Geometric Searching"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, year =	1979
, note =	"Report STAN-CS-79-705"
, keywords =	"two-dimensional, doctoral thesis, Voronoi diagrams, line segments"
, update =	"93.05 jones"
}

@article{dj-nlbma-89
, author =	"R. L. {Drysdale, III} and J. W. Jaromczyk"
, title =	"A note on lower bounds for the maximum area and maximum perimeter $k$-gon problems"
, journal =	"Inform. Process. Lett."
, volume =	32
, year =	1989
, pages =	"301--303"
, keywords =	"lower bounds, polygons"
, update =	"93.09 drysdale"
}

@inproceedings{dj-dsnm-87
, author =	"R. L. {Drysdale, III} and R. B. Jerard"
, title =	"Discrete simulation of {NC} machining"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"126--135"
, keywords =	"CAD, approximation, simulation"
, precedes =	"djsh-dsnm-89"
, cites =	"a-sagni-82, acp-ncggm-84, b-ncma-72, c-scads-67, c-gqtm-89, fp-cgdm-79, fd-ficg-82, gr-bscs-74, gz-cccad-84, g-orncm-86, hv-esavp-82, kms-spafa-85, jdh-ucgtd-87, jhd-sncms-86, m-snct-73, og-cgvnc-85, rv-smhsc-82, ra-mecg-76, sjw-cadcs-82, t-rtps-86, vh-rsmmp-81, zb-cstsm-86, ZZZ"
, update =	"98.03 bibrelex"
}

@article{djsh-dsnm-89
, author =	"R. L. {Drysdale, III} and R. B. Jerard and B. Schaudt and K. Hauck"
, title =	"Discrete simulation of {NC} machining"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"33--60"
, keywords =	"CAD, approximation, simulation"
, succeeds =	"dj-dsnm-87"
, update =	"93.09 drysdale"
}

@inproceedings{dl-gvdp-78
, author =	"R. L. {Drysdale, III} and D. T. Lee"
, title =	"Generalized {Voronoi} diagrams in the plane"
, booktitle =	"Proc. 16th Allerton Conf. Commun. Control Comput."
, year =	1978
, pages =	"833--842"
, precedes =	"ld-gvdp-81"
, update =	"93.09 drysdale"
}

@techreport{dra-sltgt-95
, author =	"Robert L. Scot Drysdale and G{\"u}nter Rote and Oswin Aichholzer"
, title =	"A simple linear time greedy triangulation algorithm for uniformly distributed points"
, number =	"IIG-408"
, institution =	"Institutes for Information Processing, Technische Universit{\"a}t Graz"
, month =	feb
, year =	1995
, url =	"http://www.tu-graz.ac.at/Rote"
, update =	"98.07 bibrelex, 97.03 rote"
, abstract =	"We present a simple, practical algorithm that computes the
		greedy triangulation of a set of n points in the plane in
		expected time O(n) and space O(n), for n points drawn
		independently from a uniform distribution over some fixed
		convex shape."
}

@inproceedings{d-scpps-92
, author =	"S. Drysdale"
, title =	"Solving closest-point problems by searching the {Delaunay} diagram"
, booktitle =	"Proc. 2nd MSI Workshop Comput. Geom."
, year =	1992
, update =	"98.03 bibrelex"
}

@article{dz-hmlrp-90
, author =	"D. Du and Y. Zhang"
, title =	"On heuristics for minimum length rectilinear partitions"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"111--128"
}

@article{d-src-91
, author =	"D.-Z. Du"
, title =	"On {Steiner} ratio conjectures"
, journal =	"Ann. Oper. Res."
, volume =	33
, number =	"1--4"
, year =	1991
, pages =	"437--449"
, keywords =	"Steiner tree"
, update =	"95.09 korneenko"
}

@techreport{dc-11hme-85
, author =	"D.-Z. Du and Y.-M. Chen"
, title =	"An ``$11$''-heuristic for minimum edge length rectangular partitions of rectilinear figures"
, type =	"Report"
, number =	"??"
, institution =	"Math. Sci. Res. Inst., Univ. California"
, address =	"Berkeley, CA"
, year =	1985
, precedes =	"dc-fhmel-86"
, update =	"98.07 bibrelex"
}

@techreport{dc-fhmel-86
, author =	"D.-Z. Du and Y.-M. Chen"
, title =	"On Fast Heuristics for Minimum Edge Length Rectangular Partition"
, type =	"Technical {Report}"
, number =	"MSRI-03618-86"
, institution =	"Math. Sci. Res. Inst., Univ. California"
, address =	"Berkeley, CA"
, month =	feb
, year =	1986
, succeeds =	"dc-11hme-85"
, precedes =	""
, update =	"98.07 bibrelex"
}

@article{dgglw-mstnp-
, author =	"D. Z. Du and B. Gao and R. L. Graham and Z.-C. Liu and P.-J. Wan"
, title =	"Minimum {Steiner} trees in normed planes"
, journal =	"Discrete Comput. Geom."
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@incollection{dh-sasrp-95
, author =	"Ding-Zhu Du and Frank Hwang"
, title =	"The State of Art on {Steiner} Ratio Problems"
, editor =	"Ding-Zhu Du and Frank Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"195--224"
, keywords =	"survey paper"
, succeeds =	"dh-sasrp-92"
, update =	"98.07 icking"
}

% does it end on 135 or 136 ??  check page numbers
@article{dh-pgpcs-92
, author =	"D.-Z. Du and F. K. Hwang"
, title =	"A proof of {Gilbert}-{Pollak}'s conjecture on the {Steiner} ratio"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"121--135"
, keywords =	"Steiner tree, minimal spanning tree"
, update =	"98.03 mitchell, 97.07 smid"
}

@inproceedings{dh-aplbs-90
, author =	"D.-Z. Du and F. K. Hwang"
, title =	"An approach for proving lower bounds: solution of {Gilbert}-{Pollak} conjecture on {Steiner} ratio"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"76--85"
, keywords =	"Steiner trees"
}

@book{dh-ceg-92
, title =	"Computing in {Euclidean} Geometry"
, editor =	"Ding-Zhu Du and Frank K. Hwang"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, edition =	"1st"
, publisher =	"World Scientific"
, year =	1992
, comments =	"8 chapters, survey articles"
, precedes =	"dh-ceg-95"
, update =	"98.07 icking"
}

@book{dh-ceg-95
, title =	"Computing in {Euclidean} Geometry"
, editor =	"Ding-Zhu Du and Frank K. Hwang"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, year =	1995
, comments =	"11 chapters, xiii + 492 pages, survey articles,
		 contains h-dqgpg-95, c-cgr-95, be-mgot-95, cr-mpgt-95, c-rga-95, dh-sasrp-95, f-vddt-95, hv-gcsr2-95, s-pftbs-95, sw-cgtnd-95, and yd-ecp-95"
, succeeds =	"dh-ceg-92"
, update =	"98.07 icking, 97.11 bibrelex, 96.05 pocchiola"
}

@article{dh-rspns-92
, author =	"D. Z. Du and F. K. Hwang"
, title =	"Reducing the {Steiner} problem in a normed space"
, journal =	"SIAM J. Comput."
, volume =	21
, year =	1992
, pages =	"1001--1007"
, update =	"98.03 bibrelex"
}

@article{dh-smtbw-87
, author =	"D.-Z. Du and F. K. Hwang"
, title =	"Steiner minimal trees for bar waves"
, journal =	"Acta Math. Appl. Sinica"
, volume =	"ser.3"
, year =	1987
, pages =	"246--256"
, keywords =	"Steiner tree"
, update =	"95.09 korneenko"
}

@incollection{dh-sasrp-92
, author =	"D.-Z. Du and F. K. Hwang"
, title =	"The state of art on {Steiner} ratio problems"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"163--191"
, keywords =	"survey paper, Steiner ratio proof"
, precedes =	"dh-sasrp-95"
, update =	"98.07 icking, 93.09 erickson"
}

@article{dh-srcgp-90
, author =	"D. Z. Du and F. K. Hwang"
, title =	"The {Steiner} ratio conjecture of {Gilbert} and {Pollak} is true"
, journal =	"Proc. Nat. Acad. Sci. USA"
, volume =	87
, number =	23
, year =	1990
, pages =	"9464--9466"
, keywords =	"Steiner tree, minimal spanning tree"
, update =	"95.09 korneenko"
}

@article{dhst-smtsf-87
, author =	"D. Z. Du and F. K. Hwang and G. D. Song and G. Y. Ting"
, title =	"Steiner minimal trees on sets of four points"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"401--414"
}

@article{dhw-smtrp-87
, author =	"D. Z. Du and F. K. Hwang and J. F. Weng"
, title =	"Steiner minimal trees for regular polygons"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"65--84"
}

@article{dhw-smtzz-83
, author =	"D.-Z. Du and F. K. Hwang and J. F. Weng"
, title =	"Steiner minimal trees on zig-zag line"
, journal =	"Trans. Amer. Math. Soc."
, volume =	228
, year =	1983
, pages =	"149--156"
, keywords =	"Steiner tree"
, update =	"95.09 korneenko"
}

@article{dhwc-smtpc-85
, author =	"D.-Z. Du and F. K. Hwang and J. F. Weng and S. C. Chao"
, title =	"Steiner minimal trees for points on a circle"
, journal =	"Proc. Amer. Math. Soc."
, volume =	95
, year =	1985
, pages =	"613--618"
, keywords =	"Steiner tree"
, update =	"95.09 korneenko"
}

@article{dk-drmm-90
, author =	"D. Z. Du and D. J. Kleitman"
, title =	"Diameter and radius in the {Manhattan} metric"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"351--356"
}

@techreport{dps-melgr-86
, author =	"D.-Z. Du and L.-Q. Pan and M.-T. Shing"
, title =	"Minimum edge length guillotine rectangular partition"
, type =	"Report"
, number =	"02418-86"
, institution =	"Math. Sci. Res. Inst., Univ. California"
, address =	"Berkeley, CA"
, year =	1986
, update =	"95.01 mitchell"
}

@inproceedings{dzf-bhesm-91
, author =	"D.-Z. Du and Y. Zhang and Q. Feng"
, title =	"On better heuristic for {Euclidean} {Steiner} minimum trees"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"431--439"
}

@techreport{d-smbgb-87
, author =	"T. Dub{\'e}"
, title =	"A survey of methods for bounding {Gr{\"o}bner} bases"
, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, month =	feb
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{d-drqor-93
, author =	"T. Dub{\'e}"
, title =	"Dominance range-query: the one-reporting case"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"208--217"
, cites =	"b-mbstu-75, b-mdc-80, bm-ewcds-80, b-gbamp-85, b-hbfcp-87, bfk-ictor-81, c-fsnaq-83, c-lbors1-90, c-lbors2-90, fb-qtdsr-74, f-lbcor-81, lw-wcarp-77, lw-dsdrq-82, m-mdscg-84, o-ddds-83, ps-cgi-85, w-ndsor-85, wl-arrcd-85, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@techreport{dmy-aobgn-86
, author =	"T. Dub{\'e} and B. Mishra and C. K. Yap"
, title =	"Admissible orderings and bounds on {Gr{\"o}bner} normal form algorithm"
, type =	"Technical {Report}"
, number =	258
, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, month =	dec
, year =	1986
, note =	"Robotics Report 88"
, update =	"98.03 bibrelex"
}

@unpublished{dy-biecg-93
, author =	"Thomas Dub{\'e} and Chee Yap"
, title =	"A basis for implementing exact computational geometry"
, month =	aug
, year =	1993
, note =	"to appear"
, update =	"98.11 bibrelex"
}

@incollection{dj-cmeda-80
, author =	"Dubes and Jain"
, title =	"Clustering methodologies in exploratory data analysis"
, editor =	"M. C. Yovites"
, booktitle =	"Asvances in Computers"
, volume =	19
, publisher =	"??"
, year =	1980
, update =	"97.11 bibrelex"
}

@article{d-cmlca-57
, author =	"L. E. Dubins"
, title =	"On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents"
, journal =	"Amer. J. Math."
, volume =	79
, year =	1957
, pages =	"497--516"
}

@article{d-oafmo-88
, author =	"P. Dublish"
, title =	"An $O(n^3)$ algorithm for finding the minimal opaque forest of a convex polygon"
, journal =	"Inform. Process. Lett."
, volume =	29
, year =	1988
, pages =	"275--276"
, keywords =	"polygons, visibility"
, update =	"95.09 korneenko"
}

@incollection{d-upoml-85
, author =	"V. A. Dubovitskij"
, title =	"The {Ulam} Problem of Optimal Motion of Line Segments"
, booktitle =	"Optimization Software"
, publisher =	"??"
, address =	"New York, NY"
, year =	1985
, update =	"98.03 bibrelex"
}

@book{dnf-mg-79
, author =	"B. Dubrovin and S. Novikov and A. Fomenko"
, title =	"Modern Geometry"
, publisher =	"??"
, address =	"Moscow"
, year =	1979
, update =	"98.07 bibrelex"
}

@book{dfn-mgma-84
, author =	"B. A. Dubrovin and A. T. Fomenko and S. P. Novikov"
, title =	"Modern Geometry - {Methods} and Applications"
, publisher =	"Springer-Verlag"
, year =	1984
, update =	"98.03 bibrelex"
}

@inproceedings{dms-pcmsd-97
, author =	"D. Dubrule and P. Morin and J.-R. Sack"
, title =	"A Parallel Cartographic Modelling System: design, implementation and performance"
, booktitle =	"Proc. GIS'97"
, site =	"Vancouver"
, year =	1997
, pages =	"16--20"
, update =	"97.11 sack"
}

@article{dmr-cmc-92
, author =	"Carolyn K. Duby and Scott Meyers and Steven P. Reiss"
, title =	"{CCEL}: a metalanguage for {C}++"
, journal =	"Proc. Second Usenix C++ Conference"
, volume =	"??"
, month =	aug
, year =	1992
, update =	"97.03 tamassia"
}

@article{dhvm-rpgvl-83
, author =	"P. Duchet and Y. Hamidoune and M. Las Vergnas and H. Meyniel"
, title =	"Representing a Planar Graph by Vertical Lines Joining Different Levels"
, journal =	"Discrete Math."
, volume =	46
, year =	1983
, pages =	"319--321"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@Article{d-osa-00,
  author =       {Lionel Ducos},
  title =        {Optimizations of the Subresultant Algorithm},
  journal =      {Journal of Pure and Applied Algebra},
  year =         2000,
  volume =       145,
  pages =        {149--163}
}

@book{dh-pcsa-73
, author =	"R. O. Duda and P. E. Hart"
, title =	"Pattern Classification and Scene Analysis"
, publisher =	"Wiley-Interscience"
, address =	"New York"
, year =	1973
, update =	"97.07 agarwal"
}

@article{dh-uhtdl-72
, author =	"R. O. Duda and P. E. Hart"
, title =	"Use of the {Hough} transform to detect lines and curves in pictures"
, journal =	"Commun. ACM"
, volume =	15
, month =	jan
, year =	1972
, pages =	"11--15"
, update =	"96.09 orourke"
}

@inproceedings{drw-lrmt-95
, author =	"Gregory Dudek and Kathleen Romanik and Sue Whitesides"
, title =	"Localizing a Robot with Minimum Travel"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"437--446"
, keywords =	"visibility polygons, localization, on-line"
, precedes =	"drw-lrmt-98"
, update =	"98.07 mitchell, 96.09 agarwal+romanik, 96.05 mitchell"
}

@article{drw-lrmt-98
, author =	"Gregory Dudek and Kathleen Romanik and Sue Whitesides"
, title =	"Localizing a Robot with Minimum Travel"
, journal =	"SIAM J. Comput."
, volume =	27
, number =	2
, month =	apr
, year =	1998
, pages =	"583--604"
, keywords =	"visibility polygons, localization, on-line"
, succeeds =	"drw-lrmt-95"
, update =	"98.07 mitchell"
}

@article{d-brdnc-79
, author =	"R. M. Dudley"
, title =	"Balls in {$R^{k}$} do not cut all subsets of $k+2$ points"
, journal =	"Adv. Math."
, volume =	31
, year =	1979
, pages =	"306--308"
, update =	"98.03 bibrelex"
}

@article{d-cltem-78
, author =	"R. M. Dudley"
, title =	"Central limit theorems for empirical measures"
, journal =	"Ann. Probab."
, volume =	"??"
, year =	1978
, pages =	"899--929"
, update =	"97.11 bibrelex"
}

@article{d-mescs-74
, author =	"R. M. Dudley"
, title =	"Metric entropy of some classes of sets with differentiable boundaries"
, journal =	"J. Approx. Theory"
, volume =	10
, year =	1974
, pages =	"227--236"
, update =	"98.03 bibrelex"
}

@article{d-lbfgw-91
, author =	"R. J. Duffin"
, title =	"Lines of best fit by graphics and the {Wald} line"
, journal =	"Amer. Math. Monthly"
, volume =	98
, number =	9
, year =	1991
, pages =	"835--840"
, keywords =	"linear programming, fitting"
, update =	"95.09 korneenko"
}

@article{d-ppsfe-00
, author =	"A. Dumitrescu"
, title =	"Planar point sets with few empty convex polygons"
, journal =	"Studia Sci. Math. Hungar"
, volume =	36
, year =	2000
, pages =	""
, update =	"02.03 devillers"
}

@article{dgpw-etp-01
, author =	"A. Dumitrescu and B. G{\"a}rtner and S. Pedroni and E. Welzl"
, title =	"Enumerating triangulation paths"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"3--12"
, update =	"01.11 smid"
}

@article{dk-mcpps-01
, author =	"A. Dumitrescu and R. Kaye"
, title =	"Matching colored points in the plane: {Some} new results"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"69--85"
, update =	"01.07 smid"
}

@inproceedings{dm-aatnp-01
, author =	"A. Dumitrescu and J. S. B. Mitchell"
, title =	"Approximation algorithms for {TSP} with Neighborhoods in the plane"
, booktitle =	"Proc. 12th Symp. on Discrete Algorithms"
, year =	2001
, pages =	"38--46"
, update =	"02.03 cheong"
}

@article{do--93
, author =	"B. S. Duncan and A. J. Olson"
, title =	"??"
, journal =	"Biopolymers"
, volume =	33
, year =	1993
, pages =	"219--229"
, update =	"98.03 bibrelex"
}

@phdthesis{d-bart-99
, author =	"C. A. Duncan"
, title =	"Balanced Aspect Ratio Trees"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Computer Science, Johns Hopkins University"
, address =	"Baltimore, Maryland"
, year =	1999
, keywords =	"doctoral thesis"
, update =	"01.11 smid"
}

@inproceedings{dgk-bartc-99
, author =	"C. A. Duncan and M. T. Goodrich and S. Kobourov"
, title =	"Balanced aspect ratio trees: combining the advantages of k-d trees and octrees"
, booktitle =	"Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg."
, nickname =	"SODA'99"
, site =	"Baltimore, Maryland"
, year =	1999
, pages =	"300--309"
, update =	"00.11 smid"
}

@article{dgk-bartc-01
, author =	"C. A. Duncan and M. T. Goodrich and S. Kobourov"
, title =	"Balanced aspect ratio trees: combining the advantages of k-d trees and octrees"
, journal =	"J. Algorithms"
, volume =	38
, year =	2001
, pages =	"303--333"
, update =	"01.11 smid"
}

@inproceedings{dgr-eaoac-97
, author =	"C. A. Duncan and M. T. Goodrich and E. A. Ramos"
, title =	"Efficient Approximation and Optimization Algorithms for Computational Metrology"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"121--130"
, update =	"97.03 held+tamassia"
}

@inproceedings{d-qpmdb-81
, author =	"M. R. Dunlavey"
, title =	"Query performance of a many-dimensional best-match algorithm"
, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
, year =	1981
, pages =	"389--396"
}

@article{dg-aivib-70
, author =	"R. D. D{\"u}ppe and H. J. Gottschalk"
, title =	"Automatische {Interpolation} von {Isolinien} bei willk{\"u}erlich verteilten {St{\"u}tzpunkten}"
, journal =	"Allgemeine Vermessungsnachrichten"
, volume =	77
, year =	1970
, pages =	"423--426"
}

@misc{d-q3d-94
, author =	"E. Durand"
, title =	"Quasitiler 3.0 documentation"
, year =	1994
, url =	"http//www.geom.umn.edu/apps/quasitiler/about.html"
, update =	"97.11 bibrelex"
}

@inproceedings{ddp-tvsap-97
, author =	"F. Durand and G. Drettakis and C. Peuch"
, title =	"The visibility skeleton: {A} powerful and efficient multi-purpose global visibility tool"
, booktitle =	"SIGGRAPH 97 Conference Proceedings"
, series =	"Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"Addison-Wesley"
, year =	1997
, pages =	"89--100"
, update =	"98.03 agarwal"
}

@inproceedings{ddp-3dvmv-97
, author =	"F. Durand and G. Drettakis and C. Puech"
, title =	"{3D} Visibility made visibly simple: {An} introduction to the Visibility Skeleton"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"475--476"
, keywords =	"video review"
, cites =	"ddp-3dvcn-96, ddp-tvsap-97, df-fsaal-94, dorp-rfmvs-96, dp-vcmvs-95, gm-cagld-90, pd-voag-90, p-srs3d-90, pv-vc-96, sg-fcsbu-94, t-caals-92, ZZZ"
, update =	"98.07 bibrelex, 97.11 orourke, 97.07 efrat"
}

@article{ddp-fahrgv-99
, author =	"F. Durand and G. Drettakis and C. Puech"
, title =	"Fast and accurate hierarchical radiosity using global visibility"
, journal =	"ACM Trans. Graph."
, volume =	18
, number =	2
, year =	1999
, pages =	"128--170"
, keywords =	"discontinuity meshing, form factor calculation, global illumination, global visibility, hierarchical radiosity, hierarchical triangulation, perception"
, update =	"01.04 pocchiola"
}

@inproceedings{ddp-3dvcn-96
, author =	"F. Durand and G. Drettakis and C. Puech"
, title =	"The $3$d visibility complex, a new approach to the problems of accurate visibility"
, booktitle =	"Proc. EUROGRAPHICS '96"
, site =	"Porto, Portugal"
, publisher =	"Springer-Verlag"
, month =	jun
, year =	1996
, pages =	"245--257"
, update =	"98.07 bibrelex"
}

@inproceedings{ddp-3dvcu-97
, author =	"Fr\'edo Durand and George Drettakis and Claude Puech"
, title =	"The {3D} Visibility Complex: a Unified Data--Structure for Global Visibility of Scenes of Polygons and Smooth Objects"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"153--158"
, update =	"97.11 jones"
}

@inproceedings{d-3dvs-98
, author =	"Fr{\'e}do Durand and George Drettakis and Claude Puech"
, title =	"The {3D} Visibility Skeleton"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"69--71"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{dorp-rfmvs-96
, author =	"Fr{\'e}do Durand and Rachel Orti and St{\'e}phane Rivei{\`e}re and Claude Puech"
, title =	"Radiosity in flatland made visibly simple"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V11--V12"
, cites =	"c-irepr-90, sgg-rrde-90, cbwg-bbaer-86, dp-vcmvs-95, h-sgiua-91, h-rf-92, pv-vc-93, pv-cvgpt-95, dorp-rdsfv-96, rodp-uvcrc-96, sp-rgi-94, r-tsvcp-95, th-gvaic-93, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{dorp-rdsfv-96
, author =	"F. Durand and R. Orti and S. Rivi{\`e}re and C. Puech"
, title =	"Radiosity for dynamic scenes in flatland with the visibility complex"
, booktitle =	"Eurographics '96"
, year =	1996
, note =	"Submitted"
, update =	"97.11 bibrelex"
}

@inproceedings{dp-vcmvs-95
, author =	"Fredo Durand and Claude Puech"
, title =	"The Visibility Complex Made Visibly Simple"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"V2"
, keywords =	"video review"
, cites =	"pv-vc-93, r-cddcd-93, cg-vippg-89, cgl-pgd-85, gm-osacv-91, ow-nmcvg-88, p-gfr-90, v-vddsv-90, v-dmvg-91, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@book{d-pm-1528
, author =	"Albrecht D{\"u}rer"
, title =	"The painter's manual: a manual of measurement of lines, areas, and solids by means of compass and ruler assembled by Albrecht D{\"u}rer for the use of all lovers of art with appropriate illustrations arranged to be printed in the year MDXXV"
, publisher =	"New York: Abaris Books, 1977"
, year =	1538
, note =	"Translated and with a commentary by Walter L. Strauss"
, comments =	"Found by Marty Demaine.
		Contains unfoldings of convex polyhedra."
, update =	"00.03 orourke"
}

@article{d-pofwp-90
, author =	"R. Durier"
, title =	"On {Pareto} optima, the {Fermat}-{Weber} problem, and polyhedral ..."
, journal =	"Math. Program."
, volume =	47
, number =	1
, year =	1990
, pages =	"65--80"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@article{dm-gpfwp-85
, author =	"R. Durier and C. Michelot"
, title =	"Geometrical properties of the {Fermat-Weber} problem"
, journal =	"European J. Oper. Res."
, volume =	20
, number =	3
, year =	1985
, pages =	"332--343"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@inproceedings{d-cugr-86
, author =	"H. Durrant-Whyte"
, title =	"Concerning Uncertain Geometry in Robotics"
, booktitle =	"International Workshop on Geometric Reasoning"
, site =	"Oxford, UK"
, month =	jul
, year =	1986
, update =	"98.03 bibrelex"
}

@article{d-ugr-88
, author =	"H. F. Durrant-Whyte"
, title =	"Uncertain geometry in robotics"
, journal =	"Internat. J. Robot. Autom."
, volume =	4
, number =	1
, year =	1988
, pages =	"23--31"
, update =	"95.09 korneenko"
}

@incollection{dk-ipgmi-89
, author =	"M. D{\"u}rst and T. L. Kunii"
, title =	"Integrated polytrees: a generalized model for the integration of spatial decomposition and boundary representation"
, editor =	"W. S. Strasser and H.-P. Seidel"
, booktitle =	"Theory and Practice of Geometric Modelling"
, year =	1989
, pages =	"329--348"
, keywords =	"data structuring, polygons"
, update =	"95.09 korneenko"
}

@article{d-armc-88
, author =	"M. J. D{\"u}rst"
, title =	"Additional reference to {M}arching {C}ubes"
, journal =	"Comput. Graph."
, volume =	22
, number =	4
, year =	1988
, pages =	"72--73"
, update =	"01.07 wenger"
}

@inproceedings{d-vpwmb-93
, author =	"Martin J. D{\"u}rst"
, title =	"On vertices and polyhedra without minimal boolean formulae"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"44--47"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@inproceedings{d-pdcbe-91
, author =	"Martin J. D{\"u}rst"
, title =	"Preclassification and delayed classification of boundary entities in arbitrary dimensions"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"57--69"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{dk-vcuch-89
, author =	"M. J. D{\"u}rst and T. L. Kunii"
, title =	"Vertex classification using the convex hull on a sphere"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"25--32"
, keywords =	"point-in-polyhedron, point location, Peterson-style boolean formula"
, update =	"95.09 mitchell"
}

@article{dm-pos-41
, author =	"B. Dushnik and E. W. Miller"
, title =	"Partially Ordered Sets"
, journal =	"Amer. J. Math."
, volume =	63
, year =	1941
, pages =	"600--610"
, update =	"94.05 franciosa"
}

@article{dc-gscml-89
, author =	"D. Dutta and P. K. Chaudhuri"
, title =	"Geometrical solution for a constrained minimax location problem"
, journal =	"Asia-Pacif. J. Oper. Res."
, volume =	6
, number =	2
, year =	1989
, pages =	"148--157"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@article{dh-ssco-93
, author =	"D. Dutta and C. Hoffmann"
, title =	"On the skeleton of simple {CSG} objects"
, journal =	"ASME J. Mech. Design"
, volume =	115
, year =	1993
, pages =	"87--94"
, update =	"98.07 bibrelex"
}

@inproceedings{dh-gisco-90
, author =	"D. Dutta and C. M. Hoffmann"
, title =	"A Geometric Investigation of the Skeleton of {CSG} Objects"
, booktitle =	"Proc. ASME Conf. Design Automation"
, site =	"Chicago, IL, USA"
, year =	1990
, pages =	""
, update =	"93.09 held"
}

@article{d-fecld-81
, author =	"G. Dutton"
, title =	"Fractal enhancement of cartographic line detail"
, journal =	"Amer. Cartogr."
, volume =	8
, year =	1981
, pages =	"23--40"
, keywords =	"implementing algorithms, computer graphics, cartography, algebraic geometry, fractals, construction, similarity, shape, boundary representation, curves"
}

@article{d-gmpr-84
, author =	"G. Dutton"
, title =	"Geodesic modelling of planetary relief"
, journal =	"Cartographica"
, volume =	21
, year =	1984
, pages =	"188--207"
, keywords =	"data structuring, terrain modelling, construction, approximation, geodesics, locus approach, implicit data structures, triangulations, polyhedra"
}

@inproceedings{dm-epigd-80
, author =	"G. Dutton and S. Morehouse"
, title =	"Extraction of polygonal information from gridded data"
, booktitle =	"Proc. 4th Internat. Sympos. Comput.-Assist. Cartog."
, site =	"Falls Church, VA"
, year =	1980
, pages =	"320--327"
, keywords =	"implementing algorithms, image processing, cartography, construction, shape, contours, polygonal chains, topological, curves"
, update =	"93.05 freimer"
}

@inproceedings{dhw-csma-93
, author =	"C. Dwork and M. Herlihy and O. Waarts"
, title =	"Contention in Shared Memory Algorithms"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"174--183"
, update =	"96.09 orourke"
}

@article{d-chsss-91
, author =	"R. Dwyer"
, title =	"Convex hulls of samples from spherically symmetric distributions"
, journal =	"Discrete Appl. Math."
, volume =	31
, number =	2
, year =	1991
, pages =	"113--132"
, keywords =	"convex hull, probabilistic analysis"
, update =	"95.09 korneenko"
}

@article{d-mmb-93
, author =	"R. Dwyer"
, title =	"Maximal and minimal balls"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"261--275"
, update =	"96.09 devillers"
}

@article{d-chrpp-88
, author =	"R. Dwyer"
, title =	"On the convex hull of random points in a polytope"
, journal =	"J. Appl. Probab."
, volume =	25
, number =	4
, year =	1988
, pages =	"688--699"
, keywords =	"convex hull, probabilistic analysis"
, update =	"95.09 korneenko"
}

@article{d-enkfv-93
, author =	"R. Dwyer"
, title =	"The expected number of $k$-faces of a {Voronoi} diagram"
, journal =	"Internat. J. Comput. Math."
, volume =	26
, number =	5
, year =	1993
, pages =	"13--21"
, keywords =	"$d$-dimensional, Voronoi diagram"
, update =	"95.09 korneenko"
}

@article{d-essig-95
, author =	"R. Dwyer"
, title =	"The expected size of the sphere-of-influence graph"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"155--164"
, update =	"96.09 devillers"
}

@article{de-mee-96
, author =	"R. Dwyer and W. Eddy"
, title =	"Maximal empty ellipsoids"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"169--186"
, update =	"96.09 devillers"
}

@article{d-fdcac-87
, author =	"R. A. Dwyer"
, title =	"A faster divide-and-conquer algorithm for constructing {Delaunay} triangulations"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"137--151"
, succeeds =	"d-sdcac-86"
}

@inproceedings{d-sdcac-86
, author =	"R. A. Dwyer"
, title =	"A simple divide-and-conquer algorithm for computing {Delaunay} triangulations in {$O(n \log\log n)$} expected time"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"276--284"
, precedes =	"d-fdcac-87"
, cites =	"bwy-oetac-80, f-savd-86, gs-pmgsc-85, h-oarms-79, l-tdvdl-80, ls-tacdt-80, lw-vdllm-80, m-dtchn-84, oim-iimvd-84, s-let-78, gs-cdtp-78, s-cg-78, ZZZ"
, update =	"98.03 bibrelex"
}

@phdthesis{d-acaac-88
, author =	"R. A. Dwyer"
, title =	"Average-case analysis of algorithms for convex hulls and {Voronoi} diagrams"
, type =	"Ph.{D}. Thesis"
, school =	"Comput. Sci. Dept., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1988
, note =	"Report CMU-CS-88-132"
, keywords =	"doctoral thesis"
, update =	"95.01 smid"
}

@inproceedings{d-chpss-89
, author =	"R. A. Dwyer"
, title =	"Convex hulls of points from spherically symmetric distributions"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	2
}

@inproceedings{d-hdvdl-89
, author =	"R. A. Dwyer"
, title =	"Higher-dimensional {Voronoi} diagrams in linear expected time"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"326--333"
, precedes =	"d-hdvdl-91"
, cites =	"ab-acddv-83, b-wcach-82, b-cdt-81, b-gtfga-80, bdf-cvp-78, ck-acp-70, d-fdcac-87, d-chrpp-88, e-chrsp-65, f-pcvp-79, g-rssc-62, m-dtchn-84, m-iaeln-53, m-irs-71, r-slcdn-70, s-cvdhd-82, s-nfhdv-87, s-chdch-86, s-fchff-85, too-natdv-83, t-pala-11, v-nadpc-08, w-cnddt-81, ZZZ"
, update =	"98.03 bibrelex"
}

@article{d-hdvdl-91
, author =	"R. A. Dwyer"
, title =	"Higher-dimensional {Voronoi} diagrams in linear expected time"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"343--367"
, succeeds =	"d-hdvdl-89"
}

@article{d-kgaca-90
, author =	"R. A. Dwyer"
, title =	"Kinder, gentler average-case analysis for convex hulls and maximal vectors"
, journal =	"SIGACT News"
, volume =	21
, number =	2
, year =	1990
, pages =	"64--71"
, keywords =	"probabilistic analysis, expected-case analysis, convex hull, $d$-dimensional"
}

@inproceedings{d-lvgwi-90
, author =	"R. A. Dwyer"
, title =	"Las {Vegas} gift-wrapping is twice as fast"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"261--264"
, cites =	"ck-acp-70, s-fchff-85, ZZZ"
, update =	"98.07 bibrelex"
}

@article{d-vdchr-00
, author =	"R. A. Dwyer"
, title =	"{Voronoi} diagrams and convex hulls of random moving points"
, journal =	"Discrete Comput. Geom."
, volume =	23
, year =	2000
, pages =	"343--365"
, update =	"01.11 smid"
}

@article{d-vdrlf-97
, author =	"R. A. Dwyer"
, title =	"{Voronoi} diagrams of random lines and flats"
, journal =	"Discrete Comput. Geom."
, volume =	17
, year =	1997
, pages =	"123--136"
, update =	"98.03 agarwal"
}

@article{d-tcpp-90
, author =	"H. Dyckhoff"
, title =	"A typology of cutting and packing problems"
, journal =	"European J. Oper. Res."
, volume =	44
, number =	2
, year =	1990
, pages =	"145--160"
, keywords =	"packing, covering"
, update =	"95.09 korneenko"
}

@article{d-fpacp-80
, author =	"C. R. Dyer"
, title =	"A fast parallel algorithm for the closest pair problem"
, journal =	"Inform. Process. Lett."
, volume =	11
, year =	1980
, pages =	"49--52"
}

@article{d-cenii-80
, author =	"C. R. Dyer"
, title =	"Computing the {Euler} number of an image from its quadtree"
, journal =	"Comput. Graph. Image Process."
, volume =	13
, year =	1980
, pages =	"270--276"
}

@article{d-seq-82
, author =	"C. R. Dyer"
, title =	"The space efficiency of quadtrees"
, journal =	"Comput. Graph. Image Process."
, volume =	19
, year =	1982
, pages =	"335--348"
}

@article{drs-rrbcq-80
, author =	"C. R. Dyer and A. Rosenfeld and H. Samet"
, title =	"Region representation: boundary codes from quadtrees"
, journal =	"Commun. ACM"
, volume =	23
, year =	1980
, pages =	"171--179"
}

@incollection{df-cvcbc-91
, author =	"Martin Dyer and Alan Frieze"
, title =	"Computing the volume of convex bodies: {A} case where randomness provably helps"
, editor =	"B. Bollob{\' a}s"
, booktitle =	"Probabilistic Combinatorics and Its Applications"
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1991
, pages =	"123--169"
, update =	"00.11 smid, 00.07 agarwal"
}

@incollection{dm-lpld-97
, author =	"M. Dyer and N. Megiddo"
, title =	"Linear programming in low dimensions"
, chapter =	38
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"699--710"
, update =	"97.11 orourke"
}

@inproceedings{d-ccpac-92
, author =	"M. E. Dyer"
, title =	"A class of convex programs with applications to computational geometry"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"9--15"
, cites =	"c-sagcp-88, c-lpot-86, c-lvalp-88, dk-ladsc-85, d-mstia-86, gls-gaco-88, j-ba1-85, m-lpltw-84, m-bsb-89, m-mpta-86, p-mse-84, r-fpade-88, sw-cblpr-92, w-sedbe-91a, ZZZ"
, update =	"97.11 bibrelex, 97.03 agarwal"
}

@incollection{d-gatcl-83
, author =	"Martin E. Dyer"
, title =	"A Geometric Approach to Two-Constraint Linear Programming with Generalized Upper Bounds"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"79--90"
, keywords =	"linear programming"
, update =	"01.04 icking, 95.09 korneenko"
}

@techreport{d-ltalp-82
, author =	"M. E. Dyer"
, title =	"A linear time algorithm for locating a point in the intersection of $2$-polyhedra"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Math. Statist., Teesside Polytech."
, address =	"Middlesbrough, England"
, year =	1982
}

@inproceedings{d-palpf-95
, author =	"Martin E. Dyer"
, title =	"A Parallel Algorithm for Linear Programming in Fixed Dimension"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"345--349"
, keywords =	""
, cites =	"akss-dsot-86, am-dptnp-92, am-plpfd-90, bh-obdpc-87, cm-ltdao-93, c-lvalp-88, c-lpot-86, c-pms-88, d-opalp-90, d-mstia-86, g-gpmee-93, kr-pasmm-90, m-lpltw-84, v-pcp-75, ZZZ"
, update =	"98.03 bibrelex, 97.03 agarwal, 95.09 mitchell"
}

@techreport{d-soai3-80
, author =	"M. E. Dyer"
, title =	"A simplified {$O(n \log n)$} algorithm for the intersection of $3$-polyhedra"
, type =	"Report"
, number =	"TPMR 80-5"
, institution =	"Dept. Math. Statist., Teesside Polytech."
, address =	"Middlesbrough, England"
, year =	1980
}

@techreport{d-onamc-81
, author =	"M. E. Dyer"
, title =	"An $O(n)$ algorithm for multiple-choice knapsack linear program"
, type =	"report"
, institution =	"Math Dept. Teesside Polytechnic."
, address =	"Middlesbrough, England"
, year =	1981
, keywords =	"prune and search, linear programming"
, update =	"95.09 korneenko"
}

@article{d-ltatt-84
, author =	"M. E. Dyer"
, title =	"Linear time algorithms for two- and three-variable linear programs"
, journal =	"SIAM J. Comput."
, volume =	13
, year =	1984
, pages =	"31--45"
, keywords =	"linear programming"
}

@article{d-mstia-86
, author =	"M. E. Dyer"
, title =	"On a multidimensional search technique and its application to the {Euclidean} one-centre problem"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"725--738"
, update =	"96.09 agarwal"
}

@article{d-clpp-91
, author =	"M. E. Dyer"
, title =	"On counting lattice points in polyhedra"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"695--707"
, update =	"97.03 agarwal"
}

@article{d-cvem-83
, author =	"M. E. Dyer"
, title =	"The complexity of vertex enumeration methods"
, journal =	"Math. Oper. Res."
, volume =	8
, year =	1983
, pages =	"381--402"
, keywords =	"linear programming, convex hull"
, update =	"95.09 korneenko"
}

@techreport{d-tvlpa-82
, author =	"M. E. Dyer"
, title =	"Two-variable linear programs are solvable in linear time"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Math. Statist., Teesside Polytech."
, address =	"Middlesbrough, England"
, year =	1982
}

@article{df-ccv-88
, author =	"M. E. Dyer and A. Frieze"
, title =	"On the complexity of computing volume"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"967--975"
, keywords =	"volume, convex, complexity theory"
, update =	"97.03 agarwal"
}

@article{df-p3inc-86
, author =	"M. E. Dyer and A. Frieze"
, title =	"Planar $3${DM} is {NP}-complete"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"174--184"
, update =	"97.03 agarwal"
}

@inproceedings{dfk-rptaa-89
, author =	"M. E. Dyer and A. Frieze and R. Kannan"
, title =	"A random polynomial time algorithm for approximating the volume of convex bodies"
, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
, year =	1989
, pages =	"375--381"
, keywords =	"approximation, volume, convex"
, precedes =	"dfk-rptaa-91"
, update =	"97.03 agarwal"
}

@article{dfk-rptaa-91
, author =	"M. E. Dyer and A. Frieze and R. Kannan"
, title =	"A random polynomial time algorithm for approximating the volume of convex bodies"
, journal =	"J. ACM"
, volume =	38
, year =	1991
, pages =	"1--17"
, keywords =	"approximation, volume, convex"
, succeeds =	"dfk-rptaa-89"
, update =	"97.03 agarwal"
}

@article{df-pamwe-84
, author =	"M. E. Dyer and A. M. Frieze"
, title =	"A partitioning algorithm for minimum weighted {Euclidean} matching"
, journal =	"Inform. Process. Lett."
, volume =	18
, year =	1984
, pages =	"59--62"
}

@article{df-rafdl-89
, author =	"M. E. Dyer and A. M. Frieze"
, title =	"A randomized algorithm for fixed-dimension linear programming"
, journal =	"Math. Program."
, volume =	44
, number =	2
, year =	1989
, pages =	"203--212"
, keywords =	"linear programming, Las Vegas, $d$-dimensional"
, update =	"96.09 agarwal, 95.09 korneenko"
}

@techreport{df-rafdl-87
, author =	"M. E. Dyer and A. M. Frieze"
, title =	"A Randomized Algorithm for Fixed-Dimensional Linear Programming"
, type =	"Manuscript"
, institution =	"??"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{df-shpcp-85
, author =	"M. E. Dyer and A. M. Frieze"
, title =	"A simple heuristic for the $p$-centre problem"
, journal =	"Oper. Res. Lett."
, volume =	3
, year =	1985
, pages =	"285--288"
, keywords =	"facility location"
, update =	"95.09 korneenko"
}

@article{dfm-phtgm-84
, author =	"M. E. Dyer and A. M. Frieze and C. J. H. McDiarmid"
, title =	"Partitioning heuristics for two geometric maximization problems"
, journal =	"Oper. Res. Lett."
, volume =	3
, year =	1984
, pages =	"267--270"
, keywords =	"heuristics"
}

@techreport{dgh-ccmv-94
, author =	"M. E. Dyer and P. Gritzmann and A. Hufnagel"
, title =	"On the complexity of computing mixed volumes"
, type =	"Manuscript"
, institution =	"??"
, year =	1994
, update =	"98.03 bibrelex"
}

@article{dp-adaep-77
, author =	"M. E. Dyer and L. G. Proll"
, title =	"An algorithm for determining all extreme points of a convex polytope"
, journal =	"Math. Program."
, volume =	12
, year =	1977
, pages =	"81--96"
}

@inproceedings{dm-bcpo-89
, author =	"P. C. Dykstra and M. J. Muuss"
, title =	"The {BRL}-{CAD} Package: An Overview"
, booktitle =	"Proc. BRL-CAD Symposium '89"
, site =	"Aberdeen Proving Ground, Maryland"
, year =	1989
, pages =	"1--9"
, update =	"93.09 goodrich"
}

@inproceedings{dc-hcpc-80
, author =	"P. W. Dymon and S. A. Cook"
, title =	"Hardware Complexity and Parallel Comuting"
, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1980
, pages =	"360--372"
, update =	"98.03 bibrelex"
}

@incollection{dlr-acddt-90
, author =	"N. Dyn and D. Levin and S. Rippa"
, title =	"Algorithms for the Construction of Data Dependent Triangulations"
, editor =	"J. C. Mason and M. G. Cox"
, booktitle =	"Algorithms for Approximation II"
, publisher =	"Chapman and Hall"
, address =	"London"
, year =	1990
, pages =	"185--192"
}

@article{dlr-ddtpl-90
, author =	"Nira Dyn and David Levin and Samuel Rippa"
, title =	"Data Dependent Triangulations for Piecewise Linear Interpolation"
, journal =	"IMA Journal of Numerical Analysis"
, volume =	10
, year =	1990
, pages =	"137--154"
, annote =	"Triangulation for fitting a surface over 3d data.
		 Choose triangulation that depends on the 3d data rather
		 than its projection to 2d. LOT based on minimizing the
		 angle between adjacent triangles."
}

@article{e-hgd-84
, author =	"P. Eades"
, title =	"A Heuristic for Graph Drawing"
, journal =	"Congr. Numer."
, volume =	42
, year =	1984
, pages =	"149--160"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{e-ciddg-89
, author =	"P. Eades"
, title =	"Complexity Issues in Drawing Directed Graphs"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, month =	nov
, year =	1989
, pages =	"9--15"
, keywords =	"graph drawing"
, update =	"95.09 mitchell, 93.09 tamassia"
}

@incollection{e-sfa-88
, author =	"P. Eades"
, title =	"Symmetry finding algorithms"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"41--51"
}

@inproceedings{ech-oagdw-97
, author =	"Peter Eades and Robert F. Cohen and Mao Lin Huang"
, title =	"Online Animated Graph Drawing for Web Navigation"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"330--335"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{ef-dcgog-97
, author =	"Peter Eades and {Qing-Wen} Feng"
, title =	"Drawing Clustered Graphs on an Orthogonal Grid"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"146--157"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{efk-ssdga-88
, author =	"P. Eades and I. Fogg and D. Kelly"
, title =	"{SPREMB}: a System for Developing Graph Algorithms"
, journal =	"Congr. Numer."
, volume =	66
, year =	1988
, pages =	"123--140"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@incollection{efg-ehimw-82
, author =	"P. Eades and L. Foulds and J. Giffin"
, title =	"An Efficient Heuristic for Identifying a Maximal Weight Planar Subgraph"
, booktitle =	"Combinatorial Mathematics IX"
, series =	"Lecture Notes Comput. Sci."
, volume =	952
, publisher =	"Springer-Verlag"
, year =	1982
, pages =	"239--251"
, keywords =	"graph drawing"
, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
}

@inproceedings{eg-dspg-96
, author =	"P. Eades and P. Garvan"
, title =	"Drawing Stressed Planar Graphs in Three Dimensions"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	""
, keywords =	"graph drawing, 3D, convex, straight-line"
, update =	"96.09 tamassia"
}

@inproceedings{ehw-fbvtd-97
, author =	"Peter Eades and Michael E. Houle and Richard Webber"
, title =	"Finding the Best Viewpoints for Three-Dimensional Graph Drawings"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"87--98"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{ek-hrc2l-86
, author =	"P. Eades and D. Kelly"
, title =	"Heuristics for Reducing Crossings in 2-Layered Networks"
, journal =	"Ars Combin."
, volume =	"21.A"
, year =	1986
, pages =	"89--98"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}


@article{eksw-eecaccc-06
, author =      "Eigenwillig, Arno and Kettner, Lutz and Sch{\"o}mer, Elmar and Wolpert, Nicola"
, title =       "Exact, Efficient and Complete Arrangement Computation for Cubic Curves"
, journal =     "Computational Geometry"
, publisher =   "Elsevier"
, year =        "2006"
, number =      "1-2"
, volume =      "35"
, pages =       "36--73"
, address =     "Amsterdam, The Netherlands"
, month =       "August"
, isbn =        "0925-7721"
}

@inproceedings{elms-pmmd-91
, author =	"P. Eades and W. Lai and K. Misue and K. Sugiyama"
, title =	"Preserving the Mental Map of a Diagram"
, booktitle =	"Proceedings of Compugraphics 91"
, year =	1991
, pages =	"24--33"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{el-adaal-93
, author =	"P. Eades and T. Lin"
, title =	"Algorithmic and Declarative Approaches to Aesthetic Layout"
, booktitle =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
, site =	"Paris, France"
, month =	sep
, year =	1993
, keywords =	"graph drawing"
, update =	"94.01 tamassia"
}

@inproceedings{ell-mshvd-92
, author =	"P. Eades and T. Lin and X. Lin"
, title =	"Minimum Size h-v Drawings"
, booktitle =	"Proc. Advanced Visual Interfaces"
, series =	"World Scientific Series in Computer Science"
, volume =	36
, year =	1992
, pages =	"386--394"
, keywords =	"graph drawing"
, update =	"94.01 tamassia, 93.09 tamassia"
}

%    xxx = Key Centre for Software Technology,
@techreport{ell-ttdc-90
, author =	"P. Eades and T. Lin and X. Lin"
, title =	"Two Tree Drawing Conventions"
, number =	174
, institution =	"Department of Computer Science, University of Queensland"
, year =	1990
, keywords =	"graph drawing"
, precedes =	"ell-ttdc-93"
, update =	"97.03 rote, 96.09 devillers, 93.09 tamassia"
}

@article{ell-ttdc-93
, author =	"P. Eades and T. Lin and X. Lin"
, title =	"Two Tree Drawing Conventions"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"133--153"
, keywords =	"layout, tree drawing, dynamic programming, classical convention, tip-over convention, NP-hardness"
, succeeds =	"ell-ttdc-90"
, update =	"96.09 devillers"
}

@inproceedings{el-hddg-89
, author =	"P. Eades and X. Lin"
, title =	"How to Draw a Directed Graph"
, booktitle =	"Proc. IEEE Workshop on Visual Languages"
, nickname =	"VL '89"
, year =	1989
, pages =	"13--17"
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 95.05 tamassia, 93.09 tamassia"
}

@inproceedings{el-nlapd-91
, author =	"P. Eades and X. Lin"
, title =	"Notes on the Layer Assignment Problem for Drawing Directed Graphs"
, booktitle =	"ACSC 14: Proceedings of the 14th Australian Computer Science Conference"
, year =	1991
, pages =	"26.1--26.10"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{elm-msgd-90
, author =	"P. Eades and X. Lin and B. D. McKay"
, title =	"Models for symmetric graph drawing"
, type =	"Manuscript"
, institution =	"Univ. Queensland"
, year =	1990
, update =	"98.07 bibrelex"
}

@inproceedings{elt-nadhg-90
, author =	"P. Eades and X. Lin and R. Tamassia"
, title =	"A new approach for drawing a hierarchical graph"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"143--146"
, precedes =	"elt-adhg-92, elt-adhg-96"
, cites =	"bm-gta-76, dn-atphg-87, cpru-cdfs-87, el-hddg-89, elm-msgd-90, et-adgab-89, ew-ecdbg-, gnv-dptdd-88, gj-cninc-83, lrt-gnd-79, m-ed2lh-88, rdmmst-bdg-87, s-cagd-87, stt-mvuhs-81, t-eggmn-87, t-hdg-63, ZZZ"
, update =	"98.07 bibrelex"
}

@misc{elt-adhg-92
, author =	"P. Eades and X. Lin and R. Tamassia"
, title =	"An Algorithm for Drawing a Hierarchical Graph"
, year =	1992
, keywords =	"graph drawing"
, succeeds =	"elt-nadhg-90"
, precedes =	"elt-adhg-96"
, update =	"98.03 bibrelex, 96.09 devillers, 93.09 tamassia"
}

@article{elt-adhg-96
, author =	"P. Eades and X. Lin and R. Tamassia"
, title =	"An Algorithm for Drawing a Hierarchical Graph"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"145--156"
, url =	"http://www.cs.brown.edu/cgc/papers/elt-adhg-96.ps.gz"
, succeeds =	"elt-adhg-92"
, update =	"97.03 tamassia, 96.09 devillers"
}

@techreport{elw-pgmpt-90
, author =	"Peter Eades and Xuemin Lin and Nicolas C. Wormald"
, title =	"Performance Guarantees for Motion Planning with Temporal Uncertainty"
, number =	173
, institution =	"Dept. of Computer Science, Univ. of Queensland"
, address =	"St. Lucia, Queensland, Australia"
, year =	1990
, precedes =	"elw-pgmpt-93"
, update =	"98.11 bibrelex, 98.07 bibrelex+icking, 98.03 icking+mitchell"
}

@article{elw-pgmpt-93
, author =	"Peter Eades and Xuemin Lin and Nicolas C. Wormald"
, title =	"Performance Guarantees for Motion Planning with Temporal Uncertainty"
, journal =	"Australian Computer Journal"
, volume =	25
, number =	1
, year =	1993
, pages =	"21--28"
, succeeds =	"elw-pgmpt-90"
, update =	"98.03 icking+mitchell"
}

@inproceedings{em-gdcr-95
, author =	"P. Eades and J. Marks"
, title =	"Graph Drawing Contest Report"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"143--146"
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@inproceedings{emn-gdcr-97
, author =	"Peter Eades and Joe Marks and Stephen North"
, title =	"Graph-Drawing Contest Report"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"438--445"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{emw-ecp-86
, author =	"P. Eades and B. McKay and N. Wormald"
, title =	"On an Edge Crossing Problem"
, booktitle =	"Proc. 9th Australian Computer Science Conference"
, year =	1986
, pages =	"327--334"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{er-ccmsp-93
, author =	"P. Eades and D. Rappaport"
, title =	"The complexity of computing minimum separating polygons"
, journal =	"Pattern Recogn. Lett."
, volume =	14
, year =	1993
, pages =	"715--718"
, update =	"98.03 bibrelex+mitchell, 93.09 milone+mitchell"
}

@article{esw-tkbtd-96
, author =	"P. Eades and C. Stirk and S. Whitesides"
, title =	"The Techniques of {Kolmogorov} and {Bardzin} for Three Dimensional Orthogonal Graph Drawings"
, journal =	"Inform. Process. Lett."
, volume =	60
, year =	1996
, pages =	"97--103"
, keywords =	"graph drawing, orthogonal, 3D"
, update =	"98.11 tamassia"
}

@techreport{esw-tkbtd-95
, author =	"P. Eades and C. Stirk and S. Whitesides"
, title =	"The Techniques of {Komolgorov} and {Bardzin} for Three Dimensional Orthogonal Graph Drawings"
, type =	"Manuscript"
, institution =	"Dept. of Computer Sci., Univ. of Newcastle"
, year =	1995
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 96.09 tamassia"
}

@article{es-hddg-91
, author =	"P. Eades and K. Sugiyama"
, title =	"How to Draw a Directed Graph"
, journal =	"J. Inform. Process."
, volume =	13
, year =	1991
, pages =	"424--437"
, keywords =	"graph drawing"
, update =	"98.07 tamassia, 93.09 tamassia"
}

@inproceedings{esw-tatdo-97
, author =	"P. Eades and A. Symvonis and S. Whitesides"
, title =	"Two Algorithms for Three Dimensional Orthogonal Graph Drawing"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"139--154"
, keywords =	"graph drawing, 3D, orthogonal"
, update =	"98.07 patrignani"
}

@techreport{et-aagda-87
, author =	"P. Eades and R. Tamassia"
, title =	"Algorithms for automatic graph drawing: an annotated bibliography"
, type =	"Report"
, number =	82
, institution =	"Department of Computer Science, University of Queensland"
, address =	"St. Lucia, Queensland, Australia"
, year =	1987
, keywords =	"graph drawing"
, precedes =	"et-adgab-89"
, update =	"93.09 tamassia"
}

@techreport{et-adgab-89
, author =	"P. Eades and R. Tamassia"
, title =	"Algorithms for Drawing Graphs: An Annotated Bibliography"
, type =	"Report"
, number =	"CS-09-89"
, institution =	"Department of Computer Science, Brown University"
, address =	"Providence, RI"
, month =	feb
, year =	1989
, keywords =	"graph drawing, graph theory, computer graphics, bibliography"
, succeeds =	"et-aagda-87"
, precedes =	"dett-adgab-93"
, update =	"93.09 jones+milone+mitchell+tamassia, 93.05 jones"
, annote =	"``lists about 180 papers, both theoretical and
		 application oriented''"
}

@article{ew-dgtl-94
, author =	"P. Eades and S. Whitesides"
, title =	"Drawing Graphs in Two Layers"
, journal =	"Theoret. Comput. Sci."
, volume =	131
, number =	2
, year =	1994
, pages =	"361--374"
, update =	"98.07 vismara"
}

@inproceedings{ew-rpems-94
, author =	"P. Eades and S. Whitesides"
, title =	"The Realization Problem for {Euclidean} Minimum Spanning Trees is {NP}-Hard"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"49--56"
, keywords =	"graph drawing, proximity, NP-hardness"
, cites =	"bll-cpt-93, b-ndgta-88, ds-ltati-92, ds-smrdd-93, e-dft-92, gj-cigtn-79, i-dtg-90, mrh-dcaal-91, ms-tgmst-91, rt-tdt-81, s-rrddl-84, v-ucvc-81, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex, 94.09 jones, 94.01 jones"
}

@article{ew-rpems-96
, author =	"P. Eades and S. Whitesides"
, title =	"The Realization Problem for {Euclidean} Minimum Spanning Trees is {NP}-hard"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"60--82"
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
, keywords =	"graph drawing, proximity, NP-hardness"
, succeeds =	"ew-rpems-94"
, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@techreport{ew-ecdbg-
, author =	"P. Eades and N. Wormald"
, title =	"Edge Crossings in Drawings of Bipartite Graphs"
, number =	108
, institution =	"Department of Computer Science, University of Queensland"
, note =	"to appear in Algorithmica"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ew-felgd-90
, author =	"P. Eades and N. Wormald"
, title =	"Fixed Edge Length Graph Drawing is {NP}-hard"
, journal =	"Discrete Appl. Math."
, volume =	28
, year =	1990
, pages =	"111--134"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{ew-mhd2l-86
, author =	"P. Eades and N. Wormald"
, title =	"The Median Heuristic for Drawing 2-Layered Networks"
, number =	69
, institution =	"Department of Computer Science, University of Queensland"
, year =	1986
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ew-ecdbg-94
, author =	"P. Eades and N. C. Wormald"
, title =	"Edge Crossings in Drawings of Bipartite Graphs"
, journal =	"Algorithmica"
, volume =	11
, number =	4
, year =	1994
, pages =	"379--403"
, keywords =	"graph drawing, NP-complete, crossings, bipartite, layered"
, succeeds =	"ew-ecdbg-"
, update =	"98.07 tamassia+vismara"
}

@article{e-dft-92
, author =	"P. D. Eades"
, title =	"Drawing Free Trees"
, journal =	"Bulletin of the Institute for Combinatorics and its Applications"
, volume =	5
, year =	1992
, pages =	"10--36"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{e-tfcgc-88
, title =	"Theoretical Foundations of Computer Graphics and {CAD}"
, editor =	"R. A. Earnshaw"
, series =	"NATA ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{e-obsnn-81
, author =	"C. M. Eastman"
, title =	"Optimal bucket size for nearest neighbor searching in $k$-d trees"
, journal =	"Inform. Process. Lett."
, volume =	12
, year =	1981
, pages =	"165--167"
}

@article{e-rsp-70
, author =	"C. M. Eastman"
, title =	"Representations for space planing"
, journal =	"Commun. ACM"
, volume =	13
, year =	1970
, pages =	"242--250"
, update =	"97.11 bibrelex"
}

@techreport{ew-gmueo-79
, author =	"C. M. Eastman and K. Weiler"
, title =	"Geometric modeling using the {Euler} operator"
, type =	"Research {Report}"
, number =	78
, institution =	"Institute of Physical Planning, Carnegie Mellon Univ."
, address =	"Pittsburgh, PA"
, month =	feb
, year =	1979
, update =	"98.03 bibrelex"
}

@techreport{ey-eafui-72
, author =	"C. M. Eastman and C. I. Yessios"
, title =	"An Efficient Algorithm for Finding the Union, Intersection, and Differences of Spatial Domains"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, month =	sep
, year =	1972
, update =	"98.03 bibrelex"
}

@article{ez-psnns-82
, author =	"C. M. Eastman and M. Zemankova"
, title =	"Partially specified nearest neighbor searches using $k$-d trees"
, journal =	"Inform. Process. Lett."
, volume =	15
, year =	1982
, pages =	"53--56"
}

@inproceedings{efnn-rauvd-89
, author =	"H. Ebara and N. Fukuyama and H. Nakano and Y. Nakanishi"
, title =	"Roundness algorithms using the {Voronoi} diagrams"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	41
}

@techreport{enn-ptafr-85
, author =	"H. Ebara and H. Nakano and Y. Nakanishi"
, title =	"A polynomial-time algorithm to find the roundness"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Commun. Engrg., Osaka Univ."
, year =	1985
}

@article{e-ubtfc-85
, author =	"J. Eckhoff"
, title =	"An upper bound theorem for families of convex sets"
, journal =	"Geom. Dedicata"
, volume =	19
, year =	1985
, pages =	"217--227"
, update =	"97.11 bibrelex"
}

@incollection{e-hrctt-93
, author =	"J. Eckhoff"
, title =	"Helly, {Radon} and {Carath\'eodory} type theorems"
, booktitle =	"Handbook of Convex Geometry"
, publisher =	"North-Holland"
, year =	1993
, pages =	"389--448"
, update =	"95.09 wenger, 95.01 matousek"
}

@incollection{e-rt-79
, author =	"J. Eckhoff"
, title =	"{Radon's} theorem"
, editor =	"J. T{\"o}lke and J. M. Wills"
, booktitle =	"Contributions to Geometry"
, publisher =	"Birkh{\"a}user"
, year =	1979
, pages =	"164--185"
, update =	"98.03 bibrelex"
}

@inproceedings{esg-cgcra-00
, author =	"Ilya Eckstein and Vitaly Surazhsky and Craig Gotsman"
, title =	"Compatible Geometries by Convex Representations with Applications to Computer Graphics"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"45--46"
, update =	"00.03 bibrelex"
}

@mastersthesis{e-hbr-94
, author =	"J. Eckstein"
, title =	"Heuristische {Bewegungsplanungsstrategien} im {$IR^3$}"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Comput. Sci., University Saarland"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, url =	"http://hamster.cs.uni-sb.de/~eckstein/publications/Diplom-Eckstein.ps.Z"
, keywords =	"master thesis, motion planning, collision detection, heuristic"
, update =	"95.09 chadzelek"
}

@techreport{ehs-hbr-95
, author =	"J. Eckstein and G. Hotz and E. Sch{\"o}mer"
, title =	"Heuristische {Bewegungsplanungsstrategien} im {$IR^3$}"
, type =	"Report"
, number =	"95-05"
, institution =	"Dept. Comput. Sci., University Saarland"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1995
, url =	"http://hamster.cs.uni-sb.de/~eckstein/publications/FB14-95-05.ps.Z"
, keywords =	"motion planning, collision detection, heuristic"
, update =	"95.09 chadzelek"
}

@article{epo-taasm-91
, author =	"A. B. Ecoule and F. C. Peyrin and C. L. Odet"
, title =	"A triangulation algorithm for arbitrary shaped multiple planar contours"
, journal =	"ACM Trans. Graph."
, volume =	10
, number =	2
, year =	1991
, pages =	"182--199"
, keywords =	"polygons, triangulation, contours, surfaces"
, update =	"95.09 korneenko"
}

@book{c-mangg-91
, author =	"J. E. Castillo (ed)"
, title =	"Mathematical Aspects of Numerical Grid Generation"
, publisher =	"Soc. for Industrial and Applied Math."
, address =	"Philadelphia"
, year =	1991
, update =	"98.11 bibrelex"
}

% inexact booktitle
@inproceedings{e-nbtai-88
, author =	"M. Edahiro"
, title =	"A new bucketing technique for automatic/interactive layout design"
, editor =	"Carlo Sequin"
, booktitle =	"Proc. Conf. VLSI '87"
, year =	1988
, pages =	"391--401"
, keywords =	"bucketing, isothetic, VLSI design"
, update =	"95.09 korneenko"
}

@techreport{eia-arspi-??
, author =	"M. Edahiro and M. Iri and Ta. Asano"
, title =	"An algorithm for the range-search problem and its practical efficiency"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@article{eka-nplai-84
, author =	"M. Edahiro and I. Kokubo and T. Asano"
, title =	"A New Point-Location Algorithm and its Practical Efficiency --- {C}omparison with Existing Algorithms"
, journal =	"ACM Trans. Graph."
, volume =	3
, number =	2
, year =	1984
, pages =	"86--109"
, keywords =	"point location, bucketing, implementing algorithms"
, update =	"98.07 tamassia"
}

@inproceedings{etha-baosi-87
, author =	"M. Edahiro and K. Tanaka and R. Hoshino and Ta. Asano"
, title =	"A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"258--267"
, precedes =	"etha-baosi-89"
, cites =	"aeiim-pubtc-85, c-fsnaq-86, egs-oplms-86, m-pst-85, vw-rlsil-82, ZZZ"
, update =	"98.03 bibrelex"
}

@article{etha-baosi-89
, author =	"M. Edahiro and K. Tanaka and R. Hoshino and Ta. Asano"
, title =	"A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"61--76"
, succeeds =	"etha-baosi-87"
}

@article{e-nchap-77
, author =	"W. F. Eddy"
, title =	"A new convex hull algorithm for planar sets"
, journal =	"ACM Trans. Math. Softw."
, volume =	3
, year =	1977
, pages =	"398--403 and 411--412"
, keywords =	"design of algorithms, convex hull, two-dimensional, expected-case analysis"
, annote =	"$O(n)$ time"
}

@article{e-a523c-77
, author =	"W. F. Eddy"
, title =	"Algorithm 523 {CONVEX}: {A} new convex hull algorithm for planar sets"
, journal =	"Collected Algorithms from ACM"
, volume =	"??"
, year =	1977
, pages =	"523p1--523p6"
, keywords =	"convex hull, points"
, update =	"95.09 korneenko"
}

% inexact booktitle
@inproceedings{e-chp-82
, author =	"W. F. Eddy"
, title =	"Convex hull peeling"
, booktitle =	"Proc. Sympos. on Computational Statistics, Part 1"
, year =	1982
, pages =	"42--47"
, keywords =	"convex hull, pointset, peeling"
, update =	"95.09 korneenko"
}

% not a journal, according to Math Reviews or INSPEC serials lists
@inproceedings{e-dmsc-80
, author =	"W. F. Eddy"
, title =	"Discrete methods for statistical computation"
, booktitle =	"Proc. Statist. Comput. Sec., Amer. Statist. Assoc."
, year =	1980
, pages =	"27--31"
}

@article{e-dchgs-80
, author =	"W. F. Eddy"
, title =	"Distribution of the convex hull of a {Gaussian} sample"
, journal =	"J. Appl. Probab."
, volume =	17
, number =	3
, year =	1980
, pages =	"686--695"
, keywords =	"convex hull, probabilistic geometry"
, update =	"95.09 korneenko"
}

@article{eg-bt-87
, author =	"P. Edelman and C. Greene"
, title =	"Balanced tableaux"
, journal =	"Adv. Math."
, volume =	63
, year =	1987
, pages =	"42--99"
, update =	"97.11 bibrelex"
}

@article{eg-ccytb-84
, author =	"P. Edelman and C. Greene"
, title =	"Combinatorial correspondences for Young tableaux, balanced tableaux, and maximal chains in the {Bruhat} order of $S_n$"
, journal =	"Proc. Amer. Math. Soc."
, volume =	34
, year =	1984
, note =	"Combinatorics and Algebra, Contemporary Math."
, update =	"98.11 bibrelex"
}

@book{e-gtmg-01
, author =	"E. Edelsbrunner"
, title =	"Geometry and Topology for Mesh Generation"
, publisher =	"Cambridge"
, year =	2001
, note =	""
, update =	"02.03 pocchiola"
}

@article{e-narip1-83
, author =	"H. Edelsbrunner"
, title =	"A new approach to rectangle intersections, {Part} {I}"
, journal =	"Internat. J. Comput. Math."
, volume =	13
, year =	1983
, pages =	"209--219"
, keywords =	"data structuring, searching, reporting, dynamizing data structures, interval trees, worst-case analysis, intervals, one-dimensional"
}

@article{e-narip2-83
, author =	"H. Edelsbrunner"
, title =	"A new approach to rectangle intersections, {Part} {II}"
, journal =	"Internat. J. Comput. Math."
, volume =	13
, year =	1983
, pages =	"221--229"
, keywords =	"design of algorithms, reporting, intersection, plane-sweep, repeated search, interval trees, intervals, rectangles, two-dimensional"
}

@article{e-ndrs-81
, author =	"H. Edelsbrunner"
, title =	"A note on dynamic range searching"
, journal =	"Bull. EATCS"
, volume =	15
, year =	1981
, pages =	"34--40"
, keywords =	"data structuring, searching, reporting, range search, range trees, priority search trees, points, hyperrectangles, $d$-dimensional"
}

@techreport{e-adncp-95
, author =	"H. Edelsbrunner"
, title =	"Algebraic decomposition of non-convex polyhedra"
, number =	"UIUCDCS-R-95-1928"
, institution =	"University of Illinois at Urbana-Champaign"
, month =	aug
, year =	1995
, update =	"96.05 ramkumar"
}

@inproceedings{e-adnp-95
, author =	"Herbert Edelsbrunner"
, title =	"Algebraic decomposition of non-convex polyhedra"
, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '95"
, year =	1995
, pages =	"248--257"
, update =	"98.07 bibrelex, 97.07 smid, 97.03 agarwal, 95.09 mitchell"
}

@book{e-acg-87
, author =	"H. Edelsbrunner"
, title =	"Algorithms in Combinatorial Geometry"
, series =	"EATCS Monographs on Theoretical Computer Science"
, volume =	10
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, West Germany"
, year =	1987
, keywords =	"design of algorithms, discrete geometry, book"
, update =	"93.09 erickson"
}

@inproceedings{e-atccd-89
, author =	"H. Edelsbrunner"
, title =	"An acyclicity theorem for cell complexes in $d$ dimensions"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"145--151"
, precedes =	"e-atccd-90"
, cites =	"a-pdpaa-87, c-hsh-85, d-slsv-34, e-acg-87, eks-sspp-83, dfpn-stdt-88, fd-ficg-82, fkn-vsgpt-80, v-nadpc-07, ZZZ"
, update =	"98.03 bibrelex"
}

@article{e-atccd-90
, author =	"H. Edelsbrunner"
, title =	"An acyclicity theorem for cell complexes in $d$ dimensions"
, journal =	"Combinatorica"
, volume =	10
, number =	3
, year =	1990
, pages =	"251--260"
, succeeds =	"e-atccd-89"
, update =	"98.11 bibrelex"
}

@book{e-agc-
, author =	"H. Edelsbrunner"
, title =	"Arrangements and geometric computations"
, publisher =	"??"
, year =	"??"
, note =	"Forthcoming book"
, update =	"97.11 bibrelex"
}

@article{e-cedbt-85
, author =	"H. Edelsbrunner"
, title =	"Computing the extreme distances between two convex polygons"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"213--224"
, keywords =	"design of algorithms, binary search, lower bounds, distance, polygons, convex, two-dimensional"
}

@techreport{e-cestd-84
, author =	"H. Edelsbrunner"
, title =	"Constructing edge-skeletons in three dimensions with applications to power diagrams and dissecting three-dimensional point-sets"
, number =	"F140"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{e-dssd-98
, author =	"H. Edelsbrunner"
, title =	"Deformable smooth surface design"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"to appear"
, update =	"98.03 agarwal"
}

@techreport{e-ddsoi-80
, author =	"H. Edelsbrunner"
, title =	"Dynamic data structures for orthogonal intersection queries"
, type =	"Report"
, number =	"F59"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1980
, keywords =	"data structuring, searching, intersection, dynamizing data structures, range trees, segment trees, interval trees, hyperrectangles, $d$-dimensional"
}

@article{e-esaa-86
, author =	"H. Edelsbrunner"
, title =	"Edge-skeletons in arrangements with applications"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"93--109"
, keywords =	"design of algorithms, implementing algorithms, combinatorial geometry, construction, repeated search, graph traversal, geometric transformations, planes, three-dimensional"
}

@article{e-ftssg-85
, author =	"H. Edelsbrunner"
, title =	"Finding transversals for sets of simple geometric figures"
, journal =	"Theoret. Comput. Sci."
, volume =	35
, year =	1985
, pages =	"55--69"
, keywords =	"design of algorithms, combinatorial geometry, detection, intersection, convex hull, linear programming, geometric transformations, translates, homothets"
}

@incollection{e-ga-93
, author =	"H. Edelsbrunner"
, title =	"Geometric algorithms"
, chapter =	"2.9"
, editor =	"Peter M. Gruber and J. M. Wills"
, booktitle =	"Handbook of Convex Geometry"
, volume =	"A"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1993
, pages =	"699--735"
, keywords =	"survey paper"
, update =	"93.09 rote"
}

@inproceedings{e-gscg-88
, author =	"H. Edelsbrunner"
, title =	"Geometric structures in computational geometry"
, booktitle =	"Proc. 15th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	317
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"201--213"
, keywords =	"arrangements"
}

@article{e-gatcg-87
, author =	"H. Edelsbrunner"
, title =	"Geometrics and algorithmics: a tutorial in computational geometry"
, journal =	"Bull. EATCS"
, volume =	32
, year =	1987
, pages =	"118--142"
, keywords =	"convex hull, range search, tutorial"
}

@incollection{e-gmb-98
, author =	"H. Edelsbrunner"
, title =	"Geometry of modeling biomolecules"
, editor =	"P. K. Agarwal and L. E. Kavraki and M. Mason"
, booktitle =	"Proc. Workshop Algorithmic Found. Robot."
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1998
, note =	"to appear"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@phdthesis{e-ipcg-82
, author =	"H. Edelsbrunner"
, title =	"Intersection problems in computational geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1982
, note =	"Report F93"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@inproceedings{e-kpkmc-84
, author =	"H. Edelsbrunner"
, title =	"Key-problems and key-methods in computational geometry"
, booktitle =	"Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	166
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"1--13"
, keywords =	"survey paper"
}

@incollection{e-lscr-91
, author =	"H. Edelsbrunner"
, title =	"Lines in space: a collection of results"
, booktitle =	"??"
, series =	"DIMACS Series Discrete. Math. Theoret. Computer Sci."
, volume =	6
, year =	1991
, pages =	"77--93"
, keywords =	"$3$-dimensional, lines, arrangement, survey, weaving, incidence, intersection, envelope, terrain"
, update =	"95.09 korneenko"
}

@techreport{e-mdppp-87
, author =	"H. Edelsbrunner"
, title =	"Minimum diameter partitioning of a planar point set in quadratic time"
, type =	"Report"
, number =	"UIUCDCS-R-87-1378"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1987
, keywords =	"partition, stabbing, optimization, diameter, divide-and-conquer, worst-case analysis"
}

@inproceedings{e-msctg-94
, author =	"H. Edelsbrunner"
, title =	"Modeling with Simplicial Complexes: {Topology}, Geometry, and Algorithms"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"36--44"
, keywords =	"solid modeling, combinatorial topology, grid generation, simplicial complexes, nerves, Voronoi cells, Delaunay simplicial complexes"
, cites =	"as-dsdem-92, e-ubids-93, ef-msfdv-94, em-sstcd-90, es-tts-94, fku-osrpc-77, gghkk-vcem-89, g-gsh-81, lr-ipses-71, l-slfde-45, m-eat-84, pbcf-dimsc-93, r-avpps-77, ss-codmf-90, v-nadpc-07, y-stgd-90, c-mangg-91, d-slsv-34, ZZZ"
, update =	"98.11 bibrelex, 95.09 agarwal, 94.09 jones"
}

@incollection{e-neibd-83
, author =	"H. Edelsbrunner"
, title =	"Neue {Entwicklungen} im {Bereich} {Datenstrukturen}"
, editor =	"H. A. Maurer"
, booktitle =	"{\"U}berblicke Informationsverarbeitung"
, publisher =	"BI Wissenschaftsverlag"
, year =	1983
, pages =	"55--109"
, keywords =	"survey paper"
}

@techreport{e-cedbt-82
, author =	"H. Edelsbrunner"
, title =	"On Computing the Extreme Distance between Two Convex Polygons"
, number =	"F96"
, institution =	"Inst. Informationsverarb.,  Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1982
, update =	"97.11 bibrelex"
}

@techreport{e-oddsp-78
, author =	"H. Edelsbrunner"
, title =	"Optimizing the dynamization of decomposable searching problems"
, type =	"Report"
, number =	"F35"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1978
, keywords =	"data structuring, searching, dynamizing data structures"
}

@article{e-pppcg-85
, author =	"H. Edelsbrunner"
, title =	"{P103}-{P110}: {Problems} in computational geometry and combinatorial geometry"
, journal =	"Bull. EATCS"
, volume =	26
, year =	1985
, pages =	239
, keywords =	"problem collection"
}

@inproceedings{e-p33-87
, author =	"H. Edelsbrunner"
, title =	"Problem $3-3$"
, booktitle =	"The 1986/87 Computational Geometry Days at Courant-Problems and Solutions"
, year =	1987
, update =	"98.03 bibrelex"
}

@article{e-pp-83
, author =	"H. Edelsbrunner"
, title =	"Problem {P}36"
, journal =	"Bull. EATCS"
, volume =	21
, month =	oct
, year =	1983
, pages =	195
, update =	"97.11 bibrelex"
}

@article{e-rigom-81
, author =	"H. Edelsbrunner"
, title =	"Reporting intersections of geometric objects by means of covering rectangles"
, journal =	"Bull. EATCS"
, volume =	13
, year =	1981
, pages =	"7--11"
, keywords =	"combinatorial geometry, reporting, intersection, plane-sweep, space-sweep, trees, worst-case analysis, hyperrectangles"
}

@inproceedings{e-srdc-98
, author =	"Herbert Edelsbrunner"
, title =	"Shape Reconstruction with the {D}elaunay complex"
, booktitle =	"LATIN'98: Theoretical Informatics"
, series =	"Lecture Notes Comput. Sci."
, volume =	1380
, year =	1998
, pages =	"119--132"
, update =	"02.03 wenger"
}

@incollection{e-ssmss-95
, author =	"H. Edelsbrunner"
, title =	"Smooth surfaces for multi-scale shape representation"
, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1026
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"391--412"
, update =	"96.01 smid"
}

@inproceedings{e-ssmss-96
, author =	"Herbert Edelsbrunner"
, title =	"Smooth Surfaces for Multi-Scale Shape Representation"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	25
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{e-stdac-89
, author =	"H. Edelsbrunner"
, title =	"Spatial triangulations with dihedral angle conditions"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"83--89"
, keywords =	"mesh generation, Delaunay triangulation, non-obtuse dihedral angles, KJ-triangulations"
, update =	"95.09 mitchell"
}

@article{e-cgc1-87
, author =	"H. Edelsbrunner"
, title =	"The computational geometry column"
, journal =	"Bull. EATCS"
, volume =	31
, year =	1987
, pages =	"111--114"
, keywords =	"column, bibliography"
, annote =	"Announcement of community bibliography."
}

@article{e-cgc2-87
, author =	"H. Edelsbrunner"
, title =	"The computational geometry column"
, journal =	"Bull. EATCS"
, volume =	33
, year =	1987
, pages =	"23--24"
, keywords =	"column"
, annote =	"Geometry conferences, journals, and books."
}

@article{e-cgc3-88
, author =	"H. Edelsbrunner"
, title =	"The computational geometry column"
, journal =	"Bull. EATCS"
, volume =	34
, year =	1988
, pages =	"32--39"
, keywords =	"column, complexity classes"
, annote =	"``The disease of the $log$-factor.''"
}

@article{e-cgc4-88
, author =	"H. Edelsbrunner"
, title =	"The computational geometry column"
, journal =	"Bull. EATCS"
, volume =	35
, year =	1988
, pages =	"66--68"
, keywords =	"column"
, annote =	"Preview of 4th Annu. ACM Sympos.; robustness and
		 randomization."
}

@article{e-cgc5-89
, author =	"H. Edelsbrunner"
, title =	"The computational geometry column"
, journal =	"Bull. EATCS"
, volume =	37
, year =	1989
, pages =	"109--116"
, keywords =	"column, tutorial"
, annote =	"Geometric algorithms for the classroom."
}

@article{e-cgc6-89
, author =	"H. Edelsbrunner"
, title =	"The computational geometry column"
, journal =	"Bull. EATCS"
, volume =	38
, year =	1989
, pages =	"74--78"
, keywords =	"column"
, annote =	"Orphan results: non-obtuse triangulations and stabbing
		 planar triangles."
}

@article{e-cgc7-90
, author =	"H. Edelsbrunner"
, title =	"The computational geometry column"
, journal =	"Bull. EATCS"
, volume =	40
, year =	1990
, pages =	"164--167"
, keywords =	"column"
, annote =	"Computational geometry research in Japan."
}

@article{e-cgc8-90
, author =	"H. Edelsbrunner"
, title =	"The computational geometry column"
, journal =	"Bull. EATCS"
, volume =	42
, year =	1990
, pages =	"132--134"
, keywords =	"column"
, annote =	"Reviews of 6th Annu. ACM Sympos. and 2nd Canad.
		 Conf."
}

@inproceedings{e-ubids-93
, author =	"H. Edelsbrunner"
, title =	"The union of balls and its dual shape"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"218--231"
, cites =	"ah-t1-35, a-iadbu-88, abi-cvus-88, bm-sdcs-71, c-amsc-83, clr-ia-90, d-slsv-34, de-iabns-93, d-udrdp-50, dc-cchtt-91, e-acg-87, e-was-92, efm-ias-93, eks-sspp-83, em-sstcd-90, em-tdas-92, es-itfwr-92, f-nmc-71, g-cp-67, h-uzztu-53, kb-ptacs-79, m-htcsc-67, m-eat-84, nw-iebii-92, r-avpps-77, v-nadpc-07, w-sltdd-52, w-tl-62, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{e-ubids-95
, author =	"H. Edelsbrunner"
, title =	"The union of balls and its dual shape"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"415--440"
, update =	"98.03 agarwal"
}

@article{e-ueplf-89
, author =	"H. Edelsbrunner"
, title =	"The upper envelope of piecewise linear functions: {T}ight complexity bounds in higher dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"337--343"
, keywords =	"upper/lower envelope, arrangement of simplices"
, update =	"98.03 agarwal"
}

@techreport{e-t-91
, author =	"H. Edelsbrunner"
, title =	"Triangulations"
, number =	"CS497"
, institution =	"UIUC"
, year =	1991
, update =	"97.11 bibrelex"
}

@techreport{e-was-92
, author =	"H. Edelsbrunner"
, title =	"Weighted alpha shapes"
, type =	"Technical {Report}"
, number =	"UIUCDCS-R-92-1760"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1992
, update =	"98.03 bibrelex"
}

@inproceedings{effl-mpvp-95
, author =	"H. Edelsbrunner and M. Facello and P. Fu and J. Liang"
, title =	"Measuring proteins and voids in proteins"
, booktitle =	"Proc. 28th Ann. Hawaii Internat. Conf. System Sciences"
, series =	"Biotechnology Computing"
, volume =	"V"
, year =	1995
, pages =	"256--264"
, update =	"98.03 agarwal"
}

@techreport{efl-dcpm-95
, author =	"H. Edelsbrunner and M. Facello and J. Liang"
, title =	"On the definition and the construction of pockets in macromolecules"
, type =	"Tech.\ Report"
, number =	"IULU-ENG-95-1736"
, institution =	"Department of Computer Science"
, address =	"University of Illinois at Urbana-Champaign"
, year =	1995
, update =	"98.03 agarwal"
}

@article{efl-dcpm-98
, author =	"H. Edelsbrunner and M. Facello and J. Liang"
, title =	"On the definition and the construction of pockets in macromolecules"
, journal =	"Discrete Appl. Math."
, volume =	88
, year =	1998
, pages =	"83--102"
, update =	"00.03 smid"
}

@techreport{ef-msfdv-94
, author =	"H. Edelsbrunner and P. Fu"
, title =	"Measuring space filling diagrams and voids"
, type =	"Report"
, number =	"UIUC-BI-MB-94-01"
, institution =	"Beckman Institute, Univ. Illinois"
, address =	"Urbana"
, year =	1994
, update =	"98.11 bibrelex"
}

@misc{efm-ias-93
, author =	"H. Edelsbrunner and P. Fu and E. P. M{\"u}cke"
, title =	"An introduction to alpha shapes"
, year =	1993
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@inproceedings{eg-tsa-86
, author =	"H. Edelsbrunner and Leonidas J. Guibas"
, title =	"Topologically sweeping an arrangement"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"389--403"
, keywords =	"design of algorithms, combinatorial geometry, plane-sweep, dynamic programming, amortized analysis, arrangements, two-dimensional, $d$-dimensional"
, precedes =	"eg-tsa-89"
, update =	"98.03 mitchell"
}

@article{eg-tsa-89
, author =	"H. Edelsbrunner and Leonidas J. Guibas"
, title =	"Topologically sweeping an arrangement"
, journal =	"J. Comput. Syst. Sci."
, volume =	38
, year =	1989
, pages =	"165--194"
, note =	"Corrigendum in 42 (1991), 249--251"
, keywords =	"design of algorithms, combinatorial geometry, plane-sweep, dynamic programming, amortized analysis, arrangements, two-dimensional, $d$-dimensional"
, succeeds =	"eg-tsa-86"
, update =	"98.03 mitchell"
}

@article{eghppsss-ajati-89
, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and J. Pach and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
, title =	"Arrangements of {Jordan} arcs with three intersections per pair"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"523--539"
, succeeds =	"eghppsss-ajati-88"
, update =	"98.03 mitchell"
}

@inproceedings{eghppsss-ajati-88
, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and J. Pach and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
, title =	"On arrangements of {Jordan} arcs with three intersections per pair"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"258--265"
, precedes =	"eghppsss-ajati-89"
, cites =	"a-dcg-83, e-acg-87, gss-gmppt-88, hs-ndssg-86, klps-ujrcf-86, m-ati-77, pss-stsps-86, s-alubl-87, s-at-66, s-irs-81, ws-prnds-88, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@inproceedings{eghsssw-irals-88
, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and R. Seidel and Micha Sharir and J. Snoeyink and Emo Welzl"
, title =	"Implicitly representing arrangements of lines or segments"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"56--69"
, precedes =	"eghsssw-irals-89"
, cites =	"as-tsbac-87, bo-arcgi-79, b-gtfga-80, ce-falsi-87, cg-vippg-85, cg-fc2a-86, cgl-pgd-85, c-narsc-87, e-acg-87, egppss-acptc-88, egs-oplms-86, egs-cmfal-88, eos-calha-86, ew-hrsls-86, gh-ospqs-87, ghs-btdsc-88, gos-ilsrs-88, hw-ensrq-87, k-osps-83, klps-ujrcf-86, k-ss-73, ol-mcp-81, ps-cgi-85, sh-gip-76, st-pplup-86, w-pttco-88, w-pr-82, ZZZ"
, update =	"98.03 bibrelex"
}

@article{eghsssw-irals-89
, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and R. Seidel and Micha Sharir and J. Snoeyink and Emo Welzl"
, title =	"Implicitly representing arrangements of lines or segments"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"433--466"
, succeeds =	"eghsssw-irals-88"
, update =	"98.03 mitchell, 94.01 rote"
, annote =	"the bridge tree data structure used in this paper is replaced
		 by an improved data structure of ghs-citds-91"
}

@inproceedings{egppss-acptc-88
, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Pach and R. Pollack and R. Seidel and Micha Sharir"
, title =	"Arrangements of curves in the plane: {Topology}, combinatorics, and algorithms"
, booktitle =	"Proc. 15th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	317
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"214--229"
, keywords =	"combinatorial geometry, construction, incrementation, arrangements, curves, two-dimensional"
, precedes =	"egppss-acptc-92"
, update =	"98.03 mitchell, 95.09 agarwal"
}

@article{egppss-acptc-92
, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Pach and R. Pollack and R. Seidel and Micha Sharir"
, title =	"Arrangements of curves in the plane: {Topology}, combinatorics, and algorithms"
, journal =	"Theoret. Comput. Sci."
, volume =	92
, year =	1992
, pages =	"319--336"
, keywords =	"combinatorial geometry, construction, incrementation, arrangements, curves, two-dimensional"
, succeeds =	"egppss-acptc-88"
, update =	"98.03 mitchell, 95.09 agarwal"
}

@article{egs-ccmfa-90
, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"The complexity and construction of many faces in arrangements of lines and of segments"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"161--196"
, succeeds =	"egs-cmfal-88"
, update =	"98.03 mitchell"
}

@inproceedings{egs-cmcap-88
, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"The complexity of many cells in arrangements of planes and related problems"
, booktitle =	"Proc. Int. Conf. Mathematical Prog."
, site =	"Tokyo, Japan"
, year =	1988
, pages =	147
, update =	"98.03 mitchell, 94.05 sharir"
}

@article{egs-cmcap-90
, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"The complexity of many cells in arrangements of planes and related problems"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"197--216"
, keywords =	"arrangements, complexity of faces, divide-and-conquer"
, update =	"98.03 mitchell"
}

@inproceedings{egs-cmfal-88
, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"The complexity of many faces in arrangements of lines and of segments"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"44--55"
, precedes =	"egs-ccmfa-90"
, cites =	"c-talp-69, cd-icott-87, c-narsc-87, cegsw-ccbac-88t, csy-khrp-87, e-acg-87, egs-cmcap-88, es-mnwsn-90, ew-mnemf-86, ew-hrsls-86, g-cp-67, gos-rsipl-89, gss-gmppt-88, hs-ndssg-86, hw-ensrq-87, o-spc-86, pss-stsps-88, ps-cgi-85, sml-rtatp-88, st-epdg-83, ws-prnds-88, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@techreport{egs-ueplf-87
, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications"
, type =	"Technical {Report}"
, number =	"UIUCDCDS-R-87-1390"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, month =	nov
, year =	1987
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{egs-ueplf-89
, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
, title =	"The upper envelope of piecewise linear functions: algorithms and applications"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"311--336"
, keywords =	"upper/lower envelope, arrangement of simplices"
, update =	"98.03 mitchell"
}

@article{egs-oplms-86
, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Stolfi"
, title =	"Optimal point location in a monotone subdivision"
, journal =	"SIAM J. Comput."
, volume =	15
, number =	2
, year =	1986
, pages =	"317--340"
, keywords =	"data structuring, searching, point location, binary search, directed acyclic graphs, subdivisions, two-dimensional"
, update =	"98.07 tamassia, 98.03 mitchell"
}

@techreport{egs-oplms-84
, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Stolfi"
, title =	"Optimal point location in monotone subdivisions"
, type =	"Technical {Report}"
, number =	2
, institution =	"DEC/SRC"
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{eh-lbnud-88
, author =	"H. Edelsbrunner and P. Hajnal"
, title =	"A lower bound on the number of unit distances between the vertices of a convex polygon"
, type =	"Report"
, number =	"UIUCDCS-R-88-1412"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1988
}

@article{eh-lbnud-91
, author =	"H. Edelsbrunner and P. Hajnal"
, title =	"A lower bound on the number of unit distances between the vertices of a convex polygon"
, journal =	"J. Combin. Theory Ser. A"
, volume =	56
, year =	1991
, pages =	"312--316"
, update =	"98.03 agarwal"
}

@inproceedings{ehz-hmcpl-01
, author =	"Herbert Edelsbrunner and John Harer and Alfra Zomorodian"
, title =	"Hierarchical {M}orse Complexes for Piecewise Linear 2-Manifolds"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"70--79"
, update =	"02.03 wenger"
}

@article{ehh-rpldd-86
, author =	"H. Edelsbrunner and G. Haring and D. Hilbert"
, title =	"Rectangular point location in $d$ dimensions with applications"
, journal =	"Comput. J."
, volume =	29
, year =	1986
, pages =	"76--82"
, keywords =	"data structuring, searching, point location, interval trees, hyperrectangles, $d$-dimensional"
}

@techreport{ehs-cttpt-88
, author =	"H. Edelsbrunner and N. Hasan and X. J. Shen"
, title =	"Circles through two points that always enclose many points"
, type =	"Report"
, number =	"UIUCDCS-R-88-1400"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1988
}

@article{eh-cctda-86
, author =	"H. Edelsbrunner and D. Haussler"
, title =	"The complexity of cells in three-dimensional arrangements"
, journal =	"Discrete Math."
, volume =	60
, year =	1986
, pages =	"139--146"
, keywords =	"combinatorial geometry, $3$-dimensional, lines, arrangement"
, update =	"95.09 korneenko"
}

@techreport{eh-dsptt-84
, author =	"H. Edelsbrunner and F. Huber"
, title =	"Dissecting sets of points in two and three dimensions"
, type =	"Report"
, number =	"F138"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1984
, keywords =	"data structuring, discrete geometry, range search, trees, partition, cell complexes, two-dimensional, three-dimensional"
}

@techreport{ej-hocys-86
, author =	"H. Edelsbrunner and J. W. Jaromczyk"
, title =	"How often can you see yourself in a convex configuration of mirrors?"
, type =	"Report"
, number =	"UIUCDCS-R-86-1256"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1986
}

@inproceedings{ejps-pcoas-91
, author =	"H. Edelsbrunner and J. W. Jaromczyk and J. W. Penny and G. {\'S}wi{\c a}tek"
, title =	"Primal canoes: optimal arrangements of segments"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"224--227"
, cites =	"e-acg-87, ejs-ccidw-89, elss-dgpps-73, emprww-sls-82, es-mnwsn-90, ew-nlsfs-85, js-rfccg-91, klz-gpcs-85, pss-ubnpk-89, ZZZ"
, update =	"98.11 aronov, 98.07 bibrelex"
}

@misc{ejs-ccidw-89
, author =	"H. Edelsbrunner and J. W. Jaromczyk and G. {\'S}wi{\c a}tek"
, title =	"The complexity of the common intersection of $n$ double wedges"
, year =	1989
, update =	"98.07 bibrelex"
}

@article{ekm-pis-82
, author =	"H. Edelsbrunner and D. G. Kirkpatrick and H. A. Maurer"
, title =	"Polygonal intersection searching"
, journal =	"Inform. Process. Lett."
, volume =	14
, year =	1982
, pages =	"74--79"
, keywords =	"data structuring, reporting, intersection, range search, geometric transformations, points, line segments, polygons"
}

@article{eks-sspp-83
, author =	"H. Edelsbrunner and D. G. Kirkpatrick and R. Seidel"
, title =	"On the shape of a set of points in the plane"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-29"
, year =	1983
, pages =	"551--559"
, keywords =	"design of algorithms, discrete geometry, construction, interval trees, subdivisions, Voronoi diagrams, shape, disks"
}

@techreport{el-mdsab-83
, author =	"H. Edelsbrunner and J. van Leeuwen"
, title =	"Multidimensional data structures and algorithms: a bibliography"
, type =	"Report"
, number =	"F104"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1983
, keywords =	"bibliography"
}

@article{elow-cccsr-84
, author =	"H. Edelsbrunner and J. van Leeuwen and T. Ottmann and D. Wood"
, title =	"Computing the connected components of simple rectilinear geometrical objects in $d$-space"
, journal =	"RAIRO Inform. Theor."
, volume =	18
, year =	1984
, pages =	"171--183"
, keywords =	"design of algorithms, construction, plane-sweep, priority search trees, worst-case analysis, rectangles, hyperrectangles, connected, two-dimensional, $d$-dimensional"
}

@inproceedings{elz-tps-00
, author =	"Herbert Edelsbrunner and D. Letscher and Alfra Zomorodian"
, title =	"Topological Persistence and Simplification"
, booktitle =	"Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	2000
, pages =	"454--463"
, update =	"02.03 wenger"
}

@article{em-sosgr-81
, author =	"H. Edelsbrunner and H. A. Maurer"
, title =	"A space-optimal solution of general region location"
, journal =	"Theoret. Comput. Sci."
, volume =	16
, year =	1981
, pages =	"329--336"
, keywords =	"data structuring, searching, point location, interval trees"
}

@article{em-feptd-85
, author =	"H. Edelsbrunner and H. A. Maurer"
, title =	"Finding extreme points in three dimensions and solving the post-office problem in the plane"
, journal =	"Inform. Process. Lett."
, volume =	21
, year =	1985
, pages =	"39--47"
, keywords =	"data structuring, searching, point location, convex hull, geometric transformations, directed acyclic graphs, polytopes, convex, three-dimensional"
}

@article{em-ioo-81
, author =	"H. Edelsbrunner and H. A. Maurer"
, title =	"On the intersection of orthogonal objects"
, journal =	"Inform. Process. Lett."
, volume =	13
, year =	1981
, pages =	"177--181"
, keywords =	"data structuring, searching, intersection, range trees, segment trees, interval trees, hyperrectangles, $d$-dimensional"
}

@article{emprww-sls-82
, author =	"H. Edelsbrunner and H. A. Maurer and F. P. Preparata and A. L. Rosenberg and Emo Welzl and D. Wood"
, title =	"Stabbing line segments"
, journal =	"BIT"
, volume =	22
, year =	1982
, pages =	"274--281"
, keywords =	"design of algorithms, combinatorial geometry, construction, intersection, plane-sweep, divide-and-conquer, geometric transformations, line segments, two-dimensional, worst-case analysis"
, update =	"98.03 mitchell"
}

@techreport{em-sstcd-87
, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
, title =	"Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms"
, type =	"Technical {Report}"
, number =	"UIUCDCD-R-87-1393"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana-Champaign, IL"
, month =	dec
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{em-sstcd-88
, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
, title =	"Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"118--133"
, precedes =	"em-sstcd-90"
, cites =	"ahu-daca-74, ai-grvd-86, c-odlp-52, c-lp-83, ck-flcs-80, d-lpe-63, dow-gsmml-55, e-esaa-86, e-acg-87, eg-tsa-86, ew-chsct-86, f-cgpractice-85, gp-ms-83, gs-pmgsc-85, gl-mc-83, k-sa-69, m-emzed-85, ph-chfsp-77, ps-cgi-85, s-chaop-81, s-scpvd-82, s-chdch-86, y-stgd-87, y-gctsp-88, ZZZ"
, update =	"98.03 bibrelex"
}

@article{em-sstcd-90
, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
, title =	"Simulation of simplicity: {A} technique to cope with degenerate cases in geometric algorithms"
, journal =	"ACM Trans. Graph."
, volume =	9
, number =	1
, year =	1990
, pages =	"66--104"
, succeeds =	"em-sstcd-88"
, update =	"98.07 agarwal+tamassia"
}

@techreport{em-tdas-92
, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
, title =	"Three-dimensional alpha shapes"
, type =	"Manuscript"
, number =	"UIUCDCS-R-92-1734"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana-Champaign, IL"
, year =	1992
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{em-tdas-94
, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
, title =	"Three-dimensional Alpha Shapes"
, journal =	"ACM Trans. Graph."
, volume =	13
, number =	1
, month =	jan
, year =	1994
, pages =	"43--72"
, comments =	"Software in \url{ftp://cs.uiuc.edu/pub/edels/geometry/alpha-2.1a.tar.Z}"
, update =	"94.09 orourke"
}

@techreport{eos-calha-83t
, author =	"H. Edelsbrunner and J. O'Rourke and R. Seidel"
, title =	"Constructing arrangements of lines and hyperplanes with applications"
, type =	"Report"
, number =	"F123"
, institution =	"Inst. Informationsverarb., Univ. Graz"
, address =	"Graz, Austria"
, year =	1983
, update =	"97.11 bibrelex"
}

@inproceedings{eos-calha-83
, author =	"H. Edelsbrunner and J. O'Rourke and R. Seidel"
, title =	"Constructing arrangements of lines and hyperplanes with applications"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"83--91"
, precedes =	"eos-calha-86"
, update =	"97.11 bibrelex"
}

@article{eos-calha-86
, author =	"H. Edelsbrunner and J. O'Rourke and R. Seidel"
, title =	"Constructing arrangements of lines and hyperplanes with applications"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"341--363"
, keywords =	"design of algorithms, combinatorial geometry, construction, incrementation, geometric transformations, incidence graph, arrangements, $d$-dimensional"
, comments =	"buggy proof fixed in \cite{ess-ztha-91}"
, succeeds =	"eos-calha-83"
}

@article{eow-sgrag-84
, author =	"H. Edelsbrunner and J. O'Rourke and Emo Welzl"
, title =	"Stationing guards in rectilinear art galleries"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	27
, year =	1984
, pages =	"167--176"
, keywords =	"design of algorithms, construction, decomposition, visibility, subdivisions, polygons, $c$-oriented, two-dimensional"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@article{eo-bdsds-85
, author =	"H. Edelsbrunner and M. H. Overmars"
, title =	"Batched dynamic solutions to decomposable searching problems"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"515--542"
, keywords =	"design of algorithms, construction, reporting, divide-and-conquer, range trees, segment trees, $d$-dimensional"
}

@article{eo-esrp-82
, author =	"H. Edelsbrunner and M. H. Overmars"
, title =	"On the equivalence of some rectangle problems"
, journal =	"Inform. Process. Lett."
, volume =	14
, year =	1982
, pages =	"124--127"
, keywords =	"reporting, counting, range search, geometric transformations, lower bounds, intervals, one-dimensional, two-dimensional"
}

@article{eo-zrrd-87
, author =	"H. Edelsbrunner and M. H. Overmars"
, title =	"Zooming by repeated range detection"
, journal =	"Inform. Process. Lett."
, volume =	24
, year =	1987
, pages =	"413--417"
, keywords =	"data structuring, computer graphics, reporting, range search, repeated search, trees, line segments, rectangles, two-dimensional"
}

@techreport{eos-smcga-84t
, author =	"H. Edelsbrunner and M. H. Overmars and R. Seidel"
, title =	"Some methods of computational geometry applied to computer graphics"
, type =	"report"
, number =	"F-117"
, institution =	"Technical University of Graz"
, month =	jun
, year =	1983
, precedes =	"eos-smcga-84a"
, update =	"98.07 bibrelex"
}

@article{eos-smcga-84a
, author =	"H. Edelsbrunner and M. H. Overmars and R. Seidel"
, title =	"Some methods of computational geometry applied to computer graphics"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	28
, year =	1984
, pages =	"92--108"
, keywords =	"data structuring, computer graphics, construction, searching, point location, range search, trees, subdivisions, two-dimensional"
, succeeds =	"eos-smcga-84t"
, update =	"98.07 bibrelex"
}

@article{eowbhf-rivc-90
, author =	"H. Edelsbrunner and M. H. Overmars and Emo Welzl and Ben-Arroyo and I. Hartman and J. A. Feldman"
, title =	"Ranking intervals under visibility constraints"
, journal =	"Internat. J. Comput. Math."
, volume =	34
, number =	"3--4"
, year =	1990
, pages =	"129--144"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@incollection{eow-gfcs-83
, author =	"Herbert Edelsbrunner and Mark H. Overmars and Derick Wood"
, title =	"Graphics in {Flatland}: {A} Case Study"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"35--59"
, keywords =	"design of algorithms, computer graphics, visibility, plane-sweep, trees, two-dimensional"
, update =	"01.04 icking"
}

@inproceedings{epss-lebfi-87
, author =	"H. Edelsbrunner and J. Pach and J. T. Schwartz and Micha Sharir"
, title =	"On the lower envelope of bivariate functions and its applications"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"27--37"
, keywords =	"discrete geometry, Davenport-Schinzel sequences, polyhedra, convex, arrangements, divide-and-conquer, hidden line/surface elimination, Voronoi diagrams, stabbing"
, comments =	"In three journal papers: \cite{ps-ueplf-89},
		 \cite{e-ueplf-89}, \cite{egs-ueplf-89}"
, update =	"98.03 mitchell"
}

@article{ep-mps-88
, author =	"H. Edelsbrunner and F. P. Preparata"
, title =	"Minimum polygonal separation"
, journal =	"Inform. Comput."
, volume =	77
, year =	1988
, pages =	"218--232"
, keywords =	"design of algorithms, construction, separation, prune-and-search, polygons, convex, two-dimensional"
, update =	"93.05 orourke"
}

@techreport{epw-tpstd-86
, author =	"H. Edelsbrunner and F. P. Preparata and D. B. West"
, title =	"Tetrahedrizing point sets in three dimensions"
, type =	"Report"
, number =	"UIUCDCS-R-86-1310"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1986
, keywords =	"design of algorithms, combinatorial geometry, construction, decomposition, incrementation, cell complexes, Voronoi diagrams, points, tetrahedra, three-dimensional"
, precedes =	"epw-tpstd-90"
}

@article{epw-tpstd-90
, author =	"H. Edelsbrunner and F. P. Preparata and D. B. West"
, title =	"Tetrahedrizing Point Sets in Three Dimensions"
, journal =	"J. Symbolic Comput."
, volume =	10
, number =	"3--4"
, year =	1990
, pages =	"335--347"
, succeeds =	"epw-tpstd-86"
, update =	"97.11 bibrelex"
}

@article{ers-ccsno-90
, author =	"H. Edelsbrunner and A. D. Robison and X. Shen"
, title =	"Covering convex sets with non-overlapping polygons"
, journal =	"Discrete Math."
, volume =	81
, year =	1990
, pages =	"153--164"
, comments =	"replaces the techreport ers-ccsno-87"
, update =	"93.09 rote"
}

@inproceedings{erw-tncst-87
, author =	"H. Edelsbrunner and G{\"u}nter Rote and Emo Welzl"
, title =	"Testing the necklace condition for shortest tours and optimal factors in the plane"
, booktitle =	"Proc. 14th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	267
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"364--375"
, precedes =	"erw-tncst-89"
, update =	"98.03 mitchell, 93.09 rote"
}

@article{erw-tncst-89
, author =	"H. Edelsbrunner and G{\"u}nter Rote and Emo Welzl"
, title =	"Testing the necklace condition for shortest tours and optimal factors in the plane"
, journal =	"Theoret. Comput. Sci."
, volume =	66
, year =	1989
, pages =	"157--180"
, keywords =	"combinatorial geometry, operations research, construction, linear programming, geometric graphs, traveling salesman tours, matchings, points, two-dimensional, cluster analysis"
, succeeds =	"erw-tncst-87"
, update =	"98.03 mitchell, 93.09 rote"
}

@inproceedings{es-vda-85
, author =	"H. Edelsbrunner and R. Seidel"
, title =	"Voronoi diagrams and arrangements"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"251--263"
, precedes =	"es-vda-86"
, cites =	"a-pdpaa-83, ab-gdt-86, ae-oacwv-84, b-acokv-83, b-cdt-81, b-fihs-78, b-vdch-79, b-gtfga-80, cd-vdsle-84, cy-grp-83, d-oacav-82, d-gvdgs-79, e-agc-, eos-calha-83, ew-nlsfs-82, elss-dgpps-73, g-ah-71, g-as-72, iim-vdlgi-85, k-eccs-79, l-fknnp-76, l-tdvdl-80, ld-gvdp-81, lw-vdllm-80, m-mnfcp-70, m-tom-82, p-kpudz-82, ph-chfsp-77, pm-finhs-79, s-chaop-81, sh-cpp-75, ls-ippvd-87, w-cnddt-81, y-oavds-84, z-fuafc-75, ZZZ"
, update =	"97.11 bibrelex"
}

@article{es-vda-86
, author =	"H. Edelsbrunner and R. Seidel"
, title =	"Voronoi diagrams and arrangements"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"25--44"
, keywords =	"discrete geometry, geometric transformations, cell complexes, arrangements, Voronoi diagrams, hyperplanes, spheres, $d$-dimensional"
, succeeds =	"es-vda-85"
}

@unpublished{ess-npzta-
, author =	"H. Edelsbrunner and R. Seidel and Micha Sharir"
, title =	"New proofs of the zone theorem for arrangements of hyperplanes"
, note =	"In preparation"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@incollection{ess-ztha-91
, author =	"H. Edelsbrunner and R. Seidel and Micha Sharir"
, title =	"On the zone theorem for hyperplane arrangements"
, editor =	"H. Maurer"
, booktitle =	"New Results and New Trends in Computer Science"
, series =	"Lecture Notes Comput. Sci."
, volume =	555
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"108--123"
, comments =	"Fixes bug in original proof \cite{eos-calha-86}"
, update =	"98.03 mitchell"
}

@article{ess-ztha-93
, author =	"H. Edelsbrunner and R. Seidel and Micha Sharir"
, title =	"On the zone theorem for hyperplane arrangements"
, journal =	"SIAM J. Comput."
, volume =	22
, number =	2
, year =	1993
, pages =	"418--429"
, comments =	"Fixes bug in original proof \cite{eos-calha-86}"
, succeeds =	"ess-ztha-91"
, update =	"98.03 mitchell, 96.05 agarwal, 95.09 agarwal+devillers, 93.09 erickson+matousek+rote"
}

@inproceedings{es-itfwr-92
, author =	"H. Edelsbrunner and N. R. Shah"
, title =	"Incremental topological flipping works for regular triangulations"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"43--52"
, cites =	"a-pdpaa-87, a-vdsfg-91, bm-sdcs-71, cs-arscg-89, d-slsv-34, e-acg-87, e-atccd-90, eks-sspp-83, em-sstcd-90, em-tdas-92, gks-ricdv-90, j-3dtlt-89, j-ctddt-91, l-gtgac-72, l-scsi-77, l-pndt-86, l-rtp-91, ps-cgi-85, r-mkkde-21, r-odtr-91, s-udzvd-28, s-chdch-86, v-nadpc-07, ZZZ"
, update =	"97.11 bibrelex"
}

@article{es-itfwr-96
, author =	"H. Edelsbrunner and N. R. Shah"
, title =	"Incremental topological flipping works for regular triangulations"
, journal =	"Algorithmica"
, volume =	15
, year =	1996
, pages =	"223--241"
, update =	"96.05 smid"
}

@inproceedings{es-tts-94
, author =	"H. Edelsbrunner and N. R. Shah"
, title =	"Triangulating Topological Spaces"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"285--292"
, precedes =	"es-tts-97"
, cites =	"b-sat3m-64, bt-dfat-82, b-rgsdd-93, c-gqmgc-93, cf-hcc-67, d-slsv-34, e-acg-87, e-ubids-93, em-sstcd-90, gp-dt-74, h-dt-76, ks-sts-93, l-slfde-45, lw-tcc-69, ms-chrfm-, m-tfc-75, m-eat-84, ps-cgi-85, r-iat-88, rs-iplt-72, sf-afem-73, v-nadpc-07, w-tl-62, y-stgd-90, ZZZ"
, update =	"00.03 devillers, 98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@article{es-tts-97
, author =	"H. Edelsbrunner and N. R. Shah"
, title =	"Triangulating Topological Spaces"
, journal =	"Int. J. on Comp. Geom."
, volume =	7
, year =	1997
, pages =	"365--378"
, succeeds =	"es-tts-94"
, update =	"00.03 devillers"
}

@inproceedings{es-hipac-90
, author =	"H. Edelsbrunner and Micha Sharir"
, title =	"A hyperplane incidence problem with applications to counting distances"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"419--428"
, precedes =	"es-hipac-91"
, update =	"98.03 mitchell"
}

@inproceedings{es-hipac-91
, author =	"H. Edelsbrunner and Micha Sharir"
, title =	"A hyperplane incidence problem with applications to counting distances"
, editor =	"P. Gritzman and B. Sturmfels"
, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	4
, publisher =	"AMS Press"
, address =	"Providence, RI"
, year =	1991
, pages =	"253--263"
, succeeds =	"es-hipac-90"
, update =	"98.07 agarwal, 98.03 mitchell, 93.09 erickson"
}

@techreport{es-mnwsn-87
, author =	"H. Edelsbrunner and Micha Sharir"
, title =	"The maximum number of ways to stab $n$ convex non-intersecting sets in the plane is $2n-2$"
, type =	"Report"
, number =	281
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1987
, keywords =	"combinatorial geometry, stabbing, convex, Davenport-Schinzel sequences, divide-and-conquer"
, precedes =	"es-mnwsn-90"
, update =	"98.03 mitchell"
}

@article{es-mnwsn-90
, author =	"Herbert Edelsbrunner and Micha Sharir"
, title =	"The maximum number of ways to stab $n$ convex non-intersecting sets in the plane is $2n-2$"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"35--42"
, keywords =	"combinatorial geometry, stabbing, convex, Davenport-Schinzel sequences, divide-and-conquer"
, succeeds =	"es-mnwsn-87"
, update =	"98.11 aronov+bibrelex, 98.03 mitchell"
}

@article{es-otatd-91
, author =	"H. Edelsbrunner and W. Shi"
, title =	"An {$O(n \log^{2} h)$} time algorithm for the three-dimensional convex hull problem"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"259--277"
}

@article{es-nfnpp-?
, 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 =	"?"
, keywords =	"pointset, furthest pair"
, succeeds =	"es-nfnpp-86"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@techreport{es-nfnpp-86
, author =	"H. Edelsbrunner and Steven S. Skiena"
, title =	"On the number of furthest neighbour pairs in a point set"
, type =	"Report"
, number =	"UIUCDCS-R-86-1312"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1986
, precedes =	"es-nfnpp-?"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@techreport{es-pcpxr-86
, author =	"H. Edelsbrunner and Steven S. Skiena"
, title =	"Probing convex polygons with $x$-rays"
, type =	"Report"
, number =	"UIUCDCS-R-86-1306"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1986
, keywords =	"discrete geometry, robotics, probing, worst-case analysis, polygons, convex, two-dimensional"
, precedes =	"es-pcpxr-88"
, update =	"98.03 mitchell"
}

@article{es-pcpxr-88
, author =	"H. Edelsbrunner and Steven S. Skiena"
, title =	"Probing convex polygons with $x$-rays"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"870--882"
, keywords =	"discrete geometry, robotics, probing, worst-case analysis, polygons, convex, two-dimensional"
, succeeds =	"es-pcpxr-86"
, update =	"98.03 mitchell"
}

@article{es-cmsrl-90
, author =	"H. Edelsbrunner and D. L. Souvaine"
, title =	"Computing median-of-squares regression lines and guided topological sweep"
, journal =	"J. Amer. Statist. Assoc."
, volume =	85
, year =	1990
, pages =	"115--119"
, keywords =	"statistics, optimization, plane-sweep, topological sweep, geometric transformations, binary search, points, lines"
}

@article{es-nepfp-86
, author =	"H. Edelsbrunner and G. St{\"o}ckl"
, title =	"The number of extreme pairs of finite point sets in {Euclidean} spaces"
, journal =	"J. Combin. Theory"
, volume =	43
, number =	2
, year =	1986
, pages =	"344--349"
, keywords =	"points, combinatorial geometry"
, update =	"95.09 korneenko"
}

@inproceedings{et-qtaml-91
, author =	"H. Edelsbrunner and T. S. Tan"
, title =	"A quadratic time algorithm for the minmax length triangulation"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"414--423"
, precedes =	"et-qtaml-93"
, update =	"93.09 rote"
}

@article{et-qtaml-93
, author =	"H. Edelsbrunner and T. S. Tan"
, title =	"A quadratic time algorithm for the minmax length triangulation"
, journal =	"SIAM J. Comput."
, volume =	22
, year =	1993
, pages =	"527--551"
, succeeds =	"et-qtaml-91"
, update =	"93.09 rote"
}

@inproceedings{et-ubcdt-92
, author =	"H. Edelsbrunner and T. S. Tan"
, title =	"An upper bound for conforming {Delaunay} triangulations"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"53--62"
, succeeds =	"et-ubcdt-93"
, cites =	"beg-pgmg-90, be-psntp-91, bfl-rsddt-88i, b-srpcs-88, c-atapd-74, clr-ia-90, ds-oiti-89, d-slsv-34, e-acg-87, ea-lacvp-81, f-savd-87, gks-ricdv-90, gs-pmgsc-85, js-clvpa-87, l-scsi-77, l-vsp-83, ll-gdtpg-86, ns-ppdtp-91, o-tavc-91, ps-cgi-85, r-odtr-91, r-mrpdt-90, s-der-91, s-cdtvd-88, s-let-78, sf-afem-73, v-nadpc-08, ZZZ"
, update =	"98.07 bibrelex, 97.11 bibrelex, 95.09 korneenko"
}

@article{et-ubcdt-93
, author =	"H. Edelsbrunner and T. S. Tan"
, title =	"An upper bound for conforming {Delaunay} triangulations"
, journal =	"Discrete Comput. Geom."
, volume =	10
, number =	2
, year =	1993
, pages =	"197--213"
, update =	"95.09 korneenko"
}

@inproceedings{etw-otama-90
, author =	"H. Edelsbrunner and T. S. Tan and R. Waupotitsch"
, title =	"An {$O(n^{2} \log n)$} time algorithm for the minmax angle triangulation"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"44--52"
, cites =	"ahu-daca-74, ba-acfem-76, c-atapd-74, d-slsv-34, e-acg-87, f-savd-87, gs-pmgsc-85, h-ep-82, k-mtpd-80, l-gtgac-72, l-scsi-77, ll-gdtpg-86, ph-hta-87, ps-pqat-77, ps-cgi-85, s-cdtvd-88, sh-cpp-75, s-let-78, sf-afem-73, ZZZ"
, update =	"97.11 bibrelex"
}

@article{etw-otama-92
, author =	"Herbert Edelsbrunner and Tiow Seng Tan and Roman Waupotitsch"
, title =	"${O}({N}^2 \log {N})$ Time Algorithm For The Minmax Angle Triangulation"
, journal =	"SIAM J. Sci. Statist. Comput."
, volume =	13
, number =	4
, month =	jul
, year =	1992
, pages =	"994--1008"
, succeeds =	"etw-otama-90"
, annote =	"Basicly a generalization of switching. If we can't
		 improve the worst triangle by a switching look for a an
		 edge splitting the largest angle that crosses several
		 edges."
}

@inproceedings{evw-cdpsh-94
, author =	"H. Edelsbrunner and P. Valtr and Emo Welzl"
, title =	"Cutting Dense Point Sets in Half"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"203--210"
, cites =	"a-gmtud-90, akp-mscpr-89, ap-ieggs-86, acegsw-ptphp-91, bfl-nhp-89, c-sscg-86, cp-hrsaa-86, csy-khrp-87, de-ctchp-93, e-ibith-91, ew-nlsfs-85, ew-cbtda-86, elss-dgpps-73, gps-crotr-89, gps-iscir-90, l-nhl-71, pss-ubnpk-92, r-n3sfp-93, s-iggp-76, v-ppsbr-94, v-cis7h-92, vz-ctpci-92, ZZZ"
, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
}

@article{evw-cdpsh-97
, author =	"H. Edelsbrunner and P. Valtr and Emo Welzl"
, title =	"Cutting Dense Point Sets in Half"
, journal =	"Discrete Comput. Geom."
, volume =	17
, year =	1997
, pages =	"243--255"
, update =	"98.07 agarwal"
}

@article{evl-madsb-80
, author =	"H. Edelsbrunner and J. {van Leeuwen}"
, title =	"Multidimensional algorithms and data structures (bibliography)"
, journal =	"Bull. EATCS"
, volume =	11
, year =	1980
, pages =	"46--74"
, keywords =	"searching, data structuring, $d$-dimensional"
, update =	"95.09 korneenko"
}

@article{ew-cac-97
, author =	"H. Edelsbrunner and E. Waupotitsch"
, title =	"A combinatorial approach to cartograms"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"343--360"
, succeeds =	"ew-cac-95"
, update =	"97.07 devillers"
}

@inproceedings{ew-cac-95
, author =	"Herbert Edelsbrunner and Roman Waupotitsch"
, title =	"A Combinatorial Approach to Cartograms"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"98--108"
, keywords =	"topology, homeomorphism"
, precedes =	"ew-cac-97"
, cites =	"clr-ia-90, d-mdcm-93, dcn-accac-85, g-gsh-81, gl-mc-89, gw-hcg-93a, gw-hcg-93b, m-mdscg-84, m-eat-84, s-t-93, t-ctud-73, t-aciho-88, wg-plrsm-85, ZZZ"
, update =	"98.03 bibrelex, 97.07 devillers, 95.09 mitchell"
}

@article{ew-chsct-86
, author =	"H. Edelsbrunner and R. Waupotitsch"
, title =	"Computing a ham-sandwich cut in two dimensions"
, journal =	"J. Symbolic Comput."
, volume =	2
, year =	1986
, pages =	"171--178"
, keywords =	"design of algorithms, construction, partition, prune-and-search, geometric transformations, worst-case analysis, points, lines, two-dimensional"
}

@article{ew-cbtda-86
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"Constructing belts in two-dimensional arrangements with applications"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"271--284"
, keywords =	"design of algorithms, combinatorial geometry, plane-sweep, repeated search, arrangements, two-dimensional, counting, approximation, range search, arrangements"
, update =	"98.03 mitchell"
}

@techreport{ew-hre-82
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"Halfplanar range estimation"
, type =	"Report"
, number =	"F98"
, institution =	"Inst. Informationsverarb., Univ. Graz"
, address =	"Graz, Austria"
, year =	1982
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{ew-hrsls-83
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"Halfplanar range search in linear space and {$O(n^{0.695})$} query time"
, type =	"Report"
, number =	"F111"
, institution =	"Inst. Informationsverarb., Univ. Graz"
, address =	"Graz, Austria"
, year =	1983
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ew-hrsls-86
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"Halfplanar range search in linear space and {$O(n^{0.695})$} query time"
, journal =	"Inform. Process. Lett."
, volume =	23
, year =	1986
, pages =	"289--293"
, keywords =	"data structuring, discrete geometry, searching, partition, range search, trees, subdivisions, two-dimensional, reporting, counting"
, update =	"98.03 mitchell"
}

@incollection{ew-mesla-84
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"Monotone edge sequences in line arrangements, with applications"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	176
, year =	1984
, pages =	"265--273"
, keywords =	"lines, arrangement"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@article{ew-mnemf-86
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"On the maximal number of edges of many faces in an arrangement"
, journal =	"J. Combin. Theory Ser. A"
, volume =	41
, year =	1986
, pages =	"159--166"
, keywords =	"arrangements, complexity of faces"
, update =	"98.03 mitchell"
}

@incollection{ew-nessp-83
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"On the number of equal-sized semispaces of a set of points in the plane"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	154
, year =	1983
, pages =	"182--187"
, keywords =	"points, combinatorial geometry"
, update =	"98.03 mitchell, 95.09 korneenko"
}

@techreport{ew-nlsfs-82
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"On the number of line-separations of a finite set in the plane"
, type =	"Report"
, number =	"F97"
, institution =	"Inst. Informationsverarb., Univ. Graz"
, address =	"Graz, Austria"
, year =	1982
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ew-nlsfs-85
, author =	"H. Edelsbrunner and Emo Welzl"
, title =	"On the number of line separations of a finite set in the plane"
, journal =	"J. Combin. Theory Ser. A"
, volume =	40
, year =	1985
, pages =	"15--29"
, update =	"98.03 agarwal+mitchell"
}

@inproceedings{e-dum-91
, author =	"J. Edmonds"
, title =	"Decomposition using {Minkowski}"
, booktitle =	"Abstracts of the 14th Internat. Sympos. on Mathematical Programming"
, site =	"Amsterdam, Netherlands"
, year =	1991
, update =	"98.07 bibrelex"
}

@article{e-mmpv-65
, author =	"J. Edmonds"
, title =	"Maximum matching and a polyhedron with (0,1) vertices"
, journal =	"J. Res. National Bureau of Standards"
, volume =	"??"
, year =	1965
, pages =	"125--130"
, update =	"98.03 bibrelex"
}

@article{e-mpmis-65
, author =	"J. Edmonds"
, title =	"Minimum partition of a matroid into independent sets"
, journal =	"Research of th NBS"
, volume =	69
, year =	1965
, pages =	"67--72"
, update =	"01.07 devillers, 98.11 bibrelex"
}

@article{e-sdrla-67
, author =	"J. Edmonds"
, title =	"Systems of distinct representatives and linear algebra"
, journal =	"J. Res. National Bureau of Standards"
, volume =	71
, number =	"B"
, year =	1967
, pages =	"241--245"
, update =	"98.07 bibrelex"
}

@article{ek-tiaen-72
, author =	"J. Edmonds and R. M. Karp"
, title =	"Theoretical improvements in algorithmic efficiency for network flow problems"
, journal =	"J. ACM"
, volume =	19
, year =	1972
, pages =	"248--264"
, update =	"97.11 bibrelex"
}

@article{e-crps-60
, author =	"R. Edmonds"
, title =	"A combinatorial representation for polyhedral surfaces"
, journal =	"Notices Amer. Math. Soc."
, volume =	7
, year =	1960
, pages =	646
}

@article{ecms-gcla-97
, author =	"S. Edmondson and J. Christensen and J. Marks and S. M. Schieber"
, title =	"A general cartographic labeling algorithm"
, journal =	"Cartographica"
, volume =	"??"
, year =	1997
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@book{ep-cag-86
, author =	"C. H. {Edwards, Jr.} and D. E. Penny"
, title =	"Calculus and Analytic Geometry"
, edition =	"2nd"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1986
}

@article{e-ltawm-93
, author =	"P. Effernan"
, title =	"Linear time algorithms for weakly monotone polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"121--137"
, update =	"96.09 devillers"
}

@mastersthesis{e-samcp-93
, author =	"A. Efrat"
, title =	"A simple algorithm for maintaining the center of a planar point set"
, school =	"Technion IIT"
, address =	"Haifa, Israel"
, year =	1993
, keywords =	"master thesis"
, precedes =	"bei-samcp-93"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@unpublished{e-famps-95
, author =	"A. Efrat"
, title =	"Finding approximate matching of points and segments under translation"
, year =	1995
, note =	"Unpublished manuscript"
, update =	"95.09 agarwal"
}

@inproceedings{eg-siruc-93
, author =	"A. Efrat and C. Gotsman"
, title =	"Subpixel image registration using circular fiducials"
, booktitle =	"Proc. 2nd Israel Sympos. Theory Computing and Systems"
, year =	1993
, pages =	"48--47"
, precedes =	"eg-siruc-94"
, update =	"96.09 devillers, 93.09 efrat"
}

@article{eg-siruc-94
, author =	"A. Efrat and C. Gotsman"
, title =	"Subpixel image registration using circular fiducials"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"403--422"
, keywords =	"computer vision, registration, fiducials, lattice geometry, number theory"
, succeeds =	"eg-siruc-93"
, update =	"98.07 rote, 96.09 devillers"
}

@inproceedings{eh-fcmfc-98
, author =	"Alon Efrat and Sariel Har-Peled"
, title =	"Fly Cheaply: {On} the Minimum Fuel-Consumption Problem"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"to appear"
, update =	"98.03 mitchell"
}

@inproceedings{ehks-cspre-00
, author =	"Alon Efrat and Frank Hoffmann and Klaus Kriegel and Christof Schultz"
, title =	"Covering Simple Polygonal Regions by Ellipses"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"89--92"
, update =	"00.03 bibrelex"
}

@inproceedings{ei-ibmrp-96
, author =	"Alon Efrat and Alon Itai"
, title =	"Improvements on Bottleneck Matching and Related Problems Using Geometry"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"301--310"
, cites =	"aass-sdp-93, aes-vdsl3-95, am-rsps-93, aks-scps-83, abb-amps-91, amww-cssgo-88, akmsw-mpnrc-91, amnsw-oaann-94, b-ttgt-57, by-lotmc-94, ctl-sebmp-92, ck-igpmp-92, cdek-gpmds-95, cghkkk-gpmem-93, c-sdsno-87, d-aspmf-70, egs-oplms-86, ek-tiaen-72, esz-cskec-94, e-famps-95, fj-gsrsm-84, hs-adaps-92, h-gaaps-93, hs-asdch-90, hs-ftp-91, hk-nammb-73, hk-cmhdp-90, hks-uevsi-93, ia-eaggs-86, k-ecbmf-73, k-iagoe-95, k-hmap-55, l-conm-76, lp-mt-86, m-apcad-83, t-dsna-83, v-ghm-88, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@unpublished{ei-ibmrp-97
, author =	"A. Efrat and A. Itai and M. J. Katz"
, title =	"Improvements on Bottleneck Matching and Related Problems Using Geometry"
, year =	1997
, note =	"Unpublished manuscript"
, succeeds =	"ei-ibmrp-96"
, update =	"97.11 katz"
}

@inproceedings{ek-cfbmg-96
, author =	"A. Efrat and M. J. Katz"
, title =	"Computing Fair and Bottleneck Matchings in Geometric Graphs"
, booktitle =	"Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
, year =	1996
, pages =	"115--125"
, update =	"97.11 katz"
}

@unpublished{ek-ebmhd-97
, author =	"A. Efrat and M. J. Katz"
, title =	"Euclidean Bottleneck Matching in Higher Dimensions"
, year =	1997
, note =	"Unpublished manuscript"
, update =	"97.11 katz"
}

@inproceedings{ekns-ddsfo-97
, author =	"A. Efrat and M. J. Katz and F. Nielsen and M. Sharir"
, title =	"Dynamic Data Structures for Fat Objects and Their Applications"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"297--306"
, precedes =	"ekns-ddsfo-00"
, update =	"00.03 smid, 98.03 bibrelex+mitchell, 97.11 katz, 97.07 agarwal"
}

@article{ekns-ddsfo-00
, author =	"A. Efrat and M. J. Katz and F. Nielsen and M. Sharir"
, title =	"Dynamic data structures for fat objects and their applications"
, journal =	"Comput. Geom. Theory Appl."
, volume =	15
, year =	2000
, pages =	"215--227"
, succeeds =	"ekns-ddsfo-97"
, update =	"00.03 smid"
}

@inproceedings{els-fmcsh-93
, author =	"A. Efrat and M. Lindenbaum and Micha Sharir"
, title =	"Finding maximally consistent sets of halfspaces"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"432--436"
, cites =	"boo-dspir-91, bklo-gasra-87, ce-oails-92, cs-arscg-89, csy-khrp-87, dk-fdpi-83, e-acg-87, ew-cbtda-86, eg-siruc-93, es-blbda-93t, lb-rpdcd-, m-lpltw-84, m-fppa-90, m-lavd-91, o-olafs-81, pss-ubnpk-92, s-ksacs-91, sd-ddcps-91, w-mksfs-86, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 94.01 matousek, 93.09 milone+mitchell"
}

@techreport{ers-ufwsc-
, author =	"A. Efrat and G{\"u}nter Rote and Micha Sharir"
, title =	"On the union of fat wedges and separating a collection of segments by a line"
, type =	"manuscript"
, precedes =	"ers-ufwsc-93a, ers-ufwsc-93b"
, update =	"98.11 bibrelex"
}

@inproceedings{ers-ufwsc-93a
, author =	"A. Efrat and G{\"u}nter Rote and Micha Sharir"
, title =	"On the union of fat wedges and separating a collection of segments by a line"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"115--120"
, succeeds =	"ers-ufwsc-"
, precedes =	"ers-ufwsc-93b"
, cites =	"afkmnsu-ampcb-90, abp-oabcu-90, ce-oails-92, cs-arscg-89, e-acg-87, egs-ccmfa-90, es-blbda-93, fmp-csua-90, go-nhpcg-93t, gm-osacv-91, h-fuenl-89, k-fpfcu-93t, ms-ericu-91, m-fppa-90, mpssw-ftdlm-94, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 97.03 rote, 96.09 devillers, 94.05 sharir, 93.09 milone+mitchell+rote"
}

@article{ers-ufwsc-93b
, author =	"A. Efrat and G{\"u}nter Rote and Micha Sharir"
, title =	"On the union of fat wedges and separating a collection of segments by a line"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"277--288"
, succeeds =	"ers-ufwsc-93a, ers-ufwsc-"
, cites =	"mpssw-ftdlm-94"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 97.03 rote"
, abstract =	"We call a line $l$ a separator for a set $S$ of objects in
		the plane if $l$ avoids all the objects and
		partitions $S$ into two nonempty subsets, one consisting
		of objects lying above $l$ and the
		other of objects lying below $l$. We present an
		$O(n log n)$-time algorithm for
		finding a separator line for a set of $n$ segments, provided
		the ratio between the diameter of the set of segments and
		the length of the smallest segment is bounded.
		No subquadratic algorithms are known for the general case.
		Our algorithm is based on the recent results of
		Matousek, Pach, Sharir, Sifrony, and Welzl (1994) concerning
		the union of fat triangles, but we also include an analysis
		which improves the bounds obtained by Matousek et al."
}

@inproceedings{es-nlaps-94
, author =	"A. Efrat and Micha Sharir"
, title =	"A near-linear algorithm for the planar segment center problem"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"87--97"
, update =	"98.03 mitchell, 94.05 sharir"
}

@article{es-nlaps-96
, author =	"A. Efrat and Micha Sharir"
, title =	"A near-linear algorithm for the planar segment center problem"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"239--257"
, update =	"98.03 mitchell, 97.03 agarwal"
}

@inproceedings{es-cufop-97
, author =	"A. Efrat and M. Sharir"
, title =	"On the Complexity of the Union of Fat Objects in the Plane"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"104--112"
, cites =	"aks-cdorp-95, cs-arscg-89, esz-cskec-94, hs-atubs-95, k-3vrs2-??, kos-ehsro-92, klps-ujrcf-86, lps-ctc-95, mpssw-ftdlm-94, ps-rivbu-97, s-ksacs-91, s-atubl-94, s-mpafo-94, k-fpfcu-93, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@article{es-cufop-00
, author =	"A. Efrat and M. Sharir"
, title =	"On the Complexity of the Union of Fat Objects in the Plane"
, journal =	"Discrete Comput. Geom."
, volume =	23
, year =	2000
, pages =	"171--189"
, update =	"01.07 orourke"
}

@techreport{esz-cskec-93t
, author =	"A. Efrat and Micha Sharir and A. Ziv"
, title =	"Computing the Smallest $k$-Enclosing Circle and Related Problems"
, type =	"Report"
, number =	"CIS-9309"
, institution =	"Faculty of Computer Science, Technion - IIT"
, address =	"Haifa, Israel"
, year =	1993
, update =	"98.03 mitchell, 93.05 efrat"
}

@inproceedings{esz-cskec-93i
, author =	"A. Efrat and Micha Sharir and A. Ziv"
, title =	"Computing the Smallest $k$-Enclosing Circle and Related Problems"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"325--336"
, precedes =	"esz-cskec-94"
, update =	"98.03 mitchell, 96.09 agarwal+devillers, 96.05 agarwal, 93.09 smid, 93.05 jones"
}

@article{esz-cskec-94
, author =	"A. Efrat and Micha Sharir and A. Ziv"
, title =	"Computing the Smallest $k$-Enclosing Circle and Related Problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"119--136"
, succeeds =	"esz-cskec-93i"
, update =	"98.03 mitchell, 96.09 devillers"
}

@article{e-chrsp-65
, author =	"B. Efron"
, title =	"The convex hull of a random set of points"
, journal =	"Biometrika"
, volume =	52
, number =	3
, year =	1965
, pages =	"331--343"
}

@article{e-ptnna-67
, author =	"B. Efron"
, title =	"The problem of the two nearest neighbors (abstract)"
, journal =	"Ann. Math. Statist."
, volume =	38
, year =	1967
, pages =	298
}

@article{eg-cipsc-96
, author =	"{\"O}. E{\u{g}}ecio{\u{g}}lu and T. Gonzalez"
, title =	"A computationally intractable problem on simplicial complexes"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"85--98"
, update =	"97.07 devillers"
}

@article{ek-adspe-89
, author =	"O. Egecioglu and B. Kalantari"
, title =	"Approximating the diameter of a set of points in the {Euclidean} space"
, journal =	"Inform. Process. Lett."
, volume =	32
, year =	1989
, pages =	"205--211"
, keywords =	"approximation, diameter, points, $d$-dimensional"
, update =	"95.09 korneenko"
}

@article{esb-agtuo-95
, author =	"D. Eggert and L. Stark and K. Bowyer"
, title =	"Aspect graphs and their use in object recognition"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"347--376"
, keywords =	"matching, shape recognition, vision"
, update =	"98.07 bibrelex, 95.09 mitchell"
}

@book{e-c-58
, author =	"H. G. Eggleston"
, title =	"Convexity"
, publisher =	"Cambridge University Press"
, address =	"Cambridge, England"
, year =	1958
}

@article{e-rdg-86
, author =	"R. B. Eggleton"
, title =	"Rectilinear Drawings of Graphs"
, journal =	"Utilitas Math."
, volume =	29
, year =	1986
, pages =	"146--172"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ek-iodc-90
, author =	"V. M. Egorov and E. G. Kostov"
, title =	"Integrated optical digital computers"
, journal =	"Appl. Optics"
, volume =	29
, number =	8
, year =	1990
, pages =	"1178--1185"
, update =	"98.03 bibrelex"
}

@article{e-hsrpc-88
, author =	"P. Egyed"
, title =	"Hidden-surface removal in polyhedral cross-sections"
, journal =	"Visual Comput."
, volume =	3
, year =	1988
, pages =	"329--343"
, keywords =	"hidden line/surface elimination"
, succeeds =	"e-trpah-88"
}

@inproceedings{e-trpah-88
, author =	"P. Egyed"
, title =	"Theoretical results on the priority approach to hidden-surface removal"
, booktitle =	"Proc. Graphics Interface '88"
, year =	1988
, pages =	"236--245"
, precedes =	"e-hsrpc-88"
}

@inproceedings{ew-ospdc-89
, author =	"P. Egyed and R. Wenger"
, title =	"Ordered stabbing of pairwise disjoint convex sets in linear time"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	23
, succeeds =	"ew-ospdc-91"
, update =	"95.09 korneenko"
}

@article{ew-ospdc-91
, author =	"P. Egyed and R. Wenger"
, title =	"Ordered stabbing of pairwise disjoint convex sets in linear time"
, journal =	"Discrete Appl. Math."
, volume =	31
, number =	2
, year =	1991
, pages =	"133--140"
, keywords =	"stabbing convex line transversal"
, precedes =	"ew-ospdc-89"
, update =	"95.09 korneenko"
}

@inproceedings{ew-spdtl-89
, author =	"P. Egyed and R. Wenger"
, title =	"Stabbing pairwise-disjoint translates in linear time"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"364--369"
, cites =	"ahu-daca-74, ab-eact-87, ad-ahdsp-87, arw-lbls-89, d-ltatt-84, e-ftssg-85, e-acg-87, egs-ueplf-87, emprww-sls-82, es-mnwsn-87, hdk-cgp-64, h-fuenl-89, k-cgct-86, kll-gpct-86, kll-gpdt-87, klz-gpcs-85, ks-upcha-86, l-tcctc-80, m-ltalp-83, m-lpltw-84, o-olafs-81, ps-cgi-85, s-ossac-86, t-pgcct-89, w-ghtti-90, ZZZ"
, update =	"98.03 bibrelex"
}

@article{e-sap-80
, author =	"E. Ehrhart"
, title =	"Solution to Advanced Problems"
, journal =	"Amer. Math. Monthly"
, volume =	87
, number =	10
, month =	dec
, year =	1980
, pages =	826
, update =	"98.11 bibrelex"
}

@article{eet-igcp-76
, author =	"C. Ehrlich and S. Even and R. E. Tarjan"
, title =	"Intersection graphs of curves in the plane"
, journal =	"J. Combin. Theory Ser. B"
, volume =	21
, number =	1
, year =	1976
, pages =	"8--20"
, keywords =	"intersection graph, curves, graph"
, update =	"95.09 korneenko"
}

@article{ei-drmwc-79
, author =	"P. E. Ehrlich and H.-C. {Im Hof}"
, title =	"Dirichlet regions in manifolds without conjugate points"
, journal =	"Comment. Math. Helvetici"
, volume =	54
, year =	1979
, pages =	"642--658"
, update =	"94.09 bernal"
}

@article{ek-iatdp-89
, author =	"N. Eichhorn and H. Kieselwetter"
, title =	"{INTEGER} analysis of two-dimensional polygonal objects"
, journal =	"Computing"
, volume =	42
, number =	1
, year =	1989
, pages =	"1--16"
, update =	"95.09 korneenko"
}

@article{ed-copht-83
, author =	"G. Eichman and B. Z. Dong"
, title =	"Coherent optical production of the {Hough} Transform"
, journal =	"Appl. Optics"
, volume =	22
, number =	6
, year =	1983
, pages =	"830--834"
, update =	"97.11 bibrelex"
}

@incollection{e-sifd-94
, author =	"Paul H. C. Eilers"
, title =	"Smoothing and Interpolation with Finite Differences"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"241--250"
, keywords =	"data smoothing, curve smoothing"
, update =	"94.09 heckbert"
, annote =	"Gives simple techniques for smoothing a set of uniformly
spaced samples. This can be used to remove noise from input data. Contains C
code."
}

@article{ea--93
, author =	"F. Eisenhaber and P. J. Argos"
, title =	"??"
, journal =	"J. Comp. Chem."
, volume =	14
, number =	11
, year =	1993
, pages =	"1272--1280"
, update =	"98.03 bibrelex"
}

@inproceedings{e-vasud-93
, author =	"Rudolf Eisenst{\"o}ck"
, title =	"Visualization of Algebraic Surfaces Using the {Dexel} Model"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"48--51"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{es-mters-76
, author =	"M. Eisner and D. Severance"
, title =	"Mathematical techniques for efficient record segmentation in large shared databases"
, journal =	"J. ACM"
, volume =	23
, year =	1976
, pages =	"619--635"
, update =	"96.05 agarwal"
}

@incollection{e-fli-94
, author =	"Steven Eker"
, title =	"Faster Linear Interpolation"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"526--533"
, keywords =	"line drawing, Gouraud shading, integer arithmetic, image resampling"
, update =	"94.09 heckbert"
, annote =	"Gives optimized code for generic linear interpolation.
This is most useful for assembler language programming of graphics
operations such as Gouraud shading and image scaling. Contains C code."
}

@inproceedings{ehlmrw-ddbg-93
, author =	"H. El-Gindy and M. Houle and W. Lenhart and Miller and D. Rappaport and S. Whitesides"
, title =	"Dominance drawings of bipartite graphs"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"187--191"
, cites =	"bcdtt-hdspd-92, bl-tcopi-76, dm-pos-41, et-adgab-89, g-agtpg-80, h-dpos-51, k-vrrpd-75, k-3ipos-77, ple-togip-71, t-dapsg, dtt-arsdp-92, y-cpodp-82, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{ev-tspve-98
, author =	"J. El-Sana and A. Varshney"
, title =	"Topology Simplification for Polygonal Virtual Environments"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	4
, number =	2
, month =	apr
, year =	1998
, pages =	"133--144"
, update =	"98.11 held"
}

@article{es-cvdpu-90
, author =	"M. Elbaz and J.-C. Spehner"
, title =	"Construction of {Voronoi} Diagrams in the Plane by using Maps"
, journal =	"Theoret. Comput. Sci."
, volume =	77
, number =	3
, year =	1990
, pages =	"331--343"
, annote =	"Basic d\&c algorithm for DT ala Guibas Stolfi. Only
		 difference is that it uses DCEL as data structure (it
		 calls this maps), and omits diagonals in cyclic
		 quads."
, abstract =	"An algorithm by Guibas and Stolfi (1985) constructs,
		 for a finite set S of n sites in the plane, a
		 triangulation T(S) of S that strictly refines the
		 Delaunay diagram Del(S) when there exists a circle
		 passing through at least four points of S and none of
		 the sites is contained in its interior. For this
		 triangulation T(S) there exist isometries T such that
		 T(T(S)) does not equal T(T(S). The Voronoi diagram
		 Vor(S) is the straight-line dual of Del(S) and the
		 substitution of T(S) into Del(S) leads to needless
		 calculus, indeed to the creation of imaginary vertices
		 for Vor(S). We present here a variant of the Guibas and
		 Stolfi algorithm that determines, with the same
		 complexity, Del(S) and not a triangulation, and uses a
		 simpler data structure. We also give approximation
		 tests of collinearity and cocircularity so that for any
		 similitude T of the plane, Del(T(S)) equals T(Del(S)).
		 (Author abstract) 15 Refs."
}

@article{ec-ebvdo-91
, author =	"G. Elber and E. Cohen"
, title =	"Error bounded variable distance offset operator for free form curves and surfaces"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	1
, year =	1991
, pages =	"67--78"
, keywords =	"curve, surface, NURBS, offset"
}

@techreport{ek-bsfrs-96
, author =	"G. Elber and M. S. Kim"
, title =	"The bisector surface of freedom rational space curves"
, type =	"Technical {Report}"
, number =	"CIS 9619"
, institution =	"Dept. Comput. Sci., Technion"
, year =	1996
, update =	"98.07 bibrelex"
}

@inproceedings{ek-bsfrs-97
, author =	"G. Elber and M.-S. Kim"
, title =	"The Bisector Surface of Freeform Rational Space Curves"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"473--474"
, keywords =	"video review"
, cites =	"dh-ssco-93, ek-bsfrs-96, fj-bpppc-94, fj-cpccc-94, h-dpsi-90, hv-eescs-91, -i6um-96, spb-amat3-96, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{e-giccv-86
, author =	"G. Elekes"
, title =	"A geometric inequality and the complexity of computing the volume"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"289--292"
, keywords =	"approximation, volume, convex"
}

@article{e-nppcd-84
, author =	"G. Elekes"
, title =	"$N$ points in the plane can determine $n^3/2$ unit circles"
, journal =	"Combinatorica"
, volume =	4
, number =	"2--3"
, year =	1984
, pages =	131
, keywords =	"points, circle, combinatorial geometry"
, update =	"95.09 korneenko"
}

@incollection{ee-scpg-94
, author =	"G. Elekes and P. Erd{\H o}s"
, title =	"Similar configurations and pseudo grids"
, booktitle =	"Intuitive Geometry"
, series =	"Colloq. MAth. Sco. Janos Bolyai"
, volume =	63
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1994
, pages =	"85--104"
, update =	"98.07 bibrelex"
}

@unpublished{ee-scpps-
, author =	"G. Elekes and P. Erd{\H o}s"
, title =	"Similar Configurations in Planar Point Sets"
, note =	"?"
, update =	"97.11 bibrelex"
}

@article{e-cutm-79
, author =	"M. H. Elfick"
, title =	"Contouring by Use of a Triangular Mesh"
, journal =	"The Cartographic Journal"
, volume =	16
, number =	1
, year =	1979
, pages =	"24--29"
, annote =	"DT by circumcircle algorithm. Points are ordered by
		 $x$ coordinate to limit search. Forced edges are dealt
		 with by extra points."
}

@techreport{e-paspp-86
, author =	"H. ElGindy"
, title =	"A parallel algorithm for the shortest path problem in monotone polygons"
, type =	"Report"
, number =	"MC-CIS-86-49"
, institution =	"Dept. Comput. Inform. Sci., Univ. Pennsylvania"
, address =	"Philadelphia, PA"
, month =	may
, year =	1986
, update =	"93.09 held"
}

@unpublished{e-patsp-86
, author =	"H. ElGindy"
, title =	"A Parallel Algorithm for Triangulating Simplicial Point Sets in Space with Optimal Speed-up"
, month =	apr
, year =	1986
, note =	"(Manuscript)"
, succeeds =	"e-patsp-86-c"
, update =	"95.09 korneenko, 93.09 held"
}

@inproceedings{e-patsp-86-c
, author =	"H. ElGindy"
, title =	"A parallel algorithm for triangulating simplicial point sets in space with optimal speedup"
, booktitle =	"Proc. 24th Allerton Conf. Commun. Control Comput."
, year =	1986
, pages =	"768--776"
, keywords =	"parallel computations, $3$-dimensional, triangulation"
, precedes =	"e-patsp-86"
, update =	"95.09 korneenko"
}

@techreport{e-eacwv-84
, author =	"H. ElGindy"
, title =	"An efficient algorithm for computing the weak visibility polygon from an edge in simple polygons"
, type =	"Manuscript"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1984
}

@article{e-ospat-86
, author =	"H. ElGindy"
, title =	"An optimal speedup parallel algorithm for triangulating simplicial point sets in space"
, journal =	"Internat. J. Parallel Process."
, volume =	15
, year =	1986
, pages =	"389--398"
, keywords =	"parallel computations, $3$-dimensional, triangulation"
, update =	"95.09 korneenko"
, abstract =	"Zbl. Math. Vol. 681 no. 68069"
}

@techreport{e-omtch-81
, author =	"H. ElGindy"
, title =	"One more time: a convex hull algorithm for simple polygons"
, type =	"Internal {Report}"
, number =	""
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1981
, update =	"94.05 devillers"
}

@inproceedings{e-opatc-89
, author =	"H. ElGindy"
, title =	"Optimal parallel algorithms for triangulating certain classes of polygons"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"131--135"
, keywords =	"star-shaped, edge visible, monotone, radially monotone, polygons"
, update =	"95.09 mitchell"
}

@article{ea-lacvp-81
, author =	"H. ElGindy and D. Avis"
, title =	"A linear algorithm for computing the visibility polygon from a point"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"186--197"
, keywords =	"polygons, visibility, visibility graphs"
}

@article{eat-atdhl-83
, author =	"H. ElGindy and D. Avis and G. T. Toussaint"
, title =	"Applications of a two-dimensional hidden-line algorithm to other geometric problems"
, journal =	"Computing"
, volume =	31
, year =	1983
, pages =	"191--202"
, keywords =	"visibility, polygons, triangulation, convex hull"
}

@techreport{eg-paspp-87
, author =	"H. ElGindy and M. T. Goodrich"
, title =	"Parallel algorithms for shortest path problems in polygons"
, type =	"Report"
, number =	"MS-CIS-87-20"
, institution =	"Dept. Comput. Inform. Sci., Univ. Pennsylvania"
, address =	"Philadelphia, PA"
, year =	1987
, precedes =	"eg-paspp-88"
}

@article{eg-paspp-88
, author =	"H. ElGindy and M. T. Goodrich"
, title =	"Parallel algorithms for shortest path problems in polygons"
, journal =	"Visual Comput."
, volume =	3
, year =	1988
, pages =	"371--378"
, keywords =	"parallel computation, geodesic distance, polygons, simple, divide-and-conquer, two-dimensional"
, succeeds =	"eg-paspp-87"
}

@article{ek-eacmp-92
, author =	"H. ElGindy and J. M. Keil"
, title =	"Efficient algorithms for the capacitated $1$-median problem"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"418--425"
, update =	"98.03 mitchell, 96.05 agarwal"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@inproceedings{ellmw-rridg-95
, author =	"H. ElGindy and G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
, title =	"Recognizing Rectangle of Influence Drawable Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"352--363"
, keywords =	"graph drawing, proximity"
, update =	"95.01 tamassia"
}

@techreport{em-osrqa-91
, author =	"H. ElGindy and P. Mitra"
, title =	"Orthogonal shortest route queries among axis parallel rectangular obstacles"
, number =	"SOCS 91.07"
, month =	jul
, year =	1991
, keywords =	"shortest path, parallel algorithm, computational geometry"
, precedes =	"em-osrqa-94"
, update =	"98.11 bibrelex, 96.09 devillers, 93.09 milone+mitchell"
}

@article{em-osrqa-94
, author =	"H. ElGindy and P. Mitra"
, title =	"Orthogonal shortest route queries among axis parallel rectangular obstacles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"3--24"
, keywords =	"shortest path, parallel algorithm, computational geometry"
, succeeds =	"em-osrqa-91"
, update =	"98.11 bibrelex, 98.03 mitchell, 96.09 devillers"
}

@inproceedings{et-lvdis-88
, author =	"H. ElGindy and G. T. Toussaint"
, title =	"Link {Voronoi} diagrams inside a simple polygon with applications"
, booktitle =	"Internat. Symp. Math. Progr. Tokyo"
, year =	1988
, keywords =	"Voronoi diagram, polygons, link distance"
, update =	"95.09 korneenko"
}

@article{et-gpprl-89
, author =	"Hossam ElGindy and Godfried T. Toussaint"
, title =	"On geodesic properties of polygons relevant to linear time triangulation"
, journal =	"Visual Comput."
, volume =	5
, number =	"1--2"
, year =	1989
, pages =	"68--74"
, abstract =	"The paper provides a contribution to the problem of
		 finding optimal (linear time) algorithm for
		 triangulating simple polygons. Two new classes of
		 polygons, called palm polygons and crab polygons are
		 introduced. The class of palm polygons contains many
		 known classes of polygons for which linear time
		 triangulation algorithms are known and a linear time
		 algorithm for triangulating palm polygons is presented.
		 The class of crab polygons is shown to contain all
		 classes of polygons for which linear time triangulation
		 algorithms are known up to now. However, the problem of
		 linear time identification and triangulation of crab
		 polygons remains open"
}

@incollection{et-tpplt-88
, author =	"H. ElGindy and G. T. Toussaint"
, title =	"On triangulating palm polygons in linear time"
, editor =	"N. Magnenat-Thalmann and D. Thalmann"
, booktitle =	"New Trends in Computer Graphics"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"308--317"
, keywords =	"polygons, triangulation"
, update =	"97.03 schwarzkopf, 95.09 korneenko"
}

@phdthesis{e-hdpa-85
, author =	"H. A. ElGindy"
, title =	"Hierarchical Decomposition of Polygons with Applications"
, school =	"School of Computer Science, McGill University"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@incollection{et-crnds-88
, author =	"H. A. ElGindy and G. T. Toussaint"
, title =	"Computing the relative neighbor decomposition of a simple polygon"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"53--70"
}

@inproceedings{et-eaide-85
, author =	"Hossam A. ElGindy and Godfried T. Toussaint"
, title =	"Efficient Algorithms For Inserting And Deleting Edges From Triangulations"
, booktitle =	"Proceedings, Foundations of Data Organization."
, publisher =	"Organizing Committee of the Int Conference on Foundations of Data Organization"
, address =	"Jpn"
, year =	1985
, pages =	"163--169"
, keywords =	"line segments, triangulations, geometric complexity"
, abstract =	"We address the problem of edge-updating a
		 triangulation of a point set efficiently. Given a
		 suitable representation of the triangulation of a
		 finite set P, how can one construct a triangulation of
		 P union left brace 1 right brace for some line segment
		 1 (insertion problem), or how can one construct a
		 triangulation of P - left brace p,q right brace where p
		 and q are points in P that are connected by an edge in
		 the triangulation (deletion problem). (Author abstract)
		 13 refs."
}

@inproceedings{et-cut-87
, author =	"Hossam A. ElGindy and Godfried T. Toussaint"
, title =	"On Computing and Updating Triangulations"
, editor =	"S. P. Ghosh and Y. Kanbayashi and K. Tanaka"
, booktitle =	"Proc. Internat. Conf. Found. Data Organization"
, publisher =	"Plenum Press"
, address =	"New York"
, year =	1987
, pages =	"249--262"
, update =	"98.11 bibrelex"
, annote =	"$O(n \log n)$ algorithm for triangulation of a set of
		 line segments, and algorithms for inserting and
		 deleting from a set of line segments."
}

@techreport{et-tls-84
, author =	"H. A. ElGindy and G. T. Toussaint"
, title =	"On Triangulations of Line Segments"
, number =	"SOCS 84.9"
, institution =	"McGill University"
, year =	1984
, annote =	"Algorithms for constructing and modifying {\em a\/} triangulation of line segments."
}

@book{e-cit-88
, author =	"R. Elliott"
, title =	"Cast iron technology"
, publisher =	"Butterworths"
, address =	"London, UK"
, year =	1988
, update =	"98.03 bibrelex"
}

@techreport{el-dssm-??
, author =	"R. J. Elliott and M. E. Lesk"
, title =	"Data structures for street maps"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@techreport{el-rfsmc-??
, author =	"R. J. Elliott and M. E. Lesk"
, title =	"Route finding in street maps by computers and people"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@article{ekltmmv-rcerr-91
, author =	"J. L. Ellis and G. Kedem and T. C. Lyerly and D. G. Thielman and R. J. Marisa and J. P. Menon and H. B. Voelcker"
, title =	"The ray casting engine and ray representations: a technical summary"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	4
, year =	1991
, pages =	"347--380"
, keywords =	"mechanical CAD CAM, solid modeling, parallel computation, ray representation"
}

@article{ee-nsnpa-76
, author =	"J. R. Ellis and M. Eden"
, title =	"On the number of sides necessary for polygonal approximation of black-and-white figures in a plane"
, journal =	"Inform. Control"
, volume =	30
, year =	1976
, pages =	"169--186"
, keywords =	"polygons, fitting"
, update =	"95.09 korneenko"
}

@inproceedings{e-atdrp-87
, author =	"R. E. Ellis"
, title =	"Acquiring tactile data for the recognition of planar objects"
, booktitle =	"Proc. Internat. Conf. Robots Autom."
, volume =	3
, year =	1987
, pages =	"1799--1805"
, keywords =	"probing, shape"
, update =	"95.09 korneenko"
}

@inproceedings{el-enmrt-92
, author =	"H. Elter and P. Lienhardt"
, title =	"Extension of the notion of map for the representation of the topology of cellular complexes"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"65--70"
, cites =	"adf-gmsou-85, ak-mdspl-89, b-prcv-75, b-rgsdd-89, dl-pmtds-87, e-acg-87, el-ascac-, fp-ebemp-91, fp-cst-90, gs-pmgsc-85, l-sndsn-89, l-tmbrc-91, m-ism-88, ro-sdimp-89i, s-ebrtd-89, s-mmp-91, w-ebdss-85, w-redst-86, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{el-ascac-
, author =	"H. Elter and P. Lienhardt"
, title =	"Form abstract simplicial complexes to abstract cellular complexes: construction of combinatorial models"
, type =	"Research {Report}"
, institution =	"Dept. Comput. Sci., Louis Pasteur Univ."
, address =	"Strasbourg, France"
, year =	"??"
, update =	"98.07 bibrelex"
}

@article{eh-mcsp-72
, author =	"J. Elzinga and D. Hearn"
, title =	"The minimum covering sphere problem"
, journal =	"Manage. Sci."
, volume =	19
, year =	1972
, pages =	"96--104"
, keywords =	"facility location, optimization, points, sphere"
, update =	"95.09 korneenko"
}

@article{eh-msccp-74
, author =	"J. Elzinga and D. Hearn"
, title =	"The minimum sphere covering a convex polyhedron"
, journal =	"Naval Res. Logist. Quart."
, volume =	21
, year =	1974
, pages =	"715--718"
}

@article{eh-gssml-72
, author =	"J. Elzinga and D. W. Hearn"
, title =	"Geometrical solutions to some minimax location problems"
, journal =	"Transp. Sci."
, volume =	6
, year =	1972
, pages =	"379--394"
, keywords =	"optimization, facility location, minmax"
, update =	"95.09 korneenko"
}

@article{e-mccp-15
, author =	"A. Emch"
, title =	"On the medians of a closed convex polygon"
, journal =	"Amer. J. Math."
, volume =	37
, year =	1915
, pages =	"19--28"
, update =	"98.07 bibrelex"
}

@article{e-spccc-13
, author =	"A. Emch"
, title =	"Some properties of closed convex curves in a plane"
, journal =	"Amer. J. Math."
, volume =	35
, year =	1913
, pages =	"407--412"
, update =	"98.07 bibrelex"
}

@techreport{e-anccp-82
, author =	"P. van {Emde Boas}"
, title =	"Another {NP}-complete covering problem"
, type =	"Report"
, number =	"??"
, institution =	"Univ. Amsterdam"
, address =	"Amsterdam, Netherlands"
, year =	1982
, update =	"93.09 rote"
}

@article{e-olbch-80
, author =	"P. van {Emde Boas}"
, title =	"On the {$\Omega(n \log n)$} lower-bound for convex hull and maximal vector determination"
, journal =	"Inform. Process. Lett."
, volume =	10
, year =	1980
, pages =	"132--136"
, update =	"93.09 rote"
}

@article{e-pofll-77
, author =	"P. van {Emde Boas}"
, title =	"Preserving order in a forest in less than logarithmic time and linear space"
, journal =	"Inform. Process. Lett."
, volume =	6
, year =	1977
, pages =	"80--82"
, update =	"97.11 bibrelex"
}

@article{ekz-diepq-77
, author =	"P. van {Emde Boas} and R. Kaas and E. Zijlstra"
, title =	"Design and Implementation of an Efficient Priority Queue"
, journal =	"Math. Syst. Theory"
, volume =	10
, year =	1977
, pages =	"99--127"
, update =	"93.09 rote"
}

@article{ejla-csmcd-91
, author =	"A. F. Emery and O. Johansson and M. Lobo and A. Abrous"
, title =	"A comparative study of methods for computing the diffuse radiation viewfactors for complex structures"
, journal =	"Journal of Heath Transfer"
, volume =	113
, year =	1991
, pages =	"412--421"
, update =	"98.03 bibrelex"
}

@techreport{e-cicgd-96
, author =	"I. Emiris"
, title =	"A Complete Implementation for Computing General Dimensional Convex Hulls"
, type =	"Research {Report}"
, number =	2551
, institution =	"INRIA"
, year =	1996
, url =	"http://www.inria.fr/rapports/sophia/RR-2551.html"
, precedes =	"e-cicgd-98"
, update =	"98.11 devillers, 97.03 devillers"
, abstract =	"We  study  two important,  and   often complementary,
issues  in  the implementation of geometric algorithms,  namely exact
arithmetic  and degeneracy.  We focus on integer arithmetic and propose
a general and efficient method for  its implementation based on modular
arithmetic.  We  suggest that probabilistic  modular arithmetic  may  be
of  wide interest,  as it combines the  advantages of  modular
arithmetic with randomization in order to   speed up the   lifting of
residues  to an integer.     We    derive general  error bounds      and
discuss the implementation of this approach  in our general-dimension
convex hull program.  The use  of perturbations as a method   to cope
with  input degeneracy  is also illustrated.  We  present the
implementation of a computationally efficient  scheme  that, moreover,
greatly simplifies the task of programming.    We concentrate on
postprocessing,  often perceived as  the Achilles heel  of
perturbations.  Starting in the context  of  a specific application   in
robotics,  we  examine  the complexity  of postprocessing and  attempt
to delimit the cases where perturbations become a hindrance rather than
an enhancement.  Lastly, we   discuss  the visualization   capabilities
of our  software and illustrate them for problems in computational
algebraic geometry."
}

@article{e-cicgd-98
, author =	"I. Emiris"
, title =	"A Complete Implementation for Computing General Dimensional Convex Hulls"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"33--36"
, succeeds =	"e-cicgd-96"
, update =	"99.11 bibrelex, 98.11 devillers, 98.07 bibrelex"
}

@mastersthesis{e-eargd-91
, author =	"I. Emiris"
, title =	"An efficient approach to removing geometric degeneracies"
, school =	"Comput. Sci. Div., Univ. California"
, address =	"Berkeley, CA"
, month =	may
, year =	1991
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{ec-gard-91
, author =	"I. Emiris and J. Canny"
, title =	"A general approach to removing degeneracies"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"405--413"
, precedes =	"ec-gard-95"
, update =	"96.09 devillers"
}

@article{ec-gard-95
, author =	"I. Emiris and J. Canny"
, title =	"A general approach to removing degeneracies"
, journal =	"SIAM J. Comput."
, volume =	24
, year =	1995
, pages =	"650--664"
, keywords =	"input degeneracy, ill-conditioned problems, symbolic perturbation, infinitesimals, randomization, determinants, roots of polynomials, algorithmic complexity"
, succeeds =	"ec-gard-91,ec-eargd-92"
, update =	"96.09 devillers"
}

@inproceedings{ec-eargd-92
, author =	"I. Emiris and J. Canny"
, title =	"An efficient approach to removing geometric degeneracies"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"74--82"
, precedes =	"ec-gard-95"
, cites =	"ahu-daca-74, c-crsas-91, cl-rzp-82, d-lpe-63, d-afp-90, e-acg-87, eg-tsa-86, em-sstcd-90, ew-chsct-86, e-eargd-91, ec-gard-91, k-facp-85, ps-cgi-85, y-stgd-87, y-gctsp-88, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@inproceedings{e-cipms-00
, author =	"Ioannis Z. Emiris"
, title =	"Computing Integer Points in {Minkowski} Sums"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"29--36"
, update =	"00.11 jones"
}

@article{ecs-ephgd-97
, author =	"I. Z. Emiris and J. F. Canny and R. Seidel"
, title =	"Efficient Perturbations for Handling Geometric Degeneracies"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"219--242"
, update =	"97.07 held"
}

@inproceedings{eg-dcmv-97
, author =	"Ioannis Z. Emiris and Thierry Giordano"
, title =	"Distributed Computation of Mixed Volume"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"48--50"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{e-sshlp-70
, author =	"J. L. Encarnacao"
, title =	"A survey of solutions of the hidden line problem"
, booktitle =	"Proc. Interactive Comput. Graphics Conf."
, year =	1970
, pages =	"??"
}

@book{e-cgpav-75
, author =	"J. L. Encarnacao"
, title =	"Computer-Graphics: {Programmierung} and {Anwendung} von graphischen {Systemen}"
, publisher =	"R. Oldenburg Verlag"
, address =	"M{\"u}nchen, West Germany"
, year =	1975
}

@inproceedings{e-mpr-91
, author =	"Peter Engel"
, title =	"On the morphology of polytopes in {$R^d$}"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"71--83"
, keywords =	"combinatorial enumeration"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
, abstract =	"An algorithm to enumerate the combinatorial types of
                 $d$-spheres is described.  A purely geometric condition is
                 given to determine the non-polytopal spheres.
                 New results are presented for $d=4$ and $5$."
}

@book{e-oaz-94
, author =	"P. Engel"
, title =	"Origami from Angelfish to Zen"
, publisher =	"Dover"
, year =	1994
, update =	"97.11 bibrelex"
}

@book{es-vims-98
, title =	"Voronoi's Impact on Modern Science"
, editor =	"P. Engel and H. Syta"
, publisher =	"Institute of Mathematics of the National Academy of Sciences of Ukraine"
, address =	"Kyiv"
, year =	1998
, update =	"00.11 smid"
, annote =	"Two books, contains a biography of Voronoi"
}

@article{elw-bggde-90
, author =	"J. Engelfriet and G. Leih and Emo Welzl"
, title =	"Boundary graph grammars with dynamic edge relabeling"
, journal =	"J. Comput. Syst. Sci."
, volume =	40
, year =	1990
, pages =	"307--345"
, update =	"98.03 mitchell, 97.03 gaertner+salinger"
}

@article{e-cma-89
, author =	"H. Englisch"
, title =	"The circumpolygon with maximal area"
, journal =	"Optimization"
, volume =	20
, number =	4
, year =	1989
, pages =	"503--508"
, keywords =	"polygon, circuscribed, area, optimization"
, update =	"95.09 korneenko"
}

@article{ev-imacm-88
, author =	"H. Englisch and H. Voigt"
, title =	"The inpolygon with minimal area and the circumpolygon with maximal perimeter"
, journal =	"Optimization"
, volume =	19
, number =	2
, year =	1988
, pages =	"229--233"
, keywords =	"polygon, circuscribed, inscribed, area, optimization, perimeter"
, update =	"95.09 korneenko"
}

@article{e-eadwf-84
, author =	"T. C. Enns"
, title =	"An efficient algorithm determining when fabrics hang together"
, journal =	"Geom. Dedicata"
, volume =	15
, year =	1984
, pages =	"259--260"
, keywords =	"fabrics, weavings"
, update =	"95.09 korneenko"
}

@article{esg-imgc-98
, author =	"M. T. Ensz and D. W. Storti and M. A. Ganter"
, title =	"Implicit Methods for Geometry Creation"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"509--536"
, update =	"98.11 devillers"
}

@inproceedings{ek-tgpdr-87
, author =	"K. S. Eo and C. M. Kyung"
, title =	"A two-dimensional geometric processor for design rule check applications"
, booktitle =	"TENCON'87. IEEE Per.10 Conf.?"
, volume =	1
, year =	1987
, pages =	"266--270"
, keywords =	"parallel computations, isothetic, VLSI design"
, update =	"95.09 korneenko"
}

@article{e-amwst-94
, author =	"D. Eppstein"
, title =	"Approximating the minimum weight {Steiner} triangulation"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"163--191"
, succeeds =	"e-amwt-92"
, update =	"96.09 aronov"
}

@techreport{e-amwt-91
, author =	"D. Eppstein"
, title =	"Approximating the minimum weight triangulation"
, type =	"Tech. Report"
, number =	"91-55"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1991
, precedes =	"e-amwt-92"
}

@inproceedings{e-amwt-92
, author =	"D. Eppstein"
, title =	"Approximating the minimum weight triangulation"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"48--57"
, succeeds =	"e-amwt-91"
, precedes =	"e-amwst-94"
, update =	"96.09 aronov"
}

@article{e-acadg-96
, author =	"D. Eppstein"
, title =	"Average case analysis of dynamic geometric optimization"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"45--68"
, update =	"96.09 devillers"
}

@article{e-demst-95
, author =	"D. Eppstein"
, title =	"Dynamic {Euclidean} minimum spanning trees and extrema of binary functions"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"111--122"
, update =	"96.05 smid"
}

@inproceedings{e-dtdlp-91
, author =	"D. Eppstein"
, title =	"Dynamic three-dimensional linear programming"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"488--494"
, precedes =	"e-dtdlp-92"
, update =	"93.09 rote"
}

@article{e-dtdlp-92
, author =	"D. Eppstein"
, title =	"Dynamic three-dimensional linear programming"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"360--368"
, keywords =	"optimization, cluster analysis"
, succeeds =	"e-dtdlp-91"
, update =	"98.03 mitchell, 93.09 rote"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@inproceedings{e-fhcoa-98
, author =	"David Eppstein"
, title =	"Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"619--628"
, update =	"98.07 agarwal+mitchell"
}

@article{e-fcpan-97
, author =	"D. Eppstein"
, title =	"Faster Circle Packing with Application to Non-Obtuse Triangulation"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"485--492"
, update =	"99.11 bibrelex, 98.11 devillers"
}

@techreport{e-fcptc-96
, author =	"D. Eppstein"
, title =	"Faster construction of planar two-centers"
, type =	"Tech. Report"
, number =	"96-12"
, institution =	"Dept. Comput. Sci."
, address =	"University of California, Irvine"
, year =	1996
, update =	"96.05 agarwal"
}

@inproceedings{e-fcptc-97
, author =	"D. Eppstein"
, title =	"Faster construction of planar two-centers"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, update =	"97.03 agarwal, 96.05 agarwal"
}

@techreport{e-fgkma-95
, author =	"D. Eppstein"
, title =	"Faster geometric $k$-point {MST} approximation"
, type =	"Tech. Report"
, number =	"95-13"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1995
, keywords =	"k-MST"
, precedes =	"e-fgkma-97"
, update =	"98.03 mitchell, 95.09 mitchell"
}

@article{e-fgkma-97
, author =	"D. Eppstein"
, title =	"Faster geometric $k$-point {MST} approximation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, number =	5
, month =	oct
, year =	1997
, pages =	"231--240"
, keywords =	"k-MST"
, succeeds =	"e-fgkma-95"
, update =	"98.03 mitchell"
}

@inproceedings{e-fksst-90
, author =	"D. Eppstein"
, title =	"Finding the $k$ smallest spanning trees"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"38--47"
}

@article{e-fksst-92
, author =	"D. Eppstein"
, title =	"Finding the $k$ smallest spanning trees"
, journal =	"BIT"
, volume =	32
, year =	1992
, pages =	"237--248"
}

@techreport{e-fdmem-92
, author =	"D. Eppstein"
, title =	"Fully dynamic maintenance of {Euclidean} minimum spanning trees"
, type =	"Tech. Report"
, number =	"92-05"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1992
}

@inproceedings{e-glbpm-95
, author =	"D. Eppstein"
, title =	"Geometric lower bounds for parametric matroid optimization"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, year =	1995
, pages =	"662--671"
, update =	"95.09 smid"
}

@misc{e-ga-
, author =	"David Eppstein"
, title =	"Geometry in Action"
, url =	"http://www.ics.uci.edu/~eppstein/geom.html"
, update =	"97.03 tamassia"
}

@techreport{e-ibith-91
, author =	"D. Eppstein"
, title =	"Improved bounds for intersecting triangles and halving planes"
, type =	"Tech. Report"
, number =	"91-53"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1991
, comments =	"To appear in J. Comb. Theory Ser. A"
}

@article{e-ibith-93
, author =	"D. Eppstein"
, title =	"Improved bounds for intersecting triangles and halving planes"
, journal =	"J. Combin. Theory Ser. A"
, volume =	62
, year =	1993
, pages =	"176--182"
, update =	"98.03 agarwal"
}

@inproceedings{e-lchmg-96
, author =	"David Eppstein"
, title =	"Linear Complexity Hexahedral Mesh Generation"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"58--67"
, cites =	"bpmcs-cahat-95, b-ct-93, be-mgot-95, cs-bst-94, h-mgasi-83, h-srcc-95, jsk-actfm-91, bbmmt-hmgd-95, m-cqmsw-95, rrt-ctq-95, s-op-, t-hdp-93, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@techreport{e-namak-91
, author =	"D. Eppstein"
, title =	"New algorithms for minimum area $k$-gons"
, type =	"Tech. Report"
, number =	"91-59"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1991
}

@inproceedings{e-namak-92
, author =	"D. Eppstein"
, title =	"New algorithms for minimum area $k$-gons"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"83--88"
}

@inproceedings{e-oadms-91
, author =	"D. Eppstein"
, title =	"Offline algorithms for dynamic minimum spanning tree problems"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"392--399"
, keywords =	"proximity, minimum spanning tree"
, precedes =	"e-oadms-92"
}

@techreport{e-oadms-92
, author =	"D. Eppstein"
, title =	"Offline algorithms for dynamic minimum spanning tree problems"
, type =	"Tech. Report"
, number =	"92-04"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1992
, succeeds =	"e-oadms-91"
}

@techreport{e-poasc-91
, author =	"D. Eppstein"
, title =	"Persistence, offline algorithms, and space compaction"
, type =	"Tech. Report"
, number =	"91-54"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1991
}

@incollection{e-sts-00
, author =	"David Eppstein"
, title =	"Spanning Trees and Spanners"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"425--461"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 agarwal"
, annote =	"Chapter 9 of su-hcg-00"
}

@techreport{e-sucsg-92
, author =	"D. Eppstein"
, title =	"Speed-ups in constructive solid geometry"
, type =	"Report"
, number =	"92-87"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1992
, update =	"96.09 orourke"
}

@techreport{e-sntcp-91
, author =	"D. Eppstein"
, title =	"Subquadratic nonobtuse triangulation of convex polygons"
, type =	"Tech. Report"
, number =	"91-61"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1991
}

@techreport{e-dnng-92
, author =	"D. Eppstein"
, title =	"The diameter of nearest neighbor graphs"
, type =	"Tech. Report"
, number =	"92-76"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, month =	jul
, year =	1992
, update =	"98.11 bibrelex"
}

@techreport{e-fpdtm-90
, author =	"D. Eppstein"
, title =	"The farthest point {Delaunay} triangulation minimizes angles"
, type =	"Manuscript"
, year =	1990
, update =	"97.11 bibrelex"
}

@article{e-fpdtm-92
, author =	"D. Eppstein"
, title =	"The farthest point {Delaunay} triangulation minimizes angles"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1992
, pages =	"143--148"
, keywords =	"Delaunay triangulation, Voronoi diagrams"
}

@techreport{e-twngk-92
, author =	"D. Eppstein"
, title =	"Tree-weighted neighbors and geometric $k$ smallest spanning trees"
, type =	"Tech. Report"
, number =	"92-77"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1992
, precedes =	"e-twngk-94"
, update =	"96.09 devillers"
}

@article{e-twngk-94
, author =	"D. Eppstein"
, title =	"Tree-weighted neighbors and geometric $k$ smallest spanning trees"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"229--238"
, keywords =	"minimum spanning trees, spanning tree enumeration, geometric optimization, nearest neighbors"
, succeeds =	"e-twngk-92"
, update =	"96.09 devillers"
}

@techreport{ee-innfm-92
, author =	"D. Eppstein and J. Erickson"
, title =	"Iterated nearest neighbors and finding minimal polytopes"
, type =	"Tech. Report"
, number =	"92-71"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1992
, precedes =	"ee-innfm-93"
, update =	"93.09 rote"
}

@inproceedings{ee-innfm-93
, author =	"D. Eppstein and J. Erickson"
, title =	"Iterated Nearest Neighbors and Finding Minimal Polytopes"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"64--73"
, keywords =	"optimization"
, succeeds =	"ee-innfm-92"
, update =	"93.09 rote, 93.05 smid"
}

@article{ee-innfm-94
, author =	"D. Eppstein and J. Erickson"
, title =	"Iterated nearest neighbors and finding minimal polytopes"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"321--350"
, succeeds =	"ee-innfm-93"
, update =	"95.01 matousek"
}

@techreport{ee-namms-92
, author =	"D. Eppstein and J. Erickson"
, title =	"New algorithms for minimum measure simplices and one-dimensional weighted {Voronoi} diagrams"
, type =	"Tech. Report"
, number =	"92-55"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1992
}

@article{eg-patcc-88
, author =	"D. Eppstein and Z. Galil"
, title =	"Parallel algorithmic techniques for combinatorial computation"
, journal =	"Annu. Rev. Comput. Sci."
, volume =	3
, year =	1988
, pages =	"233--283"
, update =	"96.09 orourke"
}

@inproceedings{egg-sudp-88
, author =	"D. Eppstein and Z. Galil and R. Giancarlo"
, title =	"Speeding up dynamic programming"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"488--496"
}

@inproceedings{eggi-sdp-90
, author =	"D. Eppstein and Z. Galil and R. Giancarlo and G. F. Italiano"
, title =	"Sparse dynamic programming"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"513--522"
}

@inproceedings{egis-sbsdp-93
, author =	"D. Eppstein and Z. Galil and G. Italiano and T. Spencer"
, title =	"Separator Based Sparsification for Dynamic Planar Graph Algorithms"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"208--217"
, update =	"95.05 tamassia"
}

@inproceedings{egin-stsud-92
, author =	"D. Eppstein and Z. Galil and G. F. Italiano and A. Nissenzweig"
, title =	"Sparsification: {A} Technique for Speeding up Dynamic Graph Algorithms"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"60--69"
, update =	"94.01 tamassia"
}

@article{egis-sbspt-96
, author =	"D. Eppstein and Z. Galil and G. F. Italiano and T. H. Spencer"
, title =	"Separator based sparsification I. planarity testing and minimum spanning trees"
, journal =	"J. Comput. Syst. Sci."
, volume =	52
, year =	1996
, pages =	"3--27"
, update =	"96.05 smid"
}

@techreport{eh-spakl-97
, author =	"David Eppstein and David Hart"
, title =	"Shortest Paths in an Arrangement with {$k$} Line Orientations"
, type =	"Manuscript"
, institution =	"University of California, Irvine"
, year =	1997
, update =	"98.03 mitchell"
}

@article{eittwy-cmmsf-93
, author =	"D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
, title =	"Corrigendum ({M}aintenance of a Minimum Spanning Forest in a Dynamic Plane Graph)"
, journal =	"J. Algorithms"
, volume =	15
, number =	1
, year =	1993
, pages =	173
, update =	"98.07 tamassia+vismara"
}

@inproceedings{eittwy-mmsfd-90
, author =	"D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
, title =	"Maintenance of a minimum spanning forest in a dynamic planar graph"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"1--11"
, precedes =	"eittwy-mmsfd-92"
}

@article{eittwy-mmsfd-92
, author =	"D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
, title =	"Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph"
, journal =	"J. Algorithms"
, volume =	13
, number =	1
, year =	1992
, pages =	"33--54"
, succeeds =	"eittwy-mmsfd-90"
, update =	"98.07 tamassia+vismara"
, annote =	"Corrigendum in 15(1):173, 1993"
}

@inproceedings{emt-dltag-93
, author =	"D. Eppstein and G. L. Miller and S.-H. Teng"
, title =	"A deterministic linear time algorithm for geometric separators and its applications"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"99--108"
, cites =	"b-mdc-80, beg-pgmg-90, cs-splg-88, d-scpps-92, dfn-mgma-84, fj-sbsem-86, fmt-sbpdc-92, g-ndrfe-73, gl-cslsp-81, ght-stgbg-84, gt-anda-87, hs-sugpm-90, hlp-i-52, hw-ensrq-87, hc-gi-52, jp-dhp-78, k-fa-73, k-sa-81, k-ss-73, lrt-gnd-79, lt-stpg-79, lt-apst-80, m-aogdc-91, mt-cppd-90, mttv-amp-92, mt-sttd-90, mtv-ugags-91, mv-dgs-91, pr-epsls-85, sf-afem-73, t-pssug-90, t-gt3m-88, vc-ucrfe-71, v-adptd-91, v-oaann-89, y-3spia-83, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{eorw-fmakg-92
, author =	"D. Eppstein and M. H. Overmars and G{\"u}nter Rote and G. Woeginger"
, title =	"Finding minimum area $k$-gons"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"45--58"
, keywords =	"optimization, reporting"
, update =	"98.07 agarwal, 98.03 mitchell, 93.09 rote"
}

@mastersthesis{e-ggor-92
, author =	"P. Epstein"
, title =	"Generating Geometric Objects at Random"
, school =	"School of Computer Science, Carleton University"
, month =	apr
, year =	1992
, keywords =	"master thesis"
, update =	"98.11 bibrelex"
}

@article{ekkmns-wcg-94
, author =	"P. Epstein and J. Kavanagh and A. Knight and J. May and T. Nguyen and J.-R. Sack"
, title =	"A Workbench for Computational Geometry"
, journal =	"Algorithmica"
, volume =	11
, number =	4
, month =	apr
, year =	1994
, pages =	"404--428"
, update =	"98.11 bibrelex, 98.07 bibrelex, 97.11 sack, 97.07 smid"
}

@techreport{ekmns-wcg-90
, author =	"P. Epstein and A. Knight and J. May and T. Nguyen and J.-R. Sack"
, title =	"A workbench for computational geometry"
, type =	"Technical {Report}"
, number =	"SCS-TR-180"
, institution =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{es-gtr-92
, author =	"P. Epstein and J.-R. Sack"
, title =	"Generating triangulations at random"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"305--310"
, cites =	"as-gbtr-92, e-ggor-92, u-igfpc-80, ZZZ"
, update =	"98.07 bibrelex"
}

@article{es-gtr-94
, author =	"P. Epstein and J.-R. Sack"
, title =	"Generating Triangulations at Random"
, journal =	"ACM Transaction on Modeling and Computer Simulation"
, volume =	4
, number =	3
, year =	1994
, pages =	"267--278"
, update =	"97.11 sack"
}

@techreport{e-mpu-84
, author =	"M. Erdmann"
, title =	"On motion planning with uncertainty"
, number =	"MIT-AI-TR 810"
, institution =	"Artificial Intelligence Laboratory, MIT"
, year =	1984
, update =	"98.03 bibrelex"
}

@article{e-ubfmp-86
, author =	"M. Erdmann"
, title =	"Using Backprojections for Fine Motion Planning with Uncertainty"
, journal =	"Internat. J. Robot. Res."
, volume =	5
, number =	1
, year =	1986
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@article{el-mmo-87
, author =	"M. Erdmann and T. Lozano-P{\'e}rez"
, title =	"On multiple moving objects"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"477--521"
}

@inproceedings{em-esm-86
, author =	"M. Erdmann and M. T. Mason"
, title =	"An Exploration of Sensorless Manipulation"
, booktitle =	"Proc. 3rd IEEE Internat. Conf. Robot. Autom."
, month =	apr
, year =	1986
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{em-esm-88
, author =	"M. A. Erdmann and M. Mason"
, title =	"An exploration of sensorless manipulation"
, journal =	"Internat. J. Robot. Autom."
, volume =	4
, number =	4
, year =	1988
, pages =	"367--379"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@incollection{e-cpgnt-79
, author =	"P. Erd{\H o}s"
, title =	"Combinatorial problems in geometry and number theory"
, booktitle =	"??"
, series =	"Proc. Symp. Pure Math."
, volume =	34
, publisher =	"American Mathematical Society"
, year =	1979
, pages =	"149--62"
, update =	"98.03 bibrelex"
}

@article{e-gtp-59
, author =	"P. Erd{\H o}s"
, title =	"Graph theory and probability"
, journal =	"Canad. J. Math."
, volume =	11
, year =	1959
, pages =	"34--38"
, update =	"98.03 bibrelex"
}

@article{e-epggg-64
, author =	"P. Erd{\H o}s"
, title =	"On extremal problems of graphs and generalized graphs"
, journal =	"Israel J. Math."
, volume =	2
, year =	1964
, pages =	"183--190"
, update =	"98.03 bibrelex"
}

@article{e-sdnp-46
, author =	"P. Erd{\H o}s"
, title =	"On sets of distances of $n$ points"
, journal =	"Amer. Math. Monthly"
, volume =	53
, year =	1946
, pages =	"248--250"
, keywords =	"combinatorial geometry, number theory, unit distances"
, update =	"02.03 orourke"
}

@article{e-sdnpe-60
, author =	"P. Erd{\H o}s"
, title =	"On sets of distances of $n$ points in {Euclidean} space"
, journal =	"Publications Mathematical Institute of Hungarian Academy of Sciences"
, volume =	5
, year =	1960
, pages =	"165--169"
, keywords =	"combinatorial geometry, number theory, unit distance"
}

@article{e-sagtg-67
, author =	"P. Erd{\H o}s"
, title =	"On some applications of graph theory to geometry"
, journal =	"Canad. J. Math."
, volume =	19
, year =	1967
, pages =	"968--971"
, keywords =	"unit distance, extremal graph theory"
}

@article{e-irpnn-62
, author =	"P. Erd{\H o}s"
, title =	"On the integers relatively prime to $n$ and on a number theoretic function considered by {Jacobsthal}"
, journal =	"Math. Scand."
, volume =	10
, year =	1962
, pages =	"163--170"
, update =	"97.11 bibrelex"
}

@book{e-peac-73
, author =	"P. Erd{\H o}s"
, title =	"Paul Erd{\H o}s: {The} Art of Counting"
, editor =	"J. H. Spencer"
, publisher =	"MIT Press"
, year =	1973
, update =	"97.11 bibrelex"
}

@article{e-p3763-35
, author =	"P. Erd{\H o}s"
, title =	"Problem 3763"
, journal =	"Amer. Math. Monthly"
, volume =	42
, year =	1935
, pages =	627
, comments =	"See sn-sp3763-39."
, update =	"98.11 orourke"
, annote =	"Flipping polygon pockets."
}

@article{e-pn4-44
, author =	"P. Erd{\H o}s"
, title =	"Problem No 4065"
, journal =	"Amer. Math. Monthly"
, volume =	51
, year =	1944
, pages =	169
, update =	"98.03 devillers"
}

@article{e-smpeg-78
, author =	"Paul Erd{{\H o}}s"
, title =	"Some more problems on elementary geometry"
, journal =	"Austral. Math. Soc. Gaz."
, volume =	5
, year =	1978
, pages =	"52--54"
, update =	"02.03 devillers"
}

@article{efrs-srn-78
, author =	"P. Erd{\H o}s and R. J. Faudree and C. C. Rousseau and R. H. Schelp"
, title =	"The size {Ramsey} number"
, journal =	"Periodica Mathematica Hungarica"
, volume =	9
, year =	1978
, pages =	"145--161"
, update =	"97.11 bibrelex"
}

@article{ef-mpsme-97
, author =	"P. Erd{\H o}s and P. Fishburn"
, title =	"Minimum planar sets with maximum equidistance counts"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"207--218"
, update =	"97.07 devillers"
}

@book{egh-lp-89
, author =	"P. Erd{\H o}s and P. M. Gruber and J. Hammer"
, title =	"Lattice Points"
, publisher =	"Longman Scientific \& Technical"
, year =	1989
, update =	"98.03 bibrelex"
}

@article{eg-cnp-73
, author =	"P. Erd{\H o}s and R. K. Guy"
, title =	"Crossing number problems"
, journal =	"Amer. Math. Monthly"
, volume =	80
, year =	1973
, pages =	"52--58"
, update =	"97.11 bibrelex"
}

@article{eg-vcmp-95
, author =	"P. Erd{\H o}s and A. Gy{\'a}rf{\'a}s"
, title =	"Vertex covering with monochromatic paths"
, journal =	"Mathematica Pannonica"
, volume =	6
, year =	1995
, pages =	"7--10"
, update =	"97.11 bibrelex"
}

@article{egp-vcmct-91
, author =	"P. Erd{\H o}s and A. Gy{\'a}rf{\'a}s and L. Pyber"
, title =	"Vertex coverings by monochromatic cycles and trees"
, journal =	"J. Combin. Theory Ser. B"
, volume =	51
, year =	1991
, pages =	"90--95"
, update =	"97.11 bibrelex"
}

@article{ek-cdrr-90
, author =	"P. Erd{\H o}s and P. Komj{\'a}th"
, title =	"Countable decompositions of {$\Re^2$} and {$\Re^3$}"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"325--331"
}

@incollection{elss-dgpps-73
, author =	"P. Erd{\H o}s and L. Lov{\'a}sz and A. Simmons and E. Straus"
, title =	"Dissection graphs of planar point sets"
, editor =	"J. N. Srivastava"
, booktitle =	"A Survey of Combinatorial Theory"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1973
, pages =	"139--154"
, keywords =	"$k$-sets"
}

@article{elv-gld-89
, author =	"P. Erd{\H o}s and L. Lov{\'a}sz and K. Vesztergombi"
, title =	"On the graph of large distances"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"541--549"
}

@article{ep-vtrd-90
, author =	"P. Erd{\H o}s and J. Pach"
, title =	"Variations on the theme of repeated distances"
, journal =	"Combinatorica"
, volume =	10
, year =	1990
, pages =	"261--269"
, keywords =	"combinatorial geometry, unit distance"
}

@article{ep-sepg-71
, author =	"P. Erd{\H o}s and G. Purdy"
, title =	"Some extremal problems in geometry"
, journal =	"J. Combin. Theory"
, volume =	10
, number =	3
, year =	1971
, pages =	"246--252"
, update =	"98.07 bibrelex"
}

@article{er-ag-63
, author =	"P. Erd{\H o}s and A. Renyi"
, title =	"Asymmetric Graphs"
, journal =	"Acta Math. Acad. Sci. Hungar."
, volume =	14
, year =	1963
, pages =	"295--315"
, update =	"97.11 bibrelex"
}

@article{es-sgh-83
, author =	"P. Erd{\H o}s and M. Simonovits"
, title =	"Supersaturated graphs and hypergraphs"
, journal =	"Combinatorica"
, volume =	3
, year =	1983
, pages =	"181--192"
, update =	"98.03 bibrelex"
}

@book{es-pmc-74
, author =	"P. Erd{\H o}s and J. Spencer"
, title =	"Probabilistic Methods in Combinatorics"
, publisher =	"Academic Press"
, year =	1974
}

@article{es-cpg-35
, author =	"P. Erd{\H o}s and G. Szekeres"
, title =	"A combinatorial problem in geometry"
, journal =	"Compositio Math."
, volume =	2
, year =	1935
, pages =	"463--470"
, update =	"93.09 rote"
}

@article{es-sepeg-60
, author =	"P. Erd{\H o}s and G. Szekeres"
, title =	"On Some Extremeum Problem in Geometry"
, journal =	"Ann. Univ. Sci. Budapest"
, volume =	"3-4"
, year =	1960
, pages =	"53--62"
, update =	"97.11 bibrelex"
}

@article{et-psant-41
, author =	"P. Erd{\H o}s and P. Tur{\'a}n"
, title =	"On aproblem of {Sidon} in additive number theory, and on some related problems"
, journal =	"Proc. London Math. Soc."
, volume =	16
, year =	1941
, pages =	"212--215"
, update =	"98.03 bibrelex"
}

@book{eg-orcrg-90
, author =	"W. Eric and L. Grimson"
, title =	"Object Recognition by Computer: The Role of Geometric Constraints"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1990
, update =	"98.07 agarwal"
}

@misc{e-cgp-
, author =	"Jeff Erickson"
, title =	"Computational Geometry Pages"
, url =	"http://www.cs.duke.edu/~jeffe/compgeom/"
, update =	"97.03 tamassia"
}

@inproceedings{e-lblsp-95
, author =	"Jeff Erickson"
, title =	"Lower Bounds for Linear Satisfiability Problems"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"388--395"
, keywords =	"lower bounds, decision trees"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@inproceedings{e-nlbch-96
, author =	"Jeff Erickson"
, title =	"New Lower Bounds for Convex Hull Problems in Odd Dimensions"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, site =	""
, year =	1996
, pages =	"1--9"
, cites =	"am-rsps-93, af-pachv-92, b-lbact-83, c-osrch-95, csy-oscpf-95, ck-acp-70, c-ochaa-93, cm-dosch-92, c-mosga-94, cs-arscg-89, e-lblsp-95, es-blbda-95, go-copcg-95, g-ncp-63, g-eadch-72, g-cp-67, j-dfaed-41, ks-upcha-86, ms-rscp-93, m-loq-93, ph-chfsp-77, r-dchhd-92, s-uekvm-01, s-chaop-81, s-mplbc-85, s-chdch-86, s-sdlpc-91, s-opgfg-91, s-fchff-85, y-lbfch-81, z-lp-94, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{e-nlbch-99
, author =	"J. Erickson"
, title =	"New Lower Bounds for Convex Hull Problems in Odd Dimensions"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1999
, pages =	"1198--1214"
, update =	"99.11 smid"
}

@inproceedings{e-nlbhe-96
, author =	"Jeff Erickson"
, title =	"New Lower Bounds for Halfspace Emptiness"
, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1996
, pages =	"472--481"
, keywords =	"partition graph, partitioning algorithm, range searching, incidences"
, update =	"97.07 agarwal"
}

@inproceedings{e-nlbhp-95
, author =	"Jeff Erickson"
, title =	"New Lower Bounds for {Hopcroft's} Problem"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"127--137"
, keywords =	"partitioning algorithms"
, cites =	"a-pal2a-90, aaas-cvgbr-93, b-lbact-83, bos-cvdo-92, bs-ca-92, c-rcsi-86, c-lbcpr-89, c-chdc-93, c-lbolr-95, csw-qoubs-92, cegsw-ccbac-90, csy-khrp-87, e-acg-87, eghsssw-irals-89, egs-cmcap-90, es-hipac-91, e-rcsgp-95, es-blbda-95, f-lbcso-81, hw-tn-65, l-ccs-90, m-rsehc-93, sy-lbadt-82, s-opgfg-91, st-epdg-83, t-clc-75, t-cgcbs-84, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{e-nlbhp-96
, author =	"Jeff Erickson"
, title =	"New Lower Bounds for {Hopcroft's} Problem"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"389--418"
, keywords =	"range searching, incidence, partitioning algorithm, partition graph"
, update =	"97.07 agarwal"
}

@techreport{e-npsch-01
, author =	"Jeff Erickson"
, title =	"Nice point sets can have nasty {Delaunay} triangulations"
, institution =	"University of Illinois, Urbana-Champaign"
, year =	2001
, update =	"01.07 devillers"
}

@inproceedings{e-npsch-01i
, author =	"Jeff Erickson"
, title =	"Nice point sets can have nasty {Delaunay} triangulations"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"96--105"
, update =	"01.07 devillers"
}

@inproceedings{e-rcsgp-95
, author =	"Jeff Erickson"
, title =	"On the Relative Complexities of Some Geometric Problems"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"85--90"
, update =	"95.09 jones"
}

@article{e-pc-97
, author =	"Jeff Erickson"
, title =	"Pl{\"u}cker coordinates"
, journal =	"Ray Tracing News"
, volume =	10
, number =	3
, month =	dec
, year =	1997
, pages =	"electronic"
, url =	"http://www.acm.org/tog/resources/RTNews/html/rtnv10n3.html"
, update =	"98.07 orourke"
}

@inproceedings{e-stteq-97
, author =	"Jeff Erickson"
, title =	"Space-Time Tradeoffs for Emptiness Queries"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"304--313"
, keywords =	"lower bounds, range searching, partition graph"
, cites =	"a-rs-96, am-rsps-93, ahl-sqrpc-90, b-lbact-83, bos-cvdo-94, bcp-hhihr-93, c-fdlpq-96, c-osrch-96, c-lbcpr-89, c-chdc-93, cegs-ablsp-94, cf-plhur-94, cgl-pgd-85, cr-srrpm-96, c-lbolr-97, dk-dsppu-90, de-mee-96, e-nlbhe-96, e-nlbhp-96, f-lbcso-81, m-ept-92, m-rph-92, m-loq-93, m-vrsa-93, m-rsehc-93, m-grs-94, ms-rscp-93, pa-cg-95, ps-cgi-85, t-cawrn-79, y-cmps-85, ZZZ"
, update =	"98.07 bibrelex, 97.07 agarwal+efrat"
}

@article{e-stteq-00
, author =	"J. Erickson"
, title =	"Space-time tradeoffs for emptiness queries"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"1968--1996"
, update =	"01.04 smid"
}

@techreport{es-blbda-93t
, author =	"Jeff Erickson and Raimund Seidel"
, title =	"Better Lower Bounds on Detecting Affine and Spherical Degeneracies"
, type =	"manuscript"
, year =	1993
, precedes =	"es-blbda-93, es-blbda-95"
, update =	"98.11 bibrelex"
}

@inproceedings{es-blbda-93
, author =	"Jeff Erickson and Raimund Seidel"
, title =	"Better Lower Bounds on Detecting Affine and Spherical Degeneracies"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"528--536"
, succeeds =	"es-blbda-93t"
, update =	"98.11 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 orourke+smid, 93.09 erickson+milone+mitchell"
}

@article{es-blbda-95
, author =	"J. Erickson and R. Seidel"
, title =	"Better lower bounds on detecting affine and spherical degeneracies"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"41--57"
, succeeds =	"es-blbda-93t"
, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 smid"
}

@article{eo-etpnm-90
, author =	"L. Ericson and C. {\'O}'D{\'u}nlaing"
, title =	"Enumeration of tree properties by naive methods"
, journal =	"Algorithms Rev."
, volume =	1
, number =	3
, year =	1990
, pages =	"119--124"
}

@techreport{e-tcgep-87
, author =	"L. W. Ericson"
, title =	"Topologically correct graphical editing in the plane"
, type =	"Technical {Report}"
, number =	97
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, month =	jan
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{ey-dlge-88
, author =	"L. W. Ericson and C. K. Yap"
, title =	"The design of {LINETOOL}, a geometric editor"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"83--92"
, cites =	"-pltc-85, a-ggar-88, a-grla-88, b-tcosl-79, bdmpw-gas-87, b-bdn-87, b-wcgbd-89, b-gbamp-85, bcla-casac-83, bl-as-83, cgh-snebc-88, c-pegtu-84, c-cmpr-71, c-qercf-75, cb-enaaa-80, d-smbgb-87, dmy-aobgn-86, e-tfcgc-88, e-tcgep-87, f-gcest-88, g-seppi-84, g-ac-83, km-gr-89, ks-agtpu-86, l-cae-83, m-vigau-89i, my-ngb-86, mm-chf-83, n-jcbgs-85, n-cte-83, p-lfg-66, ram-tm-84, s-fpavp-80, ss-pmp2g-83, ss-ccsm-85, s-rmes-40, s-dicpl-80, sb-ooptv-85, s-smmgc-63, u-te-48, w-eidag-73, v-ltg-80, y-snegi-79, gy-frcg-86, -m4rm-85, ZZZ"
, update =	"99.11 bibrelex, 99.03 forrest, 98.03 bibrelex"
}

@inproceedings{e-immpe-99
, author =	"Ulf Erikson"
, title =	"Implementing Main-Memory Point-Enclosure Algorithms"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"117--118"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{e-dpp-90
, author =	"E. Erkut"
, title =	"The discrete $p$-dispersion problem"
, journal =	"European J. Oper. Res."
, volume =	46
, number =	1
, year =	1990
, pages =	"48--60"
, keywords =	"facility location, points, minmax, NP-completeness"
, update =	"95.09 korneenko"
}

@article{ebh-dplp-90
, author =	"E. Erkut and T. Baptie and B. {von Hohenbalken}"
, title =	"The discrete $p$-maxian location problem"
, journal =	"Comput. Oper. Res."
, volume =	17
, number =	1
, year =	1990
, pages =	"51--61"
, keywords =	"facility location, points"
, update =	"95.09 korneenko"
}

@article{en-amluf-89
, author =	"E. Erkut and S. Neuman"
, title =	"Analytical models for locating undesirable facilities"
, journal =	"European J. Oper. Res."
, volume =	40
, number =	3
, year =	1989
, pages =	"275--291"
, keywords =	"facility location, points, maxmin"
, update =	"95.09 korneenko"
}

@techreport{ekn-mstap-80
, author =	"J. Ernvall and J. Katajainen and O. Nevalainen"
, title =	"A minimal spanning tree algorithm for a point set in {Euclidean} space"
, type =	"Report"
, number =	24
, institution =	"Dept. Comput. Sci., Univ. Turku"
, address =	"Turku, Finland"
, year =	1980
}

@article{en-elmst-84
, author =	"J. Ernvall and O. Nevalainen"
, title =	"Estimating the length of minimal spanning trees in compression of files"
, journal =	"BIT"
, volume =	24
, year =	1984
, pages =	"19--32"
}

@article{e-espsn-95
, author =	"Martin Erwig"
, title =	"Encoding shortest paths in spatial networks"
, journal =	"Networks"
, volume =	26
, year =	1995
, pages =	"291--303"
, keywords =	"point location, shortest paths, subdivision simplification"
, update =	"96.01 mitchell"
}

@article{ebc-adddc-89
, author =	"G. Eshel and M. M. Barash and V. Chandru"
, title =	"Automatic design of a deep-drawn circumscribing preform"
, journal =	"Internat. J. Robot. Autom."
, volume =	5
, number =	2
, year =	1989
, pages =	"208--222"
, update =	"95.09 korneenko"
}

@techreport{ew-mmcfs-99
, author =	"W. Espelage and E. Wanke"
, title =	"Movement Optimization in Conveyor Flow Shop Processing with one Worker"
, type =	"Manuscript"
, institution =	"University of D{\"u}sseldorf, Department  of Computer Science"
, year =	1999
, update =	"00.03 bibrelex"
}

@inproceedings{es-romov-94
, author =	"C. Esperanca and H. Samet"
, title =	"Representing Orthogonal Multidimensional Objects by Vertex Lists"
, editor =	"C. Arcelli and L. P. Cordella and G. Sanniti di Baja"
, booktitle =	"Aspects of Visual Form Processing"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1994
, pages =	"209--220"
, update =	"96.05 efrat"
}

@inproceedings{e-cespd-91
, author =	"M. Espie"
, title =	"Computing efficiently shortest paths for degenerate metrics"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"149--152"
, cites =	"f-gmt-70, c-pt-90i, b-sdg-87, ps-cgi-85, bm-sg-70, rlw-rsppr-89, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{e-uasdc-90
, author =	"M. Espie"
, title =	"Un algorithme simple de calcul de plus court chemin en norme $L_1$ dans des regions simplement connexes"
, booktitle =	"Journees de Geometrie Algorithmique. Pap. Conf. Sophia-Antipolis. INRIA"
, year =	1990
, pages =	"72--79"
, keywords =	"$L_1$-metrics, shortest paths"
, update =	"95.09 korneenko"
}

@article{e-ggtp-88
, author =	"C. Esposito"
, title =	"Graph Graphics: Theory and Practice"
, journal =	"Comput. Math. Appl."
, volume =	15
, number =	4
, year =	1988
, pages =	"247--253"
, keywords =	"graph drawing"
, update =	"96.09 devillers, 93.09 tamassia"
}

@techreport{eoux-ipvf-94
, author =	"V. Estivill-Castro and J. O'Rourke and J. Urrutia and D. Xu"
, title =	"Illumination of polygons with vertex floodlights"
, type =	"Technical {Report}"
, number =	037
, institution =	"Dept. Comput. Sci., Smith College"
, month =	aug
, year =	1994
, keywords =	"visibility, floodlights"
, precedes =	"eoux-ipvf-95"
, update =	"96.01 orourke, 94.09 orourke"
}

@article{eoux-ipvf-95
, author =	"V. Estivill-Castro and J. O'Rourke and J. Urrutia and D. Xu"
, title =	"Illumination of polygons with vertex floodlights"
, journal =	"Inform. Process. Lett."
, volume =	56
, year =	1995
, pages =	"9--13"
, keywords =	"visibility, floodlights"
, succeeds =	"eoux-ipvf-94"
, update =	"96.01 orourke"
}

@techreport{er-evfof-90
, author =	"V. Estivill-Castro and V. Raman"
, title =	"Edge visibility for finitely oriented figures"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, year =	1990
, note =	"In preparation"
, update =	"98.07 bibrelex"
}

@inproceedings{er-vfop-90
, author =	"V. Estivill-Castro and V. Raman"
, title =	"Visibility in finitely oriented polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"181--185"
, precedes =	"er-vfop-93"
, cites =	"at-oadvp-81, deo-secp-88, er-evfof-90, g-scop-83, g-dcopi-84a, js-clvpa-87, l-vsp-83, lw-apcfp-79, o-agta-87, rw-ocfoc-87, rw-rocs-89, srw-gtv-89, www-dpcgf-85, wwsw-suipp-86, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@techreport{er-vfop-93
, author =	"V. Estivill-Castro and V. Raman"
, title =	"Visibility in finitely oriented polygons"
, type =	"Technical Report"
, number =	"LANIA RT-7-93"
, institution =	"Laboratorio Nacional de Inform{\'a}tica Avanzada"
, year =	1993
, note =	"also in: Proc. 2nd Canad. Conf. Comput. Geom."
, succeeds =	"er-vfop-90"
, update =	"98.11 bibrelex"
}

@inproceedings{eu-ofioa-94
, author =	"V. Estivill-Castro and J. Urrutia"
, title =	"Optimal floodlight illumination of orthogonal art galleries"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"81--86"
, keywords =	"visibility, floodlights"
, cites =	"bglosu-fp-93, c-tsplt-91a, cru-ofipt-93, er-vfop-93, o-agta-87, r-erog-87, s-rrag-92, kkk-tgrfw-83, ZZZ"
, update =	"98.11 bibrelex, 94.09 orourke"
}

@inproceedings{eu-tficp-95
, author =	"V. Estivill-Castro and J. Urrutia"
, title =	"Two-Floodlight Illumination of Convex Polygons"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"62--73"
, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
}

@techreport{er-bsacv-96
, author =	"Michal Etzion and Ari Rappoport"
, title =	"A Boundary Sampling Algorithm for Computing the {Voronoi} Graph of a {2-D} Polygon"
, type =	"Technical Report"
, institution =	"Institute of Computer Science, The Hebrew University"
, year =	1996
, update =	"98.03 mitchell"
, abstract =	"The Voronoi graph of a set of sites contains the
complete symbolic information of the Voronoi diagram of the sites
without the latter's geometry. The Voronoi graph is important for two
reasons. First, there are applications that need only the symbolic
proximity information of a shape, without requiring geometry. Second,
the graph can be used as a starting structure for a robust and
efficient global or local computation of the Voronoi diagram.
\par
In this paper we present an algorithm that computes the Voronoi graph
of a 2-D polygon (with holes) by generating the Voronoi diagram of a
finite set of points on the polygon's boundary.  Unlike algorithms for
computing the Voronoi diagram of a polygon, our algorithm avoids
manipulation of non-linear entities and is simple to implement. The
operations used by the algorithm are line intersections and
comparisons of distances between points and lines."
}

@article{er-csdsp-97
, author =	"Michal Etzion and Ari Rappoport"
, title =	"On Compatible Star Decompositions of Simple Polygons"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	3
, number =	1
, year =	1997
, pages =	"87--95"
, update =	"98.03 mitchell"
, abstract =	"We introduce the notion of compatible star
decompositions of simple polygons. In general, given two polygons with
a correspondence between their vertices, two polygonal decompositions
of the two polygons are said to be compatible if there exists a
one-to-one mapping between them such that the corresponding pieces are
defined by corresponding vertices. For compatible star decompositions
we also require correspondence between star points of the star pieces.
Compatible star decompositions have applications in computer animation
and shape representation and analysis.
\par
We present two algorithms for constructing compatible star
decompositions of two simple polygons. The first algorithm is optimal
in the number of pieces in the decomposition, providing that such a
decomposition exists without adding Steiner vertices. The second
algorithm constructs compatible star decompositions with Steiner
vertices, which are not minimal in the number of pieces but are worst
case optimal in this number and in the number of added Steiner
vertices. We prove that some pairs of polygons require $O(n^2)$ pieces,
and that the decompositions computed by the second algorithm possess
no more than $O(n^2)$ pieces.
\par
In addition to the contributions regarding compatible star
decompositions, the paper also corrects an error in the only
previously published polynomial algorithm for constructing a minimal
star decomposition of a simple polygon, an error which might lead to a
non-minimal decomposition."
}

@article{sr-sbuss-95
, author =	"Michal Shapira (Etzion) and Ari Rappoport"
, title =	"Shape Blending Using the Star-Skeleton Representation"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	15
, number =	2
, month =	mar
, year =	1995
, pages =	"44--50"
, update =	"98.03 mitchell, 96.01 held"
, abstract =	"We present a novel approach to the problem of generating
a polygon sequence that blends two simple polygons given a
correspondence between their boundaries. Previous approaches to this
problem, including direct vertex interpolation and an interpolation
based on edge lengths and angles between edges, tend to produce self
intersections and shape distortions. Our approach introduces the
star-skeleton representation, a structure comprised of equivalent
decompositions of the two polygons into star-shaped pieces and a
skeleton connecting the star pieces. We utilized the concept of a star
polygon since two star polygons can be fairly blended without any self
intersections.
\par
We present algorithms for creating equivalent star-skeletons for the
two polygons and for blending two star-skeletons by interpolating
their skeletons and unfolding intermediate polygons from the
skeletons. We also demonstrate the usage of the star-skeleton for
blending multiple polygons and images. We show examples from a working
system that demonstrate the improved blend sequences generated by the
method.
\par
The intrinsic reasons for the good results obtained are the fact that
the interiors of the polygons are considered, not only the boundaries,
and that the star-skeleton explicitly models an interdependence
between all the vertices of the polygons."
}

@inproceedings{egt-cal-92
, author =	"D. Eu and E. Gu{\'e}vremont and G. Toussaint"
, title =	"On classes of arrangements of lines"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"109--114"
, cites =	"cl-fdsl-85, csss-otass-89, eat-atdhl-83, et-gpprl-89, hv-splsp-49, k-sades-91a, s-cesl-85, t-slaic-85, v-cbrdf-87, z-fuafc-75, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{egt-eal-93
, author =	"D. Eu and E. Gu{\'e}vremont and G. T. Toussaint"
, title =	"On envelopes of arrangements of lines"
, type =	"Technical Report"
, number =	"SOCS 93.10"
, institution =	"McGill University, School of Computer Science"
, month =	nov
, year =	1993
, precedes =	"egt-eal-96"
, update =	"98.11 bibrelex"
}

@article{egt-eal-96
, author =	"D. Eu and E. Gu{\'e}vremont and G. T. Toussaint"
, title =	"On envelopes of arrangements of lines"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"111--148"
, succeeds =	"egt-eal-93"
, update =	"98.11 bibrelex, 96.09 smid"
}

@article{et-apctt-94
, author =	"D. Eu and G. T. Toussaint"
, title =	"On approximating polygonal curves in two and three dimensions"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	56
, number =	3
, month =	may
, year =	1994
, pages =	"231--246"
, update =	"96.09 kreveld+orourke"
}

@book{e-e-56
, author =	"Euclid"
, title =	"Elements"
, publisher =	"Dover"
, year =	1956
, note =	"Translated by Sir Thomas L.~Heath"
}

@article{els-htmai-97
, author =	"G. Evangelidis and D. B. Lomet and B. Salzberg"
, title =	"The ${{\rm h{B}}^\Pi}$-tree: {A} multi-attribute index supporting concurrency, recovery and node consolidation"
, journal =	"VLDB Journal"
, volume =	6
, year =	1997
, pages =	"1--25"
, update =	"97.07 agarwal"
}

@inproceedings{ets-adtdr-94
, author =	"B. L. Evans and J. Teich and C. Schwarz"
, title =	"Automated design of two-dimensional rational decimation systems"
, booktitle =	"IEEE Asilomar Conference on Signals, Systems, and Computers"
, site =	"Pacific Grove, CA"
, year =	1994
, pages =	"498--502"
, url =	"http://ptolemy.eecs.berkeley.edu"
, update =	"98.03 bibrelex"
}

@article{ej-dvaip-87
, author =	"D. G. Evans and S. M. Jones"
, title =	"Detecting {Voronoi} (Area-of-Influence) Polygons"
, journal =	"Mathematical Geology"
, volume =	19
, number =	6
, year =	1987
, pages =	"523--537"
, annote =	"Least squares to find the points that would have a
		 given set of polygons as their VPs. Gives a simple
		 measure to find the closeness of fit."
}

@article{em-tpach-85
, author =	"D. J. Evans and S. Mai"
, title =	"Two parallel algorithms for the convex hull problem in a two dimensional space"
, journal =	"Parallel Comput."
, volume =	2
, year =	1985
, pages =	"313--326"
}

@article{es-pcvd-89
, author =	"D. J. Evans and I. Stojmenovic"
, title =	"On parallel computation of {Voronoi} diagrams"
, journal =	"Parallel Comput."
, volume =	12
, number =	1
, year =	1989
, pages =	"121--125"
, keywords =	"Voronoi diagram, parallel computations"
, update =	"95.09 korneenko"
}

@article{ey-appqm-85
, author =	"D. J. Evans and N. Y. Yousif"
, title =	"Analysis of the performance of the parallel quicksort method"
, journal =	"BIT"
, volume =	25
, year =	1985
, pages =	"106--112"
, update =	"96.09 orourke"
}

@inproceedings{esv-otsfr-96
, author =	"F. Evans and Steven S. Skiena and A. Varshney"
, title =	"Optimizing Triangle Strips for Fast Rendering"
, booktitle =	"IEEE Visualization '96 Proceedings"
, month =	oct
, year =	1996
, pages =	"319--326"
, issn =	"0-89791-864-9"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@article{emm-sc2ma-98
, author =	"G. Evans and A. Middleditch and N. Miles"
, title =	"Stable Computation of the 2D Medial Axis Transform"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"577--598"
, update =	"98.11 devillers"
}

@article{e-sci-77
, author =	"I. S. Evans"
, title =	"The Selection of Class Intervals"
, journal =	"Trans. Inst. Br. Geogrs."
, volume =	2
, year =	1977
, pages =	"98--124"
, update =	"96.09 kreveld"
}

@article{ekr-sgoct-87
, author =	"R. C. Evans and G. Koppelman and V. T. Rajan"
, title =	"Shaping geometric objects by cumulative translational sweeps"
, journal =	"IBM J. Res. Develop."
, volume =	31
, year =	1987
, pages =	"343--360"
}

@inproceedings{e-rpamt-95
, author =	"William Evans"
, title =	"Regular Polygons are Most Tolerant"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"109--113"
, update =	"95.09 jones"
}

@book{e-ac-73
, author =	"S. Even"
, title =	"Algorithmic Combinatorics"
, publisher =	"Macmillan"
, address =	"New York, NY"
, year =	1973
}

@book{e-ga-79
, author =	"S. Even"
, title =	"Graph Algorithms"
, publisher =	"Computer Science Press"
, address =	"Potomac, Maryland"
, year =	1979
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{ee-eingl-97
, author =	"S. Even and G. Even"
, title =	"Embedding Interconnection Networks in Grids via the Layered Cross Product"
, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1203
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	""
, keywords =	"Invited talk"
, update =	"00.03 devillers, 98.03 mitchell"
}

@inproceedings{eg-glbdb-95
, author =	"S. Even and G. Granot"
, title =	"Grid Layouts of Block Diagrams --- Bounding the Number of Bends in Each Connection"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"64--75"
, keywords =	"graph drawing, orthogonal, planar"
, update =	"95.01 tamassia"
}

@techreport{eg-rpdfb-94
, author =	"S. Even and G. Granot"
, title =	"Rectilinear Planar Drawings with Few Bends in Each Edge"
, type =	"Technical Report"
, number =	797
, institution =	"Computer Science Dept., Technion"
, year =	1994
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@article{eis-ctmfp-76
, author =	"S. Even and A. Itai and A. Shamir"
, title =	"On the complexity of timetable and multicommodity flow problems"
, journal =	"SIAM J. Comput."
, volume =	5
, year =	1976
, pages =	"691--703"
, update =	"97.11 bibrelex"
}

@article{es-oledp-81
, author =	"S. Even and Y. Shiloach"
, title =	"An On-Line Edge Deletion Problem"
, journal =	"J. ACM"
, volume =	28
, year =	1981
, pages =	"1--4"
, update =	"94.01 tamassia"
}

@article{et-csn-76
, author =	"S. Even and R. E. Tarjan"
, title =	"Computing an st-Numbering"
, journal =	"Theoret. Comput. Sci."
, volume =	2
, year =	1976
, pages =	"339--344"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{et-nftgc-75
, author =	"S. Even and R. E. Tarjan"
, title =	"Network Flow and Testing Graph Connectivity"
, journal =	"SIAM J. Comput."
, volume =	4
, year =	1975
, pages =	"507--518"
, update =	"95.05 tamassia"
}

@techreport{e-hpnrg-86
, author =	"H. Everett"
, title =	"Hamiltonian paths in non-rectangular grid graphs"
, type =	"Report"
, number =	"86-1"
, institution =	"Dept. Comput. Sci., Univ. Toronto"
, address =	"Toronto, ON"
, year =	1986
, update =	"95.09 mitchell"
}

@inproceedings{e-vgsp-89
, author =	"H. Everett"
, title =	"The visibility graphs of spiral polygons"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	47
, precedes =	"ec-rvgsp-90"
}

@techreport{e-vgr-90
, author =	"H. Everett"
, title =	"Visibility Graph Recognition"
, type =	"Report"
, number =	"231/90"
, institution =	"Dept. Comput. Sci., Univ. Toronto"
, address =	"Toronto, ON"
, year =	1990
, note =	"Ph.D. Thesis"
, update =	"96.09 orourke"
}

@article{ec-nrcvg-95
, author =	"H. Everett and D. G. Corneil"
, title =	"Negative results on characterizing visibility graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"51--63"
, update =	"96.09 devillers"
}

@article{ec-rvgsp-90
, author =	"H. Everett and D. G. Corneil"
, title =	"Recognizing visibility graphs of spiral polygons"
, journal =	"J. Algorithms"
, volume =	11
, year =	1990
, pages =	"1--26"
, succeeds =	"e-vgsp-89"
}

@inproceedings{ehkn-psvg-97
, author =	"Hazel Everett and Chinh Hoang and Kyri Kilakos and Marc Noy"
, title =	"Planar Segment Visibility Graphs"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"65--69"
, update =	"97.11 jones"
}

@article{ehkn-psvg-00
, author =	"H. Everett and C. T. Hoang and K. Kilakos and M. Noy"
, title =	"Planar segment visibility graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	16
, year =	2000
, pages =	"235--243"
, update =	"01.04 smid"
}

@inproceedings{ehn-sisp-96
, author =	"H. Everett and F. Hurtado and M. Noy"
, title =	"Stabbing information of a simple polygon"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"74--79"
, update =	"96.09 mitchell"
}

@inproceedings{elrss-cssp-98
, author =	"H. Everett and S. Lazard and S. Robbins and H. Schr{{\"o}}der and S. Whitesides"
, title =	"Convexifying Star-Shaped Polygons"
, booktitle =	"Proc. 10th Canad. Conf. Comput. Geom."
, year =	1998
, pages =	"2--3"
, update =	"98.11 orourke"
}

@inproceedings{elosu-scqp-92
, author =	"H. Everett and W. Lenhart and M. H. Overmars and T. Shermer and J. Urrutia"
, title =	"Strictly convex quadrilateralizations of polygons"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"77--83"
, cites =	"bg-tph-90, beg-pgmg-90, c-tsplt-90i, kkk-tgrfw-83, l-dprcq-85, o-agta-87, st-ltadr-81, ZZZ"
, update =	"98.07 agarwal+bibrelex"
}

@techreport{elo-rchev-93t
, author =	"H. Everett and A. Lubiw and J. O'Rourke"
, title =	"Recovery of convex hulls from external visibility graphs"
, type =	"Technical Report"
, number =	024
, institution =	"Smith College"
, month =	jan
, year =	1993
, precedes =	"elo-rchev-93"
, update =	"98.11 bibrelex"
}

@inproceedings{elo-rchev-93
, author =	"H. Everett and A. Lubiw and J. O'Rourke"
, title =	"Recovery of convex hulls from external visibility graphs"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"309--314"
, succeeds =	"elo-rchev-93t"
, cites =	"elo-rchev-93t, o-agta-87, o-rcvg-90, o-cgc18-93, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{elrs-ist-91
, author =	"H. Everett and K. Lyons and B. Reed and D. Souvaine"
, title =	"Illuminating squares on a transversal"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"118--121"
, cites =	"cru-irtp-89, e-ftssg-85, eos-smcga-84t, f-icd-77, h-ragp-90, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{er-egtpt-94
, author =	"H. Everett and E. Rivera-Campo"
, title =	"Edge Guarding a Triangulated Polyhedral Terrain"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"293--295"
, precedes =	"er-egpt-97"
, cites =	"ah-epmfc-77, bstz-gpt-92, o-agta-87, ZZZ"
, update =	"98.11 bibrelex, 97.03 devillers, 94.09 jones"
}

@article{er-egpt-97
, author =	"H. Everett and E. Rivera-Campo"
, title =	"Edge Guarding Polyhedral Terrain"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"201--203"
, succeeds =	"er-egtpt-94"
, update =	"97.11 bibrelex, 97.03 devillers"
}

@inproceedings{erk-oalla-93
, author =	"H. Everett and J.-M. Robert and M. van Kreveld"
, title =	"An optimal algorithm for the $({\leq} k)$-levels, with applications to separation and transversal problems"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"38--46"
, cites =	"ass-sulbl-89, ag-nssfs-86, c-clps-85, ce-oails-92, c-narsc-87, csy-khrp-87, e-acg-87, eg-tsa-89, emprww-sls-82, ew-cbtda-86, elss-dgpps-73, h-awwss-89b, m-ltalp-83, m-fppa1-88, m-fppa2-89, m-lavd-91, o-olafs-81, ol-mcp-81, pss-ubnpk-89, s-ksacs-91, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{erk-oalla-96
, author =	"H. Everett and J.-M. Robert and M. van Kreveld"
, title =	"An optimal algorithm for the $({\leq} k)$-levels, with applications to separation and transversal problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"247--261"
, succeeds =	"erk-oalla-93"
, update =	"97.03 agarwal+devillers"
}

@techreport{ew-falc3-91t
, author =	"H. Everett and S. Whitesides"
, title =	"Finding all the largest circles in a $3$-dimensional box"
, type =	"Technical Report"
, number =	"TR-SOCS-91.4"
, institution =	"School of Computer Science, McGill University"
, address =	"Montreal"
, month =	jun
, year =	1991
, precedes =	"ew-falc3-91"
, update =	"98.11 bibrelex"
}

@inproceedings{ew-falc3-91
, author =	"H. Everett and S. Whitesides"
, title =	"Finding all the largest circles in a $3$-dimensional box"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"84--87"
, succeeds =	"ew-falc3-91t"
, cites =	"agss-ltacv-87, k-nptal-84a, m-lpltw-84, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@article{elr-ogdi-91
, author =	"K. Ewacha and W. Li and I. Rival"
, title =	"Order, genus and diagram invariance"
, journal =	"Order"
, volume =	8
, year =	1991
, pages =	"107--113"
, update =	"98.07 bibrelex"
}

@article{e-hcsc-73
, author =	"G. Ewald"
, title =	"{Hamiltonian} circuits in simplicial complexes"
, journal =	"Geom. Dedicata"
, volume =	2
, number =	1
, month =	sep
, year =	1973
, pages =	"115--125"
, update =	"98.11 bibrelex"
}

@article{e-ctfv-88
, author =	"G. Ewald"
, title =	"On the classification of toric {Fano} varieties"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"49--54"
}

@article{e-scntv-86
, author =	"G. Ewald"
, title =	"Spherical complexes and nonprojective toric varieties"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"115--122"
}

@article{elr-dlsrd-70
, author =	"G. Ewald and D. G. Larman and C. A. Rogers"
, title =	"The directions of the line segments and of the $r$-dimensional balls on the boundary of a convex body in {Euclidean} space"
, journal =	"Mathematika"
, volume =	17
, year =	1970
, pages =	"1--20"
, update =	"98.03 smid, 97.11 bibrelex"
}

@book{e-cva-85
, author =	"G. M. Ewing"
, title =	"Calculus of variations with applications"
, publisher =	"MIT Press"
, year =	1985
, update =	"97.11 bibrelex"
}

@techreport{fo-ttpne-86
, author =	"G. Fabella and J. O'Rourke"
, title =	"Twenty-two points with no empty hexagon"
, type =	"Report"
, number =	"JHU 86-03"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	jan
, year =	1986
, keywords =	"arrangements"
}

@phdthesis{f-gapmr
, author =	"A. Fabri"
, title =	"G{\'e}om{\'e}trie algorithmique en parall{\`e}le sur des machines r{\'e}elles"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"{\'E}cole Nationale Sup\'erieure des Mines de Paris"
, address =	"France"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"98.07 devillers"
}

@article{fgkss-dccga-00
, author =	"A. Fabri and G.-J. Giezeman and L. Kettner and S. Schirra and S. Sch{\"o}nherr"
, title =	"On the Design of {CGAL} a Computational Geometry Algorithms Library"
, journal =	"Softw. -- Pract. Exp."
, volume =	30
, number =	11
, year =	2000
, pages =	"1167--1202"
, succeeds =	"fgkss-ckbgc-96, fgkss-dccga-98"
, update =	"01.04 vismara"
, annote =	"Special Issue on Discrete Algorithm Engineering"
}

@techreport{fgkss-dccga-98
, author =	"A. Fabri and G.-J. Giezeman and L. Kettner and S. Schirra and S. Sch{\"o}nherr"
, title =	"On the Design of {CGAL}, the {C}omputational {G}eometry {A}lgorithms {L}ibrary"
, type =	"Research Report"
, number =	"MPI-I-98-1-007"
, institution =	"Max--Planck--Institut f{\"u}r Informatik"
, month =	feb
, year =	1998
, url =	"http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1998-1-007"
, update =	"99.07 vismara"
}

@inproceedings{fgkss-ckbgc-96
, author =	"Andreas Fabri and Geert-Jan Giezeman and Lutz Kettner and Stefan Schirra and Sven Sch{\"o}nherr"
, title =	"The {CGAL} Kernel: {A} Basis for Geometric Computation"
, editor =	"M. C. Lin and D. Manocha"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"191--202"
, url =	"http://www.cs.uu.nl/CGAL/Papers/wacg.ps.gz"
, update =	"98.11 bibrelex, 97.03 tamassia"
}

@article{f-eeccp-82
, author =	"Fr. Fabricius-Bjerre"
, title =	"On enclosing and enclosed conics for convex polygons and curves"
, journal =	"Geom. Dedicata"
, volume =	12
, year =	1982
, pages =	"131--136"
}

@inproceedings{ff-acdpf-97
, author =	"A. E. Fabris and A. R. Forrest"
, title =	"Antialiasing of Curves by Discrete Pre-filtering"
, booktitle =	"Proc. SIGGRAPH '97"
, organization =	"ACM SIGGRAPH"
, publisher =	"ACM Press/Addison-Wesley"
, address =	"Los Angeles, California"
, month =	aug
, year =	1997
, pages =	"317--326"
, note =	"ISBN 0-89791-896-7"
, keywords =	"anti-aliasing, curves, Bezier curves, sampling, filtering, reconstruction"
, update =	"99.03 forrest"
}

@inproceedings{ff-hqrtd-97
, author =	"A. E. Fabris and A. R. Forrest"
, title =	"High Quality Rendering of Two-dimensional Continuous Curves"
, editor =	"L. H. de Figueiredo and M. Lobo Nt."
, booktitle =	"Proceedings of SIBGRAPI '97"
, site =	"Campos do Jord{\~a}o"
, organization =	"SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
, publisher =	"IEEE Computer Society"
, address =	"Campos do Jord{\~a}o"
, month =	oct
, year =	1997
, pages =	"10--17"
, note =	"ISBN 0-8186-8102-0"
, isbn =	"0-8186-8102-0"
, keywords =	"rendering, anti-aliasing, curves"
, update =	"99.03 forrest"
}

@inproceedings{fsf-efans-97
, author =	"A. E. Fabris and L. Silva and A. R. Forrest"
, title =	"An Efficient Filling Algorithm for Non-simple Closed Curves using the Point Containment Paradigm"
, editor =	"L. H. de Figueiredo and M. Lobo Nt."
, booktitle =	"Proceedings of SIBGRAPI '97"
, site =	"Campos do Jord{\~a}o"
, organization =	"SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
, publisher =	"IEEE Computer Society"
, address =	"Campos do Jord{\~a}o"
, month =	oct
, year =	1997
, pages =	"2--9"
, note =	"ISBN 0-8186-8102-0"
, isbn =	"0-8186-8102-0"
, keywords =	"area filling, point containment, rendering"
, update =	"99.03 forrest"
}

@inproceedings{fsf-sdpbc-98
, author =	"A. E. Fabris and L. Silva and A. R. Forrest"
, title =	"Stroking Discrete Polynomial B{\'e}zier Curves via Point Containment Paradigm"
, editor =	"L. da F. Cost and G. C{\^a}mara"
, booktitle =	"Proceedings of SIBGRAPI '98"
, site =	"IMPA, Rio de Janeiro"
, organization =	"SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
, publisher =	"IEEE Computer Society"
, address =	"Rio de Janeiro"
, month =	oct
, year =	1998
, pages =	"94--101"
, note =	"International Symposium of Computer Graphics and Image Processing"
, isbn =	"0-8186-9215-4"
, keywords =	"area filling, point containment, rendering"
, update =	"00.11 smid, 00.07 icking, 99.03 forrest"
}

@article{f-iradr-95
, author =	"M. A. Facello"
, title =	"Implementation of a Randomized Algorithm for {Delaunay} and Regular Triangulations in Three Dimensions"
, journal =	"Comput. Aided Geom. Design"
, volume =	12
, number =	4
, month =	jun
, year =	1995
, pages =	"349--370"
, update =	"97.07 held"
}

@techreport{f-irtmc-90
, author =	"M. A. Facello"
, title =	"Improved Ray Tracing Methods for {CSG} Modeling Systems"
, type =	"Report"
, number =	"JHU-90/05"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1990
, update =	"93.09 goodrich"
}

@inproceedings{fpf-stgrl-88
, author =	"K. M. Fairchild and S. E. Poltrock and G. W. Furnas"
, title =	"SemNet: Three-Dimensional Graphic Representation of Large Knowledge Bases"
, editor =	"R. Guindon"
, booktitle =	"Cognitive Science and its Applications for Human-Computer Interaction"
, publisher =	"Lawrence Erlbaum Associates"
, year =	1988
, pages =	"201--233"
, keywords =	"graph drawing, 3D"
, update =	"96.09 tamassia, 96.04 garg"
}

@inproceedings{f-caisu-85
, author =	"John Fairfield"
, title =	"Cellular Approach For Image Segmentation Using {Voronoi} Diagrams"
, booktitle =	"1985 IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management."
, publisher =	"IEEE"
, address =	"New York, NY"
, year =	1985
, pages =	"237--241"
, keywords =	"image segmentation, cellular automata, Voronoi diagrams, Delaunay triangulation"
, annote =	"Cellular automata to compute VD"
, abstract =	"Cellular representations of Voronoi diagrams are
		 calculated simply by cellular automata. A cellular
		 automation is presented that segments the image on the
		 basis of a cellular representation of the Voronoi
		 diagram. The output of the automation is a fuzzy subset
		 of the Delaunay triangulation, which, when graphed with
		 the strength of the line proportional to the strength
		 of membership, segments the image. To within cell
		 granularity, the segmentation is independent of
		 rotation, translation, and magnification of the image.
		 5 refs."
}

@inproceedings{f-csgft-79
, author =	"J. Fairfield"
, title =	"Contoured shape generation: forms that people see in dot patterns"
, booktitle =	"Proc. IEEE Conf. Systems Man Cybernet."
, year =	1979
, pages =	"60--64"
}

@article{f-sdpvd-83
, author =	"J. Fairfield"
, title =	"Segmenting dot patterns by {Voronoi} diagram concavity"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-32"
, year =	1983
, pages =	"104--110"
}

@article{fp-nsacs-90
, author =	"B. Falcidieno and C. Pienovi"
, title =	"Natural Surface Approximation by Constrained Stochastic Interpolation"
, journal =	"Comput. Aided Design"
, volume =	22
, number =	3
, year =	1990
, pages =	"167--172"
, annote =	"First we build a CDT of constraint edges and important
		 points. Then any points where error is too high are
		 inserted in the triangulation by dividing the relevant
		 triangle into three pieces. Then any triangles that are
		 too big are broken into four with the midpoint randomly
		 perturbed (like with fractals)."
}

@article{f-hxpsm-83
, author =	"K. J. Falconer"
, title =	"Hammer's x-ray problem and the stable manifold theorem"
, journal =	"J. London Math. Soc."
, volume =	2
, number =	28
, year =	1983
, pages =	"149--160"
, update =	"98.11 bibrelex"
}

@article{f-xpps-83
, author =	"K. J. Falconer"
, title =	"X-ray problems for point sources"
, journal =	"Proc. London Math. Soc."
, volume =	3
, number =	46
, year =	1983
, pages =	"241--262"
, update =	"98.11 bibrelex"
}

@incollection{fr-hta-87
, author =	"M. Falk and R. Randell"
, title =	"On the homotopy theory in arrangements"
, booktitle =	"Complex Analytic Singularities"
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	1987
, pages =	"101--124"
, update =	"98.07 agarwal"
}

@article{f-gcpmr-88
, author =	"C. Faloutsos"
, title =	"Gray codes for partial match and range queries"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	44
, year =	1988
, pages =	"1381--1393"
, update =	"97.07 agarwal"
}

@inproceedings{fg-andqu-96
, author =	"C. Faloutsos and V. Gaede"
, title =	"Analysis of $n$-dimensional quadtrees using the {Hausdorff} fractal dimension"
, booktitle =	"Proc. 22nd VLDB Conference"
, year =	1996
, pages =	"40--50"
, update =	"99.07 bibrelex, 97.07 agarwal"
}

@inproceedings{fl-ffaid-95
, author =	"C. Faloutsos and K.-I. Lin"
, title =	"{FastMap}: {A} fast algorithm for indexing, data-mining and visualization of traditional and multimedia databases"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1995
, pages =	"163--173"
, update =	"99.07 bibrelex, 97.07 agarwal"
}

@inproceedings{frm-fsmts-94
, author =	"C. Faloutsos and M. Ranganathan and Y. Manolopoulos"
, title =	"Fast subsequence matching in time-series databases"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1994
, pages =	"86--93"
, update =	"97.07 agarwal"
}

@inproceedings{fr-dsamu-91
, author =	"C. Faloutsos and Y. Rong"
, title =	"{DOT}: {A} spatial access method using fractals"
, booktitle =	"Proc. 7th IEEE Internat. Conf. Data Eng."
, year =	1991
, pages =	"152--158"
, update =	"97.07 agarwal"
}

@inproceedings{fr-fskr-89
, author =	"C. Faloutsos and S. Roseman"
, title =	"Fractals for secondary key retrieval"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1989
, pages =	"247--252"
, update =	"97.07 agarwal"
}

@inproceedings{fsr-aoosa-87
, author =	"C. Faloutsos and T. Sellis and N. Roussopoulos"
, title =	"Analysis of Object Oriented Spatial Access Methods"
, booktitle =	"Proc. SIGMOD Conf. on Management of Data"
, year =	1987
, pages =	"426--439"
, update =	"97.07 agarwal, 96.09 kreveld"
}

@techreport{f-qpvmc-87
, author =	"B. Faltings"
, title =	"Qualitative place vocabularies for mechanisms in configuration space"
, type =	"Report"
, number =	1360
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1987
, keywords =	"artificial intelligence"
}

@inproceedings{fh-cfaia-82
, author =	"J. Q. Fang and T. S. Huang"
, title =	"A corner finding algorithm for image analysis and registration"
, booktitle =	"Proc. AAAI Conf."
, year =	1982
, pages =	"46--49"
, update =	"98.11 bibrelex"
}

@inproceedings{fb-rgmtb-91
, author =	"Shiaofen Fang and Beat Br{\"u}derlin"
, title =	"Robustness in geometric modeling --- tolerance-based methods"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"85--101"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@article{fp-acdt-94
, author =	"T.-P. Fang and L. A. Piegl"
, title =	"Algorithm for Constrained {Delaunay} Triangulation"
, journal =	"Visual Comput."
, volume =	10
, number =	5
, year =	1994
, pages =	"255--265"
, update =	"96.01 held"
}

@article{fp-adtch-92
, author =	"T.-P. Fang and L. A. Piegl"
, title =	"Algorithm for {Delaunay} Triangulation and Convex-hull Computation Using Sparse Matrix"
, journal =	"Comput. Aided Design"
, volume =	24
, number =	8
, month =	aug
, year =	1992
, pages =	"425--436"
, annote =	"Circumcircle algorithm. Sorts by $x$-coord to speed
		 search. Timings given seem to fit this pattern."
}

@article{fp-dttd-95
, author =	"T. P. Fang and L. A. Piegl"
, title =	"Delaunay Triangulation in Three Dimensions"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	15
, number =	5
, month =	sep
, year =	1995
, pages =	"62--69"
, update =	"96.01 held"
}

@article{fp-dtuug-93
, author =	"T.-P. Fang and L. A. Piegl"
, title =	"{Delaunay} Triangulation Using a Uniform Grid"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	13
, number =	3
, month =	may
, year =	1993
, pages =	"36--48"
, update =	"93.09 held"
, annote =	"Circumcircle algorithm with buckets.  DFS starting at
middle point, deleting points as they are surrounded.  Claims that 16/9
points per bucket (on average) is fastest."
}

@article{fst-gcfcs-95
, author =	"A. O. Farahat and P. F. Stiller and J. C. Trinkle"
, title =	"On the Geometry of Contact Formation Cells for Systems of Polygons"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	11
, number =	4
, month =	aug
, year =	1995
, pages =	"522--536"
, update =	"96.01 held"
}

@article{f-cvccp-82
, author =	"G. Farin"
, title =	"A construction for visual {$C^{1}$} continuity of polynomial surface patches"
, journal =	"Comput. Graph. Image Process."
, volume =	20
, year =	1982
, pages =	"272--282"
}

@book{f-cscag-93
, author =	"G. Farin"
, title =	"Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide"
, publisher =	"Academic Press"
, year =	1993
, update =	"97.11 bibrelex"
}

@book{f-ncspg-95
, author =	"G. Farin"
, title =	"NURB Curves and Surfaces, from Projective Geometry to Practical Use"
, publisher =	"A.K. Peters"
, year =	1995
, update =	"98.07 bibrelex"
}

@inproceedings{f-sbvd-97
, author =	"Gerald Farin"
, title =	"Surfaces Based on {Voronoi} Diagrams"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	33
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{f-sodt-90
, author =	"G. Farin"
, title =	"Surfaces over {Dirichlet} tesselations"
, journal =	"Comput. Aided Geom. Design"
, volume =	7
, year =	1990
, pages =	"281--292"
, update =	"00.03 bibrelex+devillers"
}

@article{f-eopss-85
, author =	"R. Farouki"
, title =	"Exact offset procedures for simple solids"
, journal =	"Comput. Aided Geom. Design"
, volume =	2
, year =	1985
, pages =	"257--279"
, update =	"98.07 bibrelex"
}

@incollection{fj-cpccc-94
, author =	"R. Farouki and J. Johnstone"
, title =	"Computing point/curve and curve/curve bisectors"
, editor =	"R. B. Fisher"
, booktitle =	"Design and Application of Curves and Surfaces: Mathematics of Surfaces V"
, series =	"327--354"
, publisher =	"Oxford University Press"
, year =	1994
, update =	"98.07 bibrelex"
}

@techreport{fj-bpppc-91
, author =	"R. Farouki and J. K. Johnstone"
, title =	"The bisector of a point and a plane parametric curve"
, type =	"Technical {Report}"
, number =	"JHU-91-21"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	nov
, year =	1991
}

@techreport{f-tsaei-86
, author =	"R. T. Farouki"
, title =	"Trimmed surface algorithms for the evaluation and interrogation of solid boundary representations"
, type =	"Report"
, number =	"RC 12052"
, institution =	"Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1986
}

@article{fj-bpppc-94
, author =	"R. T. Farouki and J. K. Johnstone"
, title =	"The Bisector of a Point and a Plane Parametric Curve"
, journal =	"Comput. Aided Geom. Design"
, volume =	11
, year =	1994
, pages =	"117--151"
, update =	"95.05 held"
}

% ### also claimed pages 101--127
@article{fn-appoc-90
, author =	"R. T. Farouki and C. A. Neff"
, title =	"Analytic Properties of Plane Offset Curves"
, journal =	"Comput. Aided Geom. Design"
, volume =	7
, number =	"1--4"
, month =	jun
, year =	1990
, pages =	"83--99"
, update =	"95.05 held"
}

@techreport{fr-apbf-87
, author =	"R. T. Farouki and V. T. Rajan"
, title =	"Algorithms for polynomials in {Bernstein} form"
, type =	"Report"
, number =	"??"
, institution =	"Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1987
}

@article{fr-spccc-98
, author =	"R. T. Farouki and R. Ramamurthy"
, title =	"Specified-Precision Computation of Curve/Curve Bisectors"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"599--619"
, update =	"98.11 devillers"
}

@article{fm-rpdsa-85
, author =	"N. Farvardin and J. W. Modestino"
, title =	"Rate-distortion performance of {DPCM} schemes for autoregresssive sources"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	31
, year =	1985
, pages =	"402--418"
, update =	"98.03 bibrelex"
}

% journal???
@article{f-slrpg-48
, author =	"I. Fary"
, title =	"On Straight Lines Representation of Planar Graphs"
, journal =	"Acta Sci. Math. Szeged"
, volume =	11
, year =	1948
, pages =	"229--233"
, keywords =	"graph drawing"
, update =	"97.11 bibrelex, 93.09 tamassia"
}

@book{f-tdcvg-93
, author =	"Olivier Faugeras"
, title =	"Three-Dimensional Computer Vision: A Geometric Viewpoint"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1993
}

@article{fhmb-pa3do-84
, author =	"O. Faugeras and M. Hebert and P. Mussi and J.-D. Boissonnat"
, title =	"Polyhedral approximation of 3-{D} objects without holes"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	25
, year =	1984
, pages =	"169--183"
}

@article{flb-rsddt-90
, author =	"O. D. Faugeras and E. {Le Bras-Mehlman} and J. D. Boissonnat"
, title =	"Representing Stereo Data With The {Delaunay} Triangulation"
, journal =	"Artif. Intell."
, volume =	44
, number =	"1--2"
, month =	jul
, year =	1990
, pages =	"41--87"
, keywords =	"stereo data, Delaunay triangulation, stereo vision, probabilistic geometry"
, annote =	"CDT algorithm via inserting extra points on compulsory
		 line segments. Uses bucketing for speed."
, abstract =	"This article proposes a coherent way of interpolating
		 three-dimensional data obtained by stero, for example,
		 with a simplical polyhedral surface. The proposed
		 method is based on the use of the constrained Delaunay
		 triangulation; the polyhedral surface is obtained by
		 using a simple visibility property to mark tetrahedra
		 likely to be empty. The method is intrinsically
		 discontinuity-preserving, works for multiple viewpoints
		 and yields both a surface representation of objects and
		 a volume representation of free space which may be
		 useful in robotics. Algorithms to implement the method
		 are described and their complexity analyzed in the
		 worst-case and average-case situations where tools of
		 probabilistic geometry are used. (Author abstract) 37
		 Refs."
}

@article{fp-ochr3-84
, author =	"O. D. Faugeras and J. Ponce"
, title =	"An object-centered hierarchical representation for $3$-d objects: {The} prism-tree"
, journal =	"Special Issue of Topics on Computational Geometry"
, volume =	38
, number =	1
, month =	apr
, year =	1984
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@book{fp-cgdm-79
, author =	"I. D. Faux and M. J. Pratt"
, title =	"Computational Geometry for Design and Manufacture"
, publisher =	"Ellis Horwood"
, address =	"Chichester, UK"
, year =	1979
, update =	"97.03 schwarzkopf"
}

@article{fv-sappm-85
, author =	"J.-P. Faye and J. Vignes"
, title =	"Stochastic Approach of the Permutation-Perturbation Method for Round-off Error Analysis"
, journal =	"Applied Numerical Mathematics"
, volume =	1
, year =	1985
, pages =	"349--362"
, update =	"98.03 bibrelex"
}

@article{f-crdua-83
, author =	"R. Featherstone"
, title =	"The calculation of robot dynamics using articulated-body inertias"
, journal =	"Internat. J. Robot. Res."
, volume =	2
, number =	1
, year =	1983
, pages =	"13--30"
, update =	"97.11 bibrelex"
}

@techreport{fg-oaac-88t
, author =	"T. Feder and D. H. Greene"
, title =	"Optimal Algorithms for Approximate Clustering"
, institution =	"Dept. of Computer Science, Stanford University"
, year =	1988
, keywords =	"clustering"
, update =	"95.01 smid, 93.09 milone+mitchell"
}

@inproceedings{fg-oaac-88i
, author =	"T. Feder and D. H. Greene"
, title =	"Optimal Algorithms for Approximate Clustering"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"434--444"
, update =	"95.01 smid"
}

@inproceedings{fm-cpgcs-91
, author =	"T. Feder and R. Motwani"
, title =	"Clique partitions, graph compression, and speeding up algoithms"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"123--133"
, update =	"97.11 bibrelex"
}

@book{f-gmt-70
, author =	"H. Federer"
, title =	"Geometric Measure Theory"
, publisher =	"Springer-Verlag"
, year =	1970
, update =	"98.07 bibrelex"
}

@incollection{f-dpsds-82
, author =	"P. J. Federico"
, title =	"Descartes on polyhedra: {A} study of the {De} {Solidorum} {Elementis}"
, booktitle =	"Sources in the History of Mathematics and Physical Sciences"
, volume =	4
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1982
, update =	"97.11 bibrelex"
}

@techreport{f-cspoo-87
, author =	"E. B. Feinberg"
, title =	"Characterizing the Shortest Path of an Object Among Obstacles"
, type =	"Manuscript"
, institution =	"AT\& T Bell Labs"
, year =	1987
, succeeds =	"f-cspoo-89"
, update =	"95.09 korneenko, 93.09 milone+mitchell"
}

@article{f-cspoo-89
, author =	"E. B. Feinberg"
, title =	"Characterizing the shortest path of an object among obstacles"
, journal =	"Inform. Process. Lett."
, volume =	31
, year =	1989
, pages =	"257--264"
, keywords =	"motion planning, ladder"
, precedes =	"f-cspoo-87"
, update =	"95.09 korneenko"
}

@article{fp-ffptp-89
, author =	"E. B. Feinberg and C. H. Papadimitriou"
, title =	"Finding feasible paths for a two-point body"
, journal =	"J. Algorithms"
, volume =	10
, year =	1989
, pages =	"109--119"
}

@book{f-ocscs-88
, author =	"D. G. Feitelson"
, title =	"Optical computing: {A} survey for computer scientists"
, publisher =	"MIT Press"
, address =	"Cambridge, Massachusetts, London, England"
, year =	1988
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@article{ft-itgp-97
, author =	"F. R. Feito and J. C. Torres"
, title =	"Inclusion Test for General Polyhedra"
, journal =	"Comput. \& Graphics"
, volume =	21
, number =	1
, month =	jan
, year =	1997
, pages =	"23--30"
, update =	"97.11 held"
}

@article{f-fctcs-87
, author =	"G. {Fejes T{\'o}th}"
, title =	"Finite covering by translates of centrally symmetric convex domains"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"353--363"
, update =	"93.09 erickson"
}

@article{fgw-fspsc-89
, author =	"G. {Fejes T{\'o}th} and P. Gritzmann and J. M. Wills"
, title =	"Finite sphere packing and sphere covering"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"19--40"
, update =	"93.09 erickson"
}

@incollection{fk-srrtp-93
, author =	"G. {Fejes T{\'o}th} and W. Kuperberg"
, title =	"A Survey of Recent Results in the Theory of Packing and Covering"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"251--279"
, keywords =	"survey paper, discrete geometry, packing, covering, tiling"
, update =	"93.09 erickson"
}

@article{f-dptut-86
, author =	"L. {Fejes T{\'o}th}"
, title =	"Densest packing of translates of the union of two circles"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"307--314"
, update =	"93.09 erickson"
}

@article{f-ecd-78
, author =	"L. {Fejes T{\'o}th}"
, title =	"Evading convex discs"
, journal =	"Studia Scientiarum Mathematicarum Hungarica"
, volume =	13
, year =	1978
, pages =	"453--461"
, update =	"93.09 milone+mitchell"
}

@article{f-icd-77
, author =	"L. {Fejes T{\'o}th}"
, title =	"Illumination of convex discs"
, journal =	"Acta Math. Acad. Sci. Hungar."
, volume =	29
, number =	"3--4"
, year =	1977
, pages =	"355--360"
, update =	"93.09 erickson"
}

@book{f-lidea-53
, author =	"L. {Fejes T{\'o}th}"
, title =	"{Lagerungen} in der {Ebene}, auf der {Kugel} und im {Raum}"
, edition =	"1st"
, publisher =	"Springer-Verlag"
, year =	1953
, update =	"97.11 bibrelex"
}

@book{f-ldead-72
, author =	"L. {Fejes T{\'o}th}"
, title =	"Lagerungen in der Ebene, auf der Kugel und im Raum"
, edition =	"2nd"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1972
, update =	"93.09 erickson"
}

@article{f-plcl-66
, author =	"L. {Fejes T{\'o}th}"
, title =	"On the Permeability of a Layer of Circle-layer"
, journal =	"Studia Scientiarum Mathematicarum Hungarica"
, volume =	1
, year =	1966
, pages =	"5--10"
, update =	"93.09 milone+mitchell"
}

@article{f-plp-68
, author =	"L. {Fejes T{\'o}th}"
, title =	"On the Permeability of a Layer of Parallelograms"
, journal =	"Studia Scientiarum Mathematicarum Hungarica"
, volume =	3
, year =	1968
, pages =	"195--200"
, update =	"93.09 milone+mitchell"
}

@article{f-icd-50
, author =	"L. {Fejes T{\'o}th}"
, title =	"Some packing and covering theorems"
, journal =	"Acta Sci. Math. Szeged"
, volume =	"12/A"
, year =	1950
, pages =	"62--67"
, update =	"97.11 bibrelex, 97.03 pocchiola, 96.05 pocchiola"
}

@article{fh-usk-63
, author =	"L. {Fejes T{\'o}th} and A. Heppes"
, title =	"{\"U}ber stabile {K{\"o}rpersysteme}"
, journal =	"Compositio Mathematica"
, volume =	15
, number =	2
, year =	1963
, pages =	"119--126"
, update =	"98.03 bibrelex"
}

@mastersthesis{f-dpmp-89
, author =	"S{\'a}ndor P. Fekete"
, title =	"Das Piano Movers' Problem"
, type =	"Diplom Thesis"
, school =	"Mathematisches Institut der Universit{\"a}t zu K{\"o}ln"
, year =	1989
, keywords =	"master thesis"
, update =	"98.03 mitchell"
}

@inproceedings{f-faasc-92
, author =	"S{\'a}ndor P. Fekete"
, title =	"Finding all anchored squares in a convex polygon in subquadratic time"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"71--76"
, cites =	"c-kiikf-50, dko-fliet-87, dj-nlbma-89, e-spccc-13, e-mccp-15, kw-onupp-91, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@techreport{f-fmlte-98
, author =	"S{\'a}ndor P. Fekete"
, title =	"Finding Maximum Length Tours under {Euclidean} Metrics"
, type =	"Technical Report"
, number =	"98-317"
, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
, year =	1998
, update =	"98.03 mitchell"
, annote =	"Proves NP-hardness of max-TSP under Euclidean norms in 3
                  or higher dimension.  Contrast with the recent
                  polynomial-time algorithm of Barvinoki et al
                  \cite{bjww-ptamp-98} for polytope distance
                  functions, for any fixed number of facets and any
                  fixed dimension."
}

@phdthesis{f-gtsp-92
, author =	"S{\'a}ndor P. Fekete"
, title =	"Geometry and the Travelling Salesman Problem"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Combinatorics and Optimization, University of Waterloo"
, address =	"Waterloo, ON"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.03 mitchell"
}

@techreport{f-cmlrb-92
, author =	"S{\'a}ndor P. Fekete"
, title =	"On the complexity of min-link red-blue separation"
, type =	"Manuscript"
, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
, year =	1992
, update =	"98.03 mitchell, 95.09 mitchell"
}

@techreport{f-oasp-97
, author =	"S{\'a}ndor P. Fekete"
, title =	"Optimizing the area of simple polygons"
, number =	"97-256"
, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
, year =	1997
, url =	"ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr97-256.ps.gz"
, keywords =	"geometric optimization, area, simple polygons, point separation, complexity, approximation, Traveling Salesman Problem, Pick's theorem, grid points, polyhedra; 90C28, 68Q25"
, succeeds =	"fp-aosp-93"
, update =	"00.11 smid, 00.07 smid, 98.03 mitchell"
, annote =	"Submitted to DCG for publication."
, abstract =	"We discuss problems of optimizing the area of a simple polygon for a
given set of vertices P and show that these problems are very closely
related to problems of optimizing the number of points from a set Q in
a simple polygon with vertex set P. We prove that it is NP-complete
to find a minimum weight polygon or a maximum weight polygon for a
given vertex set, resulting in a proof of NP-completeness for the
corresponding area optimization problems. This answers a generalization
of a question stated by Suri in 1989.
We give evidence that it is unlikely that the minimization
problem can be approximated.
For the maximiation problem, we show that we can find in optimal
time O(n log n) a polygon
of more than half the area AR(conv(P)) of the convex hull conv(P)
of P, yielding a fast 1/2 approximation method for the problem.
We demonstrate that it is NP-complete to decide whether there
is a simple polygon of at least (2/3+eps)(AR(conv(P)).
We also sketch an NP-hardness proof for the problem of finding a minimum-link
searating polygon for two finite point sets in the plane.
Finally, we turn to higher dimensions, where we prove that for
0<k<d+1, 1<d, it is
NP-hard to minimize the volume of the k-dimensional faces of a
d-dimensional simple nondegenerate polyhedron with a given vertex
set, answering a generalization of a question stated by O'Rourke in 1980."
}

@techreport{f-shmts-98
, author =	"S{\'a}ndor P. Fekete"
, title =	"Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances"
, type =	"Manuscript (submitted)"
, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
, year =	1998
, keywords =	"geometric optimization, complexity, Traveling Salesman Problem"
, update =	"98.07 mitchell"
}

@inproceedings{fhw-nrvrg-96
, author =	"S{\'a}ndor P. Fekete and M. E. Houle and S. Whitesides"
, title =	"New results on a visibility representation of graphs in 3-D"
, editor =	"F. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"234--241"
, keywords =	"visibility graphs"
, precedes =	"behflmrrswz-vrg3d-98"
, update =	"98.11 bibrelex, 98.07 rote, 98.03 mitchell, 97.03 rote, 96.09 orourke"
}

@inproceedings{fhw-wleph-97
, author =	"S{\'a}ndor P. Fekete and Michael E. Houle and Sue Whitesides"
, title =	"The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"272--283"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{fm-rbvg3-96
, author =	"S{\'a}ndor P. Fekete and Henk Meijer"
, title =	"Rectangle and Box Visibility Graphs in 3D"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"31--34"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@unpublished{fm-gaim-93
, author =	"S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
, title =	"Geometric Aspects of Injection Molding"
, year =	1993
, note =	"Workshop on Geometric and Computational Aspects of
              Injection Molding, Bellairs Research Institute, February 5--12"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@techreport{fm-hds-97
, author =	"S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
, title =	"Histogram Decomposition and Stereolithography"
, type =	"Technical Report"
, number =	"97-280"
, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
, year =	1997
, update =	"98.03 mitchell"
}

@inproceedings{fmw-cwkmp-00
, author =	"Sandor P. Fekete and Joseph S. B. Mitchell and Karin Weinbrecht"
, title =	"On the Continuous {Weber} and $k$-Median Problems"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"70--79"
, update =	"00.11 jones"
}

@inproceedings{fp-aosp-93
, author =	"S{\'a}ndor P. Fekete and W. R. Pulleyblank"
, title =	"Area optimization of simple polygons"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"173--182"
, precedes =	"f-aosp-97"
, cites =	"aiks-fkpmd-91, bddg-fep-85, c-tsplt-91a, c-ig-61, ddg-fsp-83, dj-nlbma-89, eorw-fmakg-92, egh-lp-89, f-gtsp-92, ggj-sncgp-76, gj-cigtn-79, o-pom3d-80, p-gzz-99, p-nchcp-79, rt-rplbo-86, ZZZ"
, update =	"98.03 bibrelex+mitchell, 93.09 jones"
}

@article{fw-artp-97
, author =	"S{\'a}ndor P. Fekete and Gerhard J. Woeginger"
, title =	"Angle-Restricted Tours in the Plane"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, number =	4
, year =	1997
, pages =	"195--218"
, update =	"98.03 mitchell"
, abstract =	"For a given set $A\subseteq\ (-\pi;+\pi]$ of angles, the problem ``Angle-Restricted Tour'' (ART) is to decide whether a set $P$ of $n$ points in the
Euclidean plane allows a closed directed tour consisting of straight line segments, such that all angles between consecutive line segments are from the
set $A$.
\par
We present a variety of combinatorial and algorithmic results on this problem. In particular, we show that any finite set of at least 5 points allows a
``pseudoconvex'' tour, where all angles are nonnegative."
}

@article{ft-ousls-86
, author =	"A. Feldstein and P. R. Turner"
, title =	"Overflow, underflow, and severe loss of significance in floating-point addition and subtraction"
, journal =	"IMA J. Numer. Analysis"
, volume =	6
, year =	1986
, pages =	"241--251"
, update =	"98.11 bibrelex"
}

@inproceedings{ft-alfdp-85
, author =	"P. Di Felice and R. Tamassia"
, title =	"Automatic Layout of Flow Diagrams: Preliminary Analysis"
, booktitle =	"Proc. ISMM"
, year =	1985
, pages =	"263--267"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{f-iptia-68
, author =	"W. Feller"
, title =	"An introduction to probability theory and its applications"
, edition =	"3rd"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1968
, update =	"98.03 bibrelex"
}

@incollection{f-pc6ck-89
, author =	"M. Fellows"
, title =	"Problem Corner: 6. The complexity of knot triviality and the {Arf} invariant"
, booktitle =	"Proc. AMS-IMS-SIAM Joint Summer Research Conf."
, series =	"Contemporary Mathematics"
, publisher =	"American Mathematical Society"
, year =	1989
, pages =	"189--190"
, update =	"97.11 bibrelex"
}

@incollection{fhw-dpmtw-93
, author =	"Michael R. Fellows and Michael T. Hallett and H. Todd Wareham"
, title =	"DNA Physical Mapping: {Three} Ways Difficult"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"157--168"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@article{f-3iipo-94
, author =	"S. Felsner"
, title =	"3-Interval Irreducible Partially Ordered Sets"
, journal =	"Order"
, volume =	11
, year =	1994
, pages =	"97--125"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{f-nap-96
, author =	"Stefan Felsner"
, title =	"On the Number of Arrangements of Pseudolines"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"30--37"
, cites =	"bepy-htlp-91, blwsz-om-93, eg-bt-87, eg-tsa-89, g-pcbgs-80, gp-sccca-84, gp-asotd-93, g-as-72, k-ah-92, s-nrdec-84, w-mksfs-86, ZZZ"
, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
}

@article{f-nap-97
, author =	"Stefan Felsner"
, title =	"On the Number of Arrangements of Pseudolines"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"257--267"
, update =	"98.03 agarwal"
}

@article{f-osdg-93
, author =	"S. Felsner"
, title =	"Orthogonal Structures in Directed Graphs"
, journal =	"J. Combin. Theory (B)"
, volume =	57
, year =	1993
, pages =	"309--321"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{f-tgo-93
, author =	"S. Felsner"
, title =	"Tolerance Graphs and Orders"
, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	657
, year =	1993
, pages =	"17--26"
, update =	"97.03 gaertner+salinger"
}

@article{fgmr-ccd-94
, author =	"S. Felsner and J. Gustedt and M. Morvan and J. X. Rampon"
, title =	"Constructing Colorings for Diagrams"
, journal =	"Discrete Appl. Math."
, volume =	51
, year =	1994
, pages =	"85--93"
, update =	"97.03 gaertner+salinger"
}

@article{fhm-iidd-94
, author =	"S. Felsner and M. Habib and R. H. M{\"o}ring"
, title =	"On the Interplay of Interval Dimension and Dimension"
, journal =	"SIAM J. Discrete Math."
, volume =	7
, year =	1994
, pages =	"32--40"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{fk-tea-98
, author =	"Stefan Felsner and Klaus Kriegel"
, title =	"Triangles in {Euclidean} Arrangements"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{fm-ish-01
, author =	"Stefan Felsner and Nicole Morawe"
, title =	"Infeasibility of Systems of Halfspaces"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"63--65"
, update =	"01.04 icking"
}

@inproceedings{fmw-tggga-94
, author =	"S. Felsner and R. M{\"u}ller and L. Wernisch"
, title =	"Trapezoid Graphs and Generalizations: Geometry and Algorithms"
, booktitle =	"Proc. 4th Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	824
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"143--154"
, update =	"97.03 gaertner+salinger"
}

@article{ft-cdioa-95
, author =	"S. Felsner and W. T. Trotter"
, title =	"Colorings of Diagrams of Interval Orders and $\alpha$-Sequences of Sets"
, journal =	"Discrete Math."
, volume =	144
, year =	1995
, pages =	"23--32"
, update =	"97.03 gaertner+salinger"
}

@article{ft-fdpos-94
, author =	"S. Felsner and W. T. Trotter"
, title =	"On the Fractional Dimension of Partially Ordered Sets"
, journal =	"Discrete Math."
, volume =	136
, year =	1994
, pages =	"101--117"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{fw-cpop-93
, author =	"S. Felsner and D. Wagner"
, title =	"On the Complexity of Partial Order Properties"
, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	657
, year =	1993
, pages =	"225--235"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{fw-sahbo-98
, author =	"Stefan Felsner and Helmut Weil"
, title =	"Sweeps, Arrangements and Higher {Bruhat} Orders"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	77
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{fw-mkcpp-93
, author =	"S. Felsner and L. Wernisch"
, title =	"Maximum $k$-Chains in Planar Point Sets: {Combinatorial} Structure and Algorithms"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"??"
}

@article{fs-lda1-35
, author =	"W. Fenchel and J. Sutherland"
, title =	"L{\"o}sung der {Aufgabe} $167$"
, journal =	"Jahresbericht Deutsch. Math. Verein"
, volume =	45
, year =	1935
, pages =	"33--35"
, update =	"98.03 bibrelex"
}

@article{fp-dpscf-75
, author =	"H. Y. F. Feng and T. Pavlidis"
, title =	"Decomposition of polygons into simpler components: feature generation for syntactic pattern recognition"
, journal =	"IEEE Trans. Comput."
, volume =	"C-24"
, year =	1975
, pages =	"636--650"
}

@techreport{fh-rcgtt-91
, author =	"S. C. Feng and T. H. Hopp"
, title =	"A review of current geometric tolerancing theories and inspection data analysis algorithms"
, type =	"Technical {Report}"
, number =	"NISTIR-4509"
, institution =	"Factory Automation Systems Division, U.S. Department of Commerce, National Institute of Standards and Technology"
, address =	"Gaithersburg, MD"
, month =	feb
, year =	1991
, update =	"98.07 bibrelex"
}

@inproceedings{f-lsavd-91
, author =	"P. Ferianc"
, title =	"Linear systolic array for {Voronoi} diagram construction in linear time"
, booktitle =	"Proc. Geobild '91"
, series =	"Research in Informatics"
, volume =	4
, publisher =	"Akademie-Verlag"
, year =	1991
, pages =	"120--125"
, keywords =	"parallel computations, Voronoi diagram"
, update =	"95.09 korneenko"
}

@inproceedings{f-ssapo-90
, author =	"D. Fern{\'a}ndez-Baca"
, title =	"Space-sweep algorithms for parametric optimization"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"264--275"
}

@article{fm-pmapt
, author =	"D. Fern{\'a}ndez-Baca and A. Medepalli"
, title =	"Parametric module allocation on partial $k$-trees"
, journal =	"IEEE Trans. Comput."
, volume =	42
, year =	1993
, pages =	"738--742"
, update =	"96.05 agarwal"
}

@techreport{fm-dgmnc-69
, author =	"D. Ferrari and L. Mezzalira"
, title =	"On Drawing a Graph with the Minimum Number of Crossings"
, number =	"69-11"
, institution =	"Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano"
, year =	1969
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{fss-mrpdb-80
, author =	"L. Ferrari and P. V. Sankar and J. Sklansky"
, title =	"Minimal rectangular partitions of digitized blobs"
, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn."
, year =	1980
, pages =	"1040--1043"
, precedes =	"fss-mrpdb-84"
, update =	"97.11 bibrelex"
}

@article{fss-mrpdb-84
, author =	"L. Ferrari and P. V. Sankar and J. Sklansky"
, title =	"Minimal rectangular partitions of digitized blobs"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	28
, number =	1
, year =	1984
, pages =	"58--71"
, keywords =	"isothetic polygons, partition, rectangles"
, precedes =	"fss-mrpdb-80"
, update =	"97.11 bibrelex, 95.09 korneenko"
}

@inproceedings{fp-fsprp-91
, author =	"A. Ferreira and J. G. Peters"
, title =	"Finding smallest paths in rectilinear polygons on a hypercube multiprocessor"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"162--165"
, cites =	"acgoy-pcg-88, acg-cdctd-89, cp-dsnlt-90, d-rld-89, dfr-pfchm-89, dr-idshm-90, kr-pasmm-90, mp-spsrp-89, s-rcg-84, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{forv-hvvnp-94
, author =	"V. Ferrucci and M. H. Overmars and A. Rao and J. Vleugels"
, title =	"Hunting {Voronoi} Vertices in Non-Polygonal Domains"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"45--50"
, precedes =	"vfor-hvv-96"
, cites =	"ay-aampt2-90, a-vdsfg-91, bpv-ocdat-84, g-cp-67, hss-pgcrm-87, ks-tpscv-93, k-eccs-79, km-st-76, l-rmp-91, ly-ptic-75, osy-rnamp-83, obs-stcav-92, o-ramp-92, y-oavds-87, g-plpg-93, ZZZ"
, update =	"98.11 bibrelex, 98.07 agarwal, 97.03 devillers+smid, 94.09 jones"
}

@article{fp-ebemp-91
, author =	"V. Ferrucci and A. Paoluzzi"
, title =	"An extrusion and boundary evaluation for multidimensional polyhedra"
, journal =	"Comput. Aided Design"
, volume =	23
, number =	1
, year =	1991
, pages =	"40--50"
, update =	"98.07 bibrelex"
}

@phdthesis{f-gcago-88
, author =	"R. A. Ferstenberg"
, title =	"Geometric considerations for automatic generation of optimized cutter paths for $3$-axis numerically controlled milling"
, type =	"Ph.{D}. Thesis"
, school =	"Sibley School Mech. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1988
, keywords =	"doctoral thesis"
}

@techreport{fm-gp-94
, author =	"E. Feuerstein and A. Marchetti-Spaccamela"
, title =	"Graph Paging"
, number =	""
, institution =	"Universit\`a di Roma, La Sapienza"
, year =	1994
, update =	"95.01 devillers"
}

@article{fhmst-spcd-01
, author =	"Thomas Fevens and Antonio Hernandez and Antonio Mesa and Michael Soss and Godfried Toussaint"
, title =	"Simple polygons that cannot be deflated"
, journal =	"Beitr{\"a}ge zur Algebra und Geometrie (Contributions to Algebra and Geometry)"
, volume =	"??"
, year =	2001
, note =	"To appear"
, comments =	"Manuscript. School of Computer Science, McGill University
                   June 2000
                   \url{http://cgm.cs.mcgill.ca/~godfried/publications/deflation.ps.gz}"
, update =	"02.03 orourke"
}

@inproceedings{fmr-mcpcp-98
, author =	"Thomas Fevens and Henk Meijer and David Rappaport"
, title =	"Minimum Convex Partition of a Constrained Point Set"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"79--81"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{f-splrt-55
, author =	"L. Few"
, title =	"The shortest path and the shortest road through $n$ points in a region"
, journal =	"Mathematika"
, volume =	2
, year =	1955
, pages =	"141--144"
, update =	"00.03 smid, 98.03 smid, 97.11 bibrelex"
}

@book{fls-flp-63
, author =	"?? Feynmann and ?? Leighton and ?? Sands"
, title =	"The {Feynmann} Lectures on Physics"
, volume =	1
, publisher =	"Addison-Wesley"
, year =	1963
, update =	"01.07 devillers, 98.07 bibrelex"
}

@proceedings{fks-p8ccc-96
, title =	"Proc. 8th Canadian Conference on Computational Geometry"
, editor =	"F. Fiala and E. Kranakis and J.-R. Sack"
, series =	5
, publisher =	"International Informatics"
, year =	1996
, update =	"97.11 sack"
}

@article{fs-hfb-89
, author =	"A. Fiat and A. Shamir"
, title =	"How to find a battleship"
, journal =	"Networks"
, volume =	19
, year =	1989
, pages =	"361--371"
, keywords =	"probing"
, update =	"95.09 korneenko"
}

@book{fw-ola-98
, title =	"Online Algorithms: The State of the Art"
, editor =	"Amos Fiat and Gerhard Woeginger"
, series =	"Lecture Notes Comput. Sci."
, volume =	1442
, publisher =	"Springer-Verlag"
, year =	1998
, isbn =	"3-540-64917-4"
, update =	"02.03 icking, 99.03 bibrelex, 97.03 icking"
}

@techreport{ffg-eacw0-92
, author =	"M. Fidrich and J. Frenk and J. Gromicho"
, title =	"An efficient algorithm to check whether $0$ belongs to the convex hull of a finite number of {$L_p$}-circles"
, number =	"9204/a"
, institution =	"Econometric Institute"
, address =	"Netherlands"
, year =	1992
, update =	"93.09 milone+mitchell"
}

@techreport{f-fdta-87
, author =	"D. Field"
, title =	"A Flexible {Delaunay} Triangulation Algorithm"
, type =	"Research Publication"
, number =	"GMR-5675"
, institution =	"General Motors"
, year =	1987
, annote =	"Extends Watson's algorithm to (2 and 3 D) to allow
		 point deletion. Uses this for Laplacian smoothing."
}

@article{f-nndsp-87
, author =	"D. A. Field"
, title =	"A note on a new data structure for in-the-past queries"
, journal =	"Inform. Process. Lett."
, volume =	24
, year =	1987
, pages =	"95--96"
}

@article{f-gdtaf-91
, author =	"D. A. Field"
, title =	"Generic {Delaunay} Triangulation Algorithm For Finite Element Meshes"
, journal =	"Advances in Engineering Software and Workstations"
, volume =	13
, number =	"5--6"
, month =	sep
, year =	1991
, pages =	"263--272"
, keywords =	"generic Delaunay triangulation algorithms, finite element meshes, Voronoi diagrams"
, update =	"97.07 devillers"
, annote =	"About $k/d$ Dts. These are $k$-simplices with empty
		 hypersphere property, embedded in $d$-dimensional
		 space. (A subset of regular Dt). Watson's to
		 construct."
, abstract =	"A mathematical framework for the construction of k
		 dimensional meshes embedded in n dimensions is
		 provided. By extending Delaunay triangulations a
		 generic triangulation algorithm is stated along with
		 methods for assessing the shapes of simplices. Planar
		 surface and solid meshes illustrate the algorithm.
		 (Author abstract) 31 Refs."
}

@inproceedings{f-iwatd-86
, author =	"D. A. Field"
, title =	"Implementing {Watson}'s algorithm in three dimensions"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"246--259"
, keywords =	"Delaunay triangulations, implementing algorithms, three-dimensional"
, cites =	"bg-gimha-84, cff-aatdf-85, ff-atmg-86, k-isasm-82, w-cnddt-81, z-fem-77, ZZZ"
, update =	"98.03 bibrelex"
}

@article{f-lsdt-88
, author =	"David A. Field"
, title =	"{Laplacian} Smoothing And {Delaunay} Triangulations"
, journal =	"Communications in Applied Numerical Methods"
, volume =	4
, number =	6
, month =	nov
, year =	1988
, pages =	"709--712"
, keywords =	"laplacian smoothing, Delaunay triangulations"
, annote =	"After each step of Laplacian smoothing, do a local
		 retriangulation."
, abstract =	"In contrast to most triangulation algorithms which
		 implicitly assume that triangulation point locations
		 are fixed, 'Laplacian' smoothing focuses on moving
		 point locations to improve triangulation. Laplacian
		 smoothing is attractive for its simplicity but it does
		 require an existing triangulation. In this paper the
		 effect of Laplacian smoothing on Delaunay
		 triangulations is explored. It will become clear that
		 constraining Laplacian smoothing to maintain a Delaunay
		 triangulation measurably improves Laplacian smoothing.
		 (Author abstract) 11 Refs."
}

@techreport{ff-atmg-86
, author =	"D. A. Field and W. H. Frey"
, title =	"Automation of tetrahedral mesh generation"
, number =	"GMR-4967"
, institution =	"General Motors Research Laboratories, Warren"
, year =	1986
, update =	"98.03 bibrelex"
}

@inproceedings{fn-sttm-92
, author =	"David A. Field and Thomas W. Nehl"
, title =	"Stitching Together Tetrahedral Meshes"
, booktitle =	"Proceedings of the SIAM Regional Conference on Geometric Aspects of Industrial Design"
, publisher =	"Soc. for Industrial \& Applied Mathematics"
, address =	"Philadelphia, PA"
, year =	1992
, pages =	"25--38"
, keywords =	"Delaunay based stitching algorithm, tetrahedral meshes, Delaunay criterion of two dimensional triangular meshes, magnetostatics fields"
, update =	"93.09 rote"
, annote =	"3D Dt is constrained to fit 2D Dt of surface. Watson's
		 alg."
, abstract =	"A Delaunay based algorithm has been developed for
		 stitching together two tetrahedral meshes separated by
		 a planar gap of finite thickness. It is assumed that
		 the tetrahedral faces on either side of the planar gap
		 satisfy the Delaunay criterion of two dimensional
		 triangular meshes. The stitching algorithm is applied
		 to a first order tetrahedral finite element mesh model
		 of a prototype magnetostatics problems. Intended for
		 the finite element analysis of three dimensional
		 magnetostatics fields, this mesh is generated in two
		 parts and, due to geometric differences, is stitched
		 together in a narrow air gap region which separates
		 them. In addition to preserving the structure of an
		 existing tetrahedral mesh, material boundaries are
		 preserved and severe length scale problems are
		 overcome. (Author abstract) 10 Refs."
}

@article{fs-gtfem-91
, author =	"David A. Field and Warren D. Smith"
, title =	"Graded Tetrahedral Finite Element Meshes"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	31
, number =	3
, year =	1991
, pages =	"413--425"
, annote =	"Uses octree based on body centred cubic lattice of
		 tetras. (Typical bcc tetra has vertices $(-1,0,0),
		 (0,1,-1), (0,1,1), (1,0,0)$)"
, abstract =	"Vertices in the body centred cubic (bcc) lattice are
		 used to create a tetrahedral spatial decomposition.
		 With this spatial decomposition an octree approach is
		 combined with Delaunay triangulations to decompose
		 solids into tetrahedral finite element meshes. Solids
		 must have their surfaces triangulated and the vertices
		 in the triangulation are finite element nodes. Local
		 densities of interior tetrahedra are controlled by the
		 densities of surface triangles. Accuracy of the
		 decomposition into finite elements depends on the
		 accuracy of the surface triangulation which can be
		 constructed with state of the art computer aided design
		 systems. (Author abstract) 22 Refs."
}

@techreport{f-adlct-82
, author =	"D. E. Field"
, title =	"Algorithms for drawing lines, curves, and triangles"
, type =	"Report"
, number =	"TR310"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1982
, keywords =	"aliasing, anti-aliasing, filtering techniques"
}

@phdthesis{f-adsgo-83
, author =	"D. E. Field"
, title =	"Algorithms for drawing simple geometric objects on raster devices"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1983
, note =	"Technical Report TR314"
, keywords =	"doctoral thesis"
, comments =	"UMI PRH83-18698, 146 pp."
, update =	"93.09 jones"
}

@article{ff-famwt-90
, author =	"M. C. Fields and G. N. Frederickson"
, title =	"A faster algorithm for the maximum weighted tardiness problem"
, journal =	"Inform. Process. Lett."
, volume =	36
, number =	1
, year =	1990
, pages =	"39--44"
, keywords =	"convex hull, dynamizing, lines, geometric transformations"
, update =	"96.09 agarwal, 95.09 korneenko"
}

@unpublished{fo-fdmm-
, author =	"G.-J. Fiezeman and M. H. Overmars"
, title =	"Fast display of molecular models"
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@article{fg-cmc-95
, author =	"L. H. de Figueiredo and J. de Miranda Gomes"
, title =	"Computational morphology of curves"
, journal =	"Visual Comput."
, volume =	11
, year =	1995
, pages =	"105--112"
, update =	"00.03 orourke"
}

@article{fmm-saubd-86
, author =	"D. Filip and R. Magedson and R. Markot"
, title =	"Surface algorithms using bounds on derivatives"
, journal =	"Comput. Aided Geom. Design"
, volume =	3
, year =	1986
, pages =	"295--311"
, update =	"97.11 bibrelex"
}

@article{fyp-cmbs-93
, author =	"P. C. Filkins and S. T. Tuohy and N. M. Patrikalakis"
, title =	"Computational Methods for Blending Surface Approximation"
, journal =	"Engineering with Computers"
, volume =	9
, number =	1
, year =	1993
, pages =	"49--62"
, update =	"95.05 abrams"
}

@article{f-eapp-90
, author =	"P. Filliman"
, title =	"Exterior algebra and projections of polytopes"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"305--322"
}

@article{f-epz-88
, author =	"P. Filliman"
, title =	"Extremum problems for zonotopes"
, journal =	"Geom. Dedicata"
, volume =	27
, number =	3
, year =	1988
, pages =	"251--262"
, update =	"95.09 korneenko"
}

@unpublished{f-pp-87
, author =	"P. Filliman"
, title =	"Projections of polytopes"
, month =	mar
, year =	1987
, note =	"Submitted for publication"
, update =	"98.03 bibrelex"
}

@article{f-aicgt-80
, author =	"I. S. Filotti"
, title =	"An algorithm for imbedding cubic graphs in the torus"
, journal =	"J. Comput. Syst. Sci."
, volume =	20
, year =	1980
, pages =	"255--276"
, succeeds =	"f-eadwc-78"
}

@inproceedings{f-eadwc-78
, author =	"I. S. Filotti"
, title =	"An efficient algorithm for determining whether a cubic graph is toroidal"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Theory Comput."
, year =	1978
, pages =	"133--141"
, precedes =	"f-aicgt-80"
}

@techreport{fmr-dggo-79
, author =	"I. S. Filotti and G. L. Miller and J. Reif"
, title =	"On determining the genus of a graph in {$O(v^{O(g)})$}"
, type =	"Manuscript"
, institution =	"??"
, year =	1979
}

@article{fw-utpf-81
, author =	"N. J. Fine and H. S. Wilf"
, title =	"Uniqueness theorems for periodic functions"
, journal =	"Proc. Amer. Math. Soc."
, volume =	16
, year =	1981
, pages =	"109--114"
, update =	"98.07 bibrelex"
}

@inproceedings{fw-gh-96
, author =	"E. Fink and D. Wood"
, title =	"Generalizing halfspaces"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"211--216"
, update =	"96.09 mitchell"
}

@inproceedings{fw-tdroc-96
, author =	"E. Fink and D. Wood"
, title =	"Three-dimensional restricted-orientation convexity"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"258--263"
, update =	"96.09 mitchell"
}

@inproceedings{fw-tdroc-96c
, author =	"Eugene Fink and Derick Wood"
, title =	"Three-Dimensional Restricted-Orientation Convexity"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"7--10"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@phdthesis{f-afv-94
, author =	"U. Finke"
, title =	"Algorithmen f{\"u}r {Verschneidungsoperationen}"
, school =	"University of Siegen"
, address =	"Siegen, Germany"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{fh-oscps-95
, author =	"Ulrich Finke and Klaus Hinrichs"
, title =	"Overlaying simply connected planar subdivisions in linear time"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"119--126"
, keywords =	"red-blue segment intersection"
, cites =	"c-stsar-94, c-tsplt-91a, f-afv-94, gs-ccrs-86, gs-pmgsc-85, s-sfira-91, w-vfgi-94, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{fh-qvdsr-95
, author =	"U. Finke and K. H. Hinrichs"
, title =	"The Quad View Data Structure: a Representation for Planar Subdivisions"
, booktitle =	"Proc. 6th? Sympos. Advances in Spatial Databases"
, series =	"Lecture Notes Comput. Sci."
, number =	951
, year =	1995
, pages =	"29--46"
, update =	"96.09 kreveld"
}

@article{fb-qtdsr-74
, author =	"R. A. Finkel and J. L. Bentley"
, title =	"Quad trees: a data structure for retrieval on composite keys"
, journal =	"Acta Inform."
, volume =	4
, year =	1974
, pages =	"1--9"
}

@inproceedings{fm-rprpr-97
, author =	"U. Finkler and K. Mehlhorn"
, title =	"Runtime Prediction of Real Programs on Real Machines"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1997
, pages =	"380--389"
, update =	"97.03 held"
}

@inproceedings{fb-pagtc-92
, author =	"G. D. Finlayson and B. K. Bhattacharya"
, title =	"A practical algorithm for the greedy triangulation of a convex polygon"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"347--352"
, cites =	"fbf-afbml-77, k-mtpd-80, lp-annpc-78, ll-abgtc-87, ll-fagt-90, h-mg-73, ZZZ"
, update =	"98.07 bibrelex"
}

@incollection{fhklmsv-gmfl-96
, author =	"P. Finn and D. Halperin and L. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatsubramanian"
, title =	"Geometric manipulation of flexible ligands"
, editor =	"M. C. Lin and D. Manocha"
, booktitle =	"Applied Computational Geometry: Towards Geometric Engineering"
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"67--78"
, update =	"98.07 bibrelex"
}

@inproceedings{fklmsvy-rrpid-97
, author =	"P. Finn and L. E. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatasubramanian and A. Yao"
, title =	"RAPID: randomized pharmacophore identification for drug design"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"324--333"
, cites =	"a-dcpsh-94, ah-alcsl-94, att-ddtps-97, ag-dgsmi-96, amww-cssgo-88, ahb-lsft3-87, a-oagc-87, bmb-pmmca-94, bgss-icfcm-96, bd-glihf-93, b-amm-90, b-afzef-71, bk-facus-73, cgs-icmcm-89, ccfm-icdir-97, cegsw-ccbac-90, ch-dgmc-88, d-fpfnh-93, dl-msp-76, fhklmsv-gmfl-96, gj-cigtn-79, gkpt-csmsm-93, gmhhwsbr-cads5-95, gs-rclcd-70, g-cmmid-85, gbe-pcsai-92, hs-pssaa-97, ityik-msrdd-95, k-rncsf-95, kmy-aalcs-95, km-femgb-94, l-smscs-91, l-arpmb-93, ls-mmpmm-88, l-csbsu-90, mzw-camcu-95, mbddl-fnapm-93, mbw-sdtds-90, mr-ra-95, p-ota-86, ir-cerrp-96, rl-pspmd-95, skt-acc1v-95, w-sppdt-95, ZZZ"
, update =	"98.11 bibrelex, 98.07 agarwal+bibrelex, 97.07 efrat"
}

@article{fklmsvy-rrpid-98
, author =	"P. W. Finn and L. E. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatasubramanian and A. Yao"
, title =	"RAPID: Randomized pharmacophore identification for drug design"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"263--272"
, succeeds =	"fklmsvy-rrpid-97"
, update =	"98.11 devillers"
}

@article{f-pcvp-79
, author =	"J. L. Finney"
, title =	"A Procedure for the Construction of {Voronoi} Polyhedra"
, journal =	"J. Comput. Phys."
, volume =	32
, year =	1979
, pages =	"137--143"
, annote =	"3D Voronoi diagram. To build one polyhedron: consider
		 all triples within $N_c$ of centre and check for empty
		 circumspheres. (only points within $N_s$ ($>N_c$) are
		 checked). Time $O(N^2+ N_c^3N_sN)$. Once vertices are
		 found, they are sorted into the polygon."
}

@book{fj-cesr-89
, author =	"J.-C. Fiorot and P. Jeannin"
, title =	"Courbes et Surfaces Rationelles"
, series =	"RMA"
, volume =	12
, publisher =	"Masson"
, year =	1989
, update =	"98.07 bibrelex"
}

@book{fj-csr-92
, author =	"J.-C. Fiorot and P. Jeannin"
, title =	"Courbes Splines Rationelles"
, series =	"RMA"
, volume =	24
, publisher =	"Masson"
, year =	1992
, update =	"98.07 bibrelex"
}

@inproceedings{fp-pannd-70
, author =	"F. P. Fischer and E. A. Patrick"
, title =	"A preprocessing algorithm for nearest neighbor decision rules"
, booktitle =	"Proc. XXVI Nat. Electron. Conf."
, publisher =	"Illinois Inst. Tech."
, year =	1970
, pages =	"481--485"
}

@article{fsh-eaeha-88
, author =	"H. C. Fischer and G. Schumacher and R. Haggenmuller"
, title =	"Evaluation of arithmetic expressions with high accuracy"
, journal =	"Computing"
, volume =	"suppl"
, year =	1988
, pages =	"149--157"
, keywords =	"robustness"
, update =	"95.09 korneenko"
}

@inproceedings{flz-gswaw-98
, author =	"M. Fischer and T. Lukovszki and M. Ziegler"
, title =	"Geometric searching in walkthrough animations with weak spanners in real time"
, booktitle =	"Proc. 6th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1461
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1998
, pages =	"163--174"
, update =	"00.11 smid, 00.07 smid"
}

@inproceedings{flz-pnsmo-98
, author =	"M. Fischer and T. Lukovszki and M. Ziegler"
, title =	"Partitioned neighborhood spanners of minimal outdegree"
, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
, year =	1999
, pages =	"47--50"
, update =	"00.11 smid, 00.07 smid"
}

@inproceedings{flz-scsns-99
, author =	"Matthias Fischer and Tam{\'a}s Lukovszki and Martin Ziegler"
, title =	"Space Complexity of Sectoral Neighborhood Spanners"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"105--108"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@incollection{fp-dmpps-85
, author =	"M. J. Fischer and M. S. Paterson"
, title =	"Dynamic monotone priorities on planar sets"
, booktitle =	"Proc. Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"289--292"
, keywords =	"searching, dynamizing"
, update =	"95.09 korneenko"
}

@inproceedings{f-fmcp-93
, author =	"P. Fischer"
, title =	"Finding Maximum Convex Polygons"
, booktitle =	"Proc. 9th Internat. Conf. Fund. Comput. Theory"
, site =	"Szeged, Hungary"
, series =	"Lecture Notes Comput. Sci."
, volume =	710
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"234--243"
, precedes =	"f-spafm-97"
, update =	"99.11 bibrelex, 97.03 devillers, 94.09 smid, 93.09 milone+mitchell"
}

@article{f-spafm-97
, author =	"P. Fischer"
, title =	"Sequential and parallel algorithms for finding a maximum convex polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"187--200"
, succeeds =	"f-fmcp-93"
, update =	"97.03 devillers"
}

@article{fh-cmaar-94
, author =	"P. Fischer and K.-U. H{\"o}ffgen"
, title =	"Computing a maximum axis-aligned rectangle in a convex polygon"
, journal =	"Inform. Process. Lett."
, volume =	51
, year =	1994
, pages =	"189--193"
, update =	"94.09 smid"
}

@inproceedings{fhll-aaar-93
, author =	"P. Fischer and K.-U. H{\"o}ffgen and H. Lefmann and T. Luczak"
, title =	"Approximations with Axis-Aligned Rectangles"
, booktitle =	"Proc. 9th Internat. Conf. Fund. Comput. Theory"
, site =	"Szeged, Hungary"
, series =	"Lecture Notes Comput. Sci."
, volume =	710
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"244--255"
, update =	"99.11 bibrelex, 94.09 smid, 93.09 milone+mitchell"
}

@article{f-lbpvd-89
, author =	"T. Fischer"
, title =	"Lower bound proofs via {Voronoi} diagrams"
, journal =	"J. Inform. Process. Cybern."
, volume =	25
, number =	"5--6"
, year =	1989
, pages =	"233--238"
, keywords =	"lower bounds, Voronoi diagrams, $d$-dimensional"
, update =	"95.09 korneenko"
}

@techreport{f-crips-86
, author =	"T. Fischer"
, title =	"On the complexity of rectangle intersection problems under structural constraints"
, type =	"Preprint"
, number =	37
, institution =	"Akad. Wissensch. DDR Inst. Math."
, year =	1986
, keywords =	"rectangles, intersection"
, update =	"99.11 bibrelex, 98.07 bibrelex, 95.09 korneenko"
}

@incollection{f-rbcss-86
, author =	"T. Fischer"
, title =	"Refined bounds on the complexity of sorting and selection in $d$-dimensional space"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	233
, publisher =	"Springer-Verlag"
, year =	1986
, pages =	"308--314"
, update =	"96.05 agarwal, 95.09 korneenko"
}

@techreport{f-trcgs-86
, author =	"T. Fischer"
, title =	"Towards a refined classification of geometric search and computation problems"
, type =	"Preprint"
, institution =	"Akad. Wissensch. DDR. Inst. Math."
, year =	1986
, succeeds =	"f-trcgs-89"
, update =	"98.07 bibrelex, 95.09 korneenko"
}

@inproceedings{f-trcgs-89
, author =	"T. Fischer"
, title =	"Towards refined classification of geometric search and computation problems"
, editor =	"J. H. Davenport"
, booktitle =	"European Conference on Computer Algebra"
, nickname =	"EUROCAL '87"
, site =	"Leipzig"
, series =	"Lecture Notes Comput. Sci."
, volume =	378
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"426--437"
, keywords =	"lower bounds, searching, $d$-dimensional"
, precedes =	"f-trcgs-86"
, update =	"97.11 bibrelex, 96.05 agarwal, 95.09 korneenko"
}

@incollection{fw-icgpd-86
, author =	"T. Fischer and K. Wolfrum"
, title =	"The inherent complexity of geometric problems in $d$-space"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	233
, publisher =	"Springer-Verlag"
, year =	1986
, pages =	"315--324"
, keywords =	"lower bounds, $d$-dimensional"
, update =	"96.05 agarwal, 95.09 korneenko"
}

@article{f-fatmd-80
, author =	"M. A. Fischler"
, title =	"Fast algorithms for two maximal distance problems with applications to image analysis"
, journal =	"Pattern Recogn."
, volume =	12
, year =	1980
, pages =	"35--40"
}

@article{fb-rscpm-81
, author =	"M. A. Fischler and R. C. Bolles"
, title =	"Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography"
, journal =	"Commun. ACM"
, volume =	24
, number =	6
, year =	1981
, pages =	"381--395"
, update =	"97.11 bibrelex"
}

@book{f-peg-69
, author =	"W. T. Fishback"
, title =	"Projective and {Euclidean} Geometry"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1969
, update =	"99.11 bibrelex"
}

@article{f-cpfid-95
, author =	"P. Fishburn"
, title =	"Convex polygons with few intervertex distances"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"65--93"
, update =	"96.09 devillers"
}

@article{f-ioco-88
, author =	"P. C. Fishburn"
, title =	"Interval orders and circle orders"
, journal =	"Order"
, volume =	5
, year =	1988
, pages =	"225--234"
, update =	"98.03 bibrelex"
}

@book{f-ioig-85
, author =	"P. C. Fishburn"
, title =	"Interval Orders and Interval Graphs"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1985
, update =	"99.11 bibrelex, 94.05 franciosa"
}

@article{fr-udbvc-92
, author =	"P. C. Fishburn and J. A. Reeds"
, title =	"Unit distances between vertices of a convex polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"81--91"
}

@inproceedings{fl-cstds-86
, author =	"A. D. Fisher and J. N. Lee"
, title =	"The current status of two-dimensional spatial light modulator technology"
, booktitle =	"Proc. of SPIE"
, volume =	634
, year =	1986
, pages =	"352--371"
, update =	"98.07 bibrelex"
}

@incollection{fw-rvnsh-94
, author =	"Frederick Fisher and Andrew Woo"
, title =	"{R.E} versus {N.H} Specular Highlights"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"388--400"
, keywords =	"Phong illumination, specular reflection"
, update =	"94.09 heckbert"
, annote =	"Compares two common variants of Phong's specular
reflection formula and derives a surprising relationship between them."
}

@article{frs-pp-85
, author =	"J. C. Fisher and D. Ruoff and J. Shilleto"
, title =	"Perpendicular polygons"
, journal =	"Amer. Math. Monthly"
, volume =	92
, year =	1985
, pages =	"23--37"
, update =	"95.09 korneenko"
}

@article{f-aiuva-93
, author =	"P. F. Fisher"
, title =	"Algorithm and Implementation Uncertainty in Viewshed Analysis"
, journal =	"Internat. J. Geogr. Inform. Syst."
, volume =	7
, year =	1993
, pages =	"331--347"
, keywords =	"viewshed, uncertainty, terrains"
, update =	"96.09 kreveld"
}

@article{f-rvftm-96
, author =	"P. F. Fisher"
, title =	"Reconsideration of the viewshed function in terrain modelling"
, journal =	"Geogr. Syst."
, volume =	3
, year =	1996
, pages =	"33--58"
, keywords =	"viewshed, uncertainty, terrains"
, update =	"96.09 kreveld"
}

@inproceedings{f-sv-94
, author =	"P. F. Fisher"
, title =	"Stretching the Viewshed"
, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
, year =	1994
, pages =	"725--738"
, update =	"96.09 kreveld"
}

@article{f-edpsp-40
, author =	"R. A. Fisher"
, title =	"An examination of the different possible solutions of a problem in incomplete blocks"
, journal =	"Annals of Eugenics"
, volume =	10
, year =	1940
, pages =	"52--75"
, update =	"98.03 bibrelex"
}

@article{f-spcwt-78
, author =	"S. Fisk"
, title =	"A short proof of {Chv\'atal's} watchman theorem"
, journal =	"J. Combin. Theory Ser. B"
, volume =	24
, year =	1978
, pages =	374
, update =	"97.03 pocchiola, 94.05 devillers"
}

@article{f-spcrd-86
, author =	"S. Fisk"
, title =	"Separating points by circles and the recognition of digital discs"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	8
, number =	4
, year =	1986
, pages =	"554--556"
, keywords =	"points, partition"
, update =	"95.09 korneenko"
}

@inproceedings{f-agcg-97
, author =	"Eugene Fiume"
, title =	"Applied Geometry for Computer Graphics"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"181--186"
, update =	"97.11 jones"
}

@book{f-msrg-89
, author =	"E. Fiume"
, title =	"The Mathematical Structure of Raster Graphics"
, publisher =	"Academic Press"
, address =	"San Diego"
, year =	1989
, update =	"98.11 ghali"
}

@techreport{ff-rtiph-85
, author =	"E. Fiume and A. Fournier"
, title =	"Ray-tracing is {$PSPACE$}-hard"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Toronto"
, address =	"Toronto, ON"
, year =	1985
}

@techreport{ff-vspsc-85
, author =	"E. Fiume and A. Fournier"
, title =	"The visible surface problem: semantics and complexity"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Toronto"
, address =	"Toronto, ON"
, year =	1985
}

@incollection{ff-vspag-88
, author =	"E. Fiume and A. Fournier"
, title =	"The visible surface problem under abstract graphics models"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"575--586"
, update =	"99.11 bibrelex"
}

@article{ffr-pscaa-83
, author =	"E. Fiume and A. Fournier and L. Rudolph"
, title =	"A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultra-computer"
, journal =	"ACM Comput. Graph."
, volume =	17
, number =	3
, month =	jul
, year =	1983
, pages =	"141--150"
, update =	"97.11 bibrelex"
}

@phdthesis{f-iffss-85
, author =	"Per-Olof Fj{\"a}llstr{\"o}m"
, title =	"Integration of free-form surfaces and solid modelling"
, school =	"?"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{f-pabf-91
, author =	"P.-O. Fj{\"a}llstr{\"o}m"
, title =	"Polyhedral approximation of bivariate functions"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"187--190"
, keywords =	"Computational geometry, {Delaunay} triangulation, polyhedral approximation"
, cites =	"d-pdstb-89, f-sditm-82, gs-cdtp-78, l-scsi-77, l-gdtan-86, m-tdird-76, ps-cgi-85, w-cnddt-81, w-rit-86, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{f-spm-86
, author =	"P. O. Fjallstrom"
, title =	"Smoothing of polyhedral models"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"226--235"
, cites =	"br-cagd-74, bbl-ntc-78, cc-rgbss-78, cg-pspca-84, fp-cgdm-79, ck-dsffs-83, f-iffss-85, gc-tipca-80, s-nrsps-83, ZZZ"
, update =	"98.03 bibrelex"
}

@article{fklp-scha-90
, author =	"P.-O. Fj{\"a}llstr{\"o}m and J. Katajainen and C. Levcopoulos and C. Petersson"
, title =	"A sublogarithmic convex hull algorithm"
, journal =	"BIT"
, volume =	30
, number =	3
, year =	1990
, pages =	"378--384"
, keywords =	"convex hull, parallel computations"
, update =	"95.09 korneenko"
}

@techreport{fp-eagcs-93
, author =	"P. O. Fj{\"a}llstr{\"o}m and J. Petersson"
, title =	"Evaluation of algorithms for geometrical contact-searching problems"
, type =	"Manuscript"
, institution =	"??"
, year =	1993
, update =	"98.03 bibrelex"
}

@unpublished{fp-eorsm-94
, author =	"Per-Olof Fj{\"a}llstr{\"o}m and Jan Petersson"
, title =	"Evaluation of orthogonal range-searching methods for geometric contact searching"
, institution =	"Dept. Computer Science, Link{\"o}ping Univ."
, year =	1994
, note =	"Manuscript (submitted)"
, update =	"97.11 icking, 95.01 mitchell"
}

@article{fpnz-ersmc-98
, author =	"P. O. Fj{\"a}llstr{\"o}m and J. Petersson and L. Nilsson and Z.-H. Zhong"
, title =	"Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"67--84"
, update =	"98.11 devillers"
}

@techreport{f-addmd-79
, author =	"P. Flajolet"
, title =	"Analyse d'algorithmes de manilulations d'arbres et de fichiers"
, number =	"Cahier 34-35"
, institution =	"B.U.R.O."
, year =	1979
, note =	"Cahiers du B.U.R.O. serie Recherche"
, update =	"97.11 bibrelex"
}

@article{f-sdscm-85
, author =	"P. Flajolet"
, title =	"Singular differential systems + {Cauchy} = multidimensional search"
, journal =	"Bull. EATCS"
, volume =	26
, year =	1985
, pages =	"157--158"
}

@inproceedings{fgpr-amsqt-91
, author =	"P. Flajolet and G. Gonnet and C. Puech and J. M. Robson"
, title =	"The analysis of multidimensional searching in quad-trees"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"100--109"
, keywords =	"quad trees"
}

@article{fsz-aacaa-91
, author =	"P. Flajolet and B. Salvy and P. Zimmerman"
, title =	"Automatic average-case analysis of algorithms"
, journal =	"Theoret. Comput. Sci."
, volume =	79
, year =	1991
, pages =	"37--109"
, keywords =	"recurrence, generating function, asymptotic analysis, combinatorial enumeration"
, comments =	"general reference for a powerful automatic asymptotic analyzer"
, update =	"94.01 matousek"
}

@article{fs-ppmta-83
, author =	"P. Flajolet and J.-M. Steyaert"
, title =	"Pattern and pattern-matching in trees: {An} analysis"
, journal =	"Inform. Control"
, volume =	58
, number =	"1-3"
, year =	1983
, pages =	"18--58"
, update =	"97.11 bibrelex"
}

@article{fcm-eergm-87
, author =	"J. Flaquer and A. Carbajal and M. A. Mendez"
, title =	"Edge-edge relationships in geometric modelling"
, journal =	"Comput. Aided Design"
, volume =	19
, number =	5
, year =	1987
, pages =	"237--244"
, keywords =	"polyhedra, geometric modelling"
, update =	"95.09 korneenko"
}

@inproceedings{fs-erqnn-95
, author =	"Robin Y. Flatland and Charles V. Stewart"
, title =	"Extending Range Queries and Nearest Neighbours"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"267--272"
, update =	"95.09 jones"
}

@article{fs-erqnn-00
, author =	"R. Y. Flatland and C. V. Stewart"
, title =	"Extending range queries and nearest neighbours"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"3--24"
, update =	"01.04 smid"
}

@inproceedings{fs-errrq-96
, author =	"R. Y. Flatland and C. V. Stewart"
, title =	"Extending rectangular range reporting with query sensitive analysis"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"319--324"
, update =	"96.09 mitchell"
}

@inproceedings{fh-recpm-00
, author =	"Eyal Flato and Dan Halperin"
, title =	"Robust and Efficient Construction of Planar {Minkowski} Sums"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"85--88"
, update =	"00.03 bibrelex"
}

@inproceedings{fhhn-dipmc-99
, author =	"Eyal Flato and Dan Halperin and Iddo Hanniel and Oren Nechushtan"
, title =	"The Design and Implementation of Planar Maps in {CGAL}"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"169--172"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{f-sbstw-92
, author =	"Rudolf Fleischer"
, title =	"A Simple Balanced Search Tree With {$O(1)$} Worst-Case Update Time"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"77--80"
, update =	"00.03 bibrelex"
}

@inproceedings{f-dtonr-93
, author =	"R. Fleischer"
, title =	"Decision Trees: {Old} and New Results"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"468--477"
, update =	"97.03 smid"
}

@article{f-dtonr-99
, author =	"R. Fleischer"
, title =	"Decision trees: {Old} and new results"
, journal =	"Inform. Comput."
, volume =	152
, year =	1999
, pages =	"44--61"
, update =	"00.11 smid"
}

@inproceedings{fmrwy-sioas-90
, author =	"R. Fleischer and K. Mehlhorn and G{\"u}nter Rote and Emo Welzl and C. K. Yap"
, title =	"On simultaneous inner and outer approximation of shapes"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"216--224"
, precedes =	"fmrwy-sioas-92"
, cites =	"acy-macp-85, afkmnsu-ampcb-90, c-pcp-83, ds-gmmmc-79, g-acb-83, j-episc-48, l-udaek-59, m-tgis-82, sfrw-acfpr-90, f-lidea-53, y-amp-87, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 rote"
}

@article{fmrwy-sioas-92
, author =	"R. Fleischer and K. Mehlhorn and G{\"u}nter Rote and Emo Welzl and C. K. Yap"
, title =	"Simultaneous inner and outer approximation of shapes"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"365--389"
, keywords =	"convex, Banach-Mazur distance, homothetic"
, succeeds =	"fmrwy-sioas-90"
, update =	"98.03 mitchell, 93.09 rote"
}

@inproceedings{ft-orlt-00
, author =	"Rudolf Fleischer and Gerhard Trippen"
, title =	"Optimal Robot Localization in Trees"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"373--374"
, keywords =	"video review"
, update =	"00.11 jones"
}

@article{f-rglpr-86
, author =	"U. Flemming"
, title =	"On the representation and generation of loosely packed rectangles"
, journal =	"Environ. \& Plan., Ser. B"
, volume =	13
, year =	1986
, pages =	"189--205"
, keywords =	"rectangles, packing, data structuring"
, update =	"95.09 korneenko"
}

@article{f-wrrda-80
, author =	"U. Flemming"
, title =	"Wall representations of rectangular dissections: additional results"
, journal =	"Environ. \& Plan., Ser. B"
, volume =	7
, year =	1980
, pages =	"247--251"
, keywords =	"rectangles, isothetic polygons, partition"
, update =	"95.09 korneenko"
}

@article{fk-ratss-88
, author =	"L. A. Fletcher and R. Kasturi"
, title =	"A robust algorithm for text string separation from mixed text/graph images"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	10
, number =	6
, year =	1988
, pages =	"910--918"
, keywords =	"image analysis, rectangles, clustering"
, update =	"95.09 korneenko"
}

@article{fs-qbic-95
, author =	"M. Flickner and H. Sawhney and W. Niblack and J. Ashley and Q. Huang and B. Dom and M. Gorkani and J. Hafner and D. Lee and D. Petkovic and D. Steele and P. Yanker"
, title =	"Query by Image and Video Content: The {QBIC} System"
, journal =	"Computer"
, volume =	28
, year =	1995
, pages =	"23--32"
, update =	"98.07 agarwal"
}

@article{fj-scdnn-81
, author =	"B. E. Flinchbaugh and L. K. Jones"
, title =	"Strong connectivity in directional nearest-neighbor graphs"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	2
, number =	4
, year =	1981
, pages =	"461--463"
, keywords =	"closeness, nearest neighbor graph"
, update =	"95.09 korneenko"
}

@article{f-undkd-
, author =	"A. Flores"
, title =	"{\"U}ber $n$-dimensionale {Komplexe} die im {$R_{2n+1}$} absolut selbstverschlungen sind"
, journal =	"Ergeb. Math. Kolloq."
, volume =	6
, year =	"1932/1934"
, pages =	"4--7"
, update =	"95.01 matousek"
}

@article{f-acdp-86
, author =	"A. Florian"
, title =	"Approximation of convex discs by polygons"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"241--263"
}

@article{f-pld-78
, author =	"A. Florian"
, title =	"On the permeability of layers of discs"
, journal =	"Studia Scientiarum Mathematicarum Hungarica"
, volume =	13
, year =	1978
, pages =	"125--132"
, update =	"93.09 milone+mitchell"
}

@article{fs-zvddm-87
, author =	"A. Florian and W. M. Schmidt"
, title =	"Zerlegung von {Dreiecken} in {Dreiecke} mit {Nebenbedigungen}"
, journal =	"Geom. Dedicata"
, volume =	24
, year =	1987
, pages =	"363--369"
, keywords =	"triangle, covering, convex"
, update =	"95.09 korneenko"
}

@inproceedings{ffpan-vbmtf-86
, author =	"L. De Floriani and B. Falcidieno and C. Pienovi and D. Allen and G. Nagy"
, title =	"A visibility-based model for terrain features"
, booktitle =	"Proc. 2nd Internat. Sympos. Spatial Data Handling"
, year =	1986
, pages =	"235--250"
, update =	"96.09 kreveld"
}

@inproceedings{fmp-seset-99
, author =	"Leila De Floriani and Paola Magillo and Enrico Puppo"
, title =	"A Simple and Efficient Sequential Encoding for Triangle Meshes"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"129--133"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{fnp-clsnt-92
, author =	"L. De Floriani and G. Nagy and E. Puppo"
, title =	"Computing a Line-of-Sight Network on a Terrain Model"
, booktitle =	"Proc. 5th Internat. Sympos. Spatial Data Handling"
, year =	1992
, pages =	"672--681"
, update =	"96.09 kreveld"
}

@inproceedings{fy-okvd-01
, author =	"Julia Fl{\"o}totto and Mariette Yvinec"
, title =	"Order-$k$ {Voronoi} Diagrams"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"109--112"
, update =	"01.04 icking"
}

@article{fr-aasfs-75
, author =	"R. Floyd and R. Rivest"
, title =	"Algorithm 489: The Algorithm {SELECT} for finding the {$i$}th smallest of {$n$} elements"
, journal =	"Commun. ACM"
, volume =	8
, year =	1973
, pages =	173
, update =	"98.11 bibrelex"
}

@article{fr-etbs-75
, author =	"R. Floyd and R. Rivest"
, title =	"Expected time bounds for selection"
, journal =	"Commun. ACM"
, volume =	18
, year =	1975
, pages =	"165--172"
, update =	"97.11 bibrelex"
}

@techreport{f-enphp-??
, author =	"R. W. Floyd"
, title =	"Expected number of points on hull of points drawn from triangle"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@techreport{f-scptd-89
, author =	"S. Foldes"
, title =	"Separability by convection and permeability in two-dimensional velocity fields"
, number =	"G-89-32"
, institution =	"GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
, address =	"Montr{\'e}al"
, month =	sep
, year =	1989
, update =	"98.07 bibrelex"
}

@techreport{f-ssdco-89
, author =	"S. Foldes"
, title =	"Sequential separability of directionally convex objects with restricted motion"
, number =	"G-89-21"
, institution =	"GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
, address =	"Montr{\'e}al"
, month =	jun
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{f-soplo-90
, author =	"S. Foldes"
, title =	"Spherical orders, planar lattices and obstruction graphs in abstract convection systems"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"134--137"
, cites =	"fru-lsoso-88, f-ssdco-89, f-scptd-89, gy-tsr-80, ru-roptc-88, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{fru-lsoso-88
, author =	"S. Foldes and I. Rival and J. Urrutia"
, title =	"Light sources, obstructions and spherical orders"
, number =	"G-88-30"
, institution =	"GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
, address =	"Montr{\'e}al"
, year =	1988
, update =	"98.07 bibrelex"
}

@article{fru-lsoso-92
, author =	"S. Foldes and I. Rival and J. Urrutia"
, title =	"Light sources, obstructions and spherical orders"
, journal =	"Discrete Math."
, volume =	102
, year =	1992
, pages =	"13--23"
, update =	"95.01 franciosa"
}

@book{fd-ficg-82
, author =	"J. D. Foley and A. van Dam"
, title =	"Fundamentals of Interactive Computer Graphics"
, publisher =	"Addison-Wesley"
, address =	"Reading, Mass."
, year =	1982
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{fdfh-cgpp-90
, author =	"J. D. Foley and A. van Dam and S. K. Feiner and J. F. Hughes"
, title =	"Computer Graphics: Principles and Practice"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1990
, note =	"second edition"
, update =	"98.11 bibrelex, 94.09 lambert"
}

@book{fdfhp-icg-93
, author =	"J. D. Foley and A. van Dam and S. K. Feiner and J. F. Hughes and Phillips"
, title =	"Introduction to Computer Graphics"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1993
, update =	"94.09 lambert, 94.05 devillers"
}

@article{f-tsisd-84
, author =	"T. A. Foley"
, title =	"Three-stage interpolation to scattered data"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"141--150"
}

@article{f-wbsir-87
, author =	"T. A. Foley"
, title =	"Weighted bicubic spline interpolation to rapidly varying data"
, journal =	"ACM Trans. Graph."
, volume =	6
, year =	1987
, pages =	"1--18"
}

@inproceedings{f-mlar3-95
, author =	"Frank Follert"
, title =	"Maxmin Location of an Anchored Ray in $3$-Space and Related Problems"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"7--12"
, update =	"95.09 jones"
}

@inproceedings{f-vsswm-96
, author =	"F. Follert"
, title =	"Viewing a set of spheres while moving on a linear flightpath"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"137--142"
, update =	"96.09 mitchell"
}

@inproceedings{fss-sawmf-95
, author =	"Frank Follert and Elmar Sch{\"o}mer and J{\"u}rgen Sellen"
, title =	"Subquadratic Algorithms for the Weighted Maximin Facility Location Problem"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"1--6"
, update =	"95.09 jones"
}

@techreport{fssst-cleac-95t
, author =	"F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
, title =	"Computing a largest empty anchored cylinder, and related problems"
, type =	"Report"
, number =	"MPI-I-95-1-001"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1995
, update =	"96.01 smid, 95.05 smid"
}

@inproceedings{fssst-cleac-95i
, author =	"F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
, title =	"Computing a largest empty anchored cylinder, and related problems"
, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1026
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"428--442"
, update =	"97.03 agarwal, 96.01 smid"
}

@article{fssst-cleac-97
, author =	"F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
, title =	"Computing a largest empty anchored cylinder, and related problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"563--580"
, update =	"98.03 smid"
}

@article{fc-sprap-90
, author =	"D. Y.-S. Fong and J.-L. Chu"
, title =	"A string pattern recognition approach to polygon clipping"
, journal =	"Pattern Recogn."
, volume =	23
, number =	8
, year =	1990
, pages =	"879--892"
, keywords =	"polygons, clipping"
, update =	"95.09 korneenko"
}

@techreport{f-gta-92
, author =	"A. B. Forbes"
, title =	"Geometric tolerance assessment"
, type =	"Technical {Report}"
, number =	"DITC 210/92"
, institution =	"Division of Information Technology and Computing, National Physical Laboratory"
, address =	"Teddington, UK"
, month =	oct
, year =	1992
, update =	"98.07 bibrelex"
}

@book{ff-fn-62
, author =	"L. Ford and D. Fulkerson"
, title =	"Flows in Networks"
, publisher =	"Princeton University Press"
, year =	1962
, update =	"97.11 bibrelex"
}

@phdthesis{f-agpsp-92
, author =	"M. Formann"
, title =	"Algorithms for geometric packing and scaling problems"
, school =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berling, Germany"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@techreport{f-wcp-92
, author =	"M. Formann"
, title =	"Weighted closest pairs"
, type =	"Report"
, number =	"B-92-04"
, institution =	"Fachber. Math., Free Univ. Berlin"
, month =	feb
, year =	1992
, precedes =	"f-wcp-93"
, update =	"93.05 smid"
}

@inproceedings{f-wcp-92c
, author =	"Michael Formann"
, title =	"Weighted Closest Pairs"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"59--60"
, update =	"00.03 bibrelex"
}

@inproceedings{f-wcp-93
, author =	"M. Formann"
, title =	"Weighted closest pairs"
, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	665
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"270--281"
, succeeds =	"f-wcp-92"
, update =	"93.05 smid"
}

@techreport{fhhklsww-dgphr-90t
, author =	"M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
, title =	"Drawing graphs in the plane with high resolution"
, type =	"Technical {Report}"
, number =	"B-90-10"
, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, month =	dec
, year =	1990
, precedes =	"fhhklsww-dgphr-90i"
, update =	"98.07 rote, 98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{fhhklsww-dgphr-90i
, author =	"M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
, title =	"Drawing Graphs in the Plane with High Resolution"
, booktitle =	"Proc. 31th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"86--95"
, keywords =	"graph drawing"
, succeeds =	"fhhklsww-dgphr-90t"
, precedes =	"fhhklsww-dgphr-93"
, update =	"98.11 bibrelex, 98.07 rote, 98.03 mitchell, 94.05 franciosa, 93.09 tamassia"
}

@article{fhhklsww-dgphr-93
, author =	"M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
, title =	"Drawing Graphs in the Plane with High Resolution"
, journal =	"SIAM J. Comput."
, volume =	22
, year =	1993
, pages =	"1035--1052"
, keywords =	"graph drawing"
, succeeds =	"fhhklsww-dgphr-90i"
, update =	"98.03 mitchell, 94.05 franciosa"
}

@inproceedings{fww-rtdcm-91
, author =	"M. Formann and D. Wagner and F. Wagner"
, title =	"Routing through a dense channel with minimum total wire length"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"475--482"
}

@article{fww-rtdcm-93
, author =	"M. Formann and D. Wagner and F. Wagner"
, title =	"Routing through a Dense Channel with Minimum Total Wire Length"
, journal =	"J. Algorithms"
, volume =	15
, year =	1993
, pages =	"267--283"
, update =	"97.03 gaertner+salinger"
}

@unpublished{fw--90
, author =	"M. Formann and F. Wagner"
, year =	1990
, note =	"Unpublished note"
, update =	"97.11 bibrelex"
}

@inproceedings{fw-ppalm-91
, author =	"M. Formann and F. Wagner"
, title =	"A packing problem with applications to lettering of maps"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"281--288"
, keywords =	"packing, optimization"
, cites =	"b-lbact-83, e-ddsoi-80, eis-ctmfp-76, gj-cigtn-79, ia-eaggs-86, i-pnm-75, y-laml-72, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{fw-vlpve-91
, author =	"M. Formann and F. Wagner"
, title =	"The {VLSI} Layout Problem in Various Embedding Models"
, booktitle =	"Proc. 16th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	484
, year =	1991
, pages =	"130--139"
, update =	"97.03 gaertner+salinger"
}

@techreport{f-bcg-84
, author =	"A. R. Forrest"
, title =	"Bibliography on computational geometry"
, type =	"Internal {Report}"
, number =	"CSA-8-1984/Memo CGP84-1"
, institution =	"Comput. Geom. Project, School Comput. Studies Accountancy, Univ. East Anglia"
, year =	1984
}

@article{f-cg-71
, author =	"A. R. Forrest"
, title =	"Computational geometry"
, journal =	"Proc. Roy. Soc. Lond. Ser. A"
, volume =	321
, year =	1971
, pages =	"187--195"
}

@incollection{f-cgap-74
, author =	"A. R. Forrest"
, title =	"Computational geometry: achievements and problems"
, editor =	"R. E. Barnhill and R. F. Riesenfeld"
, booktitle =	"Comput. Aided Geom. Design"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1974
, pages =	"17--44"
}

@incollection{f-cgset-87
, author =	"A. R. Forrest"
, title =	"Computational Geometry and Software Engineering: Towards a Geometric Computing Environment"
, editor =	"D. F. Rogers and R. A. Earnshaw"
, booktitle =	"Techniques for Computer Graphics"
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"23--37"
, isbn =	"3-540-96492-4"
, update =	"93.09 held"
}

@incollection{f-cgpractice-85
, author =	"A. R. Forrest"
, title =	"Computational geometry in practice"
, editor =	"R. A. Earnshaw"
, booktitle =	"Fundamental Algorithms for Computer Graphics"
, series =	"NATO ASI"
, volume =	"F17"
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"707--724"
}

@incollection{f-gcest-88
, author =	"A. R. Forrest"
, title =	"Geometric computing environments: some tentative thoughts"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"185--198"
, keywords =	"implementing algorithms"
, update =	"99.11 bibrelex"
}

@incollection{f-rwga-80
, author =	"A. R. Forrest"
, title =	"Recent work on geometric algorithms"
, editor =	"K. W. Brodlie"
, booktitle =	"Mathematical Methods in Computer Graphics and Design"
, publisher =	"Academic Press"
, address =	"London, England"
, year =	1980
, pages =	"105--121"
}

@book{f-wd-71
, author =	"J. W. Forrester"
, title =	"World Dynamics"
, publisher =	"Wright-Allen"
, address =	"Cambridge, Mass."
, year =	1971
, keywords =	"graph drawing, example"
, update =	"96.09 tamassia, 96.04 garg"
}

@article{f-gcen-32
, author =	"R. M. Forster"
, title =	"Geometrical Circuits of Electrical Networks"
, journal =	"Trans. Amer. Inst. Elec. Engrs."
, volume =	51
, year =	1932
, pages =	"309--317"
, update =	"97.11 bibrelex"
}

@book{fm-cslas-67
, author =	"G. Forsythe and C. Moler"
, title =	"Computer solutions of linear algebraic systems"
, publisher =	"Prentice Hall"
, year =	1967
, update =	"97.03 devillers"
}

@inproceedings{f-btapi-96
, author =	"S. Fortune"
, title =	"A beam-tracing algorithm for prediction of indoor radio propagation"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, site =	"Philadelphia, PA"
, month =	may
, year =	1996
, pages =	"76--81"
, update =	"98.07 bibrelex"
}

@inproceedings{f-savd-86
, author =	"S. Fortune"
, title =	"A sweepline algorithm for {Voronoi} diagrams"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"313--322"
, precedes =	"f-savd-87"
, cites =	"ae-oacwv-84, bwy-oetac-80, cd-vdbcd-85, f-fapct-85, gs-cdtp-78, k-eccs-79, ld-gvdp-81, ls-tacdt-80, ls-ippvd-87, ls-pptmc-85, l-matps-82, oim-iimvd-84, p-masp-77, sh-cpp-75, s-a-83, st-pplup-86, y-oavds-84, ZZZ"
, update =	"98.03 bibrelex"
}

@article{f-nsa2d-95
, author =	"S. Fortune"
, title =	"Numerical stability of algorithms for $2$-d {Delaunay} triangulations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, number =	"1--2"
, year =	1995
, pages =	"193--213"
, keywords =	"robustness, numerical precision"
, succeeds =	"f-nsa2d-92"
, update =	"98.07 tamassia, 96.01 liotta"
}

@inproceedings{f-nsa2d-92
, author =	"S. Fortune"
, title =	"Numerical stability of algorithms for $2$-d {Delaunay} triangulations and {Voronoi} diagrams"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"83--92"
, cites =	"dba-nm-74, f-savd-87, f-smpst-89, f-pcg-93, gs-cdtp-78, gs-pmgsc-85, h-pargc-89, l-scsi-77, m-vigau-88a, m-vigau-88p, si-gafpa-88, si-cvd10-89, ZZZ"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@article{f-pmmia-97
, author =	"S. Fortune"
, title =	"Polyhedral Modeling with Multiprecision Integer Arithmetic"
, journal =	"Comput. Aided Design"
, volume =	29
, number =	2
, year =	1997
, pages =	"123--133"
, update =	"98.07 held"
}

@incollection{f-pcg-93
, author =	"S. Fortune"
, title =	"Progress in Computational Geometry"
, editor =	"R. Martin"
, booktitle =	"Directions in Computational Geometry"
, publisher =	"Information Geometers"
, year =	1993
, pages =	"81--128"
, keywords =	"survey paper"
, update =	"98.03 mitchell, 93.05 orourke"
}

@inproceedings{f-riga-96
, author =	"S. Fortune"
, title =	"Robustness Issues in Geometric Algorithms"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, site =	"Philadelphia, PA, USA"
, month =	may
, year =	1996
, pages =	"20--23"
, update =	"97.11 held"
}

@incollection{f-riga-96i
, author =	"S. Fortune"
, title =	"Robustness issues in geometric algorithms"
, editor =	"M. C. Lin and D. Manocha"
, booktitle =	"Applied Computational Geometry: Towards Geometric Engineering"
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"9--14"
, update =	"98.07 bibrelex"
}

@techreport{f-smpst-90
, author =	"S. Fortune"
, title =	"Stable Maintenance of Point-Set Triangulation in Two Dimensions"
, type =	"Manuscript"
, institution =	"AT\&T Bell Laboratories"
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{f-smpst-89
, author =	"S. Fortune"
, title =	"Stable maintenance of point set triangulations in two dimensions"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, month =	oct
, year =	1989
, pages =	"494--505"
, update =	"98.11 bibrelex"
}

@article{f-vrtdp-99
, author =	"S. Fortune"
, title =	"Vertex-Rounding a Three-Dimensional Polyhedral Subdivision"
, journal =	"Discrete Comput. Geom."
, volume =	22
, number =	4
, year =	1999
, pages =	"593--618"
, update =	"99.11 held"
}

@incollection{f-vddt-92
, author =	"S. Fortune"
, title =	"Voronoi diagrams and {Delaunay} triangulations"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, edition =	"1st"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"193--233"
, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations"
, precedes =	"f-vddt-95"
, update =	"98.03 bibrelex, 97.11 bibrelex, 93.09 erickson"
}

@incollection{f-vddt-95
, author =	"S. Fortune"
, title =	"Voronoi diagrams and {Delaunay} triangulations"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"225--265"
, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations"
, succeeds =	"f-vddt-92"
, update =	"99.11 bibrelex, 98.07 icking, 98.03 bibrelex, 97.11 bibrelex, 97.03 pocchiola"
}

@incollection{f-vddt-97
, author =	"S. Fortune"
, title =	"Voronoi diagrams and {Delaunay} triangulations"
, chapter =	20
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"377--388"
, update =	"97.11 orourke"
}

@inproceedings{fm-nsala-91
, author =	"S. Fortune and V. Milenkovic"
, title =	"Numerical stability of algorithms for line arrangements"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, site =	"North Conway, N.H."
, month =	jun
, year =	1991
, pages =	"334--341"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"arrangements, implementing algorithms, robust geometric computation"
, cites =	"cgl-pgd-83, eg-tsa-86, eos-calha-86, f-smpst-90, gt-tgt-87, g-as-72, gss-egbra-89, gs-pmgsc-85, h-pargc-89, hhk-tirgc-88, hk-prga-89, k-rmrs-89, lm-cschu-90, m-dpggt-89, m-vigau-88p, m-vigau-88a, m-utcpc-89, si-gafpa-88, si-cvd10-89, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 daniels"
}

@inproceedings{fv-eeacg-93
, author =	"S. Fortune and C. J. {Van Wyk}"
, title =	"Efficient exact arithmetic for computational geometry"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, month =	may
, year =	1993
, pages =	"163--172"
, succeeds =	"fw-eeacg-92"
, cites =	"b-csmpi-72, bkv-eccm-91, c-sede-92, cms-frric-92i, f-nsa2d-92, f-vddt-92, gs-pmgsc-85, h-gsm-89, kln-edtur-91, k-sa-81, l-scsi-77, m-vigau-88a, m-maia-79, svh-bpepa-89, sh-cpp-75, si-gafpa-88, si-cvd10-89, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
}

@article{fv-sayee-96
, author =	"S. Fortune and C. J. {Van Wyk}"
, title =	"Static Analysis Yields Efficient Exact Integer Arithmetic for Computational Geometry"
, journal =	"ACM Trans. Graph."
, volume =	15
, number =	3
, month =	jul
, year =	1996
, pages =	"223--248"
, update =	"98.07 bibrelex, 97.03 held"
}

@inproceedings{fw-pcm-88
, author =	"S. Fortune and G. Wilfong"
, title =	"Planning constrained motion"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"445--459"
, precedes =	"fw-pcm-91"
, update =	"98.03 mitchell"
}

@article{fw-pcm-91
, author =	"S. Fortune and G. Wilfong"
, title =	"Planning constrained motion"
, journal =	"Annals of Math. and AI"
, volume =	3
, year =	1991
, pages =	"21--82"
, succeeds =	"fw-pcm-88"
, update =	"98.03 mitchell"
}

@inproceedings{fwy-cmtra-86
, author =	"S. Fortune and G. Wilfong and C. Yap"
, title =	"Coordinated motion of two robot arms"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1986
, pages =	"1216--1223"
, keywords =	"motion planning"
, update =	"00.03 agarwal"
}

@techreport{fw-eeacg-92
, author =	"S. Fortune and C. Van Wyk"
, title =	"Efficient Exact Arithmetic for Comutational Geometry"
, type =	"manuscript"
, year =	1992
, precedes =	"fv-eeacg-93"
, update =	"98.11 bibrelex"
}

@manual{fw-lnum-93
, author =	"S. Fortune and C. Van Wyk"
, title =	"{LN} User Manual"
, organization =	"AT\&T Bell Laboratories"
, year =	1993
, update =	"98.11 bibrelex"
}

@inproceedings{f-fapct-85
, author =	"S. J. Fortune"
, title =	"A fast algorithm for polygon containment by translation"
, booktitle =	"Proc. 12th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	194
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"189--198"
, keywords =	"motion planning, Voronoi diagrams, polygons"
}

@techreport{f-nddf-87
, author =	"S. J. Fortune"
, title =	"A note on {Delaunay} diagonal flips"
, type =	"Manuscript"
, institution =	"AT\&T Bell Lab."
, address =	"Murray Hill, NJ"
, year =	1987
}

@article{f-savd-87
, author =	"S. J. Fortune"
, title =	"A sweepline algorithm for {Voronoi} diagrams"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"153--174"
, keywords =	"plane-sweep, geometric transformations, Voronoi diagrams, Delaunay triangulations"
, succeeds =	"f-savd-86"
}

@article{fh-nrnna-79
, author =	"S. J. Fortune and J. E. Hopcroft"
, title =	"A note on {Rabin}'s nearest-neighbor algorithm"
, journal =	"Inform. Process. Lett."
, volume =	8
, number =	1
, year =	1979
, pages =	"20--23"
, keywords =	"bucketing"
, update =	"98.11 bibrelex"
}

@inproceedings{f-iogda-97
, author =	"Ulrich F{\"o}{\ss}meier"
, title =	"Interactive Orthogonal Graph Drawing: Algorithms and Bounds"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"111--123"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{fhk-iod4a-98
, author =	"U. F{\"o}{\ss}meier and C. Hess and M. Kaufmann"
, title =	"On Improving Orthogonal Drawings: The {4M}-Algorithm"
, editor =	"S. H. Whitesides"
, booktitle =	"Graph Drawing (Proc. GD~'98)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1547
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"125--137"
, update =	"99.07 vismara, 99.03 vismara"
}

@inproceedings{fk-aabno-97
, author =	"Ulrich F{\"o}{\ss}meier and Michael Kaufmann"
, title =	"Algorithms and Area Bounds for Nonplanar Orthogonal Drawings"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"134--145"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{fk-dhdgl-96
, author =	"Ulrich F{\"o}{\ss}meier and Michael Kaufmann"
, title =	"Drawing High Degree Graphs with Low Bend Numbers"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, nickname =	"GD '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"254--266"
, keywords =	"graph drawing, planar, orthogonal"
, update =	"99.03 patrignani+vismara"
}

@inproceedings{fk-ndpbg-97
, author =	"U. F{\"o}ssmeier and M. Kaufmann"
, title =	"Nice Drawings for Planar Bipartite Graphs"
, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1203
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	""
, update =	"00.03 devillers, 98.03 mitchell"
}

@inproceedings{fk-bmoud-95
, author =	"U. F{\"o}{\ss}meier and M. Kaufmann"
, title =	"On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"52--63"
, keywords =	"graph drawing, planar, orthogonal, upward"
, update =	"95.01 tamassia"
}

@inproceedings{fk-esrsp-97
, author =	"U. F{\"o}ssmeier and M. Kaufmann"
, title =	"On Exact Solutions for the Rectilinear {Steiner} Problem"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"436--438"
, cites =	"a-ptase-96, br-iastp-92, fk-esrsp-96, gc-orsmt-94, gj-rstpi-77, h-sprd-66, h-smtrd-76, hrw-stp-92, kps-stvl-90, l-caicl-90, r-fhars-89, sw-tfprs-95, s-hfsmt-92, z-1aasp-92, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{fk-esrsp-96
, author =	"U. F{\"o}ssmeier and M. Kaufmann"
, title =	"On exact solutions for the rectilinear {Steiner} problem. {Part} {I}: {Theoretical} results"
, type =	"Technical {Report}"
, number =	"WSI-96-09"
, institution =	"Universit{\"a}t T{\"u}bingen"
, address =	"T{\"u}bingen, Germany"
, year =	1996
, update =	"98.07 bibrelex"
}

@inproceedings{fkz-faars-93
, author =	"Ulrich F{\"o}{\ss}meier and Michael Kaufmann and Alexander Zelikovsky"
, title =	"Faster Approximation Algorithms for the Rectilinear {Steiner} Tree Problem"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"533--542"
, precedes =	"fkz-faars-97"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@article{fkz-faars-97
, author =	"Ulrich F{\"o}{\ss}meier and Michael Kaufmann and Alexander Zelikovsky"
, title =	"Faster Approximation Algorithms for the Rectilinear {Steiner} Tree Problem"
, journal =	"Discrete Comput. Geom."
, volume =	18
, number =	1
, year =	1997
, pages =	"93--109"
, succeeds =	"fkz-faars-93"
, update =	"98.03 mitchell"
}

@book{f-gm2ag-82
, author =	"L. W. Foster"
, title =	"GEO-METRICS {II}: {The} application of geometric tolerancing techniques"
, publisher =	"Addison-Wesley"
, year =	1982
, update =	"98.07 bibrelex"
}

@book{fr-sag-94
, author =	"S. Fotheringham and P. Rogerson"
, title =	"Spatial analysis and {GIS}"
, publisher =	"Taylor \& Francis"
, address =	"Bristol, PA"
, year =	1994
, update =	"96.09 orourke"
}

@article{fgg-gthfl-85
, author =	"L. R. Foulds and P. B. Gibbons and J. W. Giffin"
, title =	"Graph Theoretic Heuristics for the Facilities Layout Problem: An Experimental Comparison"
, journal =	"Oper. Res."
, volume =	"??"
, year =	1985
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{fhp-gtadm-79
, author =	"L. R. Foulds and M. D. Hendy and D. Penny"
, title =	"A graph theoretic approach to the development of minimal phylogenetic trees"
, journal =	"J. Mol. Evol."
, volume =	13
, year =	1979
, pages =	"127--149"
, update =	"97.11 bibrelex"
}

%   what is this??  L.R.I. UA410 CNRS
@techreport{ffgs-ucasb-87
, author =	"J. M. Fourneau and I. Fournier and A. Germa and D. Sotteau"
, title =	"Unicorn: {A} Computer-Aided Scratch Book for Graph Theory"
, number =	381
, institution =	"Univ. Paris Sud"
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{f-cchfs-79
, author =	"A. Fournier"
, title =	"Comments on convex hull of a finite set of points in two dimensions"
, journal =	"Inform. Process. Lett."
, volume =	8
, year =	1979
, pages =	173
}

@article{ffc-crsm-82
, author =	"A. Fournier and D. Fussell and L. Carpenter"
, title =	"Computer rendering of stochastic models"
, journal =	"Commun. ACM"
, volume =	25
, number =	6
, year =	1982
, pages =	"371--384"
}

@article{fk-cannp-79
, author =	"A. Fournier and Z. M. Kedem"
, title =	"Comments on the all nearest-neighbor problem for convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	9
, year =	1979
, pages =	"105--107"
}

@article{fm-tspep-84
, author =	"A. Fournier and D. Y. Montuno"
, title =	"Triangulating simple polygons and equivalent problems"
, journal =	"ACM Trans. Graph."
, volume =	3
, number =	2
, year =	1984
, pages =	"153--174"
}

@article{fw-bpo-83
, author =	"A. Fournier and M. A. Wesley"
, title =	"Bending polyhedral objects"
, journal =	"Comput. Aided Design"
, volume =	15
, number =	2
, year =	1983
, pages =	"79--87"
, note =	"Proc. 6th IFIP Internat. Sympos. Comput. Hardware"
, update =	"97.11 bibrelex"
}

@inproceedings{fk-rvdb-87
, author =	"D. R. Fowler and J. M. Keil"
, title =	"The rectilinear {Voronoi} diagram with barriers"
, booktitle =	"Proc. 25th Allerton Conf. Commun. Control Comput."
, year =	1987
, pages =	"889--897"
, keywords =	"Voronoi diagrams"
}

@article{f-egavp-83
, author =	"G. Fowler"
, title =	"Efficient Graph Automorphism by Vertex Partitioning"
, journal =	"Artif. Intell."
, volume =	21
, year =	1983
, pages =	"245--269"
, update =	"97.11 bibrelex"
}

@inproceedings{fps-mgemc-95
, author =	"P. W. Fowler and T. Pisanski and J. Shawe-Taylor"
, title =	"Molecular Graph Eigenvectors for Molecular Coordinates"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"282--285"
, keywords =	"graph drawing, system, 3D, force-directed"
, update =	"95.01 tamassia"
}

@techreport{f-dpicd-??
, author =	"R. J. Fowler"
, title =	"Deltri: a program for inductively computing {Delaunay} triangulations"
, type =	"Technical {Report}"
, number =	18
, institution =	"Data Struct. Project, Dept. Geog., Simon Fraser Univ."
, address =	"Burnaby, BC"
, year =	"??"
}

@article{fl-aeind-79
, author =	"R. J. Fowler and J. J. Little"
, title =	"Automatic Extraction of Irregular Network Digital Terrain Models"
, journal =	"Comput. Graph."
, volume =	13
, number =	2
, month =	aug
, year =	1979
, pages =	"199--207"
, update =	"96.09 devillers"
, annote =	"Builds a triangulation to represent the surface from
		 dense raster model. Uses incremental Delaunay
		 triangulation."
}

@article{fpt-opcpa-81
, author =	"R. J. Fowler and M. S. Paterson and S. L. Tanimoto"
, title =	"Optimal packing and covering in the plane are {NP}-complete"
, journal =	"Inform. Process. Lett."
, volume =	12
, number =	3
, year =	1981
, pages =	"133--137"
}

@article{d-fcpmp-00
, author =	"P. Di Francesco"
, title =	"Folding and coloring problems in mathematics and physics"
, journal =	"Bull. Amer. Math. Soc."
, volume =	37
, number =	3
, month =	jul
, year =	2000
, pages =	"251--307"
, update =	"00.11 smid, 00.07 orourke"
}

@phdthesis{f-asdh-94
, author =	"P. G. Franciosa"
, title =	"Adaptive spatial data handling"
, type =	"Ph.{D}. Thesis"
, school =	"Dipartimento di Informatica e Sistemistica, Univ. of Rome ``La Sapienza''"
, address =	"Rome, Italy"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"94.05 franciosa"
}

@article{fggt-chapa-94
, author =	"P. G. Franciosa and C. Gaibisso and G. Gambosi and M. Talamo"
, title =	"A convex hull algorithm for points with approximately known positions"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, number =	2
, year =	1994
, pages =	"153--163"
, update =	"95.01 franciosa"
}

@techreport{fgt-assdh-93
, author =	"P. G. Franciosa and C. Gaibisso and M. Talamo"
, title =	"Adaptive strategies for spatial data handling: an application to the maxima problem"
, type =	""
, number =	"RAP.10.93"
, institution =	"Universit{\`a} di Roma ``La Sapienza''"
, address =	"Dipartimento di Informatica e Sistemistica"
, month =	oct
, year =	1993
, update =	"94.05 franciosa"
}

@techreport{fgt-olcha-92
, author =	"P. G. Franciosa and C. Gaibisso and M. Talamo"
, title =	"An on-line convex hull algorithm on reals"
, type =	"Report"
, number =	"R. 301"
, institution =	"Istituto di Analisi dei Sistemi ed Informatica"
, address =	"Rome, Italy"
, year =	1992
, update =	"94.05 franciosa"
}

@inproceedings{fgt-oamsp-92
, author =	"Paolo Giulio Franciosa and Carlo Gaibisso and Maurizio Talamo"
, title =	"An Optimal Algorithm for the Maxima Set Problem for Data in Motion"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"17--21"
, update =	"00.03 bibrelex"
}

@inproceedings{ft-oksfh-94
, author =	"P. G. Franciosa and M. Talamo"
, title =	"Orders, $k$-sets and fast halfplane search on paged memory"
, booktitle =	"Proc. Workshop on Orders, Algorithms and Applications"
, nickname =	"ORDAL '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	831
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"117--127"
, update =	"98.07 bibrelex, 94.09 franciosa, 94.05 franciosa"
, abstract =	"We investigate the properties of the poset defined by
the set inclusion relation on the set of possible answers to an
halfplane search problem.  We use these properties to design a
static data structure for $n$ points stored in pages of size $b$
requiring $O(\frac{n \sqrt{n}}{b})$ worst case pages that reports a
solution of size $k$ by accessing $O(\log_b n \log \log n +
\frac{k}{b})$ pages.
\par
This is the first sub-quadratic data structure for secondary
storage with output sensitive (in the total number of accessed
pages) query time, and exploits an original point clustering
technique."
}

@article{f-nolnm-61
, author =	"R. Francis"
, title =	"A note on the optimum location of new machines"
, journal =	"J. Indust. Eng."
, volume =	12
, year =	1961
, pages =	"41--47"
, update =	"98.03 bibrelex"
}

@article{f-samlp-67
, author =	"R. Francis"
, title =	"Some aspects of minimax location problem"
, journal =	"Oper. Res."
, volume =	15
, year =	1967
, pages =	"1163--1168"
, update =	"98.03 bibrelex"
}

@book{fw-fll-74
, author =	"R. L. Francis and J. A. White"
, title =	"Facility Layout and Location"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1974
, keywords =	"book"
}

@article{fp-ppepq-92
, author =	"R. S. Francis and L. J. H. Pannan"
, title =	"A parallel partition for enhanced parallel quicksort"
, journal =	"Parallel Comput."
, volume =	18
, year =	1992
, pages =	"543--550"
, update =	"96.09 orourke"
}

@incollection{f-on4ac-83
, author =	"A. Frank"
, title =	"An $O(n^4)$ algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	154
, publisher =	"Springer-Verlag"
, year =	1983
, pages =	"160--172"
, keywords =	"Voronoi diagram"
, update =	"96.05 agarwal, 95.09 korneenko"
}

@article{f-dprg-82
, author =	"A. Frank"
, title =	"Disjoint paths in a rectilinear grid"
, journal =	"Combinatorica"
, volume =	2
, number =	4
, year =	1982
, pages =	"361--371"
, keywords =	"graphs, paths"
, update =	"95.09 korneenko"
}

@article{f-edppg-85
, author =	"A. Frank"
, title =	"Edge-disjoint paths in planar graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	39
, year =	1985
, pages =	"164--178"
, keywords =	"graphs, paths"
, update =	"95.09 korneenko"
}

@article{f-hmdsc-81
, author =	"A. Frank"
, title =	"How to Make a Digraph Strongly Connected"
, journal =	"Combinatorica"
, volume =	1
, number =	2
, year =	1981
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@incollection{f-pgdrs-91
, author =	"A. Frank"
, title =	"Properties of geographic data: requirement for spatial access methods"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	525
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"225--234"
, update =	"96.05 agarwal, 95.09 korneenko"
}

@inproceedings{fhkk-rgosi-96
, author =	"Andrew Frank and Peter Haunold and Werner Kuhn and Gabriel Kuper"
, title =	"Representation of Geometric Objects as Set of Inequalities"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"51--56"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{fk-cgpcm-86
, author =	"A. U. Frank and W. Kuhn"
, title =	"Cell {Graphs}: a provable correct method for the storage of geometry"
, booktitle =	"Proc. 2nd Internat. Sympos. Spatial Data Handling"
, site =	"Seattle, WA"
, year =	1986
, pages =	"??"
}

@article{f-sditm-82
, author =	"R. Franke"
, title =	"Scattered data interpolation: tests of some methods"
, journal =	"Math. Comput."
, volume =	38
, year =	1982
, pages =	"181--200"
, update =	"98.07 bibrelex"
}

@techreport{fn-silss-79
, author =	"R. Franke and G. Nielson"
, title =	"Smooth interpolation of large sets of scattered data"
, type =	"Report"
, number =	"NPS-53-79-005"
, institution =	"Naval Postgraduate School"
, address =	"Monterey, CA"
, year =	1979
}

@article{fm-cdg-88
, author =	"P. Frankl and H. Maehara"
, title =	"On the contact dimensions of graphs"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"89--96"
}

@article{fm-sgabd-90
, author =	"P. Frankl and H. Maehara"
, title =	"Some geometric applications of the beta distribution"
, journal =	"Ann. Inst. Stat. Math"
, volume =	42
, year =	1990
, pages =	"463--474"
, update =	"00.11 smid, 00.07 agarwal"
}

@article{fm-jllss-88
, author =	"P. Frankl and H. Maehara"
, title =	"The {Johnson-Lindenstrauss} lemmas and the sphericity of some graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	44
, year =	1988
, pages =	"355--362"
, update =	"00.11 smid, 00.07 agarwal"
}

@article{fr-hdnj-84
, author =	"P. Frankl and V. R{\"o}dl"
, title =	"Hypergraphs do not jump"
, journal =	"Combinatorica"
, volume =	4
, year =	1984
, pages =	"149--159"
, update =	"98.03 bibrelex"
}

@article{f-ltehs-80
, author =	"W. R. Franklin"
, title =	"A linear time exact hidden surface algorithm"
, journal =	"Comput. Graph."
, volume =	14
, number =	3
, year =	1980
, pages =	"117--123"
, note =	"Proc. SIGGRAPH '80"
, keywords =	"computer graphics, hidden line/surface elimination"
, precedes =	"f-ltehs-88"
, update =	"93.09 franklin"
}

% ### others?
@incollection{f-ltehs-88
, author =	"W. R. Franklin"
, title =	"A linear time exact hidden surface algorithm"
, editor =	"Kenneth I. Joy and others"
, booktitle =	"Tutorial: Computer Graphics: Image Synthesis"
, publisher =	""
, year =	1988
, pages =	"218--224"
, keywords =	"computer graphics, hidden line/surface elimination"
, succeeds =	"f-ltehs-80"
, precedes =	"f-ehsat-81"
, update =	"93.09 franklin"
}

@article{f-ehsat-81
, author =	"W. R. Franklin"
, title =	"An exact hidden sphere algorithm that operates in linear time"
, journal =	"Comput. Graph. Image Process."
, volume =	15
, year =	1981
, pages =	"364--379"
, keywords =	"computer graphics, hidden line/surface elimination"
, succeeds =	"f-ltehs-80"
, update =	"93.09 franklin"
}

@techreport{f-chsa-78
, author =	"W. R. Franklin"
, title =	"Combinatorics of hidden surface algorithms"
, type =	"Technical {Report}"
, number =	"TR-12-78"
, institution =	"Center Res. Comput., Harvard Univ."
, address =	"Cambridge, MA"
, year =	1978
, keywords =	"computer graphics, hidden line/surface elimination"
, comments =	"Thesis w/o appendices available as a TR from CRCT.
Complete thesis available only on microfilm from Harvard, since Harvard did not then subscribe to UMI."
, update =	"93.09 franklin"
}

@techreport{f-lporh-78
, author =	"W. R. Franklin"
, title =	"Locating a point in overlapping regions of hyperspace"
, type =	"Report"
, number =	"CRL-64"
, institution =	"ECSE Dept. Rensselaer Polytech. Inst."
, address =	"Troy, NY"
, year =	1978
, keywords =	"point location"
, update =	"93.09 franklin"
}

@inproceedings{f-ppcvn-87
, author =	"W. R. Franklin"
, title =	"Polygon properties calculated from the vertex neighborhoods"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"110--118"
, keywords =	"rays, measure, polygons"
, cites =	"b-mrsdh-, cb-accwf-86, ey-eafui-72, f-epiu-82, f-rnrpp-83, gs-pmgsc-83, ms-gsmeo-82, m-nmseo-84, w-tsgm-86, w-nmpo-77, ZZZ"
, update =	"98.03 bibrelex, 93.09 franklin"
}

@inproceedings{fa-wcusp-87
, author =	"W. R. Franklin and V. Akman"
, title =	"A workbench to compute unobstructed shortest paths in three-space"
, booktitle =	"Proc. 1st Internat. Conf. Indust. Applied Math."
, site =	"Paris, France"
, year =	1987
, pages =	"1--38"
, keywords =	"motion planning"
, update =	"93.09 franklin"
}

@article{fav-vdbpm-85
, author =	"W. Randolph Franklin and Varol Akman and Colin Verrilli"
, title =	"Voronoi diagrams with barriers and on polyhedra for minimal path planning"
, journal =	"Visual Comput."
, volume =	1
, number =	2
, month =	oct
, year =	1985
, pages =	"133--150"
, keywords =	"robotics, planar partitions, motion planning, Voronoi diagrams"
, update =	"93.09 franklin"
}

@inproceedings{f-3dgdu-81
, author =	"Wm. Randolph Franklin"
, title =	"3-{D} Geometric Databases Using Hierarchies of Inscribing Boxes"
, booktitle =	"Proceedings of the 7th Canadian Man-Computer Conference"
, site =	"Waterloo, Ontario, Canada"
, month =	jun
, year =	1981
, pages =	"173--180"
, keywords =	"computer graphics, CAD"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@inproceedings{f-smoa-83
, author =	"Wm. Randolph Franklin"
, title =	"A Simplified Map Overlay Algorithm"
, booktitle =	"Harvard Computer Graphics Conference"
, site =	"Cambridge, Mass, USA"
, month =	jul
, year =	1983
, keywords =	"intersection"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@inproceedings{f-aggo-83
, author =	"Wm. Randolph Franklin"
, title =	"Adaptive Grids for geometric operations"
, booktitle =	"Proc. 6th International Symposium on Automated Cartography"
, site =	"Ottawa"
, year =	1983
, pages =	"230--239"
, keywords =	"intersection, grids"
, precedes =	"f-aggo-84"
, update =	"97.11 bibrelex, 93.09 franklin"
}

@article{f-aggo-84
, author =	"Wm. Randolph Franklin"
, title =	"Adaptive Grids for geometric operations"
, journal =	"Cartographica"
, volume =	21
, number =	"2--3"
, year =	1984
, pages =	"161--167"
, note =	"monograph 32--33"
, keywords =	"intersection, grids"
, succeeds =	"f-aggo-83"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@inproceedings{f-cmopa-90
, author =	"Wm. Randolph Franklin"
, title =	"Calculating Map Overlay Polygon Areas Without Explicitly Calculating the Polygons --- Implementation"
, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
, site =	"Z{\"u}rich"
, month =	jul
, year =	1990
, pages =	"151--160"
, keywords =	"intersection, area, grids, measure, polygons"
, precedes =	"fsskn-ofmop-93"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@inproceedings{f-cesua-84
, author =	"Wm. Randolph Franklin"
, title =	"Cartographic Errors Symptomatic of Underlying Algebra Problems"
, booktitle =	"Proc. Internat. Sympos. Spatial Data Handling"
, site =	"Z{\"u}rich"
, volume =	1
, month =	aug
, year =	1984
, pages =	"190--208"
, keywords =	"robustness"
, update =	"00.11 smid, 00.07 icking, 95.09 korneenko, 93.09 franklin"
}

@incollection{f-cgprolog-85
, author =	"Wm. Randolph Franklin"
, title =	"Computational Geometry in {Prolog}"
, booktitle =	"Proceedings of the NATO Advanced Study Institute on Fundamental Algorithms for Computer Graphics"
, series =	"NATO ASI Series F"
, volume =	17
, publisher =	"Springer-Verlag"
, address =	"Ilkley, Yorkshire, England"
, month =	mar
, year =	1985
, pages =	"737--749"
, keywords =	"artificial intelligence"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@incollection{f-cslld-91
, author =	"Wm. Randolph Franklin"
, title =	"Computer Systems and Low Level Data Structures for {GIS}"
, editor =	"David Maguire and David Rhind and Mike Goodchild"
, booktitle =	"GIS: Principles and Practice"
, volume =	1
, publisher =	"Longman Higher Education and Reference"
, address =	"London UK"
, year =	1991
, pages =	"215--225"
, keywords =	"tutorial"
, update =	"93.09 franklin"
}

@inproceedings{f-eicld-89
, author =	"Wm. Randolph Franklin"
, title =	"Efficient Intersection Calculations in Large Databases"
, booktitle =	"International Cartographic Association 14th World Conference"
, site =	"Budapest"
, month =	aug
, year =	1989
, pages =	"A62 -- A63"
, keywords =	"intersection, grids"
, update =	"93.09 franklin"
}

@inproceedings{f-epiu-82
, author =	"Wm. Randolph Franklin"
, title =	"Efficient polyhedron intersection and union"
, booktitle =	"Proc. Graphics Interface"
, site =	"Toronto"
, year =	1982
, pages =	"73--80"
, keywords =	"intersection, CAD"
, update =	"93.09 franklin"
}

@article{f-ero-83
, author =	"Wm. Randolph Franklin"
, title =	"Efficient Rotation of an Object"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, number =	11
, month =	nov
, year =	1983
, pages =	"1064--1067"
, keywords =	"computer graphics, CAD"
, update =	"93.09 franklin"
}

@article{f-eadvp-79
, author =	"Wm. Randolph Franklin"
, title =	"Evaluation of Algorithms to Display Vector Plots on Raster Devices"
, journal =	"Comput. Graph. Image Process."
, volume =	11
, number =	4
, month =	dec
, year =	1979
, pages =	"377--397"
, keywords =	"computer graphics, CAD, discrete geometry"
, update =	"93.09 franklin"
}

@inproceedings{f-moaap-92
, author =	"Wm. Randolph Franklin"
, title =	"Map Overlay Area Animation and Parallel Simulation"
, editor =	"David H. Douglas"
, booktitle =	"Proceedings, SORSA'92 Symposium and Workshop"
, month =	jul
, year =	1992
, pages =	"200--203"
, keywords =	"parallel computation, intersection, area"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@incollection{f-prga-86
, author =	"Wm. Randolph Franklin"
, title =	"Problems with Raster Graphics Algorithms"
, editor =	"L. R. A. Kessener and F. J. Peters and M. L. P. van Lierop"
, booktitle =	"Data Structures for Raster Graphics (Proceedings of a Workshop held at Steensel, The Netherlands, June 24--28, 1985)"
, publisher =	"Springer-Verlag Eurographic Seminars"
, year =	1986
, keywords =	"computer graphics, discrete geometry"
, comments =	"(invited presentation)"
, update =	"93.09 franklin"
}

@article{f-rnrpp-83
, author =	"Wm. Randolph Franklin"
, title =	"RAYS -- New Representation for Polygons and Polyhedra"
, journal =	"Comput. Graph. Image Process."
, volume =	22
, year =	1983
, pages =	"327--338"
, keywords =	"measure, polygons, rays"
, update =	"93.09 franklin"
}

@inproceedings{f-tcfg-92
, author =	"Wm. Randolph Franklin"
, title =	"Tutorial on Curve Fitting for {GIS}"
, editor =	"David H. Douglas"
, booktitle =	"Proceedings, SORSA'92 Symposium and Workshop"
, month =	jul
, year =	1992
, pages =	"235--250"
, keywords =	"splines, tutorial"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@article{fa-sehla-87
, author =	"Wm. Randolph Franklin and Varol Akman"
, title =	"A simple and efficient haloed line algorithm for hidden line elimination"
, journal =	"Comput. Graph. Forum"
, volume =	6
, number =	2
, month =	may
, year =	1987
, pages =	"103--109"
, keywords =	"computer graphics, hidden line/surface elimination"
, update =	"93.09 franklin"
}

@article{fa-agpvo-88
, author =	"Wm. Randolph Franklin and Varol Akman"
, title =	"Adaptive Grid for polyhedral visibility in object space, an implementation"
, journal =	"Comput. J."
, volume =	31
, number =	1
, month =	feb
, year =	1988
, pages =	"56--60"
, keywords =	"computer graphics, hidden line/surface elimination"
, update =	"93.09 franklin"
}

@inproceedings{fa-bosp-85i
, author =	"Wm. Randolph Franklin and Varol Akman"
, title =	"Building an Octree from a Set of Parallelepipeds"
, booktitle =	"Graphics Interface"
, year =	1985
, keywords =	"computer graphics, oct trees, CAD"
, precedes =	"fa-bosp-85j"
, update =	"93.09 franklin"
}

@article{fa-bosp-85j
, author =	"Wm. Randolph Franklin and Varol Akman"
, title =	"Building an Octree from a Set of Parallelepipeds"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	5
, number =	10
, month =	oct
, year =	1985
, pages =	"58--64"
, keywords =	"computer graphics, oct trees"
, succeeds =	"fa-bosp-85i"
, update =	"93.09 franklin"
}

@incollection{fa-odscs-85
, author =	"Wm. Randolph Franklin and Varol Akman"
, title =	"Octree Data Structures and Creation by Stacking"
, editor =	"Nadia Magenat-Thalmann"
, booktitle =	"Computer Generated Images, State of the Art"
, publisher =	"Springer-Verlag"
, year =	1985
, keywords =	"computer graphics, oct trees"
, update =	"93.09 franklin"
}

@article{fa-rvrvs-86
, author =	"Wm. Randolph Franklin and Varol Akman"
, title =	"Reconstructing Visible Regions From Visible Segments"
, journal =	"BIT"
, volume =	26
, year =	1986
, pages =	"430--441"
, keywords =	"computer graphics, hidden line/surface elimination"
, update =	"93.09 franklin"
}

@inproceedings{fa-spbsg-84
, author =	"Wm. Randolph Franklin and Varol Akman"
, title =	"Shortest Paths Between Source and Goal Points Located On/Around a Convex Polyhedron"
, booktitle =	"Proc. 22nd Allerton Conf. Commun. Control Comput."
, site =	"Urbana, Illinois, USA"
, month =	oct
, year =	1984
, keywords =	"motion planning"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@incollection{fa-sp3sv-85
, author =	"Wm. Randolph Franklin and Varol Akman"
, title =	"Shortest Paths in 3-Space, {Voronoi} Diagrams with Barriers, and Related Complexity and Algebraic Issues"
, booktitle =	"Proceedings of the NATO Advanced Study Institute on Fundamental Algorithms for Computer Graphics"
, series =	"NATO ASI Series F"
, volume =	17
, publisher =	"Springer-Verlag"
, address =	"Ilkley, Yorkshire, England"
, month =	mar
, year =	1985
, pages =	"895--917"
, keywords =	"motion planning"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@incollection{fckaw-egoc-90
, author =	"Wm. Randolph Franklin and Narayanaswami Chandrasekhar and Mohan Kankanhalli and Varol Akman and Peter Y. F. Wu"
, title =	"Efficient Geometric Operations for {CAD}"
, editor =	"Michael J. Wozny and Joshua U. Turner and K. Preiss"
, booktitle =	"Geometric Modeling for Product Engineering"
, publisher =	"Elsevier Science Publishers B.V. (North-Holland)"
, year =	1990
, pages =	"485--498"
, note =	"Selected and expanded papers from the IFIP WG 5.2/NSF Working Conference on Geometric Modeling, Rensselaerville, USA, 18-22 September 1988"
, keywords =	"intersection, CAD, grids"
, update =	"93.09 franklin"
}

@incollection{fcksa-eugid-88
, author =	"Wm. Randolph Franklin and Narayanaswami Chandrasekhar and Mohan Kankanhalli and Manoj Seshan and Varol Akman"
, title =	"Efficiency of uniform grids for intersection detection on serial and parallel machines"
, editor =	"Nadia Magnenat-Thalmann and D. Thalmann"
, booktitle =	"New Trends in Computer Graphics (Proc. Computer Graphics International'88)"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"288--297"
, keywords =	"parallel computation, intersection, grids"
, update =	"93.09 franklin"
}

@article{fk-poshs-90
, author =	"Wm. Randolph Franklin and Mohan Kankanhalli"
, title =	"Parallel Object-Space Hidden Surface Removal"
, journal =	"Comput. Graph."
, volume =	24
, number =	4
, month =	aug
, year =	1990
, pages =	"87--94"
, note =	"Proc. SIGGRAPH '90"
, keywords =	"computer graphics, parallel computation, hidden line/surface elimination, grids"
, comments =	"Dallas, Texas"
, update =	"93.09 franklin"
}

@inproceedings{fkn-epgol-89
, author =	"Wm. Randolph Franklin and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
, title =	"Efficient Primitive Geometric Operations on Large Databases"
, booktitle =	"Proceedings National Conference Challenge for the 1990s GIS Geographic Information Systems"
, site =	"Ottawa"
, organization =	"Canadian Institute of Surveying and Mapping"
, month =	feb
, year =	1989
, pages =	"1247--1256"
, keywords =	"intersection, CAD, grids"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@incollection{fk-vo3dt-93
, author =	"Wm. Randolph Franklin and Mohan S. Kankanhalli"
, title =	"Volumes From Overlaying 3-{D} Triangulations in Parallel"
, editor =	"D. Abel and B. C. Ooi"
, booktitle =	"Proc. 3rd Sympos. Advances in Spatial Databases"
, series =	"Lecture Notes Comput. Sci."
, volume =	692
, publisher =	"Springer-Verlag"
, month =	jun
, year =	1993
, pages =	"477--489"
, keywords =	"parallel computation, intersection, volume, CAD"
, comments =	"SSD =	Symp on Large Spatial DBs, Singapore"
, update =	"93.09 franklin"
}

@article{fl-3dgdd-78
, author =	"Wm. Randolph Franklin and Harry R. Lewis"
, title =	"3-{D} Graphic Display of Discrete Spatial Data By Prism Maps"
, journal =	"Comput. Graph."
, volume =	12
, number =	3
, month =	aug
, year =	1978
, pages =	"70--75"
, note =	"Proc. SIGGRAPH '78"
, keywords =	"computer graphics, hidden line/surface elimination"
, update =	"96.09 devillers, 93.09 franklin"
}

@inproceedings{fnkszw-ugtid-89
, author =	"Wm. Randolph Franklin and Chandrasekhar Narayanaswami and Mohan Kankanhalli and David Sun and Meng-Chu Zhou and Peter Y. F. Wu"
, title =	"Uniform Grids: A Technique for Intersection Detection on Serial and Parallel Machines"
, booktitle =	"Proceedings 9th International Symposium on Computer-Assisted Cartography"
, site =	"Baltimore, Maryland"
, month =	apr
, year =	1989
, pages =	"100--109"
, keywords =	"parallel computation, intersection, CAD, grids"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@inproceedings{fnsw-eupg-86
, author =	"Wm. Randolph Franklin and Margaret Nichols and Sumitro Samaddar and Peter Y. F. Wu"
, title =	"Experiences with Using {Prolog} for Geometry"
, booktitle =	"Proceedings of Graphics Interface'86, Vision Interface'86"
, site =	"Vancouver, BC"
, month =	may
, year =	1986
, pages =	"26--31"
, keywords =	"computer graphics, artificial intelligence"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@inproceedings{fr-hinbv-94
, author =	"Wm. Randolph Franklin and C. K. Ray"
, title =	"Higher Isn't Necessarily Better: Visibility Algorithms and Experiments"
, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
, year =	1994
, pages =	"751--763"
, keywords =	"visibility, terrains"
, update =	"96.09 kreveld"
}

@inproceedings{fs-ocamo-90
, author =	"Wm. Randolph Franklin and Venkatesh Sivaswami"
, title =	"{OVERPROP} --- Calculating Areas of Map Overlay Polygons without Calculating the Overlay"
, booktitle =	"Second National Conference on Geographic Information Systems"
, site =	"Ottawa"
, month =	mar
, year =	1990
, pages =	"1646--1654"
, keywords =	"intersection, area, grids"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@article{fsskn-ofmop-93
, author =	"Wm. Randolph Franklin and Venkateshkumar Sivaswami and David Sun and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
, title =	"{OVERPROP} --- Finding Map Overlay Polygons' Areas Without Finding The Polygons"
, journal =	"Cartography and Geographic Information Systems"
, volume =	"??"
, year =	1993
, keywords =	"intersection, grids, area"
, succeeds =	"f-cmopa-90"
, update =	"97.11 bibrelex, 93.09 franklin"
}

@inproceedings{fw-posp-87
, author =	"Wm. Randolph Franklin and Peter Y. F. Wu"
, title =	"A Polygon Overlay System in {Prolog}"
, booktitle =	"Proceedings of the 8th International Symposium on Computer-Assisted Cartography"
, site =	"Baltimore, Maryland"
, month =	mar
, year =	1987
, pages =	"97--106"
, keywords =	"intersection, artificial intelligence"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@inproceedings{fwsn-gp-86
, author =	"Wm. Randolph Franklin and Peter Y. F. Wu and Sumitro Samaddar and Margaret Nichols"
, title =	"Geometry in {Prolog}"
, editor =	"Tosiyasu Kunii"
, booktitle =	"Advanced Computer Graphics, Proceedings of Computer Graphics Tokyo 86"
, month =	apr
, year =	1986
, pages =	"71--78"
, keywords =	"computer graphics, artificial intelligence"
, update =	"93.09 franklin"
}

@article{fwsn-pgp-86
, author =	"Wm. Randolph Franklin and Peter Y. F. Wu and Sumitro Samaddar and Margaret Nichols"
, title =	"Prolog and Geometry Projects"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, month =	nov
, year =	1986
, pages =	"46--55"
, keywords =	"computer graphics, artificial intelligence"
, update =	"93.09 franklin"
}

@article{f-fpe-94
, author =	"Marc Frantz"
, title =	"A focusing property of the ellipse"
, journal =	"Amer. Math. Monthly"
, volume =	101
, year =	1994
, pages =	"250--258"
, update =	"01.04 orourke"
}

@article{f-pgslh-89
, author =	"D. Franzblau"
, title =	"Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles"
, journal =	"SIAM J. Discrete Math."
, volume =	2
, number =	3
, year =	1989
, pages =	"307--321"
, keywords =	"isothetic polygons, covering, rectangles"
, update =	"95.09 korneenko"
}

@inproceedings{fk-acrri-84
, author =	"D. Franzblau and D. Kleitman"
, title =	"An algorithm for constructing regions with rectangles: independence and minimum generating sets for collections of intervals"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"167--174"
, precedes =	"fk-acpr-84"
}

@article{fk-acpr-84
, author =	"D. Franzblau and D. Kleitman"
, title =	"An algorithm for covering polygons with rectangles"
, journal =	"Inform. Control"
, volume =	63
, year =	1984
, pages =	"164--189"
, succeeds =	"fk-acrri-84"
}

@phdthesis{f-gcp-85
, author =	"D. S. Franzblau"
, title =	"Geometric covering and partitioning"
, type =	"Ph.{D}. Thesis"
, school =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1985
, keywords =	"doctoral thesis"
}

@article{f-tbppf-77
, author =	"A. R. Fraser"
, title =	"Triangle Based Probability Polygons for Forest Sampling"
, journal =	"Forest Science"
, volume =	23
, year =	1977
, pages =	"111--121"
, annote =	"Uses Least Diagonal Neighbour Triangulation and Linear
		 approximation over triangles to weighted VD to estimate
		 area of weighted VD polygon of a given tree."
}

@article{fk-plsn-92
, author =	"H. Fraysseix and P. Kuntz"
, title =	"Pagination of large-scale networks"
, journal =	"Algorithms Rev."
, volume =	2
, number =	3
, year =	1992
, pages =	"105--112"
}

@inproceedings{fm-spgp-97
, author =	"H. de Fraysseix and P. O. de Mendez"
, title =	"A Short Proof of a Gauss Problem"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"230--235"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{fm-roaa-95
, author =	"H. de Fraysseix and P. O. de Mendez"
, title =	"Regular Orientations, Arboricity, and Augmentation"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"111--118"
, keywords =	"graph drawing, planar, orientation"
, update =	"95.01 tamassia"
}

@techreport{fmr-bor-93
, author =	"H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
, title =	"Bipolar Orientations Revisited"
, number =	"C.A.M.S. P089"
, institution =	"EHESS, Paris"
, year =	1993
, update =	"94.05 tamassia"
}

@article{fmr-bor-95
, author =	"H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
, title =	"Bipolar Orientations Revisited"
, journal =	"Discrete Appl. Math."
, volume =	56
, year =	1995
, pages =	"157--179"
, update =	"98.07 tamassia+vismara"
}

@misc{fmr-poo-92
, author =	"H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
, title =	"Partial Orders and Orientation"
, year =	1992
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{fpp-hdpgg-90
, author =	"H. de Fraysseix and J. Pach and R. Pollack"
, title =	"How to Draw a Planar Graph on a Grid"
, journal =	"Combinatorica"
, volume =	10
, number =	1
, year =	1990
, pages =	"41--51"
, keywords =	"graph drawing"
, update =	"98.07 tamassia, 93.09 tamassia"
}

@inproceedings{fpp-sssfe-88
, author =	"H. de Fraysseix and J. Pach and R. Pollack"
, title =	"Small Sets Supporting {Fary} Embeddings of Planar Graphs"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"426--433"
, keywords =	"graph drawing"
, update =	"94.01 tamassia, 93.09 tamassia"
}

@article{fr-dfscp-82
, author =	"H. de Fraysseix and P. Rosenstiehl"
, title =	"A Depth-First-Search Characterization of Planarity"
, journal =	"Ann. Discrete Math."
, volume =	13
, year =	1982
, pages =	"75--80"
, keywords =	"graph drawing"
, update =	"96.09 devillers, 93.09 tamassia"
}

%   is this the publisher??
@inproceedings{fr-scpdt-84
, author =	"H. de Fraysseix and P. Rosenstiehl"
, title =	"Structures Combinatoires pour des Traces Automatiques de Reseaux"
, booktitle =	"Proc. 3rd European Conf. on CAD/CAM and Computer Graphics (Paris)"
, publisher =	"Hermes"
, year =	1984
, pages =	"332--337"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{fm-ssams-70
, author =	"W. D. Frazer and A. C. McKellar"
, title =	"Samplesort: A sampling approach to minimal storage tree sorting"
, journal =	"J. ACM"
, volume =	17
, number =	3
, year =	1970
, pages =	"496--507"
, update =	"96.09 orourke"
}

@article{f-sqpdc-06
, author =	"M. Fr{\'e}chet"
, title =	"Sur quelques points du calcul fonctionnel"
, journal =	"Rendiconti del Circolo Mathematico di Palermo"
, volume =	22
, year =	1906
, pages =	"1--74"
, update =	"97.11 bibrelex"
}

@book{ff-ict-34
, author =	"M. Fr{\'e}chet and K. Fan"
, title =	"Initiation to Combinatorial Topology"
, publisher =	"Prindle, Weber and Schmidt, Inc."
, address =	"Boston, MA"
, year =	1934
, note =	"Translated from French, with notes by Howard E. Eves"
, update =	"97.11 bibrelex"
}

@article{fwe-tdamg-70
, author =	"C. O. Frederick and Y. C. Wong and F. W. Edge"
, title =	"Two-dimensional Automatic Mesh Generation for Structural Analysis"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	2
, year =	1970
, pages =	"133--144"
, annote =	"Triangulation of set of specified points. Builds
		 triangles on edges to surround each point in turn. When
		 building on edge $AB$ point $C$ which maximizes $\angle
		 ACB$ is picked. DT!"
}

@article{fm-nbkck-78
, author =	"H. Fredericksen and J. Maiorana"
, title =	"Necklaces of beads in $k$ colours and $k$-ary {DeBruin} sequences"
, journal =	"Discrete Math."
, volume =	23
, year =	1978
, pages =	"207--210"
, update =	"97.11 bibrelex"
}

@book{f-dpf-97
, author =	"Greg Frederickson"
, title =	"Dissections: Plane and Fancy"
, publisher =	"Cambridge University Press"
, year =	1997
, update =	"01.07 orourke"
}

@inproceedings{f-dsdmr-93
, author =	"G. N. Frederickson"
, title =	"A data structure for dynamically maintaining rooted trees"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"175--184"
, update =	"96.01 tamassia"
}

@article{f-dsdmr-97
, author =	"Greg N. Frederickson"
, title =	"A Data Structure for Dynamically Maintaining Rooted Trees"
, journal =	"J. Algorithms"
, volume =	24
, year =	1997
, pages =	"37--65"
, keywords =	"topology tree"
, succeeds =	"f-dsdmr-93"
, update =	"98.07 cheong"
}

@incollection{f-naaps-87
, author =	"G. N. Frederickson"
, title =	"A new approach to all pairs shortest paths in planar graphs"
, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
, year =	1987
, pages =	"19--28"
, keywords =	"shortest paths, graphs"
, update =	"95.09 korneenko"
}

@inproceedings{f-adsd2-91
, author =	"G. N. Frederickson"
, title =	"Ambivalent Data Structures for Dynamic 2-Edge Connectivity and $k$-Smallest Spanning Trees"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"632--641"
, update =	"94.01 tamassia"
}

@article{f-adsd2-97
, author =	"Greg N. Frederickson"
, title =	"Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees"
, journal =	"SIAM J. Comput."
, volume =	26
, year =	1997
, pages =	"484--538"
, keywords =	"topology tree"
, succeeds =	"f-adsd2-91"
, update =	"98.07 cheong"
}

@article{f-dsolu-85
, author =	"G. N. Frederickson"
, title =	"Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications"
, journal =	"SIAM J. Comput."
, volume =	14
, number =	4
, year =	1985
, pages =	"781--798"
, update =	"94.01 tamassia"
}

@article{f-faspp-87
, author =	"G. N. Frederickson"
, title =	"Fast algorithms for shortest paths in planar graphs, with applications"
, journal =	"SIAM J. Comput."
, volume =	16
, number =	6
, year =	1987
, pages =	"1004--1022"
, keywords =	"shortest paths, graphs"
, update =	"96.09 agarwal, 95.09 korneenko"
}

@inproceedings{f-oatp-91
, author =	"G. N. Frederickson"
, title =	"Optimal algorithms for tree partitioning"
, booktitle =	"Proc. 2nd ACM-SIAM Symp. Discr. Algo."
, year =	1991
, pages =	"168--177"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@techreport{fg-nempt-89
, author =	"G. N. Frederickson and D. J. Guan"
, title =	"Nonpreemptive ensemble motion planning on a tree"
, type =	"Technical {Report}"
, institution =	"Purdue Univ."
, address =	"W. Lafayette, IN"
, month =	aug
, year =	1989
, update =	"96.09 agarwal, 93.09 milone+mitchell"
}

@techreport{fg-pempt-89
, author =	"G. N. Frederickson and D. J. Guan"
, title =	"Preemptive ensemble motion planning on a tree"
, type =	"Technical {Report}"
, institution =	"Purdue Univ."
, address =	"W. Lafayette, IN"
, month =	aug
, year =	1989
, update =	"96.09 agarwal, 93.09 milone+mitchell"
}

@techreport{fh-plaog-87
, author =	"G. N. Frederickson and S. E. Hambrusch"
, title =	"Planar linear arrangements of outerplanar graphs"
, type =	"Technical {Report}"
, institution =	"Purdue Univ."
, address =	"W. Lafayette, IN"
, month =	mar
, year =	1987
, update =	"96.09 agarwal, 93.09 milone+mitchell"
}

@article{fj-fkppc-83
, author =	"G. N. Frederickson and D. B. Johnson"
, title =	"Finding $k$th paths and $p$-centers by generating and searching good data structures"
, journal =	"J. Algorithms"
, volume =	4
, year =	1983
, pages =	"61--80"
}

@article{fj-gsrsm-84
, author =	"G. N. Frederickson and D. B. Johnson"
, title =	"Generalized selection and ranking: sorted matrices"
, journal =	"SIAM J. Comput."
, volume =	13
, year =	1984
, pages =	"14--30"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@article{fj-csrxm-82
, author =	"G. N. Frederickson and D. B. Johnson"
, title =	"The complexity of selection and ranking in {$X+Y$} and matrices with sorted rows and columns"
, journal =	"J. Comput. Syst. Sci."
, volume =	24
, year =	1982
, pages =	"197--208"
}

@techreport{fr-nadmm-87
, author =	"G. N. Frederickson and S. Rodger"
, title =	"A new approach to the dynamic maintenance of maximal points in a plane"
, type =	"Report"
, number =	"CSD-TR-658"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1987
, precedes =	"fr-nadmm-90"
, update =	"96.09 agarwal"
}

@article{fr-nadmm-90
, author =	"G. N. Frederickson and S. Rodger"
, title =	"A new approach to the dynamic maintenance of maximal points in a plane"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"365--374"
, succeeds =	"fr-nadmm-87"
, update =	"96.09 agarwal"
}

@inproceedings{fs-dsolu-84
, author =	"G. N. Frederickson and M. A. Srinivas"
, title =	"Data structures for on-line updating of matroid intersection solutions"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"383--390"
, precedes =	"fs-olusc-87"
, update =	"97.11 bibrelex"
}

@article{fs-olusc-87
, author =	"G. N. Frederickson and M. A. Srinivas"
, title =	"On-line updating of solutions to a class of matroid intersection problems"
, journal =	"Inform. Comput."
, volume =	74
, year =	1987
, pages =	"113--139"
, succeeds =	"fs-dsolu-84"
}

@inproceedings{fg-empt-89
, author =	"H. N. Frederickson and D. J. Guan"
, title =	"Esemble motion planning in trees"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"66--71"
}

@inproceedings{fhk-aasrp-76
, author =	"H. N. Frederickson and M. S. Hecht and C. E. Kim"
, title =	"Approximation algorithms for some routing problems"
, booktitle =	"Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1976
, pages =	"216--227"
, precedes =	"fhk-aasrp-78"
}

@article{fhk-aasrp-78
, author =	"H. N. Frederickson and M. S. Hecht and C. E. Kim"
, title =	"Approximation algorithms for some routing problems"
, journal =	"SIAM J. Comput."
, volume =	7
, year =	1978
, pages =	"178--193"
, succeeds =	"fhk-aasrp-76"
}

@inproceedings{fj-sbsem-86
, author =	"F. N. Fredickson and R. Janardan"
, title =	"Separator-based strategies for efficient message routing"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"428--437"
, update =	"98.03 bibrelex"
}

@inproceedings{f-idswd-81
, author =	"G. N. Fredickson"
, title =	"Implicit data structures for the weighted dictionary problem"
, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1981
, pages =	"133--139"
, update =	"97.11 bibrelex"
}

@article{fw-sitbf-93
, author =	"F. W. Fredman and D. E. Willard"
, title =	"Surpassing the information theoretic bound with fusion trees"
, journal =	"J. Comput. Syst. Sci."
, volume =	48
, number =	3
, year =	1993
, pages =	"424--436"
, update =	"97.07 agarwal"
}

@inproceedings{fw-tdams-90
, author =	"F. W. Fredman and D. E. Willard"
, title =	"Trans-dichotomous algorithms for minimum spanning trees and shortest paths"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"719--725"
}

@article{f-lbcor-81
, author =	"M. L. Fredman"
, title =	"A lower bound on the complexity of orthogonal range queries"
, journal =	"J. ACM"
, volume =	28
, year =	1981
, pages =	"696--705"
}

@inproceedings{f-nodst-79
, author =	"M. L. Fredman"
, title =	"A near-optimal data structure for a type of range query problem"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
, year =	1979
, pages =	"62--66"
, precedes =	"f-cmaci-79"
}

@article{f-hgiit-76
, author =	"M. L. Fredman"
, title =	"How good is the information theory bound in sorting?"
, journal =	"Theoret. Comput. Sci."
, volume =	1
, year =	1976
, pages =	"355--361"
, update =	"93.09 erickson"
}

@inproceedings{f-icrqp-79
, author =	"M. L. Fredman"
, title =	"Inherent complexity of range query problems"
, booktitle =	"Proc. 17th Allerton Conf. Commun. Control Comput."
, year =	1979
, pages =	"231--240"
}

@article{f-lbcso-81
, author =	"M. L. Fredman"
, title =	"Lower bounds on the complexity of some optimal data structures"
, journal =	"SIAM J. Comput."
, volume =	10
, year =	1981
, pages =	"1--10"
}

@article{f-cmaci-79
, author =	"M. L. Fredman"
, title =	"The complexity of maintaining an array and computing its partial sums"
, journal =	"J. ACM"
, volume =	29
, year =	1979
, pages =	"250--260"
, succeeds =	"f-nodst-79"
}

@inproceedings{f-icdds-80
, author =	"M. L. Fredman"
, title =	"The inherent complexity of dynamic data structures which accommodate range queries"
, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1980
, pages =	"191--199"
, comments =	"Split into three journal papers: \cite{f-lbcso-81},
		 \cite{f-lbcor-81}, and \cite{f-sbmrq-81}"
}

@article{f-sbmrq-81
, author =	"M. L. Fredman"
, title =	"The spanning bound as a measure of range query complexity"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"77--87"
}

@inproceedings{fks-sstwc-82
, author =	"M. L. Fredman and J. Komlos and E. Szemeredi"
, title =	"Storing a sparse table with {$O(1)$} worst -case access time"
, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1982
, pages =	"165--170"
, update =	"00.11 smid, 97.11 bibrelex"
}

@article{fks-sstwc-84
, author =	"M. L. Fredman and J. Komlos and E. Szemeredi"
, title =	"Storing a sparse table with {$O(1)$} worst case access time"
, journal =	"J. ACM"
, volume =	31
, number =	3
, month =	jul
, year =	1984
, pages =	"538--544"
, update =	"00.11 smid, 98.11 bibrelex, 98.03 smid"
}

@inproceedings{ft-fhtu-84
, author =	"M. L. Fredman and R. E. Tarjan"
, title =	"{Fibonacchi} heaps and their uses"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"338--346"
, update =	"97.11 bibrelex"
}

@article{ft-fhtui-87
, author =	"M. L. Fredman and R. E. Tarjan"
, title =	"Fibonacci heaps and their uses in improved network optimization algorithms"
, journal =	"J. ACM"
, volume =	34
, year =	1987
, pages =	"596--615"
, update =	"00.11 smid, 00.07 smid"
}

@article{fv-qtvrt-81
, author =	"M. L. Fredman and D. J. Volper"
, title =	"Query time versus redundancy trade-offs for range queries"
, journal =	"J. Comput. Syst. Sci."
, volume =	23
, year =	1981
, pages =	"355--365"
}

@article{fv-cpmrd-82
, author =	"M. L. Fredman and D. J. Volper"
, title =	"The complexity of partial match retrieval in a dynamic setting"
, journal =	"J. Algorithms"
, volume =	3
, year =	1982
, pages =	"68--78"
}

@article{fw-ccmb-78
, author =	"M. L. Fredman and B. Weide"
, title =	"On the complexity of computing the measure of $\bigcup[{a_{i}},b_{i}]$"
, journal =	"Commun. ACM"
, volume =	21
, year =	1978
, pages =	"540--544"
}

@inproceedings{fw-bitbf-90
, author =	"M. L. Fredman and D. E. Willard"
, title =	"Blasting through the information theoretic barrier with fusion trees"
, booktitle =	"STOC '90"
, year =	1990
, pages =	"1--7"
, update =	"98.11 bibrelex"
}

@article{f-pldps-87
, author =	"M. H. Freedman"
, title =	"A power law for the distortion of planar sets"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"345--351"
}

@incollection{f-cnp-91
, author =	"H. Freeman"
, title =	"Computer Name Placement"
, editor =	"D. J. Maguire and M. F. Goodchild and D. W. Rhind"
, booktitle =	"Geographical Information Systems: Principles and Applications"
, publisher =	"Longman"
, address =	"London"
, year =	1991
, pages =	"445--456"
, update =	"96.09 kreveld"
}

@article{f-cpldi-74
, author =	"H. Freeman"
, title =	"Computer processing of line-drawing images"
, journal =	"ACM Comput. Surv."
, volume =	6
, year =	1974
, pages =	"57--97"
}

@article{f-lccs-80
, author =	"H. Freeman"
, title =	"Lines, curves, and the characterization of shapes"
, journal =	"Inform. Process. Lett."
, volume =	80
, year =	1980
, pages =	"629--639"
}

@inproceedings{f-past-75
, author =	"H. Freeman"
, title =	"On the packing of arbitrary shaped templates"
, booktitle =	"Proc. 2nd USA-Japan Comput. Conf."
, year =	1975
, pages =	"102--107"
, update =	"98.03 bibrelex"
}

@article{fl-atdhl-67
, author =	"H. Freeman and P. P. Loutrel"
, title =	"An algorithm for the two dimensional ``hidden line'' problem"
, journal =	"IEEE Trans. Electron. Comput."
, volume =	"EC-16"
, year =	1967
, pages =	"784--790"
}

@article{fm-scmgt-67
, author =	"H. Freeman and S. P. Morse"
, title =	"On searching a contour map for a given terrain profile"
, journal =	"J. of the Franklin Institute"
, volume =	248
, year =	1967
, pages =	"1--25"
, update =	"98.07 bibrelex"
}

@article{fs-dmaer-75
, author =	"H. Freeman and R. Shapira"
, title =	"Determining the minimum-area encasing rectangle for an arbitrary closed curve"
, journal =	"Commun. ACM"
, volume =	18
, year =	1975
, pages =	"409--413"
}

@inproceedings{f-bfnkg-87
, author =	"H. Freeston"
, title =	"The {BANG} file: a new kind of grid file"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1987
, pages =	"260--269"
, keywords =	"data structuring"
, update =	"97.07 agarwal, 95.09 korneenko"
}

@inproceedings{f-gsndb-95
, author =	"M. Freestone"
, title =	"A general solution of the $n$-dimensional {B}-tree problem"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1995
, pages =	"80--91"
, update =	"97.07 agarwal"
}

@techreport{f-bwlss-91
, author =	"R. Freimer"
, title =	"Bisectors of weakly linearly separable sets"
, type =	"Report"
, number =	"RC 16817"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, month =	apr
, year =	1991
, keywords =	"Voronoi diagrams"
}

@techreport{f-scph-91t
, author =	"R. Freimer"
, title =	"Shattering configurations of points with hyperplanes"
, type =	"Technical {Report}"
, number =	"TR~91-1199"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1991
, keywords =	"arrangements, separation"
, precedes =	"f-scph-91i"
}

@inproceedings{f-scph-91i
, author =	"R. Freimer"
, title =	"Shattering configurations of points with hyperplanes"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"220--223"
, keywords =	"arrangements, separation"
, succeeds =	"f-scph-91t"
, cites =	"e-acg-87, fmp-csua-90, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{fkmprs-lofp-94
, author =	"R. Freimer and S. Khuller and Joseph S. B. Mitchell and C. Piatko and K. Romanik and D. Souvaine"
, title =	"Localizing an Object with Finger Probes"
, editor =	"Robert A. Melter and Angela Y. Wu"
, booktitle =	"Proceedings of Vision Geometry III"
, publisher =	"SPIE - The International Society for Optical Engineering"
, month =	nov
, year =	1994
, pages =	"272--283"
, note =	"part of SPIE's Intl. Symp. Photonics for Industrial Appl."
, keywords =	"probing, finger probes, localization"
, update =	"98.03 mitchell, 96.09 romanik"
}

@inproceedings{fmp-csua-90
, author =	"R. Freimer and J. S. B. Mitchell and C. D. Piatko"
, title =	"On the complexity of shattering using arrangements"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1990
, pages =	"218--222"
, keywords =	"arrangements, separation, NP-hardness"
, precedes =	"fmp-csua-91"
, cites =	"e-acg-87, eow-gfcs-83, ers-ccsno-90, ew-hrsls-86, gm-osacv-87, hm-aahos-88, m-cps-88, mt-cllfp-82, mw-dmvgi-90, sv-ecrps-89, w-ubgpc-90, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@techreport{fmp-csua-91
, author =	"R. Freimer and Joseph S. B. Mitchell and C. D. Piatko"
, title =	"On the complexity of shattering using arrangements"
, type =	"Technical {Report}"
, number =	"TR~91-1197"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	apr
, year =	1991
, keywords =	"arrangements, separation, NP-hardness, approximation"
, succeeds =	"fmp-csua-90"
, update =	"98.03 mitchell"
}

@inproceedings{fjp-epams-95
, author =	"Lori Freitag and Mark Jones and Paul Plassmann"
, title =	"An Efficient Parallel Algorithm for Mesh Smoothing"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"47--58"
, update =	"96.01 samitchell"
}

@inproceedings{fo-ctmit-96
, author =	"Lori Freitag and Carl Ollivier-Gooch"
, title =	"A comparison of tetrahedral mesh improvement techniques"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"87--100"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@article{fsg-famg3-94
, author =	"P. Frey and B. Sarter and M. Gautherie"
, title =	"Fully automatic mesh generation for 3d domains based upon voxel sets"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	37
, year =	1994
, pages =	"2735--2754"
, update =	"97.11 bibrelex"
}

@inproceedings{fbg-dtuaf-96
, author =	"Pascal J. Frey and H. Borouchaki and Paul-Louis George"
, title =	"Delaunay tetrahedrization using an advancing-front approach"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"31--43"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@book{fg-taef-99
, author =	"Pascal J. Frey and Paul-Louis George"
, title =	"Maillages. Applications aux {\'el\'ements} finis"
, publisher =	"Hermes"
, address =	"Paris, France"
, year =	1999
, update =	"01.07 devillers"
}

@techreport{ff-mrnti-
, author =	"W. Frey and D. Field"
, title =	"Mesh Relaxation: {A} new technique for improving triangulations"
, type =	"Research {Publication}"
, institution =	"General Motors"
, year =	"??"
, update =	"97.11 bibrelex"
}

@article{f-srnsa-87
, author =	"William H. Frey"
, title =	"Selective Refinement: {A} New Strategy For Automatic Node Placement In Graded Triangular Meshes"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	24
, number =	11
, month =	nov
, year =	1987
, pages =	"2183--2200"
, keywords =	"automatic node placement, graded triangular meshes, mesh generation"
, annote =	"Refines mesh by adding new point at $\rho O +
		 (1-\rho)I$ where $I$ is the incentre and $O$
		 circumcentre and $\rho =2r/R$. Mentions $r/R$ as
		 triangle quality measure."
, abstract =	"Automating triangular finite element mesh generation
		 involves two interrelated tasks: generating a
		 distribution of well-placed nodes on the boundary and
		 in the interior of a domain, and constructing a
		 triangulation of these nodes. For a given distribution
		 of nodes the Delaunay triangulation generally provides
		 a suitable mesh, and Watson's algorithm provides a
		 flexible means of constructing it. In this paper, a new
		 method is described for automating node placement in a
		 Delaunay triangulation by selective refinement of an
		 initial triangulation. Grading of the mesh is
		 controlled by an explicit or implicit node spacing
		 function. Although this paper describes the technique
		 only in the planar context the method generalizes to
		 three dimensions as well. (Author abstract) 26 refs."
}

@article{ff-mrnti-91
, author =	"William H. Frey and David A. Field"
, title =	"Mesh Relaxation. {A} New Technique For Improving Triangulations"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	31
, number =	6
, month =	may
, year =	1991
, pages =	"1121--1133"
, keywords =	"mathematical color shaded surface generation, mesh relaxation, laplacian smoothing techniques, planar domain triangulation"
, annote =	"Flips to get degrees of interior nodes as close to 6
		 as possible, then Laplacian smoothing. Mesh
		 irregularity is $\sum_k(d_k-6)^2$."
, abstract =	"Given a list of points defining a domain boundary, a
		 three-stage process is often used to triangulate a
		 domain. First, an appropriate distribution of interior
		 points is generated. Next the points are connected to
		 form triangles. And, finally, the connectivity data are
		 used to reposition the interior points using the
		 Laplacian smoothing technique, thereby usually
		 improving the shapes of the triangles. This paper
		 describes a new technique for mesh
		 improvement--adjusting the connection structure during
		 the second stage of this process. The new scheme, which
		 we call mesh relaxation, consists of a procedure for
		 iteratively making the mesh topology more regular by
		 edge swapping. For each interior edge, a relaxation
		 index is computed that depends on the degrees of its
		 end points and adjacent points. Any edge for which this
		 index exceeds a prescribed threshold will be swapped,
		 i.e. replaced by a new edge connecting the adjacent
		 points of the original edge. After all edge swaps are
		 completed, Laplacian smoothing is applied to the mesh.
		 Examples show that, when the mesh point density varies
		 smoothly and due care is taken in the vicinity of the
		 boundary, mesh relaxation can dramatically increase the
		 regularity of the mesh and produce improved triangle
		 shapes. (Author abstract)"
}

@inproceedings{ff-mrit-92
, author =	"William H. Frey and David A. Field"
, title =	"Mesh Relaxation For Improving Triangulations"
, booktitle =	"Proceedings of the SIAM Regional Conference on Geometric Aspects of Industrial Design"
, publisher =	"Soc. for Industrial \& Applied Mathematics"
, address =	"Philadelphia, PA"
, year =	1992
, pages =	"11--24"
, keywords =	"mesh relaxation, connection structure, edge swaps, laplacian smoothing, mesh point density, relaxation index"
, update =	"93.09 rote"
, annote =	"Uses min angle, max angle, and min (r/R) to measure
		 mesh quality."
, abstract =	"This paper describes a new technique for improving a
		 triangulation by modifying its connection structure.
		 The new scheme, which we call mesh relaxation, consists
		 of a systematic procedure for iteratively making the
		 mesh topology more regular by edge swapping. Interior
		 edges that are good candidates for swapping are
		 identified by computing a relaxation index for each
		 edge that depends on the degrees of its end points and
		 adjacent points. Any edge whose index exceeds a
		 prescribed threshold will be swapped, i.e. replaced by
		 a new edge connecting the points adjacent to the
		 original edge. After all edge swaps are completed,
		 Laplacian smoothing is applied to the mesh. Examples
		 show that when the mesh point density varies smoothly
		 and due care is taken in the vicinity of the boundary,
		 mesh relaxation can dramatically increase the
		 regularity of the connection structure and produce
		 improved triangle shapes. (Author abstract) 12 Refs."
}

@inproceedings{f-ubnhn-97
, author =	"Arne Frick"
, title =	"Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm"
, editor =	"Stephen North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"169--183"
, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
}

@inproceedings{fkv-ida-97
, author =	"A. Frick and C. Keskin and V. Vogelmann"
, title =	"Integration of Declarative Approaches"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"184--192"
, keywords =	"graph drawing, 3D"
, update =	"98.07 patrignani"
}

@inproceedings{flm-falau-95
, author =	"A. Frick and A. Ludwig and H. Mehldau"
, title =	"A Fast Adaptive Layout Algorithm for Undirected Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"388--403"
, keywords =	"graph drawing, force-directed, system"
, update =	"95.01 tamassia"
}

@book{f-eidg-82
, author =	"F. Fricker"
, title =	"Einf{\"u}hrung in die {Gitterpunktlehre}"
, publisher =	"Birkh{\"a}user"
, year =	1982
, update =	"97.11 bibrelex"
}

@article{f-cfemg-72
, author =	"I. Fried"
, title =	"Condition of finite element matrices generated from nonuniform meshes"
, journal =	"AIAA J."
, volume =	10
, year =	1972
, pages =	"219--221"
, update =	"97.11 bibrelex"
}

@article{f-fass-86
, author =	"A. Friedberg"
, title =	"Finding axes of skewed symmetry"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	34
, number =	2
, year =	1986
, pages =	"138--154"
, keywords =	"symmetry"
, update =	"95.09 korneenko"
}

@article{fw-spsrc-89
, author =	"J. Friedel and P. Widmayer"
, title =	"A simple proof of the {Steiner} ratio conjecture for five points"
, journal =	"SIAM J. Appl. Math."
, volume =	49
, number =	3
, year =	1989
, pages =	"960--967"
, keywords =	"Steiner tree, graphs"
, update =	"95.09 korneenko"
}

@inproceedings{fs-ddhsu-90
, author =	"O. Frieder and M. R. Stytz"
, title =	"Dynamic detection of hidden-surfaces using a {MIMD} multiprocessor"
, booktitle =	"Proc. Annu. IEEE Symp. Computer-Based Med. Syst."
, year =	1990
, pages =	"44--51"
, keywords =	"parallel computations, hidden line/serface elimination"
, update =	"95.09 korneenko"
}

@inproceedings{fhs-cmsp-89
, author =	"J. Friedman and J. Hershberger and J. Snoeyink"
, title =	"Compliant motion in a simple polygon"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"175--186"
, cites =	"b-ptcms-87, c-namrm-87, cr-nlbtr-87, ctv-flvat-88i, dghs-eafcr-88, d-cpcmp-88, d-edrrm-87, egs-oplms-86, e-ubfmp-86, em-esm-88, fw-pcm-88, fm-tspep-84, gy-fchsp-83, gss-gmppt-88, hm-ndsrs-82, k-osps-83, l-mpupb-88, lmt-asfms-84, lw-apcfp-79, m-olcch-87, n-moo-86, hss-pgcrm-87, tv-otats-88, ta-chapi-82, ZZZ"
, update =	"98.03 bibrelex"
}

@article{fhs-epcmp-96
, author =	"J. Friedman and J. Hershberger and J. Snoeyink"
, title =	"Efficiently planning compliant motion in the plane"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"562--599"
, update =	"96.09 smid"
}

@inproceedings{fhs-iscmp-90
, author =	"J. Friedman and J. Hershberger and J. Snoeyink"
, title =	"Input-sensitive compliant motion in the plane"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"225--237"
}

@inproceedings{fhs-cmtm-90
, author =	"J. Friedman and J. Hershberger and J. Snoeyink"
, title =	"On coordinated motion through a maze"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"120--124"
, cites =	"cr-nlbtr-87, d-cpcmp-90, em-esm-88, fhs-iscmp-90, gb-ompcc-75, hu-iatlc-79, lmt-asfms-84, n-moo-86, s-rbndt-70, hss-pgcrm-87, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@article{fbs-afnn-75
, author =	"J. H. Friedman and F. Baskett and L. J. Shustek"
, title =	"An algorithm for finding nearest neighbors"
, journal =	"IEEE Trans. Comput."
, volume =	"C-24"
, year =	1975
, pages =	"1000--1006"
}

@article{fbf-afbml-77
, author =	"J. H. Friedman and J. L. Bentley and R. A. Finkel"
, title =	"An algorithm for finding best matches in logarithmic expected time"
, journal =	"ACM Trans. Math. Softw."
, volume =	3
, year =	1977
, pages =	"209--226"
, keywords =	"range search"
}

@mastersthesis{f-zepud-85
, author =	"O. Fries"
, title =	"Zerlegung einer planaren {Unterteilung} der {Ebene} und ihre {Anwendungen}"
, type =	"M.{S}. Thesis"
, school =	"Inst. Angew. Math. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1985
, keywords =	"master thesis"
}

@inproceedings{fmn-dgds-85
, author =	"O. Fries and K. Mehlhorn and S. N{\"a}her"
, title =	"Dynamization of geometric data structures"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"168--176"
, cites =	"cg-fc-85, egs-oplms-84, hm-ndsrs-82, ia-dsisa-84, k-osps-83, lt-apst-77, lp-lppsi-77, l-dsorq-78, ms-hbt-79, m-dsa-84, vw-rlsil-82, w-ndsor-85, w-ndsor-78, ekz-diepq-77, l-fmprp-83, ZZZ"
, update =	"97.11 bibrelex"
}

@article{fmnt-ldsts-86
, author =	"O. Fries and K. Mehlhorn and S. N{\"a}her and A. Tsakalidis"
, title =	"A $\log\log n$ data structure for three-sided range queries"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1986
, pages =	"269--273"
}

@article{fmr-gml-91
, author =	"A. Frieze and C. McDiarmid and B. Reed"
, title =	"Greedy matching on the line"
, journal =	"SIAM J. Comput."
, volume =	19
, number =	4
, year =	1991
, pages =	"666--672"
, keywords =	"graph, matching, optimization"
, update =	"95.09 korneenko"
}

@inproceedings{fmt-sbpdc-92
, author =	"A. Frieze and G. Miller and S.-H. Teng"
, title =	"Separator Based Parallel Divide and Conquer in Computational Geometry"
, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
, year =	1992
, pages =	"??"
, update =	"93.09 rote"
}

@article{fp-iglc-89
, author =	"J. C. Frinkle and R. P. Paul"
, title =	"The initial grasp liftability chart"
, journal =	"Internat. J. Robot. Autom."
, volume =	5
, number =	1
, year =	1989
, pages =	"47--52"
, keywords =	"grasp"
, update =	"95.09 korneenko"
}

@book{fp-cst-90
, author =	"R. Fritsch and R. A. Piccinini"
, title =	"Cellular Structures in Topology"
, publisher =	"Cambridge University Press"
, year =	1990
, update =	"98.07 bibrelex"
}

@inproceedings{fw-digvs-95
, author =	"M. Fr{\"o}hlich and M. Werner"
, title =	"Demonstration of the Interactive Graph-Visualization System {\em daVinci}"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"266--269"
, keywords =	"graph drawing, system"
, update =	"95.01 tamassia"
}

@book{fgs-tddea-90
, author =	"C. Froidevaux and M. C. Gaudel and M. Soria"
, title =	"Type de donn{\'e}es et algorithmes"
, publisher =	"McGraw-Hill"
, address =	"Paris"
, year =	1990
, keywords =	"algorithms, complexity, data type"
, update =	"93.09 devillers"
}

@article{ft-csmet-88
, author =	"H. J. Frost and C. V. Thompson"
, title =	"Computer simulation of microstructural evolution in thin films"
, journal =	"J. Electronic Materials"
, volume =	"??"
, year =	1988
, update =	"97.11 bibrelex"
}

@inproceedings{ft-dmtf-87
, author =	"H. J. Frost and C. V. Thompson"
, title =	"Development of microstructure in thin films"
, booktitle =	"Proc. SPIE"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{f-gdtga-49
, author =	"R. Frucht"
, title =	"Graphs of Degree Three with a given Abstract Group"
, journal =	"Canad. J. Math."
, volume =	1
, year =	1949
, pages =	"365--378"
, update =	"97.11 bibrelex"
}

@article{f-hdg-70
, author =	"R. Frucht"
, title =	"How to Describe a Graph"
, journal =	"Ann. New York Acad. Sci."
, volume =	175
, year =	1970
, pages =	"159--167"
, update =	"97.11 bibrelex"
}

@article{f-grg-49
, author =	"R. Frucht"
, title =	"On the Groups of Repeated Graphs"
, journal =	"Bull. Amer. Math. Soc."
, volume =	55
, year =	1949
, pages =	"418--420"
, update =	"97.11 bibrelex"
}

@article{fr-gdfdp-91
, author =	"T. Fruchterman and E. Reingold"
, title =	"Graph Drawing by Force-Directed Placement"
, journal =	"Softw. -- Pract. Exp."
, volume =	21
, number =	11
, year =	1991
, pages =	"1129--1164"
, keywords =	"graph drawing"
, update =	"95.05 tamassia, 93.09 tamassia"
}

@article{fbr-accab-89
, author =	"B. Fruhwirth and R. E. Burkard and G{\"u}nter Rote"
, title =	"Approximation of convex curves with application to the bicriteral minimum cost flow problem"
, journal =	"European J. Oper. Res."
, volume =	42
, year =	1989
, pages =	"326--338"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@article{fl-mstmp-91
, author =	"J.-J. Fu and R. C. T. Lee"
, title =	"Minimal spanning trees of moving points in the plane"
, journal =	"IEEE Trans. Comput."
, volume =	"C-40"
, number =	1
, year =	1991
, pages =	"113--118"
, keywords =	"graphs, closeness, minimal spanning tree, points"
, update =	"95.09 agarwal+korneenko"
}

@inproceedings{fl-vdmpp-90
, author =	"Jyh-Jong Fu and R. C. T. Lee"
, title =	"{Voronoi} Diagrams of Moving Points in the Plane"
, booktitle =	"Proc. 10th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1990
, pages =	"238--254"
, precedes =	"fl-vdmpp-91"
, update =	"96.09 agarwal"
}

@article{fl-vdmpp-91
, author =	"J.-J. Fu and R. C. T. Lee"
, title =	"Voronoi diagrams of moving points in the plane"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	1
, year =	1991
, pages =	"23--32"
, succeeds =	"fl-vdmpp-90"
}

@article{fl-eafcf-90
, author =	"L.-C. Fu and D.-Y. Liu"
, title =	"An efficient algorithm for finding a collision-free path among polyhedral obstacles"
, journal =	"J. Robot. Syst."
, volume =	"??"
, year =	1990
, keywords =	"motion planning"
, update =	"95.09 korneenko"
}

@article{fag-nrtsd-83
, author =	"H. Fuchs and G. D. Abrams and E. D. Grant"
, title =	"Near Real-Time Shaded Display of Rigid Objects"
, journal =	"Comput. Graph."
, volume =	17
, number =	3
, year =	1983
, pages =	"65--72"
, note =	"Proc. SIGGRAPH '83"
, update =	"97.11 bibrelex"
}

@article{fkn-vsgpt-80
, author =	"H. Fuchs and Z. M. Kedem and B. Naylor"
, title =	"On visible surface generation by a priori tree structures"
, journal =	"Comput. Graph."
, volume =	14
, number =	3
, year =	1980
, pages =	"124--133"
, note =	"Proc. SIGGRAPH '80"
}

@article{fku-osrpc-77
, author =	"H. Fuchs and Z. M. Kedem and S. P. Uselton"
, title =	"Optimal surface reconstruction from planar contours"
, journal =	"Commun. ACM"
, volume =	20
, year =	1977
, pages =	"693--702"
}

@article{fpeggemtti-pp5hm-89
, author =	"H. Fuchs and J. Poulton and J. Eyles and T. Greer and J. Goldfeather and D. Ellsworth and S. Molnar and G. Turk and B. Tebbs and L. Israel"
, title =	"Pixel-planes 5: {A} heterogeneous multiprocessor graphics system using processor-enhanced memories"
, journal =	"Comput. Graph."
, volume =	23
, number =	3
, year =	1989
, pages =	"79--88"
, note =	"Proc. SIGGRAPH '89"
, update =	"98.03 bibrelex"
}

@article{f-nmc-71
, author =	"M. Fuchs"
, title =	"A note on mapping cylinders"
, journal =	"Mich. Math. J."
, volume =	18
, year =	1971
, pages =	"289--290"
, update =	"98.03 bibrelex"
}

@article{f-fshc-87
, author =	"S. F{\"u}dadi"
, title =	"Fixing system and homothetic covering"
, journal =	"Acta Math. Acad. Sci. Hungar."
, volume =	50
, year =	1987
, pages =	"203--225"
, update =	"96.09 devillers, 95.09 korneenko"
}

@article{fh-cpgcs-96
, author =	"I. Fudos and C. Hoffmann"
, title =	"Correctness proof of a geometric constraint solver"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"405--420"
, update =	"97.03 devillers"
}

@article{fh-gcass-97
, author =	"I. Fudos and C. M. Hoffmann"
, title =	"A Graph-constructive Approach to Solving Systems of Geometric Constraints"
, journal =	"ACM Trans. Graph."
, volume =	16
, number =	2
, month =	apr
, year =	1997
, pages =	"179--216"
, update =	"97.11 held"
}

@inproceedings{f-trprp-97
, author =	"Artur Fuhrmann"
, title =	"Testing Roundness of a Polytope and Related Problems"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"169--174"
, update =	"97.11 jones"
}

@techreport{f-pmtve-91
, author =	"K. Fujimura"
, title =	"On Planning Motion in a Time-Varying Environment"
, institution =	"Oak Ridge National Laboratory"
, year =	1991
, keywords =	"motion planing, time-dependent obstacles, time-minimal motion"
, update =	"93.09 milone+mitchell"
}

@techreport{fk-prais-84
, author =	"K. Fujimura and T. L. Kunii"
, title =	"A polytree; representation and algorithms to integrate solid and boundary models"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Inform. Sci., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1984
}

@article{fs-hsppm-89
, author =	"K. Fujimura and H. Samet"
, title =	"A hierarchical strategy for path planning among moving obstacles"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	5
, number =	1
, month =	feb
, year =	1989
, pages =	"61--19"
, update =	"96.05 efrat"
}

@inproceedings{fs-anapp-88
, author =	"K. Fujimura and H. Samet"
, title =	"Accessibility: A New Approach to Path Planning among Moving Obstacles"
, booktitle =	"Proceedings of the CVPR88 Conference"
, site =	"Ann Arbor, Michigan"
, month =	jun
, year =	1988
, pages =	"803--807"
, update =	"96.05 efrat"
}

@inproceedings{fs-mpdd-90
, author =	"K. Fujimura and H. Samet"
, title =	"Motion planning in a dynamic domain"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Cincinnati, OH"
, volume =	1
, month =	may
, year =	1990
, pages =	"324--330"
, update =	"96.05 efrat"
}

@inproceedings{fs-ppmou-88
, author =	"K. Fujimura and H. Samet"
, title =	"Path Planning among Moving Obstacles Using Spatial Indexing"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Philadelphia, Pennsylvania"
, month =	apr
, year =	1988
, pages =	"1662--1667"
, update =	"96.05 efrat"
}

@article{fs-ptmmm-93
, author =	"K. Fujimura and H. Samet"
, title =	"Planning a Time-Minimal Motion among Moving Obstacles"
, journal =	"Algorithmica"
, volume =	10
, year =	1993
, pages =	"41--63"
, update =	"96.05 efrat"
}

@techreport{fs-tmpmo-88
, author =	"K. Fujimura and H. Samet"
, title =	"Time-Minimal Paths Among Moving Obstacles"
, type =	"Technical {Report}"
, number =	"CS-TR-2124"
, institution =	"Computer Science, Univ. of Maryland"
, year =	1988
, update =	"93.09 milone+mitchell"
}

@inproceedings{fs-tmpmo-89
, author =	"K. Fujimura and H. Samet"
, title =	"Time-Minimal Paths Among Moving Obstacles"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Scottsdale, Arizona"
, month =	may
, year =	1989
, pages =	"1110--1115"
, update =	"96.05 efrat"
}

@inproceedings{ftyk-oasm-83
, author =	"K. Fujimura and H. Toriya and K. Tamaguchi and T. L. Kunii"
, title =	"Octree algorithms for solid modeling"
, booktitle =	"Proc. Intergraphics '83"
, volume =	"B2-1"
, year =	1983
, pages =	"1--15"
, update =	"97.11 bibrelex"
}

@inproceedings{ftyk-eotds-83
, author =	"K. Fujimura and H. Toriya and K. Yamaguchi and T. L. Kunii"
, title =	"An enhanced oct-tree data structure and operation for solid modeling"
, booktitle =	"Proc. Comput. Aided Geom. Modeling Sympos."
, site =	"Hampton"
, month =	apr
, year =	1983
, update =	"97.11 bibrelex"
}

@article{f-skgk-20
, author =	"M. Fujiwara"
, title =	"Ein Satz {\"uber} konvexe geschlosene Kurven"
, journal =	"Sci. Repts. {T\^hoku} Univ."
, volume =	9
, year =	1920
, pages =	"289--294"
, update =	"98.11 bibrelex"
}

@article{fn-rtisa-90
, author =	"H. Fujiware and K. Nakagawa"
, title =	"Real-time image subtraction and addition using two cross-polarized phase-conjugate waves"
, journal =	"Optics Commun."
, volume =	79
, number =	"1,2"
, year =	1990
, pages =	"6--10"
, update =	"97.11 bibrelex"
}

@techreport{fp-jtgp-89
, author =	"Hidetosi Fukagawa and Dan Pedoe"
, title =	"Japanese Temple Geometry Problems"
, institution =	"The Charles Babbage Research Centre"
, address =	"Winnipeg"
, year =	1989
, update =	"98.11 bibrelex"
}

@incollection{fs-amgfe-72
, author =	"J. Fukuda and J. Suhara"
, title =	"Automatic Mesh Generation for Finite Element Analysis"
, editor =	"J. T. Oden and R. W. Clough and Y. Yamamoto"
, booktitle =	"Advances in Computational Methods in Structural Mechanics and Design"
, publisher =	"UAU Press"
, address =	"Hunstville, Alabama"
, year =	1972
, annote =	"Two phases. First randomly generates points in polygon
		 to required density, then triangulates points by
		 horribly complicated algorithm. Picks five points
		 minimizing triangle edge length. Discards triangle
		 intersecting or containing. Then picks point making
		 this triangle and the next one as equilateral as
		 possible."
}

@manual{f-crmv0-
, author =	"K. Fukuda"
, title =	"CDD Reference Manual, Version 0.52b"
, organization =	"EPFL"
, address =	"Lausanne, Switzerland"
, update =	"98.03 bibrelex"
}

@phdthesis{f-omp-82
, author =	"K. Fukuda"
, title =	"Oriented Matroid Programming"
, school =	"University of Waterloo"
, year =	1982
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@article{flm-abalv-97
, author =	"K. Fukuda and T. Liebling and F. Margot"
, title =	"Analysis of backtrack algorithms for listig all vertices and all faces of a convex polyhedron"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"1--12"
, update =	"97.07 devillers"
}

@article{fll-ech-01
, author =	"K. Fukuda and T. M. Liebling and C. L{\"u}tolf"
, title =	"Extended convex hull"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"13--23"
, update =	"01.11 smid"
}

@article{fm-fccm-91
, author =	"K. Fukuda and T. Matsui"
, title =	"On the finiteness of the criss-cross method"
, journal =	"European J. Oper. Res."
, volume =	52
, year =	1991
, pages =	"119--124"
, update =	"97.03 gaertner+salinger"
}

@article{fr-cfecp-94
, author =	"K. Fukuda and V. Rosta"
, title =	"Combinatorial face enumeration in convex polytopes"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"191--198"
, update =	"96.09 devillers"
}

@inproceedings{fst-cfeao-89
, author =	"K. Fukuda and S. Saito and A. Tamura"
, title =	"Combinatorial face enumeration in arrangements and oriented matroids"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	4
, precedes =	"fst-cfeao-91"
, update =	"95.09 korneenko"
}

@article{fst-cfeao-91
, author =	"K. Fukuda and S. Saito and A. Tamura"
, title =	"Combinatorial face enumeration in arrangements and oriented matroids"
, journal =	"Discrete Appl. Math."
, volume =	31
, number =	2
, year =	1991
, pages =	"141--149"
, keywords =	"comb, arrangement, sphereset, hyperplaneset, flat, matroid, $n$-dimensional"
, succeeds =	"fst-cfeao-89"
, update =	"95.09 korneenko"
}

@inproceedings{fstt-bnkfa-89
, author =	"K. Fukuda and S. Saito and A. Tamura and T. Tokuyama"
, title =	"Bounding the number of $k$-faces in arrangements of hyperplanes"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	3
, precedes =	"fstt-bnkfa-91"
, update =	"97.11 bibrelex, 95.09 korneenko"
}

@article{fstt-bnkfa-91
, author =	"K. Fukuda and S. Saito and A. Tamura and T. Tokuyama"
, title =	"Bounding the number of $k$-faces in arrangements of hyperplanes"
, journal =	"Discrete Appl. Math."
, volume =	31
, number =	2
, year =	1991
, pages =	"151--165"
, keywords =	"comb, arrangement, hyperplaneset, flat, sphereset, matroid, face, $n$-dimensional"
, succeeds =	"fstt-bnkfa-89"
, update =	"97.11 bibrelex, 95.09 korneenko"
}

@article{fn-bback-75
, author =	"K. Fukunaga and P. M. Narendra"
, title =	"A branch and bound algorithm for computing $k$-nearest neighbors"
, journal =	"IEEE Trans. Comput."
, volume =	"C-24"
, year =	1975
, pages =	"750--753"
}

@article{f-ipcfc-74
, author =	"B. E. Fullbright"
, title =	"Intersectional properties of certain families of compact convex sets"
, journal =	"Pacific J. Math."
, volume =	50
, year =	1974
, pages =	"57--62"
, update =	"97.11 bibrelex"
}

@book{f-it-84
, author =	"W. Fulton"
, title =	"Intersection Theory"
, publisher =	"Springer-Verlag"
, year =	1984
, update =	"97.11 bibrelex"
}

@techreport{fntv-sltjs-88
, author =	"K. Y. Fung and T. M. Nicholl and R. E. Tarjan and C. J. {Van Wyk}"
, title =	"Simplified linear-time {Jordan} sorting and polygon clipping"
, type =	"Technical {Report}"
, number =	"CS-TR-189-88"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1988
, precedes =	"fntv-sltjs-90"
}

@article{fntv-sltjs-90
, author =	"K. Y. Fung and T. M. Nicholl and R. E. Tarjan and C. J. {Van Wyk}"
, title =	"Simplified linear-time {Jordan} sorting and polygon clipping"
, journal =	"Inform. Process. Lett."
, volume =	35
, year =	1990
, pages =	"85--92"
, succeeds =	"fntv-sltjs-88"
}

@inproceedings{fm-llook-00
, author =	"Stefan Funke and Kurt Mehlhorn"
, title =	"LOOK: A Lazy Object-Oriented Kernel for Geometric Computation"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"156--165"
, update =	"00.11 jones"
}

@inproceedings{fst-mladi-92
, author =	"T. Funkhouser and C. S{\'e}quin and S. Teller"
, title =	"Management of Large Amounts of Data in Interactive Building Walkthroughs"
, booktitle =	"Proc. 1992 Workshop on Interactive 3D Graphics"
, year =	1992
, pages =	"11--20"
, update =	"97.11 bibrelex"
}

@article{f-rpddc-86
, author =	"Z. F{\"u}redi"
, title =	"Random polytopes in the $d$-dimensional cube"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"315--319"
}

@article{f-dpecp-91
, author =	"Z. F{\"u}redi"
, title =	"The densest packing of equal circles into a parallel strip"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"95--106"
}

@article{f-mnudc-90
, author =	"Z. F{\"u}redi"
, title =	"The maximum number of unit distances in a convex $n$-gon"
, journal =	"J. Combin. Theory Ser. A"
, volume =	55
, year =	1990
, pages =	"316--320"
, keywords =	"combinatorial geometry, convex"
}

@techreport{fh-dstm-89
, author =	"Z. F{\"u}redi and P. Hajnal"
, title =	"Davenport-Schinzel Theory of Matrices"
, type =	"Technical {Report}"
, institution =	"DIMACS, Rutgers Univ."
, year =	1989
, update =	"95.09 agarwal, 93.09 milone+mitchell"
}

@article{fh-dstm-92
, author =	"Z. F{\"u}redi and P. Hajnal"
, title =	"{Davenport}-{Schinzel} Theory of Matrices"
, journal =	"Discrete Math."
, volume =	103
, year =	1992
, pages =	"233--251"
, update =	"95.09 agarwal, 93.09 milone+mitchell"
}

@article{fk-pyp-94
, author =	"Z. {F\"uredi} and D. Kleitman"
, title =	"The prison yard problem"
, journal =	"Combinatorica"
, volume =	14
, year =	1994
, pages =	"287--300"
, update =	"97.07 orourke"
}

@inproceedings{fhkr-owpas-92
, author =	"M. F{\"u}rer and X. He and M.-Y. Kao and B. Raghavachari"
, title =	"${O}(n \log\log n)$-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs"
, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
, year =	1992
, pages =	"410--419"
, keywords =	"graph drawing, planar, straight-line, grid, parallel"
, update =	"96.09 tamassia"
}

@inproceedings{fr-amdst-92
, author =	"M. Furer and B. Raghavachari"
, title =	"Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '92"
, year =	1992
, pages =	"317--324"
, update =	"99.07 bibrelex, 98.07 bibrelex"
}

@inproceedings{fhl-ptapg-80
, author =	"M. Furst and J. Hopcroft and E. Luks"
, title =	"Polynomial Time Algorithm for Permutation Groups"
, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1980
, pages =	"36--41"
, update =	"97.11 bibrelex"
}

@article{fa-rcfsc-96
, author =	"M. Furukata and K. Asano"
, title =	"Reporting the crossing-free segments of a complete graph"
, journal =	"Internat. J. Comput. Math."
, volume =	62
, year =	1996
, pages =	"163--170"
, update =	"97.03 smid"
}

@article{frt-ftclr-93
, author =	"D. Fussell and V. Ramachandran and R. Thurimella"
, title =	"Finding Triconnected Components by Local Replacement"
, journal =	"SIAM J. Comput."
, volume =	26
, number =	3
, year =	1993
, pages =	"587--616"
, keywords =	"parallel algorithm, triconnectivity, PRAM, graph, vertex connectivity"
, succeeds =	"frt-ftclr-89"
, update =	"98.07 patrignani"
}

@inproceedings{frt-ftclr-89
, author =	"D. Fussell and V. Ramachandran and R. Thurimella"
, title =	"Finding Triconnected Components by Local Replacements"
, booktitle =	"Automata, Languages and Programming (Proc. 16th ICALP)"
, series =	"Lecture Notes Comput. Sci."
, volume =	372
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"379--393"
, precedes =	"frt-ftclr-93"
, update =	"98.07 patrignani, 96.05 agarwal, 95.01 tamassia"
}

@inproceedings{ghs-rcgpt-85
, author =	"C. P. Gabor and W.-L. Hsu and K. J. Supowit"
, title =	"Recognizing circle graphs in polynomial time"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"106--116"
, keywords =	"circles, graph theory"
, precedes =	"ghs-rcgpt-89"
}

@article{ghs-rcgpt-89
, author =	"C. P. Gabor and W.-L. Hsu and K. J. Supowit"
, title =	"Recognizing circle graphs in polynomial time"
, journal =	"J. ACM"
, volume =	36
, year =	1989
, pages =	"435--473"
, succeeds =	"ghs-rcgpt-85"
}

@inproceedings{gt-ltasc-83
, author =	"H. Gabow and R. Tarjan"
, title =	"A linear time algorithm for a special case of disjoint set union"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
, year =	1983
, pages =	"246--251"
, update =	"98.07 bibrelex"
}

@article{gt-ltasc-85
, author =	"H. Gabow and R. Tarjan"
, title =	"A linear time algorithm for a special case of disjoint set union"
, journal =	"J. Comput. Syst. Sci."
, volume =	30
, year =	1985
, pages =	"209--221"
, update =	"97.11 bibrelex"
}

@article{gt-fsanp-89
, author =	"H. Gabow and R. Tarjan"
, title =	"Faster scaling algorithms for network problems"
, journal =	"SIAM J. Comput."
, volume =	18
, year =	1989
, pages =	"1013--1036"
, update =	"97.11 bibrelex"
}

@inproceedings{gbt-srtgp-84
, author =	"H. N. Gabow and J. L. Bentley and R. E. Tarjan"
, title =	"Scaling and related techniques for geometry problems"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"135--143"
}

@article{ggst-eamst-86
, author =	"H. N. Gabow and Z. Galil and T. H. Spencer and R. E. Tarjan"
, title =	"Efficient Algorithms for Minimum Spanning Trees on Directed and Undirected Graphs"
, journal =	"Combinatorica"
, volume =	6
, year =	1986
, pages =	"109--122"
, update =	"97.11 bibrelex"
}

@article{gt-ltafm-88
, author =	"H. N. Gabow and R. E. Tarjan"
, title =	"A linear-time algorithm for finding a minimum spanning pseudoforest"
, journal =	"Inform. Process. Lett."
, volume =	27
, year =	1988
, pages =	"259--263"
, update =	"98.07 bibrelex"
}

@article{gs-nsagv-69
, author =	"K. R. Gabriel and R. R. Sokal"
, title =	"A new statistical approach to geographic variation analysis"
, journal =	"Systematic Zoology"
, volume =	18
, year =	1969
, pages =	"259--278"
}

@article{gv-cssps-95
, author =	"A. Gabrielov and N. Vorobjov"
, title =	"Complexity of stratification of semi-pfaffian sets"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"71--91"
, update =	"98.03 agarwal"
}

@techreport{gz-fgnim-86
, author =	"M. E. Gaddis and M. J. Zyda"
, title =	"The fractal geometry of nature: its mathematical basis and application to computer graphics"
, type =	"Report"
, number =	"NPS52-86-008"
, institution =	"Naval Postgraduate School"
, address =	"Monterey, CA"
, year =	1986
}

@inproceedings{g-prpt-93
, author =	"Noud Gademann"
, title =	"Linear Programming in Random Polynomial Time"
, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
, month =	jun
, year =	1993
, pages =	"??"
, update =	"00.03 devillers, 93.09 milone+mitchell"
}

@article{gg-mam-98
, author =	"V. Gaede and O. G{\"u}nther"
, title =	"Multidimensional Access Methods"
, journal =	"ACM Comput. Surv."
, volume =	30
, year =	1998
, pages =	"170--231"
, keywords =	"survey paper"
, update =	"98.11 pocchiola"
}

@techreport{go-nhpcg-93t
, author =	"A. Gajentaan and M. Overmars"
, title =	"$n^2$-Hard Problems in Computational Geometry"
, type =	"manuscript"
, year =	1993
, precedes =	"go-nhpcg-93, go-copcg-95"
, update =	"98.11 bibrelex"
}

@techreport{go-nhpcg-93
, author =	"A. Gajentaan and M. H. Overmars"
, title =	"$n^2$-Hard Problems in Computational Geometry"
, type =	"Report"
, number =	"RUU-CS-93-15"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, month =	apr
, year =	1993
, succeeds =	"go-nhpcg-93t"
, update =	"98.11 bibrelex, 93.09 erickson+goodrich+milone+mitchell"
}

@article{go-copcg-95
, author =	"A. Gajentaan and M. H. Overmars"
, title =	"On a class of ${O}(n^2)$ problems in computational geometry"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"165--185"
, succeeds =	"go-nhpcg-93t"
, update =	"99.07 smid, 98.11 bibrelex, 96.01 smid"
}

@incollection{g-csg-89
, author =	"Shmuel Gal"
, title =	"Continous Search Games"
, booktitle =	"Search theory: some recent developments."
, series =	"Lecture Notes in pure and applied mathematics"
, volume =	112
, publisher =	"Dekker"
, address =	"New York, NY"
, year =	1989
, pages =	"33--53"
, update =	"00.03 bibrelex"
}

@book{g-sg-80
, author =	"Shmuel Gal"
, title =	"Search Games"
, series =	"Mathematics in Science and Engeneering"
, volume =	149
, publisher =	"Academic Press"
, address =	"New York"
, year =	1980
, update =	"98.07 bibrelex+icking"
}

@article{g-hsli-69
, author =	"D. Gala"
, title =	"How to solve linear inequalities"
, journal =	"Amer. Math. Monthly"
, volume =	76
, year =	1969
, pages =	"589--599"
, update =	"93.09 milone+mitchell"
}

@article{g-cpcli-51
, author =	"D. Gale"
, title =	"Convex Polyhedral Cones and Linear Inequalities"
, journal =	"Cowles Commission Monograph"
, volume =	13
, year =	1951
, pages =	"287--297"
, update =	"97.11 bibrelex"
}

@incollection{g-ncp-63
, author =	"D. Gale"
, title =	"Neighborly and cyclic polytopes"
, editor =	"V. Klee"
, booktitle =	"Convexity"
, series =	"Proc. Symp. Pure Math."
, volume =	7
, publisher =	"American Mathematical Society"
, year =	1963
, pages =	"225--232"
, update =	"97.11 bibrelex"
}

@inproceedings{g-namfp-87
, author =	"Z. Galil"
, title =	"A new algorithm for the maximal flow problem"
, booktitle =	"Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
, month =	oct
, year =	1987
, pages =	"231--245"
, update =	"98.03 bibrelex"
}

@article{gg-sudpa-89
, author =	"Z. Galil and R. Giancarlo"
, title =	"Speeding Up Dynamic Programming with Applications to Molecular Biology"
, journal =	"Theoret. Comput. Sci."
, volume =	64
, year =	1989
, pages =	"107--118"
}

@article{gi-dsads-91
, author =	"Z. Galil and G. F. Italiano"
, title =	"Data Structures and Algorithms for Disjoint Set Union Problems"
, journal =	"ACM Comput. Surv."
, volume =	23
, number =	3
, year =	1991
, pages =	"319--344"
, update =	"97.03 tamassia"
}

@inproceedings{gi-fdaec-91
, author =	"Z. Galil and G. F. Italiano"
, title =	"Fully Dynamic Algorithms for Edge Connectivity Problems"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"317--327"
, update =	"98.07 tamassia+vismara, 94.01 tamassia"
}

@inproceedings{gi-mbcdp-91
, author =	"Z. Galil and G. F. Italiano"
, title =	"Maintaining Biconnected Components of Dynamic Planar Graphs"
, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	510
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"339--350"
, update =	"93.09 rote"
}

@inproceedings{gis-fdpt-92
, author =	"Z. Galil and G. F. Italiano and N. Sarnak"
, title =	"Fully dynamic planarity testing"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"495--506"
}

@article{gm-fsapo-79
, author =	"Z. Galil and N. Megiddo"
, title =	"A fast selection algorithm and the problem of optimum distribution of effort"
, journal =	"J. ACM"
, volume =	26
, year =	1979
, pages =	"58--64"
, update =	"98.07 mitchell, 97.11 bibrelex"
}

@article{gm-ahle-69
, author =	"R. Galimberti and U. Montanari"
, title =	"An algorithm for hidden-line elimination"
, journal =	"Commun. ACM"
, volume =	12
, year =	1969
, pages =	206
}

@techreport{gk-mpcd2-84
, author =	"V. V. Galitsky and A. A. Kzylov"
, title =	"Modelling of plant community dynamics: $2$-d model of one-species even-aged community"
, type =	"Report"
, number =	"??"
, institution =	"Sci. Center Sislogical Res., Inst. Soil Sci. Photosynthesis, USSR Acad. Sci."
, year =	1984
, pages =	"480--485"
}

@techreport{gm-vmpca-81
, author =	"V. V. Galitsky and E. V. Mironenko"
, title =	"Voronoi {Mosaic} on the plane, construction algorithm: materials on software"
, type =	"Report"
, number =	"??"
, institution =	"Sci. Center Sislogical Res., Inst. Soil Sci. Photosynthesis, USSR Acad. Sci."
, year =	1981
}

@article{g-spn4-44
, author =	"T. Gallai"
, title =	"Solution to Problem No 4065"
, journal =	"Amer. Math. Monthly"
, volume =	51
, year =	1944
, pages =	"169--171"
, succeeds =	"e-pn4-44"
, update =	"98.07 devillers"
}

@article{gf-iea-64
, author =	"B. A. Galler and M. J. Fischer"
, title =	"An Improved Equivalence Algorithm"
, journal =	"Commun. ACM"
, volume =	7
, year =	1964
, pages =	"301--303"
, update =	"98.03 bibrelex"
}

@inproceedings{g-dcrs-97
, author =	"J. Gallier"
, title =	"Drawing closed rational surfaces"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"370--372"
, cites =	"a-tdmrt-41, br-tdarp-94, br-frrpc-95, b-g-87, f-cscag-93, f-ncspg-95, fj-cesr-89, fj-csr-92, g-adcrs-96, g-csgai-97, hl-cagd-93, r-bcdas-87, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{g-adcrs-96
, author =	"J. H. Gallier"
, title =	"Algorithms for drawing closed rational surfaces"
, type =	"Technical {Report}"
, institution =	"Univ. Pennsylvania"
, address =	"Philadelphia, PA"
, year =	1996
, update =	"98.07 bibrelex"
}

@techreport{g-csgai-97
, author =	"J. H. Gallier"
, title =	"Curves and surfaces: {Geometry}, algorithms, and implementation in {Mathematica}"
, type =	"Technical {Report}"
, institution =	"Univ. Pennsylvania"
, address =	"Philadelphia, PA"
, year =	1997
, update =	"98.07 bibrelex"
}

@article{ggt-fpmfa-89
, author =	"G. Gallo and M. D. Grigoriadis and R. E. Tarjan"
, title =	"A fast parametric maximum flow algorithm"
, journal =	"SIAM J. Comput."
, volume =	18
, year =	1989
, pages =	"30--55"
, update =	"97.11 bibrelex"
}

@incollection{gm-eabwr-91
, author =	"G. Gallo and B. Mishra"
, title =	"Efficient algorithms and bounds for {Wu}-{Ritt} characteristic sets"
, editor =	"T. Mora and C. Traverso"
, booktitle =	"Effective Methods on Algebraic Geometry"
, series =	"Progress in Mathematics"
, volume =	94
, publisher =	"Birkh{\"a}user"
, year =	1991
, pages =	"119--142"
, update =	"98.03 bibrelex"
}

@article{gkt-lioppb-95
, author =	"G. Galperin and T. Kr{\"u}ger and S. Troubetzkoy"
, title =	"Local instability of orbits in polygonal and polyhedral billiards"
, journal =	"Commun. Math. Phys."
, volume =	169
, year =	1995
, pages =	"463--473"
, update =	"01.04 orourke"
}

@inproceedings{gg-pwmsp-96
, author =	"Jerome Galtier and Paul Louis George"
, title =	"Prepartitioning as a way to mesh subdomains in parallel"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"107--121"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{gp-pfpt-99
, author =	"J{\'e}r{\^o}me Galtier and St{\'e}phane Perennes"
, title =	"Parallel Flips on Planar Triangulations"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"81--86"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@misc{ghj-gpma-67
, author =	"R. Gambini and D. L. Huff and G. F. Jenks"
, title =	"Geometric properties of market areas"
, howpublished =	"Regional Science Association: Papers"
, year =	1967
, update =	"97.11 bibrelex"
}

@techreport{gt-amatd-85
, author =	"G. Gambosi and M. Talamo"
, title =	"An application of $m$-ary trees to the design of data structures for geometric searching problems"
, type =	"Report"
, number =	"??"
, institution =	"Centro Nazionale Ricerche, Instituto Analisi Sistemi Inform."
, year =	1985
}

@book{ghjv-dp-95
, author =	"Erich Gamma and Richard Helm and Ralph Johnson and John Vlissides"
, title =	"Design Patterns"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1995
, keywords =	"object-oriented programming, patterns, reuse"
, update =	"97.03 tamassia"
}

@article{gd-ngtmp-82
, author =	"S. Ganapathy and T. G. Dennehy"
, title =	"A new general triangulation method for planar contours"
, journal =	"ACS Trans. Comput. Graph."
, volume =	16
, year =	1982
, pages =	"69--75"
, update =	"98.03 bibrelex"
}

@article{gt-admff-86
, author =	"M. V. Gandhi and B. S. Thompson"
, title =	"Automated design of modular fixtures for flexible manufacturing systems"
, journal =	"J. of Manufacturing Systems"
, volume =	5
, number =	4
, year =	1986
, update =	"98.03 bibrelex"
}

@phdthesis{g-cpsps-01
, author =	"Pierre-Marie Gandoin"
, title =	"Compression progressive sans perte de structures g{\'e}om{\'e}triques"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"universit\'e de {Nice-Sophia Antipolis}"
, address =	"France"
, year =	2001
, keywords =	"doctoral thesis"
, update =	"02.03 devillers"
}

@book{gs-ssa-79
, author =	"G. Gane and T. Sarson"
, title =	"Structured Systems Analysis"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1979
, update =	"98.07 vismara, 98.03 bibrelex, 95.01 tamassia"
}

@inproceedings{gc-fdpae-94
, author =	"J. L. Ganley and J. P. Cohoon"
, title =	"A faster dynamic programming algorithm for exact rectilinear {Steiner} minimal trees"
, booktitle =	"Proc. 4th Great Lakes Sympos. VLSI"
, year =	1994
, pages =	"238--241"
, update =	"98.11 bibrelex"
}

@article{gc-icors-97
, author =	"J. L. Ganley and J. P. Cohoon"
, title =	"Improved Computation of Optimal Rectilinear {Steiner} Minimal Trees"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"457--472"
, succeeds =	"gc-orsmt-94"
, update =	"98.11 devillers"
}

@inproceedings{gc-orsmt-94
, author =	"J. L. Ganley and J. P. Cohoon"
, title =	"Optimal Rectilinear {Steiner} Minimal Trees in {$O(n^2 2.62^n)$} Time"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"308--313"
, precedes =	"gc-icors-97"
, cites =	"ch-ecsmt-86, ch-icpsm-92, dw-spg-72, gc-fdpae-94, gj-rstpi-77, h-sprd-66, hu-iatlc-79, h-smtrd-76, sw-ersta-93, s-hfsmt-92, tac-rsmw-92, w-aspep-85, hrw-stp-92, ZZZ"
, update =	"98.11 bibrelex+devillers, 94.09 jones"
}

@article{gknv-tddg-93
, author =	"E. R. Gansner and E. Koutsofios and S. C. North and K. P. Vo"
, title =	"A Technique for Drawing Directed Graphs"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	19
, year =	1993
, pages =	"214--230"
, keywords =	"graph drawing"
, update =	"95.05 tamassia, 93.09 tamassia"
}

@inproceedings{gknv-gvsa-92
, author =	"E. R. Gansner and E. Koutsofios and S. C. North and K. P. Vo"
, title =	"Graph Visualization in Software Analysis"
, booktitle =	"Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
, month =	may
, year =	1992
, pages =	""
, keywords =	"graph drawing"
, update =	"94.05 devillers, 93.09 tamassia"
}

@article{gnv-dptdd-88
, author =	"E. R. Gansner and S. C. North and K. P. Vo"
, title =	"{DAG} -- {A} Program that Draws Directed Graphs"
, journal =	"Softw. -- Pract. Exp."
, volume =	18
, number =	11
, year =	1988
, pages =	"1047--1062"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{gu-gssco-85
, author =	"M. A. Gantner and J. J. {Uicker, Jr.}"
, title =	"Generating swept solids for convex objects"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Mech. Engrg., Univ. Wisconsin"
, address =	"Madison, WI"
, year =	1985
}

@inproceedings{gdg-tlbsr-94
, author =	"B. Gao and D.-Z. Du and R. L. Graham"
, title =	"A Tight Lower Bound for the {Steiner} Ratio in {Minkowski} Planes"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"183--191"
, cites =	"achlkkmh-sspmn-91, cg-fpms-85, c-srbmp-90, c-sp-67, d-src-91, dgglw-mstnp-, dh-pgpcs-92, dh-rspns-92, ggj-ccsmt-77, gj-rstpi-77, gp-smt-68, gh-rsmt-76, h-smtrd-76, lm-pcasi-91, ld-smtld-92, m-ccm-76, sr-lvsta-75, sw-hstcu-, sg-smtus-82, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@inproceedings{gjkmrs-cholr-4scg-88
, author =	"S. Gao and M. Jerrum and M. Kaufmann and K. Mehlhorn and W. R{\"u}lling and C. Storb"
, title =	"On continuous homotopic one layer routing"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"392--402"
, succeeds =	"gjkmrs-cholr-cga-88"
, cites =	"cs-rreww-83, lm-artrp-85, m-slwr-87, st-ldt-47, t-oswrp-81, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{gjkmrs-cholr-cga-88
, author =	"S. Gao and M. Jerrum and M. Kaufmann and K. Mehlhorn and W. R{\"u}lling and C. Storb"
, title =	"On continuous homotopic one layer routing"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"55--70"
, precedes =	"gjkmrs-cholr-4scg-88"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@inproceedings{gk-crmn-87
, author =	"S. Gao and M. Kaufmann"
, title =	"Channel routing of multiterminal nets"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"316--325"
}

@inproceedings{gkm-ahlc-89
, author =	"S. Gao and M. Kaufmann and F. M. Maley"
, title =	"Advances in homotopic layout compaction"
, booktitle =	"Proc. 1st ACM Sympos. Parallel Algorithms Architect."
, year =	1989
, pages =	"273--282"
}

@article{gc-npcs-91
, author =	"X. S. Gao and S. C. Chou"
, title =	"On the normal parametrization of curves and surfaces"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	2
, year =	1991
, pages =	"125--136"
, keywords =	"normal parametric equation, inversion map, conic, conicoid, computer modeling"
}

@inproceedings{ghhnt-ptpg-97
, author =	"A. Garc{\'{\i}}a and C. Hernando and F. Hurtado and M. Noy and J. Tejel"
, title =	"Packing Trees into Planar Graphs"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"383--390"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{gnt-lbncf-95
, author =	"Alfredo Garc{\'\i}a and Marc Noy and Javier Tejel"
, title =	"Lower Bounds for the Number of Crossing-Free Subgraphs of {$K_n$}"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"97--102"
, update =	"95.09 jones"
}

@article{gnt-lbncf-00
, author =	"A. Garc{\'\i}a and M. Noy and J. Tejel"
, title =	"Lower bounds on the number of crossing-free subgraphs of {$K_N$}"
, journal =	"Comput. Geom. Theory Appl."
, volume =	16
, year =	2000
, pages =	"211--221"
, update =	"01.04 smid"
}

@article{gsf-scdp-94
, author =	"A. Garcia-Alonso and N. Serrano and J. Flaquer"
, title =	"Solving the Collision Detection Problem"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	14
, month =	may
, year =	1994
, pages =	"36--43"
, update =	"95.01 mitchell"
}

@inproceedings{gr-mcsp-96
, author =	"Jesus Garcia and Pedro A. Ramos"
, title =	"Measuring Circularity of a Set of Points"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	75
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{gm-afegg-88
, author =	"Luis F. Garcia and Osama A. Mohammed"
, title =	"Automatic Finite Element Grid Generation In Electromagnetics"
, booktitle =	"1988 IEEE Southeastcon, Conference Proceedings."
, publisher =	"IEEE"
, address =	"New York, NY"
, year =	1988
, pages =	"571--575"
, keywords =	"grid generation, field region, finite-element meshes, triangulation, finite- element grids"
, annote =	"Basic incremental switching algorithm."
, abstract =	"An automatic two-dimensional finite-element grid
		 generator, which would greatly assist in improving
		 preprocessing operations, and geometry handling, for
		 electromagnetic field computations is presented. The
		 algorithm developed iteratively triangulates a set of
		 points, defining a field region, into optimal
		 finite-element meshes. The mathematical procedure used
		 in developing the algorithm is based on the concept of
		 Delaunay triangulation and variational principles. The
		 main objective of this algorithm is to efficiently
		 reconstruct complicated field regions in terms of a set
		 of points, known to the user, and generate optimal
		 finite- element grids. The algorithm would also assist
		 in preparing the geometrical and material
		 characteristic-field regions to obtain numerical
		 solutions. The algorithm is executed interactively. 20
		 refs."
}

@inproceedings{gr-cvs-93
, author =	"J. Garc{'i}a-L{'o}pez and P. Ramos-Alonso"
, title =	"Circular visibility and seability"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"18--23"
, cites =	"as-cssp-93, as-cvspf-93, c-tsplt-91a, ghlst-ltavs-87, gy-fchsp-83, ps-cgi-85, t-cg-85, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{gr-fspc-97
, author =	"J. Garc{\'i}a-Lopez and P. Ramos"
, title =	"Fitting a set of points by a circle"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"139--146"
, precedes =	"grs-fspc-98"
, cites =	"ast-apsgo-94, agss-ltacv-89, efnn-rauvd-89, egs-oplms-86, f-gm2ag-82, ll-orpr-91, ps-cgi-85, r-ac-79, rz-epccm-92, sy-pncrr-95, sj-wrspp-95, slw-oardc-95, y-ecgtm-95, ZZZ"
, update =	"99.07 devillers, 98.07 bibrelex, 97.07 efrat"
}

@article{grs-fspc-98
, author =	"Jes{\'u}s Garc{\'i}a-L{\'o}pez and Pedro Ramos and Jack Snoeyink"
, title =	"Fitting a set of points by a circle"
, journal =	"Discrete Comput. Geom."
, volume =	20
, year =	1998
, pages =	"389--402"
, succeeds =	"gr-fspc-97"
, update =	"99.07 devillers"
}

@incollection{g-tc-92
, author =	"M. Gardner"
, title =	"Tangent Circles"
, booktitle =	"Fractal Music and Hypercards"
, publisher =	"W. H. Freeman"
, year =	1992
, pages =	"149--166"
, update =	"97.11 bibrelex"
}

@book{g-gt-95
, author =	"R. J. Gardner"
, title =	"Geometric Tomography"
, publisher =	"Cambridge University Press"
, year =	1995
, update =	"96.05 orourke"
}

@article{g-sxpcb-83
, author =	"R. J. Gardner"
, title =	"Symmetrals and x-rays of planar convex bodies"
, journal =	"Arch. Math."
, volume =	41
, year =	1983
, pages =	"183--189"
, update =	"98.11 bibrelex"
}

@article{g-xrp-92
, author =	"R. J. Gardner"
, title =	"{X}-rays of polygons"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"281--293"
}

@inproceedings{gg-dfsxr-96
, author =	"R. J. Gardner and Peter Gritzmann"
, title =	"Determination of Finite Sets by {X}-Rays"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"71--72"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{gm-hxp-80
, author =	"R. J. Gardner and P. {McMullen}"
, title =	"On {Hammer's} x-ray problem"
, journal =	"J. London Math. Soc."
, volume =	21
, year =	1980
, pages =	"171--175"
, update =	"98.11 bibrelex"
}

@inproceedings{gfp-porqm-89
, author =	"D. Gardy and P. Flajolet and C. Puech"
, title =	"On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"218--229"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@techreport{gg-esdss-90
, author =	"D. Gardy and D. Gouyou-Beauchamps"
, title =	"Enumeration of some {Davenport}-{Schinzel} sequences"
, type =	"Report"
, number =	564
, institution =	"Universit{\'e} de Paris-Sud"
, address =	"Paris"
, year =	1990
, update =	"95.09 agarwal, 95.05 agarwal"
}

@article{g-obip-72
, author =	"M. Garey"
, title =	"Optimal binary identification procedures"
, journal =	"SIAM J. Appl. Math."
, volume =	23
, year =	1972
, pages =	"173--186"
, update =	"98.03 bibrelex"
}

@article{gjs-agcpc-76
, author =	"M. Garey and D. Johnson and H. So"
, title =	"An Apllication of Graph Coloring to Printed Circuit Testing"
, journal =	"IEEE Trans. Circuits Syst."
, volume =	"CAS-23"
, number =	10
, month =	oct
, year =	1976
, pages =	"591--598"
, update =	"97.11 bibrelex"
}

@inproceedings{ggj-sncgp-76
, author =	"M. R. Garey and R. L. Graham and D. S. Johnson"
, title =	"Some {NP}-complete geometric problems"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
, year =	1976
, pages =	"10--22"
}

@article{ggj-ccsmt-77
, author =	"M. R. Garey and R. L. Graham and D. S. Johnson"
, title =	"The complexity of computing {Steiner} minimal trees"
, journal =	"SIAM J. Appl. Math."
, volume =	32
, year =	1977
, pages =	"835--859"
}

% also claimed address = "San Francisco, CA"
@book{gj-cigtn-79
, author =	"M. R. Garey and D. S. Johnson"
, title =	"Computers and Intractability: {A} Guide to the Theory of {NP}-Completeness"
, publisher =	"W. H. Freeman"
, address =	"New York, NY"
, year =	1979
, keywords =	"NP-completeness"
}

@article{gj-cninc-83
, author =	"M. R. Garey and D. S. Johnson"
, title =	"Crossing Number is {NP}-Complete"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	4
, number =	3
, year =	1983
, pages =	"312--316"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{gj-rstpi-77
, author =	"M. R. Garey and D. S. Johnson"
, title =	"The rectilinear {Steiner} tree problem is {NP}-complete"
, journal =	"SIAM J. Appl. Math."
, volume =	32
, year =	1977
, pages =	"826--834"
}

@article{gjpt-tsp-78
, author =	"M. R. Garey and D. S. Johnson and F. P. Preparata and R. E. Tarjan"
, title =	"Triangulating a simple polygon"
, journal =	"Inform. Process. Lett."
, volume =	7
, number =	4
, year =	1978
, pages =	"175--179"
, update =	"98.11 bibrelex"
}

@article{gjt-phcpn-76
, author =	"M. R. Garey and D. S. Johnson and R. E. Tarjan"
, title =	"The planar {Hamiltonian} circuit problem is {NP}-complete"
, journal =	"SIAM J. Comput."
, volume =	5
, number =	4
, year =	1976
, pages =	"704--714"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{gp-oswsc-84
, author =	"M. R. Garey and R. Y. Pinter"
, title =	"Optimum scan-width selection under containment constraints"
, journal =	"AT\&T Bell Lab. Tech. J."
, volume =	63
, year =	1984
, pages =	"1191--1212"
}

@article{g-nrdag-98
, author =	"A. Garg"
, title =	"New results on Drawing Angle Graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, number =	"1--2"
, year =	1998
, pages =	"43--82"
, note =	"Special Issue on Geometric Representations of
                  Graphs, G.~{Di Battista} and R.~Tamassia, editors"
, succeeds =	"g-dag-95"
, update =	"98.07 vismara"
}

@inproceedings{g-dag-95
, author =	"A. Garg"
, title =	"On Drawing Angle Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"84--95"
, keywords =	"graph drawing, planar, straight-line, NP-hardness"
, update =	"95.01 tamassia"
}

@inproceedings{ggt-aeutd-93
, author =	"A. Garg and M. T. Goodrich and R. Tamassia"
, title =	"Area-efficient upward tree drawings"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"359--368"
, keywords =	"graph drawing"
, precedes =	"ggt-putdo-96"
, cites =	"bc-cmwlv-87, bl-fsvgl-84, bm-gta-76, b-ndgta-88, bk-abtl-80, c-tpca-82, cdttb-fdgd-92, cdp-noaau-92, dtt-arsdp-92, dett-adgab-93, dv-aptg-93, fpp-sssfe-88, ell-ttdc-90, ghlst-ltavs-87, fhkr-owpas-92, k-dpgul-92, l-aeglv-80, mp-arpg-92, o-cgc18-93, rt-tdt-81, sr-cdtn-83, rt-rplbo-86, s-epgg-90, tt-uavrp-86, t-hdg-63, v-ucvc-81, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex, 97.03 devillers, 93.09 tamassia"
}

@article{ggt-putdo-96
, author =	"A. Garg and M. T. Goodrich and R. Tamassia"
, title =	"Planar upward tree drawings with optimal area"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"333--356"
, url =	"http://www.cs.brown.edu/cgc/papers/ggt-aoutd-96.ps.gz"
, keywords =	"graph drawing, tree, planar, upward"
, succeeds =	"ggt-aeutd-93"
, update =	"97.03 devillers+tamassia"
}

@techreport{gt-nmcfa-96
, author =	"A. Garg and R. Tamassia"
, title =	"A New Minimum Cost Flow Algorithm with Applications to Graph Drawing"
, type =	"Manuscript"
, institution =	"Dept. of Computer Sci., Brown University"
, year =	1996
, keywords =	"graph drawing, orthogonal, planar"
, update =	"96.09 tamassia"
}

@inproceedings{gt-nmcfa-97
, author =	"A. Garg and R. Tamassia"
, title =	"A New Minimum Cost Flow Algorithm with Applications to Graph Drawing"
, editor =	"S. C. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"201--216"
, url =	"http://www.cs.brown.edu/cgc/papers/gt-nmcfa-97.ps.gz"
, keywords =	"graph drawing, planar, orthogonal, grid"
, update =	"99.03 vismara, 97.03 tamassia, 96.09 tamassia"
}

@inproceedings{gt-agd-94
, author =	"A. Garg and R. Tamassia"
, title =	"Advances in Graph Drawing"
, booktitle =	"Algorithms and Complexity"
, nickname =	"CIAC '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	778
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"12--21"
, url =	"http://www.cs.brown.edu/cgc/papers/gt-agd-94.ps.gz"
, keywords =	"graph drawing"
, update =	"97.11 bibrelex, 97.03 tamassia, 94.05 tamassia"
}

@techreport{gt-arpd-93
, author =	"A. Garg and R. Tamassia"
, title =	"Angular Resolution of Planar Drawings"
, institution =	"Brown Univ., Dept. of Computer Science"
, year =	1993
, keywords =	"graph drawing"
, update =	"94.01 tamassia"
}

@techreport{gt-evhst-96
, author =	"A. Garg and R. Tamassia"
, title =	"Effective Visualization of Hierarchical Structures in {3D}"
, type =	"Manuscript"
, institution =	"Dept. of Computer Sci., Brown University"
, year =	1996
, note =	"Available at \url{http://www.cs.brown.edu/people/rt/fadiva/giotto3d.html}"
, url =	"http://www.cs.brown.edu/people/rt/fadiva/giotto3d.html"
, keywords =	"graph drawing, 3D"
, update =	"97.03 tamassia, 96.09 tamassia"
}

@inproceedings{gt-ecpsl-93
, author =	"A. Garg and R. Tamassia"
, title =	"Efficient Computation of Planar Straight-Line Upward Drawings"
, booktitle =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
, site =	"Paris, France"
, year =	1993
, keywords =	"graph drawing, planar, upward, straight-line"
, update =	"95.05 tamassia"
}

@inproceedings{gt-gsvhs-97
, author =	"A. Garg and R. Tamassia"
, title =	"{GIOTTO3D}: A System for Visualizing Hierarchical Structures in {3D}"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1997
, url =	"http://www.cs.brown.edu/cgc/papers/gt-gsvhs-97.ps.gz"
, keywords =	"graph drawing, upward, 3D, CGC, Brown"
, update =	"99.11 bibrelex, 97.03 tamassia"
}

@techreport{gt-cupt-93
, author =	"A. Garg and R. Tamassia"
, title =	"On the Complexity of Upward Planarity Testing"
, institution =	"Brown Univ., Dept. of Computer Science"
, year =	1993
, keywords =	"graph drawing"
, update =	"94.01 tamassia"
}

@techreport{gt-ccurp-94
, author =	"A. Garg and R. Tamassia"
, title =	"On the Computational Complexity of Upward and Rectilinear Planarity Testing"
, type =	"Report"
, number =	"CS-94-10"
, institution =	"Comput. Sci. Dept., Brown Univ."
, address =	"Providence, RI"
, year =	1994
, update =	"94.05 tamassia"
}

@unpublished{gt-ccurp-s-95
, author =	"A. Garg and R. Tamassia"
, title =	"On the Computational Complexity of Upward and Rectilinear Planarity Testing"
, year =	1995
, note =	"Submitted to {\em SIAM Journal on Computing}"
, keywords =	"graph drawing, planar upward, orthogonal"
, update =	"96.09 tamassia"
}

@inproceedings{gt-ccurp-95
, author =	"A. Garg and R. Tamassia"
, title =	"On the Computational Complexity of Upward and Rectilinear Planarity Testing"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"286--297"
, url =	"http://www.cs.brown.edu/cgc/papers/gt-ccurp-95.ps.gz"
, keywords =	"graph drawing, planar, upward, rectilinear, orthogonal, NP-hardness"
, update =	"97.03 tamassia, 95.01 tamassia"
}

@inproceedings{gt-pdara-94
, author =	"A. Garg and R. Tamassia"
, title =	"Planar Drawings and Angular Resolution: Algorithms and Bounds"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, nickname =	"ESA '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"12--23"
, keywords =	"graph drawing, planar, straight-line, angular resolution"
, update =	"95.05 tamassia"
}

@article{gt-upt-95
, author =	"A. Garg and R. Tamassia"
, title =	"Upward Planarity Testing"
, journal =	"Order"
, volume =	12
, year =	1995
, pages =	"109--133"
, url =	"http://www.cs.brown.edu/cgc/papers/gt-upt-95.ps.gz"
, keywords =	"graph drawing, planar, upward, survey"
, update =	"97.03 tamassia, 96.09 tamassia, 95.09 tamassia, 95.05 tamassia"
}

@inproceedings{gtv-dc-96
, author =	"A. Garg and R. Tamassia and P. Vocca"
, title =	"Drawing with Colors"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, nickname =	"ESA '96"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"12--26"
, url =	"http://www.cs.brown.edu/cgc/papers/gtv-dc-96.ps.gz"
, keywords =	"graph drawing, 3D, straight-line"
, update =	"97.03 smid+tamassia"
}

@inproceedings{gh-oaakm-94
, author =	"Naveen Garg and Dorit S. Hochbaum"
, title =	"An ${O}(\log k)$ Approximation Algorithm for the $k$ Minimum Spanning Tree Problem in the Plane"
, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '94"
, year =	1994
, pages =	"432--438"
, update =	"98.07 bibrelex, 97.03 agarwal, 95.01 mitchell"
}

@inproceedings{gkr-paags-98
, author =	"Naveen Garg and Goran Konjevod and R. Ravi"
, title =	"A Polylogarithmic Approximation Algorithm for the Group {Steiner} Problem"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"253--259"
, update =	"99.07 bibrelex, 98.07 mitchell"
}

@article{g-ewrq-82
, author =	"I. Gargantini"
, title =	"An Effective Way to Represent Quadtrees"
, journal =	"Commun. ACM"
, volume =	25
, number =	12
, month =	dec
, year =	1982
, pages =	"905--910"
, update =	"97.11 bibrelex"
}

@article{ga-rtone-93
, author =	"I. Gargantini and H. H. Atkinson"
, title =	"Ray Tracing an Octree: Numerical Evaluation of the First Intersection"
, journal =	"Comput. Graph. Forum"
, volume =	12
, number =	4
, month =	oct
, year =	1993
, pages =	"199--210"
, update =	"96.01 held"
}

@inproceedings{gs-tmgme-95
, author =	"Rao Garimella and Mark S. Shephard"
, title =	"Tetrahedral Mesh Generation with Multiple Elements Through the Thickness"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"321--334"
, update =	"96.01 samitchell"
}

@inproceedings{gh-ssqem-97
, author =	"M. Garland and P. S. Heckbert"
, title =	"Surface simplification using quadric error metrics"
, booktitle =	"Proc. SIGGRAPH '97"
, year =	1997
, pages =	"209--216"
, update =	"98.07 orourke"
}

@inproceedings{gbw-ivlgd-90
, author =	"B. Garlick and D. Baum and J. Winget"
, title =	"Interactive viewing of large geometric databases using multiprocessor graphics workstations"
, booktitle =	"SIGGRAPH '90 Course Notes: Parallel Algorithms and Architectures for 3D Image Generation"
, year =	1990
, update =	"98.07 bibrelex"
}

@misc{gg-sdvpx-92
, author =	"R. J. Garnder and P. Gritzmann"
, title =	"Successive determination and verification of polytopes by their x-rays"
, year =	1992
, note =	"preprint"
, update =	"98.11 bibrelex"
}

@inproceedings{gm-eggsm-97
, author =	"M. A. Garrido and A. M{\'a}rquez"
, title =	"Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends is {NP-hard}"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"124--133"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{gmpr-otp-99
, author =	"Maria Angeles Garrido and Alberto M{\'a}rquez and Jose Ramon Portillo and Pedro Reyes"
, title =	"Orthogonal Triangles in the Plane"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"165--167"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{gw-cipas-87
, author =	"T. Garrity and J. Warren"
, title =	"On Computing the Intersection of a Pair of Algebraic Surfaces"
, journal =	"Comput. Aided Geom. Design"
, volume =	"??"
, year =	1987
, update =	"97.11 bibrelex"
}

@book{gb-amgd-92
, author =	"G. D. Garson and R. S. Biggs"
, title =	"Analytic Mapping and Geographic Databases"
, publisher =	"Sage Publications"
, address =	"Newbury Park"
, year =	1992
, update =	"96.09 kreveld"
}

@inproceedings{g-saaop-92
, author =	"Bernd G{\"a}rtner"
, title =	"A Subexponential Algorithm for Abstract Optimization Problems"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"464--472"
, keywords =	"geometric optimization, randomized algorithm, smallest enclosing ball, distance of convex polyhedra"
, update =	"94.01 smid, 93.09 matousek+milone+mitchell"
}

@techreport{g-saaop-93
, author =	"Bernd G{\"a}rtner"
, title =	"A Subexponential Algorithm for Abstract Optimization Problems"
, institution =	"Princeton University"
, month =	feb
, year =	1993
, comments =	"DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
, update =	"93.09 milone+mitchell"
}

@article{g-saaop-95
, author =	"Bernd G{\"a}rtner"
, title =	"A Subexponential Algorithm for Abstract Optimization Problems"
, journal =	"SIAM J. Comput."
, volume =	24
, year =	1995
, pages =	"1018--1035"
, keywords =	"geometric optimization, randomized algorithm, smallest enclosing ball, distance of convex polyhedra"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@inproceedings{g-ealcc-98
, author =	"Bernd G{\"a}rtner"
, title =	"Exact Arithmetic at Low Cost: {A} Case Study in Linear Programming"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"157--166"
, update =	"99.07 bibrelex, 98.07 mitchell"
}

@inproceedings{g-pcpd-00
, author =	"Bernd G{\"a}rtner"
, title =	"Pitfalls in Computing with Pseudorandom Determinants"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"148--155"
, update =	"00.11 jones"
}

@phdthesis{g-rostm-95
, author =	"B. G{\"a}rtner"
, title =	"Randomized Optimization by Simplex-Type Methods"
, school =	"Freie Universit{\"a}t Berlin"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"97.03 gaertner+salinger"
}

@mastersthesis{g-ssbvc-91
, author =	"B. G{\"a}rtner"
, title =	"Set Systems of Bounded {Vapnik}-{Chervonenkis} Dimension and a Relation to Arrangements"
, type =	"Masters Thesis"
, school =	"Fachbereich Mathematik, Freie Univ. Berlin"
, address =	"Berlin, Germany"
, year =	1991
, keywords =	"masters thesis"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{gs-eegqp-00
, author =	"Bernd G{\"a}rtner and Svend Sch{\"o}nherr"
, title =	"An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"110--118"
, update =	"00.11 jones"
}

@inproceedings{gs-epsee-97
, author =	"B. G{\"a}rtner and S. Sch{\"o}nherr"
, title =	"Exact Primitives for Smallest Enclosing Ellipses"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"430--432"
, cites =	"as-rssua-93, dll-udleu-57, d-ccpac-92, gs-seefe-97t, j-episc-48, msw-sblp-92, p-cmse-82, s-bkeup-94, st-mce-80, s-ac-57, t-odsga-75, w-sedbe-91a, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{gs-seefe-97t
, author =	"B. G{\"a}rtner and S. Sch{\"o}nherr"
, title =	"Smallest enclosing ellipses - fast and exact"
, type =	"Technical {Report}"
, institution =	"Free University Berlin"
, address =	"Berlin, Germany"
, year =	1997
, update =	"98.07 bibrelex"
}

@inproceedings{gw-lpraf-96
, author =	"Bernd G{\"a}rtner and Emo Welzl"
, title =	"Linear Programming -- Randomization and Abstract Frameworks"
, booktitle =	"Proc. 13th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1046
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"669--687"
, keywords =	"survey paper, linear programming, randomization, abstract frameworks"
, update =	"97.03 agarwal+gaertner+salinger+pocchiola"
}

@inproceedings{gw-rsgon-00
, author =	"Bernd G{\" a}rtner and Emo Welzl"
, title =	"Random sampling in geometric optimization: {N}ew insights and applications"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"91--99"
, update =	"00.11 smid, 00.07 agarwal"
}

@article{gw-vcdph-94
, author =	"B. G{\"a}rtner and Emo Welzl"
, title =	"{Vapnik}-{Chervonenkis} Dimension and (Pseudo-)Hyperplane Arrangements"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"399--432"
, update =	"98.03 mitchell, 97.03 gaertner+salinger"
}

@inproceedings{gz-rsakm-94
, author =	"B. G{\"a}rtner and G. Ziegler"
, title =	"Randomized Simplex Algorithms on {Klee}-{Minty} Cubes"
, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1994
, pages =	"502--510"
, update =	"97.03 gaertner+salinger"
}

@article{gs-capof-55
, author =	"Saul I. Gass and Thomas Saaty"
, title =	"The computational algorithm for the parametric objective function"
, journal =	"Naval Research Logistics"
, volume =	2
, year =	1955
, pages =	"39--45"
, update =	"97.11 bibrelex"
}

@article{gl-trluo-84
, author =	"P. Gaston and T. Lozano-Perez"
, title =	"Tactile recognition and localization using object models: {The} case of polyhedra on a plane"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-6"
, month =	may
, year =	1984
, pages =	"257--266"
, update =	"98.03 bibrelex"
}

@incollection{g-act-88
, author =	"Joachim von zur Gathen"
, title =	"Algebraic Complexity Theory"
, booktitle =	"Annu. Rev. Comput. Sci."
, volume =	3
, publisher =	"Annual Reviews"
, address =	"Palo Alto, CA"
, year =	1988
, pages =	"317--347"
, update =	"97.07 agarwal"
}

@article{g-amcmc-72
, author =	"F. Gavril"
, title =	"Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques and Maximum Independent Set of a Chordal Graph"
, journal =	"SIAM J. Comput."
, volume =	1
, number =	2
, year =	1972
, pages =	"180--187"
, update =	"98.03 bibrelex"
}

@article{g-acag-74
, author =	"F. Gavril"
, title =	"Algorithms on circular-arc graphs"
, journal =	"Networks"
, volume =	4
, year =	1974
, pages =	"357--369"
, update =	"98.07 bibrelex"
}

@inproceedings{g-sncpg-77
, author =	"F. Gavril"
, title =	"Some {NP}-complete problems on graphs"
, booktitle =	"Proc. 11th Conf. Inform. Sci. Syst."
, site =	"Baltimore, MD"
, organization =	"Johns Hopkins University"
, year =	1977
, pages =	"91--95"
, update =	"98.07 bibrelex"
}

@article{g-igsec-74
, author =	"F. Gavril"
, title =	"The intersection graphs of subtrees is exactly the chordal graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	16
, year =	1974
, pages =	"47--56"
, update =	"98.11 bibrelex"
}

@article{grr-ecvdd-00
, author =	"M. Gavrilova and H. Ratschek and J. Rokne"
, title =	"Exact Computation of {Voronoi} Diagram and {Delaunay} Triangulation"
, journal =	"J. Reliable Computing"
, volume =	6
, number =	1
, year =	2000
, pages =	"39--60"
, update =	"00.11 smid, 00.07 held"
}

@inproceedings{grg-dcdac-96
, author =	"Marina Gavrilova and Jon Rokne and Dmitri Gavrilov"
, title =	"Dynamic Collision Detection Algorithms in Computational Geometry"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"103--106"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{g-iaspg-86
, author =	"H. Gazit"
, title =	"An Improved Algorithm for Separating a Planar Graph"
, type =	"Manuscript"
, institution =	"Univ. Southern California"
, address =	"Los Ageles, CA"
, year =	1986
, update =	"97.11 bibrelex"
}

@inproceedings{gm-psen-90
, author =	"H. Gazit and G. L. Miller"
, title =	"Planar separators and the {Euclidean} norm"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, site =	"Tokyo, Japan"
, organization =	"Information Processing Society of Japan"
, publisher =	"Springer-Verlag"
, month =	aug
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{gm-eha3s-87
, author =	"P. Gburzynski and M. McLeish"
, title =	"An efficient heuristic algorithm for a $3$-space $n$-partitioning problem used in polygon retrieval and non-parametric statistics"
, booktitle =	"Proc. Allerton Conf."
, year =	1987
, pages =	"908--916"
, update =	"98.07 bibrelex"
}

@book{g-nivpo-71
, author =	"W. C. Gear"
, title =	"Numerical Initial Value Problems in Ordinary Differential Equations"
, publisher =	"Prentice Hall"
, year =	1971
, update =	"97.11 bibrelex"
}

@article{get-hpfrt-89
, author =	"J. N. Gederquist and M. T. Eismann and A. M. Tai"
, title =	"Holographic polar formatting and real-time optical processing of synthetic radar data"
, journal =	"Appl. Optics"
, volume =	1928
, number =	19
, year =	1989
, pages =	"4182--4189"
, update =	"97.11 bibrelex"
}

@article{gt-cghgt-84
, author =	"J. N. Gederquist and A. M. Tai"
, title =	"Computer-generated holograms for geometric transformations"
, journal =	"Appl. Optics"
, volume =	23
, number =	18
, year =	1984
, pages =	"3099--3104"
, update =	"97.11 bibrelex"
}

@inproceedings{g-cnugc-95
, author =	"Carl Van Geem"
, title =	"Computation of a Non-Uniform Grid on the Configuration Space of a Robot Arm Amidst Obstacles: Intersection Problem"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"75--78"
, update =	"00.03 bibrelex"
}

@inproceedings{g-tfsmg-94
, author =	"Carl van Geem"
, title =	"Towards a Fast Solution Method for the General Robot Motion Planning Problem Using a {Manhattan}-like Distance Function on a Non-Uniform Grid in Configuration Space"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"73--76"
, cites =	"ZZZ"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{g-3dmud-95
, author =	"Bernhard Geiger"
, title =	"{3D} {Modeling} Using the {Delaunay} Triangulation"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"V11--V12"
, keywords =	"video review"
, cites =	"bg-tdrcs-93, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@techreport{g-tdmho-93b
, author =	"Bernhard Geiger"
, title =	"Three-dimensional modeling of human organs and its application to diagnosis and surgical planning"
, type =	"Report"
, number =	2105
, institution =	"INRIA Sophia-Antipolis"
, address =	"Valbonne, France"
, year =	1993
, succeeds =	"g-tdmho-93"
, update =	"99.07 devillers, 94.05 devillers"
}

@phdthesis{g-tdmho-93
, author =	"Bernhard Geiger"
, title =	"Three-dimensional modeling of human organs and its application to diagnosis and surgical planning"
, type =	"Th\`{e}se de Doctorat en Sciences"
, school =	"Ecole Nationale Sup\'erieure des Mines de Paris"
, address =	"France"
, year =	1993
, keywords =	"doctoral thesis"
, precedes =	"g-tdmho-93b"
, update =	"99.07 devillers, 94.05 devillers, 93.09 devillers"
}

@book{s-5hbc-38
, author =	"{Dr. Seuss} [Theodore Seuss Geisel]"
, title =	"The 500 Hats of Bartholomew Cubbins"
, publisher =	"Vanguard Press"
, year =	1938
, comments =	"Early recursion [Jeff Erickson]"
, update =	"01.11 orourke"
}

@book{s-chcb-58
, author =	"{Dr. Seuss} [Theodore Seuss Geisel]"
, title =	"The Cat in the Hat Comes Back"
, series =	"Beginner Books"
, publisher =	"Random House"
, year =	1958
, comments =	"Early recursion [Jeff Erickson]"
, update =	"01.11 orourke"
}

@incollection{g-rgtpm-63
, author =	"H. Gelernter"
, title =	"Realization of a geometry theorem proving machine"
, editor =	"E. A. Feigenbaum and J. E. Feldman"
, booktitle =	"Computers and Thought"
, publisher =	"McGraw-Hill"
, address =	"New York, NY"
, year =	1963
, update =	"98.03 bibrelex"
}

@book{gkz-drmd-94
, author =	"I. M. Gelfand and M. M. Kapranov and A. V. Zelevinski"
, title =	"Discriminants, Resultants and Mulidimensional Determinants"
, publisher =	"Birkh{\"a}user"
, address =	"Boston, MA"
, year =	1994
, update =	"97.11 bibrelex"
}

@inproceedings{ggt-tdsdp-98
, author =	"Natasha Gelfand and Michael T. Goodrich and Roberto Tamassia"
, title =	"Teaching Data Structure Design Patterns"
, booktitle =	"Proc. ACM Symp. Computer Science Education"
, year =	1998
, update =	"98.11 tamassia"
}

@inproceedings{gt-apogd-98
, author =	"Natasha Gelfand and Roberto Tamassia"
, title =	"Algorithmic Patterns for Orthogonal Graph Drawing"
, editor =	"S. H. Whitesides"
, booktitle =	"Graph Drawing (Proc. GD~'98)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1547
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"138--152"
, keywords =	"graph drawing, planar, orthogonal, system"
, update =	"99.07 vismara, 99.03 vismara, 98.11 tamassia"
}

@book{g-vcem-77
, title =	"The {VNR} Concise Encyclopedia of Mathematics"
, editor =	"Gellert"
, publisher =	"Van Nostrand Reinhold"
, year =	1977
, update =	"98.03 bibrelex"
}

@book{gghkk-vcem-89
, author =	"W. Gellert and S. Gottwald and M. Hellwich and H. K{\"a}stner and H. K{\"u}stner"
, title =	"The {VNR} Concise Encyclopedia of Mathematics"
, edition =	"2nd"
, publisher =	"Van Nostrand Reinhold"
, address =	"New York"
, year =	1989
, update =	"98.11 bibrelex"
}

@article{gd-bsrsc-95
, author =	"S. M. Gelston and D. Dutta"
, title =	"Boundary Surface Recovery from Skeleton Curves and Surfaces"
, journal =	"Comput. Aided Geom. Design"
, volume =	12
, number =	1
, month =	feb
, year =	1995
, pages =	"27--51"
, update =	"97.07 held"
}

@article{gp-1stp-87
, author =	"G. Georgakopoulos and C. H. Papadimitriou"
, title =	"The $1$-{Steiner} tree problem"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"122--130"
}

@article{g-ndrfe-73
, author =	"J. A. George"
, title =	"Nested dissection of a regular finite element mesh"
, journal =	"SIAM J. Numer. Anal."
, volume =	10
, year =	1973
, pages =	"345--363"
, update =	"98.03 bibrelex"
}

@book{gl-cslsp-81
, author =	"J. A. George and J. W. Liu"
, title =	"Computer Solution of Large Sparse Positive Definite Systems"
, publisher =	"Prentice Hall"
, year =	1981
, update =	"97.11 bibrelex"
}

@book{gb-tdmae-97
, author =	"Paul-Louis George and Houman Borouchaki"
, title =	"Triangulation de {Delaunay} et maillage. Applications aux \'el\'ements finis"
, publisher =	"Hermes"
, address =	"Paris, France"
, year =	1997
, update =	"00.03 devillers"
}

@article{ghs-amgsb-91
, author =	"P. L. George and F. Hecht and E. Saltel"
, title =	"Automatic Mesh Generator With Specified Boundary"
, journal =	"Computer Methods in Applied Mechanics and Engineering"
, volume =	92
, number =	3
, month =	nov
, year =	1991
, pages =	"269--288"
, keywords =	"finite element mesh generation, automatic mesh generators, finite element boundary fitting, two-dimensional domain meshing, three-dimensional domain meshing, Voronoi's theory"
, abstract =	"For the purpose of finite element computation for 2D
		 or 3D geometry, one needs an appropriate mesh of the
		 considered domain. A class of fully automatic methods,
		 derived from Voronoi's theory, is suitable for
		 generating a mesh of any shape via a set of points
		 describing the geometry. Such methods, providing
		 triangles in 2D and tetrahedra in 3D, can be seen,
		 after an adequate initialization, as the merger of each
		 given point in an existing mesh using an updating
		 process. Unfortunately, this mesh, which contains all
		 the given points, does not contain, in general, the
		 edges (or the faces) of the boundary which are the
		 natural data to be satisfied. The aim of this paper is,
		 after a brief survey of the different steps of the
		 above-mentioned method, to point out the problem of the
		 exact fitting of the given boundary and to present a
		 method which guarantees this crucial property. (Edited
		 author abstract) 18 Refs."
}

@article{ghv-cipvt-91
, author =	"P. L. George and F. Hecht and M. G. Vallet"
, title =	"Creation Of Internal Points In {Voronoi's} Type Method. Control Adaptation"
, journal =	"Advances in Engineering Software and Workstations"
, volume =	13
, number =	"5--6"
, month =	sep
, year =	1991
, pages =	"303--312"
, keywords =	"Voronoi's method, control adaptation, mesh generation, finite element automatic meshes, isotropic and anisotropic meshes"
, annote =	"Inside flip insertion. Extra points added
		 adaptively."
, abstract =	"Devoted to mesh generation based upon a variant of the
		 Delaunay-Voronoi type of method, this paper briefly
		 recalls the different steps of such a process with
		 special attention paid to the process concerning the
		 creation of internal points. A general background is
		 introduced which makes the control and the adaptation
		 of the meshes so created according to some special
		 specifications possible both for 2D and 3D situations.
		 (Author abstract) 16 Refs."
}

@article{gh-dmcpd-92
, author =	"P. L. George and F. Hermeline"
, title =	"Delaunay's Mesh of a Convex Polyhedron In Dimension $d$. Application To Arbitrary Polyhedra"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	33
, number =	5
, month =	apr
, year =	1992
, pages =	"975--995"
, keywords =	"Delaunay triangulation, mesh generation, polyhedra"
, annote =	"Watson's in arbitrary dimensions. Hybrid approach for
		 robustness -- calculation of simplex volumes is done
		 exactly but not cc tests. Result is therefore
		 guaranteed to be a valid mesh."
, abstract =	"This paper presents a method for creating a Delaunay
		 triangulation connected to a set of specified points.
		 The theoretical aspect is recalled for an arbitrary
		 dimension and the method is discussed in order to
		 derive a practical approach, valid for dimensions 2 and
		 3, which is simple, robust and well adapted to
		 computation. Convex polyhedral and arbitrary polyhedral
		 situations are introduced. (Author abstract) 22 Refs."
}

@inproceedings{gs-cedsb-96
, author =	"Alexandros Gerbessiotis and Constantinos Siniolakis"
, title =	"Communication Efficient Data Structures on the BSP Model with Applications in Computational Geometry"
, booktitle =	"Proceedings of EUROPAR'96"
, month =	aug
, year =	1996
, keywords =	"BSP Model, Data Structures"
, update =	"96.09 orourke"
}

@article{gv-dbspa-94
, author =	"A. V. Gerbessiotis and L. G. Valiant"
, title =	"Direct bulk-synchronous parallel algorithms"
, journal =	"J. Parallel Distrib. Comput."
, volume =	22
, year =	1994
, pages =	"251--267"
, update =	"96.09 orourke"
}

@article{gg-rtp-67
, author =	"L. Gerencs{\'e}r and A. Gy{\'a}rf{\'a}s"
, title =	"On {Ramsey}-type problems"
, journal =	"Annales Universitatis Scientarium Budapestinensis Roland E{\H o}tv{\H o}s, Sectio Mathematica"
, volume =	10
, year =	1967
, pages =	"167--170"
, update =	"97.11 bibrelex"
}

@book{gg-vqsc-91
, author =	"A. Gersho and R. M. Gray"
, title =	"Vector Quantization and Signal Compression"
, publisher =	"Kluwer Academic Publishers"
, year =	1991
, update =	"98.03 bibrelex"
}

@article{g-dpnet-84
, author =	"J. L. Gerver"
, title =	"The dissection of a polygon into nearly equilateral triangles"
, journal =	"Geom. Dedicata"
, volume =	16
, year =	1984
, pages =	"93--106"
, update =	"97.11 bibrelex"
}

@book{gb-msp-78
, author =	"A. Getis and B. Boots"
, title =	"Models of Spatial Processes"
, publisher =	"Cambridge University Press"
, year =	1978
, update =	"97.11 bibrelex"
}

@incollection{g-frtuc-89
, author =	"P. Getto"
, title =	"Fast Ray Tracing of Unevaluated Constructive Solid Geometry Models"
, editor =	"R. A. Earnshaw and B. Wyvill"
, booktitle =	"New Advances in Computer Graphics: Proc. of Computer Graphics International '89"
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"563--578"
, update =	"93.09 goodrich"
}

@inproceedings{g-cbnnn-94
, author =	"N. H. Getz"
, title =	"Control of balance for a nonlinear nonholonomic nonminimum-phase model of a bicycle"
, booktitle =	"American Control Conference"
, site =	"Baltimore, MD"
, organization =	"American Automatic Control Council"
, month =	jun
, year =	1994
, update =	"97.11 bibrelex"
}

@phdthesis{g-eappv-89
, author =	"L. Gewali"
, title =	"Efficient Algorithms for Path Planning and Visibility Problems"
, type =	"Ph.{D}. Dissertation"
, school =	"Computer Science, Univ. of Texas at Dallas"
, month =	aug
, year =	1989
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@unpublished{g-cscvp-93
, author =	"L. Gewali"
, title =	"On Computing Stair-Case Visibility Polygon"
, year =	1993
, note =	"to appear in Proc. Vision Geometry {II} (SPIE)"
, precedes =	"gg-cscvp-93"
, update =	"98.11 bibrelex"
}

@inproceedings{g-mmvp-93
, author =	"L. Gewali"
, title =	"On minimum and maximum visibility problem"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"240--245"
, cites =	"c-tsplt-90i, ea-lacvp-81, g-cscvp-93, fm-tspep-84, gkn-copss-92, gn-cgopp-93, ha-gmps-92, ll-ccagp-86, l-vsp-83, mrs-copsp-89, nt-opg-91, o-agta-87, rc-csopm-87, t-cm-88, s-rrag-92, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{g-pgiop-96
, author =	"L. Gewali"
, title =	"Placing guards inside orthogonal polygons"
, journal =	"Inform. Sci."
, volume =	88
, year =	1996
, pages =	"1--14"
, update =	"97.07 gewali"
}

@inproceedings{g-rssp-94
, author =	"L. Gewali"
, title =	"Recognizing S-Star Polygons"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"183--188"
, cites =	"a-eafvp-85, bt-gcaim-92, ea-lacvp-81, fm-tspep-84, gg-cscvp-93, gn-cgopp-93, ha-gmps-92, o-agta-87, ps-cgi-85, s-rrag-92, srw-gsv-cccg-91, sw-gkph-93, t-cm-88, lp-oafkp-79, mrs-copsp-89, rc-csopm-87, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{g-rssp-95
, author =	"L. Gewali"
, title =	"Recognizing $s$-star polygons"
, journal =	"Pattern Recogn."
, volume =	28
, year =	1995
, pages =	"1019--1032"
, update =	"97.07 gewali"
}

@inproceedings{gg-cscvp-93
, author =	"L. Gewali and D. Glasser"
, title =	"On Computing Stair-Case Visibility Polygon"
, booktitle =	"Proc. of the 1993 Systems Science Conf."
, site =	"Las Vegas"
, year =	1993
, succeeds =	"g-cscvp-93"
, update =	"98.11 bibrelex"
}

@article{gkn-copss-92
, author =	"L. Gewali and Mark Keil and S. Ntafos"
, title =	"On covering orthogonal polygons with star-shaped polygons"
, journal =	"Inform. Sci."
, volume =	65
, year =	1992
, pages =	"45--63"
, update =	"97.07 gewali"
}

@inproceedings{gmmn-pp0wr-88
, author =	"L. Gewali and A. Meng and Joseph S. B. Mitchell and S. Ntafos"
, title =	"Path planning in $0/1/\infty$ weighted regions with applications"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"266--278"
, keywords =	"maximum concealment, shortest paths, Voronoi diagrams, continuous Dijkstra, visibility"
, precedes =	"gmmn-pp0wr-90"
, cites =	"aaghi-vpses-85, aai-spbts-87, cr-nlbtr-87, cn-owr-88, cn-wrsp-87, ea-lacvp-81, ft-fhtu-84, gm-osacv-87, l-prp-78, lc-pgdr-85, m-psp-86, m-aaspt-88, m-spozc-87, m-mcp-, m-mfpd-88, mmp-dgp-87, mp-wrp-85, o-agta-87, rs-spesp-85, r-naspa-86, ss-spps-86, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{gmmn-pp0wr-90
, author =	"L. Gewali and A. Meng and Joseph S. B. Mitchell and S. Ntafos"
, title =	"Path planning in $0/1/\infty$ weighted regions with applications"
, journal =	"ORSA J. Comput."
, volume =	2
, number =	3
, year =	1990
, pages =	"253--272"
, keywords =	"maximum concealment, shortest paths, Voronoi diagrams, continuous Dijkstra, visibility"
, succeeds =	"gmmn-pp0wr-88"
, update =	"00.11 smid, 00.07 icking, 98.03 mitchell"
}

@techreport{gnt-pppvo-89
, author =	"L. Gewali and S. Ntafos and I. G. Tollis"
, title =	"Path Planning in the Presence of Vertical Obstacles"
, type =	"Technical Report"
, institution =	"Computer Science, University of Texas at Dallas"
, year =	1989
, update =	"93.09 milone+mitchell"
}

@article{gs-cewrp-94
, author =	"L. Gewali and I. Stojmenovi{\'c}"
, title =	"Computing external watchman routes on {PRAM}, {BSR}, and interconnection models of parallel computation"
, journal =	"Parallel Processing Letters"
, volume =	4
, year =	1994
, pages =	"83--93"
, update =	"97.07 gewali"
}

@techreport{gv-oacmg-92
, author =	"L. Gewali and R. Venkatasubramanian"
, title =	"An Optimum Algorithm for Computing Maximum Grazing Area"
, type =	"Technical Report"
, number =	"CS-92-023"
, institution =	"Dept. of Comput. Sci., UNLV"
, address =	"Las Vegas, Nevada"
, month =	jun
, year =	1992
, update =	"98.11 bibrelex"
}

@article{gn-cgopp-93
, author =	"L. P. Gewali and S. Ntafos"
, title =	"Covering grids and orthogonal polygons with periscope guards"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, year =	1993
, pages =	"309--334"
, update =	"96.09 devillers"
}

@inproceedings{gn-mcgop-90
, author =	"L. P. Gewali and S. Ntafos"
, title =	"Minimum covers for grids and orthogonal polygons by periscope guards"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"358--361"
, cites =	"cr-dduap-87, k-mchco-86, mrs-copsp-88, n-gwg-86, o-agta-87, st-gprp-88, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{gn-wrppc-95
, author =	"Laxmi P. Gewali and Simeon Ntafos"
, title =	"Watchman Routes in the Presence of a Pair of Convex Polygons"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"127--132"
, update =	"95.09 jones"
}

@inproceedings{g-cmvsp-98
, author =	"S. Ghali"
, title =	"Computation and Maintenance of Visibility and Shadows in the Plane"
, booktitle =	"Sixth Int. Conf. in Central Europe on Computer Graphics and Visualization, WSCG '98"
, month =	feb
, year =	1998
, pages =	"117--124"
, url =	"http://www.dgp.toronto.edu/~ghali/papers/wscg98.ps.gz"
, keywords =	"visibility, shadows, dynamic algorithms, class hierarchy"
, update =	"98.03 ghali"
}

@inproceedings{gs-iuvms-96
, author =	"Sherif Ghali and A. James Stewart"
, title =	"Incremental update of the visibility map as seen by a moving viewpoint in two dimensions"
, booktitle =	"Seventh International Eurographics Workshop on Computer Animation and Simulation"
, month =	aug
, year =	1996
, pages =	"1--11"
, update =	"98.03 mitchell"
}

@inproceedings{gs-mssvm-96
, author =	"Sherif Ghali and A. James Stewart"
, title =	"Maintenance of the set of segments visible from a moving viewpoint in two dimensions"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V3--V4"
, cites =	"bdeg-vmpv-90, gm-osacv-87, mn-lpcgc-95, ol-dmcp-80, ow-nmcvg-88, p-gfr-90, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{ggr-ngptd-87
, author =	"G. Ghione and R. D. Graglia and C. Rosati"
, title =	"New General-Purpose Two-Dimensional Mesh Generator For Finite Elements, Generalized Finite Differences, And Moment Method Applications"
, journal =	"IEEE Trans. Magn."
, volume =	24
, number =	1
, month =	jan
, year =	1987
, pages =	"307--310"
, keywords =	"2-d mesh generator, finite elements, generalized finite differences, moment method"
, annote =	"Radial sweep for initial triangulation then switching
		 as in Mirante."
, abstract =	"Numerical techniques such as finite elements,
		 generalized finite differences and moment method for
		 the solution of two-dimensional-field boundary-value
		 problems pose different constraints as far as the
		 discretization of the solution domain is concerned. A
		 general-purpose, two- dimensional grid generator is
		 described that produces region triangularizations well
		 suited to each of the aforementioned methods. The
		 triangularization is based on the radial sweep
		 algorithm, which was developed by A. Mirante and N.
		 Weingarten (1982) for solving topological modelling
		 problems. Some application results are presented. 13
		 refs."
}

@article{gkpt-csmsm-93
, author =	"A. Ghos and J. Kowalcyk and M. Peterson and A. Treasurywala"
, title =	"Conformational searching methods for small molecules: {I} study of the sybyl search method"
, journal =	"J. Comput. Chemistry"
, volume =	14
, number =	9
, year =	1993
, pages =	"1050--1065"
, update =	"98.07 bibrelex"
}

@phdthesis{g-ctfsr-86
, author =	"P. K. Ghosh"
, title =	"A Computational Theoretic Framework for Shape Representation and Analysis using the {Minkowski} Addition and Decomposition Operators"
, school =	"Tata Institute of Fundamental Research"
, address =	"Bombay"
, year =	1986
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@incollection{g-vgmo-91
, author =	"P. K. Ghosh"
, title =	"Vision, geometry, and {Minkowski} operators"
, booktitle =	"Contemporary Mathematics"
, volume =	119
, year =	1991
, pages =	"63--83"
, update =	"98.07 bibrelex, 96.05 ramkumar"
}

@inproceedings{gh-mmtdo-93
, author =	"P. K. Ghosh and R. M. Haralick"
, title =	"Mathematical morphology of three-dimensional objects: the slope diagrammatic approach"
, booktitle =	"Proc. SPIE"
, year =	1993
, pages =	"2--13"
, update =	"96.05 ramkumar"
}

@techreport{gm-ctfma-85
, author =	"P. K. Ghosh and S. P. Mudur"
, 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."
, address =	"Bombay, India"
, year =	1985
}

@article{gm-pcgds-83
, author =	"P. K. Ghosh and S. P. Mudur"
, title =	"Parametric curves for graphic design systems"
, journal =	"Comput. J."
, volume =	26
, year =	1983
, pages =	"312--219"
}

@article{gm-btafs-84
, author =	"P. K. Ghosh and S. P. Mudur"
, title =	"The brush-trajectory approach to figure specification: {Some} algebraic solutions"
, journal =	"ACM Trans. Graph."
, volume =	3
, number =	2
, year =	1984
, pages =	"110--134"
}

@techreport{g-fasva-87
, author =	"S. K. Ghosh"
, title =	"A few applications of the set-visibility algorithm"
, type =	"Report"
, number =	"CAR-TR-273"
, institution =	"Center Automat. Res., Univ. Maryland"
, address =	"College Park, MD"
, year =	1987
, update =	"94.05 ghosh"
}

@inproceedings{g-ltadm-83
, author =	"S. K. Ghosh"
, title =	"A linear time algorithm for decomposing a monotone polygon into star-shaped polygons"
, booktitle =	"Proc. 3rd Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"India"
, year =	1983
, pages =	"505--519"
}

@incollection{g-ltadi-84
, author =	"S. K. Ghosh"
, title =	"A linear time algorithm for determining the intersection type of two star polygons"
, booktitle =	"Proc. 4th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	181
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"317--330"
}

@article{g-ncha-86
, author =	"S. K. Ghosh"
, title =	"A note on convex hull algorithms"
, journal =	"Pattern Recogn."
, volume =	19
, year =	1986
, pages =	75
}

@inproceedings{g-aaagp-87
, author =	"S. K. Ghosh"
, title =	"Approximation algorithms for art gallery problems"
, booktitle =	"Proc. Canadian Inform. Process. Soc. Congress"
, year =	1987
, pages =	"??"
}

@inproceedings{g-cvspi-88
, author =	"S. K. Ghosh"
, title =	"Computing a Viewpoint of a Set of Points Inside a Polygon"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	338
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"18--29"
, update =	"96.05 agarwal, 94.05 ghosh"
}

@techreport{g-cvspi-90
, author =	"S. K. Ghosh"
, title =	"Computing a Viewpoint of a Set of Points Inside a Polygon"
, type =	"Technical {Report}"
, institution =	"Computer Science, Tata Inst."
, address =	"Bombay, India"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@techreport{g-cvpcs-86
, author =	"S. K. Ghosh"
, title =	"Computing the visibility polygon from a convex set"
, type =	"Report"
, number =	"CAR-TR-246"
, institution =	"Center Automat. Res., Univ. Maryland"
, address =	"College Park, MD"
, year =	1986
}

@article{g-cvpcs-91
, author =	"S. K. Ghosh"
, title =	"Computing visibility polygon from a convex set and related problems"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"75--95"
, keywords =	"polygon, visibility"
, update =	"94.05 ghosh"
}

@techreport{g-rcvgs-86
, author =	"S. K. Ghosh"
, title =	"On recognizing and characterizing visibility graphs of simple polygons"
, type =	"Report"
, number =	"JHU/EECS-86/14"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1986
, precedes =	"g-rcvgs-88"
}

@inproceedings{g-rcvgs-88
, author =	"S. K. Ghosh"
, title =	"On recognizing and characterizing visibility graphs of simple polygons"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"96--104"
, succeeds =	"g-rcvgs-86"
}

@article{g-rcvgs-97
, author =	"S. K. Ghosh"
, title =	"On recognizing and characterizing visibility graphs of simple polygons"
, journal =	"Discrete Comput. Geom."
, volume =	17
, year =	1997
, pages =	"143--162"
, succeeds =	"g-rcvgs-88"
, update =	"97.11 orourke"
}

@phdthesis{g-pcg-87
, author =	"S. K. Ghosh"
, title =	"Problems in Computational Geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Univ. Bombay"
, year =	1987
, keywords =	"doctoral thesis"
, update =	"94.05 ghosh"
}

@inproceedings{gb-olaeu-97
, author =	"Subir K. Ghosh and Joel W. Burdick"
, title =	"An On--line Algorithm for Exploring an Unknown Polygonal Environment by a Point Robot"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"100--105"
, update =	"97.11 jones"
}

@inproceedings{gb-udvra-97
, author =	"Subir K. Ghosh and Joel W. Burdick"
, title =	"Understanding Discrete Visibility and related Approximation Algorithms"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"106--111"
, update =	"97.11 jones"
}

@techreport{gm-oacmn-90t
, author =	"S. K. Ghosh and A. Maheshwari"
, title =	"An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon"
, type =	"Technical {Report}"
, number =	"CS-90/2"
, institution =	"Tata Inst."
, year =	1990
, precedes =	"gm-oacmn-90a"
, update =	"93.09 milone+mitchell"
}

% precise title ?
@article{gm-oacmn-90a
, author =	"S. K. Ghosh and A. Maheshwari"
, title =	"An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon"
, journal =	"Inform. Process. Lett."
, volume =	36
, year =	1990
, pages =	"277--280"
, keywords =	"Computational geometry, nested polygon, link path, relative convex hull"
, update =	"93.09 milone+mitchell+rote"
}

@techreport{gm-opadi-90
, author =	"S. K. Ghosh and A. Maheshwari"
, title =	"An optimal parallel algorithm for determining the intersection type of two star-shaped polygons"
, type =	"Technical {Report}"
, institution =	"TATA Inst."
, address =	"Bombay, India"
, month =	mar
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{gm-opadi-91
, author =	"S. K. Ghosh and A. Maheshwari"
, title =	"An optimal parallel algorithm for determining the intersection type of two star-shaped polygons"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"2--6"
, cites =	"ac-opavs-89,  acg-cdctd-89, cg-opapp-88, g-ltadi-84, hr-omsep-89, kr-spasm-88t, v-ismaa-83, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{gm-paaml-92
, author =	"S. K. Ghosh and A. Maheshwari"
, title =	"Parallel algorithms for all minimum link paths and link center problems"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"106--117"
}

@article{gmpsv-crwvp-93
, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
, title =	"Characterizing and recognizing weak visibility polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"213--233"
, update =	"94.05 ghosh"
}

@techreport{gmpsv-cwvpr-90t
, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
, title =	"Characterizing weak visibility polygons and related problems"
, type =	"Technical {Report}"
, number =	"IISc-CSA-90-1"
, institution =	"Dept. Comput. Sci. Auto., Indian Inst. Sci."
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{gmpsv-cwvpr-90
, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
, title =	"Characterizing weak visibility polygons and related problems"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"93--97"
, cites =	"at-oadvp-81, c-tsplt-90t, g-cvpcs-91, ghlst-ltavs-87, gmpsv-cwvpr-90t, hm-svpap-90, gpv-awvp-90, s-hpp-87, t-spsee-86, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{gmpsv-csptw-91
, author =	"Subir Kumar Ghosh and Anil Maheshwari and Sudebkumar Prasant Pal and Sanjeev Saluja and C. E. {Veni Madhavan}"
, title =	"Computing the Shortest Path Tree in a Weak Visibility Polygon"
, booktitle =	"Proc. 11th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	560
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"369--389"
, update =	"94.09 lambert, 94.05 ghosh, 93.09 milone+mitchell"
}

@inproceedings{gmpv-arpp-90
, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and C. E. {Veni Madhavan}"
, title =	"An algorithm for recognizing palm polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"246--251"
, cites =	"c-tsplt-90t, et-gpprl-89, h-ovgat-89, lp-oafkp-79, ZZZ"
, update =	"01.04 icking, 98.07 bibrelex, 95.01 smid, 94.05 ghosh"
}

@article{gmpv-arpp-94
, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and C. E. {Veni Madhavan}"
, title =	"An algorithm for recognizing palm polygons"
, journal =	"Visual Comput."
, volume =	10
, year =	1994
, pages =	"443--451"
, update =	"95.01 smid"
}

@techreport{gm-osacv-87t
, author =	"S. K. Ghosh and D. M. Mount"
, title =	"An output sensitive algorithm for computing visibility graphs"
, number =	"CS-TR-1874"
, institution =	"Department of Computer Science, University of Maryland"
, month =	jul
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{gm-osacv-87
, author =	"S. K. Ghosh and D. M. Mount"
, title =	"An output sensitive algorithm for computing visibility graphs"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"11--19"
, precedes =	"gm-osacv-91"
}

@article{gm-osacv-91
, author =	"S. K. Ghosh and D. M. Mount"
, title =	"An output-sensitive algorithm for computing visibility graphs"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"888--910"
, keywords =	"visibility, two-dimensional, line segments, polygons, output-dependent"
, succeeds =	"gm-osacv-87"
, annote =	"weak visibility between edges of polygonal obstacles;
		 $O(n \log n + E)$ time"
}

@techreport{gpv-awvp-90
, author =	"S. K. Ghosh and S. P. Pal and C. E. {Veni Madhavan}"
, title =	"Algorithms for weak visibility polygons"
, type =	"Technical {Report}"
, number =	"IISc-CSA-90-2"
, institution =	"TATA Inst."
, address =	"Bombay, India"
, month =	jan
, year =	1990
, update =	"94.09 lambert, 93.09 milone+mitchell"
}

@techreport{gpv-cwvpr-90
, author =	"S. K. Ghosh and S. P. Pal and C. E. {Veni Madhavan}"
, title =	"Characterizing weak visibility polygons and related problems"
, type =	"Technical {Report}"
, number =	"IISc-CSA-90-1"
, institution =	"TATA Inst."
, address =	"Bombay, India"
, month =	jan
, year =	1990
, update =	"94.09 lambert, 93.09 milone+mitchell"
}

@techreport{gs-oolaw-95
, author =	"S. K. Ghosh and S. Saluja"
, title =	"Optimal on-line algorithms for walking with minimum number of turns in unknown streets"
, type =	"Manuscript"
, number =	"RCS-94-2"
, institution =	"TATA Institute of Fundamental Research"
, address =	"Bombay, India"
, year =	1995
, keywords =	"link distance, shortest paths, competitive ratio, visibility, simple polygons"
, precedes =	"gs-oolaw-97"
, update =	"98.03 bibrelex+mitchell, 95.09 mitchell"
}

@article{gs-oolaw-97
, author =	"S. K. Ghosh and S. Saluja"
, title =	"Optimal on-line algorithms for walking with minimum number of turns in unknown streets"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, number =	5
, month =	oct
, year =	1997
, pages =	"241--266"
, keywords =	"link distance, shortest paths, competitive ratio, visibility, simple polygons"
, succeeds =	"gs-oolaw-95"
, update =	"98.03 mitchell"
}

@article{gs-ltacc-84
, author =	"S. K. Ghosh and R. K. Shyamasundar"
, title =	"A linear time algorithm for computing the convex hull of an ordered crossing polygon"
, journal =	"Pattern Recogn."
, volume =	17
, year =	1984
, pages =	"351--358"
}

@article{gs-ltaoc-83
, author =	"S. K. Ghosh and R. K. Shyamasundar"
, title =	"A linear time algorithm for obtaining the convex hull of a simple polygon"
, journal =	"Pattern Recogn."
, volume =	16
, year =	1983
, pages =	"587--592"
}

@article{ga-afgfo-68
, author =	"S. P. Ghosh and C. T. Abraham"
, title =	"Application of finite geometry in file organization for records with multiple-valued attributes"
, journal =	"IBM J. Res. Develop."
, volume =	12
, year =	1968
, pages =	"180--187"
}

@article{gg-frpmp-97
, author =	"M. Ghouse and M. Goodrich"
, title =	"Fast randomized parallel methods for planar convex hull construction"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"219--236"
, update =	"97.07 devillers"
}

@inproceedings{gg-eeprs-93
, author =	"Mujtaba Ghouse and Michael T. Goodrich"
, title =	"Experimental Evidence for the Power of Random Sampling in Practical Parallel Algorithms"
, booktitle =	"??"
, publisher =	"IEEE Computer Society"
, year =	1993
, pages =	"549--556"
, update =	"94.01 jones, 93.09 milone+mitchell"
}

@inproceedings{gg-ptpch-91
, author =	"M. Ghouse and M. T. Goodrich"
, title =	"In-place techniques for parallel convex hull algorithms"
, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
, year =	1991
, pages =	"192--203"
}

@inproceedings{gi-d23cpg-92
, author =	"D. Giammarresi and G. F. Italiano"
, title =	"Dynamic 2- and 3-Connectivity on Planar Graphs"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"221--232"
, update =	"95.05 tamassia"
}

@book{g-agt-85
, author =	"A. Gibbons"
, title =	"Algorithmic Graph Theory"
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1985
, keywords =	"graph theory, graph algorithms"
, update =	"00.03 bibrelex, 98.07 tamassia, 97.06 tollis"
}

@book{gr-epa-88
, author =	"A. Gibbons and W. Rytter"
, title =	"Efficient Parallel Algorithms"
, publisher =	"Cambridge University Press"
, address =	"New York"
, year =	1988
, update =	"96.09 orourke"
}

@inproceedings{g-mppm-89
, author =	"P. B. Gibbons"
, title =	"A more practical {PRAM} model"
, booktitle =	"Proc. 1st ACM Sympos. Parallel Algorithms Architect."
, year =	1989
, pages =	"158--168"
, update =	"96.09 orourke"
}

@inproceedings{gmr-qpacp-94
, author =	"P. B. Gibbons and Y. Matias and V. Ramachandran"
, title =	"The {QRQW} {PRAM}: Accounting for contention in parallel algorithms"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	""
, update =	"96.09 orourke"
}

@book{g-gsh-77
, author =	"P. J. Giblin"
, title =	"Graphs, Surfaces and Homology"
, edition =	"1st"
, publisher =	"Chapman and Hall"
, address =	"London"
, year =	1977
, update =	"98.03 bibrelex, 94.05 devillers"
}

@book{g-gsh-81
, author =	"P. J. Giblin"
, title =	"Graphs, Surfaces and Homology"
, edition =	"2nd"
, publisher =	"Chapman and Hall"
, address =	"London, UK"
, year =	1981
, update =	"98.03 bibrelex"
}

@article{gvw-rwgsi-96
, author =	"G. A. Gibson and J. S. Vitter and J. Wilkes"
, title =	"Report of the Working Group on Storage {I/O} Issues in Large-Scale Computing"
, journal =	"ACM Comput. Surv."
, volume =	28
, number =	4
, month =	dec
, year =	1996
, note =	"Also available as
		  \url{http://www.cs.duke.edu/~jsv/report.ps}"
, update =	"97.03 murali"
}

@article{ghjst-chtm-98
, author =	"T. S. Gieng and B. Hamann and K. I. Joy and G. L. Schussman and I. J. Trotts"
, title =	"Constructing Hierarchies for Triangle Meshes"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	4
, number =	2
, month =	apr
, year =	1998
, pages =	"145--161"
, update =	"98.11 held"
}

@article{g-beess-62
, author =	"O. Giering"
, title =	"Bestimmung von Eibereichen und Eik{\"o}rpern durch {Steiner} Symmetrisierungen"
, journal =	"Sber. Bayer. Akad. Wiss. M{\"u}nchen, Math.-Nat. Kl."
, volume =	"??"
, year =	1962
, pages =	"225--253"
, update =	"98.11 bibrelex"
}

@inproceedings{g-crtspmtl-99
, author =	"J. Giesen"
, title =	"Curve reconstruction, the {TSP}, and {Menger}'s theorem on length"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"207--216"
, update =	"00.03 orourke"
}

@techreport{g-plpg-93
, author =	"G.-J. Giezeman"
, title =	"{PlaGeo} - A Library for Planar Geometry"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, month =	aug
, year =	1993
, update =	"98.11 bibrelex"
}

@article{gcs-ecrag-91
, author =	"Z. Gigus and J. Canny and R. Seidel"
, title =	"Efficiently computing and representing aspect graphs of polyhedral objects"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	13
, number =	6
, month =	jun
, year =	1991
, pages =	"542--551"
, keywords =	"visibility, aspect graphs"
, update =	"98.11 bibrelex, 96.09 devillers, 94.09 orourke"
}

@article{gm-cagld-90
, author =	"Z. Gigus and J. Malik"
, title =	"Computing the Aspect Graph for Line Drawings of Polyhedral Objects"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	12
, number =	2
, year =	1990
, pages =	"113--122"
, update =	"98.03 smid, 97.11 bibrelex"
}

@inproceedings{gmv-ttnct-92
, author =	"J. Gil and Y. Matias and U. Vishkin"
, title =	"Towards a theory of nearly constant time parallel algorithms"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, update =	"98.03 bibrelex"
}

@inproceedings{gsw-sgm-89
, author =	"J. Gil and W. Steiger and A. Wigderson"
, title =	"Some geometric medians"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	5
}

@article{gw-c2dmm-93
, author =	"Y. Gil and M. Werman"
, title =	"Computing 2D Min, Max and Median Filters"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	15
, year =	1993
, pages =	"504--507"
, update =	"96.01 werman"
}

@article{gm-vlbe-59
, author =	"E. Gilbert and E. Moore"
, title =	"Variable-length binary encoding"
, journal =	"Bell Syst. Tech. J."
, volume =	38
, year =	1959
, pages =	"933--968"
, update =	"98.03 bibrelex"
}

@article{gf-cdgco-90
, author =	"E. G. Gilbert and C. P. Foo"
, title =	"Computing the Distance between General Convex Objects in Three-Dimensional Space"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, number =	1
, month =	feb
, year =	1990
, pages =	"53--61"
, update =	"98.11 bibrelex"
}

@article{gj-dfarp-85
, author =	"E. G. Gilbert and D. W. Johnson"
, title =	"Distance functions and their application to robot path planning in the presence of obstacles"
, journal =	"Internat. J. Robot. Autom."
, volume =	"RA-1"
, year =	1985
, pages =	"21--30"
, update =	"98.07 bibrelex"
}

@article{gjk-fpcdb-88
, author =	"E. G. Gilbert and D. W. Johnson and S. S. Keerthi"
, title =	"A fast procedure for computing the distance between complex objects"
, journal =	"Internat. J. Robot. Autom."
, volume =	4
, number =	2
, year =	1988
, pages =	"193--203"
, update =	"98.07 bibrelex"
}

@techreport{gjk-fpcdb-??
, author =	"E. G. Gilbert and D. W. Johnson and S. S. Keerthi"
, title =	"A fast procedure for computing the distance between complex objects in three space"
, type =	"Report"
, number =	"??"
, institution =	"Univ. Michigan"
, address =	"Ann Arbor, MI"
, year =	"??"
}

@article{g-gcpnc-58
, author =	"E. N. Gilbert"
, title =	"Gray Codes and Paths on the $n$-cube"
, journal =	"Bell Syst. Tech. J."
, volume =	"??"
, year =	1958
, pages =	"815--826"
, update =	"97.11 bibrelex"
}

@article{g-rssc-62
, author =	"E. N. Gilbert"
, title =	"Random subdivisions of space into crystals"
, journal =	"Ann. Math. Statist."
, volume =	33
, year =	1962
, pages =	"958--972"
}

@article{g-pc2sn-65
, author =	"E. N. Gilbert"
, title =	"The probability of covering $2$ sphere with {$N$} circular caps"
, journal =	"Biometrika"
, volume =	52
, year =	1965
, pages =	"323--330"
}

@article{gp-smt-68
, author =	"E. N. Gilbert and H. O. Pollak"
, title =	"Steiner minimal trees"
, journal =	"SIAM J. Appl. Math."
, volume =	16
, number =	1
, year =	1968
, pages =	"1--29"
}

@techreport{gs-tde-74
, author =	"E. N. Gilbert and L. A. Shepp"
, title =	"Textures for discrimination experiments"
, number =	"TM-74-1218-6, TM-74-1215-15"
, institution =	"Bell Laboratories"
, address =	"Murray Hill, NJ"
, month =	apr
, year =	1974
, update =	"97.11 bibrelex"
}

@article{ght-stgbg-84
, author =	"J. R. Gilbert and J. P. Hutchinson and R. E. Tarjan"
, title =	"A separation theorem for graphs of bounded genus"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"391--407"
, update =	"01.07 devillers, 98.03 bibrelex"
}

@techreport{gmt-gampi-92
, author =	"J. R. Gilbert and G. L. Miller and S.-H. Teng"
, title =	"A Geometric Approach to Mesh Partitioning: {Implementation} and Experiments"
, type =	"Technical {Report}"
, institution =	"Xerox Palo Alto Research Center"
, address =	"Palo Alto, CA"
, year =	1992
, update =	"98.03 bibrelex"
}

@article{gt-anda-87
, author =	"J. R. Gilbert and R. E. Tarjan"
, title =	"The analysis of a nested dissection algorithm"
, journal =	"Numer. Math."
, volume =	50
, year =	1987
, pages =	"377--404"
, update =	"97.11 bibrelex"
}

@techreport{g-nrpt-79
, author =	"P. D. Gilbert"
, title =	"New results in planar triangulations"
, type =	"Report"
, number =	"R-850"
, institution =	"Coordinated Sci. Lab., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1979
}

@book{gmw-po-81
, author =	"P. E. Gill and W. Murray and M. H. Wright"
, title =	"Practical Optimization"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1981
, update =	"97.11 bibrelex"
}

@inproceedings{gd-tdsgi-81
, author =	"R. Gillespie and W. A. Davis"
, title =	"Tree data structures for graphics and image processing"
, booktitle =	"Proc. Canad. Man-Computer Comm. Soc. Conf."
, site =	"Waterloo, Canada"
, year =	1981
, pages =	"155--162"
, update =	"97.11 bibrelex"
}

@article{gg-sosvm-64
, author =	"P. C. Gilmore and R. E. Gomory"
, title =	"Sequencing a one-state variable machine: {A} solvable case of the traveling salesman problem"
, journal =	"Oper. Res."
, volume =	12
, year =	1964
, pages =	"655--679"
, update =	"98.07 bibrelex"
}

@book{g-icgds-78
, author =	"W. K. Giloi"
, title =	"Interactive Computer Graphics: Data Structures, Algorithms, Languages"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1978
}

@inproceedings{gn-tpot-90
, author =	"D. Girault-Beauquier and M. Nivat"
, title =	"Tiling the plane with one tile"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"128--138"
, precedes =	"bn-toptp-91"
, cites =	"bg-gd-72, b-udp-66, gs-tp-87, g-p-66, h-etiah-86, p-p-78, r-untp-71, s-tleup-78, w-glc-65, wl-avpss-84, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{gos-rpps-93
, author =	"C. Gitlin and J. O'Rourke and V. Subramanian"
, title =	"On reconstructing polyhedra from parallel slices"
, type =	"Technical {Report}"
, number =	025
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	mar
, year =	1993
, keywords =	"triangulations, polyhedra, surface reconstruction"
, update =	"94.01 orourke"
}

@article{gos-rpps-96
, author =	"C. Gitlin and J. O'Rourke and V. Subramanian"
, title =	"On reconstructing polyhedra from parallel slices"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, number =	1
, year =	1996
, pages =	"103--122"
, keywords =	"triangulations, polyhedra, surface reconstruction"
, update =	"96.09 orourke, 96.05 orourke, 96.01 orourke, 95.05 orourke, 94.09 orourke, 94.01 orourke"
, annote =	"Gives an example of two polygons in parallel planes
		that cannot be connected to form a simple polyhedron
		on the same set of vertices.  One polygon is a triangle,
		the other a complicated spiraling shape of 63 vertices."
}

@inproceedings{gj-mv3du-96
, author =	"Carole S. Gitlin and Christopher R. Johnson"
, title =	"MeshView: visualizing 3D unstructured meshes"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"333--345"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@book{g-fa3dg-94
, author =	"G. Glaeser"
, title =	"Fast Algorithms for {3D}-Graphics"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1994
, isbn =	"0-387-94288-2"
, update =	"96.09 agarwal, 95.09 mitchell"
}

@inproceedings{gn-aep47-95
, author =	"Steve Glassman and Greg Nelson"
, title =	"An Animation of {Euclid's} Proposition 47: {The} {Pythagorean} Theorem"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"V3--V4"
, keywords =	"video review"
, cites =	"b-1saf-93, e-e-56, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@incollection{g-bvnup-94
, author =	"Andrew Glassner"
, title =	"Building Vertex Normals from an Unstructured Polygon List"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"60--73"
, keywords =	"smooth shading, topology, polyhedron"
, update =	"94.09 heckbert"
, annote =	"Solves a fairly common rendering problem: if one is given
a set of polygons in raw form, with no topological (adjacency) information,
and asked to do smooth shading (Gouraud or Phong shading) of them, one must
infer topology and compute vertex normals. Contains C code."
}

@incollection{gh-chfvl-94
, author =	"Andrew Glassner and Eric Haines"
, title =	"{C} Header File and Vector Library"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"558--570"
, keywords =	"vector algebra, root-finding"
, update =	"94.09 heckbert"
, annote =	"Revised version of the ``Graphics Gems'' subroutine
library, used in several other Gems in the book. Contains C code."
}

@book{g-irt-89
, author =	"A. S. Glassner"
, title =	"An Introduction to Ray Tracing"
, publisher =	"Academic Press"
, year =	1989
, update =	"98.03 bibrelex, 96.05 pocchiola"
}

@book{g-gg-90
, title =	"Graphics Gems {I}"
, editor =	"Andrew S. Glassner"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1990
, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
}

@article{g-ssfrt-84
, author =	"A. S. Glassner"
, title =	"Space Subdivision for Fast Ray Tracing"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	4
, number =	10
, month =	oct
, year =	1984
, pages =	"15--22"
, update =	"97.11 bibrelex"
}

@incollection{gchhhr-irt-87
, author =	"Andrew S. Glassner and Robert L. Cook and Eric Haines and Pat Hanrahan and Paul Heckbert and L. Richard Speer"
, title =	"Introduction to Ray Tracing"
, booktitle =	"SIGGRAPH '87 Introduction to Ray Tracing"
, year =	1987
, update =	"98.03 agarwal"
}

@article{gmhhwsbr-cads5-95
, author =	"R. Glen and G. Martin and A. Hill and R. Hyde and P. Wollard and J. Salmon and J. Buckingham and A. Robertson"
, title =	"Computer-aided design and sythesis of $5$-substituted tryptamines and their pharmacology at the $5-{HT}_{10}$ receptor: {Discovery} of compounds with potential anti-migraine properties"
, journal =	"J. Medical Chemistry"
, volume =	38
, year =	1995
, pages =	"3566--3580"
, update =	"98.07 bibrelex"
}

@techreport{ggglsttz-ftttd-96
, author =	"J. Glimm and M. J. Graham and J. Grove and X. L. Li and T. M. Smith and D. Tan and F. Tangerman and Q. Zhang"
, title =	"Front Tracking in Two and Three Dimensions"
, type =	"Technical {Report}"
, number =	"SUNYSB-AMS-96-12"
, institution =	"Applied Mathematics and Statistics, University at Stony Brook"
, year =	1996
, update =	"98.03 mitchell"
}

@article{g-mmbg-67
, author =	"F. Glover"
, title =	"Maximum Matching in bipartite Graph"
, journal =	"Naval Res. Logist. Quart."
, volume =	"??"
, year =	1967
, update =	"98.03 bibrelex"
}

@article{gks-cdrcp-99
, author =	"A. Glozman and K. Kedem and G. Shpitalnik"
, title =	"Computing a double-ray center for a planar point set"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, year =	1999
, pages =	"109--123"
, update =	"99.07 smid"
}

@inproceedings{gks-sgsop-95
, author =	"Alex Glozman and Klara Kedem and Gregory Shpitalnik"
, title =	"On some Geometric Selection and Optimization Problems via Sorted Matrices"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"26--37"
, update =	"99.07 bibrelex, 96.01 devillers+smid, 95.05 mitchell"
}

@article{gks-sgsop-98
, author =	"Alex Glozman and Klara Kedem and Gregory Shpitalnik"
, title =	"On some geometric selection and optimization problems via sorted matrices"
, journal =	"Comput. Geom. Theory Appl."
, volume =	11
, year =	1998
, pages =	"17--28"
, succeeds =	"gks-sgsop-95"
, update =	"98.11 devillers"
}

@article{ggsbcg-ocrot-89
, author =	"A. F. Gmitro and J. E. Greivenkamp and W. Swindell and H. H. Barett and M. Y. Chiu and S. K. Gordon"
, title =	"Optical computers for reconstructing objects from their x-ray projections"
, journal =	"Optical. Engineering"
, volume =	19
, number =	3
, year =	1989
, pages =	"260--272"
, update =	"97.11 bibrelex"
}

@article{gs-rclcd-70
, author =	"N. Go and H. Scherga"
, title =	"Ring closure and local conformational deformations of chain molecules"
, journal =	"Macromolecules"
, volume =	3
, number =	2
, year =	1970
, pages =	"178--187"
, update =	"98.07 bibrelex"
}

@article{g-spaph-82
, author =	"C. Goad"
, title =	"Special Purpose Automatic Programming for Hidden Surface Elimination"
, journal =	"Comput. Graph."
, volume =	16
, number =	3
, month =	jul
, year =	1982
, pages =	"167--178"
, note =	"Proc. SIGGRAPH '82"
, update =	"97.11 bibrelex"
}

@inproceedings{g-nmccd-91
, author =	"M. Godau"
, title =	"A Natural Metric for Curves -- Computing the Distance for Polygonal Chains and Approximation Algorithms"
, booktitle =	"Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	480
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"127--136"
, update =	"97.03 gaertner+salinger"
}

@mastersthesis{g-fmpaa-91
, author =	"M. Godau"
, title =	"Die {Fr{\'e}chet}-{Metrik} f{\"u}r {P}olygonz{\"u}ge -- {Algorithmen} zur {Abstandsmessung} und {Approximation}"
, type =	"Masters Thesis"
, school =	"Fachbereich Mathematik, Freie Univ. Berlin"
, address =	"Berlin, Germany"
, year =	1991
, keywords =	"masters thesis"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{g-depgi-95
, author =	"M. Godau"
, title =	"On the Difficulty of Embedding Planar Graphs with Inaccuracies"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"254--261"
, keywords =	"graph drawing, placement, NP-hardness"
, update =	"95.01 tamassia"
}

@techreport{gkk-fdsp-
, author =	"W. Goddard and M. Katchalski and D. J. Kleitman"
, title =	"Forcing disjoint segments in the plane"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, update =	"98.03 bibrelex"
}

@article{g-qwcet-88
, author =	"L. Goddyn"
, title =	"Quantizers and the worst-case {Euclidean} traveling salesman problem"
, journal =	"J. Combin. Theory Ser. B"
, volume =	50
, year =	1988
, pages =	"65--81"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@article{gw-agatc-95
, author =	"Michel X. Goemans and David P. Williamson"
, title =	"A General Approximation Technique for Constrained Forest Problems"
, journal =	"SIAM J. Comput."
, volume =	24
, number =	2
, year =	1995
, pages =	"296--317"
, update =	"98.03 agarwal"
}

@book{gt-smmp-60
, author =	"G. Goertzel and N. Tralli"
, title =	"Some Mathematical Methods of Physics"
, publisher =	"McGraw-Hill"
, year =	1960
, update =	"98.03 bibrelex"
}

@article{g-rmssl-80
, author =	"J. L. Goffin"
, title =	"The Relaxation Method for Solving Systems of Linear Inequalities"
, journal =	"Math. Oper. Res."
, volume =	5
, number =	3
, month =	aug
, year =	1980
, pages =	"388--414"
, update =	"97.11 bibrelex"
}

@article{g-pboot-81
, author =	"I. Golan"
, title =	"Performance bounds for orthogonal oriented two-dimensional packing algorithms"
, journal =	"SIAM J. Comput."
, volume =	10
, year =	1981
, pages =	"571--582"
}

@inproceedings{g-cac-99
, author =	"C. Gold"
, title =	"Crust and anti-crust: {A} one-step boundary and skeleton extraction algorithm"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"189--196"
, update =	"00.03 orourke"
}

@inproceedings{gc-sontr-86
, author =	"C. Gold and S. Cormack"
, title =	"Spatially ordered networks and topographic reconstructions"
, booktitle =	"Proc. 2nd Internat. Sympos. Spatial Data Handling"
, year =	1986
, pages =	"74--85"
, update =	"97.11 bibrelex"
}

@inproceedings{g-odsma-92
, author =	"C. M. Gold"
, title =	"An object-based dynamic spatial model, and its application in the development of a user-friendly digitizing system"
, booktitle =	"Proc. 5th Internat. Sympos. Spatial Data Handling"
, site =	"Charleston"
, year =	1992
, pages =	"495--504"
, update =	"98.11 bibrelex"
}

@inproceedings{g-dsdsv-92
, author =	"C. M. Gold"
, title =	"Dynamic spatial data structures -- the {Voronoi} approach"
, booktitle =	"Proc. Canad. Conf. GIS"
, site =	"Ottawa"
, year =	1992
, pages =	"245--255"
, update =	"93.05 freimer"
}

@inproceedings{g-fsdss-93
, author =	"C. M. Gold"
, title =	"Forestry spatial decision support system classification and the flight simulator approach"
, booktitle =	"Proc. GIS'93"
, site =	"Vancouver"
, year =	1993
, pages =	"797--802"
, update =	"98.11 bibrelex"
}

@inproceedings{g-ovdtu-87
, author =	"C. M. Gold"
, title =	"Ordering of {Voronoi} diagrams and their use in terrain database management"
, booktitle =	"Proc. 8th Internat. Sympos. Comput.-Assist. Cartog."
, site =	"Baltimore"
, year =	1987
, pages =	"185--194"
, update =	"93.05 freimer"
}

@inproceedings{g-psrsd-94
, author =	"C. M. Gold"
, title =	"Persistent Spatial Relations - a Systems Design Objective"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"219--224"
, cites =	"a-vdsfg-91, bb-dvddt-90, cegss-cfals-91, f-savd-87, g-sdsed-90, g-srbb-90, g-odsma-92, g-fsdss-93, gcr-acmut-77, gks-ricdv-92, k-eccs-79, as-sdcav-94, obs-stcav-92, pc-cds-75, r-vdds-90, r-vdds-93, s-dmgsm-91, sh-cpp-75, t-tdrac-93, tcm-chgd-76, w-dpo-78, b-dgs-70, gc-sdsig-94, gmr-vdmpp-92, ZZZ"
, update =	"99.11 bibrelex, 98.11 bibrelex, 94.09 jones"
}

@article{g-phsdv-91
, author =	"C. M. Gold"
, title =	"Problems with handling spatial data -- {The Voronoi} approach"
, journal =	"CISM Journal ACSGC"
, volume =	45
, number =	1
, year =	1991
, pages =	"65--80"
, keywords =	"GIS, geography, surfaces, approximation"
, update =	"95.01 mitchell"
}

@inproceedings{g-srbb-90
, author =	"C. M. Gold"
, title =	"Space revisited: back to the basics"
, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
, site =	"Z{\"u}rich"
, year =	1990
, pages =	"175--189"
, update =	"98.11 bibrelex"
}

@incollection{g-sdsed-90
, author =	"C. M. Gold"
, title =	"Spatial data structures: the extension from one to two dimensions"
, editor =	"L. F. Pau"
, booktitle =	"Mapping and Spatial Modelling in Navigation"
, series =	"NATO ASI Series F"
, volume =	65
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1990
, pages =	"11--39"
, update =	"98.11 bibrelex"
}

@techreport{g-sovnt-85
, author =	"C. M. Gold"
, title =	"Spatial ordering of {Voronoi} networks and their use in terrain modeling"
, type =	"Report"
, number =	"??"
, institution =	"Contoursoft Corp."
, address =	"Edmonton, AB"
, year =	1985
}

@inproceedings{g-sivsa-92
, author =	"C. M. Gold"
, title =	"Surface interpolation as a {Voronoi} spatial adjacency problem"
, booktitle =	"Proc. Canad. Conf. GIS"
, site =	"Ottawa"
, year =	1992
, pages =	"419--431"
, update =	"93.05 freimer"
}

@article{g-vsmtt-92
, author =	"C. M. Gold"
, title =	"The {Voronoi} spatial model -- two and three dimensional applications in image analysis"
, journal =	"ITC J."
, volume =	"??"
, year =	1992
, note =	"To appear"
, update =	"93.05 freimer"
}

@article{gcr-acmut-77
, author =	"C. M. Gold and T. D. Charters and J. Ramsden"
, title =	"Automated Contour Mapping Using Triangular Element Data Structures and an Interpolant Over Each Irregular Triangular Domain"
, journal =	"Comput. Graph."
, volume =	11
, number =	2
, year =	1977
, pages =	"170--175"
, update =	"96.09 devillers"
, annote =	"Fits surface to irregular points by triangulating and
		 then using a polynomial over each triangle. An initial
		 triangulation is found by subdividing the triangle
		 enclosing each new point into four. The triangulation
		 is then improved by switchings (empirical tests suggest
		 time $3\log t$ for switchings). Switchings based on
		 ``Maximize minimum triangle height''."
}

@article{gc-sdsig-94
, author =	"C. M. Gold and A. R. Condal"
, title =	"A spatial data structure integrating GIS and simulation in a marine environment"
, journal =	"Marine Geodesy"
, volume =	"??"
, year =	1994
, note =	"submitted"
, update =	"98.11 bibrelex"
}

@inproceedings{gm-tsocc-78
, author =	"C. M. Gold and U. Maydell"
, title =	"Triangulation and spatial ordering in computer cartography"
, booktitle =	"Proc. Canad. Cardographic Association Annu. Meeting"
, year =	1978
, pages =	"69--81"
, update =	"97.11 bibrelex"
}

@inproceedings{grr-vdlsm-95
, author =	"Christopher M. Gold and Peter M. Remmele and Thomas Roos"
, title =	"Voronoi Diagrams of Line Segments Made Easy"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"223--228"
, update =	"95.09 jones"
}

@proceedings{gr-p7ccc-95
, title =	"Proc. 7th Canad. Conf. Comput. Geom."
, editor =	"Christopher M. Gold and Jean-Marc Robert"
, publisher =	"Geomatics Research Centre, Univ. Laval"
, address =	"Qu\'ebec, QC"
, month =	aug
, year =	1995
, url =	"http://www.uqac.uquebec.ca/DIM/prof/jmrobert/Proceedings_e.html"
, update =	"95.09 jones"
}

@article{gykd-cdma3-91
, author =	"J. A. Goldak and X. Yu and A. Knight and L. Dong"
, title =	"Constructing discrete medial axis of {3-D} objects"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	3
, year =	1991
, pages =	"327--339"
, keywords =	"Delaunay triangulation, medial axis"
}

@inproceedings{gpst-ipmpc-89
, author =	"A. V. Goldberg and S. A. Plotkin and D. B. Shmoys and E. Tardos"
, title =	"Interior-point methods in parallel computation"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"350--355"
, comments =	"Submitted to SIAM J. Comput."
}

@incollection{gtt-nfa-90
, author =	"A. V. Goldberg and E. Tardos and R. E. Tarjan"
, title =	"Network flow algorithms"
, editor =	"B. Korte and L. Lov{\'a}sz and H. J. Pr{\"o}mel and A. Schrijver"
, booktitle =	"Paths, Flows, and VLSI-Layout"
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"101--164"
, update =	"97.11 bibrelex"
}

@inproceedings{gt-namfp-86
, author =	"A. V. Goldberg and R. E. Tarjan"
, title =	"A new approach to the maximum flow problem"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"136--146"
, update =	"98.03 bibrelex"
}

@article{gt-namfp-88
, author =	"A. V. Goldberg and R. E. Tarjan"
, title =	"A new approach to the maximum flow problem"
, journal =	"J. ACM"
, volume =	35
, year =	1988
, pages =	"921--940"
, update =	"97.11 bibrelex"
}

@article{g-wecss-91
, author =	"D. Goldberg"
, title =	"What Every Computer Scientist Should Know About Floating-Point Arithmetic"
, journal =	"ACM Comput. Surv."
, volume =	23
, number =	1
, month =	mar
, year =	1991
, pages =	"5--48"
, keywords =	"numerical precision, stability, robustness"
, update =	"97.11 bibrelex, 93.09 held"
}

@book{ghlw-afr-95
, title =	"Algorithmic Foundations of Robotics"
, editor =	"K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1995
, update =	"97.03 schwarzkopf"
}

@article{g-oppws-93
, author =	"Kenneth Y. Goldberg"
, title =	"Orienting Polygonal Parts Without Sensors"
, journal =	"Algorithmica"
, volume =	10
, year =	1993
, pages =	"201--225"
, keywords =	"part orientation, parallel-jaw gripper"
, update =	"96.09 romanik"
}

@phdthesis{g-sprm-90
, author =	"K. Y. Goldberg"
, title =	"Stochastic plans for robotic manipulation"
, school =	"School Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, month =	aug
, year =	1990
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@inproceedings{gme-gsppp-91
, author =	"K. Y. Goldberg and M. T. Mason and M. A. Erdmann"
, title =	"Generating stochastic plans for a programmable parts feeder"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, month =	apr
, year =	1991
, update =	"98.07 bibrelex"
}

@article{g-ipp-35
, author =	"M. Goldberg"
, title =	"The isoperimetric problem for polyhedra"
, journal =	"Tohoku Mathematics Journal"
, volume =	40
, year =	1935
, pages =	"226--236"
, update =	"97.11 bibrelex"
}

@article{g-mpmmm-73
, author =	"M. Goldberg"
, title =	"The minimum path and the minimum motion of a moved line segments"
, journal =	"Math. Mag."
, volume =	46
, year =	1973
, pages =	"31--34"
, update =	"98.03 bibrelex"
}

@inproceedings{gz-odapp-95
, author =	"T. Goldberg and U. Zwick"
, title =	"Optimal Deterministic Approximate Parallel Prefix Sums and Their Applications"
, booktitle =	"Proc. 4th IEEE Israel Symp. on Theory of Computing and Systems"
, year =	1995
, pages =	"220--228"
, update =	"96.09 orourke"
}

@article{glv-op-91
, author =	"Bruce L. Golden and Larry Levy and Rakesh Vohra"
, title =	"The Orienteering Problem"
, journal =	"Naval Res. Logistics"
, volume =	34
, year =	1991
, pages =	"307--318"
, keywords =	"TSP, generalized TSP"
, update =	"98.03 mitchell"
}

@inproceedings{g-ocsa-93
, author =	"D. Goldfarb"
, title =	"On the complexity of the simplex algorithm"
, editor =	"S. Gomez"
, booktitle =	"IV. Workshop on Numerical Analysis and Optimization"
, site =	"Oaxaca, Mexico"
, year =	1993
, update =	"97.03 gaertner+salinger"
}

@inproceedings{g-csa-94
, author =	"Donald Goldfarb"
, title =	"On the complexity of the simplex algorithm"
, booktitle =	"Advances in optimization and numerical analysis"
, publisher =	"Kluwer"
, address =	"Dordrecht"
, year =	1994
, pages =	"25--38"
, update =	"97.11 bibrelex"
}

@techreport{g-wccsv-83
, author =	"D. Goldfarb"
, title =	"Worst case complexity of the shadow vertex simplex al\-go\-rithm"
, type =	"Preprint"
, institution =	"Co\-lum\-bia University"
, year =	1983
, update =	"97.03 gaertner+salinger"
}

@article{gs-wcbse-79
, author =	"D. Goldfarb and W. Y. Sit"
, title =	"Worst case behavior of the steepest edge simplex method"
, journal =	"Discrete Appl. Math."
, volume =	1
, year =	1979
, pages =	"277--285"
, update =	"97.03 gaertner+salinger"
}

@article{gmtf-nrtcr-89
, author =	"J. Goldfeather and S. Molnar and G. Turk and H. Fuchs"
, title =	"Near Real-Time {CSG} Rendering Using Tree Normalization and Geometric Pruning"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	9
, number =	3
, year =	1989
, pages =	"20--28"
, update =	"93.09 goodrich"
}

@article{g-idppr-67
, author =	"J. R. Goldman"
, title =	"Infinitely divisible point processes in {$R^{n}$}"
, journal =	"J. Math. Anal. Appl."
, volume =	17
, year =	1967
, pages =	"133--146"
}

@incollection{g-rssm-87
, author =	"R. Goldman"
, title =	"The role of surfaces in solid geometric modeling"
, editor =	"G. E. Farin"
, booktitle =	"Geometric Modeling: Algorithms and New Trends"
, publisher =	"Society for Industrial and Appliced Mathematics"
, year =	1987
, pages =	"69--90"
, update =	"98.07 bibrelex"
}

@article{g-mrtii-85
, author =	"R. N. Goldman"
, title =	"The methods of resolvents: a technique for the implicitization, inversion and intersection of non-planar, parametric, rational cubic curves"
, journal =	"Comput. Aided Geom. Design"
, volume =	"??"
, year =	1985
, update =	"98.03 bibrelex"
}

@article{gs-sarpc-85
, author =	"Ronald N. Goldman and Thomas W. Sederberg"
, title =	"Some Applications of Resultants to Problems in Computational Geometry"
, journal =	"Visual Comput."
, volume =	1
, number =	2
, month =	oct
, year =	1985
, pages =	"101--107"
}

@article{g-segta-89
, author =	"S. Goldman"
, title =	"A Space Efficient Greedy Triangulation Algorithm"
, journal =	"Inform. Process. Lett."
, volume =	31
, number =	4
, year =	1989
, pages =	"191--196"
, annote =	"CDT is used to compute GT. DT is constrained to
		 include all the edges of the GT so far. Next edge can
		 be found in time O(n)."
, abstract =	"We show that the greedy triangulation of n points in
		 the plane can be computed in O(n**2 log n) time and
		 O(n) memory and storage. In particular we show that, by
		 maintaining a generalized Delaunay triangulation, the
		 next edge to be added to the greedy triangulation can
		 be found in O(n) time. Furthermore, if the generalized
		 Delaunay triangulation of a simple polygon could be
		 computed in O(n) time, our algorithm would compute the
		 greedy triangulation in O(n**2) time. (Author abstract)
		 13 Refs."
}

@article{gsa-vetii-84
, author =	"R. Goldmann and T. Sederberg and R. Anderson"
, title =	"Vector elimination: a technique for implicitization, inversion and intersection of planar parametric rational polynomial curves"
, journal =	"Comput. Aided Geom. Design"
, volume =	1
, year =	1984
, pages =	"327--356"
, update =	"98.03 bibrelex"
}

@article{gs-acohr-87
, author =	"J. Goldsmith and J. Salmon"
, title =	"Automatic Creation of Object Hierarchies for Ray Tracing"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	7
, year =	1987
, pages =	"14--20"
, update =	"98.03 mitchell"
}

@book{g-cra-67
, author =	"A. A. Goldstein"
, title =	"Constructive Real Analysis"
, publisher =	"Harper \& Row Publishers"
, address =	"New York, NY"
, year =	1967
, update =	"98.03 bibrelex"
}

@techreport{gr-ibtsp-87
, author =	"A. S. Goldstein and E. M. Reingold"
, title =	"Improved bounds on the traveling salesman problem in the unit cube"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1987
, update =	"97.11 bibrelex"
}

@book{g-cm-80
, author =	"H. Goldstein"
, title =	"Classical Mechanics"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1980
, update =	"98.07 bibrelex"
}

@inproceedings{grsy-pqlc-97
, author =	"J. Goldstein and R. Ramakrishnan and U. Shaft and J.-B. Yu"
, title =	"Processing queries by linear constraints"
, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
, year =	1997
, pages =	"257--267"
, update =	"97.07 agarwal"
}

@techreport{gpsw-3dwmu-87
, author =	"M. Goldstein and F. G. Pin and G. de Saussure and C. R. Weisbin"
, title =	"3-D World Modeling With Updating Capability Based on Combinatorial Geometry"
, type =	"Technical {Report}"
, number =	"CESAR-87/02"
, institution =	"Oak Ridge National Laboratory"
, year =	1987
, update =	"93.09 milone+mitchell"
}

@article{g-aslpr-95
, author =	"M. Goldwasser"
, title =	"A survey of linear programming in randomized subexponential time"
, journal =	"SIGACT News"
, volume =	26
, number =	2
, year =	1995
, pages =	"96--104"
, update =	"97.03 agarwal+gaertner+salinger"
}

@inproceedings{g-imap-95
, author =	"Michael Goldwasser"
, title =	"An Implementation for Maintaining Arrangements of Polygons"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C32--C33"
, keywords =	"randomized incremental algorithm"
, cites =	"ci-tsc-84, egs-oplms-86, m-cgitr-93, rggr-esaac-94, s-sfira-91, s-opgfg-91, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@techreport{g-pacpa-88
, author =	"M. Golin"
, title =	"Probabilistic analysis of a closest pair algorithm"
, type =	"Technical {Report}"
, number =	"TR-194-88"
, institution =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, month =	dec
, year =	1988
, update =	"98.07 bibrelex"
}

@techreport{grss-rdsdc-93t
, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
, title =	"Randomized data structures for the dynamic closest-pair problem"
, type =	"Report"
, number =	"MPI-I-93-102"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
}

@inproceedings{grss-rdsdc-93i
, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
, title =	"Randomized Data Structures for the Dynamic Closest-Pair Problem"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1993
, pages =	"301--310"
, update =	"98.11 bibrelex, 93.05 smid"
}

@article{grss-rdsdc-98
, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
, title =	"Randomized Data Structures for the Dynamic Closest-Pair Problem"
, journal =	"SIAM J. Comput."
, volume =	27
, year =	1998
, pages =	"1036--1072"
, update =	"98.07 smid"
}

@techreport{grss-sracp-92
, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
, title =	"Simple randomized algorithms for closest pair problems"
, type =	"Report"
, number =	"MPI-I-92-155"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
, precedes =	"grss-sracp-93"
, update =	"98.11 bibrelex"
}

@inproceedings{grss-sracp-93
, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
, title =	"Simple randomized algorithms for closest pair problems"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"246--251"
, succeeds =	"grss-sracp-92"
, cites =	"b-lbact-83, bs-dcms-76, dm-nuchf-90, cms-frric-92i, grss-rdsdc-93i, km-srsac-91, ls-ekcpo-92i, sss-oaolc-92, s-sdlpc-91, r-pa-76, s-barg-92, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{grss-sracp-95
, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
, title =	"Simple randomized algorithms for closest pair problems"
, journal =	"Nordic J. Comput."
, volume =	2
, year =	1995
, pages =	"3--27"
, update =	"95.09 smid"
}

@inproceedings{gs-asyec-88
, author =	"M. Golin and R. Sedgewick"
, title =	"Analysis of a simple yet efficient convex hull algorithm"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"153--163"
, cites =	"bs-dclet-78, dt-nleta-81, e-nchap-77, gs-prp-85, ol-fcbch-80, ps-cgi-85, rs-udkhv-63, r-pma-76, s-a-83, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{g-dcppa-92
, author =	"M. J. Golin"
, title =	"Dynamic closest pairs -- a probabilistic approach"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"340--351"
, update =	"94.01 smid"
}

@article{g-hmmcb-93
, author =	"M. J. Golin"
, title =	"How many maxima can there be?"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, year =	1993
, pages =	"335--353"
, update =	"96.09 devillers"
}

@inproceedings{g-ltmwt-96
, author =	"Mordecai J. Golin"
, title =	"Limit theorems for minimum-weight triangulations, other {Euclidean} functionals, and probabilistic recurrence relations"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"252--260"
, keywords =	"uniform distribution, MWT, degree probabilities of Delaunay triangulations"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@inproceedings{g-mcr-92
, author =	"Mordecai J. Golin"
, title =	"Maxima in Convex Regions"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"23--27"
, update =	"00.03 bibrelex"
}

@inproceedings{g-mcr-93
, author =	"M. J. Golin"
, title =	"Maxima in Convex Regions"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"352--360"
, keywords =	"probabilistic geometry"
, update =	"93.09 rote, 93.05 smid"
}

@techreport{g-pacpa-91
, author =	"M. J. Golin"
, title =	"Probabilistic analyses of closest pair algorithms"
, type =	"Report"
, number =	1471
, institution =	"INRIA"
, address =	"Rocquencourt, France"
, year =	1991
}

@phdthesis{g-paga-90
, author =	"M. J. Golin"
, title =	"Probabilistic analysis of geometric algorithms"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NY"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"93.05 smid"
}

@inproceedings{gn-ac3vd-01
, author =	"Mordecai J. Golin and Hyeon-Suk Na"
, title =	"On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"127--135"
, update =	"02.03 devillers"
}

@inproceedings{gss-fdcg-92
, author =	"M. J. Golin and C. Schwarz and M. Smid"
, title =	"Further dynamic computational geometry"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"154--159"
, cites =	"ako-iqco-91, a-dcg-83, dsst-mdsp-89, fl-vdmpp-91, ps-cgi-85, k-nrdsc-92, st-pplup-86, st-dsdt-83, ZZZ"
, update =	"98.07 bibrelex"
}

@book{g-p-65
, author =	"S. W. Golomb"
, title =	"Polyominoes"
, publisher =	"Charles Scribner's Sons"
, address =	"New York"
, year =	1965
, update =	"98.07 bibrelex"
}

@book{g-p-66
, author =	"S. W. Golomb"
, title =	"Polyominoes"
, publisher =	"Georges Allen and Unwin Ltd"
, address =	"London, UK"
, year =	1966
, update =	"97.11 bibrelex"
}

@book{gl-mc-83
, author =	"G. Golub and C. van Loan"
, title =	"Matrix Computations"
, publisher =	"Johns Hopkins Univ. Press"
, address =	"Baltimore, MA"
, year =	1983
, update =	"97.11 bibrelex"
}

@book{gl-mc-89
, author =	"G. H. Golub and C. F. van Loan"
, title =	"Matrix computations"
, edition =	"2nd"
, publisher =	"Johns Hopkins University Press"
, address =	"Baltimore, MD"
, year =	1989
, update =	"98.03 bibrelex"
}

@book{gg-smts-73
, author =	"M. Golubitsky and V. Guillemin"
, title =	"Stable mappings and their singularities"
, publisher =	"Springer-Verlag"
, year =	1973
, update =	"97.11 bibrelex"
}

@book{g-agtpg-80
, author =	"M. C. Golumbic"
, title =	"Algorithmic Graph Theory and Perfect Graphs"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1980
}

@inproceedings{gm-gigt-82
, author =	"M. C. Golumbic and C. L. Monma"
, title =	"A generalization of interval graphs with tolerances"
, booktitle =	"Proc. 13th Southeastern Conf. on Combinatorics, Graph Theory and Computing"
, site =	"Winnipeg"
, series =	"Congr. Numer."
, volume =	35
, organization =	"Utilitas Math."
, year =	1982
, pages =	"321--331"
, update =	"98.11 bibrelex"
}

@article{gmt-tg-84
, author =	"M. C. Golumbic and C. L. Monma and W. T. Trotter"
, title =	"Tolerance graphs"
, journal =	"Discrete Appl. Math."
, volume =	9
, year =	1984
, pages =	"157--170"
, update =	"98.11 bibrelex"
}

@article{gg-dmtds-79
, author =	"D. Gomez and A. Guzman"
, title =	"Digital Model for Three-Dimensional Surface Representation"
, journal =	"Geo-Process."
, volume =	1
, year =	1979
, pages =	"53--70"
, update =	"98.11 bibrelex"
}

@inproceedings{g-lttii-95
, author =	"Teresa G{\'o}mez-Diaz"
, title =	"Let {$T$} be a Triangle, Is It Isosceles?"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"47--51"
, update =	"00.03 bibrelex"
}

@inproceedings{ghrst-icp-98
, author =	"Francisco G{\'o}mez and Ferran Hurtado and Suneeta Ramaswami and Vera Sacrist{\'a}n and Godfried Toussaint"
, title =	"Implicit Convex Polygons"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"83--85"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{grt-rnacg-97
, author =	"F. Gomez and S. Ramaswami and G. Toussaint"
, title =	"On Removing Non-degeneracy Assumptions in Computational Geometry"
, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1203
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"86--99"
, update =	"00.03 devillers, 98.03 mitchell"
}

@book{gb-hads-91
, author =	"G. H. Gonnet and R. Baeza-Yates"
, title =	"Handbook of Algorithms and Data Structures"
, publisher =	"Addison-Wesley"
, year =	1991
, update =	"97.03 tamassia"
}

@article{gmw-ddssl-83
, author =	"G. H. Gonnet and J. I. Munro and D. Wood"
, title =	"Direct dynamic structures for some line segment problems"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	"??"
, year =	1983
, pages =	"178--186"
}

@book{g-itsn-86
, author =	"Harry Gonshor"
, title =	"An introduction to the theory of surreal numbers"
, series =	"London Mathematical Society lecture note series"
, volume =	110
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1986
, update =	"98.11 bibrelex"
}

@article{g-sdilp-91
, author =	"C. C. Gonzaga"
, title =	"Search directions for interior linear-programming methods"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"153--181"
}

@techreport{grsz-odgpa-89
, author =	"T. M. Gonzales and M. Razzazi and M. Shing and S. Zheng"
, title =	"On optimal $d$-guillotine partitions approximating hyperrectangular partitions"
, type =	"Technical {Report}"
, number =	"89-25"
, institution =	"Dept. Comput. Sci., Univ. California"
, address =	"Santa Barbara, CA"
, month =	oct
, year =	1989
, update =	"98.07 bibrelex"
}

@techreport{g-asrp-75
, author =	"T. Gonzalez"
, title =	"Algorithms on sets and related problems"
, type =	"Technical {Report}"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Oklahoma"
, address =	"Norman, OK"
, year =	1975
}

@article{g-cmmid-85
, author =	"T. Gonzalez"
, title =	"Clustering to minimize the maximum intercluster distance"
, journal =	"Theoret. Comput. Sci."
, volume =	38
, year =	1985
, pages =	"293--306"
, update =	"96.05 agarwal"
}

@article{g-cspms-91
, author =	"T. Gonzalez"
, title =	"Covering a set of points in multidimensional space"
, journal =	"Inform. Process. Lett."
, volume =	40
, year =	1991
, pages =	"181--188"
, update =	"96.09 devillers, 96.05 agarwal"
}

@inproceedings{gr-aaphp-91
, author =	"T. Gonzalez and M. Razzazi"
, title =	"An approximation algorithm for partitioning a hyperrectilinear polytope with holes"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"183--186"
, keywords =	"orthogonal hyperplane segments"
, cites =	"dc-fhmel-86, dps-melgr-86, grz-edcaa-89, gz-bprp-85, gz-aaprp-85, gz-ibrgp-89, l-hmelr-83, lprs-melpr-82, l-mltfr-85, l-fhmlr-86, r-ppis-82, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{gr-pacdt-91
, author =	"Teofilo Gonzalez and Mohammadreza Razzazi"
, title =	"Properties and algorithms for constrained {Delaunay} triangulations"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"114--117"
, cites =	"c-tpca-82, c-cdt-87, j-oacdt-88, j-ccdt-88, f-savd-87, gs-pmgsc-85, l-scsi-77, ls-tacdt-80, ll-gdtpg-86, nf-scbut-83, ps-cgi-85, s-cdtvd-89, sh-cpp-75, ws-oacdt-87, ZZZ"
, update =	"98.07 bibrelex"
}

@article{grsz-ogpao-94
, author =	"T. Gonzalez and M. Razzazi and M.-T. Shing and S.-Q. Zheng"
, title =	"On optimal guillotine partitions approximating optimal {$d$}-box partitions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, number =	1
, year =	1994
, pages =	"1--12"
, keywords =	"approximation algorithms, d-box partitions, polynomial time complexity, guillotine partitions"
, update =	"98.03 mitchell"
, annote =	"Abstract:
Given a set of n points, P, in E(d)(the plane when d = 2) that lie
inside a d-box (rectangle when d = 2) R, we study the problem of
partitioning R into d-boxes by introducing a set of orthogonal
hyperplane segments (line segments when d = 2) whose total (d -
1)-volume (length when d = 2) is the least possible. In a valid d-box
partition, each point in P must be included in at least one
partitioning orthogonal hyperplane segment. Since this minimization
problem is NP-hard and thus likely to be computationally intractable,
we present an approximation algorithm to generate a suboptimal
solution. This solution is obtained by finding an optimal guillotine
partition, i.e., a special type of rectangular partition, which can be
generated in O(dn2d+1) time. We present a simple proof that the (d -
1)-volume of an optimal guillotine partition is not greater than 2d -
4 + 4/d times the (d - 1)-volume of an optimal d-box partition."
}

@techreport{grz-edcaa-89
, author =	"T. Gonzalez and M. Razzazi and S.-Q. Zheng"
, title =	"An efficient divide-and-conquer approximation algorithm for hyperrectangular partitions"
, type =	"Report"
, number =	"TR-89-24"
, institution =	"CS Dept., UCSB"
, month =	oct
, year =	1989
, precedes =	"grz-edcaa-90, gz-edcap-93"
, update =	"98.07 bibrelex"
}

@inproceedings{grz-edcaa-90
, author =	"T. Gonzalez and M. Razzazi and S.-Q. Zheng"
, title =	"An efficient divide-and-conquer approximation algorithm for hyperrectangular partitions"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"214--217"
, succeeds =	"grz-edcaa-89"
, precedes =	"gz-edcap-93"
, cites =	"dc-fhmel-86, dps-melgr-86, grsz-odgpa-89, gz-bprp-85, gz-aaprp-85, gz-ibrgp-89, k-ubsir-80, l-hmelr-83, lprs-melpr-82, l-mltfr-85, l-fhmlr-86, r-ppis-82, ZZZ"
, update =	"98.07 bibrelex"
}

@article{gz-edcap-93
, author =	"T. Gonzalez and S.-Q. Zheng"
, title =	"An efficient divide and conquer approximation algorithm for partitionning into {D}-boxes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"417--428"
, succeeds =	"grz-edcaa-89, grz-edcaa-90"
, update =	"98.07 bibrelex, 96.09 devillers"
}

@article{gz-aapri-90
, author =	"T. Gonzalez and S.-Q. Zheng"
, title =	"Approximation algorithms for partitioning a rectangle with interior points"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"11--42"
, succeeds =	"gz-bprp-85"
}

@techreport{gz-aaprp-85
, author =	"T. Gonzalez and S.-Q. Zheng"
, title =	"Approximation Algorithms for Partitioning Rectilinear Polygons"
, type =	"Technical {Report}"
, institution =	"Univ. California"
, address =	"Santa Barbara, CA"
, month =	mar
, year =	1985
, update =	"97.11 bibrelex"
}

@inproceedings{gz-bprp-85
, author =	"T. Gonzalez and S.-Q. Zheng"
, title =	"Bounds for partitioning rectilinear polygons"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"281--287"
, precedes =	"gz-aapri-90"
, cites =	"ahu-daca-74, at-eadps-81, cd-dpicp-79, gjpt-tsp-78, gz-aaprp-85, lllmp-tddo2-79, llmp-tddo1-79, lprs-melpr-82, r-ppis-82, s-oadrp-82, ZZZ"
, update =	"97.11 bibrelex"
}

@article{gz-ibrgp-89
, author =	"T. Gonzalez and S.-Q. Zheng"
, title =	"Improved Bounds for Rectangular and Guillotine Partitions"
, journal =	"J. Symbolic Comput."
, volume =	7
, year =	1989
, pages =	"591--610"
, update =	"95.01 mitchell"
}

@inproceedings{g-olddd-92
, author =	"Teofilo F. Gonzalez"
, title =	"The On-Line $d$-Dimensional Dictionary Problem"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"376--385"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@article{gg-tpgnt-85
, author =	"V. Ramirez Gonzalez and M. L. Marquez Garcia"
, title =	"Triangulation in the plane with given nodes. Triangulacion en el plano con nodos arbitrarios. Triangulation in der Ebene mit vorgegebenen Knoten"
, journal =	"Epsilon"
, volume =	5
, month =	sep
, year =	1985
, pages =	"57--64"
, abstract =	"An algorithm for triangulation in the plane with given
		 nodes is presented, as well as a program in BASIC and a
		 calculated example. Es wird ein Algorithmus entwickelt,
		 der bei gegebenen Punkten in der Ebene eine Zerlegung
		 des Polygons in Dreiecke berechnet. Ein Programm in
		 BASIC und ein Beispiel sind beigegeben."
}

@inproceedings{gl-spbce-94
, author =	"Laureano Gonz{\'a}lez-Vega and Henri Lombardi"
, title =	"Splines and {Pierce-Birkhoff} Conjecture: The Evaluation of Continuous and Piecewise Polynomial Functions"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"49--52"
, update =	"00.11 smid, 00.07 icking"
}

@book{gps-emg-93
, author =	"M. F. Goodchild and B. O. Parks and L. T. Steyaert"
, title =	"Environmental Modeling with GIS"
, publisher =	"Oxford University Press"
, address =	"New York"
, year =	1993
, update =	"98.03 agarwal"
}

@article{g-he-83
, author =	"P. R. Goodey"
, title =	"Homothetic Ellipsoids"
, journal =	"Math. Proc. Camb. Phil. Soc."
, volume =	93
, year =	1983
, pages =	"25--34"
, update =	"99.03 bibrelex"
}

@article{g-lcpcn-81
, author =	"J. E. Goodman"
, title =	"On the largest convex polygon contained in a non-convex $n$-gon or how to peel a potato"
, journal =	"Geom. Dedicata"
, volume =	11
, year =	1981
, pages =	"99--106"
}

@article{g-pcbgs-80
, author =	"J. E. Goodman"
, title =	"Proof of a conjecture of {Burr}, {Gr{\"u}nbaum} and {Sloane}"
, journal =	"Discrete Math."
, volume =	32
, year =	1980
, pages =	"27--35"
, update =	"97.11 bibrelex"
}

@incollection{g-pa-97
, author =	"J. E. Goodman"
, title =	"Pseudoline arrangements"
, chapter =	5
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"83--110"
, update =	"97.11 orourke"
}

@inproceedings{g-cots-89
, author =	"J. E. Goodman"
, title =	"The complexity of order types: a survey"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	1
}

@book{go-chdcg-97
, title =	"Handbook of Discrete and Computational Geometry"
, editor =	"J. E. Goodman and J. O'Rourke"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, comments =	"52 chapters, xiv + 991 pages;
                published July 1997"
, update =	"97.11 icking+orourke, 97.07 orourke, 97.03 orourke+tamassia"
}

@article{gp-cdpb-88
, author =	"J. E. Goodman and J. Pach"
, title =	"Cell decomposition of polytopes by bending"
, journal =	"Israel J. Math."
, volume =	64
, number =	2
, year =	1988
, pages =	"129--138"
, update =	"98.11 bibrelex, 96.09 orourke"
}

@article{gpy-mclmr-89
, author =	"J. E. Goodman and J. Pach and C. K. Yap"
, title =	"Mountain climbing, ladder moving, and the ring width of a polygon"
, journal =	"Amer. Math. Monthly"
, volume =	96
, year =	1989
, pages =	"494--510"
}

@article{gp-tod-82
, author =	"J. E. Goodman and R. Pollack"
, title =	"A theorem of ordered duality"
, journal =	"Geom. Dedicata"
, volume =	12
, year =	1982
, pages =	"63--74"
}

@incollection{gp-asotd-93
, author =	"J. E. Goodman and R. Pollack"
, title =	"Allowable Sequences and Order Types in Discrete and Computational Geometry"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"103--134"
, keywords =	"survey paper, allowable sequences, order types, pseudolines, stretchability, geometric sorting, isotopy conjecture, lattice realization"
, update =	"93.09 erickson"
}

@article{gp-ftcagm-95
, author =	"Jacob E. Goodman and Richard Pollack"
, title =	"Foundations of a Theory of Convexity on Affine {G}rassmann Manifolds"
, journal =	"Mathematika"
, volume =	42
, year =	1995
, pages =	"305--328"
, update =	"01.07 wenger"
}

@book{gp-gs-82
, author =	"J. E. Goodman and R. Pollack"
, title =	"Geometric Sorting"
, series =	"Annals of Discrete Geometry and Convexity"
, publisher =	"New York Academie of Sciences"
, year =	1982
, update =	"97.11 bibrelex"
}

@techreport{gp-htthd-86
, author =	"J. E. Goodman and R. Pollack"
, title =	"Hadwiger's Transversal Theorem in Higher Dimensions"
, type =	"Manuscript"
, institution =	"??"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{gp-htthd-88
, author =	"J. E. Goodman and R. Pollack"
, title =	"{Hadwiger}'s transversal theorem in higher dimensions"
, journal =	"J. Amer. Math. Soc."
, volume =	1
, year =	1988
, pages =	"301--309"
, update =	"97.11 bibrelex"
}

@article{gp-httpa-82
, author =	"J. E. Goodman and R. Pollack"
, title =	"Helly-type theorems for pseudoline arrangements in {$P^{2}$}"
, journal =	"J. Combin. Theory Ser. A"
, volume =	32
, year =	1982
, pages =	"1--19"
, update =	"97.11 bibrelex"
}

@inproceedings{gp-mpc-85
, author =	"J. E. Goodman and R. Pollack"
, title =	"Modelling planar configurations"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"121--124"
, cites =	"ag-nssfs-86, bp-ddnpp-79, c-sutds-82, c-ddnpp-83, eos-calha-83, ew-nlsfs-85, gp-ccncp-82, gp-httpa-82, gp-nkssn-84, gp-ms-83, gp-ubcpr-86, g-as-72, s-nrdec-84, u-2nnpd-82, ZZZ"
, update =	"97.11 bibrelex"
}

@article{gp-ms-83
, author =	"J. E. Goodman and R. Pollack"
, title =	"Multidimensional sorting"
, journal =	"SIAM J. Comput."
, volume =	12
, number =	3
, month =	aug
, year =	1983
, pages =	"484--507"
, update =	"98.11 bibrelex"
}

@article{gp-ccncp-80
, author =	"J. E. Goodman and R. Pollack"
, title =	"On the combinatorial classification of nondegenerate configurations in the plane"
, journal =	"J. Combin. Theory Ser. A"
, volume =	29
, year =	1980
, pages =	"220--235"
, update =	"97.11 bibrelex"
}

@article{gp-ccncp-82
, author =	"J. E. Goodman and R. Pollack"
, title =	"On the combinatorial classification of nondegenerate configurations in the plane"
, journal =	"J. Combin. Theory Ser. A"
, volume =	29
, year =	1982
, pages =	"63--74"
, update =	"97.11 bibrelex"
}

@article{gp-nkssn-84
, author =	"J. E. Goodman and R. Pollack"
, title =	"On the number of $k$-subsets of a set of $n$ points in the plane"
, journal =	"J. Combin. Theory Ser. A"
, volume =	36
, year =	1984
, pages =	"101--104"
, update =	"94.09 bernal"
}

@article{gp-prpa-85
, author =	"J. E. Goodman and R. Pollack"
, title =	"Polynomial realization of pseudoline arrangements"
, journal =	"Commun. Pure Appl. Math."
, volume =	38
, year =	1985
, pages =	"725--732"
, update =	"97.11 bibrelex"
}

@article{gp-pgcsc-80
, author =	"J. E. Goodman and R. Pollack"
, title =	"Proof of {Gr{\"u}nbaum}'s conjecture on the stretchability of certain arrangements of pseudolines"
, journal =	"J. Combin. Theory Ser. A"
, volume =	29
, year =	1980
, pages =	"385--390"
, update =	"97.11 bibrelex"
}

@article{gp-sccca-84
, author =	"J. E. Goodman and R. Pollack"
, title =	"Semispaces of Configurations, Cell Complexes of Arrangements"
, journal =	"J. Combin. Theory Ser. A"
, volume =	37
, year =	1984
, pages =	"257--293"
, update =	"96.05 orourke"
}

@article{gp-taafp-86
, author =	"J. E. Goodman and R. Pollack"
, title =	"There are asymptotically fewer polytopes than we thought"
, journal =	"Bull. Amer. Math. Soc."
, volume =	14
, year =	1986
, pages =	"127--129"
, update =	"97.11 bibrelex"
}

@article{gp-tpdnd-81
, author =	"J. E. Goodman and R. Pollack"
, title =	"Three points do not determine a (pseudo-) plane"
, journal =	"J. Combin. Theory Ser. A"
, volume =	31
, year =	1981
, pages =	"215--218"
, update =	"01.07 wenger, 98.03 bibrelex"
}

@article{gp-ubcpr-86
, author =	"J. E. Goodman and R. Pollack"
, title =	"Upper bounds for configurations and polytopes in {$\Re^d$}"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"219--227"
}

@book{gps-dcgpdsy-91
, title =	"Discrete and Computational Geometry: Papers from the Dimacs Special Year"
, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, publisher =	"American Mathematical Society, Association for Computing Machinery"
, year =	1991
, update =	"99.11 bibrelex, 96.05 pocchiola"
}

@inproceedings{gps-crotr-89
, author =	"J. E. Goodman and R. Pollack and B. Sturmfels"
, title =	"Coordinate representation of order types requires exponential storage"
, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
, year =	1989
, pages =	"405--410"
, precedes =	"gps-iscir-90"
}

@article{gps-iscir-90
, author =	"J. E. Goodman and R. Pollack and B. Sturmfels"
, title =	"The intrinsic spread of a configuration in {$\Re^d$}"
, journal =	"J. Amer. Math. Soc."
, volume =	3
, year =	1990
, pages =	"639--651"
, succeeds =	"gps-crotr-89"
, update =	"97.03 rote"
}

@inproceedings{gpw-bngpi-94
, author =	"J. E. Goodman and R. Pollack and R. Wenger"
, title =	"Bounding the Number of Geometric Permutations Induced by $k$-Transversals"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"192--197"
, cites =	"bpr-ncdfp-95, bcr-gar-87, cgppsw-ccht-90, es-mnwsn-90, gp-ubcpr-86, gpw-gtt-93, kll-dwsdc-92, l-it-49, w-ubgpc-90, ZZZ"
, update =	"98.03 bibrelex, 95.09 wenger, 94.09 jones, 94.01 jones"
}

@article{gpw-bngpi-96
, author =	"Jacob E. Goodman and Richard Pollack and Rephael Wenger"
, title =	"Bounding the Number of Geometric Permutations Induced by $k$-Transversals"
, journal =	"J. Combin. Theory Ser. A"
, volume =	75
, year =	1996
, pages =	"187--197"
, update =	"01.07 wenger"
}

@techreport{gpw-gtt-91
, author =	"J. E. Goodman and R. Pollack and R. Wenger"
, title =	"Geometric Transversal Theory"
, type =	"Technical {Report}"
, number =	"91-76"
, institution =	"DIMACS, Rutgers Univ."
, year =	1991
, precedes =	"gpw-gtt-93"
, update =	"95.09 wenger, 93.09 milone+mitchell"
}

@incollection{gpw-gtt-93
, author =	"J. E. Goodman and R. Pollack and R. Wenger"
, title =	"Geometric Transversal Theory"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, Germany"
, year =	1993
, pages =	"163--198"
, keywords =	"survey paper, transversal, Helly's theorem, Hadwiger's theorem, combinatorial complexity, Davenport-Schinzel sequences"
, succeeds =	"gpw-gtt-91"
, update =	"95.09 wenger, 93.09 erickson"
}

@article{gpw-occsl-95
, author =	"J. E. Goodman and R. Pollack and R. Wenger"
, title =	"On the Connected Components of the Space of Line Transversals to a Family of Convex Sets"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"469--476"
, update =	"95.09 wenger"
}

@article{gpwz-atp-94
, author =	"J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
, title =	"Arrangements and Topological Planes"
, journal =	"Amer. Math. Monthly"
, volume =	101
, number =	10
, year =	1994
, pages =	"866--878"
, update =	"95.09 agarwal, 93.09 erickson"
}

@inproceedings{gpwz-eaes-91
, author =	"J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
, title =	"Every arrangement extends to a spread"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"191--194"
, cites =	"g-as-72, s-cm-51, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{gpwz-tiutp-92
, author =	"J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
, title =	"There is a universal topological plane"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"171--176"
, cites =	"eg-tsa-89, gp-pgcsc-80, gpwz-eaes-91, g-as-72, h-m-35, h-fggdg-71, l-dtdpe-26, sh-sac-91, ZZZ"
, update =	"97.11 bibrelex"
}

@book{g-ifo-68
, author =	"J. W. Goodman"
, title =	"Introduction to {Fourier} optics"
, publisher =	"McGraw-Hill"
, address =	"New York, NY"
, year =	1968
, update =	"97.11 bibrelex"
}

@article{gr-ssaip-88
, author =	"S. D. Goodman and W. T. Rhodes"
, title =	"Symbolic substituiton applications to image processing"
, journal =	"Applied Optics"
, volume =	27
, year =	1988
, pages =	"1708--1714"
, update =	"98.07 bibrelex"
}

@inproceedings{gght-srlse-97
, author =	"M. Goodrich and L. J. Guibas and J. Hershberger and P. Tanenbaum"
, title =	"Snap Rounding Line Segments Efficiently in Two and Three Dimensions"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"284--293"
, cites =	"am-rsss-94, abdpy-enmcs-95, bo-arcgi-79, b-carcg-81, c-rga-92, cms-frric-93, em-sstcd-90, f-nsa2d-95, fm-nsala-91, gy-frcg-86, gm-rad-95, gks-ricdv-92, gss-egbra-89, gs-pmgsc-85, h-psifp-93, hhk-tirgc-88, lpt-rpqiv-96, ms-temsi-92, m-dpggt-89, m-fppap-88, s-barga-93, si-gafpa-88, si-tdpga-89"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@book{gks-cg-99
, title =	"Computational Geometry"
, editor =	"Michael Goodrich and Rolf Klein and Raimund Seidel"
, series =	"Dagstuhl-Seminar-Report"
, volume =	233
, publisher =	"Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
, address =	"Schloss Dagstuhl, Germany"
, year =	1999
, url =	"ftp://ftp.dagstuhl.de/pub/Reports/99/99102.ps.gz"
, update =	"01.04 icking"
}

@inproceedings{gt-dtdpl-91
, author =	"M. Goodrich and R. Tamassia"
, title =	"Dynamic trees and dynamic point location"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"523--533"
, keywords =	"point location, on-line"
}

@article{agk-paess-94
, author =	"M. J. Atallah Michael T. Goodrich and S .R. Kosaraju"
, title =	"Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations"
, journal =	"J. ACM"
, volume =	41
, number =	6
, year =	1994
, pages =	"1049--1088"
, update =	"97.03 tamassia"
}

@article{g-pahlh-92
, author =	"M. T. Goodrich"
, title =	"A Polygonal Approach to Hidden-Line and Hidden-Surface Elimination"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	54
, number =	1
, year =	1992
, pages =	"1--12"
, update =	"94.01 goodrich"
}

@techreport{g-pahle-87
, author =	"M. T. Goodrich"
, title =	"A polygonal approach to hidden-line elimination"
, type =	"Report"
, number =	"TR 87-18"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1987
}

@inproceedings{g-pahle-87i
, author =	"M. T. Goodrich"
, title =	"A polygonal approach to hidden line elimination"
, booktitle =	"Proc. 25th Allerton Conf. Commun. Control Comput."
, year =	1987
, pages =	"849--858"
, update =	"97.11 bibrelex"
}

@article{g-airsm-98
, author =	"M. T. Goodrich"
, title =	"An improved ray shooting method for constructive solid geometry models via tree contraction"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1998
, pages =	"1--24"
, update =	"98.11 devillers, 97.03 tamassia"
}

@techreport{g-opaan-85
, author =	"M. T. Goodrich"
, title =	"An Optimal Parallel Algorithm for the All Nearest-neighbor Problem for a Convex Polygon"
, number =	"CSD-TR-533"
, institution =	"Dept. Computer Science, Purdue University"
, address =	"USA"
, year =	1985
, update =	"93.09 held"
}

@inproceedings{g-apptc-90
, author =	"M. T. Goodrich"
, title =	"Applying parallel processing techniques to classification problems in constructive solid geometry"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"118--128"
}

@techreport{g-ceps-95
, author =	"M. T. Goodrich"
, title =	"Communication-Efficient Parallel Sorting"
, type =	"Technical {Report}"
, institution =	"Dept. of Computer Science, Johns Hopkins Univeristy"
, year =	1995
, update =	"96.09 orourke"
}

@techreport{g-ceps-97
, author =	"M. T. Goodrich"
, title =	"Communication-efficient parallel sorting"
, type =	"Research {Report}, under submission to {\it SICOMP}"
, institution =	"Center for Geometric Computing"
, address =	"Johns Hopkins Univ."
, year =	1997
, update =	"97.03 tamassia"
}

@inproceedings{g-caop-91
, author =	"M. T. Goodrich"
, title =	"Constructing arrangements optimally in parallel"
, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
, year =	1991
, pages =	"169--179"
}

@article{g-caop-93
, author =	"M. T. Goodrich"
, title =	"Constructing arrangements optimally in parallel"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"371--385"
, succeeds =	"g-caop-91"
, update =	"94.01 goodrich"
}

@techreport{g-cchps-91
, author =	"M. T. Goodrich"
, title =	"Constructing the convex hull of a partially sorted set of points"
, type =	"Technical {Report}"
, number =	"91-10"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1991
}

@article{g-cchps-93
, author =	"M. T. Goodrich"
, title =	"Constructing the Convex Hull of a Partially Sorted Set of Points"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	5
, month =	mar
, year =	1993
, pages =	"267--278"
, update =	"93.09 held"
}

@phdthesis{g-eptcg-87
, author =	"M. T. Goodrich"
, title =	"Efficient parallel techniques for computational geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1987
, keywords =	"parallel computation, convex hull, triangulation, domination, visibility, diameter, proximity, intersection, fractional cascading, doctoral thesis"
}

@inproceedings{g-eplfa-94
, author =	"M. T. Goodrich"
, title =	"Efficient Piecewise-Linear Function Approximation Using the Uniform Metric"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"322--331"
, cites =	"aaakss-cefns-91, aass-sdp-90, am-rsps-92, ast-apsgo-92, abosy-fmcnp-85, ams-olpqs-92, a-gvdps-89, br-cfssl-69, br-matmm-86, cegghss-rspug-91, cegs-dwclp-92, c-lpot-86, c-sdsno-87, c-pms-88, csss-otass-89, cb-enaaa-80, clr-ia-90, d-ia-63, d-csfs-93, d-ltatt-84, e-acg-87, eg-paspp-88, g-cvpcs-91, gm-paaml-92, gt-drssp-93, gh-ospqs-87, gh-ospqs-89, ghlst-ltavs-87, ghms-apsml-91, hs-fpfsp-91, h-ndssp-91, hs-cmlpg-91, ii-cgmpa-86, ii-oaapl-86a, ii-pacfa-88, j-adsfk-78, k-ealdp-89, lp-esppr-84, lpsssstwy-clcsp-88, msw-sblp-92, m-apcad-83, m-ltalp-83, m-lpltw-84, mo-pca-88, m-aaspt-88, mmp-dgp-87, mpa-csklp-92, mrw-mlpop-90, ms-saps-92, o-agta-87, ps-cgi-85, rt-laso-92, s-sdlpc-91, s-ltaml-86, s-mlppr-87, s-cgfns-89, t-capcp-85, whcl-psapa-93, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@article{g-eplfa-95
, author =	"M. T. Goodrich"
, title =	"Efficient Piecewise-Linear Function Approximation Using the Uniform Metric"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"445--462"
, succeeds =	"g-eplfa-94"
, update =	"96.01 smid"
}

@article{g-fchsp-87
, author =	"M. T. Goodrich"
, title =	"Finding the convex hull of a sorted point set in parallel"
, journal =	"Inform. Process. Lett."
, volume =	26
, year =	1987
, pages =	"176--179"
, keywords =	"parallel computation, convex hull, points, divide-and-conquer, two-dimensional"
}

@inproceedings{g-fdplp-96
, author =	"Michael T. Goodrich"
, title =	"Fixed-dimensional parallel linear programming via relative epsilon-approximations"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"132--141"
, keywords =	"CRCW, PRAM, derandomization, {$\epsilon$}-approximation, geometric random samples, independence"
, update =	"97.03 smid, 96.09 agarwal, 96.01 mitchell"
}

@inproceedings{g-gpmee-93
, author =	"M. T. Goodrich"
, title =	"Geometric partitioning made easier, even in parallel"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"73--82"
, cites =	"a-gpia-91t, aass-sdp-90, ast-apsgo-92, as-pm-92, ap-p3dch-92, av-fpahc-79, brs-enasc-89, c-ochan-91, cf-dvrsi-90, cm-dosch-95, cm-ltdao-93, cegs-dwclp-92, c-maeth-52, c-racpq-88, cs-arscg-89, c-sdsno-87, c-pms-88, cg-opapp-92, csss-otass-89, csy-khrp-87, cz-opabd-90, clr-ia-90, dk-pcsh-89, dd-ekdnp-91, dc-hcpc-80, e-acg-87, g-caop-93, hr-gtcb-90, hw-ensrq-87, j-ipa-92, kr-pasmm-90, l-spami-86, l-rrpcw-88, m-cha-91, m-aogdc-91, m-ept-92, mww-deabv-91, m-apcad-83, mnn-pmydp-89, rs-oprat-92, r-tclir-90, sss-chbal-93, s-dfs-72, vc-ucrfe-71, y-ptptc-88, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
}

@inproceedings{g-ilspo-89
, author =	"M. T. Goodrich"
, title =	"Intersectin line segments in parallel with an output sensitive number of processors"
, booktitle =	"Proc. 1st ACM Sympos. Parallel Algorithms Architect."
, year =	1989
, pages =	"127--137"
, update =	"97.11 bibrelex"
}

@article{g-ilspo-91
, author =	"M. T. Goodrich"
, title =	"Intersecting line segments in parallel with an output-sensitive number of processors"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"737--755"
}

@incollection{g-pag-97
, author =	"M. T. Goodrich"
, title =	"Parallel algorithms in geometry"
, chapter =	36
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"669--682"
, update =	"97.11 orourke"
}

@inproceedings{g-psppt-92
, author =	"M. T. Goodrich"
, title =	"Planar separators and parallel polygon triangulation"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"507--516"
}

@article{g-psppt-95
, author =	"M. T. Goodrich"
, title =	"Planar separators and parallel polygon triangulation"
, journal =	"J. Comput. Syst. Sci."
, volume =	51
, number =	3
, year =	1995
, pages =	"374--389"
, update =	"97.11 bibrelex, 97.03 tamassia"
}

@inproceedings{g-rfsbt-97
, author =	"M. T. Goodrich"
, title =	"Randomized fully-scalable {BSP} techniques for multi-searching and convex hull construction"
, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"767--776"
, update =	"97.03 tamassia"
}

@techreport{g-tpp-87
, author =	"M. T. Goodrich"
, title =	"Triangulating a polygon in parallel"
, type =	"Report"
, number =	"TR-679"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1987
, precedes =	"g-tpp-89"
}

@article{g-tpp-89
, author =	"M. T. Goodrich"
, title =	"Triangulating a polygon in parallel"
, journal =	"J. Algorithms"
, volume =	10
, year =	1989
, pages =	"327--351"
, keywords =	"parallel computation, triangulation, polygons, simple, divide-and-conquer, two-dimensional"
, succeeds =	"g-tpp-87"
}

@inproceedings{g-uaadp-91
, author =	"M. T. Goodrich"
, title =	"Using approximation algorithms to design parallel algorithms that may ignore processor allocation"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"711--722"
}

@inproceedings{gao-isost-90
, author =	"M. T. Goodrich and M. J. Atallah and M. H. Overmars"
, title =	"An input-size/output-size trade-off in the time complexity of rectilinear hidden-surface removal"
, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	443
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"689--702"
, update =	"98.07 agarwal"
}

@techreport{gao-osmrh-90
, author =	"M. T. Goodrich and M. J. Atallah and M. H. Overmars"
, title =	"Output-Sensitive Methods for Rectilinear Hidden Surface Removal"
, type =	"Technical {Report}"
, number =	"90-13"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{gao-osmrh-93
, author =	"M. T. Goodrich and M. J. Atallah and M. H. Overmars"
, title =	"Output-Sensitive Methods for Rectilinear Hidden Surface Removal"
, journal =	"Inform. Comput."
, volume =	107
, year =	1993
, pages =	"1--24"
, update =	"94.01 smid"
}

@inproceedings{ggb-gsmpc-90
, author =	"M. T. Goodrich and M. Ghouse and J. Bright"
, title =	"Generalized sweep methods for parallel computational geometry"
, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"280--289"
}

@article{ggb-smpcg-
, author =	"M. T. Goodrich and M. Ghouse and J. Bright"
, title =	"Sweep Methods for Parallel Computational Geometry"
, journal =	"Algorithmica"
, note =	"To appear"
, update =	"97.03 tamassia"
}

@inproceedings{ghht-apids-98
, author =	"M. T. Goodrich and M. Handy and B. Hudson and R. Tamassia"
, title =	"Abstracting Positional Information in Data Structures: Locators and Positions in {JDSL}"
, booktitle =	"OOPSLA '98 Technical Notes"
, year =	1998
, update =	"98.11 tamassia"
}

@inproceedings{ghht-aiods-99
, author =	"M. T. Goodrich and M. Handy and B. Hudson and R. Tamassia"
, title =	"Accessing the Internal Organization of Data Structures in the {JDSL} Library"
, editor =	"M. T. Goodrich and C. C. McGeoch"
, booktitle =	"Proc. Workshop on Algorithm Engineering and Experimentation"
, nickname =	"ALENEX '99"
, series =	"Lecture Notes Comput. Sci."
, volume =	1619
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"124--139"
, update =	"00.03 vismara, 99.07 vismara, 98.11 tamassia"
}

@inproceedings{gk-sppma-89
, author =	"M. T. Goodrich and S. R. Kosaraju"
, title =	"Sorting on a parallel pointer machine with applications to set expression evaluation"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"190--196"
, update =	"97.03 tamassia"
}

@article{gk-sppma-
, author =	"M. T. Goodrich and S. R. Kosaraju"
, title =	"Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation"
, journal =	"J. ACM"
, volume =	"??"
, year =	"to appear"
, pages =	""
, update =	"96.09 orourke"
}

@inproceedings{gmv-appci-93
, author =	"Michael T. Goodrich and Yossi Matias and Uzi Vishkin"
, title =	"Approximate Parallel Prefix Computation and Its Applications"
, booktitle =	"??"
, publisher =	"IEEE Computer Society"
, year =	1993
, pages =	"318--325"
, update =	"94.01 jones, 93.09 milone+mitchell"
}

@inproceedings{gmv-opaps-94
, author =	"M. T. Goodrich and Y. Matias and U. Vishkin"
, title =	"Optimal Parallel Approximation for Prefix Sums and Integer Sorting"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"241--250"
, update =	"96.09 orourke"
}

@techreport{gmos-dtcfd-95
, author =	"M. T. Goodrich and V. Mirelli and M. Orletsky and J. Salowe"
, title =	"Decision tree construction in fixed dimensions: being global is hard but local greed is good"
, type =	"Technical {Report}"
, institution =	"Dept. Computer Sci., Johns Hopkins Univ."
, year =	1995
, update =	"95.05 agarwal"
}

@article{gmo-pmagp-??
, author =	"M. T. Goodrich and Joseph S. B. Mitchell and M. W. Orletsky"
, title =	"Practical Methods for Approximate Geometric Pattern Matching under Rigid Motion"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"??"
, number =	"??"
, year =	"??"
, pages =	"to appear"
, succeeds =	"gmo-pmagp-94"
, update =	"98.03 mitchell"
}

@inproceedings{gmo-pmagp-94
, author =	"M. T. Goodrich and Joseph S. B. Mitchell and M. W. Orletsky"
, title =	"Practical Methods for Approximate Geometric Pattern Matching under Rigid Motion"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"103--112"
, precedes =	"gmo-pmagp-??"
, cites =	"aass-sdp-90, abb-amps-91, amww-cssgo-88, akmsw-mppdn-92, amnsw-oaann-94, cghkkk-gpmem-93, ck-igpmp-92, c-sdsno-84, c-pms-88, csss-otass-89, clr-ia-90, e-acg-87, fd-ficg-82, gj-cigtn-79, gt-dtdpl-91, h-gaaps-93, hs-adaps-92, hk-cmhdp-90, hkk-dvdmh-92i, hks-uevsi-91, isi-mgftc-89, m-apcad-83, m-mdscg-84, ps-cgi-85, r-cmhdb-91, r-lbchd-93, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
}

@inproceedings{goy-cvdsl-89
, author =	"M. T. Goodrich and C. {\'O}'D{\'u}nlaing and C. Yap"
, title =	"Constructing the {Voronoi} diagram of a set of line segments in parallel"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"12--23"
}

@article{goy-cvdsl-93
, author =	"M. T. Goodrich and C. {\'O}'D{\'u}nlaing and C. Yap"
, title =	"Constructing the {Voronoi} Diagram of a Set of Line Segments in Parallel"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"128--141"
, succeeds =	"goy-cvdsl-89"
, update =	"97.11 bibrelex, 94.01 goodrich"
}

@techreport{goy-fpavd-85
, author =	"M. T. Goodrich and C. {\'O}'Dunlaing and C. K. Yap"
, title =	"Fast Parallel Algorithms for {Voronoi} Diagrams"
, number =	"CSD-TR-538"
, institution =	"Dept. Computer Science, Purdue University"
, address =	"USA"
, year =	1985
, update =	"00.03 bibrelex, 93.09 held"
}

@inproceedings{gor-mafqt-97
, author =	"M. T. Goodrich and M. Orletsky and K. Ramaiyer"
, title =	"Methods for Achieving Fast Query Times in Point Location Data Structures"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"757--766"
, update =	"97.03 held+tamassia"
}

@incollection{gr-gds-00
, author =	"Michael T. Goodrich and Kumar Ramaiyer"
, title =	"Geometric Data Structures"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"463--489"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 tamassia, 98.07 mitchell"
, annote =	"Chapter 10 of su-hcg-00"
}

@article{gr-bidgp-97
, author =	"M. T. Goodrich and E. A. Ramos"
, title =	"Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"397--420"
, update =	"98.07 agarwal, 97.03 tamassia"
}

@article{gsg-apmvs-93
, author =	"M. T. Goodrich and S. Shauck and S. Guha"
, title =	"Addendum to ``Parallel methods for visibility and shortest path problems in simple polygons''"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"515--516"
, succeeds =	"gsg-pmvsp-90"
, update =	"94.01 goodrich"
}

@article{gsg-pmvsp-92
, author =	"M. T. Goodrich and S. Shauck and S. Guha"
, title =	"Parallel methods for visibility and shortest path problems in simple polygons"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"461--486"
, succeeds =	"gsg-pmvsp-90"
, update =	"94.01 goodrich"
}

@techreport{gsg-pmvsp-89
, author =	"M. T. Goodrich and S. B. Shauck and S. Guha"
, title =	"Parallel methods for visibility and shortest path problems in simple polygons"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Johns Hopkins University"
, address =	"Baltimore, MD"
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{gsg-pmvsp-90
, author =	"M. T. Goodrich and S. B. Shauck and S. Guha"
, title =	"Parallel methods for visibility and shortest path problems in simple polygons"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"73--82"
, cites =	"ap-psmma-89, am-dplr-88, ac-opavs-89, acg-cdctd-89, at-oadvp-81, bn-absop-89, c-tpca-82, c-iies-84, c-ept-90, cg-fc1ds-86, cg-vippg-88, e-acg-87, emprww-sls-82, ea-lacvp-81, eg-paspp-88, gjpt-tsp-78, g-tpp-89, g-ilspo-89, gh-ospqs-89, ghlst-ltavs-86, grs-kfcg-83, h-ovgat-89, krs-ppp-85, lf-ppc-80, lp-esppr-84, mp-fitcp-78, ol-mcp-81, ps-cgi-85, r-plsir-89, s-opg-87, s-cgfns-89, tv-opatc-89, tv-otats-86, y-ptptc-87, ZZZ"
, update =	"01.04 icking, 97.11 bibrelex"
}

@article{gs-spscp-90
, author =	"M. T. Goodrich and J. Snoeyink"
, title =	"Stabbing parallel segments with a convex polygon"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	49
, year =	1990
, pages =	"152--170"
, succeeds =	"gs-spscp-89"
}

@techreport{gs-svscp-87
, author =	"M. T. Goodrich and J. Snoeyink"
, title =	"Stabbing vertical segments with a convex polygon"
, type =	"Report"
, number =	"JHU 87-19"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1987
, precedes =	"gs-spscp-89"
}

@inproceedings{gs-spscp-89
, author =	"M. T. Goodrich and J. S. Snoeyink"
, title =	"Stabbing parallel segments with a convex polygon"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"231--242"
, succeeds =	"gs-svscp-87"
, precedes =	"gs-spscp-90"
}

@book{gt-dsaj-98
, author =	"Michael T. Goodrich and Roberto Tamassia"
, title =	"Data Structures and Algorithms in Java"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1998
, update =	"99.11 bibrelex, 98.11 tamassia"
}

@book{gt-dsaj-01
, author =	"M. T. Goodrich and R. Tamassia"
, title =	"Data Structures and Algorithms in {J}ava"
, edition =	"2nd"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	2001
, update =	"01.04 vismara"
}

@article{gt-drssp-97
, author =	"M. T. Goodrich and R. Tamassia"
, title =	"Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations"
, journal =	"J. Algorithms"
, volume =	23
, year =	1997
, pages =	"51--73"
, update =	"97.07 smid"
}

@inproceedings{gt-drssp-93
, author =	"M. T. Goodrich and R. Tamassia"
, title =	"Dynamic ray shooting and shortest paths via balanced geodesic triangulations"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"318--327"
, cites =	"as-anps-91, cegghss-rspug-91, cg-vippg-89, cpt-uadpl-93, cj-nrdpl-90, cj-sersi-91, clr-ia-90, eittwy-mmsfd-90, fmn-dgds-85, ggb-gsmpc-90, gt-dtdpl-91, gh-ospqs-89, ghlst-ltavs-86, gs-dfbt-78, h-opats-92, hs-parss-93, l-cspc-72, lp-esppr-84, m-pst-85, m-ss-84, o-ddds-83, ps-cgi-85, st-dsdt-83, stt-rdthg-88, t-dsna-83,  wl-arrcd-85, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{gt-dtdpl-98
, author =	"M. T. Goodrich and R. Tamassia"
, title =	"Dynamic trees and dynamic point location"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1998
, pages =	"612--636"
, update =	"99.07 smid, 98.11 tamassia, 97.03 tamassia"
}

@inproceedings{gt-taavp-98
, author =	"M. T. Goodrich and R. Tamassia"
, title =	"Teaching the Analysis of Algorithms with Visual Proofs"
, booktitle =	"Proc. ACM Symp. Computer Science Education"
, year =	1998
, update =	"98.11 tamassia"
}

@inproceedings{gtvv-emcg-93
, author =	"Michael T. Goodrich and Jyh-Jong Tsay and Darren E. Vengroff and Jeffrey Scott Vitter"
, title =	"External-Memory Computational Geometry"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"714--723"
, update =	"98.07 bibrelex, 97.03 agarwal, 95.01 franciosa, 94.01 smid, 93.09 milone+mitchell+vengroff"
}

@article{g-sp-92
, author =	"P. Goossens"
, title =	"Shelling pseudopolyhedra"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"207--215"
}

@inproceedings{gks-srbld-00
, author =	"M. Gopi and S. Krishnan and C. T. Silva"
, title =	"Surface reconstruction based on lower dimensional localized {Delaunay} triangulation"
, booktitle =	"Eurographics"
, year =	2000
, pages =	""
, update =	"01.07 devillers"
}

@article{gh-3drpr-74
, author =	"R. Gordon and G. T. Herman"
, title =	"$3$-d reconstruction from projections: a review of algorithms"
, journal =	"Internat. Review Cytology"
, volume =	38
, year =	1974
, pages =	"111--151"
}

@incollection{gr-bscs-74
, author =	"W. J. Gordon and R. F. Riesenfeld"
, title =	"{B}-Spline Curves and Surfaces"
, editor =	"F. Barnhill and R. Riesenfeld"
, booktitle =	"Comput. Aided Geom. Design"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1974
, pages =	"95--120"
, update =	"98.03 bibrelex"
}

@book{gm-smt-87
, author =	"M. Goresky and R. MacPherson"
, title =	"Stratified {Morse} theory"
, publisher =	"Springer-Verlag"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{g-spcsp-90
, author =	"P. K. Gosh"
, title =	"A Solution of Polygon Containment Spatial Planning and Other Related Problems Using {Minkowski} Operators"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	49
, year =	1990
, pages =	"1--35"
, update =	"93.09 held"
}

@phdthesis{g-ac-83
, author =	"J. Gosling"
, title =	"Algebraic constraints"
, school =	"Dept. Comput. Sci., Carnegie Mellon Univ."
, address =	"Pittsburgh, PA"
, month =	may
, year =	1983
, note =	"Technical Report CMU-CS-83-132"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@book{gy-japi-96
, author =	"J. Gosling and F. Yellin and {The J}ava Team"
, title =	"The {J}ava Application Programming Interface: Window Toolkit and Applets"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1996
, update =	"98.07 tamassia"
}

@article{gsf-oocuf-99
, author =	"C. Gotsman and O. Sudarsky and J. A. Fayman"
, title =	"Optimized Occlusion Culling Using Five-Dimensional Subdivision"
, journal =	"Comput. \& Graphics"
, volume =	23
, number =	5
, month =	oct
, year =	1999
, pages =	"645--654"
, update =	"00.03 held"
}

@article{gw-ratpc-93
, author =	"C. Gotsman and M. Werman"
, title =	"Recognition of Affine Transformed Planar Curves by Extremal Geometric Properties"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, year =	1993
, pages =	"183--202"
, update =	"96.01 werman"
}

@article{glm-othsr-96
, author =	"S. Gottschalk and M. C. Lin and D. Manocha"
, title =	"{OBB}-Tree: {A} Hierarchical Structure for Rapid Interference Detection"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1996
, pages =	"171--180"
, note =	"Proc. SIGGRAPH '96"
, keywords =	"collision detection"
, update =	"98.07 mitchell, 96.09 devillers, 96.05 klosowski"
}

@article{cg-prca-83
, author =	"K. D. Gourley and D. M. Green"
, title =	"A Polygon-to-Rectangle Conversion Algorithm"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	3
, year =	1983
, pages =	"31--36"
, update =	"98.03 bibrelex"
}

@article{gr-crsas-93
, author =	"L. Gournay and J.-J. Risler"
, title =	"Construction of roadmaps in semi-algebraic sets"
, journal =	"Appl. Algebra Engrg. Comm. Comput."
, volume =	4
, year =	1993
, pages =	"239--252"
, update =	"98.07 agarwal"
}

@article{g-hcppc-82
, author =	"D. Gouyou-Beauchamps"
, title =	"The {Hamiltonian} circuit problem is polynomial for 4-connected planar graphs"
, journal =	"SIAM J. Comput."
, volume =	11
, year =	1982
, pages =	"529--539"
, update =	"99.07 forrest, 98.11 bibrelex"
}

@mastersthesis{g-dpcg-80
, author =	"I. G. Gowda"
, title =	"Dynamic problems in computational geometry"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Comput. Sci., Univ. British Columbia"
, address =	"Vancouver, BC"
, year =	1980
, keywords =	"master thesis"
}

@inproceedings{gk-elmes-80
, author =	"I. G. Gowda and D. G. Kirkpatrick"
, title =	"Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures"
, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
, year =	1980
, pages =	"1--10"
, keywords =	"data structuring, dynamizing data structures, Voronoi diagrams, convex hull"
}

@article{gkln-dvd-83
, author =	"I. G. Gowda and D. G. Kirkpatrick and D. T. Lee and A. Naamad"
, title =	"Dynamic {Voronoi} diagrams"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-29"
, year =	1983
, pages =	"724--731"
, keywords =	"data structuring, dynamizing data structures, Voronoi diagrams"
}

@article{gk-cnnru-79
, author =	"K. C. Gowda and G. Krishna"
, title =	"The condensed nearest neighbor rule using the concept of mutual nearest neighborhood"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-25"
, year =	1979
, pages =	"488--490"
}

@techreport{gh-psaan-92
, author =	"T. Graf and K. Hinrichs"
, title =	"A plane sweep algorithm for the all nearest neighbors problem for a set of convex planar objects"
, type =	"Report"
, number =	"17/92-I"
, institution =	"Angew. Math. Inform., Univ. M{\"u}nster"
, address =	"M{\"u}nster, Germany"
, year =	1992
}

@inproceedings{gh-psaan-93
, author =	"Thorsten Graf and Klaus Hinrichs"
, title =	"A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"349--360"
, succeeds =	"gh-psaan-93p"
, update =	"97.11 icking, 96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
}

@inproceedings{gh-psaan-93p
, author =	"Thorsten Graf and Klaus Hinrichs"
, title =	"A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"74--77"
, precedes =	"gh-psaan-93"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
}

@techreport{gh-appcp-92
, author =	"T. Graf and K. Hinrichs"
, title =	"Algorithms for proximity problems on colored point sets"
, type =	"Report"
, number =	"18/92-I"
, institution =	"Angew. Math. Inform., Univ. M{\"u}nster"
, address =	"M{\"u}nster, Germany"
, year =	1992
, precedes =	"gh-appcp-93"
, update =	"98.11 bibrelex"
}

@inproceedings{gh-appcp-93
, author =	"T. Graf and K. Hinrichs"
, title =	"Algorithms for proximity problems on colored point sets"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"420--425"
, succeeds =	"gh-appcp-93p, gh-appcp-92"
, cites =	"aert-otbsp-92, hns-arsa2-92, lw-vdllm-80, m-pst-85, o-ncbbs-82, iko-pstsm-88, s-raplg-91, v-famst-84, y-cmstk-82, ZZZ"
, update =	"98.11 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@inproceedings{gh-appcp-93p
, author =	"Thorsten Graf and Klaus Hinrichs"
, title =	"Algorithms for proximity problems on colored point sets"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"78--81"
, precedes =	"gh-appcp-93"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@inproceedings{gh-daanf-94
, author =	"T. Graf and K. Hinrichs"
, title =	"Distribution algorithms for the all-nearest-foreign-neighbors problem in arbitrary {$L^t$} metrics"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"69--74"
, cites =	"aert-otbsp-92, gh-appcp-93, hns-arsa2-92, l-tdvdl-80, ow-ad-93, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{gh-ssnfn-94
, author =	"Thorsten Graf and Klaus Hinrichs"
, title =	"Simple Search for Nearest Foreign Neighbors in Arbitrary {$L^t$}-Metrics"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"25--28"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{gk-oacvn-98
, author =	"T. Graf and V. Kamakoti"
, title =	"An Optimal Algorithm for Computing Visible Nearest Foreign Neighbors Among Colored Line Segments"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"59--70"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

% see http://www.cs.auc.dk/icalp98/
@inproceedings{gk-mspop-98
, author =	"T. Graf and V. Kamakoti"
, title =	"Morphing Simple Polygons Optimally -- {A} Proof for an Improved Conjecture"
, booktitle =	"Proc. 25th Internat. Colloq. Automata Lang. Prog."
, nickname =	"ICALP '98"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"??"
, update =	"98.03 mitchell"
, annote =	"To appear, July 13-17 in Aalborg, Denmark"
}

@inproceedings{g-vscfa-81
, author =	"N. Graham"
, title =	"The visual system does a crude {Fourier} analysis of patterns"
, booktitle =	"SIAM-AMS Proc."
, volume =	13
, year =	1981
, pages =	"1--16"
, update =	"98.11 bibrelex"
}

@book{grs-rt-80
, author =	"R. Graham and B. Rothschild and J. Spencer"
, title =	"Ramsey Theory"
, publisher =	"Wiley-Interscience"
, address =	"New York"
, year =	1980
, update =	"95.05 agarwal"
}

@article{gy-wtcg-90
, author =	"R. Graham and F. Yao"
, title =	"A whirlwind tour of computational geometry"
, journal =	"Amer. Math. Monthly"
, volume =	97
, number =	8
, year =	1990
, pages =	"687--701"
, keywords =	"survey paper, Voronoi diagrams, convex hull"
}

@article{g-eadch-72
, author =	"R. L. Graham"
, title =	"An efficient algorithm for determining the convex hull of a finite planar set"
, journal =	"Inform. Process. Lett."
, volume =	1
, year =	1972
, pages =	"132--133"
, keywords =	"design of algorithms, convex hull, worst-case analysis"
, precedes =	"gs-ngcha-87"
, annote =	"$O(n \log n)$ time, polar sorting"
}

@incollection{g-ert-97
, author =	"R. L. Graham"
, title =	"Euclidean {Ramsey} theory"
, chapter =	8
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"153--166"
, update =	"97.11 orourke"
}

@article{g-p855e-85
, author =	"R. L. Graham"
, title =	"Problem 85-5/{EATCS}: {Euclidean} minimum spanning trees"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	285
}

@article{g-lsh-75
, author =	"R. L. Graham"
, title =	"The largest small hexagon"
, journal =	"J. Combin. Theory"
, volume =	18
, year =	1975
, pages =	"165--170"
, update =	"98.03 bibrelex"
}

@article{gh-hmstp-85
, author =	"R. L. Graham and P. Hell"
, title =	"On the history of the minimum spanning tree problem"
, journal =	"Annals of the History of Computing"
, volume =	7
, year =	1985
, pages =	"43--57"
, update =	"98.03 bibrelex"
}

@article{gh-rsmt-76
, author =	"R. L. Graham and F. K. Hwang"
, title =	"Remarks on {Steiner} minimum trees"
, journal =	"Bull. Inst. Math. acad. Sinica"
, volume =	4
, year =	1976
, pages =	"177--182"
, update =	"98.03 bibrelex"
}

@book{gkp-cm-89
, author =	"R. L. Graham and D. E. Knuth and O. Patashnik"
, title =	"Concrete Mathematics"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1989
, precedes =	"gkp-cm-94"
, update =	"00.03 bibrelex, 97.03 gaertner+salinger"
}

@book{gkp-cm-94
, author =	"Ronald L. Graham and Donald E. Knuth and Oren Patashnik"
, title =	"Concrete Mathematics"
, edition =	"second"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1994
, succeeds =	"gkp-cm-89"
, update =	"00.03 bibrelex"
}

@book{grs-rt-90
, author =	"R. L. Graham and B. L. Rothschild and J. Spencer"
, title =	"Ramsey Theory"
, publisher =	"John Wiley \& Sons"
, year =	1990
, update =	"99.11 bibrelex, 95.01 matousek"
}

@article{gs-pptdc-90
, author =	"R. L. Graham and N. J. A. Sloane"
, title =	"Penny-packing and two-dimensional codes"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"1--11"
}

@article{gy-fchsp-83
, author =	"R. L. Graham and F. F. Yao"
, title =	"Finding the convex hull of a simple polygon"
, journal =	"J. Algorithms"
, volume =	4
, year =	1983
, pages =	"324--331"
, keywords =	"designing algorithms, convex hull, two-dimensional, worst-case analysis"
, annote =	"$O(n)$ time where points are ordered vertices"
}

@misc{g-ggmpa
, author =	"Torbj{\"o}rn Granlund"
, title =	"{GMP}, The {GNU} Multiple Precision Arithmetic Library"
, url =	"https://gmplib.org/"
, update =	"02.03 devillers"
}

@manual{g-ggmpa-96
, author =	"Torbj{\"o}rn Granlund"
, title =	"{GMP}, The {GNU} Multiple Precision Arithmetic Library"
, edition =	"2.0.2"
, year =	1996
, url =	"http://gmplib.org/"
, update =	"02.03 devillers, 00.03 devillers"
}

@book{g-cof-01
, author =	"Jack E. Graver"
, title =	"Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures"
, publisher =	"Mathematical Association of America"
, year =	2001
, location =	"Washington, D.C."
, update =	"02.03 orourke"
}

@book{gw-cetg-77
, author =	"J. E. Graver and M. E. Watkins"
, title =	"Combinatorics with Emphasis on the Theory of Graphs"
, publisher =	"Springer-Verlag"
, year =	1977
, update =	"97.11 bibrelex"
}

@article{g-asleb-97
, author =	"J. Gravesen"
, title =	"Adaptive subdivision and the length and energy of {B\'ezier} curves"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"13--31"
, update =	"97.07 devillers"
}

@inproceedings{gblp-dcrao-96
, author =	"J. Gray and A. Bosworth and A. Layman and H. Patel"
, title =	"Data cube: {A} relational aggregation operator generalizing group-by, cross-tab, and sub-totals"
, booktitle =	"Proc. 12th IEEE Internat. Conf. Data Eng."
, year =	1996
, pages =	"152--159"
, update =	"97.07 agarwal"
}

@article{gmi-hibef-90
, author =	"L. Gray and L. Martha and A. Ingraffea"
, title =	"Hypersingular integrals in boundary element fracture analysis"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	20
, year =	1990
, pages =	"1135--1158"
, update =	"97.11 bibrelex"
}

@phdthesis{g-tsdg-93
, author =	"J. Green-Cottingham"
, title =	"Thrackles, Surfaces and Drawings of Graphs"
, school =	"Clemson Univ."
, year =	1993
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@techreport{g-chabd-80
, author =	"P. J. Green"
, title =	"Convex hulls in the analysis of bivariate data"
, type =	"Paper read at the conference ``{Looking} at {Multivariate} {Data}''"
, institution =	"Univ. Durham"
, address =	"Sheffield, England"
, year =	1980
}

@incollection{g-pbd-81
, author =	"P. J. Green"
, title =	"Peeling Bivariate Data"
, editor =	"Vic Barnet"
, booktitle =	"Interpreting Multivariate Data"
, publisher =	"John Wiley \& Sons"
, address =	"Chichester"
, year =	1981
, pages =	"3--19"
, update =	"99.11 bibrelex"
, annote =	"Suggested Delaunay peeling, successive removing layers
		 from DT"
}

@article{gs-cdtp-78
, author =	"P. J. Green and R. R. Sibson"
, title =	"Computing {Dirichlet} tessellations in the plane"
, journal =	"Comput. J."
, volume =	21
, year =	1978
, pages =	"168--173"
, keywords =	"implementing algorithms, Delaunay triangulations, two-dimensional"
}

@article{gs-cchsp-79
, author =	"P. J. Green and B. W. Silverman"
, title =	"Constructing the convex hull of a set of points in the plane"
, journal =	"Comput. J."
, volume =	22
, year =	1979
, pages =	"262--266"
, keywords =	"implementing algorithms, convex hull, two-dimensional"
, annote =	"Implementation notes and benchmarks for Eddy's
		 algorithm [e-nchap-77]"
}

@book{g-lat-67
, author =	"M. Greenberg"
, title =	"Lectures on Algebraic Topology"
, publisher =	"Benjamin"
, address =	"Reading, MA"
, year =	1967
, update =	"95.05 agarwal"
}

@book{gh-atfc-81
, author =	"M. Greenberg and J. Harper"
, title =	"Algebraic Topology: {A} First Course"
, publisher =	"Benjamin-Cummings"
, address =	"Reading, MA"
, year =	1981
, update =	"98.03 bibrelex"
}

@inproceedings{ghs-paslc-93
, author =	"Ronald I. Greenberg and Shih-Chuan Hung and Jau-Der Shih"
, title =	"Parallel Algorithms for Single-Layer Channel Routing"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"456--465"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@article{gl-rrft-89
, author =	"R. I. Greenberg and C. E. Leiserson"
, title =	"Randomized routing on fat-trees"
, journal =	"Adv. Comput. Res."
, volume =	5
, year =	1989
, pages =	"345--374"
, update =	"98.03 bibrelex"
}

@inproceedings{g-aipas-89
, author =	"D. Greene"
, title =	"An implementation and performance analysis of spatial data access methods"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Data Eng."
, year =	1989
, pages =	"606--615"
, update =	"97.07 agarwal"
}

@unpublished{g-ilsi-
, author =	"D. H. Greene"
, title =	"Integer line segment intersection"
, note =	"Unpublished Manuscript"
, update =	"98.03 bibrelex"
}

@incollection{g-dpcp-83
, author =	"Daniel H. Greene"
, title =	"The Decomposition of Polygons into Convex Parts"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"235--259"
, update =	"01.04 icking"
, annote =	"minimal decomposition; finds optimal in $O(n^{4})$
		 time, constant-factor in $O(n \log n)$"
}

@book{gk-maa-82
, author =	"D. H. Greene and D. E. Knuth"
, title =	"Mathematics for the analysis of algorithms"
, publisher =	"Birkh{\"a}user"
, address =	"Boston"
, year =	1982
, update =	"97.11 bibrelex"
}

@inproceedings{gy-frcg-86
, author =	"D. H. Greene and F. F. Yao"
, title =	"Finite-resolution computational geometry"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"143--152"
}

@incollection{g-dirsc-94
, author =	"Ned Greene"
, title =	"Detecting Intersection of a Rectangular Solid and a Convex Polyhedron"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"74--82"
, keywords =	"collision detection, octree, computational geometry"
, update =	"94.09 heckbert"
, annote =	"Presents an optimized technique to test for intersection
between a convex polyhedron and a box. This is useful when comparing
bounding boxes against a viewing frustum in a rendering program, for
instance. Contains pseudocode."
}

@inproceedings{gkm-hzbv-93
, author =	"N. Greene and M. Kass and G. Miller"
, title =	"Hierachical Z-Buffer Visibility"
, booktitle =	"Computer Graphics Proceedings, Annu. Conference Series, 1993"
, year =	1993
, pages =	"273--278"
, update =	"97.11 bibrelex"
}

@article{g-nsnbp-90
, author =	"L. Greengard"
, title =	"The numerical solution of the {N}-body problem"
, journal =	"Computers in Physics"
, volume =	"??"
, year =	1990
, pages =	"142--152"
, update =	"97.07 agarwal"
}

@book{g-repfp-88
, author =	"L. Greengard"
, title =	"The rapid evaluation of potential fields in particle systems"
, publisher =	"MIT Press"
, address =	"Cambridge"
, year =	1988
, update =	"97.07 agarwal"
}

@article{g-dawp-60
, author =	"M. Greenlinger"
, title =	"Dehn's algorithm for the word problem"
, journal =	"Commun. Pure Appl. Math."
, volume =	13
, year =	1960
, pages =	"67--83"
, update =	"98.07 bibrelex"
}

@article{g-ulebt-89
, author =	"A. Gregori"
, title =	"Unit Length Embedding of Binary Trees on a Square Grid"
, journal =	"Inform. Process. Lett."
, volume =	31
, year =	1989
, pages =	"167--172"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@incollection{g-eblit-75
, author =	"J. Gregory"
, title =	"Error bounds for linear interpolation on triangles"
, editor =	"J. R. Whiteman"
, booktitle =	"The Mathematics of Finite Elements and Applications II"
, publisher =	"Academic Press"
, year =	1975
, pages =	"163--170"
, update =	"97.11 bibrelex"
}

@article{gc-tipca-80
, author =	"J. A. Gregory and Charrot"
, title =	"A $C^1$ triangular interpolation patch for computer-aided geometric design"
, journal =	"Comput. Graph. Image Process."
, volume =	13
, year =	1980
, pages =	"80--87"
, update =	"98.03 bibrelex"
}

@article{g-sgtpa-73
, author =	"U. Grenander"
, title =	"Statistical geometry: a tool for pattern analysis"
, journal =	"Bull. Amer. Math. Soc."
, volume =	79
, year =	1973
, pages =	"829--856"
}

@incollection{gck-ccs-91
, author =	"U. Grenander and Y. Chow and D. M. Keenan"
, title =	"Connectivity of Configuration Space"
, chapter =	"D"
, booktitle =	"Hands: A Pattern Theoretic Study of Biological Shapes"
, type =	"Appendix"
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"108--128"
, update =	"02.03 orourke"
}

@article{gks-ecstv-90
, author =	"J. Gretenkort and P. Kleinschmidt and B. Sturmfels"
, title =	"On the existence of certain smooth toric varieties"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"255--262"
}

@article{gs-ngcha-87
, author =	"D. Gries and I. Stojmenovi{\'c}"
, title =	"A note on {Graham}'s convex hull algorithm"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"323--327"
, succeeds =	"g-eadch-72"
}

@book{g-sap-87
, author =	"D. A. Griffith"
, title =	"Spatial Autocorrelation: a primer"
, publisher =	"Association of American Cartographers"
, address =	"Washington"
, year =	1987
, update =	"96.09 kreveld"
}

@article{g-eheld-79
, author =	"J. G. Griffith"
, title =	"Eliminating hidden edges in line drawing"
, journal =	"Comput. Aided Design"
, volume =	11
, year =	1979
, pages =	"71--78"
}

@article{g-cvrtp-81
, author =	"H. Griffiths"
, title =	"Cayley's version of the resultant of two polynomials"
, journal =	"Amer. Math. Monthly"
, volume =	"??"
, month =	may
, year =	1981
, pages =	"328--338"
, update =	"98.03 bibrelex"
}

@inproceedings{gkp-aspgt-95
, author =	"M. Grigni and E. Koutsoupias and C. H. Papadimitriou"
, title =	"An approximation scheme for planar graph {TSP}"
, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '95"
, year =	1995
, pages =	"640--645"
, update =	"00.03 bibrelex, 97.03 agarwal+bibrelex, 95.09 mitchell"
}

@article{gv-cccsa-92
, author =	"Dima Grigor{\'e}v and Nicolai Vorobjov"
, title =	"Counting connected components of a semi-algebraic set in subexponential time"
, journal =	"Comput. Complexity"
, volume =	2
, year =	1992
, pages =	"133--186"
, update =	"98.07 agarwal"
}

@inproceedings{gkms-lbrad-96
, author =	"Dima Grigoriev and Marek Karpinski and {Friedhelm Meyer auf der Heide} and Roman Smolensky"
, title =	"A Lower Bound for Randomized Algebraic Decision Trees"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, year =	1996
, pages =	"612--619"
, update =	"01.07 orourke"
}

@inproceedings{gkv-clbtm-94
, author =	"Dima Grigoriev and Marek Karpinski and Nicolai Vorobjov"
, title =	"Complexity Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	""
, update =	"94.01 jones"
}

@article{gv-clbct-96
, author =	"Dima Grigoriev and Nicolai Vorobjov"
, title =	"Complexity lower bounds for computation trees with elementary transcendental function gates"
, journal =	"Theoret. Comput. Sci."
, volume =	157
, year =	1996
, pages =	"185--214"
, comments =	"Proves an $\Omega(\sqrt{log N})$ lower bound for testing
membership in a set whose sum of Betti numbers is $N$, or membership
in a polyhedron with $N$ faces (of all dimensions).  The model of
computation generalizes Ben-Or's algebraic computation trees by also
allowing the computation of Pfaffian functions such as exp, log, sin,
cos, etc."
, update =	"97.07 agarwal"
}

@article{g-cdta-87
, author =	"D. Y. Grigoryev"
, title =	"Complexity of deciding {Tarski} algebra"
, journal =	"J. Symbolic Comput."
, volume =	"??"
, year =	1987
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@inproceedings{gmo-laapc-98
, author =	"C. I. Grima and A. M{\'a}rquez and L. Ortega"
, title =	"A Locus Approach to Angle Problems in Computational Geometry"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	87
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{gmo-pdgo-99
, author =	"Clara I. Grima and Alberto M{\'a}rquez and Lidia Ortega"
, title =	"Polar Diagrams of Geometric Objects"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"149--151"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@book{gs-prp-85
, author =	"G. R. Grimmet and D. R. Stirzaker"
, title =	"Probability and Random Processes"
, publisher =	"Clarendon Press"
, address =	"Oxford, UK"
, year =	1985
, update =	"98.03 bibrelex"
}

@article{g-clcmb-86
, author =	"W. E. Grimson"
, title =	"The combinatorics of local constraints in model-based recognition and localization from sparse data"
, journal =	"J. ACM"
, volume =	33
, year =	1986
, pages =	"658--686"
, update =	"98.03 bibrelex"
}

@article{gl-lopsi-87
, author =	"W. E. Grimson and T. Lozano-Perez"
, title =	"Localizing overlapping parts by searching the interpretation tree"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-9"
, year =	1987
, pages =	"469--482"
, update =	"98.03 bibrelex"
}

@book{g-iscsh-81
, author =	"W. E. L. Grimson"
, title =	"Form Images to Surfaces: A Computational Study of the Human Early Visual System"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1981
, update =	"97.11 bibrelex"
}

@inproceedings{gh-sgh-90
, author =	"W. E. L. Grimson and D. P. Huttenlocher"
, title =	"On the sensitivity of geometric hashing"
, booktitle =	"Proc. 3rd Internat. Conf. Comput. Vision"
, year =	1990
, pages =	"334--338"
, update =	"98.07 rote, 97.11 bibrelex"
}

@techreport{gc-cspum-93
, author =	"R. Grinde and T. Cavalier"
, title =	"Containment of a single polygon using mathematical programming"
, type =	"Technical {Report} {IMSE} {Working} {Paper}"
, number =	"92-164"
, institution =	"Dept. Industrial and Management Systems Engineering, Pennsylvania State Univ."
, year =	1993
, update =	"98.07 bibrelex"
}

@article{gc-natpc-96
, author =	"R. Grinde and T. M. Cavalier"
, title =	"A new algorithm for the two-polygon containment problem"
, journal =	"Comput. Oper. Res."
, volume =	"??"
, year =	1996
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@article{g-tprc2-81
, author =	"P. Gritzmann"
, title =	"Tight polyhedral realizations of closed $2$-dimensional manifolds in {$R^{3}$}"
, journal =	"J. Geom."
, volume =	17
, year =	1981
, pages =	"69--76"
}

@article{ghk-gbrcp-91
, author =	"P. Gritzmann and L. Habsieger and V. Klee"
, title =	"Good and bad radii of convex polygons"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"395--403"
}

@inproceedings{gh-ptamr-95
, author =	"Peter Gritzmann and Alexander Hufnagel"
, title =	"A Polynomial Time Algorithm for {Minkowski} Reconstruction"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"1--9"
, keywords =	"polytopes, convexity, computer vision, facet volumes"
, cites =	"df-ccv-88, dgh-ccmv-94, gj-cigtn-79, gh-acmrt-94, gk-csbpc-94, g-immv-90, g-sgi-93, gls-gaco-88, h-egi-84, h-rv-86, h-apbmt-95, l-pvc-91, l-imrcp-83, l-egimv-85, m-aludk-97, m-vuo-03, s-mv-93, s-cbbmt-93, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@techreport{gh-acmrt-94
, author =	"P. Gritzmann and A. Hufnagel"
, title =	"On the algorithmic complexity of {Minkowski}'s reconstruction theorem"
, type =	"Manuscript"
, institution =	"??"
, year =	1994
, update =	"98.03 bibrelex"
}

@article{gk-ccioj-93
, author =	"P. Gritzmann and V. Klee"
, title =	"Computational complexity of inner and outer $j$-radii of polytopes in finite-dimensional normed spaces"
, journal =	"Math. Program."
, volume =	59
, year =	1993
, pages =	"163--213"
, update =	"93.09 smid"
}

@incollection{gk-cc-97
, author =	"P. Gritzmann and V. Klee"
, title =	"Computational convexity"
, chapter =	27
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"491--516"
, update =	"97.11 orourke"
}

@article{gk-iojrc-92
, author =	"P. Gritzmann and V. Klee"
, title =	"Inner and outer $j$-radii of convex bodies in finite-dimensional normed spaces"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"255--280"
}

@incollection{gk-csbpc-94
, author =	"P. Gritzmann and V. Klee"
, title =	"On the complexity of some basic problems in computational convexity: {II}. {Volume} and mixed volumes"
, editor =	"T. Bisztriczky and P. McMullen and R. Schneider and A. I. Weiss"
, booktitle =	"Polytopes: Abstract, Convex and Computational"
, publisher =	"Kluwer Academic Publischers"
, year =	1994
, pages =	"373--466"
, update =	"98.03 bibrelex"
}

@inproceedings{gkw-lplpo-90
, author =	"P. Gritzmann and V. Klee and J. Westwater"
, title =	"On the limited power of linear probes and other optimization oracles"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"92--101"
, cites =	"bb-ca-85, cy-sp-87, dey-pcp-86, gls-gaco-88, sk-ctnmx-78, s-gp-88, s-pgp-89, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@inproceedings{gkw-pcdlp-93
, author =	"Peter Gritzmann and Victor Klee and John Westwater"
, title =	"Polytope Containment And Determination By Linear Probes"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"59--60"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{gl-emwpi-89
, author =	"P. Gritzmann and M. Lassak"
, title =	"Estimates for the minimal width polytopes inscribed in convex bodies"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"627--635"
}

@article{gmpp-eptvs-91
, author =	"P. Gritzmann and B. Mohar and J. Pach and R. Pollack"
, title =	"Embedding a Planar Triangulation with Vertices at Specified Points"
, journal =	"Amer. Math. Monthly"
, volume =	98
, number =	2
, year =	1991
, pages =	"165--166"
, update =	"98.11 bibrelex, 93.09 held"
}

@article{gs-mapcc-93
, author =	"P. Gritzmann and B. Sturmfels"
, title =	"Minkowski addition of polytopes: Computational complexity and applications"
, journal =	"SIAM J. Discrete Math."
, volume =	6
, year =	1993
, pages =	"246--269"
, update =	"94.05 matousek"
}

@article{g-immv-90
, author =	"H. Groemer"
, title =	"On an inequality of {Minkowski} for mixed volumes"
, journal =	"Geom. Dedicata"
, volume =	33
, year =	1990
, pages =	"117--122"
, update =	"98.03 bibrelex"
}

@article{g-cbtpp-90
, author =	"H. Groemer"
, title =	"On convex bodies that permit packings of high density"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"357--364"
}

@article{g-sbppc-86
, author =	"H. Groemer"
, title =	"Some basic properties of packing and covering constants"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"183--193"
}

@incollection{g-sgi-93
, author =	"H. Groemer"
, title =	"Stability of geometric inequalities"
, editor =	"P. M. Gruber and J. M. Wills"
, booktitle =	"Handbook of Convex Geometry"
, volume =	"A"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1993
, pages =	"125--150"
, update =	"98.03 bibrelex"
}

@article{gvdk-sbap-81
, author =	"F. C. A. Groen and P. W. Verbeek and N. DeJong and J. W. Klumper"
, title =	"The Smallest Box Around a Package"
, journal =	"Pattern Recogn."
, volume =	14
, number =	"1--6"
, year =	1981
, pages =	"173--178"
, update =	"94.01 jones, 93.09 held"
}

@techreport{gh-epfpk-84
, author =	"U. Groh and G. Hotz"
, title =	"Ein {Planarit{\"a}tstest} f{\"u}r planar-konvexe {Grapheneinbettungen} mit linearer {Komplexit{\"a}t}"
, type =	"Report"
, number =	"??"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1984
}

@techreport{g-lbds-85
, author =	"V. Grolmusz"
, title =	"A lower bound to diameter searching"
, type =	"Report"
, number =	"??"
, institution =	"Comput. Sci. Dept., E{\"o}tv{\"o}s Lora{\'a}nd Univ."
, address =	"Budapest, Hungary"
, year =	1985
}

@article{g-sih-69
, author =	"M. L. Gromov"
, title =	"Simplexes Inscribed on a Hypersurface"
, journal =	"Mat. Zametki"
, volume =	5
, year =	1969
, pages =	"81--89"
, note =	"In Russian. English translation in Transl. Math. Notes Acad. Sci. USSR 5:52--56, 1969."
, update =	"99.11 bibrelex"
}

@book{gz-cccad-84
, author =	"M. P. Groover and E. W. Zimmers"
, title =	"{CAD}/{CAM}: {Computer} Aided Design and Manufacturing"
, publisher =	"Prentice Hall"
, year =	1984
, update =	"98.03 bibrelex"
}

@inproceedings{g-cgc-30
, author =	"Harald Gropp"
, title =	"Configurations between Geometry and Combinatorics"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"30--32"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@techreport{gj-oqdsi-80
, author =	"W. I. Grosky and R. Jain"
, title =	"On optimizing quadtrees, a data structure for image representation"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Wayne State Univ."
, address =	"Detroit, MI"
, year =	1980
}

@article{g-vg-74
, author =	"J. L. Gross"
, title =	"Voltage graphs"
, journal =	"Discrete Math."
, volume =	9
, year =	1974
, pages =	"239--246"
}

@article{ga-ttcg-74
, author =	"J. L. Gross and S. R. Alpert"
, title =	"The topological theory of current graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	17
, year =	1974
, pages =	"218--233"
}

@article{gr-ltpa2-79
, author =	"J. L. Gross and R. H. Rosen"
, title =	"A linear time planarity algorithm for $2$-complexes"
, journal =	"J. ACM"
, volume =	26
, year =	1979
, pages =	"611--617"
}

@book{gt-tgt-87
, author =	"J. L. Gross and T. W. Tucker"
, title =	"Topological Graph Theory"
, publisher =	"John Wiley \& Sons"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{gt-gagcp-77
, author =	"J. L. Gross and W. Tucker"
, title =	"Generating all graph coverings by permutation voltage assignments"
, journal =	"Discrete Math."
, volume =	18
, year =	1977
, pages =	"273--283"
}

@inproceedings{gpp-odpmr-98
, author =	"Roberto Grossi and Andrea Pietracaprina and Geppino Pucci"
, title =	"Optimal Deterministic Protocols for Mobile Robots on a Grid"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"181--192"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

@article{g-orncm-86
, author =	"D. D. Grossman"
, title =	"Opportunities for Research on Numerical Control Machining"
, journal =	"Commun. ACM"
, volume =	29
, number =	6
, month =	jun
, year =	1986
, pages =	"515--522"
, update =	"98.03 bibrelex"
}

@article{gb-ompcc-75
, author =	"D. D. Grossman and M. W. Blasgen"
, title =	"Orienting mechanical parts by computer-controlled manipulator"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-5"
, number =	5
, year =	1975
, pages =	"561--565"
, update =	"98.07 bibrelex"
}

@book{gm-gtg-64
, author =	"I. Grossman and W. Magnus"
, title =	"Groups and their Graphs"
, publisher =	"Random House"
, year =	1964
, update =	"97.11 bibrelex"
}

@book{g-ttn-66
, author =	"E. Grosswald"
, title =	"Topics from the Theory of Numbers"
, publisher =	"Macmillan"
, address =	"New York, NY"
, year =	1966
, update =	"97.11 bibrelex"
}

@book{gls-gaco-88
, author =	"M. Gr{\"o}tschel and L. Lov{\'a}sz and A. Schrijver"
, title =	"Geometric Algorithms and Combinatorial Optimization"
, series =	"Algorithms and Combinatorics"
, volume =	2
, publisher =	"Springer-Verlag"
, address =	"Berlin Heidelberg"
, year =	1988
, note =	"2nd edition 1994"
, update =	"97.11 bibrelex, 97.03 gaertner+salinger"
}

@incollection{gls-papg
, author =	"M. Gr{\"o}tschel and L. Lov{\'a}sz and A. Schrijver"
, title =	"Polynomial Algorithms for Perfect Graphs"
, editor =	"C. Berge and V. Chv{\'a}tal"
, booktitle =	"Topics on Perfect Graphs"
, series =	"Ann. Discrete Math."
, volume =	21
, publisher =	"North-Holland"
, year =	1984
, update =	"98.11 bibrelex"
}

@article{gls-emicc-81
, author =	"M. Gr{\"o}tschel and L. Lov{\'a}z and A. Schrijver"
, title =	"The Ellipsoid Method and its Consequences on Combinatorial Optimization"
, journal =	"Combinatorica"
, volume =	1
, year =	1981
, pages =	"169--197"
, update =	"98.03 bibrelex"
}

@inproceedings{gmv-ocmhs-95
, author =	"Edward F. Grove and T. M. Murali and Jeffrey Scott Vitter"
, title =	"The Object Complexity Model for Hidden-Surface Elimination"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"273--278"
, update =	"95.09 jones"
}

@article{gmv-ocmhs-99
, author =	"E. F. Grove and T. M. Murali and J. S. Vitter"
, title =	"The Object Complexity Model for Hidden-Surface Removal"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, number =	2
, month =	apr
, year =	1999
, pages =	"207--217"
, update =	"99.07 held+smid"
}

% pages correct?
@incollection{g-acb-83
, author =	"P. M. Gruber"
, title =	"Approximation of convex bodies"
, editor =	"Peter M. Gruber and J. M. Wills"
, booktitle =	"Convexity and its Applications"
, publisher =	"Birkh{\"a}user"
, address =	"Basel, Switzerland"
, year =	1983
, pages =	"131--162"
, keywords =	"survey paper"
, update =	"93.09 milone+mitchell+rote"
}

@incollection{g-aacb-93
, author =	"P. M. Gruber"
, title =	"Aspects of approximation of convex bodies"
, chapter =	"1.10"
, editor =	"Peter M. Gruber and J. M. Wills"
, booktitle =	"Handbook of Convex Geometry"
, volume =	"A"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1993
, pages =	"319--345"
, keywords =	"survey paper"
, update =	"93.09 rote"
}

@incollection{g-hc-93
, author =	"P. M. Gruber"
, title =	"History of Convexity"
, editor =	"P. M. Gruber and J. M. Wills"
, booktitle =	"Handbook of Convex Geometry"
, publisher =	"North-Holland"
, year =	1993
, update =	"99.11 bibrelex, 97.03 pocchiola"
}

@book{gl-gn-87
, author =	"Peter M. Gruber and C. G. Lekkerkerker"
, title =	"Geometry of Numbers"
, edition =	"2nd"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1987
, succeeds =	"l-gn-69"
, update =	"93.09 rote"
}

@book{gw-cia-83
, title =	"Convexity and its Applications"
, editor =	"Peter M. Gruber and J. M. Wills"
, publisher =	"Birkh{\"a}user"
, address =	"Basel, Switzerland"
, year =	1983
, keywords =	"collection, survey papers"
, update =	"93.09 rote"
}

@book{gw-hcg-93a
, title =	"Handbook of Convex Geometry"
, editor =	"Peter M. Gruber and J. M. Wills"
, volume =	"A"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1993
, keywords =	"collection, survey papers"
, update =	"93.09 rote"
}

@book{gw-hcg-93b
, title =	"Handbook of Convex Geometry"
, editor =	"Peter M. Gruber and J. M. Wills"
, volume =	"B"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1993
, keywords =	"collection, survey papers"
, update =	"93.09 rote"
}

@article{g-pvc-56
, author =	"B. Gr{\"u}nbaum"
, title =	"A proof of {V{\'a}zsonyi}'s conjecture"
, journal =	"Bull. Research Council Israel, Section A"
, volume =	6
, year =	1956
, pages =	"77--78"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@book{g-as-72
, author =	"B. Gr{\"u}nbaum"
, title =	"Arrangements and Spreads"
, series =	"Regional Conf. Ser. Math."
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1972
, update =	"98.03 agarwal"
}

@article{g-ah-71
, author =	"B. Gr{\"u}nbaum"
, title =	"Arrangements of hyperplanes"
, journal =	"Congr. Numer."
, volume =	3
, year =	1971
, pages =	"41--106"
, comments =	"Louisiana Conf. on Comb., Graph Theory \& Comput."
}

@book{g-cp-67
, author =	"B. Gr{\"u}nbaum"
, title =	"Convex Polytopes"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1967
, update =	"99.11 bibrelex"
}

@article{g-hcp-95
, author =	"B. Gr{\"u}nbaum"
, title =	"How to convexify a polygon"
, journal =	"Geombinatorics"
, volume =	5
, month =	jul
, year =	1995
, pages =	"24--30"
, update =	"98.11 orourke"
}

@techreport{g-lcg-74
, author =	"B. Gr{\"u}nbaum"
, title =	"Lectures on Combinatorial Geometry"
, type =	"Mimeographed {Note}"
, institution =	"Univ. Washington"
, address =	"Seattle, WA"
, year =	1974
, update =	"97.11 bibrelex"
}

@article{g-ts-55
, author =	"B. Gr{\"u}nbaum"
, title =	"On a theorem of L. A. Santalo"
, journal =	"Pacific J. Math."
, volume =	5
, year =	1955
, pages =	"351--359"
, update =	"98.03 bibrelex"
}

@article{g-ct-58
, author =	"B. Gr{\"u}nbaum"
, title =	"On common transversals"
, journal =	"Arch. Math."
, volume =	9
, year =	1958
, pages =	"465--469"
}

@article{g-iss-59
, author =	"B. Gr{\"u}nbaum"
, title =	"On intersections of similar sets"
, journal =	"Portugal Math."
, volume =	18
, year =	1959
, pages =	"155--164"
, update =	"97.11 bibrelex"
}

@inproceedings{g-ibs-70
, author =	"B. Gr{\"u}nbaum"
, title =	"The importance of being straight"
, booktitle =	"Proceedings of the 12th Biennial Seminar of the Canadian Mathematical Congress on TimeSeries and Stochastic Processes; Convexity and Combinatorics"
, year =	1970
, pages =	"243--254"
, update =	"98.03 bibrelex"
}

@article{gm-csfs-61
, author =	"B. Gr{\"u}nbaum and T. S. Motzkin"
, title =	"On components in some families of sets"
, journal =	"Proc. Amer. Math. Soc."
, volume =	12
, year =	1961
, pages =	"607--613"
, update =	"98.03 bibrelex"
}

@article{gs-rwnpc-90
, author =	"B. Gr{\"u}nbaum and G. C. Shephard"
, title =	"Rotation and winding numbers for polygons and curves"
, journal =	"Trans. Amer. Math. Soc."
, volume =	322
, number =	1
, year =	1990
, pages =	"169--187"
, update =	"98.11 bibrelex"
}

@article{gs-spp-87
, author =	"B. Gr{\"u}nbaum and G. C. Shephard"
, title =	"Some problems on polyhedra"
, journal =	"J. Geom."
, volume =	29
, number =	2
, month =	aug
, year =	1987
, pages =	"182--190"
, update =	"97.11 bibrelex"
}

@inproceedings{gs-gpg-81
, author =	"B. Gr{\"u}nbaum and G. C. Shephard"
, title =	"The geometry of planar graphs"
, booktitle =	"Proc. 8-th British Combinatorial Conference"
, year =	1981
, update =	"97.11 bibrelex"
}

@book{gs-tp-87
, author =	"B. Gr{\"u}nbaum and G. C. Shephard"
, title =	"Tilings and Patterns"
, publisher =	"W. H. Freeman"
, address =	"New York, NY"
, year =	1987
}

@techreport{gz-cpff-98
, author =	"Branko Gr{\"u}nbaum and Joseph Zaks"
, title =	"Convexification of polygons by flips and by flipturns"
, number =	"6/4/98"
, institution =	"Department of Mathematics, University of Washington"
, address =	"Seattle"
, year =	1998
, update =	"02.03 orourke"
}

@article{g-dcrcf-57
, author =	"A. Grzegorczyk"
, title =	"On the definition of computable real continuous functions"
, journal =	"Fund. math."
, volume =	44
, year =	1957
, pages =	"61--71"
, update =	"98.11 bibrelex"
}

@techreport{gm-radhd-89
, author =	"D. J. Gschwind and T. P. Murtagh"
, title =	"A Recursive Algorithm for Drawing Hierarchical Directed Graphs"
, number =	"CS-89-02"
, institution =	"Department of Computer Science, Williams College"
, year =	1989
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{gchhzy-otmo-92
, author =	"C. Gu and S. Campbell and J. Hong and Q. He and D. Zhang and P. Yeh"
, title =	"Optical thresholding and maximum operations"
, journal =	"Appl. Optics"
, volume =	31
, number =	26
, year =	1992
, pages =	"5661--5665"
, update =	"98.11 bibrelex"
}

@inproceedings{gh-ecbcp-00
, author =	"Roser Gu{\`a}rdia and Ferran Hurtado"
, title =	"On the Equipartitions of Convex Bodies and Convex Polygons"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"47--50"
, update =	"00.03 bibrelex"
}

@article{gk-shfmp-70
, author =	"M. D. Guay and D. C. Kay"
, title =	"On sets having finitely many points of local nonconvexity"
, journal =	"Israel J. Math."
, volume =	"??"
, year =	1970
, pages =	"39--52"
, update =	"97.11 bibrelex"
}

@techreport{gl-faatn-97
, author =	"Joachim Gudmundsson and Christos Levcopoulos"
, title =	"A Fast Approximation Algorithm for {TSP} with Neighborhoods"
, type =	"Technical Report"
, number =	"LU-CS-TR:97-195"
, institution =	"Dept. of Comp. Sci., Lund University"
, year =	1997
, update =	"98.03 mitchell"
}

@article{gl-faatn-99
, author =	"J. Gudmundsson and C. Levcopoulos"
, title =	"A Fast Approximation Algorithm for {TSP} with Neighborhoods"
, journal =	"Nordic J. Comput."
, volume =	6
, year =	1999
, pages =	"469--488"
, update =	"01.11 smid"
}

@article{gl-paamw-00
, author =	"J. Gudmundsson and C. Levcopoulos"
, title =	"A Parallel Approximation Algorithm for Minimum Weight Triangulation"
, journal =	"Nordic J. Comput."
, volume =	7
, year =	2000
, pages =	"32--57"
, update =	"01.11 smid"
}

@article{gln-ammn-01
, author =	"J. Gudmundsson and C. Levcopoulos and G. Narasimhan"
, title =	"Approximating a minimum {Manhattan} network"
, journal =	"Nordic J. Comput."
, volume =	8
, year =	2001
, pages =	"219--232"
, update =	"01.11 smid"
}

@inproceedings{gln-igacs-00
, author =	"J. Gudmundsson and C. Levcopoulos and G. Narasimhan"
, title =	"Improved greedy algorithms for constructing sparse geometric spanners"
, booktitle =	"Proc. 7th Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	1851
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	2000
, pages =	"314--327"
, update =	"00.11 smid"
}

@inproceedings{glns-adogg-02
, author =	"J. Gudmundsson and C. Levcopoulos and G. Narasimhan and M. Smid"
, title =	"Approximate distance oracles for geometric graphs"
, booktitle =	"Proc. 13th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '02"
, year =	2002
, pages =	"828--837"
, update =	"02.03 smid"
}

@article{g-rst-83
, author =	"A. Gu{\'e}noche"
, title =	"Random spanning tree"
, journal =	"J. Algorithms"
, volume =	4
, year =	1983
, pages =	"214--220"
}

@inproceedings{gs-rellt-92
, author =	"E. Guevremont and J. Snoeyink"
, title =	"Recognizing an Envelope of Lines in Linear Time"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"370--377"
, update =	"94.09 smid, 93.09 milone+mitchell"
}

@book{g-agglc-77
, author =	"H. W. Guggenheimer"
, title =	"Applicable Geometry: global and local convexity"
, publisher =	"R. E. Krieger"
, address =	"Huntington, NY"
, year =	1977
, update =	"98.07 orourke"
}

@book{g-dg-63
, author =	"H. W. Guggenheimer"
, title =	"Differential Geometry"
, publisher =	"McGraw-Hill"
, address =	"New York, NY"
, year =	1963
, update =	"01.04 icking, 00.11 smid, 00.07 orourke, 97.11 bibrelex"
}

@article{g-opaue-93
, author =	"S. Guha"
, title =	"An optimal parallel algorithm using exclusive read/writes for the rectilinear {Voronoi} diagram"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, number =	""
, year =	1993
, pages =	"37--52"
, keywords =	"parallel algorithm, rectilinear metric, Voronoi diagram"
, update =	"93.09 guha"
}

@inproceedings{g-omcas-93
, author =	"Sumanta Guha"
, title =	"Optimal Mesh Computer Algorithms for Simple Polygons"
, booktitle =	"Proc. 7th IEEE Internat. Parallel Process. Sympos."
, publisher =	"IEEE Computer Society"
, year =	1993
, pages =	"182--187"
, update =	"93.09 guha"
}

@inproceedings{g-paapp-93
, author =	"Sumanta Guha"
, title =	"Parallel Analog Algorithms for Processing Polygonal Images on a Systolic Screen"
, booktitle =	"Proc. 7th IEEE Internat. Parallel Process. Sympos."
, publisher =	"IEEE Computer Society"
, year =	1993
, pages =	"557--562"
, update =	"93.09 guha"
}

@techreport{g-pcief-91
, author =	"S. Guha"
, title =	"Parallel computation of internal and external farthest neighbors in simple polygons"
, type =	"Manuscript"
, institution =	"EECS Dept., Univ. Michigan"
, address =	"Ann Arbor, MI"
, year =	1991
, update =	"97.11 bibrelex"
}

@article{g-pcief-92
, author =	"S. Guha"
, title =	"Parallel computation of internal and external farthest neighbours in simple polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"175--190"
, keywords =	"parallel algorithm, simple polygons, farthest neighbors"
}

@techreport{ghlst-ltavs-86t
, author =	"L. Guibas and J. Hershberger and D. Leven and M. Sharir and R. E. Tarjan"
, title =	"Linear time algorithm for visibility and shortest path problems inside a triangulated simple polygon"
, type =	"Technical {Report}"
, number =	218
, institution =	"Dept. Comput Sci., Courant Institute"
, address =	"New York, NY"
, month =	apr
, year =	1986
, update =	"98.03 bibrelex"
}

@unpublished{ghs-btdsc-88
, author =	"L. Guibas and J. Hershberger and J. Snoeyink"
, title =	"Bridge trees: a data structure for convex hulls"
, year =	1988
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@inproceedings{ghsz-kcud-00
, author =	"Leonidas Guibas and John Hershberger and Subash Suri and Li Zhang"
, title =	"Kinetic Connectivity for Unit Disks"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"331--340"
, update =	"00.11 jones"
}

@inproceedings{gm-rad-95
, author =	"Leonidas Guibas and David Marimont"
, title =	"Rounding Arrangements Dynamically"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"190--199"
, keywords =	"robustness, randomized incremental algorithm"
, precedes =	"gm-rad-98"
, cites =	"bo-arcgi-79, ce-oails-92, cs-arscg-89,  f-smpst-89, fm-nsala-91, g-ilsi-, gy-frcg-86, h-psifp-94, hhk-tirgc-88, m-grs-93, m-vigau-88p, m-fppa-90, m-cgitr-93, gss-egbra-89, si-gafpa-88, ZZZ"
, update =	"98.11 devillers, 98.03 bibrelex, 95.09 mitchell"
}

@article{gm-rad-98
, author =	"Leonidas Guibas and David Marimont"
, title =	"Rounding Arrangements Dynamically"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"157--176"
, succeeds =	"gm-rad-95"
, update =	"98.11 devillers"
}

@techreport{gos-ilsrs-88t
, author =	"L. Guibas and M. H. Overmars and M. Sharir"
, title =	"Intersecting line segments, ray shooting and other applications of geometric partitioning techniques"
, number =	"RUU-CS-88"
, institution =	"Dept. Computer Science, University of Utrecht"
, year =	1988
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@techreport{gp-narlp-92
, author =	"L. Guibas and M. Pellegrini"
, title =	"New algorithmic results for lines-in-3-space problems"
, type =	"Technical Report"
, number =	"TR-92-005"
, institution =	"Int. Comput. Sci. Institute"
, year =	1992
, update =	"98.11 bibrelex"
}

@techreport{gs-lncg-83
, author =	"L. Guibas and J. Stolfi"
, title =	"Lecture notes on computational geometry"
, number =	"CS 445"
, institution =	"Stanford University"
, address =	"Stanford, California"
, year =	1983
, update =	"98.07 bibrelex"
}

@techreport{gs-pms-
, author =	"L. Guibas and J. Stolfi"
, title =	"Primitives for the Manipulation of Subdivisions"
, type =	"Technical {Report}"
, institution =	"DEC"
, year =	"??"
, update =	"98.03 bibrelex"
}

@article{g-cgvpi-??
, author =	"Leonidas J. Guibas"
, title =	"Computational geometry and visualization: {Problems} at the interface"
, journal =	"??"
, volume =	"??"
, year =	"??"
, pages =	"45--59"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{g-igar-96
, author =	"Leonidas J. Guibas"
, title =	"Implementing Geometric Algorithms Robustly"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, site =	"Philadelphia, PA, USA"
, month =	may
, year =	1996
, pages =	"24--28"
, update =	"98.03 mitchell, 97.11 held"
}

@incollection{g-kdssar-98
, author =	"L. J. Guibas"
, title =	"Kinetic data structures --- a state of the art report"
, editor =	"P. K. Agarwal and L. E. Kavraki and M. Mason"
, booktitle =	"Proc. Workshop Algorithmic Found. Robot."
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1998
, pages =	"191--209"
, update =	"00.03 agarwal"
}

@inproceedings{g-mgcco-97
, author =	"Leonidas J. Guibas"
, title =	"Maintenance of Geometric Configurations under Continuous Object Motion"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	10
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@techreport{ag-dgsmi-96
, author =	"Leonidas J. Guibas and Helmut Alt"
, title =	"Discrete Geometric Shapes: {Matching}, Interpolation, and Approximation"
, number =	"Report B 96-11"
, institution =	"Institut {f\"ur} Informatik, Freie Universit{\"a}t Berlin"
, year =	1996
, url =	"http://www.inf.fu-berlin.de/pub/reports/tr-b-96-11.ps.gz, http://www.inf.fu-berlin.de/inst/pubs/tr-b-96-11.abstract.html"
, update =	"98.03 mitchell"
}

@inproceedings{ghhlw-sepap-95
, author =	"Leonidas J. Guibas and D. Halperin and H. Hirukawa and J.-C. Latombe and R. H. Wilson"
, title =	"A simple and efficient procedure for assembly partitioning under infinitesimal motions"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1995
, pages =	"2553--2560"
, keywords =	"robotics, assembly planning, separability, polytopes"
, update =	"98.03 mitchell, 95.09 halperin"
}

@article{ghhlw-papum-98
, author =	"Leonidas J. Guibas and D. Halperin and H. Hirukawa and J.-C. Latombe and R. H. Wilson"
, title =	"Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"179--200"
, update =	"98.11 devillers"
}

@inproceedings{ghms-vdahf-93
, author =	"Leonidas J. Guibas and D. Halperin and J. Matou{\v s}ek and Micha Sharir"
, title =	"On vertical decomposition of arrangements of hyperplanes in four dimensions"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"127--132"
, cites =	"c-racpq-88, ams-sscch-91, a-caecc-87, cegs-sessr-91, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 96.09 agarwal, 93.09 milone+mitchell"
}

@article{ghms-vdahf-95
, author =	"Leonidas J. Guibas and D. Halperin and J. Matou{\v s}ek and Micha Sharir"
, title =	"On vertical decomposition of arrangements of hyperplanes in four dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"113--122"
, update =	"98.03 mitchell, 97.11 aronov"
}

@article{gh-cvgnl-85
, author =	"Leonidas J. Guibas and J. Hershberger"
, title =	"Computing the visibility graph of $n$ line segments in {$O(n^{2})$} time"
, journal =	"Bull. EATCS"
, volume =	26
, year =	1985
, pages =	"13--20"
, update =	"98.03 mitchell"
}

@inproceedings{gh-msp-94
, author =	"Leonidas J. Guibas and J. Hershberger"
, title =	"Morphing Simple Polygons"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"267--276"
, cites =	"cr-tgsps-85, cw-nstsm-82, kr-sidc-92, sgwm-2dsbi-93, sg-pba2d-92, stt-rdthg-86, t-dpg-83, v-gpga-86, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@inproceedings{gh-ospqs-87
, author =	"Leonidas J. Guibas and J. Hershberger"
, title =	"Optimal shortest path queries in a simple polygon"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"50--63"
, precedes =	"gh-ospqs-89"
, cites =	"aaghi-vdp-86, akmsw-gamsa-86, bt-ladts-86, egs-oplms-86, c-tpca-82, cg-vippg-85, ghlst-ltavs-86, lp-esppr-84, ol-mcp-81, ps-cgi-85, rs-spesp-85, s-agfnp-87, tv-otats-86, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{gh-ospqs-89
, author =	"Leonidas J. Guibas and J. Hershberger"
, title =	"Optimal shortest path queries in a simple polygon"
, journal =	"J. Comput. Syst. Sci."
, volume =	39
, number =	2
, month =	oct
, year =	1989
, pages =	"126--152"
, succeeds =	"gh-ospqs-87"
, update =	"01.04 icking, 98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{ghlst-ltavs-86
, author =	"Leonidas J. Guibas and J. Hershberger and D. Leven and Micha Sharir and R. E. Tarjan"
, title =	"Linear time algorithms for visibility and shortest path problems inside simple polygons"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"1--13"
, precedes =	"ghlst-ltavs-87"
, cites =	"a-eafvp, at-oadvp-81, c-tpca-82, cg-vippg-85, egs-oplms-86, e-eacwv-84, ea-lacvp-81, f-spcrd-86, fm-tspep-84, gjpt-tsp-78, gmpr-nrll-77, grs-kfcg-83, gy-fchsp-83, h-ep-82, hm-ndsrs-82, k-osps-83, l-vsp-83, ll-cvpe-86, lp-esppr-84, ma-lafch-79, ps-rgpcr-86, ps-tspm-81, s-ltaml-86, t-dsna-83, tv-ltats-86, t-spsee-85, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ghlst-ltavs-87
, author =	"Leonidas J. Guibas and J. Hershberger and D. Leven and Micha Sharir and R. E. Tarjan"
, title =	"Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"209--233"
, keywords =	"polygons, simple, shortest paths, visibility, finger search trees"
, succeeds =	"ghlst-ltavs-86"
, update =	"98.03 mitchell"
}

@inproceedings{ghs-citds-90
, author =	"Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
, title =	"Compact interval trees: a data structure for convex hulls"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"169--178"
, precedes =	"ghs-citds-91"
, update =	"98.03 mitchell"
}

@article{ghs-citds-91
, author =	"Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
, title =	"Compact interval trees: a data structure for convex hulls"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	1
, year =	1991
, pages =	"1--22"
, keywords =	"data structures, convex hull, lower bounds, common tangents"
, succeeds =	"ghs-citds-90"
, update =	"98.03 mitchell, 94.01 rote"
, annote =	"replaces the bridge tree data structure used in eghsssw-irals-89"
}

@inproceedings{ghms-apsml-91
, author =	"Leonidas J. Guibas and J. E. Hershberger and Joseph S. B. Mitchell and J. S. Snoeyink"
, title =	"Approximating polygons and subdivisions with minimum link paths"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"151--162"
, precedes =	"ghms-apsml-93"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@article{ghms-apsml-93
, author =	"Leonidas J. Guibas and J. E. Hershberger and Joseph S. B. Mitchell and J. S. Snoeyink"
, title =	"Approximating Polygons and Subdivisions with Minimum Link Paths"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, number =	4
, month =	dec
, year =	1993
, pages =	"383--415"
, succeeds =	"ghms-apsml-91"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@techreport{gks-ricdv-89
, author =	"Leonidas J. Guibas and D. Knuth and Micha Sharir"
, title =	"Randomized incremental construction of {Delaunay} and {Voronoi} diagrams"
, type =	"Technical {Report}"
, number =	481
, institution =	"Courant institute of mathematical sciences"
, month =	dec
, year =	1989
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{gks-ricdv-90
, author =	"Leonidas J. Guibas and Donald E. Knuth and Micha Sharir"
, title =	"Randomized Incremental Construction of {Delaunay} and {Voronoi} Diagrams"
, editor =	"M. S. Paterson"
, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	443
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"414--431"
, precedes =	"gks-ricdv-92"
, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 rote"
, annote =	"Main result: If the order of point insertion is
		 randomized, then the total number of changes to DT
		 when insertion algorithm is used is $O(n)$. By keeping
		 previous triangulations around and searching in old
		 triangulations first, the point location problem takes
		 $O(\log n)$ expected time, meaning that insertion
		 algorithm takes $O(n \log n)$ on average."
}

@article{gks-ricdv-92
, author =	"Leonidas J. Guibas and D. E. Knuth and Micha Sharir"
, title =	"Randomized incremental construction of {Delaunay} and {Voronoi} diagrams"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"381--413"
, succeeds =	"gks-ricdv-90"
, update =	"98.03 mitchell"
}

@inproceedings{gmpr-nrll-77
, author =	"Leonidas J. Guibas and E. McCreight and M. Plass and J. Roberts"
, title =	"A new representation for linear lists"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Theory Comput."
, year =	1977
, pages =	"49--60"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{gmr-vdmpp-91t
, author =	"Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
, title =	"Voronoi diagrams of moving points in the plane"
, type =	"manuscript"
, year =	1991
, precedes =	"gmr-vdmpp-92, agmr-vdmp-98"
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@inproceedings{gmr-vdmpp-92
, author =	"Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
, title =	"Voronoi diagrams of moving points in the plane"
, booktitle =	"Proc. 17th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	570
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"113--125"
, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences"
, succeeds =	"gmr-vdmpp-91t"
, precedes =	"agmr-vdmp-98"
, update =	"00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex, 98.03 mitchell"
}

@article{gmr-rlp-97
, author =	"Leonidas J. Guibas and R. Motwani and P. Raghavan"
, title =	"The robot localization problem"
, journal =	"SIAM J. Comput."
, volume =	26
, number =	4
, month =	aug
, year =	1997
, pages =	"1120--1138"
, update =	"98.03 mitchell, 97.11 smid"
}

@inproceedings{gmr-rlptd-92
, author =	"Leonidas J. Guibas and R. Motwani and P. Raghavan"
, title =	"The robot localization problem in two dimensions"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"259--268"
, precedes =	"gmr-rlp-97"
, update =	"98.03 mitchell"
}

@inproceedings{gor-efpp-91
, author =	"Leonidas J. Guibas and M. H. Overmars and J.-M. Robert"
, title =	"The exact fitting problem for points"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"171--174"
, precedes =	"gor-efpp-96"
, cites =	"a-pal2a-90, bb-atp-88, b-gtfga-80, cegsw-ccbac-90, e-acg-87, eg-tsa-89, hiiry-owlll-90, m-cha-90i, mg-fre-82, st-epdg-83, ZZZ"
, update =	"98.07 agarwal+bibrelex, 98.03 mitchell, 96.09 devillers"
}

@article{gor-efpp-96
, author =	"Leonidas J. Guibas and M. H. Overmars and J.-M. Robert"
, title =	"The exact fitting problem for points"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"215--230"
, succeeds =	"gor-efpp-91"
, update =	"98.07 agarwal, 98.03 mitchell, 97.11 bibrelex, 96.09 devillers"
}

@techreport{gos-crial-89
, author =	"Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
, title =	"Counting and reporting intersections in arrangements of line segments"
, type =	"Technical {Report}"
, number =	434
, institution =	"Dept. Comput. Sci, New York  Univ."
, address =	"New York, NY"
, month =	mar
, year =	1989
, update =	"98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{gos-ilsrs-88
, author =	"Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
, title =	"Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"64--73"
, update =	"98.07 agarwal, 98.03 mitchell"
}

@techreport{gos-rsipl-89
, author =	"Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
, title =	"Ray shooting, implicit point location, and related queries in arrangements of segments"
, type =	"Report"
, number =	433
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, month =	mar
, year =	1989
, keywords =	"random sampling, ray tracing, arrangements, point location"
, update =	"98.07 agarwal, 98.03 mitchell"
}

@inproceedings{grs-kfcg-83
, author =	"Leonidas J. Guibas and L. Ramshaw and J. Stolfi"
, title =	"A kinetic framework for computational geometry"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"100--111"
, update =	"98.03 mitchell"
}

@inproceedings{gss-cscah-90
, author =	"Leonidas J. Guibas and D. Salesin and J. Stolfi"
, title =	"Constructing strongly convex approximate hulls with inaccurate primitives"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"261--270"
, update =	"98.03 mitchell"
}

@article{gss-cscah-93
, author =	"Leonidas J. Guibas and D. Salesin and J. Stolfi"
, title =	"Constructing strongly convex approximate hulls with inaccurate primitives"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"534--560"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{gss-egbra-89
, author =	"Leonidas J. Guibas and D. Salesin and J. Stolfi"
, title =	"Epsilon geometry: building robust algorithms from imprecise computations"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"208--217"
, cites =	"em-sstcd-88, gy-frcg-86, hhk-tirgc-88, grs-kfcg-83, k-acp-73, m-vigau-88a, mk-impgo-84, otu-nsga-87, y-gctsp-88, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@techreport{gs-sp801-82
, author =	"Leonidas J. Guibas and J. Saxe"
, title =	"Solution to problem 80-15: computing the connected components of a collection of rectangles"
, type =	"Report"
, number =	"??"
, institution =	"Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1982
, update =	"98.03 mitchell"
}

@inproceedings{gs-dfbt-78
, author =	"Leonidas J. Guibas and R. Sedgewick"
, title =	"A dichromatic framework for balanced trees"
, booktitle =	"Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1978
, pages =	"8--21"
, update =	"98.03 mitchell, 96.05 agarwal, 94.01 tamassia"
}

@inproceedings{gs-ccrs-86
, author =	"Leonidas J. Guibas and R. Seidel"
, title =	"Computing convolutions by reciprocal search"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"90--99"
, keywords =	"intersection, subdivisions, plane-sweep"
, precedes =	"gs-ccrs-87"
, cites =	"bo-arcgi-79, c-fsnaq-86, eg-tsa-86, g-cp-67, grs-kfcg-83, gs-pmgsc-85, np-psaig-82, s-at-66, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{gs-ccrs-87
, author =	"Leonidas J. Guibas and R. Seidel"
, title =	"Computing convolutions by reciprocal search"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"175--193"
, keywords =	"intersection, subdivisions, plane-sweep"
, succeeds =	"gs-ccrs-86"
, update =	"98.03 mitchell"
}

@techreport{gs-atlrp-90
, author =	"Leonidas J. Guibas and Micha Sharir"
, title =	"Arrangements of Thick Lines and Related problems"
, type =	"Manuscript"
, year =	1990
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@techreport{gs-caa-90
, author =	"Leonidas J. Guibas and Micha Sharir"
, title =	"Combinatorics and algorithms of arrangements"
, type =	"Manuscript"
, year =	1990
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@incollection{gs-caa-93
, author =	"Leonidas J. Guibas and Micha Sharir"
, title =	"Combinatorics and Algorithms of Arrangements"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, address =	"Heidelberg"
, year =	1993
, pages =	"9--36"
, keywords =	"survey paper, arrangements, lower envelopes, Davenport-Shinzel sequences, face complexity, partitioning"
, update =	"98.07 agarwal, 98.03 mitchell, 93.09 erickson"
}

@inproceedings{gss-gmppt-88
, author =	"Leonidas J. Guibas and Micha Sharir and S. Sifrony"
, title =	"On the general motion planning problem with two degrees of freedom"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"289--298"
, precedes =	"gss-gmppt-89"
, cites =	"ass-sulbl-87, as-tsbac-88, a-dcg-83, bo-arcgi-79, cg-vippg-85, dsst-mdsp-86, eg-tsa-86, egppss-acptc-88, eghppsss-ajati-88, egs-cmfal-88, es-mnwsn-87, fwy-cmtra-86, ghlst-ltavs-87, hs-ndssg-86, ks-eapcf-85, ks-empac-90, klps-ujrcf-86, ls-esmpa-87, ls-pptmc-87, lw-apcfp-79, osy-gvdl-86, osy-gvdl-87, oy-rmpmd-85, ps-ueplf-87, pss-stsps-88, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, ss-pmp5c-84, s-tddsp-85, sa-pmp4v-84, s-alubl-87, s-ilbld-88, ss-cmpti-88, ss-nempa-87, ws-prnds-88, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{gss-gmppt-89
, author =	"Leonidas J. Guibas and Micha Sharir and S. Sifrony"
, title =	"On the general motion planning problem with two degrees of freedom"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"491--521"
, keywords =	"motion planning, arrangements"
, succeeds =	"gss-gmppt-88"
, update =	"98.03 mitchell"
}

@techreport{gs-ncg-82
, author =	"Leonidas J. Guibas and J. Stolfi"
, title =	"Notes on Computational Geometry"
, institution =	"XEROX PARK"
, year =	1982
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{gs-canen-83
, author =	"Leonidas J. Guibas and J. Stolfi"
, title =	"On computing all north-east nearest neighbors in the {$L_{1}$} metric"
, journal =	"Inform. Process. Lett."
, volume =	17
, year =	1983
, pages =	"219--223"
, update =	"98.03 mitchell"
}

@inproceedings{gs-pmgsc-83
, author =	"Leonidas J. Guibas and J. Stolfi"
, title =	"Primitives for the manipulation of general subdivisions and the computation of {Voronoi} diagrams"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
, year =	1983
, pages =	"221--234"
, precedes =	"gs-pmgsc-85"
, update =	"98.03 mitchell"
}

@article{gs-pmgsc-85
, author =	"Leonidas J. Guibas and J. Stolfi"
, title =	"Primitives for the manipulation of general subdivisions and the computation of {Voronoi} diagrams"
, journal =	"ACM Trans. Graph."
, volume =	4
, number =	2
, month =	apr
, year =	1985
, pages =	"74--123"
, keywords =	"design of algorithms, data structuring"
, succeeds =	"gs-pmgsc-83"
, update =	"98.07 bibrelex+tamassia, 98.03 mitchell"
, annote =	"data structure for convex hull"
}

@incollection{gs-rccda-88
, author =	"Leonidas J. Guibas and J. Stolfi"
, title =	"Ruler, compass and computer: the design and analysis of geometric algorithms"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"111--165"
, keywords =	"survey paper"
, update =	"98.03 mitchell, 97.03 pocchiola+schwarzkopf"
}

@article{gsc-srttd-87
, author =	"Leonidas J. Guibas and J. Stolfi and K. Clarkson"
, title =	"Solving related two- and three-dimensional linear programming in logarithmic time"
, journal =	"Theoret. Comput. Sci."
, volume =	49
, number =	1
, year =	1987
, pages =	"81--84"
, update =	"98.03 mitchell, 93.09 matousek"
}

@inproceedings{gy-tsr-80
, author =	"Leonidas J. Guibas and F. Frances Yao"
, title =	"On Translating a Set of Rectangles"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
, year =	1980
, pages =	"154--160"
, precedes =	"gy-tsr-83"
, update =	"01.04 icking, 98.03 mitchell"
}

@incollection{gy-tsr-83
, author =	"Leonidas J. Guibas and F. Frances Yao"
, title =	"On Translating a Set of Rectangles"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"61--77"
, succeeds =	"gy-tsr-80"
, update =	"01.04 icking, 98.03 mitchell"
}

@article{gbe-pcsai-92
, author =	"W. Guida and R. Bohacek and M. Erion"
, title =	"Probing the conformational space available to inhibitors on the thermolysin active site using {Monte}-{Carlo}/energy minimization techniques"
, journal =	"J. Comput. Chemistry"
, volume =	13
, number =	2
, year =	1992
, pages =	"214--228"
, update =	"98.07 bibrelex"
}

@book{gp-dt-74
, author =	"V. Guillemin and A. Pollack"
, title =	"Differential Topology"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1974
, update =	"97.11 bibrelex"
}

@inproceedings{g-seppi-84
, author =	"M. Guisti"
, title =	"Some Effectivity Problems in Polynomial Ideal Theory"
, booktitle =	"Proc. EUROSAM 84"
, series =	"Lecture Notes Comput. Sci."
, volume =	174
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"159--171"
, update =	"97.11 bibrelex"
}

@inproceedings{gs-rtctm-98
, author =	"S. Gumhold and W. Stra{\ss}er"
, title =	"Real Time Compression of Triangle Mesh Connectivity"
, booktitle =	"Proc. SIGGRAPH '98"
, site =	"Orlando, FL"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, month =	jul
, year =	1998
, pages =	"133--140"
, update =	"98.11 held"
}

@inproceedings{g-lbtaa-88
, author =	"O. G{\"u}nther"
, title =	"A lower bound and two approximative algorithms for the $k$-partitioning of rectilinear polygons"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"86--95"
}

@book{g-esgdm-88
, author =	"O. G{\"u}nther"
, title =	"Efficient Structures for Geometric Data Management"
, series =	"Lecture Notes Comput. Sci."
, volume =	337
, publisher =	"Springer-Verlag"
, year =	1988
, isbn =	"3-540-50463-X"
, update =	"96.05 agarwal, 93.09 held"
}

@article{g-mkprp-90
, author =	"O. G{\"u}nther"
, title =	"Minimum $k$-Partitioning of Rectilinear Polygons"
, journal =	"J. Symbolic Comput."
, volume =	9
, number =	4
, month =	apr
, year =	1990
, pages =	"457--483"
, update =	"93.09 held"
}

@inproceedings{g-tdcto-89
, author =	"O. G{\"u}nther"
, title =	"The design of the cell tree: {An} object oriented index structure for geometric data bases"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Data Eng."
, year =	1989
, pages =	"598--605"
, update =	"99.07 bibrelex, 97.07 agarwal"
}

@article{gb-tbams-91
, author =	"O. G{\"u}nther and J. Bilmes"
, title =	"Tree based access methods for spatial databases: {Implementation} and performance evaluation"
, journal =	"IEEE Trans. Knowledge and Data Enginerring"
, volume =	3
, year =	1991
, pages =	"342--356"
, update =	"99.07 bibrelex, 97.07 agarwal"
}

@article{gw-dadpi-91
, author =	"O. G{\"u}nther and E. Wong"
, title =	"A Dual Approach to Detect Polyhedral Intersections in Arbitrary Dimensions"
, journal =	"Bit"
, volume =	31
, number =	1
, year =	1991
, pages =	"2--14"
, update =	"98.11 bibrelex"
}

@inproceedings{gw-dsrgd-87
, author =	"O. G{\"u}nther and E. Wong"
, title =	"A Dual Space Representation for Geometric Data"
, booktitle =	"Proc. 13th VLDB Conference"
, year =	1987
, pages =	"501--506"
, update =	"99.07 bibrelex, 97.07 agarwal"
}

@article{g-uptom-96
, author =	"H. G{\"u}nzel"
, title =	"The universal partition theorem for oriented matroids"
, journal =	"Discrete Comput. Geom."
, note =	"(to appear)"
, update =	"96.05 pocchiola"
}

@inproceedings{g-ffsmu-90
, author =	"B. Guo"
, title =	"Free-form surface modeling using implicit patches"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"176--180"
, cites =	"hk-crcs-85i, hh-gpbs-88, w-asmgc-86, bi-hiura-89, p-dlsfas-87, s-pasp-85, d-spqs-, d-pimcc-85, f-spm-86, p-lssic-, ZZZ"
, update =	"98.07 bibrelex"
}

@article{g-ddcps-96
, author =	"B. Guo"
, title =	"On the difficulty of deciding the convexity of polynomials over simplexes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"227--230"
, update =	"96.09 devillers"
}

@article{gmw-sruas-97
, author =	"B. Guo and J. Menon and B. Willette"
, title =	"Surface Reconstruction Using Alpha Shapes"
, journal =	"Comput. Graph. Forum"
, volume =	16
, number =	4
, month =	oct
, year =	1997
, pages =	"177--190"
, update =	"98.07 held"
}

@inproceedings{ghru-hso-97
, author =	"H. Gupta and V. Harinarayan and A. Rajaraman and J. D. Ullman"
, title =	"Index selection for {OLAP}"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1996
, pages =	"205--216"
, update =	"97.07 agarwal"
}

@inproceedings{gw-cpdp-97
, author =	"Himanshu Gupta and Rephael Wenger"
, title =	"Constructing Pairwise Disjoint Paths with Few Links"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, site =	"Halifax, Canada"
, year =	1997
, update =	"01.07 wenger"
}

@article{gw-cplh-97
, author =	"Himanshu Gupta and Rephael Wenger"
, title =	"Constructing Piecewise Linear Homeomorphisms of Simple Polygons"
, journal =	"J. Algorithms"
, volume =	22
, year =	1997
, pages =	"142--157"
, update =	"01.07 wenger"
}

@inproceedings{gs-fospc-96
, author =	"Neelima Gupta and Sandeep Sen"
, title =	"Faster Output-Sensitive Parallel Convex Hulls for $d \le 3$: Optimal Sublogarithmic Algorithms for Small Outputs"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"176--185"
, cites =	"acgoy-pcg-85, agr-pahdc-94, a-oacch-84, ag-epssg-86, ag-pasft-88, ap-p3dch-92, bh-fpsae-93, cd-icott-87, c-pagp-80, c-osrch-95, csy-oscpf-95, cf-dvrsi-90, cm-dosch-92, c-oesa-87, cs-arscg-89, d-opalp-90, dk-pcsh-89, e-acg-87, gg-ptpch-91, g-gpmee-93, g-fdplp-96, g-eadch-72, h-fdpa-93, hr-wmhtb-92, hw-ensrq-87, gz-odapp-95, kr-lbmcl-89, ks-upcha-86, mv-chpnc-91, ph-chfsp-77, p-ortap-79, ps-cgi-85, rs-oprat-92, rs-rstpa-93, rs-rabsl-94, s-lbadt-94, s-pmsua-96, s-cg-78, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@phdthesis{g-eadsg-95
, author =	"P. Gupta"
, title =	"Efficient algorithms and data structures for geometric intersection problems"
, type =	"Ph.{D}. Thesis"
, school =	"University of Minnesota"
, address =	"Minneapolis"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"96.01 smid"
}

@inproceedings{gjmw-egawo-95
, author =	"Prosenjit Gupta and Ravi Janardan and Jayanth Majhi and Tony Woo"
, title =	"Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis {NC}-Machining"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"171--182"
, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
}

@article{gjmw-egawo-96
, author =	"P. Gupta and R. Janardan and J. Majhi and T. C. Woo"
, title =	"Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-axis {NC} Machining"
, journal =	"Comput. Aided Design"
, volume =	28
, number =	8
, month =	aug
, year =	1996
, pages =	"577--587"
, update =	"96.09 held"
}

@techreport{gjs-atarr-96
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"A technique for adding range restrictions to generalized searching problems"
, type =	"Report"
, number =	"MPI-I-96-1-017"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1996
, update =	"96.09 smid"
}

@article{gjs-atarr-97
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"A technique for adding range restrictions to generalized searching problems"
, journal =	"Inform. Process. Lett."
, volume =	64
, year =	1997
, pages =	"263--269"
, update =	"98.03 smid"
}

@article{gjs-aghrs-96
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Algorithms for generalized halfspace range searching and other intersection searching problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1996
, pages =	"321--340"
, update =	"96.09 devillers+smid, 96.05 smid"
, annote =	"also published (erroneously) in Volume 6 (1996), pp. 1--19"
}

@article{gjs-asisp-99
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Algorithms for some intersection searching problems involving circular objects"
, journal =	"International Journal of Mathematical Algorithms"
, volume =	1
, year =	1999
, pages =	"35--52"
, update =	"99.11 smid"
}

@techreport{gjs-eacrp-96t
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
, type =	"Report"
, number =	"TR 96-03"
, institution =	"Department of Computer Science, King's College"
, address =	"London, UK"
, year =	1996
, update =	"96.09 mitchell, 96.05 smid"
}

@inproceedings{gjs-eacrp-96i
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"8--13"
, update =	"97.03 smid, 96.09 mitchell"
}

@article{gjs-eacrp-99
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	69
, year =	1999
, pages =	"7--13"
, update =	"99.07 smid"
}

@techreport{gjs-eagis-93
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Efficient algorithms for generalized intersection searching on non-iso-oriented objects"
, type =	"Report"
, number =	"MPI-I-93-166"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, update =	"94.01 smid"
}

@inproceedings{gjs-eagis-94
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"369--378"
, cites =	"ahl-sqrpc-90, ak-ccspi-93, ako-iqco-93, cgl-pgd-85, ds-tamol-87, dsst-mdsp-89, e-acg-87, gjs-frgis-93, gjs-ispic-93, gjs-eagis-93, jl-gisp-93, m-cha-91, m-ept-92, m-rsehc-92, m-cgitr-93, oy-nubkm-88, ZZZ"
, update =	"98.03 bibrelex, 94.09 smid, 94.01 jones"
}

@techreport{gjs-facpp-94t
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Fast algorithms for collision and proximity problems involving moving geometric objects"
, type =	"Report"
, number =	"MPI-I-94-113"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"95.01 smid, 94.05 smid"
}

@inproceedings{gjs-facpp-94i
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Fast algorithms for collision and proximity problems involving moving geometric objects"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, nickname =	"ESA '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"278--289"
, precedes =	"gjs-facpp-96"
, update =	"97.03 devillers, 95.01 smid"
}

@article{gjs-facpp-96
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Fast algorithms for collision and proximity problems involving moving geometric objects"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"371--391"
, succeeds =	"gjs-facpp-94i"
, update =	"97.03 devillers+smid"
}

@techreport{gjs-frgis-92
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Further results on generalized intersection searching problems: counting, reporting and dynamization"
, type =	"Report"
, number =	"MPI-I-92-154"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
}

@inproceedings{gjs-frgis-93
, author =	"Prosenjit Gupta and Ravi Janardan and Michiel Smid"
, title =	"Further Results on Generalized Intersection Searching Problems: {Counting}, Reporting, and Dynamization"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"361--372"
, update =	"95.01 smid, 93.09 milone+mitchell+smid, 93.05 jones"
}

@article{gjs-frgis-95
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"Further results on generalized intersection searching problems: counting, reporting and dynamization"
, journal =	"J. Algorithms"
, volume =	19
, year =	1995
, pages =	"282--317"
, update =	"96.01 smid"
}

@techreport{gjs-ispic-93
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"On intersection searching problems involving curved objects"
, type =	"Report"
, number =	"MPI-I-93-124"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, update =	"93.09 smid"
}

@inproceedings{gjs-ispic-94
, author =	"P. Gupta and R. Janardan and M. Smid"
, title =	"On intersection searching problems involving curved objects"
, booktitle =	"Proc. 4th Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	824
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"183--194"
, update =	"94.09 smid"
}

@techreport{gjsd-repdp-94
, author =	"P. Gupta and R. Janardan and M. Smid and B. Dasgupta"
, title =	"The rectangle enclosure and point-dominance problems revisited"
, type =	"Report"
, number =	"MPI-I-94-142"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"94.09 smid"
}

@inproceedings{gjsd-repdp-95
, author =	"Prosenjit Gupta and Ravi Janardan and Michiel Smid and Bhaskar Dasgupta"
, title =	"The Rectangle Enclosure and Point-Dominance Problems Revisited"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"162--171"
, keywords =	""
, cites =	"eo-esrp-82, gjsd-repdp-94, ko-sag-88, lp-iarep-82, lw-firrs-81, m-pst-85, pl-pdavs-88, ps-cgi-85, ekz-diepq-77, e-pofll-77, vw-dsrce-80, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{gjsd-repdp-97
, author =	"Prosenjit Gupta and Ravi Janardan and Michiel Smid and Bhaskar Dasgupta"
, title =	"The Rectangle Enclosure and Point-Dominance Problems Revisited"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"437--455"
, update =	"98.03 smid"
}

@techreport{gs-oappg-96
, author =	"P. Gupta and S. Saluja"
, title =	"Optimal algorithms for some proximity problems on the {Gaussian} sphere with applications"
, type =	"Report"
, number =	"MPI-I-96-1-022"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1996
, update =	"96.09 smid"
}

@inproceedings{gk-gsbif-98
, author =	"S. Gupta and S. Khuller"
, title =	"Greedy strikes back: {I}mproved facility location problems"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1998
, pages =	"649--657"
, update =	"98.07 agarwal"
}

@article{g-smbop-99
, author =	"Satyandra K. Gupta"
, title =	"Sheet metal bending operation planning: {U}sing virtual node generation to improve search efficiency"
, journal =	"J. Manuf. Sys."
, volume =	18
, number =	2
, year =	1999
, pages =	"127--139"
, update =	"02.03 orourke"
}

@article{gbkk-appsmbo-98
, author =	"S. K. Gupta and D. A. Bourne and K. H. Kim and S. S. Krishnan"
, title =	"Automated process planning for sheet metal bending operations"
, journal =	"J. Manufacturing Systems"
, volume =	17
, number =	5
, year =	1998
, pages =	"338--360"
, keywords =	"manufacturing"
, update =	"99.03 orourke, 98.11 orourke"
}

@article{gn-saamm-95
, author =	"Satyandra K. Gupta and Dana S. Nau"
, title =	"Systematic approach to analysing the manufacturability of machined parts"
, journal =	"Comput. Aided Design"
, volume =	27
, number =	5
, year =	1995
, pages =	"323--342"
, keywords =	"design for manufacturability, CAM, CAD, feature-based models"
, update =	"98.03 mitchell"
}

@article{g-meds-75
, author =	"A. B. Gurevich"
, title =	"The 'most economical' displacement of a segment"
, journal =	"Differential Equations"
, volume =	11
, year =	1975
, pages =	"1583--1589"
, update =	"98.03 bibrelex"
}

@phdthesis{g-simat-89
, author =	"H. N. G{\"u}rsoy"
, title =	"Shape Interrogation by Medial Axis Transform for Automated Analysis"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Ocean Engineering, MIT"
, address =	"Cambridge, MA"
, month =	nov
, year =	1989
, keywords =	"doctoral thesis"
, update =	"95.09 korneenko, 93.09 held"
}

@article{gp-aiass-91
, author =	"H. N. G{\"u}rsoy and N. M. Patrialakis"
, title =	"Automated Interrogation and Adaptive Subdivision of Shape Using Medial Axis Transform"
, journal =	"Advances in Engineering Software and Workstations"
, volume =	13
, number =	"5--6"
, month =	sep
, year =	1991
, pages =	"287--302"
, annote =	"Vd of region is used break it up into quads and tris,
		 which are then triangulated."
}

@article{gp-acfsm1-92
, author =	"H. N. G{\"u}rsoy and N. M. Patrikalakis"
, title =	"An Automatic Coarse and Fine Surface Mesh Generation Scheme Based on Medial Axis Transform: Part {I} Algorithm"
, journal =	"Engineering with Computers"
, volume =	8
, year =	1992
, pages =	"121--137"
, update =	"93.09 held"
}

@article{gp-acfsm2-92
, author =	"H. N. G{\"u}rsoy and N. M. Patrikalakis"
, title =	"An Automatic Coarse and Fine Surface Mesh Generation Scheme Based on Medial Axis Transform: Part {II} Implementation"
, journal =	"Engineering with Computers"
, volume =	8
, year =	1992
, pages =	"179--196"
, update =	"93.09 held"
}

@inproceedings{g-bpstp-79
, author =	"D. Gusfield"
, title =	"Bounds for the parametric spanning tree problem"
, booktitle =	"Proc. West Coast Conf. Combinatorics, Graph Theory and Comput."
, year =	1979
, pages =	"173--181"
, update =	"98.03 agarwal, 97.11 bibrelex"
}

@article{g-pccpp-83
, author =	"D. Gusfield"
, title =	"Parametric combinatorial computing and a problem in program module allocation"
, journal =	"J. ACM"
, volume =	30
, year =	1983
, pages =	"551--563"
, update =	"96.05 agarwal"
}

@techreport{g-saco-80
, author =	"D. Gusfield"
, title =	"Sensitivity analysis for combinatorial optimization"
, number =	"UCB/ERLM80/22"
, institution =	"Univ. of California"
, address =	"Berkeley, CA"
, year =	1980
, update =	"96.05 agarwal"
}

@article{gbn-posa-94
, author =	"D. Gusfield and K. Balasubramanian and D. Naor"
, title =	"Parametric optimization of sequence alignment"
, journal =	"Algorithmica"
, volume =	12
, year =	1994
, pages =	"312--326"
, update =	"96.05 agarwal"
}

@article{gi-psmmc-89
, author =	"D. Gusfield and R. Irving"
, title =	"Parametric stable marriage and minimum cuts"
, journal =	"Inform. Process. Lett."
, volume =	30
, year =	1989
, pages =	"255--259"
, update =	"97.11 bibrelex"
}

@techreport{gm-fagpm-89
, author =	"D. Gusfield and C. Martel"
, title =	"A fast algorithm for the generalized parametric minimum cut problem and applications"
, type =	"Technical {Report}"
, number =	"CSE-89-21"
, institution =	"UC Davis"
, year =	1989
, update =	"97.11 bibrelex"
}

@techreport{g-mlsdf-83
, author =	"R. H. G{\"u}ting"
, title =	"A message to the line sweeper: don't forget divide-and-conquer"
, type =	"Report"
, number =	170
, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
, address =	"Dortmund, West Germany"
, year =	1983
}

@techreport{g-audfg-84
, author =	"R. H. G{\"u}ting"
, title =	"Algorithmen und {Datenstrukturen} f{\"u}r geometrische {Probleme}"
, type =	"Report"
, number =	"SS 84-1984"
, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
, address =	"Dortmund, West Germany"
, year =	1984
}

@article{g-isds-94
, author =	"R. H. G{\"u}ting"
, title =	"An introduction to spatial database systems"
, journal =	"VLDB Journal"
, volume =	4
, year =	1994
, pages =	"357--399"
, update =	"97.07 agarwal"
}

@article{g-ocaio-84
, author =	"R. H. G{\"u}ting"
, title =	"An optimal contour algorithm for iso-oriented rectangles"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"303--326"
}

@phdthesis{g-cceac-83
, author =	"R. H. G{\"u}ting"
, title =	"Conquering contours: {Efficient} algorithms for computational geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Abteilung Inform., Dortmund Univ."
, address =	"Dortmund, West Germany"
, year =	1983
, keywords =	"doctoral thesis"
, update =	"96.05 smid"
}

@techreport{g-dcopi-84
, author =	"R. H. G{\"u}ting"
, title =	"Dynamic C-oriented polygonal intersection searching"
, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
, address =	"Dortmund, Germany"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{g-dcopi-84a
, author =	"R. H. G{\"u}ting"
, title =	"Dynamic {C}-oriented polygonal intersection searching"
, journal =	"Inform. Control"
, volume =	63
, year =	1984
, pages =	"143--163"
, update =	"98.07 bibrelex"
}

@article{g-fdiss-85
, author =	"R. H. G{\"u}ting"
, title =	"Fast dynamic intersection searching in a set of isothetic line segments"
, journal =	"Inform. Process. Lett."
, volume =	21
, year =	1985
, pages =	"165--171"
}

@techreport{g-fdlsi-84
, author =	"R. H. G{\"u}ting"
, title =	"Fast dynamic line segment intersection searching"
, type =	"Report"
, number =	87
, institution =	"Forschungsberichte Fachber. Inform., Univ. Dortmund"
, address =	"Dortmund, West Germany"
, year =	1984
, keywords =	"intersection searching, line segment, segment tree, range tree, halfobject technique"
}

@inproceedings{g-gramq-cga-88
, author =	"R. H. G{\"u}ting"
, title =	"Geo-relational algebra: a model and query language for geometric database systems"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"90--96"
, comments =	"extended abstract"
, precedes =	"g-gramq-edbt-88"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@incollection{g-gramq-edbt-88
, author =	"R. H. G{\"u}ting"
, title =	"Geo-relational algebra: a model and query language for geometric database systems"
, booktitle =	"Advances in Database Technology: EDBT '88"
, series =	"Lecture Notes Comput. Sci."
, volume =	303
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"506--527"
, succeeds =	"g-gramq-cga-88"
}

@techreport{g-graiv-86
, author =	"R. H. G{\"u}ting"
, title =	"Geo-relational algebra: an integrated view of geometric and standard data in databases"
, type =	"Report"
, number =	226
, institution =	"Fachber. Inform., Univ. Dortmund"
, address =	"Dortmund, West Germany"
, year =	1986
}

@article{g-odccm-84
, author =	"R. H. G{\"u}ting"
, title =	"Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles"
, journal =	"Acta Inform."
, volume =	21
, year =	1984
, pages =	"271--291"
, update =	"96.05 smid"
}

@article{g-scop-83
, author =	"R. H. G{\"u}ting"
, title =	"Stabbing $c$-oriented polygons"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, pages =	"35--40"
}

@inproceedings{gk-dkdms-81
, author =	"R. H. G{\"u}ting and H. P. Kriegel"
, title =	"Dynamic $k$-dimensional multiway search under time-varying access frequencies"
, booktitle =	"Proc. 5th GI Conf. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	104
, publisher =	"Springer-Verlag"
, year =	1981
, pages =	"135--145"
}

@inproceedings{gk-mbted-80
, author =	"R. H. G{\"u}ting and H. P. Kriegel"
, title =	"Multidimensional {$B$}-tree: {An} efficient dynamic file structure for exact match queries"
, booktitle =	"Proc. 10th GI Conf."
, publisher =	"Springer-Verlag"
, year =	1980
, pages =	"375--388"
}

@article{gno-faded-89
, author =	"R. H. G{\"u}ting and O. Nurmi and T. Ottmann"
, title =	"Fast algorithms for direct enclosures and direct dominances"
, journal =	"J. Algorithms"
, volume =	10
, year =	1989
, pages =	"170--186"
, succeeds =	"gno-ddp-85"
}

@inproceedings{gno-ddp-85
, author =	"R. H. G{\"u}ting and O. Nurmi and T. Ottmann"
, title =	"The direct dominance problem"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"81--88"
, precedes =	"gno-faded-89"
, cites =	"b-skrp-77, em-ioo-81, eo-esrp-82, gw-pt-82, k-ddp-85, klp-fmsv-75, lp-iarep-82, l-tarrc-79, m-eaeii-80, nr-bstbb-73, vw-dsrce-80, w-isbt-79, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{go-nasch-85
, author =	"R. H. G{\"u}ting and T. Ottmann"
, title =	"New Algorithms for Special Cases of the Hidden Line Elimination"
, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
, year =	1985
, update =	"98.03 bibrelex"
}

@techreport{go-nasch-84
, author =	"R. H. G{\"u}ting and T. Ottmann"
, title =	"New algorithms for special cases of the hidden line elimination problem"
, type =	"Report"
, number =	184
, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
, address =	"Dortmund, West Germany"
, year =	1984
, precedes =	"go-nasch-87"
}

@article{go-nasch-87
, author =	"R. H. G{\"u}ting and T. Ottmann"
, title =	"New algorithms for special cases of the hidden line elimination problem"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	40
, year =	1987
, pages =	"188--204"
, succeeds =	"go-nasch-84"
}

@techreport{gs-pdcar-85
, author =	"R. H. G{\"u}ting and W. Schilling"
, title =	"A practical divide-and conquer algorithm for the rectangle intersection problem"
, type =	"Report"
, number =	196
, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
, address =	"Dortmund, West Germany"
, year =	1985
}

@techreport{gw-fridc-82
, author =	"R. H. G{\"u}ting and D. Wood"
, title =	"Finding rectangle intersections by divide-and-conquer"
, type =	"Report"
, number =	"82-CS-04"
, institution =	"Unit Comput. Sci., McMaster Univ."
, address =	"Hamilton, ON"
, year =	1982
, precedes =	"gw-fridc-84"
}

@article{gw-fridc-84
, author =	"R. H. G{\"u}ting and D. Wood"
, title =	"Finding rectangle intersections by divide-and-conquer"
, journal =	"IEEE Trans. Comput."
, volume =	"C-33"
, year =	1984
, pages =	"671--675"
, succeeds =	"gw-fridc-82"
}

@article{gw-pt-82
, author =	"R. H. G{\"u}ting and D. Wood"
, title =	"The parenthesis tree"
, journal =	"Inform. Sci."
, volume =	27
, year =	1982
, pages =	"151--162"
}

@inproceedings{gww-pgc-89
, author =	"W. Gutjahr and Emo Welzl and G. Woeginger"
, title =	"Polynomial graph-colorings"
, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	349
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"108--119"
, update =	"98.03 mitchell, 97.03 gaertner+salinger"
}

@article{gww-pgc-92
, author =	"W. Gutjahr and Emo Welzl and G. Woeginger"
, title =	"Polynomial Graph-Colorings"
, journal =	"Discrete Appl. Math."
, volume =	8
, year =	1992
, pages =	"29--45"
, update =	"98.03 mitchell, 97.03 gaertner+salinger"
}

@article{g-bp-86
, author =	"E. Gutkin"
, title =	"Billards in polygons"
, journal =	"Physica D"
, volume =	19
, year =	1986
, pages =	"311--333"
, update =	"98.03 bibrelex"
}

% jsbm changed the page numbers from "569--592" to "47--57"
% and removed "SIGACT"; please confirm
@inproceedings{g-rtdis-84
, author =	"A. Guttman"
, title =	"R-Trees: {A} Dynamic Index Structure for Spatial Searching"
, booktitle =	"Proc. ACM SIGMOD Conf. Principles Database Systems"
, year =	1984
, pages =	"47--57"
, update =	"98.03 mitchell, 94.05 franciosa"
}

@book{g-ims-72
, author =	"A. G. Guy"
, title =	"Introduction to Materials Science"
, publisher =	"McGraw-Hill"
, year =	1972
, update =	"97.11 bibrelex"
}

@incollection{g-cng-72
, author =	"R. K. Guy"
, title =	"Crossing Numbers of Graphs"
, booktitle =	"Graph Theory and Applications"
, series =	"Lecture Notes Math."
, volume =	303
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1972
, pages =	"111--124"
, keywords =	"graph drawing"
, update =	"96.09 agarwal, 93.09 tamassia"
}

@inproceedings{g-ao2am-89
, author =	"M. K. Guyder"
, title =	"Automating the Optimization of {$2{1\over 2}$}-Axis Milling"
, editor =	"F. Kimura and A. Rolstad{\aa}s"
, booktitle =	"Proc. Computer Applications in Production and Engineering"
, nickname =	"CAPE '89"
, publisher =	"North-Holland"
, month =	oct
, year =	1989
, pages =	"(supplement)"
, keywords =	"survey, pocket machining, milling"
, comments =	"This paper doesn't have page numbers. It was a supplement to the
printed proceeding. (For whatever reasons, it did not get included into
the printed proceedings.)"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@incollection{g-ccgmp-89
, author =	"A. Gy{\'a}rf{\'a}s"
, title =	"Covering complete graphs by monochromatic paths"
, editor =	"G. Hal{\'a}sz and V. T. S{\'o}s"
, booktitle =	"Irregularities of Partitions"
, series =	"Algorithms and Combinatorics"
, volume =	8
, publisher =	"Springer-Verlag"
, address =	"Heidelberg"
, year =	1989
, pages =	"89--91"
, update =	"97.11 bibrelex"
}

@article{g-vcmpc-83
, author =	"A. Gy{\'a}rf{\'a}s"
, title =	"Vertex coverings by monochromatic paths and cycles"
, journal =	"J. Graph Theory"
, volume =	7
, year =	1983
, pages =	"131--135"
, update =	"97.11 bibrelex"
}

@article{gl-ccpri-85
, author =	"A. Gy{\'a}rf{\'a}s and J. Lehel"
, title =	"Covering and coloring problems for relatives of intervals"
, journal =	"Discrete Math."
, volume =	55
, year =	1985
, pages =	"167--180"
, update =	"98.03 bibrelex"
}

@article{gl-ofcg-88
, author =	"A. Gyarfas and J. Lehel"
, title =	"On-line and First-Fit Colorings of Graphs"
, journal =	"J. Graph Theory"
, volume =	12
, number =	2
, year =	1988
, pages =	"217--227"
, update =	"98.07 bibrelex"
}

@article{g-sprag-86
, author =	"E. Gy{\"o}ri"
, title =	"A Short Proof of the Rectilinear Art Gallery Theorem"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	7
, year =	1986
, pages =	"452--454"
, update =	"98.11 bibrelex"
}

@techreport{ghks-ggprp-94t
, author =	"Ervin Gy{\"o}ri and Frank Hoffman and Klaus Kriegel and Thomas Shermer"
, title =	"Generalized Guarding and Partitioning for Rectilinear Polygons"
, type =	"Technical Report"
, number =	"CMPT94-01"
, institution =	"School of Computing Science, Simon Fraser University"
, month =	jan
, year =	1994
, succeeds =	"ghks-ggprp-94, ghks-ggprp-96"
, update =	"98.11 bibrelex"
}

@techreport{ghks-ggprp-93
, author =	"E. Gy{\"o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
, title =	"Generalized Guarding and Partitioning for Rectilinear Polygon"
, type =	"Technical Report"
, number =	"B 93-17"
, institution =	"Frei Universit{\"a}t Berlin, FB Mathematik-Informatik"
, month =	dec
, year =	1993
, update =	"98.11 bibrelex"
}

@inproceedings{ghks-ggprp-94
, author =	"E. Gy{\H o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
, title =	"Generalized Guarding and Partitioning for Rectilinear Polygons"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"302--307"
, precedes =	"ghks-ggprp-96, ghks-ggprp-94t"
, cites =	"a-agpiv-84, c-tsplt-91a, g-sprag-86, ghks-ggprp-93, h-ragp-90, hkk-agtph-91, kkk-tgrfw-83, o-aprag-83, o-agta-87, s-rrag-92, s-cgpul-91, s-cgopl-91, bs-tbgph-91, eow-sgrag-84, ZZZ"
, update =	"98.11 bibrelex, 96.09 devillers, 95.09 agarwal, 94.09 jones"
}

@article{ghks-ggprp-96
, author =	"E. Gy{\H o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
, title =	"Generalized Guarding and Partitioning for Rectilinear Polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"21--44"
, succeeds =	"ghks-ggprp-94"
, update =	"96.09 devillers"
}

@inproceedings{hbb-chnnr-80
, author =	"H. P. A. Haas and E. Backer and I. J. Boxma"
, title =	"Convex hull nearest neighbor rule"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
, year =	1980
, pages =	"87--90"
}

@techreport{hkm-cigno-92
, author =	"M. Habib and D. Kelly and R. H. M{\"o}hring"
, title =	"Comparability invariance of geometric notion of order dimension"
, type =	"Technical {Report}"
, number =	"320/1992"
, institution =	"Technical University of Berlin"
, address =	"Berlin, Germany"
, year =	1992
, update =	"94.05 franciosa"
}

@article{h-ca112-62
, author =	"R. Hacker"
, title =	"Certification of algorithm 112: position of point relative to polygon"
, journal =	"Commun. ACM"
, volume =	5
, year =	1962
, pages =	606
}

@article{h-esfde-68
, author =	"H. Hadwiger"
, title =	"Eine {Schnittrekursion} f{\"u}r die {Eulersche} {Charakteristik} euklidischer {Polyeder} mit {Anwendungen} innerhalb der kombinatorischen {Geometrie}"
, journal =	"Elem. Math."
, volume =	23
, year =	1968
, pages =	"121--132"
, update =	"96.09 devillers"
}

@article{h-ecukg-55
, author =	"H. Hadwiger"
, title =	"Eulers {Charakteristik} und kombinatorische {Geometrie}"
, journal =	"J. Reine Angew. Math."
, volume =	134
, year =	1955
, pages =	"101--110"
}

@article{h-uegt-57
, author =	"H. Hadwiger"
, title =	"{\"U}ber Eibereiche mit gemeinsamer Treffgeraden"
, journal =	"Portugal Math."
, volume =	6
, year =	1957
, pages =	"23--29"
, update =	"98.03 bibrelex"
}

@book{hd-kgde-60
, author =	"H. Hadwiger and H. Debrunner"
, title =	"Kombinatorische Geometrie in der Ebene"
, series =	"Monograph. Enseign. Math."
, volume =	2
, publisher =	"Enseignement Mathematique"
, address =	"Geneva, Switzerland"
, year =	1960
, precedes =	"hdk-cgp-64"
}

@article{hd-uevzh-57
, author =	"H. Hadwiger and H. Debrunner"
, title =	"{\"U}ber eine {Variante} zum {Helly}'schen {Satz}"
, journal =	"Arch. Math."
, volume =	8
, year =	1957
, pages =	"309--313"
, update =	"97.11 bibrelex"
}

@book{hdk-cgp-64
, author =	"H. Hadwiger and H. Debrunner and V. Klee"
, title =	"Combinatorial Geometry in the Plane"
, publisher =	"Holt, Rinehart \& Winston"
, address =	"New York"
, year =	1964
, succeeds =	"hd-kgde-60"
}

@inproceedings{hr-tcpp-93
, author =	"J. Hagauer and G{\"u}nter Rote"
, title =	"Three-clustering of points in the plane"
, editor =	"T. Lengauer"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, nickname =	"ESA '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"192--199"
, precedes =	"hr-tcpp-97"
, update =	"98.03 mitchell, 97.03 rote, 94.01 rote+smid, 93.09 rote"
}

@article{hr-tcpp-97
, author =	"J. Hagauer and G{\"u}nter Rote"
, title =	"Three-clustering of points in the plane"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"87--95"
, update =	"98.07 bibrelex+rote, 98.03 mitchell, 97.03 rote"
, abstract =	"Given $n$ points in the plane, we partition them into
		 three classes such that the maximum distance between
		 two points in the same class is minimized.
		 The algorithm takes $O(n^2 \log^2 n)$ time."
}

@inproceedings{hov-raism-00
, author =	"Michiel Hagedoorn and Mark Overmars and Remco C. Veltkamp"
, title =	"A Robust Affine Invariant Similarity Measure Based on Visibility"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"112--116"
, update =	"00.03 bibrelex"
}

@inproceedings{hv-gmpps-97
, author =	"M. Hagedoorn and R. Veltkamp"
, title =	"A general method for partial point set matching"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"406--408"
, cites =	"hks-uevsi-93, hr-mrtci-92, cghkkk-gpmem-93, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{hv-repma-97
, author =	"Michiel Hagedoorn and Remco C. Veltkamp"
, title =	"Reliable and efficient pattern matching using an affine invariant metric"
, number =	"UU-CS-1997-33"
, institution =	"Utrecht University, Department of Computing Science"
, month =	oct
, year =	1997
, update =	"97.11 oostrum"
}

@inproceedings{h-gmss-88
, author =	"H. Hagen"
, title =	"Geometric modeling of smooth surfaces"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"158--167"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@inproceedings{h-ofa-89
, author =	"H. Hagen"
, title =	"{Offset}-{Fl{\"a}chen}-{Algorithmen}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{h-qa-90
, author =	"Hans Hagen"
, title =	"{Qualit{\"a}tsanalyse}-{Algorithmen}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	10
, update =	"00.03 bibrelex"
}

@inproceedings{h-vsdsi-93
, author =	"Hans Hagen"
, title =	"Variational Surface Design and Surface Interrogation"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"52--55"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@book{hmn-fsv-93
, author =	"H. Hagen and H. M{\"u}ller and G. M. Nielson"
, title =	"Focus on Scientific Visualization"
, publisher =	"Springer-Verlag"
, year =	1993
, update =	"98.03 bibrelex"
}

@inproceedings{h-fdpa-93
, author =	"T. Hagerup"
, title =	"Fast deterministic processor allocation"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"1--10"
, update =	"97.11 bibrelex"
}

@inproceedings{hjw-epcah-90
, author =	"T. Hagerup and H. Jung and Emo Welzl"
, title =	"Efficient parallel computation of arrangements of hyperplanes in $d$ dimensions"
, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"290--297"
, update =	"98.03 mitchell, 97.03 gaertner+salinger"
}

@inproceedings{hr-wmhtb-92
, author =	"T. Hagerup and R. Raman"
, title =	"Waste makes haste: Tight bounds for loose, parallel sorting"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"628--637"
, update =	"97.11 bibrelex"
}

@article{hr-gtcb-90
, author =	"T. Hagerup and C. R{\"u}b"
, title =	"A guided tour of {Chernoff} bounds"
, journal =	"Inform. Process. Lett."
, volume =	33
, year =	1990
, pages =	"305--308"
, update =	"96.09 orourke"
}

@article{hr-omsep-89
, author =	"T. Hagerup and C. R{\"u}b"
, title =	"Optimal Merging and Sorting on the EREW PRAM"
, journal =	"Inform. Process. Lett."
, volume =	33
, year =	1989
, pages =	"181--185"
, update =	"96.09 orourke"
}

@article{h-rarb-88
, author =	"J. K. Hahn"
, title =	"Realistic animation of rigid bodies"
, journal =	"Comput. Graph."
, volume =	22
, number =	4
, year =	1988
, pages =	"299--308"
, update =	"98.07 bibrelex"
}

@article{h-sretn-91
, author =	"M. Haiman"
, title =	"A simple and relatively efficient triangulation of the $n$-cube"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"287--289"
}

@incollection{h-pps-94
, author =	"Eric Haines"
, title =	"Point in Polygon Strategies"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"24--46"
, keywords =	"computational geometry, inclusion testing, ray-polygon intersection testing"
, update =	"94.09 heckbert"
, annote =	"Provides algorithms for testing if a point is inside a
polygon, a task known as point inclusion testing in computational geometry.
Point-in-polygon testing is a basic task when ray tracing polygonal models,
so these methods are useful for 3D as well as 2D graphics. Haines surveys a
number of algorithms for point inclusion testing in both convex and concave
polygons, with empirical speed tests and practical optimizations. Contains C
code."
}

@inproceedings{haa-nrmwt-97
, author =	"Reinhard Hainz and Oswin Aichholzer and Franz Aurenhammer"
, title =	"New Results on Minimum Weight Triangulations and the {LMT}-Skeleton"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"4--6"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@incollection{hkss-decic-87
, author =	"A. Hajnal and P. Komj{\'a}th and L. Soukup and I. Szalkai"
, title =	"Decompositions of edge colored infinite complete graphs"
, booktitle =	"Combinatorics"
, series =	"Colloquia Mathematica Societatis J{\'a}nos Bolyai"
, volume =	52
, year =	1987
, pages =	"277--280"
, update =	"97.11 bibrelex"
}

@article{h-ag-57
, author =	"G. H{\"a}jos"
, title =	"{\"U}ber eine Art von Graphen"
, journal =	"Intern. Math. Nachr."
, volume =	11
, year =	1957
, note =	"Problem 65"
, update =	"98.11 bibrelex"
}

@inproceedings{h-rtkpd-97
, author =	"Wolfgang Haken"
, title =	"Recognizing the Trivial Knot by Planar Diagrams"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"44--45"
, update =	"97.11 jones"
}

@article{h-tdnei-61
, author =	"W. Haken"
, title =	"{Theorie} der {Normalfl{\"a}chen}: {Ein} {Isotopiekriterium} f{\"u}r den {Kreisknoten}"
, journal =	"Acta Math."
, volume =	105
, year =	1961
, pages =	"245--375"
, update =	"97.11 bibrelex"
}

@inproceedings{h-prf-88
, author =	"S. l. Hakimi"
, title =	"A Problem on Rectangular Floorplans"
, booktitle =	"Proc. Int. Sympos. on Circuits and Systems"
, year =	1988
, pages =	"1533--1536"
, update =	"98.11 bibrelex"
}

@article{hls-vpnil-92
, author =	"S. Louis Hakimi and Martine Labb{\'e} and Edward Schmeichel"
, title =	"The {Voronoi} Partition of a Network and Its Implications in Location Theory"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"412--417"
, update =	"98.03 mitchell"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@article{hs-fpfsp-91
, author =	"S. L. Hakimi and E. F. Schmeichel"
, title =	"Fitting polygonal functions to a set of points in the plane"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	53
, number =	2
, year =	1991
, pages =	"132--136"
, update =	"96.09 devillers, 93.09 goodrich"
}

@article{hh-opbtot-00
, author =	"Lorenz Halbelsen and Norbert Hungerb{\"u}hler"
, title =	"On periodic billiard trajectories in obtuse triangles"
, journal =	"SIAM Rev."
, volume =	42
, number =	4
, year =	2000
, pages =	"657--670"
, update =	"01.04 orourke"
}

@incollection{hr-s-83
, author =	"H. Halberstam and K. F. Roth"
, title =	"Sequences"
, booktitle =	"??"
, publisher =	"Springer-Verlag"
, address =	"NY"
, year =	1983
, pages =	90
, update =	"98.11 bibrelex"
}

@inproceedings{h-fata-80
, author =	"W. K. Hale"
, title =	"Frequency Assignment: Theory and Applications"
, booktitle =	"Proc. IEEE"
, volume =	68
, year =	1980
, pages =	"1497--1514"
, update =	"98.07 bibrelex"
}

@book{hs-et-55
, author =	"D. W. Hall and G. Spencer"
, title =	"Elementary Topology"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1955
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{hw-apids-90
, author =	"M. Hall and J. Warren"
, title =	"Adaptive Polygonalization of Implicitly Defined Surfaces"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	10
, number =	6
, year =	1990
, pages =	"33--40"
, annote =	"3D tetrahedronization."
}

@book{h-ct-67
, author =	"M. {Hall, Jr.}"
, title =	"Combinatoial Theory"
, publisher =	"John Wiley \& Sons"
, year =	1967
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@phdthesis{h-ampac-92
, author =	"D. Halperin"
, title =	"Algorithmic Motion Planning via Arrangements of Curves and of Surfaces"
, type =	"Ph.{D}. Thesis"
, school =	"Computer Science Department, Tel-Aviv University"
, address =	"Tel Aviv"
, month =	jul
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex, 95.05 agarwal"
}

@incollection{h-a-97
, author =	"D. Halperin"
, title =	"Arrangements"
, chapter =	21
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"389--412"
, update =	"97.11 orourke"
}

@inproceedings{h-cscca-91
, author =	"D. Halperin"
, title =	"On the complexity of a single cell in certain arrangements of surfaces in $3$-space"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"314--323"
, cites =	"aa-cfi-89, ao-ampps-87, as-tsbac-90, as-cocat-91, a-pdpaa-87, c-crmp-87, cegss-cfals-91, cy-olmpm-89, egs-ccmfa-90, gs-caa-90, gss-gmppt-89, hos-empls-88, hs-icbet-90, klps-ujrcf-86, ks-empac-90, ls-esmpa-87, ps-ueplf-89, p-rmmpc-81, pss-stsps-88, ss-nempa-87, ws-prnds-88, ZZZ"
, update =	"97.11 bibrelex"
}

@article{h-cscca-94
, author =	"D. Halperin"
, title =	"On the complexity of a single cell in certain arrangements of surfaces related to motion planning"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"1--34"
, succeeds =	"h-cscca-91"
, update =	"95.01 matousek"
}

@article{h-rmpsc-94
, author =	"D. Halperin"
, title =	"Robot Motion Planning and the Single Cell Problem in Arrangements"
, journal =	"Journal of Intelligent and Robotic Systems"
, volume =	11
, year =	1994
, pages =	"45--65"
, update =	"98.11 halperin"
}

@incollection{hkl-r-97
, author =	"D. Halperin and L. E. Kavraki and J.-C. Latombe"
, title =	"Robotics"
, chapter =	41
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"755--778"
, update =	"98.07 agarwal, 97.11 orourke"
}

@incollection{hlm-dmks-97
, author =	"D. Halperin and J.-C. Latombe and R. Motwani"
, title =	"Dynamic Maintenance of Kinematic Structures"
, editor =	"J. P. Laumond and M. Overmars"
, booktitle =	"Robotic Motion and Manipulation"
, publisher =	"A. K. Peters"
, pages =	"155--170"
, note =	"WAFR 2"
, update =	"99.11 bibrelex, 98.11 halperin"
}

@unpublished{hlw-gfapm-97
, author =	"D. Halperin and J.-C. Latombe and R. H. Wilson"
, title =	"A general framework for assembly planning: {T}he motion space approach"
, year =	1997
, note =	"unpublished manuscript"
, update =	"98.03 agarwal"
}

@inproceedings{ho-empls-89
, author =	"D. Halperin and M. H. Overmars"
, title =	"Efficient motion planning for an {L}-shaped object"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"156--166"
, precedes =	"hos-empls-92"
, cites =	"abf-pempa-89, as-tsbac-88, ao-ampps-87, c-crmp-87, gss-gmppt-88, ko-lbmlt-87a, ko-cst-88, ks-eapcf-85, ks-empac-90, ls-esmpa-87, lw-apcfp-79, m-mdscg-84, oy-rmpmd-85, o-gdscg-88, ss-nempa-87, ss-pmp1c-83, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{ho-smhsr-94
, author =	"D. Halperin and M. H. Overmars"
, title =	"Spheres, Molecules, and Hidden Surface Removal"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"113--122"
, cites =	"abbkw-pdb-87, bkwmbrkst-pdbcb-77, cegs-sessr-91, cegsw-ccbac-90, c-saspn-83, b-rsdoh-93, dkmmrt-dphul-88, fp-eagcs-93, fo-fdmm-, gs-pmgsc-85, s-hb-70, kos-ehsro-92, klps-ujrcf-86, lr-ipses-71, mmpssw-ftdlm-91, m-ms-90, o-plfs-92, ps-cgi-85, s-atubl-93, sho-cfsrm-93, vb-facrs-93, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@techreport{hos-empls-88
, author =	"D. Halperin and M. H. Overmars and Micha Sharir"
, title =	"Efficient motion planning for an {L}-shaped object"
, type =	"Technical {Report}"
, number =	418
, institution =	"Courant Institute of Mathematical Science"
, year =	1988
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{hos-empls-92
, author =	"D. Halperin and M. H. Overmars and Micha Sharir"
, title =	"Efficient motion planning for an {L}-shaped object"
, journal =	"SIAM J. Comput."
, volume =	21
, year =	1992
, pages =	"1--23"
, succeeds =	"ho-empls-89"
, update =	"98.03 mitchell"
}

@article{hs-nqapm-96
, author =	"D. Halperin and Micha Sharir"
, title =	"A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"121--134"
, succeeds =	"hs-nqbmp-93t"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 smid"
}

@inproceedings{hs-atubs-94
, author =	"D. Halperin and Micha Sharir"
, title =	"Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"11--20"
, precedes =	"hs-atubs-95"
, cites =	"ass-sulbl-89, ams-sscch-91, aps-zsha-93, as-tsbac-90, as-car-92, as-tmp3s-94, bcr-gar-87, cegss-cfals-93, cs-arscg-89, bgh-vdt3s-94, e-acg-87, egppss-acptc-92, ess-ztha-93, gss-gmppt-89, h-ampac-92, hs-nblet-93, hs-nqbmp-93, hs-ndssg-86, h-ag-77, h-dt-76, m-mnfcp-70, ps-ueplf-89, pr-ncdsp-93, ss-tddsp-90, s-ksacs-91, s-atubl-93, ZZZ"
, update =	"98.03 bibrelex+mitchell, 97.11 aronov, 94.09 jones, 94.01 jones"
}

% also claimed, pages =	"313--326"
@article{hs-atubs-95
, author =	"D. Halperin and Micha Sharir"
, title =	"Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"385--410"
, succeeds =	"hs-atubs-94"
, update =	"98.03 mitchell, 97.11 aronov+bibrelex"
}

@incollection{hs-atarr-95
, author =	"D. Halperin and Micha Sharir"
, title =	"Arrangements and their applications in robotics: Recent developments"
, editor =	"K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
, booktitle =	"Algorithmic Foundations of Robotics"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1995
, pages =	"495--511"
, update =	"99.11 bibrelex, 98.07 agarwal, 98.03 agarwal+mitchell, 95.09 agarwal, 95.05 agarwal"
}

@article{hs-cdcca-94
, author =	"D. Halperin and Micha Sharir"
, title =	"Corrigendum: On disjoint concave chains in arrangements of (pseudo) lines"
, journal =	"Inform. Process. Lett."
, volume =	51
, year =	1994
, pages =	"53--56"
, keywords =	"polygonal chains, tight bounds, combinatorial complexity, line arrangements"
, succeeds =	"hs-dccap-91"
, update =	"98.11 aronov, 98.03 mitchell, 97.07 aronov"
}

@techreport{hs-icbet-90t
, author =	"D. Halperin and M. Sharir"
, title =	"Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
, type =	"Technical {Report}"
, number =	"176/90"
, institution =	"Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
, address =	"Tel-Aviv, Israel"
, year =	1990
, update =	"98.07 bibrelex"
}

@inproceedings{hs-icbet-90
, author =	"D. Halperin and M. Sharir"
, title =	"Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"98--101"
, precedes =	"hs-icbet-92"
, cites =	"ao-ampps-87, as-tsbac-90, cegsw-ccbac-90, hos-empls-88, hs-icbet-90t, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@article{hs-icbet-92
, author =	"D. Halperin and Micha Sharir"
, title =	"Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	5
, year =	1992
, pages =	"269--303"
, keywords =	"robotics, motion planning, arrangements, configuration space"
, succeeds =	"hs-icbet-90"
, update =	"98.03 mitchell"
}

@techreport{hs-nqbmp-93t
, author =	"D. Halperin and Micha Sharir"
, title =	"Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment"
, type =	"manuscript"
, year =	1993
, precedes =	"hs-nqbmp-93, hs-nqapm-96"
, update =	"98.11 bibrelex"
}

@inproceedings{hs-nqbmp-93
, author =	"D. Halperin and Micha Sharir"
, title =	"Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"382--391"
, succeeds =	"hs-nqbmp-93t"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 96.09 orourke, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{hs-nblet-93
, author =	"D. Halperin and Micha Sharir"
, title =	"New bounds for lower envelopes in three dimensions, with applications to visibility in terrains"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"11--18"
, cites =	"ass-sulbl-89, bhok-sanvp-92, cegs-sessr-89, cegs-lscaa-89, cegsw-ccbac-90, cs-arscg-89, cs-vppt-89, h-ampac-92, hs-nqbmp-93, hs-ndssg-86, ps-ueplf-89, p-lmps3-93, ss-tddsp-90, s-ksacs-91, s-atubl-93, sa-dsstg-95, ZZZ"
, update =	"98.03 bibrelex+mitchell, 93.09 devillers"
}

%, number =      3
@article{hs-nblet-94
, author =	"D. Halperin and Micha Sharir"
, title =	"New bounds for lower envelopes in three dimensions, with applications to visibility in terrains"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"313--326"
, succeeds =	"hs-nblet-93"
, update =	"98.03 mitchell, 95.01 orourke+smid"
}

@article{hs-dccap-91
, author =	"D. Halperin and Micha Sharir"
, title =	"On disjoint concave chains in arrangements of (pseudo) lines"
, journal =	"Inform. Process. Lett."
, volume =	40
, number =	4
, year =	1991
, pages =	"189--192"
, keywords =	"polygonal chains, tight bounds, combinatorial complexity, line arrangements"
, precedes =	"hs-cdcca-94"
, update =	"98.03 mitchell, 97.07 aronov"
}

@unpublished{hs-cscas
, author =	"D. Halperin and M. Sharir"
, title =	"On the complexity of a single cell in an arrangement of surfaces in 3 dimensions"
, note =	"in preparation"
, update =	"98.11 bibrelex"
}

@inproceedings{hsg-tcpo-00
, author =	"Dan Halperin and Micha Sharir and Ken Goldberg"
, title =	"The 2-Center problem with obstacles"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"80--90"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{hs-pssaa-97
, author =	"D. Halperin and C. Shelton"
, title =	"A perturbation scheme for spherical arrangements with application to molecular modeling"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"183--192"
, cites =	"bmb-pmmca-94, c-amsc-83, c-msr-96, e-acg-87, em-sstcd-90, fhklmsv-gmfl-96, fklmsvy-rrpid-97, f-riga-96i, fv-sayee-96, g-imap-95, gy-frcg-86, gs-pmgsc-85, ho-smhsr-94, h-gsm-89, h-pargc-89, m-ms-90, m-vigau-88a, ps-cgi-85, sos-frcms-95, s-rafpg-96, s-fprgo-89, si-tdpga-89, vbw-csms-94, yd-ecp-95, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{hs-pssaa-98
, author =	"Dan Halperin and Christian R. Shelton"
, title =	"A perturbation scheme for spherical arrangements with application to molecular modeling"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"273--287"
, succeeds =	"hs-pssaa-97"
, update =	"98.11 devillers"
}

@inproceedings{hw-apasp-95
, author =	"D. Halperin and R. H. Wilson"
, title =	"Assembly partitioning along simple paths: the case of multiple translations"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1995
, pages =	"1585--1592"
, keywords =	"robotics, assembly planning, separability, arrangements"
, update =	"95.09 halperin"
}

@article{hw-apasp-97
, author =	"D. Halperin and R. H. Wilson"
, title =	"Assembly Partitioning along Simple Paths: the Case of Multiple Translations"
, journal =	"Advanced Robotics"
, volume =	11
, year =	1997
, pages =	"127--145"
, update =	"98.11 halperin"
}

@inproceedings{hy-cctbp-93
, author =	"D. Halperin and C.-K. Yap"
, title =	"Combinatorial complexity of translating a box in polyhedral $3$-space"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"29--37"
, cites =	"as-car-92, ck-hcmpc-90, gss-gmppt-89, h-ampac-92, hs-ndssg-86, ko-amltd-87, klps-ujrcf-86, ks-empac-90, l-rmp-91, ls-ncfcc-87, ls-pptmc-87, s-eappt-87, s-ampr-89, y-amp-87, ZZZ"
, update =	"98.03 bibrelex, 93.09 devillers"
}

@article{hy-cctbp-98
, author =	"D. Halperin and C.-K. Yap"
, title =	"Combinatorial complexity of translating a box in polyhedral $3$-space"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, year =	1998
, pages =	"181--196"
, update =	"98.03 smid"
}

@inproceedings{hz-orltc-94
, author =	"S. Halperin and U. Zwick"
, title =	"An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM"
, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
, year =	1994
, pages =	"1--10"
, update =	"96.09 orourke"
}

@article{h-ecqsp-60
, author =	"J. H. Halton"
, title =	"On the efficiency of certain quasirandom sequences of points in evaluating multidimensional integrals"
, journal =	"Numer. Math."
, volume =	2
, year =	1960
, pages =	"84--90"
, update =	"98.03 bibrelex"
}

@article{ht-faets-82
, author =	"J. H. Halton and R. Terada"
, title =	"A fast algorithm for the {Euclidean} traveling salesman problem, optimal with probability one"
, journal =	"SIAM J. Comput."
, volume =	11
, year =	1982
, pages =	"28--46"
}

@techreport{ht-asoae-78
, author =	"J. H. Halton and R. Terada"
, title =	"An almost surely optimal algorithm for the {Euclidean} traveling salesman problem"
, type =	"Report"
, number =	335
, institution =	"Dept. Comput. Sci., Univ. Wisconsin"
, address =	"Madison, WI"
, year =	1978
}

@inproceedings{h-gmla-97
, author =	"Horst W. Hamacher"
, title =	"Geometric Methods in Location Analysis"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	16
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@book{h-mlps-95
, author =	"Horst W. Hamacher"
, title =	"{Mathematische} {L{\"o}sungsverfahren} f{\"u}r planare {Standortprobleme}"
, publisher =	"Verlag Vieweg"
, address =	"Wiesbaden"
, year =	1995
, update =	"97.03 icking"
}

@article{h-drsts-94
, author =	"B. Hamann"
, title =	"A Data Reduction Scheme for Triangulated Surfaces"
, journal =	"Comput. Aided Geom. Design"
, volume =	11
, year =	1994
, pages =	"197--214"
, update =	"95.01 mitchell"
}

@inproceedings{hd-dmkwc-92
, author =	"S. Hambrusch and F. Dehne"
, title =	"Determining maximum $k$-width connectivity on meshes"
, booktitle =	"Proc. IEEE Internat. Parallel Process. Sympos."
, year =	1992
, pages =	""
, update =	"94.01 dehne"
}

@article{hd-dmkwc-94
, author =	"S. Hambrusch and F. Dehne"
, title =	"Determining maximum $k$-width-connectivity on meshes"
, journal =	"Comput. Geom. Theory Appl."
, volume =	"??"
, year =	1993
, pages =	"91--105"
, update =	"96.09 devillers, 94.01 dehne"
}

@article{ht-f1dcf-92
, author =	"S. Hambrusch and H.-Y. Tu"
, title =	"A framework for 1-{D} compaction with forbidden region avoidance"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	4
, year =	1992
, pages =	"203--226"
, keywords =	"analysis of algorithms, compaction, forbidden regions, visibility graphs, VLSI layouts"
}

@inproceedings{ht-namlw-93
, author =	"Susanne E. Hambrusch and Hung-Yi Tony Tu"
, title =	"New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"446--455"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@book{h-eq-69
, author =	"W. R. Hamilton"
, title =	"Elements of Quaternions"
, publisher =	"Chelsea Publishing Cl."
, address =	"N. Y."
, year =	1969
, update =	"98.11 bibrelex"
}

@article{hg-rshsa-77
, author =	"G. Hamlin and C. W. Gear"
, title =	"Raster-scan hidden surface algorithm techniques"
, journal =	"Comput. Graph."
, volume =	11
, number =	2
, year =	1977
, pages =	"206--213"
, note =	"Proc. SIGGRAPH '77"
}

@inproceedings{hn-ctbes-97
, author =	"M. Hammar and Bengt J. Nilsson"
, title =	"Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms"
, booktitle =	"Proc. 11th International Symposium on Fundamentals of Computation Theory"
, nickname =	"FCT '97"
, site =	"Krakow, Poland"
, series =	"Lecture Notes Comput. Sci."
, volume =	1279
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"210--221"
, comments =	"LU-CS-TR:97-186, LUNDFD6/(NFCS-3119)/1-18/1997"
, update =	"02.03 icking, 00.11 smid, 00.07 icking, 99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
, annote =	"
An error was discovered in the earlier papers on watchman routes: It
turns out that the ``adjustment'' algorithm that modifies a route in
order to achieve the reflection property at essential cuts may in fact
take an exponential number of iterations.  However, the new adjustment
algorithm given here reestablishes the previous claims."
}

@inproceedings{hns-psmr-99
, author =	"Mikael Hammar and Bengt J. Nilsson and Sven Schuierer"
, title =	"Parallel Searching on $m$ Rays"
, booktitle =	"Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
, nickname =	"STACS '99"
, site =	"Trier"
, series =	"Lecture Notes Comput. Sci."
, volume =	1563
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"132--142"
, succeeds =	"ikl-ocsws-98"
, update =	"99.07 bibrelex"
}

@article{hns-psmr-01
, author =	"M. Hammar and B. J. Nilsson and S. Schuierer"
, title =	"Parallel Searching on $m$ Rays"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"125--139"
, update =	"01.07 smid"
}

@article{h-etdf-63
, author =	"P. C. Hammer"
, title =	"Extended Topology: Domain Finiteness"
, journal =	"Indagationes Mathematicae"
, volume =	25
, year =	1963
, pages =	"200--212"
, update =	"98.07 bibrelex"
}

@inproceedings{h-p2-63
, author =	"P. C. Hammer"
, title =	"Problem 2"
, booktitle =	"Proc. Sympos. Pure Math. vol VII"
, organization =	"Amer. Math. Soc."
, year =	1963
, pages =	"498--499"
, update =	"98.11 bibrelex"
}

@book{hhkr-ctvc-95
, author =	"R. Hammer and M. Hocks and U. Kulisch and D. Ratz"
, title =	"C++ Toolbox for Verified Computing"
, publisher =	"Springer"
, year =	1995
, update =	"00.03 devillers"
}

@techreport{hs-sugpm-90
, author =	"S. Hammond and R. Schreiber"
, title =	"Solving unstructured grid problems on massively parallel computers"
, type =	"Technical {Report}"
, number =	"90.22"
, institution =	"Research Institute for Advanced Computer Science"
, year =	1990
, update =	"98.03 bibrelex"
}

@book{hrrs-rsabi-86
, author =	"F. R. Hampel and E. M. Ronchetti and P. J. Rousseeuw and W. A. Stahel"
, title =	"Robust Statistics: The Approach Based on Influence Functions"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1986
, update =	"98.11 bibrelex"
}

@inproceedings{hm-iorac-96
, author =	"Kyung-Ah Han and Sung-Hyun Myaeng"
, title =	"Image Organization and Retrieval with Automatically Constructed Feature Vectors"
, editor =	"Hans-Peter Frei and Donna Harman and Peter Sch{\"a}uble and Ross Wilkinson"
, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
, publisher =	"ACM Press"
, address =	"New York"
, month =	aug
, year =	1996
, pages =	"157--165"
, update =	"98.07 agarwal"
}

@book{hk-mic-94
, author =	"T. Han and K. Kobayashi"
, title =	"Mathematical Information and Code"
, publisher =	"Iwanami Publisher"
, address =	"Japan"
, year =	1994
, note =	"In Japanese"
, update =	"98.07 bibrelex"
}

@article{h-sprd-66
, author =	"M. Hanan"
, title =	"On {Steiner's} problem with rectilinear distance"
, journal =	"SIAM J. Appl. Math."
, volume =	14
, year =	1966
, pages =	"255--265"
, update =	"97.11 bibrelex"
}

@book{h-ei-17
, author =	"H. Hancock"
, title =	"Elliptic Integrals"
, publisher =	"Dover Publications"
, address =	"New York, NY"
, year =	1917
, update =	"98.03 bibrelex"
}

@inproceedings{h-ldtud-93
, author =	"Thomas R. Hancock"
, title =	"Learning Decision Trees on the Uniform Distribution"
, booktitle =	"Proc. 6th ACM Conf. Comput. Learning Theory"
, nickname =	"COLT '93"
, month =	jul
, year =	1993
, pages =	"??"
, update =	"98.07 bibrelex, 93.09 milone+mitchell"
}

@book{hm-lnta-79
, author =	"G. Y. Handler and P. B. Mirchandani"
, title =	"Location of networks: {Theory} and algorithms"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1979
, update =	"98.03 bibrelex"
}

@article{h-epcha-85
, author =	"C. C. Handley"
, title =	"Efficient planar convex hull algorithm"
, journal =	"Image Vision Comput."
, volume =	3
, year =	1985
, pages =	"29--35"
}

@inproceedings{hos-efdt-96
, author =	"Sabine Hanke and Thomas Ottmann and Sven Schuierer"
, title =	"The Edge-Flipping Distance of Triangulations"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"15--18"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{h-hgc-84
, author =	"P. Hanrahan"
, title =	"A homogeneous geometry calculator"
, type =	"Technical {Memo}"
, number =	"3{D}-7"
, institution =	"Comput. Graph. Lab., New York Inst. Tech."
, address =	"New York, NY"
, year =	1984
}

@incollection{h-srsia-89
, author =	"P. Hanrahan"
, title =	"A survey of ray-surface intersection algorithms"
, editor =	"A. Glassner"
, booktitle =	"An introduction to ray tracing"
, publisher =	"Academic Press"
, year =	1989
, update =	"98.11 bibrelex"
}

@article{h-cvmev-82
, author =	"P. Hanrahan"
, title =	"Creating volume models from edge-vertex graphs"
, journal =	"Comput. Graph."
, volume =	16
, number =	3
, year =	1982
, pages =	"77--84"
, note =	"Proc. SIGGRAPH '82"
, update =	"98.07 bibrelex"
}

@phdthesis{h-tsm-85
, author =	"P. Hanrahan"
, title =	"Topological Shape Models"
, school =	"University of Wisconsin"
, address =	"Madison, WI"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@article{hsa-rhra-91
, author =	"P. Hanrahan and D. Salzman and L. Aupperle"
, title =	"A rapid hierarchical radiosity algorithm"
, journal =	"Comput. Graph."
, volume =	25
, number =	4
, year =	1991
, pages =	"197--206"
, note =	"Proc. SIGGRAPH '91"
, update =	"98.03 bibrelex"
}

@article{ha-agntp-92
, author =	"A. Hansen and F. Arbab"
, title =	"An Algorithm for Generating {NC} Tool Paths for Arbitrarily Shaped Pockets with Islands"
, journal =	"ACM Trans. Graph."
, volume =	11
, number =	2
, month =	apr
, year =	1992
, pages =	"152--182"
, update =	"93.09 held"
}

@phdthesis{h-tppga-89
, author =	"A. B. Hansen"
, title =	"Tool Positioning and Path Generation Algorithms for Computer-Aided Manufacturing"
, school =	"CS Dept., U. of Southern California, Los Angeles, CA 90089, USA"
, year =	1989
, keywords =	"doctoral thesis"
, update =	"93.09 held"
}

@techreport{ha-agntp-89
, author =	"A. B. Hansen and F. Arbab"
, title =	"An Algorithm for Generating {NC} Tool Paths for Arbitrarily Shaped Pockets with Islands"
, number =	"CS 88-51"
, institution =	"CS Dept., U. of Southern California, Los Angeles, CA 90089, USA"
, year =	1989
, update =	"93.09 held"
}

@article{hl-cdmg-92
, author =	"A. J. Hansen and P. L. Levin"
, title =	"On Conforming {Delaunay} Mesh Generation"
, journal =	"Adv. Eng. Softw."
, volume =	14
, number =	2
, year =	1992
, pages =	"129--135"
, update =	"94.09 lambert, 93.09 held"
}

@inproceedings{h-aagep-89
, author =	"M. D. Hansen"
, title =	"Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"604--609"
}

@incollection{h-bpp-80
, author =	"P. Hansen"
, title =	"Bicriteria Path Problems"
, booktitle =	"Multiple Criteria Decision Making: Theory and Applications"
, series =	"Lecture Notes in Economics and Mathematical Systems"
, volume =	177
, publisher =	"Springer"
, address =	"Heidelberg"
, year =	1980
, pages =	"109--127"
, update =	"98.07 bibrelex"
}

@techreport{hj-mssc-88
, author =	"P. Hansen and B. Jaumard"
, title =	"Maximum sum of splits clustering"
, type =	"Technical {Report}"
, institution =	"RUTCOR, Ruters University"
, address =	"New Brunswick, New Jersey"
, month =	mar
, year =	1988
, update =	"93.09 milone+mitchell"
}

@article{hpt-sltcw-81
, author =	"P. Hansen and D. Peeters and J. F. Thisse"
, title =	"Some Localization Theorems for a Constrained {Weber} Problem"
, journal =	"Journal of Regional Science"
, volume =	21
, year =	1981
, pages =	"103--115"
, update =	"93.09 milone+mitchell"
}

@article{h-ncmmt-90
, author =	"Dianne Hansford"
, title =	"The Neutral Case for the Min-Max Triangulation"
, journal =	"Comput. Aided Geom. Design"
, volume =	7
, year =	1990
, pages =	"431--438"
, annote =	"Constructs contour for the minimize maximum angle
		 criterion."
}

@incollection{h-gndg-94
, author =	"Andrew J. Hanson"
, title =	"Geometry for {N}-Dimensional Graphics"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"149--170"
, keywords =	"geometry, hyperplane, determinant, Levi-Civita, volume"
, update =	"94.09 heckbert"
, annote =	"A tutorial on n-dimensional geometry. Hanson generalizes a
number of familiar concepts, such as plane equations, clipping, volume, and
rotation, to n-D."
}

@inproceedings{h-islds-91
, author =	"E. N. Hanson"
, title =	"The interval skip list: a data structure for finding all intervals that overlap a point"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"153--164"
, keywords =	"data structuring"
}

@article{h-osadc-98
, author =	"Sariel Har-Peled"
, title =	"An output sensitive algorithm for discrete convex hulls"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"125--138"
, update =	"98.11 devillers"
}

@article{h-aspgd-??a
, author =	"S. Har-Peled"
, title =	"Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	"??"
, number =	"??"
, year =	"??"
, pages =	"to appear"
, succeeds =	"h-aspgd-97i"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{h-aspgd-97i
, author =	"S. Har-Peled"
, title =	"Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"359--365"
, precedes =	"h-aspgd-??a"
, cites =	"aaos-supa-97, ahsv-aspcp-96, ch-spp-96, c-aaspm-87, cr-nlbtr-87, csy-aesp3-94, dk-ladsc-85, dk-dsppu-90, h-caspm-97, hs-pmasp-95, mmp-dgp-87, p-aspmt-85, p-egcs-73, rs-seubf-94, s-spacp-87, ss-spps-86, va-aspp-96, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.06 efrat"
}

@inproceedings{h-caspm-98
, author =	"Sariel Har-Peled"
, title =	"Constructing approximate shortest path maps in three dimensions"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"383--391"
, keywords =	"shortest paths, approximation algorithms, polyhedral obstacles"
, update =	"99.11 smid, 98.03 mitchell"
}

@article{h-caspm-99
, author =	"S. Har-Peled"
, title =	"Constructing approximate shortest path maps in three dimensions"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1999
, pages =	"1182--1197"
, succeeds =	"h-caspm-98"
, update =	"99.11 smid"
}

@techreport{h-caspm-97
, author =	"S. Har-Peled"
, title =	"Constructing approximate shortest paths maps in three dimensions"
, type =	"Manuscript"
, institution =	"??"
, year =	1997
, update =	"98.07 bibrelex"
}

@inproceedings{h-cctp-98
, author =	"S. Har-Peled"
, title =	"Constructing cuttings in theory and practice"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"327--334"
, keywords =	"cuttings"
, update =	"98.11 pocchiola, 98.03 agarwal"
}

@article{h-cpctp-00
, author =	"S. Har-Peled"
, title =	"Constructing planar cuttings in theory and practice"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"2016--2039"
, update =	"01.04 smid"
}

@inproceedings{h-twpa-99
, author =	"S. Har-Peled"
, title =	"Taking a walk in a planar arrangement"
, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS 99"
, year =	1999
, pages =	"100--110"
, update =	"01.11 pocchiola"
}

@article{h-twpa-00
, author =	"S. Har-Peled"
, title =	"Taking a walk in a planar arrangement"
, journal =	"SIAM J. Comput."
, volume =	30
, year =	2000
, pages =	"1341--1367"
, update =	"02.03 pocchiola"
}

@mastersthesis{h-cmco-95
, author =	"S. Har-Peled"
, title =	"The Complexity of Many Cells in the Overlay of Many Arrangements"
, type =	"{M.S.} Thesis"
, school =	"Dept. Computer Science, Tel Aviv University"
, address =	"Tel Aviv, Israel"
, year =	1995
, keywords =	"master thesis"
, update =	"95.09 agarwal"
}

@inproceedings{hcahs-csfms-95
, author =	"Sariel Har-Peled and Timothy M. Chan and Boris Aronov and Dan Halperin and Jack Snoeyink"
, title =	"The Complexity of a Single Face of a {Minkowski} Sum"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"91--96"
, update =	"95.09 agarwal+jones"
}

@inproceedings{hi-wccam-00
, author =	"S. Har-Peled and P. Indyk"
, title =	"When crossings count: Approximating the minimum spanning tree"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, note =	"166--175"
, update =	"00.11 smid, 00.07 agarwal"
}

@article{hs-oplpa-01
, author =	"S. Har-Peled and M. Sharir"
, title =	"Online Point Location in Planar Arrangements and Its Applications"
, journal =	"Discrete Comput. Geom."
, volume =	26
, year =	2001
, pages =	"19--40"
, update =	"02.03 pocchiola"
}

@inproceedings{hsv-aspcp-96
, author =	"Sariel Har-Peled and Micha Sharir and Kasturi R. Varadarajan"
, title =	"Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"329--338"
, cites =	"a-lbvsc-63, b-acspp-85, bs-spbtc-88, bv-nclp-92, cr-nlbtr-87, ch-spp-90, c-aaspm-87, dk-ladsc-85, e-acg-87, hs-pmasp-95, mmp-dgp-87, p-aspmt-85, p-egcs-73, ps-cgi-85, rs-seubf-94, s-spacp-87, ss-spps-86, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@techreport{hkrw-ihdrt-81
, author =	"Y. Hara and A. Keller and P. Rathmann and G. Wiederhold"
, title =	"Implementing Hypertext Database Relationships through Aggregations and Exceptions"
, type =	"Technical Report"
, number =	"STAN-CS-91-1381"
, institution =	"Stanford University"
, year =	1981
, keywords =	"graph drawing"
, update =	"96.09 tamassia, 96.04 garg"
}

@inproceedings{hs-dpsc-77
, author =	"R. M. Haralick and L. G. Shapiro"
, title =	"Decomposition of polygonal shapes by clustering"
, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
, year =	1977
, pages =	"183--190"
}

@book{h-gt-69
, author =	"F. Harary"
, title =	"Graph Theory"
, publisher =	"Addison-Wesley"
, address =	"Reading, Mass."
, year =	1969
, keywords =	"graph drawing"
, precedes =	"h-gt-72"
, update =	"97.11 bibrelex, 93.09 tamassia"
}

@book{h-gt-72
, author =	"F. Harary"
, title =	"Graph Theory"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1972
, succeeds =	"h-gt-69"
, update =	"97.11 bibrelex"
}

@article{ht-ogpm-66
, author =	"F. Haray and W. T. Tutte"
, title =	"On the Order of the Group of a Planar Map"
, journal =	"J. Combin.Theory"
, volume =	1
, year =	1966
, pages =	"394--395"
, update =	"97.11 bibrelex"
}

@article{h-kfiep-78
, author =	"H. Harborth"
, title =	"Konvexe {F{\"u}nfecke} in ebenen {Punktmengen}"
, journal =	"Elem. Math."
, volume =	33
, year =	1979
, pages =	"116--118"
, cites =	"ar-clecs-85"
, update =	"97.11 bibrelex"
}

@article{h-sp664-74
, author =	"H. Harborth"
, title =	"Solution to problem 664{A}"
, journal =	"Elemente der Mathematik"
, volume =	29
, year =	1974
, pages =	"14--15"
, keywords =	"combinatorial geometry, proximity"
}

@article{hm-ewcdc-74
, author =	"H. Harborth and I. Mengersen"
, title =	"Edges Without Crossings in Drawings of Complete Graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	17
, number =	3
, year =	1974
, pages =	"229--311"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{hs-nacod-93
, author =	"R. H. Hardin and N. J. A. Sloane"
, title =	"A new approach to the construction of optimal designs"
, journal =	"J. Statistical Planning and Inference"
, volume =	37
, year =	1993
, pages =	"339--369"
, note =	"Also DIMACS Technical Report 93-47, August 1993."
, update =	"97.07 orourke"
}

@book{hlp-i-52
, author =	"G. Hardy and J. E. Littlewood and G. P{\'o}lya"
, title =	"Inequalities"
, edition =	"2nd"
, publisher =	"Cambridge University Press"
, year =	1952
, precedes =	"hlp-i-64"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@book{hlp-i-64
, author =	"G. Hardy and J. E. Littlewood and G. P{\'o}lya"
, title =	"Inequalities"
, edition =	"1st"
, publisher =	"Cambridge University Press"
, year =	1967
, succeeds =	"hlp-i-52"
, update =	"98.11 bibrelex"
}

@book{hw-tn-65
, author =	"G. Hardy and E. Wright"
, title =	"The Theory of Numbers"
, edition =	"4th"
, publisher =	"Oxford University Press"
, address =	"London, England"
, year =	1965
}

@book{hw-itn-68
, author =	"G. H. Hardy and E. M. Wright"
, title =	"An Introduction to the Theory of Numbers"
, publisher =	"Oxford University Press"
, address =	"New York"
, year =	1968
, precedes =	"hw-itn-79"
, update =	"98.07 bibrelex"
}

@book{hw-itn-79
, author =	"G. H. Hardy and E. M. Wright"
, title =	"An Introduction to the Theory of Numbers"
, publisher =	"Oxford Science Publications"
, year =	1979
, succeeds =	"hw-itn-68"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@article{hk-crp-71
, author =	"W. R. Hare and J. W. Kenelly"
, title =	"Characterizations of Radon partitions"
, journal =	"Pacific J. Math."
, volume =	36
, year =	1971
, pages =	"159--164"
, update =	"98.03 bibrelex"
}

@inproceedings{h-ltalc-80
, author =	"D. Harel"
, title =	"A linear time algorithm for the lowest common ancestors problem"
, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1980
, pages =	"308--319"
, precedes =	"ht-fafnc-84"
}

@article{h-etiah-86
, author =	"D. Harel"
, title =	"Effective transformations on infinite, with applications to high undecidability, dominoes and fairness"
, journal =	"J. ACM"
, volume =	33
, year =	1986
, pages =	"224--248"
, update =	"97.11 bibrelex"
}

@article{h-vf-88
, author =	"D. Harel"
, title =	"On Visual Formalisms"
, journal =	"Commun. ACM"
, volume =	31
, number =	5
, year =	1988
, pages =	"514--530"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{hs-rgdhd-95
, author =	"D. Harel and M. Sardas"
, title =	"Randomized Graph Drawing with Heavy-Duty Preprocessing"
, journal =	"J. Visual Lang. Comput."
, volume =	6
, number =	3
, year =	1995
, pages =	"233--253"
, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
, keywords =	"graph drawing, physical simulation, planarization"
, update =	"98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
}

@article{ht-fafnc-84
, author =	"D. Harel and R. E. Tarjan"
, title =	"Fast algorithms for finding nearest common ancestors"
, journal =	"SIAM J. Comput."
, volume =	13
, number =	2
, year =	1984
, pages =	"338--355"
, succeeds =	"h-ltalc-80"
, update =	"98.11 bibrelex"
}

@inproceedings{hru-idce-96
, author =	"V. Harinarayan and A. Rajaraman and J. D. Ullman"
, title =	"Implementing data cubes efficiently"
, booktitle =	"Proc. 13th IEEE Internat. Conf. Data Eng."
, year =	1997
, pages =	"208--219"
, update =	"97.07 agarwal"
}

@article{hpss-sxoc-75
, author =	"L. H. Harper and T. H. Payne and J. E. Savage and E. Strauss"
, title =	"Sorting $X+Y$ in $O(n^2)$ comparisons"
, journal =	"Commun. ACM"
, volume =	18
, number =	6
, year =	1975
, pages =	"347--349"
, update =	"98.11 bibrelex, 97.03 devillers"
}

@techreport{h-fafch-78
, author =	"B. Harris"
, title =	"A fast algorithm for finding the convex hull of a set of points in the plane"
, type =	"Internal {Report}"
, number =	""
, institution =	"School Public Urban Policy, Univ. Pennsylvania"
, address =	"Philadelphia, PA"
, year =	1978
, update =	"94.05 devillers"
}

@book{h-agfc-92
, author =	"J. Harris"
, title =	"Algebraic Geometry (A First Course)"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1992
, update =	"96.09 agarwal, 95.01 matousek"
}

@incollection{h-de-94
, author =	"John C. Hart"
, title =	"Distance to an Ellipsoid"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"113--119"
, keywords =	"ray tracing, ellipse"
, update =	"94.09 heckbert"
, annote =	"Gives the formulas necessary to find the distance from a
point to an ellipsoid, or from a point to an ellipse. These formulas can be
useful for geometric modeling or for ray tracing."
}

@techreport{h-otdrq-81
, author =	"J. M. Hart"
, title =	"Optimal two dimensional range queries using binary range lists"
, type =	"Report"
, number =	"76-81"
, institution =	"Dept. Comput. Sci., Univ. Kentucky"
, address =	"Lexington, KY"
, year =	1981
}

@article{h-pimcd-82
, author =	"J. M. Hart"
, title =	"Permutation inversions and multidimensional cumulative distribution functions"
, journal =	"Inform. Process. Lett."
, volume =	14
, year =	1982
, pages =	"218--222"
}

@article{h-cnnr-68
, author =	"P. E. Hart"
, title =	"The condensed nearest neighbor rule"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"??"
, year =	1968
, pages =	"515--516"
, update =	"97.11 bibrelex"
}

@article{hnr-fbhdm-68
, author =	"P. E. Hart and N. J. Nilsson and B. Raphael"
, title =	"A Formal Basis for the Heuristic Determination of Minimum Cost Paths"
, journal =	"IEEE Trans. Syst. Sci. Cybern."
, volume =	"SCC-4"
, number =	2
, year =	1968
, pages =	"100--107"
, update =	"96.09 devillers"
}

@inproceedings{hs-ndssg-84
, author =	"S. Hart and Micha Sharir"
, title =	"Nonlinearity of {Davenport}-{Schinzel} sequences and of generalized path compression schemes"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"313--319"
, precedes =	"hs-ndssg-86"
, update =	"98.03 mitchell"
}

@article{hs-ndssg-86
, author =	"S. Hart and Micha Sharir"
, title =	"Nonlinearity of {Davenport}-{Schinzel} sequences and of generalized path compression schemes"
, journal =	"Combinatorica"
, volume =	6
, year =	1986
, pages =	"151--177"
, keywords =	"Davenport-Schinzel sequences"
, succeeds =	"hs-ndssg-84"
, update =	"98.03 mitchell"
}

@book{h-tdicl-91
, author =	"A. C. Harter"
, title =	"Three-dimensional integrated circuit layout"
, publisher =	"Cambridge University Press"
, address =	"New York, NY"
, year =	1991
, update =	"98.03 bibrelex"
}

@book{h-ca-75
, author =	"J. A. Hartigan"
, title =	"Clustering Algorithms"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1975
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@book{h-ag-77
, author =	"R. Hartshorne"
, title =	"Algebraic Geometry"
, series =	"Graduate texts in Mathematics"
, volume =	52
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1977
, update =	"98.03 icking, 97.11 bibrelex"
}

@article{h-rvdlp-92
, author =	"D. Hartvigsen"
, title =	"Recognizing {Voronoi} diagrams with linear programming"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"369--374"
, update =	"98.03 mitchell, 93.09 rote"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@inproceedings{hvm-vwsh-95
, author =	"M. Hasan and D. Vista and A. Mendelzon"
, title =	"Visual {Web} Surfing with {HY+}"
, booktitle =	"Proc. CASCON'95"
, year =	1995
, url =	"http://www.db.toronto.edu:8020/"
, keywords =	"graph drawing, system"
, update =	"96.09 tamassia, 96.04 garg"
}

@inproceedings{hiikn-eavbk-93
, author =	"Susumu Hasegawa and Hiroshi Imai and Mary Inaba and Naoki Katoh and Jun Nakano"
, title =	"Efficient algorithms for variance-based $k$-clustering"
, booktitle =	"Proc. First Pacific Conf. Computer Graphics Appl., Seoul, Korea, vol. 1"
, volume =	1
, publisher =	"World Scientific Publishing Co."
, year =	1993
, pages =	"75--89"
, keywords =	"clustering, proximity, computer graphics, Voronoi diagram, $k$th order Voronoi diagram, $d$-dimensional"
, update =	"95.09 korneenko"
}

@inproceedings{hii-eakls-93
, author =	"S. Hasegawa and H. Imai and M. Ishiguro"
, title =	"$\varepsilon$-approximations of $k$-label spaces"
, booktitle =	"Proc. 4th Internat. Workshop in Algorithmic Learning Theory"
, series =	"Lecture Notes in Artificial Intelligence"
, volume =	744
, year =	1993
, pages =	"288--299"
, update =	"98.03 bibrelex"
}

@inproceedings{hs-nlbmm-86
, author =	"A. Hasham and J.-R. Sack"
, title =	"A Note on Lower Bounds for Min-Max Heaps"
, booktitle =	"Proc. 24th Allerton Conf. Commun. Control Comput."
, year =	1986
, pages =	"306--307"
, update =	"97.11 sack"
}

@inproceedings{hr-udfs-94
, author =	"S. M. Hashemi and I. Rival"
, title =	"Upward Drawings to Fit Surfaces"
, booktitle =	"Proc. Workshop on Orders, Algorithms and Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	831
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"53--58"
, keywords =	"graph drawing, 3D, upward"
, update =	"95.05 tamassia"
}

@inproceedings{hst-uttst-99
, author =	"Joel Hass and Jack Snoeyink and William P. Thurston"
, title =	"Using Train Tracks to Show that a Trivial Knot May Require Exponential-Size Spanning Disks"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"59--61"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{hm-oafaj-85
, author =	"R. Hassin and N. Megiddo"
, title =	"An optimal algorithm for finding all the jumps of a monotone step-function"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"265--274"
, keywords =	"design of algorithms, binary search, worst-case analysis, prune-and-search, points, lines, two-dimensional"
}

@techreport{hm-aahos-88
, author =	"R. Hassin and N. Megiddo"
, title =	"Approximation algorithms for hitting objects by straight lines"
, type =	"Technical {Report}"
, institution =	"Tel Aviv Univ."
, address =	"Tel Aviv, Israel"
, month =	may
, year =	1988
, update =	"98.07 bibrelex"
}

@article{hm-aahos-91
, author =	"R. Hassin and N. Megiddo"
, title =	"Approximation algorithms for hitting objects by straight lines"
, journal =	"Discrete Appl. Math."
, volume =	30
, year =	1991
, pages =	"29--42"
, keywords =	"NP-Completeness, stabbing, approximation"
, update =	"93.09 jones"
}

@techreport{hr-aamts-97
, author =	"R. Hassin and S. Rubinstein"
, title =	"An approximation algorithm for the maximum traveling salesman problem"
, type =	"Manuscript, submitted"
, institution =	"Tel Aviv University"
, address =	"Tel Aviv, Israel"
, year =	1997
, update =	"98.03 mitchell"
, annote =	"Finds and fixes result of S.R. Kosaraju, J.K. Park, C. Stein"
}

@article{ht-dannc-96
, author =	"T. Hastie and R. Tibshirani"
, title =	"Discriminant adaptive nearest neighbor classification"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	18
, year =	1996
, pages =	"607--616"
, update =	"97.07 agarwal"
}

@mastersthesis{h-senea-93
, author =	"S. Haswgawa"
, title =	"A study on $\varepsilon$-net and $\varepsilon$-approximation"
, school =	"Dept. Inform. Sci., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1993
, keywords =	"master thesis"
, update =	"98.03 bibrelex"
}

@book{h-at-01
, author =	"Allan Hatcher"
, title =	"Algebraic Topology"
, publisher =	"Cambridge University Press"
, year =	2001
, url =	"http://www.math.cornell.edu/~hatcher/"
, update =	"01.11 orourke"
}

@book{h-m-35
, author =	"F. Hausdorff"
, title =	"Mengenlehre"
, edition =	"3rd"
, publisher =	"DeGruyter"
, address =	"Berlin, Germany"
, year =	1935
, update =	"97.11 bibrelex"
}

@proceedings{ht-nggcf-86
, title =	"Numerical Grid Generation in Computational Fluid Dynamics"
, editor =	"J. Hauser and C. Taylor"
, publisher =	"Pineridge Press"
, address =	"Swansea, UK"
, year =	1986
, update =	"97.11 bibrelex"
}

@incollection{hd-mgvia-00
, author =	"Alejo Hausner and David P. Dobkin"
, title =	"Making Geometry Visible: {An} Introduction to the Animation of Geometric Algorithms"
, chapter =	8
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"389--423"
, keywords =	"algorithm animation, visualization"
, update =	"00.03 bibrelex+vismara, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell+tamassia, 97.03 tamassia"
, annote =	"Chapter 8 of su-hcg-00"
}

@book{h-vsag-65
, author =	"M. Hausner"
, title =	"A Vector Space Approach to Geometry"
, publisher =	"Prentice Hall"
, year =	1965
, update =	"97.11 bibrelex"
}

@techreport{h-spnsb-91
, author =	"D. Haussler"
, title =	"Sphere packing numbers for subsets of the {Boolean} $n$-cube with bounded {Vapnik}-{Chervonenkis} dimension"
, type =	"Tech. Report"
, number =	"UCSC-CRL-91-41"
, institution =	"University of California at Santa Cruz"
, year =	1991
, keywords =	"Vapnik-Chervonenkis dimension, range spaces"
, comments =	"related to spanning trees with small crossing number"
, update =	"93.09 matousek"
}

@inproceedings{hw-ensrq-86
, author =	"D. Haussler and Emo Welzl"
, title =	"Epsilon-nets and simplex range queries"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"61--71"
, precedes =	"hw-ensrq-87"
, cites =	"cgl-pgd-83, cgl-pgd-83, c-papop-85, c-pps4d-85, de-opstt-84, dey-3spa-84, d-cltem-78, ew-hrsls-86, eh-dsptt-84, g-cp-67, vc-ucrfe-71, wd-ssvcc-81, w-pr-82, y-3spia-83, yy-gaddg-85, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{hw-ensrq-87
, author =	"D. Haussler and Emo Welzl"
, title =	"Epsilon-nets and simplex range queries"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"127--151"
, keywords =	"combinatorial geometry, probabilistic geometry, probability theory, reporting, counting, half spaces, simplices, $d$-dimensional"
, succeeds =	"hw-ensrq-86"
, update =	"98.03 mitchell"
}

@inproceedings{h-ubcpc-89
, author =	"W. Haverdings"
, title =	"Use of the {BRL-CAD} package in the construction of a geometric model of the {General} {Dynamics} {F-16A} {Air} {Combat} {Fighter} for vulnerability assessments"
, booktitle =	"Proc. BRL-CAD Symposium `89"
, publisher =	"American Defense Preparadness Assoc."
, address =	"Aberdeen Proving Ground, MD"
, year =	1989
, pages =	"170--193"
, update =	"95.05 agarwal"
}

@article{h-nccp-89
, author =	"R. Hayward"
, title =	"A note on the circle containment problem"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"263--264"
}

@article{hrw-sercc-89
, author =	"R. Hayward and D. Rappaport and R. Wenger"
, title =	"Some extremal results on circles containing points"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"253--258"
}

@article{h-lbocf-87
, author =	"R. B. Hayward"
, title =	"A lower bound for the optimal crossing-free {Hamiltonian} cycle problem"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"327--343"
}

@article{h-wtg-85
, author =	"R. B. Hayward"
, title =	"Weakly Triangulated Graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	39
, year =	1985
, pages =	"200--209"
, update =	"98.03 bibrelex"
}

@techreport{hhm-owtg-87
, author =	"R. B. Hayward and C. Hoang and F. Maffrey"
, title =	"Optimizing Weakly Triangulated Graphs"
, type =	"Manuscript"
, institution =	"??"
, year =	1987
, update =	"01.04 smid, 98.03 bibrelex"
}

@techreport{hk-ing-93
, author =	"R. B. Hayward and P. Kearney"
, title =	"Investigating {NeST} Graphs"
, number =	"TR-CS-04-93"
, institution =	"U. Lethbridge"
, year =	1993
, update =	"98.11 bibrelex"
}

@inproceedings{hk-tfnr-94
, author =	"R. B. Hayward and P. Kearney"
, title =	"Tolerance-Free {NeST} Representations"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"275--280"
, cites =	"bc-tpg-84, bd-nstg-93, bilf-putg-91, g-igsec-74, g-agtpg-80, gm-gigt-82, gmt-tg-84, gls-papg, h-ag-57, h-wtg-85, hk-ing-93, k-nr-, mrt-ttg-88, r-ig-69, t-cbmal-83, bm-gta-76, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{hafg-ecpmm-95
, author =	"V. Hayward and S. Aubry and A. Foisy and Y. Ghallab"
, title =	"Efficient collision prediction among many moving objects"
, journal =	"Internat. J. Robot. Res."
, volume =	14
, number =	2
, year =	1995
, pages =	"129--143"
, update =	"98.07 bibrelex"
}

@phdthesis{h-dcadd-88
, author =	"C. Hazelwood"
, title =	"A Divide and Conquer Approach to $D$-dimensional Triangulations"
, school =	"Department of Computer Science, University of Texas at Austin"
, year =	1988
, keywords =	"doctoral thesis"
, annote =	"Contains Pascal code for algorithms"
}

@article{h-act-93
, author =	"C. Hazlewood"
, title =	"Approximating Constrained Tetrahedrizations"
, journal =	"Comput. Aided Geom. Design"
, volume =	10
, number =	1
, month =	jun
, year =	1993
, pages =	"67--87"
, update =	"95.05 held"
}

@inproceedings{hk-cdvm-97
, author =	"T. He and A. Kaufman"
, title =	"Collision Detection for Volumetric Models"
, booktitle =	"Proc. IEEE Visualization"
, site =	"Phoenix, AZ"
, year =	1997
, pages =	"??"
, update =	"98.03 mitchell"
}

@inproceedings{hm-cgl-97
, author =	"Weiqing He and Kim Marriott"
, title =	"Constrained Graph Layout"
, editor =	"Stephen North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"217--232"
, keywords =	"graph drawing, constraints"
, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
}

@article{h-epafm-91
, author =	"Xin He"
, title =	"An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon"
, journal =	"Inform. Process. Lett."
, volume =	37
, number =	2
, year =	1991
, pages =	"111--116"
}

@techreport{h-frdpt-90
, author =	"X. He"
, title =	"On Finding the Rectangular Duals of Planar Triangulated Graphs"
, number =	"90-24"
, institution =	"Department of Computer Science, University of Buffalo"
, year =	1990
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{hk-pccoc-93
, author =	"Xin He and Ming-Yang Kao"
, title =	"Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"303--312"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@inproceedings{hk-reldp-95
, author =	"X. He and M.-Y. Kao"
, title =	"Regular Edge Labelings and Drawings of Planar Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"96--103"
, keywords =	"graph drawing, planar, straight-line, visibility, survey"
, update =	"95.01 tamassia"
}

@inproceedings{h-otrpa-94
, author =	"Patrick Healy"
, title =	"An {$O(n)$}-Time Rectangle Placement Algorithm"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"33--37"
, update =	"00.11 smid, 00.07 icking"
}

@book{hb-cg-86
, author =	"D. Hearn and M. P. Baker"
, title =	"Computer Graphics"
, publisher =	"Prentice Hall"
, year =	1986
, update =	"97.11 bibrelex"
}

@inproceedings{hp-rchsg-96
, author =	"M. A. Hearst and J. O. Pedersen"
, title =	"Reexamining the Cluster Hypothesis: Scatter/Gather on Retrieval Results"
, editor =	"Hans-Peter Frei and Donna Harman and Peter Sch{\"a}uble and Ross Wilkinson"
, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
, publisher =	"ACM Press"
, address =	"New York"
, month =	aug
, year =	1996
, pages =	"76--84"
, update =	"98.07 agarwal"
}

@article{hk-cfmvc-93
, author =	"D. Heath and S. Kasif"
, title =	"The complexity of finding minimal {Voronoi} covers with application to machine learning"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"289--305"
, update =	"96.09 devillers"
}

@inproceedings{h-epgsp-84
, author =	"L. Heath"
, title =	"Embedding planar graphs in seven pages"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"74--83"
}

@techreport{hp-nrmwt-92
, author =	"L. Heath and S. Pemmaraju"
, title =	"New results for the minimum weight triangulation problem"
, type =	"Technical {Report}"
, number =	"92-30"
, institution =	"Dept. Comput. Sci., Virginia Politechnic Inst. and State Univ."
, year =	1992
, update =	"98.03 bibrelex"
}

@article{hp-nrmwt-94
, author =	"L. Heath and S. Pemmaraju"
, title =	"New results for the minimum weight triangulation problem"
, journal =	"Algorithmica"
, volume =	12
, year =	1994
, pages =	"533--552"
, update =	"97.11 bibrelex"
}

@inproceedings{hpr-pfabv-90
, author =	"L. S. Heath and P. K. Paripati and J. W. Roach"
, title =	"Polyhedra: faces are better than vertices"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"191--199"
, precedes =	"hpr-rpfab-93"
, cites =	"gt-tgt-87, g-cp-67, h-cvmev-82, m-ism-88, mw-fowf-80, p-prr-89, r-rrstm-80, rwr-sdi3d-86, rpw-csbsd-87, w-ebdss-85, ZZZ"
, update =	"98.07 bibrelex, 96.09 devillers"
}

@article{hpr-rpfab-93
, author =	"L. S. Heath and P. K. Paripati and J. W. Roach"
, title =	"Representing polyhedra: faces are better than vertices"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"327--351"
, succeeds =	"hpr-pfabv-90"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@mastersthesis{h-ciqfb-80
, author =	"P. Heckbert"
, title =	"Color Image Quantization for Frame Buffer Display"
, school =	"Department of Mathematics, Massachusetts Institute of Technology"
, year =	1980
, note =	"Bachelor's Thesis"
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@article{h-ciqfb-82
, author =	"P. Heckbert"
, title =	"Color image quantization frame buffer display"
, journal =	"ACM Trans. Comput. Graph."
, volume =	16
, number =	3
, year =	1982
, pages =	"297--304"
, update =	"98.03 bibrelex"
}

@inproceedings{h-dmr-92
, author =	"Paul Heckbert"
, title =	"Discontinuity meshing for radiosity"
, booktitle =	"3. Eurographics Workshop on Rendering"
, month =	may
, year =	1992
, pages =	"203--215"
, update =	"98.11 bibrelex"
}

@book{h-gg4-94
, title =	"Graphics Gems {IV}"
, editor =	"Paul Heckbert"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, note =	"comes with either MAC or DOS floppy"
, keywords =	"computer graphics, image processing"
, comments =	"C code from books in Gems series available in subdirectories
of \url{ftp://princeton.edu/pub/Graphics/GraphicsGems}"
, update =	"94.09 heckbert"
}

@incollection{h-mrt-94
, author =	"Paul S. Heckbert"
, title =	"A Minimal Ray Tracer"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"375--381"
, keywords =	"ray tracing, obfuscation"
, update =	"94.09 heckbert"
, annote =	"Answers the question: how short can a ray tracer be?
Contains C code."
}

@incollection{h-bcpiw-94
, author =	"Paul S. Heckbert"
, title =	"Bilinear {Coons} Patch Image Warping"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"438--446"
, keywords =	"morph, resampling"
, update =	"94.09 heckbert"
, annote =	"Presents a fast technique to warp an image according to
four boundary curves. This can be used to correct distortions in images, or
to introduce them, for special effects purposes. Contains C code."
}

@inproceedings{h-rf-92
, author =	"P. S. Heckbert"
, title =	"Radiosity in flatland"
, booktitle =	"Eurographics 92"
, site =	"Cambridge, UK"
, month =	sep
, year =	1992
, pages =	"181--192"
, update =	"97.11 bibrelex"
}

@phdthesis{h-sgiua-91
, author =	"P. S. Heckbert"
, title =	"Simulating Global Illumination Using Adaptive Meshing"
, school =	"University of California"
, address =	"Berkeley, CA"
, month =	jan
, year =	1991
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@techreport{hg-fpath-95
, author =	"P. S. Heckbert and M. Garland"
, title =	"Fast polygonal approximation of terrains and height fields"
, type =	"Report"
, number =	"CMU-CS-95-181"
, institution =	"Carnegie Mellon University"
, year =	1995
, keywords =	"surface approximation, mesh simplification, decimiation, terrains"
, update =	"96.01 mitchell"
}

@article{hh-btpo-84
, author =	"P. S. Heckbert and P. Hanrahan"
, title =	"Beam Tracing Polygonal Objects"
, journal =	"Comput. Graph."
, volume =	18
, number =	3
, year =	1984
, pages =	"119--127"
, note =	"Proc. SIGGRAPH '84"
, update =	"97.11 bibrelex"
}

@inproceedings{hl-culbt-96
, author =	"R. Heckmann and T. Lengauer"
, title =	"Computing upper and lower bounds on textile nesting problems"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"392--405"
, update =	"97.03 smid"
}

@inproceedings{hk-esrpo-90
, author =	"S. Heep and H.-P. Kriegel"
, title =	"Effiziente sekund{\"a}rspeichergeeignete {Randdarstellung} polygonaler {Objekte} und ihre algorithmische {Bearbeitung}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	11
, update =	"00.03 bibrelex"
}

@inproceedings{h-oatgp-93
, author =	"P. J. Heffernan"
, title =	"An optimal algorithm for the two-guard problem"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"348--358"
, precedes =	"h-oatgp-96"
, cites =	"at-oadvp-81, c-tsplt-91a, cn-owr-86, c-ctpg-75, et-gpprl-89, f-spcwt-78, ghlst-ltavs-87, h-ltawm-90, ik-tgp-91, ll-ccagp-86, lp-esppr-84, lc-scvps-90, mw-omcpo-90i, o-agta-87, s-vpp-89, ZZZ"
, update =	"98.03 bibrelex, 96.09 devillers, 93.09 jones"
}

@article{h-oatgp-96
, author =	"P. J. Heffernan"
, title =	"An optimal algorithm for the two-guard problem"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"15--44"
, succeeds =	"h-oatgp-93"
, update =	"96.09 devillers"
}

@inproceedings{h-gaaps-93
, author =	"Paul J. Heffernan"
, title =	"Generalized Approximate Algorithms for Point Set Congruence"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"373--384"
, update =	"96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
}

@inproceedings{h-ltawm-90
, author =	"P. J. Heffernan"
, title =	"Linear-time algorithms for weakly-monotone polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"236--239"
, cites =	"c-tsplt-90t, et-gpprl-89, gjpt-tsp-78, hm-svpap-90, kkt-ptots-90i, lp-oafkp-79, ps-tspm-81, t-ocspt-88, ZZZ"
, update =	"98.07 bibrelex"
}

@article{h-tsmac-91
, author =	"P. J. Heffernan"
, title =	"The Translation Square Map and Approximate Congruence"
, journal =	"Inform. Process. Lett."
, volume =	39
, year =	1991
, pages =	"153--159"
, update =	"93.09 milone+mitchell"
}

@phdthesis{h-tcgpm-91
, author =	"P. J. Heffernan"
, title =	"Topics in computational geometry: point matching and polygonal visibility"
, type =	"Ph.{D}. Thesis"
, school =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1991
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@techreport{hm-oacvp-90
, author =	"P. J. Heffernan and Joseph S. B. Mitchell"
, title =	"An optimal algorithm for computing visibility in the plane"
, type =	"Technical {Report}"
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1990
, keywords =	"visibility"
, precedes =	"hm-oacvp-91"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@inproceedings{hm-oacvp-91
, author =	"P. J. Heffernan and Joseph S. B. Mitchell"
, title =	"An optimal algorithm for computing visibility in the plane"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"437--448"
, keywords =	"visibility, lower envelopes, polygons with holes"
, succeeds =	"hm-oacvp-90"
, precedes =	"hm-oacvp-95"
, update =	"98.03 mitchell, 96.05 mitchell"
}

@article{hm-oacvp-95
, author =	"P. J. Heffernan and Joseph S. B. Mitchell"
, title =	"An optimal algorithm for computing visibility in the plane"
, journal =	"SIAM J. Comput."
, volume =	24
, number =	1
, year =	1995
, pages =	"184--201"
, keywords =	"visibility, lower envelopes, polygons with holes"
, succeeds =	"hm-oacvp-91"
, update =	"98.03 mitchell, 96.05 mitchell"
}

@inproceedings{hm-svpap-90
, author =	"P. J. Heffernan and Joseph S. B. Mitchell"
, title =	"Structured visibility profiles with applications to problems in simple polygons"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"53--62"
, cites =	"acm-mpoap-89, at-oadvp-81, bt-ladts-86, c-ept-90, cg-vippg-89, e-hdpa-85, ea-lacvp-81, fhs-cmsp-89, gjpt-tsp-78, g-cvpcs-86, gy-fchsp-83, ghlst-ltavs-87, js-clvpa-87, k-osps-83, kkt-ptots-90i, l-vsp-83, ll-cvpe-84, lp-esppr-84, ma-lafch-79, m-olcch-87, ps-rgpcr-86, ps-tspm-81, s-ltaml-86, tv-otats-88, t-ltass-86a, t-stsps-89, t-spsts-85, t-mss-85, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{hs-adaps-91
, author =	"P. J. Heffernan and S. Schirra"
, title =	"Approximate decision algorithms for point set congruence"
, type =	"Report"
, number =	"MPI-I-91-110"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1991
, precedes =	"hs-adaps-92"
}

@inproceedings{hs-adaps-92
, author =	"P. J. Heffernan and S. Schirra"
, title =	"Approximate decision algorithms for point set congruence"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"93--101"
, succeeds =	"hs-adaps-91"
, precedes =	"hs-adaps-94"
, cites =	"amww-cssgo-88, akmsw-mpnrc-91, amo-nf-90, amz-apmp-89, b-mbimu-84, b-azede-90, fm-cpgcs-91, gt-namfp-88, gtt-nfa-90, h-tsmac-91, hk-cmhdp-90, hks-uevsi-91, isi-mgftc-89, i-acsdp-90, krt-fdmfa-92, ls-ocmgc-91i, s-udbde-88, s-aaac-90, s-pma-90, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@article{hs-adaps-94
, author =	"P. J. Heffernan and S. Schirra"
, title =	"Approximate decision algorithms for point set congruence"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"137--156"
, succeeds =	"hs-adaps-92"
, update =	"96.09 devillers"
}

@article{h-udpdn-81
, author =	"L. Heffter"
, title =	"{\"U}ber das {Problem} der {Nachbargebiete}"
, journal =	"Math. Ann."
, volume =	38
, year =	1981
, pages =	"477--508"
}

@article{h-acpr-82
, author =	"A. Heged{\"u}s"
, title =	"Algorithms for Covering Polygons by Rectangles"
, journal =	"Comput. Aided Design"
, volume =	14
, year =	1982
, update =	"98.03 bibrelex"
}

@article{hsb-tarms-90
, author =	"W. Heiden and M. Schlenkrich and J. Brickmann"
, title =	"Triangulation algorithms for the representation of molecular surface properties"
, journal =	"J. Comput. Aided Mol. Des."
, volume =	4
, year =	1990
, pages =	"255--269"
, update =	"98.03 bibrelex"
}

@inproceedings{hss-uccli-94
, author =	"W. Heidrich and P. Slusallek and H.-P. Seidel"
, title =	"Using {C}++ class libraries from an interpreted language"
, booktitle =	"Technology of Object-Oriented Languages and Systems"
, nickname =	"TOOLS"
, site =	"Santa Barbara, CA"
, year =	1994
, pages =	"397--408"
, update =	"98.07 bibrelex"
}

@article{h-mgasi-83
, author =	"E. Heighway"
, title =	"A mesh generator for automatically subdividing irregular polygons into quadrilaterals"
, journal =	"IEEE Trans. Magn."
, volume =	19
, number =	6
, year =	1983
, pages =	"2535--2538"
, update =	"97.11 bibrelex"
}

@article{hb-tdatm-82
, author =	"E. A. Heighway and C. S. Biddlecombe"
, title =	"Two Dimensional Automatic Triangular Mesh Generation for the Finite Element Electromagnetic Package {PE2D}"
, journal =	"IEEE Trans. Magn."
, volume =	"MAG-18"
, year =	1982
, pages =	"594--598"
, annote =	"``Poorness'' measure ``fractional difference of area
		 of element and equilateral triangle of same
		 perimeter''. Nodes are moved to fix this."
}

@inproceedings{h-tstel-01
, author =	"Laura Heinrich-Litan"
, title =	"Time-Space Tradeoffs for Exact {$L_\infty$} Nearest Neighbor Search in High Dimensions"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"93--96"
, update =	"01.04 icking"
}

@incollection{hrr-araga-91
, author =	"J. Heintz and T. Reico and M.-F. Roy"
, title =	"Algorithms in real algebraic geometry and applications to computational geometry"
, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
, publisher =	"American Mathematical Society, Association for Computing Machinery"
, address =	"Providence, RI"
, year =	1991
, pages =	"137--163"
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{hrs-dccss-94
, author =	"J. Heintz and M.-F. Roy and P. Solern{\'o}"
, title =	"Description of the connected components of a semialgebraic set in single exponential time"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"121--140"
, update =	"98.07 agarwal"
}

@inproceedings{hrs-ocss-89
, author =	"J. Heintz and M.-F. Roy and P. Solern{\'o}"
, title =	"On the complexity of semialgebraic sets"
, booktitle =	"Proc. IFIP San Francisco"
, year =	1989
, pages =	"293--298"
, update =	"98.03 agarwal"
}

@incollection{hrs-sepfs-93
, author =	"J. Heintz and M.-F. Roy and P. Solern{\'o}"
, title =	"Single exponential path finding in semi-algebraic sets {II}: {The} general case"
, editor =	"C. Bajaj"
, booktitle =	"Algebraic Geometry and its Applications"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1993
, pages =	"467--481"
, update =	"98.07 agarwal"
}

@inproceedings{hp-brd-89
, author =	"G. Heinzinger and B. Paden"
, title =	"Bounds on Robot Dynamics"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Scottsdale, AZ"
, month =	may
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{hl-eapni-93
, author =	"J. Heistermann and T. Lengauer"
, title =	"Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"251--259"
, keywords =	"optimization, CAD, packing"
, update =	"93.09 rote, 93.05 smid"
}

@inproceedings{h-fiacv-93
, author =	"Martin Held"
, title =	"A Fast Incremental Algorithm for Computing the {Voronoi} Diagram of a Planar Shape"
, booktitle =	"Communicating with Virtual Worlds"
, nickname =	"CGI '93"
, publisher =	"Springer-Verlag"
, address =	"Lausanne, Switzerland"
, month =	jun
, year =	1993
, pages =	"318--329"
, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 held"
}

@article{h-gbitp-91
, author =	"Martin Held"
, title =	"A Geometry-Based Investigation of the Tool Path Generation for Zigzag Pocket Machining"
, journal =	"Visual Comput."
, volume =	7
, number =	"5--6"
, month =	sep
, year =	1991
, pages =	"296--308"
, update =	"98.03 mitchell, 93.09 held"
}

@inproceedings{h-ertp-98
, author =	"Martin Held"
, title =	"Efficient and Reliable Triangulation of Polygons"
, booktitle =	"Proc. Comput. Graphics Internat. 1998"
, site =	"Hannover, Germany"
, month =	jun
, year =	1998
, pages =	"633--643"
, update =	"98.07 held+mitchell"
}

@techreport{h-eceri-96
, author =	"Martin Held"
, title =	"{ERIT} -- {A} Collection of Efficient and Reliable Intersection Tests"
, type =	"Technical {Report}"
, institution =	"University at Stony Brook"
, year =	1996
, update =	"98.03 mitchell"
, annote =	"Submitted for publication"
}

@techreport{h-ffist-98
, author =	"Martin Held"
, title =	"{FIST}: {Fast} Industrial-Strength Triangulation of Polygons"
, institution =	"University at Stony Brook"
, year =	1998
, comments =	"Submitted for publication"
, update =	"98.07 mitchell"
}

@inproceedings{h-gscgs-89
, author =	"Martin Held"
, title =	"GeoPocket -- {A} Sophisticated Computational Geometry Solution of Geometrical and Technological Problems Arising from Pocket Machining"
, editor =	"F. Kimura and A. Rolstad{\aa}s"
, booktitle =	"Proc. Computer Applications in Production and Engineering"
, nickname =	"CAPE '89"
, publisher =	"North-Holland"
, month =	oct
, year =	1989
, pages =	"283--293"
, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 held"
}

@inproceedings{h-igvdp-93
, author =	"Martin Held"
, title =	"Incremental Generation of {Voronoi} Diagrams of Planar Shapes"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"70--73"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
}

@inproceedings{h-cvdcp-94
, author =	"Martin Held"
, title =	"On Computing {Voronoi} Diagrams of Convex Polyhedra by Means of Wavefront Propagation"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"128--133"
, cites =	"a-am3sa-91, c-edt-92, gp-acfsm1-92, gykd-cdma3-91, h-fiacv-93, h-hcsco-90t, l-matps-82, m-rcvdp-93, ns-blss-91, obs-stcav-92, p-nmasp-78, p-masp-77, ps-cgi-90, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 94.09 jones"
}

@book{h-cgpm-91
, author =	"Martin Held"
, title =	"On the Computational Geometry of Pocket Machining"
, series =	"Lecture Notes Comput. Sci."
, volume =	500
, publisher =	"Springer-Verlag"
, month =	jun
, year =	1991
, isbn =	"3-540-54103-9"
, update =	"98.03 mitchell, 93.09 held"
}

@article{h-vdocc-98
, author =	"M. Held"
, title =	"Voronoi Diagrams and Offset Curves of Curvilinear Polygons"
, journal =	"Comput. Aided Design"
, volume =	30
, number =	4
, month =	apr
, year =	1998
, pages =	"287--300"
, update =	"98.07 held"
}

@article{h-veare-01
, author =	"M. Held"
, title =	"VRONI: {An} engineering approach to the reliable and efficient computation of {Voronoi} diagrams of points and line segments"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"95--123"
, update =	"01.07 smid"
}

@inproceedings{h-zcgzp-90
, author =	"Martin Held"
, title =	"ZigPocket -- On the Computational Geometry of Zigzag Pocket Machining"
, editor =	"T. S. Chua and T. L. Kunii"
, booktitle =	"Proc. CG International '90"
, nickname =	"CGI '90"
, publisher =	"Springer-Verlag"
, month =	jun
, year =	1990
, pages =	"281--296"
, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 held"
}

@inproceedings{hkm-rtcdm-96
, author =	"M. Held and J. Klosowski and Joseph S. B. Mitchell"
, title =	"Real-Time Collision Detection for Motion Simulation within Complex Environments"
, booktitle =	"Proc. ACM SIGGRAPH'96 Visual Proceedings"
, site =	"New Orleans, LA"
, year =	1996
, pages =	151
, precedes =	"khmsz-ecdubv-98"
, update =	"98.03 mitchell"
}

@inproceedings{hkm-cdftv-96
, author =	"Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
, title =	"Collision detection for fly-throughs in virtual environments"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V13--V14"
, precedes =	"hkm-ecdmv-95"
, cites =	"clmp-ecdie-94, gsf-scdp-94, hkm-ecdmv-95, hkm-scgbb-95, hs-parss-93, h-cdiga-95, lm-fidgm-95, mms-qsrs-94, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat+mitchell"
}

@techreport{hkm-ecdmv-94
, author =	"Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
, title =	"Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs"
, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
, year =	1994
, keywords =	"mesh generation, stabbing number, BSP, R-star trees, R-tree"
, precedes =	"hkm-ecdmv-95"
, update =	"95.09 mitchell"
}

@inproceedings{hkm-ecdmv-95
, author =	"Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
, title =	"Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"205--210"
, keywords =	"mesh generation, stabbing number, BSP, R-star trees, R-tree"
, succeeds =	"hkm-ecdmv-94"
, update =	"96.05 mitchell, 95.09 jones+mitchell"
}

@unpublished{hkm-scgbb-95
, author =	"Martin Held and J. T. Klosowski and Joseph S. B. Mitchell"
, title =	"Speed comparison of generalized bounding boxes"
, year =	1995
, note =	"??"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{hla-pmbcp-94
, author =	"Martin Held and G. Luk{\'a}cs and L. Andor"
, title =	"Pocket Machining Based on Contour-Parallel Tool Paths Generated by Means of Proximity Maps"
, journal =	"Comput. Aided Design"
, volume =	26
, number =	3
, month =	mar
, year =	1994
, pages =	"189--203"
, update =	"98.03 mitchell, 96.09 devillers, 95.01 held"
}

% ### others?
@incollection{h??-skcsn-95
, author =	"T. Helgason and others"
, title =	"On shortest $k$-edge connected {Steiner} networks with rectilinear distance"
, editor =	"Ding-Zhu Du and Panos M. Pardalos"
, booktitle =	"Minmax and Applications"
, series =	"Nonconvex Optimization and Applications"
, year =	1995
, pages =	""
, keywords =	"optimization, Steiner tree, $L_1$ metrics"
, update =	"95.09 korneenko"
}

@inproceedings{h-taatm-90
, author =	"M. Heller"
, title =	"Triangulation algorithms for adaptive terrain modeling"
, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
, year =	1990
, pages =	"163--174"
, update =	"98.07 devillers"
}

@inproceedings{hkp-oais-97
, author =	"J. H. Hellerstein and E. Koustsoupias and C. H. Papadimtriou"
, title =	"On the analysis of indexing schemes"
, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
, year =	1997
, pages =	"249--256"
, update =	"97.07 agarwal"
}

@article{h-umkkm-23
, author =	"E. Helly"
, title =	"{\"U}ber {Mengen} konvexer {K{\"o}rper} mit gemeinschaftlichen {Punkten}"
, journal =	"Jahresbericht Deutsch. Math. Verein."
, volume =	32
, year =	1923
, pages =	"175--176"
, update =	"97.11 bibrelex"
}

@article{h-usvam-30
, author =	"E. Helly"
, title =	"{\"U}ber {Systeme} von abgeschlossenen {Mengen} mit gemeinschaftlichen {Punkten}"
, journal =	"Monaths. Math. und Physik"
, volume =	37
, year =	1930
, pages =	"281--302"
, update =	"96.09 agarwal, 95.01 matousek"
}

@book{h-lp-89
, author =	"Armin Hemmerling"
, title =	"Labyrinth Problems: Labyrinth-Searching Abilities of Automata"
, publisher =	"B. G. Teubner"
, address =	"Leipzig"
, year =	1989
, update =	"99.11 bibrelex, 97.03 icking"
}

@techreport{h-nwpcd-93
, author =	"Armin Hemmerling"
, title =	"Navigation Without Perception of Coordinates and Distances"
, number =	"TR-93-018"
, institution =	"International Computer Science Institute"
, address =	"Berkeley, California"
, year =	1993
, precedes =	"h-nwpcd-94"
, update =	"97.03 icking"
}

@article{h-nwpcd-94
, author =	"Armin Hemmerling"
, title =	"Navigation Without Perception of Coordinates and Distances"
, journal =	"Mathematical Logic Quarterly"
, volume =	40
, year =	1994
, pages =	"237--260"
, succeeds =	"h-nwpcd-93"
, update =	"97.03 icking"
}

@phdthesis{h-efitd-84
, author =	"M. R. Henderson"
, title =	"Extraction of feature information from three dimensional {CAD} data"
, school =	"Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1984
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{ht-kdtre-82
, author =	"T. C. Henderson and E. Triendl"
, title =	"The $k$-d tree representation of edge descriptions"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
, site =	"Munich, West Germany"
, year =	1982
, pages =	"806--809"
}

@article{h-sppto-85
, author =	"M. Henig"
, title =	"The shortest path problem with two objective functions"
, journal =	"European J. Oper. Res."
, volume =	25
, year =	1985
, pages =	"281--291"
, keywords =	"dynamic programming, networks, multiattribute utility"
, update =	"93.09 milone+mitchell"
}

@incollection{hrgz-bpcp-97
, author =	"M. Henk and J. Richter-Gebert and G. M. Ziegler"
, title =	"Basic properties of convex polytopes"
, chapter =	13
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"243--270"
, update =	"97.11 orourke"
}

@book{h-cit-79
, author =	"M. Henle"
, title =	"A Combinatorial Introduction to Topology"
, publisher =	"W. H. Freeman"
, address =	"San Francisco, CA"
, year =	1979
, update =	"93.05 orourke"
}

@book{h-gsss-11
, author =	"L. Henneberg"
, title =	"Die graphische Statik der starren Systeme"
, publisher =	"Leipzig"
, year =	1911
, update =	"97.11 bibrelex"
}

@inproceedings{h-unsgd-90
, author =	"Andreas Henrich"
, title =	"{Die} {Unterst{\"u}tzung} von {Nicht}-{Standardanfragen} in geometrischen {Datenbanksystemen} durch r{\"a}umliche {Zugriffsstrukturen}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	12
, update =	"00.03 bibrelex"
}

@inproceedings{h-ipmda-96
, author =	"A. Henrich"
, title =	"Improving the performance of multi-dimensional access structures based on $kd$-trees"
, booktitle =	"Proc. 12th IEEE Intl. Conf. on Data Engineering"
, year =	1996
, pages =	"68--74"
, update =	"97.07 agarwal"
}

@inproceedings{hsw-ltsam-89
, author =	"A. Henrich and H.-W. Six and P. Widmayer"
, title =	"The {LSD} tree: {S}patial access to multidimensional point and non-point objects"
, booktitle =	"Proc. 15th VLDB Conference"
, year =	1989
, pages =	"45--53"
, update =	"97.07 agarwal"
}

@book{h-acca-77
, author =	"P. Henrici"
, title =	"Applied and computational complex analysis"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1977
, update =	"99.11 bibrelex, 97.11 bibrelex"
}

@techreport{hh-vlg-90
, author =	"T. R. Henry and S. E. Hudson"
, title =	"Viewing Large Graphs"
, number =	"90-13"
, institution =	"Department of Computer Science, University of Arizona"
, year =	1990
, keywords =	"graph drawing"
, update =	"98.07 patrignani, 93.09 tamassia"
}

@book{h-tdaz-08
, author =	"K. Hensel"
, title =	"Theorie der algebraischen {Zahlen}"
, publisher =	"B. G. Teubner"
, address =	"Leipzig"
, year =	1908
, update =	"99.11 bibrelex, 97.11 bibrelex"
}

@article{h-bevv-56
, author =	"A. Heppes"
, title =	"Beweis einer {Vermutung} von {A}. {V{\'a}zsonyi}"
, journal =	"Acta Math. Acad. Sci. Hungar."
, volume =	7
, year =	1956
, pages =	"463--466"
, update =	"96.09 agarwal+devillers+orourke, 96.05 agarwal"
}

@article{h-fdd-64
, author =	"A. Heppes"
, title =	"Filling a domain by discs"
, journal =	"Periodica Mathematica Hungarica"
, volume =	8
, year =	1964
, pages =	"363--371"
, update =	"96.05 pocchiola"
}

@article{h-scpep-92
, author =	"A. Heppes"
, title =	"Solid circle-packings in the {Euclidean} plane"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"29--43"
}

@article{hjt-tdrgo-95
, author =	"M. J. Herbert and C. B. Jones and D. S. Tudhope"
, title =	"Three-dimensional Reconstruction of Geoscientific Objects from Serial Sections"
, journal =	"Visual Comput."
, volume =	11
, number =	7
, year =	1995
, pages =	"343--359"
, update =	"96.01 held"
}

@article{h-hmhat-80
, author =	"D. Herbison-Evans"
, title =	"How to merge hidden arcs and then not draw them"
, journal =	"Computers and Graphics"
, volume =	5
, year =	1980
, pages =	"79--81"
}

@book{h-irpfc-80
, author =	"G. T. Herman"
, title =	"Image Reconstruction from Projections: the Fundamentals of Computerized Tomography"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1980
, update =	"98.11 bibrelex"
}

@inproceedings{h-sict-83
, author =	"G. T. Herman"
, title =	"The special issue on computerized tomography"
, booktitle =	"Proc. IEEE"
, volume =	71
, year =	1983
, pages =	"291--292"
, update =	"98.11 bibrelex"
}

@book{hm-im-77
, author =	"R. Hermann and C. Martin"
, title =	"Interdisciplinary Mathematics"
, volume =	13
, publisher =	"Math. Sci. Press"
, year =	1977
, update =	"98.03 bibrelex"
}

@article{h-tadpe-82
, author =	"F. Hermeline"
, title =	"Triangulation automatique d'un poly{\`e}dre en dimension {$N$}"
, journal =	"RAIRO-Mathematical Modelling And Numerical Analysis-Modelisation Mathematique Et Analyse Numerique"
, volume =	16
, number =	3
, year =	1982
, pages =	"211--242"
, update =	"93.09 rote"
, annote =	"Incremental algorithm for NDVD."
}

@inproceedings{b-foais-96
, author =	"A. {Hern{\'a}ndez Barrera}"
, title =	"Finding an {$o(n^2 \log n)$} algorithm is sometimes hard"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"289--294"
, update =	"96.09 mitchell"
}

@inproceedings{hna-mscpp-99
, author =	"Antonio Hern{\'a}ndez-Barrera and Subhas Chandra Nandy and Tetsuo Asano"
, title =	"The {Minkowski} Sum of a Convex Polyhedron and a Polyhedral Terrain"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"135--136"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{h-cg-94
, author =	"Gregorio Hern{\'a}ndez-Pe{\~n}alver"
, title =	"Controlling Guards"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"387--392"
, succeeds =	"h-cg-94c"
, cites =	"c-ctpg-75, lhl-mcgpk-93, o-agta-87, o-gnfmg-83, s-rrag-92, s-hpp-89, ZZZ"
, update =	"00.11 smid, 00.07 icking, 98.11 bibrelex, 94.09 jones"
}

@inproceedings{h-cg-94c
, author =	"Gregorio Hern{\'a}ndez-Pe{\~n}alver"
, title =	"Controlling Guards"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"68--71"
, precedes =	"h-cg-94"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{hhmmn-gtg-97
, author =	"C. Hernando and F. Hurtado and A. Marquez and M. Mora and M. Noy"
, title =	"Geometric Tree Graphs"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"28--29"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{hhn-gncm-99
, author =	"Maria del Carmen Hernando and Ferran Hurtado and Marc Noy"
, title =	"Graphs of Non-Crossing Matchings"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"97--99"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{h-fatcd-93
, author =	"J. Hershberger"
, title =	"A faster algorithm for the two-center decision problem"
, journal =	"Inform. Process. Lett."
, volume =	47
, year =	1993
, pages =	"23--29"
, update =	"96.05 agarwal"
}

@article{h-ndssp-91
, author =	"J. Hershberger"
, title =	"A new data structure for shortest path queries in a simple polygon"
, journal =	"Inform. Process. Lett."
, volume =	38
, year =	1991
, pages =	"231--235"
}

@article{h-ovgat-89
, author =	"J. Hershberger"
, title =	"An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"141--155"
, succeeds =	"h-fvgsp-87"
, update =	"01.04 icking, 97.11 bibrelex"
}

@inproceedings{h-cmsp-93
, author =	"J. Hershberger"
, title =	"Compliant motion in a simple polygon"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"397--398"
, keywords =	"video review"
, cites =	"b-zsaa-91, bh-csaa-92, fhs-cmsp-89, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{h-fuenl-89
, author =	"J. Hershberger"
, title =	"Finding the upper envelope of $n$ line segments in {$O(n\log n)$} time"
, journal =	"Inform. Process. Lett."
, volume =	33
, year =	1989
, pages =	"169--174"
, update =	"93.05 devillers"
}

@inproceedings{h-fvgsp-87
, author =	"J. Hershberger"
, title =	"Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"11--20"
, precedes =	"h-ovgat-89"
, cites =	"aaghi-vdp-86, b-prcv-75, cg-vippg-85, ci-tsc-84, gjpt-tsp-78, ghlst-ltavs-86, gmpr-nrll-77, gs-pmgsc-85, hm-ftsp-83, hm-ndsrs-82, tv-otats-86, a-jschc-87, ZZZ"
, update =	"01.04 icking, 98.03 bibrelex"
}

@inproceedings{h-msde-91
, author =	"J. Hershberger"
, title =	"Minimizing the sum of diameters efficiently"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"62--65"
, precedes =	"h-msde-92"
, cites =	"agss-ltacv-89, abky-cabmm-88, ds-dcmdf-89, e-acg-87, egs-oplms-86, gt-ltasc-85, gj-cigtn-79, hs-ftp-89, j-nccog-82, k-osps-83, ms-cscgl-84, ms-ppgmm-91, ps-cgi-85, rw-gc-89, s-wcaso-90, ZZZ"
, update =	"98.07 bibrelex"
}

@article{h-msde-92
, author =	"J. Hershberger"
, title =	"Minimizing the sum of diameters efficiently"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"111--118"
, succeeds =	"h-msde-91"
}

@inproceedings{h-opats-92
, author =	"J. Hershberger"
, title =	"Optimal parallel algorithms for triangulated simple polygons"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"33--42"
, precedes =	"h-opats-95"
, cites =	"acg-cdctd-89, acw-opavs-91, ag-pasft-86, at-oadvp-81, bt-ladts-86, cgmrs-namlp-90, c-tpca-82, c-tsplt-91a, cegghss-rspug-91, cg-vippg-89, cg-fc1ds-86, cct-rpatd-91, c-pms-88, cv-acdto-88, dk-fdpi-82, gsg-pmvsp-90, g-pcief-91, gh-ospqs-89, ghlst-ltavs-87, ghs-citds-91, h-ndssp-91, hs-cmlpg-91, krs-ppp-85, lp-esppr-84, ps-rgpcr-85, ps-cgi-85, rr-ostrp-89, sv-flcas-88, s-sfira-90, sv-fmmsp-81, s-cgfns-89, tv-opatc-89, tv-epba-85, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@article{h-opats-95
, author =	"J. Hershberger"
, title =	"Optimal parallel algorithms for triangulated simple polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"145--170"
, keywords =	"parallel algorithms, simple polygons, shortest paths, shortest path queries, shortest path trees, ray shooting, relative convex hull"
, succeeds =	"h-opats-92"
, update =	"96.09 devillers"
}

@inproceedings{h-ueop-90
, author =	"J. Hershberger"
, title =	"Upper envelope onion peeling"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"368--379"
, precedes =	"h-ueop-92"
}

@article{h-ueop-92
, author =	"J. Hershberger"
, title =	"Upper envelope onion peeling"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"93--110"
, succeeds =	"h-ueop-90"
}

@article{hg-ospan-88
, author =	"J. Hershberger and Leonidas J. Guibas"
, title =	"An {$O(n^{2})$} shortest path algorithm for a non-rotating convex body"
, journal =	"J. Algorithms"
, volume =	9
, year =	1988
, pages =	"18--46"
, update =	"98.03 mitchell"
}

@inproceedings{hrs-fd2ec-92
, author =	"J. Hershberger and M. Rauch and Subhash Suri"
, title =	"Fully dynamic $2$-edge-connectivity in planar graphs"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"233--244"
, update =	"98.03 mitchell"
}

@inproceedings{hs-eszp-94
, author =	"J. Hershberger and J. Snoeyink"
, title =	"An Efficient Solution to the Zookeeper's Problem"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"104--109"
, cites =	"cn-ozkr-89, gh-ospqs-89, h-ndssp-91, hs-cmlpg-91, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{hs-oidpa-94
, author =	"J. Hershberger and J. Snoeyink"
, title =	"An ${O}(n \log n)$ Implementation of the {Douglas}-{Peucker} Algorithm for Line Simplification"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"383--384"
, keywords =	"video review"
, cites =	"b-tcl-85, dghs-eafcr-93, dp-arnpr-73, hs-sudpl-92, m-samml-86, m-alg-87, m-olcch-87, r-ippap-, r-qcsaa-90, w-algau-85, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones"
}

@inproceedings{hs-aacsl-91
, author =	"J. Hershberger and J. Snoeyink"
, title =	"Around and around: computing the shortest loop"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"157--161"
, cites =	"hs-cmphc-90, bt-ladts-86, c-tpca-82, ceersstu-akp-91, ghlst-ltavs-87, lp-esppr-84, t-stsps-89, t-mss-85, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{hs-cmphc-90
, author =	"J. Hershberger and J. Snoeyink"
, title =	"Computing minimum length paths of a given homotopy class"
, type =	"Technical Report"
, number =	"RUU-CS-90-37"
, institution =	"Utrecht University, Department of Computer Science"
, month =	dec
, year =	1990
, precedes =	"hs-cmlpg-91, hs-cmlpg-94"
, update =	"98.07 bibrelex"
}

@inproceedings{hs-cmlpg-91
, author =	"J. Hershberger and J. Snoeyink"
, title =	"Computing minimum length paths of a given homotopy class"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"331--342"
, keywords =	"path planning, topology"
, succeeds =	"hs-cmphc-90"
, update =	"98.07 bibrelex"
}

@article{hs-cmlpg-94
, author =	"J. Hershberger and J. Snoeyink"
, title =	"Computing minimum length paths of a given homotopy class"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"63--98"
, succeeds =	"hs-cmphc-90"
, update =	"98.07 bibrelex, 95.01 devillers"
}

@inproceedings{hs-cpmfl-92
, author =	"J. Hershberger and J. Snoeyink"
, title =	"Convex polygons made from few lines and convex decompositions of polyhedra"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"376--387"
}

@inproceedings{hs-sudpl-92
, author =	"J. Hershberger and J. Snoeyink"
, title =	"Speeding up the {Douglas-Peucker} line simplification algorithm"
, booktitle =	"Proc. 5th Internat. Sympos. Spatial Data Handling"
, year =	1992
, pages =	"134--143"
, update =	"97.11 bibrelex"
}

@inproceedings{hs-parss-93
, author =	"J. Hershberger and Subhash Suri"
, title =	"A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1993
, pages =	"54--63"
, precedes =	"hs-parss-95"
, update =	"98.11 bibrelex, 98.03 mitchell, 96.05 mitchell, 93.05 smid"
}

@article{hs-parss-95
, author =	"J. Hershberger and Subhash Suri"
, title =	"A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk"
, journal =	"J. Algorithms"
, volume =	18
, year =	1995
, pages =	"403--431"
, keywords =	"mesh generation, triangulation, stabbing number"
, succeeds =	"hs-parss-93"
, update =	"98.03 mitchell, 96.05 mitchell+pocchiola"
, annote =	"Special issue of selected papers from the
4th Symposium on Discrete Algorithms."
}

@article{hs-oaesp-??
, author =	"John Hershberger and Subhash Suri"
, title =	"An optimal algorithm for {Euclidean} shortest paths in the plane"
, journal =	"SIAM J. Comput."
, volume =	"??"
, year =	"??"
, pages =	"To appear"
, succeeds =	"hs-oaesp-95,hs-ecesp-93"
, update =	"98.03 mitchell"
}

@techreport{hs-oaesp-95
, author =	"John Hershberger and Subhash Suri"
, title =	"An optimal algorithm for {Euclidean} shortest paths in the plane"
, type =	"Manuscript"
, institution =	"Washington University"
, year =	1995
, succeeds =	"hs-ecesp-93"
, update =	"97.03 smid, 96.05 mitchell"
}

@article{hs-oaesp-99
, author =	"John Hershberger and Subhash Suri"
, title =	"An optimal algorithm for {Euclidean} shortest paths in the plane"
, journal =	"SIAM J. Comput."
, volume =	28
, number =	6
, year =	1999
, pages =	"2215--2256"
, update =	"01.07 orourke"
}

@inproceedings{hs-asdch-90
, author =	"J. Hershberger and Subhash Suri"
, title =	"Applications of a semi-dynamic convex hull algorithm"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"380--392"
, update =	"98.03 mitchell"
}

@article{hs-asdch-92
, author =	"J. Hershberger and S. Suri"
, title =	"Applications of a semi-dynamic convex hull algorithm"
, journal =	"BIT"
, volume =	32
, year =	1992
, pages =	"249--267"
, update =	"98.03 bibrelex"
}

@inproceedings{hs-ebrpc-97
, author =	"J. Hershberger and S. Suri"
, title =	"Efficient Breakout Routing in Printed Circuit Boards"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"460--462"
, cites =	"cc-eafdp-97, clr-ia-90, dks-rrbs-91, m-slwrc-90, rbk-earvw-90, t-dsna-83, yd-slfrr-95, ydd-iprap-96, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@inproceedings{hs-ecesp-93
, author =	"John Hershberger and Subhash Suri"
, title =	"Efficient Computation of {Euclidean} Shortest Paths in the Plane"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"508--517"
, precedes =	"hs-oaesp-95"
, update =	"98.07 bibrelex, 97.11 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@article{hs-fsdsp-97
, author =	"John Hershberger and Subhash Suri"
, title =	"Finding a shortest diagonal of a simple polygon in linear time"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"149--160"
, update =	"97.03 devillers"
}

@inproceedings{hs-ftp-89
, author =	"J. Hershberger and Subhash Suri"
, title =	"Finding tailored partitions"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"255--265"
, precedes =	"hs-ftp-91"
, cites =	"abky-cabmm-88, a-dp-86, c-clps-85, j-nccog-82, ms-cscgl-84, ms-ppgmm-91, ol-mcp-81, ph-chfsp-77, ps-cgi-85, yb-cf-61, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{hs-ftp-91
, author =	"J. Hershberger and Subhash Suri"
, title =	"Finding tailored partitions"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"431--463"
, succeeds =	"hs-ftp-89"
, update =	"98.03 mitchell"
}

@inproceedings{hs-msspm-93
, author =	"J. Hershberger and Subhash Suri"
, title =	"Matrix Searching with the Shortest Path Metric"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '93"
, year =	1993
, pages =	"485--494"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 93.09 milone+mitchell"
}

@article{hs-msspm-97
, author =	"J. Hershberger and Subhash Suri"
, title =	"Matrix Searching with the Shortest Path Metric"
, journal =	"SIAM J. Comput."
, volume =	26
, number =	6
, month =	dec
, year =	1997
, pages =	"1612--1634"
, succeeds =	"hs-msspm-93"
, update =	"98.03 mitchell+smid"
}

@inproceedings{hs-mbt-95
, author =	"John Hershberger and Subhash Suri"
, title =	"Morphing Binary Trees"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"396--404"
, keywords =	"shape morphing, rotation distance, tree morphing"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@article{hs-olmpc-96
, author =	"J. Hershberger and Subhash Suri"
, title =	"Off-Line maintenance of planar configurations"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"453--475"
, keywords =	"dynamic convex hull"
, succeeds =	"hs-ompc-91"
, update =	"98.03 mitchell, 97.11 bibrelex, 97.03 smid"
}

@inproceedings{hs-ompc-91
, author =	"J. Hershberger and Subhash Suri"
, title =	"Offline maintenance of planar configurations"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"32--41"
, keywords =	"dynamic convex hull"
, update =	"98.03 mitchell"
, annote =	"$O(\log n)$ amortized time per operation"
}

@inproceedings{hs-pmasp-95
, author =	"John Hershberger and Subhash Suri"
, title =	"Practical Methods for Approximating Shortest Paths on a Convex Polytope in {$\Re^3$}"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"447--456"
, keywords =	"geodesic paths, shortest paths, approximation algorithm"
, precedes =	"hs-pmasp-98"
, update =	"98.03 mitchell, 96.09 agarwal, 96.05 mitchell"
}

@article{hs-pmasp-98
, author =	"John Hershberger and Subhash Suri"
, title =	"Practical Methods for Approximating Shortest Paths on a Convex Polytope in {$\Re^3$}"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, number =	1
, year =	1998
, pages =	"31--46"
, succeeds =	"hs-pmasp-95"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@techreport{hs-spp-96
, author =	"John Hershberger and Subhash Suri"
, title =	"Shortest path problems"
, type =	"Technical {Report}"
, institution =	"Washington University"
, year =	1996
, update =	"00.03 smid, 96.05 mitchell"
}

@phdthesis{h-easpv-87
, author =	"J. E. Hershberger"
, title =	"Efficient algorithms for shortest path and visibility problems"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, year =	1987
, note =	"Report STAN-CS-87-1163"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@article{hs-ealcd-98
, author =	"J. E. Hershberger and J. S. Snoeyink"
, title =	"Erased arrangements of lines and convex decompositions of polyhedra"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, year =	1998
, pages =	"129--143"
, update =	"98.03 agarwal+smid"
}

@inproceedings{h-cap-01
, author =	"Susan Hert"
, title =	"Connected Area Partitioning"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"35--38"
, update =	"01.04 icking"
}

@inproceedings{hhkps-aegk-01
, author =	"Susan Hert and Michael Hoffmann and Lutz Kettner and Sylvain Pion and Michael Seel"
, title =	"An Adaptable and Extensible Geometry Kernel"
, booktitle =	"Proc. Workshop on Algorithm Engineering"
, nickname =	"WAE '01"
, series =	"Lecture Notes Comput. Sci."
, volume =	2141
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"79--90"
, update =	"02.03 devillers"
}

@inproceedings{hl-dcptr-96
, author =	"S. Hert and V. Lumelsky"
, title =	"Deforming curves in the plane for tethered-robot motion planning"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"125--130"
, update =	"96.09 mitchell"
}

@article{hl-pcrtr-97
, author =	"S. Hert and V. Lumelsky"
, title =	"Planar curve routing for tethered-robot motion planning"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"225--252"
, update =	"97.07 devillers"
}

@article{hl-padmr-98
, author =	"S. Hert and V. Lumelsky"
, title =	"Polygon Area Decomposition for Multiple-Robot Workspace Division"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"437--466"
, update =	"98.11 devillers"
}

@inproceedings{h-eappk-90
, author =	"E. Hertel"
, title =	"{Einige} algorithmische {Probleme} in {Polyeder-} und {Konvexgeometrie}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	13
, update =	"00.03 bibrelex"
}

@techreport{h-atcha-83
, author =	"S. Hertel"
, title =	"An almost trivial convex hull algorithm for a presorted point set in the plane"
, type =	"Report"
, number =	"A83/08"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1983
}

@techreport{h-safpu-84
, author =	"S. Hertel"
, title =	"Sweep-{Algorithmen} f{\"u}r {Polygone} und {Polyeder}"
, type =	"Report"
, number =	"??"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1984
, update =	"94.05 devillers"
}

@article{hmmn-sssic-84
, author =	"S. Hertel and M. M{\"a}ntyl{\"a} and K. Mehlhorn and J. Nievergelt"
, title =	"Space sweep solves intersection of convex polyhedra"
, journal =	"Acta Inform."
, volume =	21
, year =	1984
, pages =	"501--519"
}

@inproceedings{hm-ftsp-83
, author =	"S. Hertel and K. Mehlhorn"
, title =	"Fast triangulation of simple polygons"
, booktitle =	"Proc. 4th Internat. Conf. Found. Comput. Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	158
, publisher =	"Springer-Verlag"
, year =	1983
, pages =	"207--218"
, precedes =	"hm-ftprs-85"
}

@article{hm-ftprs-85
, author =	"S. Hertel and K. Mehlhorn"
, title =	"Fast triangulation of the plane with respect to simple polygons"
, journal =	"Inform. Control"
, volume =	64
, year =	1985
, pages =	"52--76"
, succeeds =	"hm-ftsp-83"
}

@techreport{h-tkfeb-93
, author =	"P. Hertling"
, title =	"Topologische Komplexit{\"a}tsgrade von Funktionen mit endlichem Bild"
, type =	"Report"
, number =	152
, institution =	"Fernuniversit{\"a}t"
, address =	"Hagen"
, year =	1993
, update =	"98.11 bibrelex"
}

@inproceedings{hw-ldelc-94
, author =	"P. Hertling and K. Weihrauch"
, title =	"Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"237--242"
, cites =	"a-ca-80, bb-ca-85, bss-tccrn-89, g-dcrcf-57, gy-frcg-86, gss-egbra-89, h-tkfeb-93, hhk-tirgc-88, k-ctrf-91, m-vigau-88a, pr-cap-88, ps-cgi-85, sh-gip-76, s-ta-87, s-aefsm-87, w-c-87, wk-uacra-84, y-stgd-90, h-pargc-89, td-cm-88, v-cdsmt-92, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@book{hkp-itnc-91
, author =	"J. Hertz and A. Krogh and R. G. Palmer"
, title =	"Introduction to the Theory of Neural Computation"
, publisher =	"Addison-Wesley"
, address =	"New York"
, year =	1991
, update =	"00.03 bibrelex"
}

@article{hb-atdis-87
, author =	"B. Von Herzen and A. H. Barr"
, title =	"Accurate triangulations of deformed, intersecting surfaces"
, journal =	"Comput. Graph."
, volume =	21
, number =	4
, month =	jul
, year =	1987
, pages =	"103--110"
, update =	"96.09 devillers, 95.01 mitchell"
}

@article{hs-pvnlp-71
, author =	"F. Herzog and B. M. Steward"
, title =	"Patterns of visible and nonvisible lattice points"
, journal =	"Amer. Math. Monthly"
, volume =	78
, year =	1971
, pages =	"487--496"
, update =	"97.11 bibrelex"
}

@book{hs-cagcu-84
, author =	"D. Hestenes and G. Sobczyk"
, title =	"Clifford algebra to geometric calculus: {A} unified language for mathematics and physics"
, publisher =	"D. Reidel Publishing Co."
, address =	"Dodrecht"
, year =	1984
, update =	"98.03 bibrelex"
}

@book{h-cvoct-66
, author =	"M. R. Hestens"
, title =	"Calculus of Variations and Optimal Control Theory"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1966
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{h-srcc-95
, author =	"G. Hetyai"
, title =	"On the {Stanley} ring of a cubical complex"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"305--330"
, update =	"97.11 bibrelex"
}

@inproceedings{h-bvb-89
, author =	"H. Heusinger"
, title =	"{Balancierung} von {Voronoi}-{B{\"a}umen}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{hn-src-88
, author =	"H. Heusinger and H. Noltemeier"
, title =	"On separable and rectangular clusterings"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"25--42"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@article{hn-sc-89
, author =	"H. Heusinger and H. Noltemeier"
, title =	"On separable clusterings"
, journal =	"J. Algorithms"
, volume =	10
, year =	1989
, pages =	"212--227"
, update =	"00.03 bibrelex"
}

@techreport{h-oafms-83
, author =	"P. T. Highnam"
, title =	"An optimal algorithm for finding the mirror symmetries of a planar point set"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1983
}

@techreport{h-oafsp-85
, author =	"P. T. Highnam"
, title =	"Optimal algorithms for finding the symmetries of a planar point set"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1985
}

@article{h-oafsp-86
, author =	"P. T. Highnam"
, title =	"Optimal Algorithms for Finding the Symmetries of a Planar Point Set"
, journal =	"Inform. Process. Lett."
, volume =	22
, year =	1986
, pages =	"219--222"
, update =	"98.03 bibrelex"
}

@article{h-ep-82
, author =	"P. T. Highnam"
, title =	"The ears of a polygon"
, journal =	"Inform. Process. Lett."
, volume =	15
, number =	5
, year =	1982
, pages =	"196--198"
, keywords =	"two-dimensional, triangles, reporting, counting, triangulation, polygons"
}

@inproceedings{hpr-irslp-92
, author =	"W. L. Hightower and J. F. Prins and J. H. Reif"
, title =	"Implementation of randomized sorting on large parallel machines"
, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
, year =	1992
, pages =	"158--167"
, update =	"96.09 orourke"
}

@book{h-fggdg-71
, author =	"D. Hilbert"
, title =	"Foundations of Geometry (Grundlagen der Geometrie)"
, publisher =	"Open Court"
, year =	1971
, note =	"Tr. by Leo Unger"
, update =	"93.09 erickson"
}

@book{hc-gi-52
, author =	"D. Hilbert and S. {Cohn-Vossen}"
, title =	"Geometry and the Imagination"
, publisher =	"Chelsea Publishing Company"
, address =	"New York, NY"
, year =	1952
, update =	"98.03 bibrelex"
}

@article{h-cdtdp-81
, author =	"R. Hilbert"
, title =	"Construction and display of three-dimensional polygon-histograms"
, journal =	"Comput. Graph."
, volume =	15
, number =	3
, year =	1981
, pages =	"230--241"
, note =	"Proc. SIGGRAPH '81"
}

@article{h-trpsp-72
, author =	"J. Hilden"
, title =	"Testing the relative position of several points on a circle"
, journal =	"BIT"
, volume =	12
, year =	1972
, pages =	"182--187"
}

@incollection{h-ppdp-94
, author =	"F. S. {Hill Jr.}"
, title =	"The Pleasures of ``Perp Dot'' Products"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"138--148"
, keywords =	"geometry, fillet, perp-dot product, projection"
, update =	"94.09 heckbert"
, annote =	"A tutorial on the ``perp dot product,'' which is the dot
product, in 2D, of one vector and the vector perpendicular to another."
}

@techreport{h-ebnef-81
, author =	"M. D. Hill"
, title =	"An examination of the bounds of the number of edges and faces of a simple polyhedron (rough draft)"
, type =	"Manuscript"
, institution =	"??"
, year =	1981
}

@techreport{h-tdp-81
, author =	"M. D. Hill"
, title =	"Tetrahedral decomposition of polyhedra"
, type =	"Manuscript"
, institution =	"??"
, address =	"Ann Arbor, MI"
, year =	1981
}

@incollection{h-tli-94
, author =	"Steve Hill"
, title =	"Tri-linear Interpolation"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"521--525"
, keywords =	"trilinear interpolation, bilinear interpolation, reconstruction"
, update =	"94.09 heckbert"
, annote =	"Gives optimized code for performing linear interpolation
in a 3D grid. Trilinear interpolation is useful for volume rendering, and
its 2D variant, bilinear interpolation, is a very common operation in image
processing. Contains C code."
}

@techreport{h-dwgsa-72
, author =	"T. W. {Hill, Jr.}"
, title =	"On Determining When a Graph Is The Skeleton Of an Abstract Polytope"
, type =	"Research Memorandum"
, number =	"72-4"
, institution =	"School of Industrial Engineering, Purdue University"
, address =	"West Lafayette, IN"
, year =	1972
, update =	"96.05 pascucci"
}

@book{hhp-mr-97
, author =	"Peter Hilton and Derek Holton and Jean Pedersen"
, title =	"Mathematical Reflections: In a Room with Many Mirrors"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1997
, update =	"02.03 icking, 01.11 orourke"
}

@techreport{h-celag-94
, author =	"M. Himsolt"
, title =	"Comparing and Evaluating Layout Algorithms within GraphEd"
, type =	"Manuscript"
, institution =	"Fakultat fur Mathematik und Informatik, Univ. Passau"
, year =	1994
, url =	"ftp://ftp.uni-passau.de/pub/local/graphed/papers/LayoutEvaluation.ps.Z"
, update =	"95.01 tamassia"
}

@article{h-celag-95
, author =	"M. Himsolt"
, title =	"Comparing and Evaluating Layout Algorithms within {GraphEd}"
, journal =	"J. Visual Lang. Comput."
, volume =	6
, number =	3
, year =	1995
, pages =	"255--273"
, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
, keywords =	"graph drawing, experiments"
, update =	"97.03 tamassia, 95.09 agarwal+devillers, 95.05 tamassia"
}

@techreport{h-ggml-96
, author =	"M. Himsolt"
, title =	"GML: Graph Modelling Language"
, type =	"Manuscript"
, institution =	"Universit{\"a}t Passau, Innstra\ss e 33, 94030 Passau, Germany"
, year =	1996
, url =	"http://www.uni-passau.de/~himsolt/Graphlet/GML"
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@inproceedings{h-ggpig-95
, author =	"M. Himsolt"
, title =	"{GraphEd}: a Graphical Platform for the Implementation of Graph Algorithms"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"182--193"
, keywords =	"graph drawing, system, grammar"
, update =	"95.01 tamassia"
}

@inproceedings{h-gige-89
, author =	"M. Himsolt"
, title =	"GraphEd: An Interactive Graph Editor"
, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	349
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"532--533"
, keywords =	"graph drawing"
, comments =	"Software in \url{ftp://ftp.uni-passau.de/pub/local/graphed}"
, update =	"99.11 bibrelex, 96.09 agarwal, 94.09 jones, 93.09 tamassia"
}

@article{hm-mcedr-80
, author =	"A. L. Hinde and R. E. Miles"
, title =	"{Monte}-{Carlo} Estimates of the Distributions of the Random Polygons of the {Voronoi} Tesselation With Respect to a {Poisson} Process"
, journal =	"Journal of Statistics and Computer Simulation"
, volume =	10
, year =	1980
, pages =	"205--223"
, annote =	"Measurements of various statistics of two million
		 independent Voronoi polygons. Circumcircle algorithm
		 used to generate (one polygon)."
}

@inproceedings{hkm-alsiq-96
, author =	"Andr{\'e} Hinkenjann and Markus Kukuk and Heinrich M{\"u}ller"
, title =	"Answering Line Segment Intersection Queries Based on Sample Answers"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"65--68"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{h-oscps-95
, author =	"Klaus Hinrichs"
, title =	"Overlaying Simply Connected Planar Subdivision in Linear Time"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	31
, update =	"00.03 bibrelex"
}

@inproceedings{hn-gfdsd-83
, author =	"K. Hinrichs and J. Nievergelt"
, title =	"The grid file: a data structure designed to support proximity queries on spatial objects"
, editor =	"M. Nagl and J. Perl"
, booktitle =	"Proc. 9th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '83"
, publisher =	"Trauner Verlag"
, address =	"Linz, Austria"
, year =	1983
, pages =	"100--113"
, update =	"98.07 bibrelex"
}

@inproceedings{hns-saiia-89
, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
, title =	"A sweep algorithm and its implementation: {The} all-nearest-neighbors problem revisited"
, editor =	"J. van Leuuwen"
, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput."
, site =	"Amsterdam, Netherlands"
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, publisher =	"Springer-Verlag"
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{hns-saann-88
, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
, title =	"A sweep algorithm for the all-nearest-neighbours problem"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"43--54"
, keywords =	"proximity, points, two-dimensional, plane-sweep"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@article{hns-arsa2-92
, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
, title =	"An all-round sweep algorithm for $2$-dimensional nearest-neighbors problems"
, journal =	"Acta Inform."
, volume =	29
, number =	4
, year =	1992
, pages =	"383--394"
, update =	"98.11 bibrelex, 97.11 smid"
}

@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"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"343--346"
, cites =	"f-savd-87, hns-saiia-89, v-oaann-89, ZZZ"
, update =	"98.07 bibrelex"
}

@article{hns-psscp-88
, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
, title =	"Plane-sweep solves the closest pair problem elegantly"
, journal =	"Inform. Process. Lett."
, volume =	26
, year =	1988
, pages =	"255--261"
}

@proceedings{h-ewcg-96
, title =	"Abstracts 12th European Workshop Comput. Geom."
, editor =	"Klaus H. Hinrichs"
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, volume =	"7/96-I"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, update =	"00.03 bibrelex"
}

@proceedings{h-iwcg-90
, title =	"Abstracts 6th Intern. Workshop Comput. Geom."
, editor =	"Klaus H. Hinrichs"
, nickname =	"CG '90"
, site =	"Siegen"
, series =	"Informatik-Berichte"
, volume =	"90-01"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, update =	"00.03 bibrelex"
}

@phdthesis{h-gfsic-85
, author =	"K. H. Hinrichs"
, title =	"The grid file system: {I}mplementation and case studies of applications"
, school =	"Dept. Information Science, ETH"
, address =	"Z{\"u}rich"
, year =	1985
, keywords =	"doctoral thesis"
, comments =	"Diss. ETH 7734"
, update =	"97.07 agarwal"
}

@inproceedings{h-ugigf-88
, author =	"H. Hinterberger"
, title =	"Using graphical information from a grid file's directory to visualize patterns in {Cartesian} product spaces"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"1--14"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@techreport{hikl-hfplf-97
, author =	"Christoph Hipke and Christian Icking and Rolf Klein and Elmar Langetepe"
, title =	"How to Find a Point on a Line within a Fixed Distance"
, number =	220
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1997
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr220.pdf"
, precedes =	"hikl-hfplf-99"
, cites =	"bcr-sp-93, brs-nugt-97, ik-csas-95, kp-caasu-93, krt-sueor-96, k-ag-97, ls-pinos-97, ZZZ"
, update =	"00.03 bibrelex, 99.07 bibrelex, 98.07 icking"
}

@article{hikl-hfplf-99
, author =	"Christoph Hipke and Christian Icking and Rolf Klein and Elmar Langetepe"
, title =	"How to Find a Point on a Line within a Fixed Distance"
, journal =	"Discrete Appl. Math."
, volume =	93
, year =	1999
, pages =	"67--73"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr220.pdf"
, succeeds =	"hikl-hfplf-97"
, cites =	"bcr-sp-93, brs-nugt-97, ik-csas-95, kp-caasu-93, krt-sueor-96, k-ag-97, ls-pinos-97, ZZZ"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@incollection{h-dpos-51
, author =	"T. Hiraguchi"
, title =	"On the dimension of partially ordered sets"
, booktitle =	"Scientific {Report} 1"
, publisher =	"Kanzawa University"
, year =	1951
, pages =	"77--94"
, update =	"94.05 franciosa"
}

@inproceedings{hmtt-cpics-92
, author =	"T. Hirata and J. Matou{\v s}ek and X.-H. Tan and T. Tokuyama"
, title =	"Complexity of projected images of convex subdivisions"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"121--126"
, precedes =	"hmtt-cpics-94"
, cites =	"abe-ap1sp-91, ce-oails-88, c-sssl-86, dl-msp-76, e-acg-87, s-nvapo-91, s-chdch-86, s-lpchm-90, thi-splia-90, ZZZ"
, update =	"98.07 bibrelex, 96.09 agarwal+devillers"
}

@article{hmtt-cpics-94
, author =	"T. Hirata and J. Matou{\v s}ek and X.-H. Tan and T. Tokuyama"
, title =	"Complexity of projected images of convex subdivisions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"293--308"
, succeeds =	"hmtt-cpics-92"
, update =	"96.09 devillers"
}

@article{hk-gsftq-91
, author =	"S. Hirose and O. Kunieda"
, title =	"Generalized standard foot trajectory for a quadruped walking vehicle"
, journal =	"Internat. J. Robot. Res."
, volume =	10
, number =	1
, month =	feb
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{hnku-agcqw-84
, author =	"S. Hirose and M. Nose and H. Kikuchi and Y. Umetani"
, title =	"Adaptive gait control of a quadruped walking vehicle"
, booktitle =	"Proc. Internat. Sympos. Robot. Res."
, publisher =	"MIT Press"
, year =	1984
, pages =	"253--277"
, update =	"97.11 bibrelex"
}

@techreport{hs-ptard-94
, author =	"Tetsuya Hiroshima and Kokichi Sugihara"
, title =	"Polynomial-Time Algorithm for Recognizing {Delaunay} Graphs"
, number =	"{METR}~94-15"
, institution =	"Department of Mathematical Engineering and Information Physics, University of Tokyo"
, month =	sep
, year =	1994
, update =	"98.07 tamassia+vismara"
}

@book{h-dt-76
, author =	"M. W. Hirsch"
, title =	"Differential Topology"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1976
, update =	"98.03 bibrelex"
}

@article{h-cssv-80
, author =	"D. S. Hirschberg"
, title =	"On the complexity of searching a set of vectors"
, journal =	"SIAM J. Comput."
, volume =	9
, year =	1980
, pages =	"126--129"
}

@article{hl-tp-92
, author =	"D. S. Hirschberg and L. L. Larmore"
, title =	"The traveler's problem"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"148--160"
}

@article{hv-iuq-87
, author =	"D. S. Hirschberg and D. J. Volper"
, title =	"Improved update/query"
, journal =	"Inform. Process. Lett."
, volume =	24
, year =	1987
, pages =	"307--310"
}

@inproceedings{h-adshf-95
, author =	"N. Hitschfeld"
, title =	"Algorithms and Data Structures for Handling a Fully Flexible Refinement Approach in Mesh Generation"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"265--276"
, update =	"96.01 samitchell"
}

@inproceedings{hf-1ietm-96
, author =	"Nancy Hitschfeld and Rodrigo Farias"
, title =	"1-irregular element tessellation in mixed element meshes for the control volume discretization method"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"195--204"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{hf-metgm-92
, author =	"Nancy Hitschfeld and Wolfgang Fichtner"
, title =	"Mixed Element Trees: A Generalization of Modified Octrees for the Generation of {3-D} {Delaunay} Meshes"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"85--87"
, update =	"00.03 bibrelex"
}

@inproceedings{hs-dsufp-98
, author =	"Hisamoto Hiyoshi and Hiroshi Sekigawa"
, title =	"Deciding the Sign Using Floating-Point Arithmetic"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"89--91"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{hs-vbihc-00
, author =	"Hisamoto Hiyoshi and Kokichi Sugihara"
, title =	"Voronoi-Based Interpolation with Higher Continuity"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"242--250"
, update =	"00.11 jones"
}

@inproceedings{hs-rsd-95
, author =	"G. R. Hjaltason and H. Samet"
, title =	"Ranking in spatial databases"
, editor =	"M. J. Egenhofer and J. R. Herring"
, booktitle =	"Advances in Spatial Databases - Fourth International Symposium"
, site =	"Portland, ME"
, series =	"Lecture Notes Comput. Sci."
, number =	951
, month =	aug
, year =	1995
, pages =	"83--95"
, update =	"96.05 efrat"
}

@inproceedings{h-tgub-97
, author =	"Petr Hlin{\v e}n{\'y}"
, title =	"Touching Graphs of Unit Balls"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"350--358"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@techreport{hy-prsts-87
, author =	"C. Ho and C. K. Yap"
, title =	"Polynomial Remainder Sequences and Theory of Subresultants"
, type =	"Technical {Report}"
, number =	319
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1987
, note =	"Robotics Report No. 119"
, update =	"97.11 bibrelex"
}

@inproceedings{hams-rqodc-97
, author =	"C.-T. Ho and R. Agrawal and N. Megiddo and R. Srikant"
, title =	"Range queries in {OLAP} data cubes"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1997
, pages =	"73--88"
, update =	"97.07 agarwal"
}

@inproceedings{hba-psqod-97
, author =	"C.-T. Ho and J. Bruck and R. Agrawal"
, title =	"Partial-sum queries in {OLAP} data cubes using covering codes"
, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
, year =	1997
, pages =	"228--237"
, update =	"97.07 agarwal"
}

@article{h-dpt-76
, author =	"C.-W. Ho"
, title =	"Decomposition of a polygon into triangles"
, journal =	"Math. Gazette"
, volume =	60
, year =	1976
, pages =	"132--134"
, keywords =	"decomposition, polygon triangulation, elementary geometry"
, cites =	"l-tsfpp-11"
, annote =	"A short correct proof of decomposability."
}

@inproceedings{hkms-aromt-92
, author =	"J. M. Ho and M. T. Ko and T. H. Ma and T. Y. Sung"
, title =	"Algorithms for Rectilinear Optimal Multicast Tree Problem"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"106--115"
, update =	"94.09 smid, 93.09 milone+mitchell"
}

@inproceedings{hlcw-bdmst-89
, author =	"J.-M. Ho and D. T. Lee and C.-H. Chang and C. K. Wong"
, title =	"Bounded-diameter minimum spanning trees and related problems"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"276--282"
, precedes =	"hlcw-mdstr-91"
, cites =	"ct-fmst-76, d-ltatt-84, egs-oplms-86, gj-cigtn-79, gkln-dvd-83, k-osps-83, l-fnvda-80, m-ltalp-83, p-nappl-81, p-scnsg-57, sh-cpp-75, ZZZ"
, update =	"98.03 bibrelex"
}

@article{hlcw-mdstr-91
, author =	"J.-M. Ho and D. T. Lee and C.-H. Chang and C. K. Wong"
, title =	"Minimum diameter spanning trees and related problems"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"987--997"
, keywords =	"design of algorithms, geometric graphs, two-dimensional, minimum spanning trees, Steiner trees, NP-completeness"
, succeeds =	"hlcw-bdmst-89"
}

@article{hvw-narst-90
, author =	"J.-M. Ho and G. Vijayan and C. K. Wong"
, title =	"New algorithms for the rectilinear {Steiner} tree problem"
, journal =	"IEEE Trans. Comput. Aided Design"
, volume =	9
, year =	1990
, pages =	"185--193"
, update =	"98.03 bibrelex"
}

@article{h-femgm-88
, author =	"K. Ho-Le"
, title =	"Finite Element Mesh Generation Methods: {A} Review And Classification"
, journal =	"Comput. Aided Design"
, volume =	20
, number =	1
, month =	jan
, year =	1988
, pages =	"27--38"
, keywords =	"finite element mesh generation methods, Delaunay triangulation, mesh topology, Voronoi diagram"
, annote =	"Good survey paper."
, abstract =	"An attempt is made to provide a clear overall picture
		 of the finite element mesh generation field. A scheme
		 for classifying mesh generation methods is proposed,
		 whereby seven major mesh generation approaches are
		 identified. The basis for classification is the
		 temporal order in which nodes and elements are created.
		 The published mesh generation methods are reviewed.
		 Only four approaches are found to have fully automatic
		 mesh generation methods. These approaches are compared
		 on the criteria of element types and shapes, mesh
		 density control, and time efficiency. (Author abstract)
		 73 refs."
}

@techreport{h-psifp-93
, author =	"J. Hobby"
, title =	"Practical segment intersection with finite precision output"
, type =	"Technical {Report}"
, number =	"93/2-27"
, institution =	"Bell Laboratories"
, year =	1993
, update =	"98.07 bibrelex"
}

@unpublished{h-psifp-94
, author =	"J. Hobby"
, title =	"Practical segment intersection with finite precision output"
, year =	1994
, note =	"Manuscript"
, update =	"97.11 bibrelex"
}

@inproceedings{h-patmn-93
, author =	"J. D. Hobby"
, title =	"Polygonal Approximations that Minimize the Number of Inflections"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"93--102"
, update =	"93.05 smid"
}

@article{h-psifp-99
, author =	"J. D. Hobby"
, title =	"Practical Segment Intersection with Finite Precision Output"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, number =	4
, month =	oct
, year =	1999
, pages =	"199--214"
, update =	"00.03 held+smid"
}

@article{h-rccw-89
, author =	"J. D. Hobby"
, title =	"Rasterizing curves of constant width"
, journal =	"J. ACM"
, volume =	36
, year =	1989
, pages =	"209--229"
}

@article{h-secis-86
, author =	"J. D. Hobby"
, title =	"Smooth, easy to compute interpolating splines"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"123--140"
}

@book{h-apncp-97
, title =	"Approximation Problems for {NP}-Complete Problems"
, editor =	"Dorit Hochbaum"
, publisher =	"PWS Publishing Company"
, address =	"Boston, MA"
, year =	1997
, update =	"98.03 mitchell"
}

@article{h-aascv-82
, author =	"D. S. Hochbaum"
, title =	"Approximation algorithms of the set covering and vertex cover problems"
, journal =	"SIAM J. Comput."
, volume =	11
, number =	3
, year =	1982
, pages =	"555--556"
, update =	"97.11 bibrelex"
}

@article{h-ebssv-83
, author =	"Dorit S. Hochbaum"
, title =	"Efficient Bounds for the Stable Set, Vertex Cover and Set Packing Problems"
, journal =	"Discrete Appl. Math."
, volume =	6
, year =	1983
, pages =	"243--254"
, update =	"98.07 bibrelex"
}

@article{hm-ascpp-85
, author =	"D. S. Hochbaum and W. Maas"
, title =	"Approximation schemes for covering and packing problems in image processing and {VLSI}"
, journal =	"J. ACM"
, volume =	32
, year =	1985
, pages =	"130--136"
, update =	"96.09 orourke"
}

@techreport{hm-aacpp-84
, author =	"D. S. Hochbaum and W. Maass"
, title =	"Approximation algorithms for covering and packing problems in robotics"
, type =	"Report"
, number =	"??"
, institution =	"Univ. California Berkeley"
, address =	"Berkeley, CA"
, year =	1984
, update =	"94.01 rote"
}

@article{hm-faanc-87
, author =	"D. S. Hochbaum and W. Maass"
, title =	"Fast approximation algorithms for a nonconvex covering problem"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"305--323"
, update =	"94.01 rote"
}

@article{hs-bphkc-85
, author =	"D. S. Hochbaum and D. Shmoys"
, title =	"A best possible heuristic for the $k$-center problem"
, journal =	"Math. Oper. Res."
, volume =	10
, year =	1985
, pages =	"180--184"
, update =	"96.05 agarwal"
}

@article{hs-uaaab-86
, author =	"D. S. Hochbaum and D. Shmoys"
, title =	"A unified approach to approximation algorithms for bottleneck problems"
, journal =	"J. ACM"
, volume =	33
, year =	1986
, pages =	"533--550"
, update =	"96.05 agarwal"
}

@article{hrb-sicm-93
, author =	"R. J. Hocken and J. Raja and U. Babu"
, title =	"Sampling issues in coordinate metrology"
, journal =	"Manufacturing Review"
, volume =	6
, number =	4
, year =	1993
, pages =	"282--294"
, update =	"97.03 agarwal"
}

@book{hy-t-61
, author =	"J. G. Hocking and G. S. Young"
, title =	"Topology"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1961
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@techreport{h-sg-85
, author =	"L. Hodes"
, title =	"Sphere graphs"
, type =	"Report"
, number =	"??"
, institution =	"National Cancer Inst."
, address =	"Bethseda, MD"
, year =	1985
}

@inproceedings{h-lcgpp-69
, author =	"L. Hodes"
, title =	"The logical complexity of geometric properties in the plane"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Theory Comput."
, year =	1969
, pages =	"249--254"
, precedes =	"h-lcgpp-70"
}

@article{h-lcgpp-70
, author =	"L. Hodes"
, title =	"The logical complexity of geometric properties in the plane"
, journal =	"J. ACM"
, volume =	17
, year =	1970
, pages =	"339--347"
, succeeds =	"h-lcgpp-69"
}

@book{hp-mag-52
, author =	"W. V. D. Hodge and D. Pedoe"
, title =	"Methods of algebraic geometry"
, publisher =	"Cambridge University Press"
, year =	1952
, update =	"97.11 bibrelex"
}

@article{hwbo-aha-95
, author =	"J. K. Hodgins and W. L. Wooten and D. C. Brogan and J. F. O'Brien"
, title =	"Animating human atheletics"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1995
, pages =	"71--78"
, note =	"Proc. SIGGRAPH"
, update =	"97.11 bibrelex"
}

@article{hr-cccph-93
, author =	"C. D. Hodgson and I. Rivin"
, title =	"A characterization of compact convex polyhedra in hyperbolic 3-space"
, journal =	"Inventiones Mathematicae"
, volume =	111
, number =	1
, month =	jan
, year =	1993
, pages =	"77--111"
, update =	"98.11 bibrelex"
}

@article{hrs-cchpc-92
, author =	"C. D. Hodgson and I. Rivin and W. D. Smith"
, title =	"A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere"
, journal =	"Bull. (New Series) of the AMS"
, volume =	27
, number =	2
, year =	1992
, pages =	"246--251"
, keywords =	"graph drawing, convex, 3D"
, update =	"98.07 tamassia+vismara, 96.09 tamassia"
, annote =	"Erratum in 28(1):213, 1993"
}

@article{hrs-ecchpcpis-93
, author =	"C. D. Hodgson and I. Rivin and W. D. Smith"
, title =	"Erratum ({A} Characterization of Convex Hyperbolic Polyhedra and of Convex Polyhedra Inscribed in the Sphere)"
, journal =	"Bull. Amer. Math. Soc. (New Series)"
, volume =	28
, number =	1
, year =	1993
, pages =	213
, update =	"98.07 tamassia+vismara"
}

@techreport{hs-adpso-94
, author =	"E. Hoel and H. Samet"
, title =	"Algorithms for data-parallel spatial operations"
, type =	"Computer Science Department"
, number =	"CAR-TR-704"
, institution =	"University of Maryland"
, month =	feb
, year =	1994
, update =	"96.05 efrat"
}

@inproceedings{hs-dpsja-94
, author =	"E. Hoel and H. Samet"
, title =	"Data-Parallel Spatial Join Algorithms"
, booktitle =	"Proc. 23rd Internat. Conf. Parallel Process."
, site =	"St. Charles, Illinois"
, month =	aug
, year =	1994
, pages =	"227--234"
, update =	"96.05 efrat"
}

@inproceedings{hs-pdpso-94
, author =	"E. Hoel and H. Samet"
, title =	"Performance of Data-Parallel Spatial Operations"
, editor =	"J. Bocca and M. Jarke and C. Zaniolo"
, booktitle =	"vldb94"
, site =	"Santiago, Chile"
, month =	sep
, year =	1994
, pages =	"156--167"
, update =	"96.05 efrat"
}

@inproceedings{hs-qcsds-92
, author =	"E. G. Hoel and H. Samet"
, title =	"A qualitative comparison study of data structures for large line segment databases"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, site =	"San Diego"
, year =	1992
, pages =	"205--214"
, update =	"97.07 agarwal, 96.05 efrat"
}

@inproceedings{hs-bsjos-95
, author =	"E. G. Hoel and H. Samet"
, title =	"Benchmarking Spatial Join Operations with Spatial Output"
, editor =	"U. Dayal and P. M. D. Gray and S. Nishio"
, booktitle =	"Proceedings of the Twenty First International Conference on Very Large Data Bases"
, site =	"Zurich"
, month =	sep
, year =	1995
, pages =	"606--618"
, update =	"96.05 efrat"
}

@inproceedings{hs-dppso-icpr-95
, author =	"E. G. Hoel and H. Samet"
, title =	"Data-Parallel Primitives for Spatial Operations"
, booktitle =	"Proc. 24th Internat. Conf. Parallel Process."
, site =	"Oconomowoc, WI"
, volume =	3
, month =	aug
, year =	1995
, pages =	"184--191"
, update =	"96.05 efrat"
}

@inproceedings{hs-dppso-camp-95
, author =	"E. G. Hoel and H. Samet"
, title =	"Data-Parallel Primitives for Spatial Operations Using PM Quadtrees"
, editor =	"V. Cantoni and L. Lombardi and M. Mosconi and M. Savini and A. Setti"
, booktitle =	"Proceedings of Computer Architectures for Machine Perception '95"
, site =	"Como, Italy"
, month =	sep
, year =	1995
, pages =	"266--273"
, update =	"96.05 efrat"
}

@inproceedings{hs-dprta-93
, author =	"E. G. Hoel and H. Samet"
, title =	"Data-Parallel R-tree Algorithms"
, booktitle =	"Proc. 22nd Internat. Conf. Parallel Process."
, nickname =	"ICPP '93"
, site =	"St. Charles, IL"
, month =	aug
, year =	1993
, pages =	"47--50"
, update =	"98.07 bibrelex, 96.05 efrat"
}

@incollection{hs-epsql-91
, author =	"E. G. Hoel and H. Samet"
, title =	"Efficient processing of spatial queries in line segment databases"
, editor =	"O. G{\"u}nther and H. J. Schek"
, booktitle =	"Proc. 2rd Sympos. Advances in Spatial Databases"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1991
, pages =	"237--256"
, comments =	"also Lecture Notes in Computer Science 525"
, update =	"96.09 agarwal, 96.05 efrat"
}

@inproceedings{hkf-dsc-96
, author =	"Werner Hoelbling and Werner Kuhn and Andrew U. Frank"
, title =	"Discrete Simplicial Complexes"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	69
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{hcklm-fcgvd-00
, author =	"Kenneth E. {Hoff III} and Tim Culver and John Keyser and Ming Lin and Dinesh Manocha"
, title =	"Fast Computation of Generalized {Voronoi} Diagrams Using Graphics Hardware"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"375--376"
, keywords =	"video review"
, update =	"00.11 jones"
}

@article{h-bchn-79
, author =	"A. J. Hoffman"
, title =	"Binding constraints and {Helly} numbers"
, journal =	"Ann. New York Acad. Sci."
, volume =	319
, year =	1979
, pages =	"284--288"
, update =	"98.03 bibrelex"
}

@article{hl-cnc-86
, author =	"A. J. Hoffman and C. W. Lee"
, title =	"On the cone of nonnegative circuits"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"229--239"
}

@article{hh-gpbs-88
, author =	"C. Hoffman and J. Hopcroft"
, title =	"The geometry of projective blending surfaces"
, journal =	"Artif. Intell."
, volume =	37
, year =	1988
, pages =	"357--376"
, update =	"98.07 bibrelex"
}

@book{h-mf-87
, author =	"E. G. Hoffman"
, title =	"Modular Fixturing"
, publisher =	"Manufacturing Technology Press"
, address =	"Lake Geneva, Wisconsin"
, year =	1987
, update =	"98.03 bibrelex"
}

@article{h-dpsi-90
, author =	"C. Hoffmann"
, title =	"A dimensionality paradigm for surface interrogations"
, journal =	"Comput. Aided Geom. Design"
, volume =	7
, number =	6
, year =	1990
, pages =	"517--532"
, update =	"98.07 bibrelex"
}

@book{h-gsm-89
, author =	"C. Hoffmann"
, title =	"Geometric and Solid Modeling"
, publisher =	"Morgan-Kaufmann"
, address =	"San Mateo, CA"
, year =	1989
, update =	"97.03 schwarzkopf, 93.05 orourke"
}

@article{hh-asgca-85a
, author =	"C. Hoffmann and J. Hopcroft"
, title =	"Automatic Surface Generation in Computer Aided Design"
, journal =	"Visual Comput."
, volume =	1
, number =	2
, year =	1985
, pages =	"92--100"
, update =	"98.03 bibrelex"
}

@techreport{hh-gabr-86
, author =	"C. Hoffmann and J. Hopcroft"
, title =	"Geometric Ambiguities in Boundary Representation"
, number =	"86-725"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1986
, update =	"98.03 bibrelex"
}

@techreport{h-ac-85
, author =	"C. M. Hoffmann"
, title =	"Algebraic Curves"
, number =	"CSD-TR-675"
, institution =	"Computer Science Department, Purdue University"
, year =	1985
, update =	"98.03 bibrelex"
}

@techreport{h-cvdgc-91
, author =	"C. M. Hoffmann"
, title =	"Computer Vision, Descriptive Geometry, and Classical Mechanics"
, number =	"CSD-TR-91-073"
, institution =	"Purdue University, CS Dept., West Lafayette, IN 47907, USA"
, month =	oct
, year =	1991
, keywords =	"skeleton, Voronoi diagram, offsetting"
, update =	"93.09 held"
}

@techreport{h-gamg-93
, author =	"C. M. Hoffmann"
, title =	"Geometric Approaches to Mesh Generation"
, number =	"CSD-TR-93-053"
, institution =	"CS Dept., Purdue U., West Lafayette, IN 48907, USA"
, month =	aug
, year =	1993
, update =	"95.01 held"
}

@inproceedings{h-hsism-96
, author =	"C. M. Hoffmann"
, title =	"How solid is solid modeling?"
, editor =	"M. C. Lina and D. Manocha"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"1--8"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@techreport{h-hcsco-90t
, author =	"C. M. Hoffmann"
, title =	"How to Construct the Skeleton of {CSG} Objects"
, type =	"Technical Report"
, number =	"CSD-TR-1014"
, institution =	"CS Dept., Purdue Univ."
, address =	"West Lafayette, IN 47907, USA"
, month =	sep
, year =	1990
, precedes =	"h-hcsco-90"
, update =	"98.11 bibrelex"
}

@inproceedings{h-hcsco-90
, author =	"C. M. Hoffmann"
, title =	"How to Construct the Skeleton of {CSG} Objects"
, booktitle =	"Proc. 4th IMA Conf. on The Mathematics of Surfaces"
, publisher =	"Oxford University Press"
, address =	"Bath, UK"
, year =	1990
, pages =	"??"
, succeeds =	"h-hcsco-90t"
, update =	"98.11 bibrelex, 93.09 held"
}

@inproceedings{h-sggr-93
, author =	"C. M. Hoffmann"
, title =	"On semantics of generative geometry representations"
, booktitle =	"Proc. 19th ASME Design Automation Conference"
, year =	1993
, pages =	"411--420"
, update =	"98.07 bibrelex"
}

@incollection{h-sm-97
, author =	"C. M. Hoffmann"
, title =	"Solid modeling"
, chapter =	47
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"863--880"
, update =	"97.11 orourke"
}

@techreport{h-pargc-88
, author =	"C. M. Hoffmann"
, title =	"The problem of accuracy and robustness in geometric computation"
, type =	"Report"
, number =	"CSD-TR-771"
, institution =	"Dept. Comput. Sci., Purdue Univ."
, address =	"West Lafayette, IN"
, year =	1988
}

@article{h-pargc-89
, author =	"C. M. Hoffmann"
, title =	"The Problems of Accuracy and Robustness in Geometric Computation"
, journal =	"IEEE Computer"
, volume =	22
, number =	3
, month =	mar
, year =	1989
, pages =	"31--41"
, keywords =	"numerical precision, stability, robustness"
, update =	"93.09 held"
}

@techreport{hh-asgca-85t
, author =	"C. M. Hoffmann and J. E. Hopcroft"
, title =	"Automatic Surface Generation in Computer Aided Design"
, number =	"85-661"
, institution =	"Cornell University, Computer Science Department"
, year =	1985
, update =	"98.03 bibrelex"
}

@techreport{hh-qbs-85
, author =	"C. M. Hoffmann and J. E. Hopcroft"
, title =	"Quadratic Blending Surfaces"
, number =	"85-647"
, institution =	"Cornell University, Computer Science Department"
, year =	1985
, update =	"98.03 bibrelex"
}

@article{hh-qbs-86
, author =	"C. M. Hoffmann and J. E. Hopcroft"
, title =	"Quadratic blending surfaces"
, journal =	"Comput. Aided Design"
, volume =	18
, number =	6
, year =	1986
, pages =	"301--306"
, update =	"98.03 bibrelex"
}

@techreport{hh-pmbsc-85
, author =	"C. M. Hoffmann and J. E. Hopcroft"
, title =	"The potential method for blending surfaces and corners"
, number =	"85-699"
, institution =	"Cornell University, Computer Science Department"
, year =	1985
, update =	"98.03 bibrelex"
}

@inproceedings{hhk-tirgc-88
, author =	"C. M. Hoffmann and J. E. Hopcroft and M. S. Karasick"
, title =	"Towards implementing robust geometric computations"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"106--117"
, cites =	"d-cugr-86, eos-calha-86, gl-mc-83, gy-frcg-86, hhk-rsops-87, k-rmrs-89, l-ccsda-85, m-vigau-86i, otu-nsga-87, s-aefsm-87t, s-fprgo-87, ZZZ"
, update =	"98.03 bibrelex"
}

@techreport{hhk-rsops-87
, author =	"C. M. Hoffmann and J. E. Hopcroft and M. T. Karasick"
, title =	"Robust Set Operations on Polyhedral Solids"
, number =	"87-875"
, institution =	"Cornell University, Computer Science Department"
, address =	"Ithaca, New York"
, month =	oct
, year =	1987
, update =	"98.03 bibrelex"
}

@article{hhk-rsops-89
, author =	"C. M. Hoffmann and J. E. Hopcroft and M. T. Karasick"
, title =	"Robust Set Operations on Polyhedral Solids"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	9
, number =	6
, month =	nov
, year =	1989
, pages =	"50--59"
, keywords =	"numerical precision, stability, robustness"
, update =	"93.09 held"
}

@article{hr-rmsm-96
, author =	"C. M. Hoffmann and J. R. Rossignac"
, title =	"A Road Map to Solid Modeling"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	2
, number =	1
, month =	mar
, year =	1996
, pages =	"3--10"
, update =	"96.09 held"
}

@article{hv-ftgsm-91
, author =	"C. M. Hoffmann and G. Van{\v e}{\v c}ek"
, title =	"Fundamental Techniques for Geometric and Solid Modeling"
, journal =	"Control and Dynamic Systems"
, volume =	48
, year =	1991
, pages =	"101--165"
, keywords =	"skeleton, Voronoi diagram, offsetting"
, update =	"93.09 held"
}

@inproceedings{hv-scp-95
, author =	"C. M. Hoffmann and P. J. Vermeer"
, title =	"A spatial constraint problem"
, booktitle =	"Computational Kinematics Workshop"
, site =	"Nice, France"
, month =	sep
, year =	1995
, update =	"98.07 bibrelex"
}

@article{hv-eescs-91
, author =	"C. M. Hoffmann and P. J. Vermeer"
, title =	"Eliminating extraneous solutions in curve and surface operations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, year =	1991
, pages =	"47--66 and 345"
, keywords =	"geometric modeling, faithful problem formulation, offsets, blends, equidistance surfaces, extraneous solutions"
, precedes =	"hv-eeesc-91"
, update =	"96.09 devillers"
}

@article{hv-eeesc-91
, author =	"C. M. Hoffmann and P. J. Vermeer"
, title =	"Erratum --- Eliminating extraneous solutions in curve and surface operations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, year =	1991
, pages =	345
, succeeds =	"hv-eescs-91"
}

@incollection{hv-gcsr2-95
, author =	"Christoph M. Hoffmann and Pamela J. Vermeer"
, title =	"Geometric Constraint Solving in {$\Re^2$} and {$\Re^3$}"
, editor =	"Ding-Zhu Du and Frank Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"266--298"
, keywords =	"survey paper"
, update =	"98.07 icking"
}

@inproceedings{h-ragp-90
, author =	"Frank Hoffmann"
, title =	"On the Rectilinear Art Gallery Problem"
, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	443
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"717--728"
, update =	"94.05 devillers, 93.09 milone+mitchell"
}

@inproceedings{hikk-cslp-97
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"A Competitive Strategy for Learning a Polygon"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"166--174"
, succeeds =	"hikk-ecslp-96"
, update =	"97.03 icking"
}

@techreport{hikk-ecslp-96
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"An Efficient Competitive Strategy for Learning a Polygon"
, number =	"B 96--01"
, institution =	"Freie Universit{\"a}t Berlin, Fachbereich Mathematik"
, year =	1996
, precedes =	"hikk-cslp-97"
, update =	"97.03 icking"
}

@inproceedings{hikk-ecslp-96c
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"An Efficient Competitive Strategy for Learning a Polygon"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"107--108"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{hikk-maar-97
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"Moving an Angle Around a Region"
, type =	"Manuscript"
, institution =	"FernUniversit{\"a}t Hagen"
, address =	"Hagen, Germany"
, year =	1997
, precedes =	"hikk-maar-98"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@inproceedings{hikk-maar-98
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"Moving an Angle Around a Region"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"71--82"
, succeeds =	"hikk-maar-97"
, update =	"98.11 bibrelex, 98.07 icking+mitchell"
}

@article{hikk-pep-01
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"The Polygon Exploration Problem"
, journal =	"SIAM J. Comput."
, volume =	31
, year =	2001
, pages =	"577--600"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/hikk-pep-01.pdf"
, cites =	"aaiklr-gsac-98p, aks-eueo-99, afm-aalmm-97, b-olsn-98, brs-nugt-97, cj-cswps-95, cjn-fswrs-93, co-rpwdu-00, cn-wrsp-91, bghosst-rgdu-95, dkp-hlue-91, dkp-hlue1-98, fw-ola-98, hn-ctbes-97, hikk-cslp-97, hikk-maar-98, hikk-pepns-98, ik-skpcs-95, ikl-ocsws-99, ikm-hlac-93, m-gspno-00, n-wrlv-90, rksi-rnut-93, r-cic-94, su-hcg-00, st-aelup-85, th-cswrd-93, thi-ciacs-99, ZZZ"
, update =	"02.03 icking, 01.07 icking, 01.04 icking"
}

@inproceedings{hikk-pepns-98
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"The Polygon Exploration Problem: A New Strategy and a New Analysis Technique"
, booktitle =	"Robotics: The Algorithmic Perspective, Proc. 3rd Workshop Algorithmic Found. Robot."
, nickname =	"WAFR '98"
, site =	"Houston"
, publisher =	"A. K. Peters"
, year =	1998
, pages =	"211--222"
, comments =	"Utilizes result in \cite{hikk-maar-98}"
, update =	"99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex+icking, 98.03 icking+mitchell"
}

@techreport{hikk-pep1c-98
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"The Polygon Exploration Problem {I}: A Competitive Strategy"
, number =	241
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1998
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr241.pdf"
, update =	"98.11 bibrelex"
}

@techreport{hikk-pep2a-98
, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
, title =	"The Polygon Exploration Problem {II}: The Angle Hull"
, number =	245
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1998
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr245.pdf"
, update =	"99.03 bibrelex"
}

@inproceedings{hkk-agtph-91
, author =	"F. Hoffmann and M. Kaufmann and K. Kriegel"
, title =	"The art gallery theorem for polygons with holes"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"39--48"
}

@inproceedings{hk-gcric-93
, author =	"Frank Hoffmann and Klaus Kriegel"
, title =	"A Graph Coloring Result and Its Consequences for some Guarding Problems"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"78--87"
, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@inproceedings{hk-dpmc-93
, author =	"Frank Hoffmann and Klaus Kriegel"
, title =	"Dominating Polygons by Many Colors"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{hk-ertlt-88
, author =	"F. Hoffmann and K. Kriegel"
, title =	"Embedding Rectilinear Graphs in Linear Time"
, journal =	"Inform. Process. Lett."
, volume =	29
, year =	1988
, pages =	"75--79"
, update =	"99.03 vismara"
}

@inproceedings{hkw-gapi2-99
, author =	"Frank Hoffmann and Klaus Kriegel and Carola Wenk"
, title =	"A Geometric Approach to Protein Identification in {2D} Electrophoretic Gel Images"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"173--174"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{hkw-natc2-98
, author =	"Frank Hoffmann and Klaus Kriegel and Carola Wenk"
, title =	"New Algorithmic Tools for Comparing {2D} Patterns of Protein Spots"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"93--95"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{hm-ilsp-84
, author =	"K. Hoffmann and K. Mehlhorn"
, title =	"Intersecting a line and a simple polygon"
, journal =	"Bull. EATCS"
, volume =	22
, month =	feb
, year =	1984
, pages =	"120--121"
, update =	"97.11 bibrelex"
}

@inproceedings{hmrt-sjslt-85
, author =	"K. Hoffmann and K. Mehlhorn and P. Rosenstiehl and R. E. Tarjan"
, title =	"Sorting {Jordan} sequences in linear time"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"196--203"
, precedes =	"hmrt-sjslt-86"
, cites =	"bt-dadsr-80, e-pp-83, f-hgiit-76, hm-ilsp-84, hm-ndsrs-82, ms-hbt-81, m-ss-84, r-ppdti-84, t-acc-85, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{hmrt-sjslt-86
, author =	"K. Hoffmann and K. Mehlhorn and P. Rosenstiehl and R. E. Tarjan"
, title =	"Sorting {Jordan} sequences in linear time using level-linked search trees"
, journal =	"Inform. Control"
, volume =	68
, year =	1986
, pages =	"170--184"
, succeeds =	"hmrt-sjslt-85"
}

@inproceedings{h-cpfr-01
, author =	"Michael Hoffmann"
, title =	"Covering Polygons with Few Rectangles"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"39--42"
, update =	"01.04 icking"
}

@article{h-wirt-90
, author =	"Georg R. Hofmann"
, title =	"Who Invented Ray Tracing?"
, journal =	"Visual Comput."
, volume =	6
, number =	3
, month =	jun
, year =	1990
, pages =	"120--4"
}

@techreport{h-ffpsd1-75
, author =	"B. van Hohenbalken"
, title =	"Finding faces of polytopes by simplicial decomposition, {Part} {I}: vertices and edges"
, type =	"Report"
, number =	24
, institution =	"Dept. Econom., Univ. Alberta"
, address =	"Edmonton, AB"
, year =	1975
}

@techreport{h-ffpsd2-75
, author =	"B. van Hohenbalken"
, title =	"Finding faces of polytopes by simplicial decomposition, {Part} {II}: higher-dimensional faces"
, type =	"Report"
, number =	25
, institution =	"Dept. Econom., Univ. Alberta"
, address =	"Edmonton, AB"
, year =	1975
}

@article{h-fssp-81
, author =	"B. van Hohenbalken"
, title =	"Finding simplicial subdivisions of polytopes"
, journal =	"Math. Program."
, volume =	21
, year =	1981
, pages =	"233--234"
}

@article{h-ldmsp-78
, author =	"B. van Hohenbalken"
, title =	"Least distance methods for the scheme of polytopes"
, journal =	"Math. Program."
, volume =	15
, year =	1978
, pages =	"1--11"
}

@inproceedings{hc-faobg-95
, author =	"Michael Hohmeyer and Wayne Christopher"
, title =	"Fully-Automated Object-Based Generation of Hexahedral Meshes"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"129--139"
, update =	"96.01 samitchell"
}

@article{h-siabl-91
, author =	"M. E. Hohmeyer"
, title =	"A surface intersection algorithm based on loop detection"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	4
, year =	1991
, pages =	"473--490"
, keywords =	"surface, curve, intersection, computer aided design CAD, closed loops, linear programming"
}

@techreport{hr-dcpbc-84
, author =	"D. H. Hoitsma and M. Roche"
, title =	"The determination of the critical points on a bi-cubic patch relative to a plane"
, type =	"Report"
, number =	"??"
, institution =	"Fairchild Republic, and Lundy Systems"
, year =	1984
}

@techreport{h-dsmt-83t
, author =	"J. M. Hollerbach"
, title =	"Dynamic scaling of Manipulator Trajectories"
, number =	"A. I. Lab Memo 700"
, institution =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1983
, update =	"97.11 bibrelex"
}

@inproceedings{h-dsmt-83
, author =	"J. M. Hollerbach"
, title =	"Dynamic scaling of manipulator trajectories"
, booktitle =	"Proc. ACC"
, site =	"San Francisco, CA"
, organization =	"American Automatic Control Council"
, month =	jun
, year =	1983
, pages =	"752--756"
, update =	"97.11 bibrelex"
}

@inproceedings{h-gmdsg-95
, author =	"David Holmes"
, title =	"Generalized Method of Decomposing Solid Geometry into Hexahedron Finite Elements"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"141--152"
, update =	"96.01 samitchell"
}

@inproceedings{hl-atmcf-86
, author =	"D. Graham Holmes and Scott H. Lamson"
, title =	"Adaptive Triangular Meshes for Compressible Flow Solutions"
, editor =	"J. H{\"a}user and C. Taylor"
, booktitle =	"Numerical Grid Generation in Computational Fluid Dynamics"
, publisher =	"Pineridge Press"
, address =	"Swansea, England"
, year =	1986
, pages =	"413--424"
, annote =	"Insertion algorithm for CDT for mesh for fluid
		 dynamics FEM. Laplacian smoothing of mesh. Adaptive
		 refinement by splitting triangles into four pieces
		 along edge mid points."
}

@article{hs-ccagm-91
, author =	"L. S. {Homem de Mello} and A. C. Sanderson"
, title =	"A correct and complete algorithm for the generation of mechanical assembly Sequences"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	7
, year =	1991
, pages =	"228--240"
, update =	"98.03 agarwal"
}

@techreport{hs-agmas-88
, author =	"L. S. {Homem de Mello} and A. C. Sanderson"
, title =	"Automatic Generation of Mechanical Assembly Sequences"
, type =	"Technical {Report}"
, institution =	"Robotics Institute, Carnegie Mellon University"
, month =	dec
, year =	1988
, update =	"93.09 milone+mitchell"
}

@inproceedings{hjss-cohdl-01
, author =	"M. C. Hon and R. Janardan and J. Schwerdt and M. Smid"
, title =	"Computing optimal hatching directions in layered manufacturing"
, booktitle =	"Proceedings International Conference on Computational Science"
, series =	"Lecture Notes Comput. Sci."
, volume =	2073
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"683--692"
, update =	"01.07 smid"
}

@article{h-dcpdd-78
, author =	"H. Honda"
, title =	"Description of Cellular Patterns by {Dirichlet} Domains: The Two-Dimensional Case"
, journal =	"Journal of Theoretical Biology"
, volume =	72
, year =	1978
, pages =	"523--543"
, annote =	"VD as model of cell patterns. Tries to find centres to
		 create pattern. $O(n^2)$ algorithm to build VD."
}

@inproceedings{hw-imbmm-88
, author =	"J. Hong and H. J. Wolfson"
, title =	"An improved model-based matching method using footprints"
, booktitle =	"Proc. 9th IEEE Internat. Conf. Pattern Recogn."
, year =	1988
, pages =	"72--28"
, update =	"98.03 bibrelex"
}

@article{hcy-iatwm-90
, author =	"J. H. Hong and A. E. Chiou and P. Yeh"
, title =	"Image amplification by two-wave mixing in photorefractive crystals"
, journal =	"Appl. Optics"
, volume =	29
, number =	20
, year =	1990
, pages =	"3026--3029"
, update =	"97.11 bibrelex"
}

@article{hmr-ctoge-83
, author =	"J. W. Hong and K. Mehlhorn and A. L. Rosenberg"
, title =	"Cost trade-offs in graph embedding with applications"
, journal =	"J. ACM"
, volume =	30
, year =	1983
, pages =	"709--728"
}

@article{hskk-tbcua-98
, author =	"M. Hong and T. W. Sederberg and K. S. Klimaszewski and K. Kaneda"
, title =	"Triangulation of Branching Contours Using Area Minimization"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"389--406"
, update =	"98.11 devillers"
}

@techreport{hjss-mtpsv-01
, author =	"M. C. Hong and R. Janardan and J. Schwerdt and M. Smid"
, title =	"Minimizing the total projection of a set of vectors, with applications to layered manufacturing"
, type =	"Report"
, number =	4
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	2001
, update =	"01.04 smid"
}

@article{hel-dspds-00
, author =	"S.-H. Hong and P. Eades and S.-H. Lee"
, title =	"Drawing series parallel digraphs symmetrically"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"165--188"
, update =	"01.04 smid"
}

@article{hs-drwsv-85
, author =	"T. H. Hong and M. Schneier"
, title =	"Describing a robot's workspace using a sequence of views from a moving camera"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	7
, year =	1985
, pages =	"721--726"
, update =	"98.11 bibrelex"
}

@book{h-mg-73
, author =	"R. Honsberger"
, title =	"Mathematical Gems I"
, series =	"The Dolciani Mathematical Expositions"
, number =	1
, publisher =	"Math. Soc. of America"
, year =	1973
, precedes =	"h-mg-76,h-mg-85"
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@book{h-mg-76
, author =	"R. Honsberger"
, title =	"Mathematical Gems II"
, series =	"The Dolciani Mathematical Expositions"
, number =	2
, publisher =	"Math. Soc. of America"
, year =	1976
, succeeds =	"h-mg-73"
, precedes =	"h-mg-85"
, update =	"99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
}

@book{h-mg-85
, author =	"R. Honsberger"
, title =	"Mathematical Gems III"
, series =	"The Dolciani Mathematical Expositions"
, number =	9
, publisher =	"Math. Soc. of America"
, year =	1985
, succeeds =	"h-mg-73, h-mg-76"
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@article{h-srlp-82
, author =	"R. Honsberger"
, title =	"Semi-regular lattice polygons"
, journal =	"Two Year College Math. J."
, volume =	13
, year =	1982
, pages =	"36--44"
, update =	"97.11 bibrelex"
}

@article{hrwz-aairf-87
, author =	"S. J. Hood and R. C. Rosenberg and D. H. Withers and T. Zhou"
, title =	"An algorithm for automatic identification of {$R$}-fields in bond graphs"
, journal =	"IBM J. Res. Develop."
, volume =	31
, year =	1987
, pages =	"382--390"
}

@techreport{hk-prga-89
, author =	"J. Hopcroft and P. Kahn"
, title =	"A Paradigm for Robust Geometric Algorithms"
, type =	"Technical {Report}"
, number =	"TR-89-1044"
, institution =	"Cornell University"
, month =	oct
, year =	1989
, update =	"97.11 bibrelex"
}

@article{hk-nammb-73
, author =	"J. Hopcroft and R. M. Karp"
, title =	"An $n^(5/2)$ algorithm for maximum matchings in bipartite graphs"
, journal =	"SIAM J. Comput."
, volume =	2
, number =	4
, year =	1973
, pages =	"225--231"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@incollection{hk-crcs-85i
, author =	"J. Hopcroft and D. Kraft"
, title =	"The Challenge of Robotics for Computer Science"
, editor =	"J. Schwartz and C. Yap"
, booktitle =	"Advances in Robotics: {Algorithms} and Geometric Aspects of Robotics"
, volume =	1
, publisher =	"??"
, year =	1985
, pages =	"7--42"
, update =	"97.11 bibrelex"
}

@article{ht-dgtc-73
, author =	"J. Hopcroft and R. E. Tarjan"
, title =	"Dividing a Graph into Triconnected Components"
, journal =	"SIAM J. Comput."
, volume =	2
, number =	3
, year =	1973
, pages =	"135--158"
, update =	"98.07 tamassia, 95.01 tamassia"
}

@article{ht-ept-74
, author =	"J. Hopcroft and R. E. Tarjan"
, title =	"Efficient Planarity Testing"
, journal =	"J. ACM"
, volume =	21
, number =	4
, year =	1974
, pages =	"549--568"
, keywords =	"graph drawing"
, precedes =	"d-nhtpa-76"
, update =	"93.09 tamassia"
}

@article{hw-moc-86
, author =	"J. Hopcroft and G. Wilfong"
, title =	"Motion of objects in contact"
, journal =	"Internat. J. Robot. Res."
, volume =	4
, number =	4
, year =	1986
, update =	"98.03 bibrelex"
}

@inbook{hh-gicv-92
, author =	"J. E. Hopcroft and D. P. Huttenlocher"
, title =	"Geometric invariance on computer vision"
, chapter =	18
, publisher =	"MIT Press"
, year =	1992
, pages =	"354--374"
, update =	"97.11 bibrelex"
}

@techreport{hh-ppmat-89
, author =	"J. E. Hopcroft and D. P. Huttenlocher"
, title =	"On planar point matching under affine transformation"
, type =	"Technical {Report}"
, number =	"TR~89-986"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	apr
, year =	1989
, update =	"93.09 milone+mitchell"
}

@inproceedings{hh-pmat-89
, author =	"J. E. Hopcroft and D. P. Huttenlocher"
, title =	"Point matching under affine transformation"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	14
}

@article{hjw-mp2dl-84
, author =	"J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
, title =	"Movement problems for $2$-dimensional linkages"
, journal =	"SIAM J. Comput."
, volume =	13
, year =	1984
, pages =	"610--629"
}

@techreport{hjw-mra2d-82
, author =	"J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
, title =	"On the movement of robot arms in $2$-dimensional bounded regions"
, type =	"Technical {Report}"
, number =	"TR~82-486"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1982
, precedes =	"hjw-mra2d-85"
}

@article{hjw-mra2d-85
, author =	"J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
, title =	"On the movement of robot arms in $2$-dimensional bounded regions"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"315--333"
, succeeds =	"hjw-mra2d-82"
}

@article{hk-prga-92
, author =	"J. E. Hopcroft and P. J. Kahn"
, title =	"A paradigm for robust geometric algorithms"
, journal =	"Algorithmica"
, volume =	7
, number =	4
, year =	1992
, pages =	"339--380"
, update =	"98.07 tamassia"
}

@techreport{hk-crcs-85
, author =	"J. E. Hopcroft and D. B. Krafft"
, title =	"The challenge of robotics for computer science"
, type =	"Technical {Report}"
, number =	"??"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1985
}

@article{hss-edis-83a
, author =	"J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
, title =	"Efficient detection of intersections among spheres"
, journal =	"Internat. J. Robot. Res."
, volume =	2
, number =	4
, year =	1983
, pages =	"77--80"
, keywords =	"intersection, detection, spheres, three-dimensional"
, succeeds =	"hss-edis-83t"
, update =	"98.03 mitchell"
}

@techreport{hss-edis-83t
, author =	"J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
, title =	"Efficient detections of intersections among spheres"
, type =	"Report"
, number =	59
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, year =	1983
, precedes =	"hss-edis-83a"
, update =	"98.03 mitchell"
}

@article{hss-cmpmi-84
, author =	"J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
, title =	"On the complexity of motion planning for multiple independent objects: {P}-space hardness of the ``{Warehouseman}'s {Problem}''"
, journal =	"Internat. J. Robot. Res."
, volume =	3
, number =	4
, year =	1984
, pages =	"76--88"
, keywords =	"motion planning, lower bounds"
, update =	"98.03 mitchell"
}

@book{hss-pgcrm-87
, author =	"J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
, title =	"Planning, Geometry, and Complexity of Robot Motion"
, publisher =	"Ablex Publishing"
, address =	"Norwood, NJ"
, year =	1987
, update =	"98.03 mitchell"
}

@book{hu-iatlc-79
, author =	"J. E. Hopcroft and J. D. Ullman"
, title =	"Introduction to Automata Theory, Languages, and Computation"
, publisher =	"Addison-Wesley"
, year =	1979
, update =	"98.07 bibrelex"
}

@techreport{hw-moc-84
, author =	"J. E. Hopcroft and G. T. Wilfong"
, title =	"On the Motion of Objects in Contact"
, type =	"Technical {Report}"
, number =	"84-602"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	may
, year =	1984
, update =	"97.11 bibrelex"
}

@techreport{hw-rmomp-84
, author =	"J. E. Hopcroft and G. T. Wilfong"
, title =	"Reducing Multiple Object Motion Planning to Graph Searching"
, type =	"Technical {Report}"
, number =	"84-616"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	jul
, year =	1984
, update =	"97.11 bibrelex"
}

@article{hw-rmomp-86
, author =	"J. E. Hopcroft and G. T. Wilfong"
, title =	"Reducing Multiple Object Motion Planning to Graph Searching"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"768--785"
, update =	"00.03 agarwal"
}

@article{h-pgdp-71
, author =	"A. K. Hope"
, title =	"A Planar Graph Drawing Program"
, journal =	"Softw. -- Pract. Exp."
, volume =	1
, year =	1971
, pages =	"83--91"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{hk-spcs-90
, author =	"R. Hope and M. Katchalski"
, title =	"Separating plane convex sets"
, journal =	"Math. Scand."
, volume =	66
, year =	1990
, pages =	"44--46"
, update =	"97.03 pocchiola"
}

@article{h-uzztu-53
, author =	"H. Hopf"
, title =	"{\"U}ber {Zusammenh{\"a}nge} zwischen {Topologie} und {Metrik} im {Rahmen} der elementaren {Geometrie}"
, journal =	"Mathematisch-Physikalische Semester Berichte"
, volume =	3
, year =	1953
, pages =	"16--29"
, update =	"97.11 bibrelex"
}

@article{hp-an1-34
, author =	"H. Hopf and E. Pannwitz"
, title =	"Aufgabe {No.} $167$"
, journal =	"Jahresbericht Deutsch. Math. Verein"
, volume =	43
, year =	1934
, pages =	114
, update =	"98.03 bibrelex"
}

@article{h-ngrhc-84
, author =	"J. Hopfield"
, title =	"Neurons with graded response have collective computational properties like those of two-state neurons"
, journal =	"Proc. Nat. Acad. Sci. USA"
, volume =	81
, year =	1984
, pages =	"2554--2558"
, update =	"98.07 bibrelex"
}

@article{ht-cncm-86
, author =	"J. Hopfield and D. Tank"
, title =	"Computing with neural circuits: a model"
, journal =	"Science"
, volume =	233
, year =	1986
, pages =	"624--633"
, update =	"98.07 bibrelex"
}

@article{ht-ncdop-85
, author =	"J. Hopfield and D. Tank"
, title =	"``Neural'' computation of decisions in optimization problems"
, journal =	"Biological Cybernetics"
, volume =	52
, year =	1985
, pages =	"141--152"
, update =	"98.07 bibrelex"
}

@article{h-cm-93
, author =	"T. Hopp"
, title =	"Computational metrology"
, journal =	"Manufacturing Review"
, volume =	6
, number =	4
, year =	1993
, pages =	"295--304"
, update =	"98.03 agarwal, 97.03 agarwal"
}

@inproceedings{h-pm-96
, author =	"H. Hoppe"
, title =	"Progressive meshes"
, booktitle =	"Proc. SIGGRAPH '96"
, year =	1996
, pages =	"99--108"
, update =	"98.07 bibrelex+orourke"
}

@inproceedings{h-vdrpm-97
, author =	"Hugues Hoppe"
, title =	"View-Dependent Refinement of Progressive Meshes"
, booktitle =	"Proc. SIGGRAPH '97"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"ACM Press"
, month =	aug
, year =	1997
, pages =	"189--198"
, update =	"98.07 agarwal, 98.03 agarwal+mitchell"
}

@inproceedings{hddhjmss-pssr-94
, author =	"H. Hoppe and T. DeRose and T. Duchamp and M. Halstead and H. Jin and J. McDonald and J. Schweitzer and W. Stuetzle"
, title =	"Piecewise Smooth Surface Reconstruction"
, booktitle =	"Proc. SIGGRAPH 94"
, year =	1994
, pages =	"295--302"
, update =	"97.03 agarwal, 95.01 mitchell"
}

@inproceedings{hddms-mo-93
, author =	"H. Hoppe and T. DeRose and T. Duchamp and J. McDonald and W. Stuetzle"
, title =	"Mesh Optimization"
, booktitle =	"Proc. SIGGRAPH '93"
, year =	1993
, pages =	"19--26"
, update =	"95.01 mitchell"
}

@article{hddms-srup-92
, author =	"H. Hoppe and T. DeRose and T. Duchamp and J. McDonald and W. Stuetzle"
, title =	"Surface reconstruction from unorganized points"
, journal =	"Comput. Graphics"
, volume =	26
, number =	2
, year =	1992
, pages =	"71--78"
, note =	"Proc. SIGGRAPH '92"
, update =	"93.05 orourke"
}

@article{ha-pppap-01
, author =	"K. Hormann and A. Agathos"
, title =	"The point in polygon problem for arbitrary polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"131--144"
, update =	"02.03 smid"
}

@article{hv-splsp-49
, author =	"A. Horn and F. A. Valentine"
, title =	"Some properties of L-sets in the plane"
, journal =	"Duke Mathematics Journal"
, volume =	16
, year =	1949
, pages =	"131--140"
, update =	"98.03 bibrelex"
}

@inproceedings{h-egi-84
, author =	"B. K. P. Horn"
, title =	"Extended {Gaussian} Images"
, booktitle =	"Proc. IEEE"
, month =	dec
, year =	1984
, pages =	"1671--1586"
, update =	"97.11 bibrelex"
}

@book{h-rv-86
, author =	"B. K. P. Horn"
, title =	"Robot Vision"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1986
, update =	"97.11 bibrelex"
}

@article{ht-tdscp-89
, author =	"W. P. Horn and D. L. Taylor"
, title =	"A theorem to determine the spatial containment of a point in a planar polyhedron"
, journal =	"Comput. Graph. Image Process."
, volume =	45
, year =	1989
, pages =	"106--116"
, keywords =	"point location, polyhedron, winged-edge"
, update =	"96.01 mitchell"
}

@book{hs-fds-83
, author =	"E. Horowitz and S. Sahni"
, title =	"Fundamentals of Data Structures"
, publisher =	"Computer Science Press"
, address =	"Potomac, Maryland"
, year =	1983
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{hsa-fdsc-93
, author =	"E. Horowitz and S. Sahni and S. {Anderson-Freed}"
, title =	"Fundamentals of Data Structures in {C}"
, publisher =	"Computer Science Press"
, address =	"New York"
, year =	1993
, update =	"98.11 bibrelex"
}

@book{hsm-fdsc-95
, author =	"E. Horowitz and S. Sahni and D. Metha"
, title =	"Fundamentals of Data Structures in C++"
, publisher =	"Computer Science Press"
, year =	1995
, update =	"97.03 tamassia"
}

@techreport{h-cvdp-79
, author =	"R. N. Horspool"
, title =	"Constructing the {Voronoi} diagram in the plane"
, type =	"Report"
, number =	"SOCS 79.12"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, month =	jul
, year =	1979
, update =	"93.09 held"
}

@article{h-snec7-83
, author =	"J. D. Horton"
, title =	"Sets with no empty convex $7$-gons"
, journal =	"Canad. Math. Bull."
, volume =	26
, year =	1983
, pages =	"482--484"
}

% ### others?
@article{ho-rcbsc-92
, author =	"T. Horvath and others"
, title =	"Ray Coherence Between a Sphere and a Convex Polyhedron"
, journal =	"Comput. Graph. Forum"
, volume =	11
, number =	2
, month =	jun
, year =	1992
, pages =	"163--172"
, update =	"93.09 held"
}

@book{hd-pvd-94
, author =	"J. Hoschek and W. Dankwort"
, title =	"Parametric and Variational Design"
, publisher =	"B. G. Teubner"
, year =	1994
, update =	"98.07 bibrelex"
}

@book{hl-cagd-93
, author =	"J. Hoschek and D. Lasser"
, title =	"Computer Aided Geometric Design"
, publisher =	"A.K. Peters"
, year =	1993
, update =	"98.07 bibrelex"
}

@article{hy-cempk-82
, author =	"M. Hoshi and T. Yuba"
, title =	"A counter example to a monotonicity property of $k$-d trees"
, journal =	"Inform. Process. Lett."
, volume =	15
, number =	4
, year =	1982
, pages =	"169--173"
}

@article{hu-ndcqg-01
, author =	"K. Hosono and M. Urabe"
, title =	"On the number of disjoint convex quadrilaterals for a given point set in the plane"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"97--104"
, update =	"02.03 devillers"
}

@techreport{h-cthlra-89
, author =	"L. B. Hostetler"
, title =	"A Comparison of Three Hidden Line Removal Algorithms"
, type =	"Report"
, number =	"TR--89--02"
, institution =	"Department of Computer Science, Johns Hopkins University"
, year =	1989
, update =	"98.11 ghali"
}

@book{hs-rt-67
, author =	"Hottel and Sarofim"
, title =	"Radioactive Transfer"
, publisher =	"McGraw-Hill"
, address =	"New York, NY"
, year =	1967
, update =	"98.03 bibrelex"
}

@inproceedings{htap-pgmis-91
, author =	"G. R. Hottel and S. T. Tuohy and P. G. Alourdas and N. M. Patrikalakis"
, title =	"Praxiteles: A Geometric Modeling and Interrogation System"
, booktitle =	"Proc. Marine Computers '91"
, year =	1991
, pages =	"CC4"
, update =	"95.05 abrams"
}

@techreport{hs-actbn-93
, author =	"G. Hotz and J. Sellen"
, title =	"On algebraic computation trees and {Betti} numbers"
, type =	"Manuscript"
, institution =	"??"
, year =	1993
, update =	"98.03 bibrelex"
}

@incollection{hm-fwecs-88
, author =	"M. Houle and A. Maciel"
, title =	"Finding the widest empty corridor through a set of points"
, booktitle =	"Snapshots of computational and discrete geometry"
, publisher =	"Dept. of Computer Science, McGill University"
, address =	"Montreal, Canada"
, year =	1988
, pages =	"201--213"
, note =	"Technical Report SOCS-88.11"
, update =	"98.11 bibrelex"
}

@inproceedings{h-awwss-89a
, author =	"M. E. Houle"
, title =	"Algorithms for weak and wide separation of sets"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	25
, precedes =	"h-awwss-89b"
, update =	"95.09 mitchell"
}

@inproceedings{h-awwss-89b
, author =	"M. E. Houle"
, title =	"Algorithms for weak and wide separation of sets"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"61--68"
, keywords =	"linear separation, red-blue separation, spherical separation"
, succeeds =	"h-awwss-89a"
, update =	"95.09 mitchell"
}

@article{h-tess-91
, author =	"M. E. Houle"
, title =	"Theorems on the existence of separating surfaces"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"49--56"
}

@inproceedings{hiir-wolla-89
, author =	"M. E. Houle and H. Imai and K. Imai and J.-M. Robert"
, title =	"Weighted orthogonal linear {$L_{\infty}$}-approximation and applications"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"183--191"
}

@article{hiiry-owllla-93
, author =	"M. E. Houle and H. Imai and K. Imai and J.-M. Robert and P. Yam amoto"
, title =	"Orthogonal Weighted Linear {$L_{1}$} and {$L_{\infty}$} Approximation and Applications"
, journal =	"Discrete Appl. Math."
, volume =	43
, number =	3
, month =	jun
, year =	1993
, pages =	"217--232"
, succeeds =	"hiiry-owlll-90"
, update =	"00.11 smid, 00.07 smid, 98.07 bibrelex"
}

@techreport{hiiry-owlll-90
, author =	"M. E. Houle and H. Imai and K. Imai and J.-M. Robert and P. Yamamoto"
, title =	"Orthogonal Weighted Linear {$L_{1}$} and {$L_{\infty}$} Approximation and Applications"
, type =	"Manuscript"
, year =	1990
, precedes =	"hiiry-owllla-93"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@inproceedings{ht-cws-85
, author =	"M. E. Houle and G. T. Toussaint"
, title =	"Computing the width of a set"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"1--7"
, precedes =	"ht-cws-88"
, cites =	"t-mss-84, s-cg-78, b-gtfga-80, ks-upcha-82t, mt-uchap-84, ma-lafch-79, l-fchsp-80, gs-ncg-82, k-osps-81, ph-chfsp-77, ik-spc-75, ii-cgmpa-85, kd-pamm-82, t-sgprc-83, t-apctd-, ZZZ"
, update =	"97.11 bibrelex, 93.09 milone+mitchell"
}

@article{ht-cws-88
, author =	"M. E. Houle and G. T. Toussaint"
, title =	"Computing the width of a set"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-10"
, number =	5
, year =	1988
, pages =	"761--765"
, keywords =	"two-dimensional, three-dimensional, rotating calipers, antipodal pairs, line fitting, plane fitting, approximation"
, succeeds =	"ht-cws-85"
, update =	"93.09 milone+mitchell+rote"
, annote =	"$O(n \log n + I)$ time, where $I$ is the number of
		 antipodal pairs:
		 vertex-edge pairs in two dimensions ($I=O(n)$);
		 edge-edge pairs and $O(n)$ vertex-face pairs in three
		 dimensions ($I=O(n^2)$)"
}

@article{h-bsmbs-87
, author =	"Piet Houthuys"
, title =	"Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching"
, journal =	"Visual Comput."
, volume =	3
, number =	4
, month =	dec
, year =	1987
, pages =	"236--249"
, keywords =	"multidimensional sorting, range searching, set operations on polygons"
}

@article{h-sp-68
, author =	"W. E. Howden"
, title =	"The Sofa Problem"
, journal =	"Comput. J."
, volume =	11
, year =	1968
, pages =	"299--301"
, update =	"97.11 bibrelex"
}

@phdthesis{h-ercsd-78
, author =	"A. E. Howe"
, title =	"Estimating regions and clustering spatial data: analysis and implementation of methods using the {Voronoi} diagram"
, type =	"Ph.{D}. Thesis"
, school =	"Brown Univ."
, address =	"Providence, RI"
, year =	1978
, keywords =	"doctoral thesis"
}

@article{hb-mpaic-94
, author =	"C. T. Howie and E. H. Blake"
, title =	"The mesh propagation algorithm for isosurface construction"
, journal =	"Comput. Graph. Forum"
, volume =	13
, year =	1994
, pages =	"65--74"
, update =	"98.07 bibrelex"
}

@incollection{h-dqgpg-92
, author =	"W.-Y. Hsiang"
, title =	"On the development of quantitative geometry from {Pythagoras} to {Grassman}"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"1--21"
, keywords =	"survey paper"
, precedes =	"h-dqgpg-95"
, update =	"98.07 icking"
}

@incollection{h-dqgpg-95
, author =	"Wu-Yi Hsiang"
, title =	"On the Development of Quantitative Geometry from {Pythagoras} to {Grassmann}"
, editor =	"Ding-Zhu Du and Frank Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"1--21"
, keywords =	"survey paper"
, succeeds =	"h-dqgpg-92"
, update =	"98.07 icking"
}

@inproceedings{hklms-fnppr-98
, author =	"David Hsu and Lydia E. Kavraki and Jean-Claude Latombe and Rajeev Motwani and Stephen Sorkin"
, title =	"On Finding Narrow Passages with Probabilistic Roadmap Planners"
, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
, nickname =	"WAFR '98"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1998
, note =	"To appear"
, update =	"98.11 bibrelex, 98.07 agarwal+bibrelex, 98.03 agarwal+mitchell"
}

@article{hcl-paccv-92
, author =	"F. R. Hsu and R. C. Chang and R. C. T. Lee"
, title =	"Parallel algorithms for computing the closest visible vertex pair between two polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"135--162"
, keywords =	"parallel algorithm, visibility"
, update =	"94.09 jones"
}

@techreport{hwh-cpr-85
, author =	"W.-J. Hsu and C.-C. Wang and K.-T. Huang"
, title =	"Convex polygon retrieval"
, type =	"Report"
, number =	"??"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1985
}

@article{hn-ehblp-79
, author =	"W. L. Hsu and G. L. Nemhauser"
, title =	"Easy and Hard Bottleneck Location Problems"
, journal =	"Discrete Appl. Math."
, volume =	1
, year =	1979
, pages =	"209--215"
, update =	"98.07 agarwal"
}

@inproceedings{hp-callc-79
, author =	"M. Y. Hsueh and D. O. Pederson"
, title =	"Computer-Aided Layout of LSI Circuit Building-Blocks"
, booktitle =	"Proc. IEEE Int. Symp. on Circuits and Systems"
, year =	1979
, update =	"98.03 bibrelex"
}

@phdthesis{h-trism-95
, author =	"C.-Y. Hu"
, title =	"Towards Robust Interval Solid Modeling of Curved Objects"
, type =	"Ph.{D}. Thesis"
, school =	"Massachusetts Institute of Technology"
, address =	"Cambridge, Massachusetts"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"95.05 abrams"
}

@article{hpy-rismp1-96
, author =	"C.-Y. Hu and N. M. Patrikalakis and X. Ye"
, title =	"Robust interval solid modeling, {Part} {I}: representations"
, journal =	"CAD"
, volume =	28
, year =	1996
, pages =	"807--818"
, update =	"98.07 bibrelex"
}

@article{hpy-rismp2-96
, author =	"C.-Y. Hu and N. M. Patrikalakis and X. Ye"
, title =	"Robust interval solid modeling, {Part} {II}: boundary evaluation"
, journal =	"CAD"
, volume =	28
, year =	1996
, pages =	"819--830"
, update =	"98.07 bibrelex"
}

@inproceedings{h-ntcmp-91
, author =	"Limin Hu"
, title =	"A Novel Topology Control For Multihop Packet Radio Networks"
, booktitle =	"Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies, IEEE INFOCOM '91"
, publisher =	"IEEE"
, address =	"IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 91CH2979-3)"
, year =	1991
, pages =	"1084--1093"
, keywords =	"packet radio networks, topology control algorithms, data links"
, abstract =	"A novel, distributed topology-control algorithm has
		 been developed for each node in a packet radio network
		 (PRN) to control its transmitting power and logical
		 neighbors in order to construct a reliable,
		 high-throughput topology. The algorithm first
		 constructs a planar triangulation from locations of all
		 nodes as a starting topology. Then, the minimum angles
		 of all triangles in the planar triangulation are
		 maximized by means of edge switching to improve
		 connectivity and throughput. The resulting Delaunay
		 triangulation can be determined locally at each node.
		 The topology is modified by negotiating among neighbors
		 to satisfy a design requirement on the nodal degree
		 parameter. Simulations show that (1) the final topology
		 is degree-bounded, (2) it has a rather regular and
		 uniform structure, and (3) its throughput and
		 reliability are greater than that of a number of
		 alternative topologies. 25 Refs."
}

@book{h-ipnf-69
, author =	"T. C. Hu"
, title =	"Integer programming and network flows"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1969
, update =	"98.03 bibrelex"
}

@techreport{hkr-orppg-92
, author =	"T. C. Hu and Andrew B. Kahng and Gabriel Robins"
, title =	"Optimal Robust Path Planning in General Environments"
, type =	"Manuscript"
, year =	1992
, precedes =	"hkr-orppg-93"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@article{hkr-orppg-93
, author =	"T. C. Hu and Andrew B. Kahng and Gabriel Robins"
, title =	"Optimal Robust Path Planning in General Environments"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	9
, number =	6
, month =	dec
, year =	1993
, pages =	"775--784"
, succeeds =	"hkr-orppg-92"
, update =	"98.03 mitchell"
, abstract =	"
We address robust path planning for a mobile agent in a general
environment by finding minimum cost source-destination paths having
prescribed widths. The main result is a new approach that optimally
solves the robust path planning problem using an efficient network
flow formulation. Our algorithm represents a significant departure
from conventional shortest-path or graph search based methods; it not
only handles environments with solid polygonal obstacles, but also
generalizes to arbitrary cost maps that may arise in modeling
incomplete or uncertain knowledge of the environment. Simple
extensions allow us to address higher dimensional problem instances
and minimum-surface computations; the latter is a result of
independent interest. We use an efficient implementation to exhibit
optimal path-planning solutions for a variety of test problems. The
paper concludes with open issues and directions for future work.
Addresses:
HU TC, UNIV CALIF SAN DIEGO, DEPT COMP SCI \& ENGN, LA JOLLA, CA 92093.
UNIV CALIF LOS ANGELES, DEPT COMP SCI, LOS ANGELES, CA 90024.
UNIV VIRGINIA, DEPT COMP SCI, CHARLOTTESVILLE, VA 22903."
}

@article{hs-oafno-81
, author =	"T. C. Hu and M.-T. Shing"
, title =	"An {$O(n)$} algorithm to find a near-optimum partition of a convex polygon"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"122--138"
}

@inproceedings{h-odcbl-90
, author =	"A. Huang"
, title =	"Optical digital computing at {Bell} {Labs}"
, booktitle =	"1990 International Topical Meeting on Optical Computing"
, site =	"Kobe, Japan"
, year =	1990
, update =	"98.03 bibrelex"
}

@inproceedings{hmns-narp-95
, author =	"Jian Huang and Anil Maheshwari and Doron Nussbaum and J{\"o}rg-R{\"u}diger Sack"
, title =	"A Note on Approximations of Rectilinear Polygons"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"43--48"
, update =	"95.09 jones"
}

@techreport{hhh-icgts-85
, author =	"J. M. Huang and P. Huang and Y. P. Huang"
, title =	"Interactive computer graphics in topographical simulation"
, type =	"Manuscript"
, institution =	"??"
, year =	1985
}

@inproceedings{hc-psdps-83
, author =	"J. S. Huang and Y. C. Chow"
, title =	"Parallel sorting and data partitioning by sampling"
, booktitle =	"Proc. IEEE 7th Int. Computer Software and Applications Conference"
, year =	1983
, pages =	"627--631"
, update =	"96.09 orourke"
}

@article{hl-ifsea-85
, author =	"M.-D. A. Huang and K. J. Lieberherr"
, title =	"Implications of forbidden structures for extremal algorithmic problems"
, journal =	"Theoret. Comput. Sci."
, volume =	40
, year =	1985
, pages =	"195--210"
}

@techreport{h-pcprn-91
, author =	"N.-F. Huang"
, title =	"The power connecting problem on a radio network"
, institution =	"Dept. of Comput. Sci., National Tsing Hua Univ., Hsinchu, Taiwan 300, Republic of China"
, year =	1991
, update =	"00.03 bibrelex"
}

@inproceedings{hxc-gphds-01
, author =	"Y. Huang and J. Xu and D. Z. Chen"
, title =	"Geometric Permutations of High Dimensional Spheres"
, booktitle =	"Proc. 12th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '01"
, year =	2001
, pages =	"244--245"
, update =	"01.04 orourke"
}

@article{h-tingt-89
, author =	"Yih-Ping Huang"
, title =	"Triangular Irregular Network Generation and Topographical Modeling"
, journal =	"Computers in Industry"
, volume =	12
, year =	1989
, pages =	"203--213"
, annote =	"Program for a CT. Three different measures of goodness
		 used in incompatible ways!! Initial triangulation is
		 built by on edges by taking the first point that
		 subtends a sufficiently angle (6 degrees seemed to work
		 well). Then a LOT based on shortest diagonal is
		 produced (but with an additional unspecified rule to
		 avoid really skinny triangles!). Finally a third
		 measure is used to evaluate the
		 triangulation---triangle quality is (area of
		 equilateral tri with same perimeter)/area. Then the
		 triangulation quality is the weighted-by-area average
		 of this (Note that this is a rotten measure---really
		 skinny triangles have low areas). Measured performance
		 is $O(n^{2.5})$. Oh yes, bucketing is used to speed the
		 search in triangle building. God knows how slow it
		 would have been without bucketing. (Like 2 cpu hours
		 for 1500 points!)"
}

@inproceedings{hch-rfomr-86
, author =	"Y. Y. Huang and Z. Cao and E. l. Hall"
, title =	"Region filling operations for mobile robots using computer graphics"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1986
, pages =	"1607--1614"
, update =	"98.07 bibrelex"
}

@techreport{hch-rfomr-85
, author =	"Y. Y. Huang and Z. L. Cao and E. L. Hall"
, title =	"Region filling operations for mobile robots using computer graphics"
, type =	"Report"
, number =	"??"
, institution =	"Center Rob. Res., Univ. Cincinnati"
, address =	"Cincinnati, OH"
, year =	1985
}

@article{h-apstc-96
, author =	"P. M. Hubbard"
, title =	"Approximating Polyhedra with Spheres for Time-Critical Collision Detection"
, journal =	"ACM Trans. Graph."
, volume =	15
, number =	3
, month =	jul
, year =	1996
, pages =	"179--210"
, update =	"97.03 held"
}

@article{h-cdiga-95
, author =	"Philip M. Hubbard"
, title =	"Collision detection for interactive graphics applications"
, journal =	"IEEE Trans. Visualization and Computer Graphics"
, volume =	1
, number =	3
, month =	sep
, year =	1995
, pages =	"218--230"
, keywords =	"collision detection, intersection detection, sphere trees"
, update =	"96.09 devillers, 96.01 mitchell"
}

@article{h-iarat-96
, author =	"Philip M. Hubbard"
, title =	"Improving Accuracy in a Robust Algorithm for Three-Dimensional {Voronoi} Diagrams"
, journal =	"Journal of Graphics Tools"
, volume =	1
, number =	1
, year =	1996
, pages =	"33--47"
, update =	"96.09 held+hubbard"
, annote =	"Extends \cite{iss-nriac-92}"
, abstract =	"This paper describes extensions to a previous algorithm that
                 robustly builds three-dimensional Voronoi diagrams in the
                 presence of inexact numerical computations.  The extensions
                 improve the algorithm's accuracy, making its results more
                 nearly represent the proximity properties of an ideal
                 Voronoi diagram.  In empirical tests, these extensions have
                 improved accuracy by more than eight orders of magnitude.
                 Complete pseudocode for the algorithm appears in an appendix
                 of this paper."
}

@inproceedings{h-icd-93
, author =	"P. M. Hubbard"
, title =	"Interactive Collision Detection"
, booktitle =	"Proc. IEEE Symposium on Research Frontiers in Virtual Reality"
, year =	1993
, pages =	"24--31"
, update =	"95.01 mitchell"
}

@techreport{h-stbcd-93
, author =	"P. M. Hubbard"
, title =	"Space-Time Bounds for Collision Detection"
, type =	"Technical Report CS-93-04"
, institution =	"Dept. of Computer Science, Brown University"
, month =	feb
, year =	1993
, update =	"95.01 mitchell"
}

@article{hw-rffam-68
, author =	"D. H. Hubel and T. N. Wiesel"
, title =	"Receptive fields and functional architecture of monkey striate cortex"
, journal =	"J. Physiol. (London)"
, volume =	195
, year =	1968
, pages =	"215--243"
, update =	"98.07 bibrelex"
}

@article{hw-srgoc-74
, author =	"D. H. Hubel and T. N. Wiesel"
, title =	"Sequence regularity and geometry of orientation columns in the monkey striate cortex"
, journal =	"J. Comp. Neurol."
, volume =	158
, year =	1974
, pages =	"267--293"
, update =	"98.07 bibrelex"
}

@mastersthesis{h-radeu-84
, author =	"F. Huber"
, title =	"Rekursive {Aufteilungen} der {Ebene} und des {Raumes} f{\"u}r {Bereichsuchverfahren}"
, type =	"{Dipl.-Ing.} master thesis"
, school =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1984
, keywords =	"master thesis"
, comments =	"61 pp."
, update =	"93.09 rote"
}

@article{h-rsr-72
, author =	"P. J. Huber"
, title =	"Robust statistics: a review"
, journal =	"Ann. Math. Statist."
, volume =	43
, number =	3
, year =	1972
, pages =	"1041--1067"
, update =	"98.07 bibrelex"
}

@techreport{hr-cdr-97
, author =	"Mia Hubert and Peter J. Rousseeuw"
, title =	"The Catline for Deep Regression"
, type =	"Manuscript"
, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
, year =	1997
, keywords =	"breakdown value, heteroscedasticity, influence function, regression depth, robust regression"
, comments =	"to appear, Journal of Multivariate Analysis"
, update =	"98.07 mitchell"
, abstract =	"
Motivated by the notion of regression depth (Rousseeuw and Hubert
1996) we introduce the catline, a new method for simple linear
regression. At any bivariate data set $Z_n=\{(x_i,y_i);i=1,...,n\}$
its regression depth is at least n/3. This lower bound is attained for
data lying on a convex or concave curve, whereas for perfectly linear
data the catline attains a depth of n. We construct an O(n log n)
algorithm for the catline, so it can be computed fast in practice. The
catline is Fisher-consistent at any linear model y=bx +a + e in which
the error distribution satisfies med(e|x)=0, which encompasses skewed
and/or heteroscedastic errors. The breakdown value of the catline is
1/3, and its influence function is bounded. At the bivariate gaussian
distribution its asymptotic relative efficiency compared to the L1
line is 79.3\% for the slope, and 88.9\% for the intercept. The
finite-sample efficiencies are in close agreement with these
values. This combination of properties makes the catline an attractive
fitting method."
}

@article{hkv-dchfs-81
, author =	"A. H{\"u}bler and R. Klette and K. Vob"
, title =	"Determination of the convex hull of a finite set of planar points within linear time"
, journal =	"Elektron. Informationsverarb. Kybernet."
, volume =	17
, year =	1981
, pages =	"121--139"
}

@article{hz-ffchs-82
, author =	"H. Hubschman and S. W. Zucker"
, title =	"Frame-to-frame coherence and the hidden surface computation: constraints for a convex world"
, journal =	"ACM Trans. Graph."
, volume =	1
, year =	1982
, pages =	"129--162"
}

@inproceedings{h-gaa-88
, author =	"U. Huckenbeck"
, title =	"Geometrical abstract automata"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"217--231"
, keywords =	"computational model"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@techreport{h-gm-86
, author =	"U. Huckenbeck"
, title =	"Geometrische {Maschinenmodelle}"
, type =	"Report"
, number =	"??"
, institution =	"Bayerische Julius-Maximilians-Univ."
, address =	"W{\"u}rzburg, West Germany"
, year =	1986
}

@inproceedings{h-kaogr-90
, author =	"Ulrich Huckenbeck"
, title =	"{Kreisscheiben} als {Orakel} f{\"u}r geometrische {Random} {Access} {Machines}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	14
, update =	"00.03 bibrelex"
}

@inproceedings{h-uazlm-89
, author =	"U. Huckenbeck"
, title =	"{{\"U}ber} die {Ausdrucksm{\"a}chtigkeit} von {Zirkel-} und {Lineal}-{Maschinen}, die die {Gleicheit} von {Punkten} entscheiden k{\"o}nnen"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@article{hm-ndsrs-82
, author =	"S. Huddleston and K. Mehlhorn"
, title =	"A New Data Structure for Representing Sorted Lists"
, journal =	"Acta Inform."
, volume =	17
, year =	1982
, pages =	"157--184"
, update =	"94.01 tamassia"
}

@inproceedings{hmclhz-aocus-97
, author =	"T. Hudson and D. Manocha and J. Cohen and M. Lin and K. Hoff and H. Zhang"
, title =	"Accelerated Occlusion Culling Using Shadow Frustra"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"1--10"
, cites =	"arb-tiriu-90, bcgmt-bhrs3-96, bdeg-vmpv-94, c-oaitd-89, c-hgmvs-76, c-arscg-88, clmp-iciec-95, c-sacg-77, ct-tccv-96, ct-rtocm-97, d-soshs-94, fdfh-cgpp-90, fkn-vsgpt-80, f-riga-96, gbw-ivlgd-90, gcs-ecrag-91, gjk-fpcdb-88, gkm-hzbv-93, glm-othsr-96, g-dirsc-94, hhk-rsops-89, hkm-ecdmv-95, kk-rtcs-86, lc-eaidc-91, lg-pmsfe-95, m-wcohs-87, mn-lpcgc-95, ms-foscp-85, m-eahsr-89, n-isgpt-92, s-lpchm-90, sss-cthsa-74, ts-vpiw-91, yr-vcewc-96, zmhh-vcuho-97t, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{hj-gifdg-68
, author =	"D. L. Huff and G. F. Jenks"
, title =	"A geographic interpretation of the friction of distance in gravity models"
, journal =	"Annals of the Association of American Geographers"
, volume =	"??"
, year =	1968
, update =	"97.11 bibrelex"
}

@article{hl-ius-79
, author =	"D. L. Huff and J. M. Lutz"
, title =	"Ireland's urban system"
, journal =	"Economic Geography"
, volume =	"??"
, year =	1979
, update =	"97.11 bibrelex"
}

@article{h-dcaps-77
, author =	"D. Huffman"
, title =	"A duality concept for the analysis of polyhedral scenes"
, journal =	"Machine Intelligence"
, volume =	8
, year =	1977
, pages =	"475--492"
, update =	"97.11 bibrelex"
}

@article{h-ions-71
, author =	"D. Huffman"
, title =	"Impossible objects as nonsense sentences"
, journal =	"Machine Intelligence"
, volume =	6
, year =	1971
, pages =	"295--323"
, update =	"97.11 bibrelex"
}

@article{h-ccpp-76
, author =	"D. A. Huffman"
, title =	"Curvatures and creases: a primer on paper"
, journal =	"IEEE Trans. Comput."
, volume =	"C-25"
, year =	1976
, pages =	"1010--1019"
, update =	"97.11 bibrelex"
}

@phdthesis{h-apbmt-95
, author =	"A. Hufnagel"
, title =	"Algorithmic problems in {Brunn}-{Minkowski} theory"
, school =	"??"
, address =	"Trier, Germany"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{h-gamp-97
, author =	"K. Hui"
, title =	"Geometric aspects of mouldability of parts"
, journal =	"Comput. Aided Design"
, volume =	29
, year =	1997
, pages =	"107--208"
, update =	"98.07 bibrelex"
}

@article{ht-mdsoh-92
, author =	"K. Hui and S. Tan"
, title =	"Mould design with sweep operations - a heuristic search approach"
, journal =	"Comput. Aided Design"
, volume =	24
, year =	1992
, pages =	"81--91"
, update =	"98.07 bibrelex"
}

@article{h-ssisa-94
, author =	"K. C. Hui"
, title =	"Solid Sweeping in Image Space -- Application in {NC} Simulation"
, journal =	"Visual Comput."
, volume =	10
, number =	6
, year =	1994
, pages =	"306--316"
, update =	"96.01 held"
}

@article{hk-dppsm-95
, author =	"K. C. Hui and Y. M. Kan"
, title =	"Data Partitioning for Parallel Solid Modeling"
, journal =	"Visual Comput."
, volume =	11
, number =	10
, year =	1995
, pages =	"526--541"
, update =	"96.05 held"
}

@incollection{hj-r3dor-88
, author =	"D. P. Huijsmans and G. H. Jense"
, title =	"Representation of 3${D}$ Objects Reconstructed from Series of Parallel 2${D}$ Slices"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"1031--1038"
, isbn =	"3-540-19506-8"
, update =	"93.09 held"
}

@article{h-ajddb-83
, author =	"R. Hull"
, title =	"Acyclic join dependency and data base projections"
, journal =	"J. Comput. Syst. Sci."
, volume =	27
, year =	1983
, pages =	"331--349"
}

@article{h-mfo-94
, author =	"T. Hull"
, title =	"On the mathematics of flat origamis"
, journal =	"Congr. Numer."
, volume =	100
, year =	1994
, pages =	"215--224"
, update =	"97.11 bibrelex"
}

@inproceedings{hmpt-agdsa-97
, author =	"Christoph Hundack and Petra Mutzel and Igor Pouchkarev and Stefan Thome"
, title =	"{\em ArchE}: A Graph Drawing System for Archaeology"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"297--302"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{hi-cchqs-95
, author =	"Chao-Kuei Hung and Doug Ierardi"
, title =	"Constructing Convex Hulls of Quadratic Surface Patches"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"255--260"
, update =	"95.09 jones"
}

@article{hp-asdmr-94
, author =	"C. Y. Hung and B. Parhami"
, title =	"An approximate sign detection method for residue numbers and its applications to {RNS} division"
, journal =	"Comput. Math. Appl."
, volume =	27
, number =	4
, year =	1994
, pages =	"23--35"
, update =	"98.07 bibrelex"
}

@inproceedings{hc-qpp-91
, author =	"Yung-Chen Hung and Gen-Huey Chen"
, title =	"On the Quickest Path Problem"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	497
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@techreport{hg-nmcdt-86
, author =	"C. J. Hunt and C. Greenough"
, title =	"Novel Method for the Computation of the {Delaunay} Triangulation with a View to Efficient Use of Parallel Architectures"
, number =	"RAL-86-090"
, institution =	"Science and Engineering Research Council, Chilton (England). Rutherford Appleton Lab."
, month =	oct
, year =	1986
, keywords =	"foreign technology, Delaunay triangulation, mapping (transformations), mesh generation, ntistfser"
, update =	"93.09 rote"
, abstract =	"In recent years a multitude of techniques have been
		 presented for generating the Delaunay triangulation of
		 a set of points in the plane. Many of these methods
		 have been extended to connect points in three
		 dimensions with varied success. All of these methods
		 are serial processes. Nodes must be added one by one to
		 an existing Delaunay triangulation. Consequently
		 although these methods may be efficient on a serial
		 machine, they cannot exploit the full potential of
		 highly parallel architectures. In the report the
		 authors discuss an alternative method for computing the
		 Delaunay triangulation of a set of points in the plane.
		 The algorithm is optimal in performance on a serial
		 machine computing the triangulation in order N(log to
		 the base 2)N time for N nodes. In addition it appears
		 that the algorithm will transport to an array processor
		 giving order (log to the base 2)N time for N nodes. The
		 algorithm has potential for extension into higher space
		 dimensions. The research has application for the
		 simulation of semiconductor devices."
}

@inproceedings{hmrrrs-uaasn-95
, author =	"H. B. {Hunt III} and M. V. Marathe and V. Radhakrishnan and S. S. Ravi and D. J. Rosenkrantz and R. E. Stearns"
, title =	"A unified approach to approximation schemes for {NP}- and {PSPACE}-hard problems for geometric graphs"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, year =	1995
, pages =	"424--435"
, update =	"97.07 agarwal"
}

@book{h-kgm-78
, author =	"K. H. Hunt"
, title =	"Kinematic geometry of mechanisms"
, publisher =	"Oxford University Press"
, address =	"New York"
, year =	1978
, update =	"00.11 smid, 00.07 icking, 98.07 orourke"
}

@techreport{hv-esavp-82
, author =	"W. A. Hunt and H. B. Voelcker"
, title =	"An Exploratory Study of Automatic Verification of Programs for Numerically Controlled Machine Tools"
, type =	"Production Automation Project Tech Memo"
, number =	34
, institution =	"Univ. Rochester"
, address =	"Rochester, NY"
, month =	jan
, year =	1982
, update =	"98.03 bibrelex"
}

@phdthesis{h-ecdsg-78
, author =	"G. M. Hunter"
, title =	"Efficient computation and data structures for graphics"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
, address =	"Princeton, NY"
, year =	1978
, keywords =	"doctoral thesis"
}

@article{hs-ltprq-79
, author =	"G. M. Hunter and K. Steiglitz"
, title =	"Linear transformations of pictures represented by quad trees"
, journal =	"Comput. Graph. Image Process."
, volume =	10
, year =	1979
, pages =	"289--296"
}

@article{hs-oiuqt-79
, author =	"G. M. Hunter and K. Steiglitz"
, title =	"Operations on images using quad trees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-1"
, year =	1979
, pages =	"145--153"
}

@book{hw-dt-48
, author =	"W. Hurewitcz and H. Wallman"
, title =	"Dimension Theory"
, publisher =	"Princeton University Press"
, year =	1948
, update =	"98.03 bibrelex"
}

@inproceedings{h-ltw-93
, author =	"F. Hurtado"
, title =	"Looking through a window"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"234--239"
, cites =	"bhot-oaa-93, h-pgv-93, t-stc-88, t-wpop-89, abdeghz-umpca-93, abdeghz-ump2, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@phdthesis{h-pgv-93
, author =	"F. Hurtado"
, title =	"Problemas geom{\'e}tricos de visibilidad"
, school =	"Univ. Polit{\'e}cnica de Catalunya"
, month =	jan
, year =	1993
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{hlm-osrap-01
, author =	"Ferran Hurtado and Giuseppe Liotta and Henk Meijer"
, title =	"Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"117--120"
, update =	"01.04 icking"
}

@inproceedings{hmrs-tpslp-99
, author =	"Ferran Hurtado and Merc{\`e} Mora and Pedro A. Ramos and Carlos Seara"
, title =	"Two Problems on Separability with Lines and Polygonals"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"33--35"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{hn-ctacp-97
, author =	"F. Hurtado and M. Noy"
, title =	"Counting triangulations of almost-convex polygons"
, journal =	"Ars Combin."
, volume =	45
, year =	1997
, pages =	"169--179"
, update =	"99.11 smid"
}

@article{hn-etcn-96
, author =	"F. Hurtado and M. Noy"
, title =	"Ears of triangulations and {Catalan} numbers"
, journal =	"Discrete Math."
, volume =	149
, year =	1996
, pages =	"319--324"
, update =	"99.11 smid"
}

@article{hn-gtcpt-99
, author =	"F. Hurtado and M. Noy"
, title =	"Graph of triangulations of a convex polygon and tree of triangulations"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"179--188"
, update =	"99.11 smid"
}

@techreport{hn-gtcp-94
, author =	"F. Hurtado and M. Noy"
, title =	"The Graph of Triangulations of a Convex Polygon"
, number =	"MA2-IR-94-13"
, institution =	"Universitat Polit{\`e}cnica de Catalunya, Spain"
, year =	1994
, precedes =	"hn-gtcp-95"
, update =	"00.11 smid, 00.07 icking, 97.11 bibrelex, 97.03 devillers, 93.09 held"
}

@inproceedings{hn-gtcp-95
, author =	"F. Hurtado and M. Noy"
, title =	"The Graph of Triangulations of a Convex Polygon"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"11--12"
, succeeds =	"hn-gtcp-94"
, precedes =	"hn-gtcp-96"
, update =	"00.11 smid, 00.07 icking, 00.03 bibrelex"
}

@inproceedings{hn-gtcp-96
, author =	"F. Hurtado and M. Noy"
, title =	"The Graph of Triangulations of a Convex Polygon"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C7--C8"
, succeeds =	"hn-gtcp-95"
, cites =	"f-nddf-87, hn-gtcp-94, hnu-fet-96, kt-rduf-??, l-atng-89, l-rgbth-88, lrr-rgbth-93, stt-rdthg-86, ZZZ"
, update =	"00.11 smid, 00.07 icking, 97.11 bibrelex, 96.05 efrat"
}

@techreport{hn-tvgrv-93t
, author =	"F. Hurtado and M. Noy"
, title =	"Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon"
, number =	"MA2-IR-93-2"
, institution =	"Dept. Applied Mathematics, U. Polit\`ecnica de Catalunya, Spain"
, month =	feb
, year =	1993
, precedes =	"hn-tvgrv-96"
, update =	"97.11 icking, 97.03 devillers, 93.09 held"
}

@inproceedings{hn-tvgrv-93i
, author =	"Ferran Hurtado and M. Noy"
, title =	"Triangulations, Visibility Graph and Reflex Vertices of a Simple polygon"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"36--39"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{hn-tvgrv-96
, author =	"F. Hurtado and M. Noy"
, title =	"Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"355--369"
, succeeds =	"hn-tvgrv-93t, hn-tvgrv-93i"
, update =	"98.03 bibrelex, 97.03 devillers"
}

@inproceedings{hnrs-sopws-98
, author =	"Ferran Hurtado and Marc Noy and Pedro A. Ramos and Carlos Seara"
, title =	"Separating Objects in the Plane with Wedges and Strips"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"97--98"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{hnu-fet-96
, author =	"F. Hurtado and M. Noy and J. Urrutia"
, title =	"Flipping Edges in Triangulations"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"214--223"
, cites =	"ahms-htfr-94, b-ras-77, be-mgot-92i, bs-plibp-94, ff-mrnti-91, f-vddt-92, h-ncmmt-90, hn-gtcp-94, hn-tvgrv-96, h-femgm-88, kgv-osa-83, la-satp-87, l-scsi-77, lrr-rgbth-93, ls-sdiuc-94, l-rgbth-88, obs-stcav-92, qs-csfdd-90, s-jttm-87, ss-gbfam-88, s-tc-93, sr-sbuss-95, sntm-amgus-92, stt-rdthg-88, t-nrcgr-86, w-cqsis-92, wp-sst-84, y-cdcrc-75, zt-fem-89, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{hnu-fet-99
, author =	"F. Hurtado and M. Noy and J. Urrutia"
, title =	"Flipping Edges in Triangulations"
, journal =	"Discrete Comput. Geom."
, volume =	22
, number =	3
, year =	1999
, pages =	"333--346"
, update =	"99.11 held"
}

@proceedings{ht-ewcg-98
, title =	"Abstracts 14th European Workshop Comput. Geom."
, editor =	"Ferran Hurtado and Joan Trias"
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, update =	"00.03 bibrelex"
}

@inproceedings{hnu-fetpp-96
, author =	"Ferran Hurtatdo and Marc Noy and Jorge Urrutia"
, title =	"Flipping edges in Triangulations of Polygons and Point Sets"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"19--20"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{hsw-sclp-75
, author =	"A. Hurter and M. Schaeffer and R. Wendell"
, title =	"Solutions of Constrained Location Problems"
, journal =	"Manage. Sci."
, volume =	22
, year =	1975
, pages =	"51--56"
, update =	"97.03 rote, 93.09 milone+mitchell"
}

@inproceedings{hklmnrs-pnm-96
, author =	"D. Hutchinson and L. K{\"u}ttner and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
, title =	"Parallel Neighbourhood Modeling"
, booktitle =	"Proc. 8th ACM Sympos. Parallel Algorithms Architect."
, nickname =	"SPAA '96"
, site =	"Padua, Italy"
, year =	1996
, pages =	"204--207"
, update =	"98.07 bibrelex, 97.11 sack"
}

@inproceedings{hlmnrs-pnm-96
, author =	"D. Hutchinson and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
, title =	"Parallel neighbourhood modeling"
, booktitle =	"Proc. 4th ACM Workshop Adv. Geogr. Inform. Syst."
, year =	1996
, pages =	"25--34"
, update =	"98.07 bibrelex"
}

@inproceedings{hlmnrs-pnm-97
, author =	"D. Hutchinson and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
, title =	"Parallel Neighbourhood Modeling"
, booktitle =	"Proc. ACM GIS"
, year =	1997
, pages =	"26--34"
, update =	"97.11 sack"
, annote =	"full conference version"
}

@inproceedings{hmsv-eeibt-97
, author =	"D. Hutchinson and A. Maheshwari and J.-R. Sack and R. Velicescu"
, title =	"Early Experiences in Implementing the Buffer Tree"
, booktitle =	"Proc. Workshop on Algorithm Engineering"
, nickname =	"WAE '97"
, site =	"Venice"
, month =	sep
, year =	1997
, pages =	"92--103"
, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap10.ps.gz"
, update =	"00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell"
}

@inproceedings{hmz-emdss-99
, author =	"David Hutchinson and Anil Maheshwari and Norbert Zeh"
, title =	"An External Memory Data Structure for Shortest Path Queries"
, booktitle =	"Proc. 5th Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '99"
, site =	"Tokyo, Japan"
, series =	"Lecture Notes Comput. Sci."
, volume =	1627
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"51--60"
, update =	"01.04 smid, 99.11 bibrelex"
}

@inproceedings{hsv-rsttg-96
, author =	"J. P. Hutchinson and T. Shermer and A. Vince"
, title =	"On representations of some thickness-two graphs"
, editor =	"F. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"324--332"
, keywords =	"visibility graphs"
, update =	"99.07 vismara, 98.11 bibrelex, 97.11 orourke, 96.09 orourke"
}

@article{hsv-rsttg-99
, author =	"J. P. Hutchinson and T. Shermer and A. Vince"
, title =	"On representations of some thickness-two graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"161--171"
, update =	"99.11 smid"
}

@inproceedings{hsw-gopml-88
, author =	"A. Hutflesz and H.-W. Six and P. Widmayer"
, title =	"Globally order preserving multidimensional linear hashing"
, booktitle =	"Proc. 4th Intl. Conf. on Data Engineering"
, year =	1988
, pages =	"572--579"
, update =	"97.07 agarwal"
}

@inproceedings{hsw-trfea-90
, author =	"A. Hutflesz and H.-W. Six and P. Widmayer"
, title =	"The {R}-file: {A}n efficient access structure for proximity queries"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Data Eng."
, year =	1990
, pages =	"372--379"
, update =	"97.07 agarwal"
}

@inproceedings{hsw-tgfpe-88
, author =	"A. Hutflesz and H.-W. Six and P. Widmayer"
, title =	"Twin grid files: a performance evaluation"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"15--24"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@inproceedings{hsw-tgfso-88
, author =	"A. Hutflesz and H.-W. Six and P. Widmayer"
, title =	"Twin grid files: {S}pace optimizing access schemes"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1988
, pages =	"183--190"
, update =	"97.07 agarwal"
}

@techreport{hr-mrtci-92
, author =	"D. P. Huttenlocher"
, title =	"A multi-resolution technique for comparing images using the {Hausdorff} distance"
, type =	"Technical {Report}"
, number =	"92-1321"
, institution =	"Cornell Univ."
, address =	"Ithaca, NY"
, year =	1992
, update =	"98.07 bibrelex"
}

@phdthesis{h-tdrso-88
, author =	"D. P. Huttenlocher"
, title =	"Three-Dimensional Recognition of Solid Objects from a Two-Dimensional Image"
, type =	"Ph.{D}. Thesis"
, school =	"Electrical Engineering and Computer Science, Massachusetts Institute of Technology"
, year =	1988
, note =	"Report TR-1045"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@inproceedings{hk-cmhdp-90
, author =	"D. P. Huttenlocher and K. Kedem"
, title =	"Computing the minimum {Hausdorff} distance for point sets under translation"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"340--349"
, cites =	"achkm-ecmcp-90, amww-cssgo-88, a-ltahd-83, cd-vdbcd-85, egs-ueplf-87, hks-echdp-, h-rv-86, k-emasg-39, os-mvm-90, ls-pptmc-87, m-mdscg-84, r-ra-68, s-cidg-79, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{hkk-dvdmh-92t
, author =	"D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
, title =	"On dynamic {Voronoi} diagrams and the minimum {Hausdorff} distance for point sets under {Euclidean} motion in the plane"
, type =	"Technical {Report}"
, number =	"TR~92-1271"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	mar
, year =	1992
, precedes =	"hkk-dvdmh-92i"
}

@inproceedings{hkk-dvdmh-92i
, author =	"D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
, title =	"On dynamic {Voronoi} diagrams and the minimum {Hausdorff} distance for point sets under {Euclidean} motion in the plane"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"110--119"
, succeeds =	"hkk-dvdmh-92t"
, cites =	"aiit-mlcop-90, ass-sulbl-89, ast-apsgo-92, abb-amps-91, achkm-ecmcp-90, fl-vdmpp-91, gmr-vdmpp-92, gs-pmgsc-85, hs-ndssg-86, hk-cmhdp-90, hks-uevsi-91, m-prsd-87, ZZZ"
, update =	"99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
}

@article{hkk-vdrms-92
, author =	"D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
, title =	"{Voronoi} diagrams of rigidly moving sets of points"
, journal =	"Inform. Process. Lett."
, volume =	43
, year =	1992
, pages =	"217--223"
, update =	"01.04 icking, 95.09 agarwal"
}

@unpublished{hks-echdp-
, author =	"D. P. Huttenlocher and K. Kedem and Micha Sharir"
, title =	"Efficiently Computing the {Hausdorff} Distance for Point Sets Under Translation"
, note =	"In preparation"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{hks-uevsi-91t
, author =	"D. P. Huttenlocher and K. Kedem and Micha Sharir"
, title =	"The upper envelope of {Voronoi} surfaces and its applications"
, type =	"Technical {Report}"
, number =	"200/91"
, institution =	"Dept. Comput. Sci., Tel-Aviv University"
, address =	"Tel-Aviv, Israel"
, month =	feb
, year =	1991
, precedes =	"hks-uevsi-91"
, update =	"01.04 icking, 98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{hks-uevsi-91
, author =	"D. P. Huttenlocher and K. Kedem and Micha Sharir"
, title =	"The upper envelope of {Voronoi} surfaces and its applications"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"194--203"
, keywords =	"Voronoi diagrams, upper envelopes, matching"
, succeeds =	"hks-uevsi-91t"
, precedes =	"hks-uevsi-93"
, cites =	"abb-mrps-, ass-sulbl-89, a-vdsfg-90, cd-vdbcd-85, e-acg-87, egppss-acptc-88, egs-ueplf-89, egs-ccmfa-90, es-vda-86, gss-gmppt-89, h-fuenl-89, h-rv-86, hk-cmhdp-90, hks-uevsi-91t, hs-ndssg-86, ls-ippvd-87, ps-ueplf-89, ps-cgi-85, ss-pmp2g-83, y-oavds-87, ZZZ"
, update =	"01.04 icking, 98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex"
}

@article{hks-uevsi-93
, author =	"D. P. Huttenlocher and K. Kedem and Micha Sharir"
, title =	"The upper envelope of {Voronoi} surfaces and its applications"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"267--291"
, succeeds =	"hks-uevsi-91"
, update =	"01.04 icking, 98.03 mitchell, 95.09 agarwal, 94.05 sharir"
}

@article{hkr-ciuhd-93
, author =	"D. P. Huttenlocher and G. A. Klanderman and W. J. Rucklidge"
, title =	"Comparing Images Using the {Hausdorff} Distance"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	15
, year =	1993
, pages =	"850--863"
, update =	"98.11 bibrelex, 98.07 agarwal, 97.11 bibrelex"
}

@inproceedings{hk-cpsup-94
, author =	"D. P. Huttenlocher and J. M. Kleinberg"
, title =	"Comparing point sets under projection"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"1--7"
, update =	"96.09 agarwal"
}

@inproceedings{hu-orua-87
, author =	"D. P. Huttenlocher and S. Ullman"
, title =	"Object recognition using alignment"
, booktitle =	"Proc. 1st Internat. Conf. Comput. Vision"
, year =	1987
, pages =	"102--111"
, update =	"97.11 bibrelex"
}

@article{hu-rsoa-90
, author =	"D. P. Huttenlocher and S. Ullman"
, title =	"Recognizing solid objects by alignment"
, journal =	"Internat. J. Comput. Vision"
, volume =	5
, number =	2
, year =	1990
, pages =	"255--274"
, update =	"97.11 bibrelex"
}

@techreport{hu-rsoai-89
, author =	"D. P. Huttenlocher and S. Ullman"
, title =	"Recognizing solid objects by alignment with an image"
, type =	"Technical {Report}"
, number =	"TR~89-978"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	mar
, year =	1989
, update =	"93.09 milone+mitchell"
}

@techreport{hw-fcegi-90
, author =	"D. P. Huttenlocher and P. Wayener"
, title =	"Finding convex edge groupings in an image"
, type =	"Technical {Report}"
, number =	"TR~90-1116"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	apr
, year =	1990
, update =	"95.09 agarwal, 93.09 milone+mitchell"
}

@inproceedings{hl-updss-91
, author =	"M. D. Hutton and A. Lubiw"
, title =	"Upward Planar Drawing of Single Source Acyclic Digraphs"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"203--211"
, keywords =	"graph drawing, planar, upward"
, precedes =	"hl-updss-96"
, update =	"97.03 tamassia, 93.09 tamassia"
}

@article{hl-updss-96
, author =	"M. D. Hutton and A. Lubiw"
, title =	"Upward Planar Drawing of Single-Source Acyclic Digraphs"
, journal =	"SIAM J. Comput."
, volume =	25
, number =	2
, year =	1996
, pages =	"291--311"
, keywords =	"graph drawing, planar, upward"
, succeeds =	"hl-updss-91"
, update =	"97.03 tamassia"
}

@article{h-eslp-90
, author =	"M. N. Huxley"
, title =	"Exponential sums and lattice points"
, journal =	"Proc. London Math. Soc."
, volume =	60
, year =	1990
, pages =	"471--502"
, update =	"97.11 bibrelex"
}

@inproceedings{hz-scthc-95
, author =	"Cho Hwan-Gue and Alexander Zelikovsky"
, title =	"Spanning Closed Trail and {Hamiltonian} Cycle in Grid Graphs"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"342--351"
, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@article{hr-stp-92
, author =	"F. D. Hwang and D. S. Richards"
, title =	"Steiner tree problems"
, journal =	"Networks"
, volume =	22
, year =	1992
, pages =	"55--89"
, update =	"98.11 bibrelex"
}

% also claimed pages = "86--91"
@article{h-oarms-79
, author =	"F. K. Hwang"
, title =	"An {$O(n \log n)$} algorithm for rectilinear minimal spanning tree"
, journal =	"J. ACM"
, volume =	26
, year =	1979
, pages =	"177--182"
}

@article{h-oasrs-79
, author =	"F. K. Hwang"
, title =	"An {$O(n \log n)$} algorithm for suboptimal rectilinear {Steiner} trees"
, journal =	"IEEE Trans. Circuits Syst."
, volume =	"CAS-26"
, number =	1
, year =	1979
, pages =	"75--77"
, update =	"98.07 bibrelex"
}

@article{h-smtrd-76
, author =	"F. K. Hwang"
, title =	"On {Steiner} minimal trees with rectilinear distance"
, journal =	"SIAM J. Appl. Math."
, volume =	30
, number =	1
, year =	1976
, pages =	"104--114"
}

@article{h-rsp-78
, author =	"F. K. Hwang"
, title =	"The rectilinear {Steiner} problem"
, journal =	"J. Design Autom. Fault-Tolerant Comput."
, volume =	2
, year =	1978
, pages =	"303--310"
}

@book{hrw-stp-92
, author =	"F. K. Hwang and D. S. Richards and P. Winter"
, title =	"The {Steiner} Tree Problem"
, publisher =	"Elsevier Science"
, address =	"Amsterdam"
, year =	1992
, update =	"97.07 smid"
}

@article{hstd-dtesm-88
, author =	"F. K. Hwang and G. D. Song and G. Y. Ting and D. Z. Du"
, title =	"A decomposition theorem on {Euclidean} {Steiner} minimal trees"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"367--382"
}

@article{hy-cbprr-90
, author =	"F. K. Hwang and Y. C. Yao"
, title =	"Comments on {Bern}'s probabilistic results on rectilinear {Steiner} trees"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"591--598"
}

@unpublished{hct-spdcg-90
, author =	"H. Hwang and R. Chang and H. Tu"
, title =	"The separability problem in dynamic computational geometry"
, year =	1990
, note =	"Unpublished manuscript"
, update =	"95.09 agarwal"
}

@inproceedings{hcl-gdcsa-89
, author =	"R. Z. Hwang and R. C. Chang and R. C. T. Lee"
, title =	"The generalized divide-and-conquer strategy and its applications to some {Euclidean} {NP}-hard problems"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"17--24"
, keywords =	"p-median, p-center, TSP"
, update =	"95.09 mitchell"
}

@article{hcl-sssss-93
, author =	"R. Z. Hwang and R. C. Chang and R. C. T. Lee"
, title =	"The generalized searching over separators strategy to solve some {NP}-{H}ard problems in subexponential time"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"398--423"
, update =	"96.05 agarwal"
}

@article{hlc-sdase-93
, author =	"R. Z. Hwang and R. C. T. Lee and R. C. Chang"
, title =	"The slab dividing approach to solve the {Euclidean} $p$-center problem"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"1--22"
, update =	"96.05 agarwal"
}

@inproceedings{hct-faspe-89
, author =	"Y.-H. Hwang and R.-C. Chang and H.-Y. Tu"
, title =	"Finding all shortest path edge sequences on a convex polyhedron"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"251--266"
}

@article{ha-gmps-92
, author =	"Y. K. Hwang and N. Ahuja"
, title =	"Gross motion planning -- A survey"
, journal =	"ACM Comput. Surv."
, volume =	24
, number =	3
, year =	1992
, pages =	"219--291"
, update =	"98.07 orourke"
}

@article{hr-cobdt-76
, author =	"L. Hyafil and R. Rivest"
, title =	"Constructing optimal binary decision trees is NP-Complete"
, journal =	"Inform. Process. Lett."
, volume =	5
, year =	1976
, pages =	"15--17"
, update =	"96.09 agarwal"
}

@inproceedings{he-tgest-85
, author =	"J. Hynd and P. Eades"
, title =	"The Typed Graph Editing System: {TYGES}"
, booktitle =	"Proc. 3rd Australasian Conf. on Computer Graphics"
, year =	1985
, pages =	"15--19"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ik-olctc-83
, author =	"T. Ibaraki and N. Katoh"
, title =	"On-Line Computation of Transitive Closure of Graphs"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, pages =	"95--97"
, update =	"94.01 tamassia"
}

@article{ik-spc-75
, author =	"K. Ichida and T. Kiyono"
, title =	"Segmentation of Plane Curves"
, journal =	"Transactions of the Electronics and Communication Engineers of Japan"
, volume =	"58-D"
, year =	1975
, pages =	"689--696"
, update =	"97.11 bibrelex"
}

@inproceedings{i-kbl-89
, author =	"Christian Icking"
, title =	"{K{\"u}rzeste} {Bewegung} von {Liniensegmenten}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@mastersthesis{i-baoer-85
, author =	"Christian Icking"
, title =	"Le Balayage Appliqu{\'e} aux Op{\'e}rations Ensemblistes et au R{\'e}gionnement"
, type =	"Diploma Thesis ({DEA})"
, school =	"Department of Computer Science, Universit{\'e} Pierre et Marie Curie Paris~VI"
, address =	"Paris, France"
, year =	1985
, keywords =	"master thesis"
, update =	"00.03 bibrelex"
}

@phdthesis{i-mvsp-94
, author =	"Christian Icking"
, title =	"Motion and Visibility in Simple Polygons"
, school =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"00.11 smid, 00.07 icking, 97.03 icking"
}

@inproceedings{ikkl-euce-00
, author =	"Christian Icking and Thomas Kamphans and Rolf Klein and Elmar Langetepe"
, title =	"Exploring an Unknown Cellular Environment"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"140--143"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ikkl-euce-00.pdf"
, cites =	"afm-aalmm-97, a-ptase-96, dkp-hlue1-98, e-hpnrg-86, fw-ola-98, gkp-aspgt-95, hikk-pepns-98, ips-hpgg-82, m-gsaps-96, m-spn-97, n-wrlv-92, ul-hcsgg-97, ZZZ"
, update =	"01.04 icking, 00.03 bibrelex"
}

@proceedings{ik-ewcg-93
, title =	"Abstracts 9th European Workshop on Computational Geometry"
, editor =	"Christian Icking and Rolf Klein"
, nickname =	"CG '93"
, site =	"Hagen"
, series =	"Informatik-Berichte"
, volume =	140
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
}

@techreport{ik-csas-95t
, author =	"Christian Icking and Rolf Klein"
, title =	"Competitive Strategies for Autonomous Systems"
, number =	175
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1995
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr175.pdf"
, precedes =	"ik-csas-95"
, update =	"98.11 bibrelex"
}

@incollection{ik-csas-95
, author =	"Christian Icking and Rolf Klein"
, title =	"Competitive Strategies for Autonomous Systems"
, editor =	"H. Bunke and T. Kanade and H. Noltemeier"
, booktitle =	"Modelling and Planning for Sensor Based Intelligent Robot Systems"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"23--40"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr175.pdf"
, succeeds =	"ik-csas-95t"
, cites =	"bcr-sp-93, cg-opapp-92, di-csgs-94, dkp-hlue1-93, drw-lrmt-95, gj-cigtn-79, gs-oolaw-95, gmr-rlptd-92, ikl-sac-97, ikm-hlac-93, k-wusbd-92, k-lpmr-94, k-olssp-94, lp-oafkp-79, ls-ghtun-94, osh-kaoa-94, rksi-rnut-93, st-aelup-85, ZZZ"
, update =	"00.03 bibrelex, 98.11 bibrelex, 97.03 icking"
}

@inproceedings{ik-ppuu-92
, author =	"Christian Icking and Rolf Klein"
, title =	"Path Planning Under Uncertainty"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	5
, update =	"00.03 bibrelex"
}

@inproceedings{ik-skpcs-95
, author =	"Christian Icking and Rolf Klein"
, title =	"Searching for the Kernel of a Polygon: {A} Competitive Strategy"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"258--266"
, keywords =	"competitive strategy, shortest paths, simple polygon"
, precedes =	"ikl-skpcs-97"
, cites =	"cg-opapp-92, di-csgs-94, dkp-hlue-91, dkp-hlue1-93, drw-lrmt-95, gs-oolaw-95, i-mvsp-94, ikm-hlac-93, k-wusbd-92, k-lpmr-94, k-olssp-94, lp-oafkp-79, ls-ghtun-94, r-cic-94, ZZZ"
, update =	"98.07 icking, 98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{ik-skpcs-95c
, author =	"Christian Icking and Rolf Klein"
, title =	"Searching for the Kernel of a Polygon: A Competitive Strategy"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"7--99"
, update =	"00.03 bibrelex"
}

@inproceedings{ik-tgp-91
, author =	"Christian Icking and Rolf Klein"
, title =	"The Two Guards Problem"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"166--175"
, keywords =	"polygon"
, precedes =	"ik-tgp-92t"
, cites =	"at-oadvp-81, cg-vippg-85, fw--90, gh-ospqs-89, o-agta-87, ZZZ"
, update =	"99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 97.11 bibrelex"
}

@techreport{ik-tgp-92t
, author =	"Christian Icking and Rolf Klein"
, title =	"The Two Guards Problem"
, number =	126
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1992
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr126.pdf"
, succeeds =	"ik-tgp-91"
, precedes =	"ik-tgp-92"
, update =	"98.11 bibrelex"
}

@article{ik-tgp-92
, author =	"Christian Icking and Rolf Klein"
, title =	"The Two Guards Problem"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"257--285"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ik-tgp-92.pdf"
, keywords =	"visibility, watchman routes, planar polygons, motion planning"
, succeeds =	"ik-tgp-92t"
, update =	"01.04 icking, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking"
}

@inproceedings{ikkm-jadvv-97
, author =	"Christian Icking and Rolf Klein and Peter K{\"o}llner and Lihong Ma"
, title =	"A {Java} Applet for the Dynamic Visualization of {Voronoi} Diagrams"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"46--47"
, update =	"00.03 bibrelex, 99.07 bibrelex, 98.07 bibrelex"
}

@techreport{ikl-ocsws-98
, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
, title =	"An Optimal Competitive Strategy for Walking in Streets"
, number =	233
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1998
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr233.pdf"
, precedes =	"ikl-ocsws-99"
, update =	"98.11 bibrelex"
}

@inproceedings{ikl-ocsws-99
, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
, title =	"An Optimal Competitive Strategy for Walking in Streets"
, booktitle =	"Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
, nickname =	"STACS '99"
, site =	"Trier"
, series =	"Lecture Notes Comput. Sci."
, volume =	1563
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"110--120"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ikl-ocsws-99.pdf"
, succeeds =	"ikl-ocsws-98"
, update =	"01.04 icking, 99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex"
}

@inproceedings{ikl-sgmrw-99
, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
, title =	"Searching a Goal on $m$ Rays Within a Fixed Distance"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"137--139"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ikl-sgmrw-99.pdf"
, update =	"01.04 icking, 00.03 bibrelex, 99.07 bibrelex"
}

@techreport{ikl-skpcs-97
, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
, title =	"Searching for the Kernel of a Polygon: A Competitive Strategy Using Self-Approaching Curves"
, number =	211
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1997
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr211.pdf"
, succeeds =	"ik-skpcs-95"
, update =	"98.07 icking, 98.03 icking"
}

@techreport{ikl-sac-97
, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
, title =	"Self-Approaching Curves"
, number =	217
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1997
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr217.pdf"
, precedes =	"ikl-sac-99"
, update =	"99.07 bibrelex, 98.07 icking"
}

@article{ikl-sac-99
, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
, title =	"Self-Approaching Curves"
, journal =	"Math. Proc. Camb. Phil. Soc."
, volume =	125
, year =	1999
, pages =	"441--453"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr217.pdf"
, succeeds =	"ikl-sac-97"
, update =	"01.04 icking, 99.07 bibrelex, 99.03 bibrelex"
}

@techreport{iklm-cdf3s-92
, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
, title =	"Convex Distance Functions in $3$-space are Different"
, number =	133
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1992
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr133.pdf"
, precedes =	"iklm-cdf3s-93"
, update =	"98.07 icking, 98.03 bibrelex"
}

@inproceedings{iklm-cdf3s-93
, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
, title =	"Convex Distance Functions in $3$-Space are Different"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"116--123"
, succeeds =	"iklm-cdf3s-92"
, precedes =	"iklm-cdf3s-95"
, cites =	"a-vdsfg-91, b-eakfd-70, cgglmw-m5lrm-91, cd-vdbcd-85, ei-drmwc-79, h-ag-77, iklm-cdf3s-92, j-ba1-74, k-cavd-89, k-cpavd-89, kmm-cavd2-90, km-weacs-92, l-a1-69, l-tdvdl-80, m-ddvec-92, mr-vdbsc-91, mmo-cavd-91, sh-cpp-75, sd-hdvdc-92, ss-ampr-90, www-dpcgf-85, ZZZ"
, update =	"99.07 bibrelex, 98.07 icking, 98.03 bibrelex, 97.11 icking, 93.09 jones"
}

@article{iklm-cdf3s-95
, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
, title =	"Convex Distance Functions in $3$-Space are Different"
, journal =	"Fundam. Inform."
, volume =	22
, year =	1995
, pages =	"331--352"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/iklm-cdf3s-95.pdf"
, succeeds =	"iklm-cdf3s-93"
, update =	"01.04 icking, 97.03 icking+smid"
}

@techreport{iklms-bcdf3-99t
, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma and Francisco Santos"
, title =	"On Bisectors for Convex Distance Functions in 3-Space"
, number =	250
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1999
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr250.pdf"
, precedes =	"iklms-bcdf3-99"
, update =	"99.07 bibrelex"
}

@inproceedings{iklms-bcdf3-99
, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma and Francisco Santos"
, title =	"On Bisectors for Convex Distance Functions in 3-Space"
, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
, nickname =	"CCCG '99"
, site =	"Vancouver, Canada"
, year =	1999
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr250.pdf"
, succeeds =	"iklms-bcdf3-99t"
, update =	"01.04 icking, 99.07 bibrelex"
}

@techreport{ikm-ocsla-94
, author =	"Christian Icking and Rolf Klein and Lihong Ma"
, title =	"An Optimal Competitive Strategy for Looking Around a Corner"
, number =	167
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1994
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr167.pdf"
, succeeds =	"ikm-hlac-93"
, update =	"98.11 bibrelex"
}

@inproceedings{ikm-hlac-93
, author =	"Christian Icking and Rolf Klein and Lihong Ma"
, title =	"How to Look Around a Corner"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"443--448"
, precedes =	"ikm-ocsla-94"
, cites =	"cgglmw-m5lrm-91, dkp-hlue-91, elw-pgmpt-90, k-dv1-83, k-wusbd-91, m-aaorp-90, m-odes-60, py-spwm-89, ss-ampr-90, sy-agar-87, st-aelup-85, brs-nut-90, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{ikm-brdcd-98
, author =	"Christian Icking and Rolf Klein and Lihong Ma"
, title =	"The Bisector with Respect to Different Convex Distance Functions"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"99--101"
, precedes =	"ikmnw-bddf-98"
, update =	"00.03 bibrelex, 99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{ikm-owlac-93
, author =	"Christian Icking and Rolf Klein and Lihong Ma"
, title =	"The Optimal Way for Looking Around a Corner"
, booktitle =	"Proc. 4th IEEE--IEE Vehicle Navigation and Informations Systems Conference"
, nickname =	"VNIS '93"
, site =	"Ottawa, Canada"
, year =	1993
, update =	"98.07 icking, 97.03 icking"
}

@techreport{ikmnw-bddf-98
, author =	"Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
, title =	"On Bisectors for Different Distance Functions"
, number =	237
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1998
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr237.pdf"
, succeeds =	"ikm-brdcd-98"
, precedes =	"ikmnw-bddf-99"
, update =	"99.07 bibrelex, 98.11 bibrelex"
}

@inproceedings{ikmnw-bddf-99
, author =	"Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
, title =	"On Bisectors for Different Distance Functions"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"291--299"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ikmnw-bddf-99.pdf"
, succeeds =	"ikmnw-bddf-98"
, precedes =	"ikmnw-bddf-01"
, update =	"01.04 icking, 99.07 bibrelex, 99.03 bibrelex"
}

@article{ikmnw-bddf-01
, author =	"Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
, title =	"On Bisectors for Different Distance Functions"
, journal =	"Discrete Appl. Math."
, volume =	109
, year =	2001
, pages =	"139--161"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr237.pdf"
, succeeds =	"ikmnw-bddf-99"
, cites =	"ae-oacwv-84, ak-vd-00, cd-vdbcd-85, cmr-gbscd-96, es-vda-86, h-mlps-95, iklm-cdf3s-95, kw-gcsmm-79, lb-cg2-93, nprw-gcmlp-97, os-lopst-97, rnp-falp-97, v-cs-64, ww-ubnlm-85, www-dpcgf-85, ZZZ"
, update =	"01.04 icking"
}

@inproceedings{iko-pstsm-88
, author =	"Christian Icking and Rolf Klein and Thomas Ottmann"
, title =	"Priority Search Trees in Secondary Memory"
, booktitle =	"Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '87"
, series =	"Lecture Notes Comput. Sci."
, volume =	314
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"84--93"
, keywords =	"search trees, B-tree, red-black tree, priority search trees"
, update =	"98.11 bibrelex"
}

@techreport{ilss-ghtus-98
, author =	"Christian Icking and Alejandro L{\'o}pez-Ortiz and Sven Schuierer and Ines Semrau"
, title =	"Going Home Through an Unknown Street"
, number =	228
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1998
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr228.pdf"
, update =	"99.07 bibrelex, 98.07 icking"
}

@techreport{im-tbcvd-00
, author =	"Christian Icking and Lihong Ma"
, title =	"A Tight Bound for the Complexity of {Voronoi} Diagrams under Polyhedral Convex Distance Functions in {3D}"
, number =	277
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	2000
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr277.pdf"
, precedes =	"im-tbcvd-01"
, cites =	"ak-vd-00, bsty-vdhdc-98, by-ag-98, cd-vdbcd-85, ckstw-vdl3s-98, cs-arscg-89, dv-cprac-77, es-vda-86, f-vddt-97, gmr-vdmpp-92, gs-ccrs-87, iklm-cdf3s-95, iklms-bcdf3-99, ikmnw-bddf-99, k-cavd-89, kw-vdbgm-88, ls-pptmc-87, m-bvdcd-00, mmo-cavd-91, ss-ampr-90, s-atubl-94, s-ahdvd-95, sa-dsstg-95, t-csas-96, t-ntasa-96, ZZZ"
, update =	"01.04 icking"
}

@inproceedings{im-tbcvd-01
, author =	"Christian Icking and Lihong Ma"
, title =	"A Tight Bound for the Complexity of {Voronoi} Diagrams under Polyhedral Convex Distance Functions in {3D}"
, booktitle =	"Proc. 33rd Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC 2001"
, site =	"Crete, Greece"
, year =	2001
, pages =	"316--321"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr277.pdf"
, succeeds =	"im-tbcvd-00"
, update =	"02.03 icking, 01.04 icking"
}

@techreport{irwy-spls-89
, author =	"Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
, title =	"Shortest Paths for Line Segments"
, type =	"Technical {Report}"
, number =	"B-89-14"
, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, month =	sep
, year =	1989
, precedes =	"irwy-spls-91"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@techreport{irwy-spls-91
, author =	"Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
, title =	"Shortest Paths for Line Segments"
, type =	"Technical {Report}"
, number =	596
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1991
, succeeds =	"irwy-spls-89"
, precedes =	"irwy-spls-92t"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@techreport{irwy-spls-92t
, author =	"Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
, title =	"Shortest Paths for Line Segments"
, number =	125
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1992
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr125.pdf"
, succeeds =	"irwy-spls-91"
, precedes =	"irwy-spls-92"
, update =	"98.11 bibrelex"
}

@article{irwy-spls-92
, author =	"Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
, title =	"Shortest Paths for Line Segments"
, journal =	"Algorithmica"
, volume =	10
, year =	1993
, pages =	"182--200"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/irwy-spls-92.pdf"
, keywords =	"Ulam problem, motion planning"
, succeeds =	"irwy-spls-92t"
, update =	"01.04 icking, 98.11 bibrelex, 98.03 mitchell, 95.01 mitchell, 93.09 rote, 95.01 mitchell"
}

@mastersthesis{i-dtg-90
, author =	"P. J. Idicula"
, title =	"Drawing Trees in Grids"
, school =	"Department of Computer Science, University of Auckland"
, year =	1990
, keywords =	"master thesis, graph drawing"
, update =	"93.09 tamassia"
}

@techreport{ic-copop-91
, author =	"D. J. Ieradi and Y.-B. Chen"
, title =	"The complexity of oblivious plans for orienting polygonal parts"
, type =	"Technical {Report}"
, number =	"USC-CS-92-502"
, institution =	"Dept. Comput. Sci., Univ. Southern California"
, month =	dec
, year =	1991
, precedes =	"ci-copod-95"
, update =	"98.07 bibrelex"
}

@techreport{i-lgto-81
, author =	"A. Iftikhar"
, title =	"Linear geometric transformations on octrees"
, type =	"Technical {Report}"
, number =	"TR-81-003"
, institution =	"Rensselaer Polytechnic Inst."
, address =	"Troy, NY"
, year =	1981
, update =	"97.11 bibrelex"
}

@inproceedings{i-dfdgu-96
, author =	"J. Ignatowicz"
, title =	"Drawing Force-Directed Graphs Using Optigraph"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"333--336"
, keywords =	"graph drawing, straight-line, system, force-direceted"
, update =	"96.09 tamassia"
}

@book{ic-lp-94
, author =	"J. P. Ignizio and T. M. Cavalier"
, title =	"Linear Programming"
, series =	"Prentice Hall International Series in Industrial and Systems Engineering"
, publisher =	"Prentice Hall"
, year =	1994
, update =	"98.07 bibrelex"
}

@inproceedings{i-mrsti-92
, author =	"Edmund Ihler"
, title =	"Minimum rectilinear {Steiner} trees for intervals on two parallel lines"
, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, year =	1992
, pages =	"??"
, precedes =	"i-rcstp-94"
, update =	"95.01 mitchell, 93.09 milone+mitchell"
}

@inproceedings{i-cacst-92
, author =	"Edmund Ihler"
, title =	"The Complexity of Approximating the Class {Steiner} Tree Problem"
, booktitle =	"Graph Theoretic Concepts in Computer Science: Proc. Internat. Workshop WG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	570
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"85--96"
, keywords =	"TSP"
, update =	"99.11 bibrelex, 98.03 mitchell, 97.11 icking, 96.09 agarwal, 95.01 mitchell"
}

@article{i-rcstp-94
, author =	"Edmund Ihler"
, title =	"The Rectilinear {Steiner} Tree Problem for Intervals on Two Parallel Lines"
, journal =	"Math. Program. Ser. B"
, volume =	63
, year =	1994
, pages =	"281--296"
, succeeds =	"i-mrsti-92"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@inproceedings{irw-sncpp-91
, author =	"Edmund Ihler and Gabriele Reich and Peter Widmayer"
, title =	"On shortest networks for classes of points in the plane"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"103--111"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@article{iww-mhgsm-93
, author =	"E. Ihler and D. Wagner and F. Wagner"
, title =	"Modeling Hyperedges by Graphs with the Same Mincut Properties"
, journal =	"Inform. Process. Lett."
, volume =	45
, year =	1993
, pages =	"171--175"
, update =	"97.03 gaertner+salinger"
}

@incollection{in-pladc-91
, author =	"I. Ihm and B. Naylor"
, title =	"Piecewise linear approximations of digitized curves with applications"
, editor =	"N. M. Patrilakis"
, booktitle =	"Scientific Visualization of Physical Phenomena"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1991
, pages =	"545--568"
, update =	"98.07 bibrelex"
}

@inproceedings{i-r3dou-81
, author =	"K. I. Ikeuchi"
, title =	"Recognition of 3-D Objects Using the Extended {Gaussian} Image"
, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
, year =	1981
, pages =	"595--600"
, update =	"97.11 bibrelex"
}

@techreport{ihncf-puopo-83
, author =	"K. I. Ikeuchi and B. K. P. Horn and S. Nagata and T. Callahan and O. Feingold"
, title =	"Picking up an object from a pile of objects"
, type =	"Memo"
, number =	"AI Memo 726"
, institution =	"??"
, year =	1983
, update =	"97.11 bibrelex"
}

@techreport{ijmsss-dbalm-00
, author =	"I. Ilinkin and R. Janardan and J. Majhi and J. Schwerdt and M. Smid and R. Sriram"
, title =	"A decomposition-based approach to layered manufacturing"
, type =	"Report"
, number =	"00-041"
, institution =	"Department of Computer Science, University of Minnesota"
, address =	"Minneapolis"
, year =	2000
, update =	"00.11 smid"
}

@inproceedings{ijmsss-dbalm-01
, author =	"I. Ilinkin and R. Janardan and J. Majhi and J. Schwerdt and M. Smid and R. Sriram"
, title =	"A decomposition-based approach to layered manufacturing"
, booktitle =	"Proc. 7th Workshop Algorithms Data Struct."
, nickname =	"WADS '01"
, series =	"Lecture Notes Comput. Sci."
, volume =	2125
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"389--400"
, update =	"01.11 smid"
}

@techreport{i-empfm-86
, author =	"H. Imai"
, title =	"Extensions of the multiplicative penalty function method for linear programming"
, type =	"Report"
, number =	"CSCE-86-C04"
, institution =	"Dept. Comput. Sci., Kyushu Univ."
, address =	"Fukuoka, Japan"
, year =	1986
}

@techreport{i-galse-87
, author =	"H. Imai"
, title =	"Geometric algorithms for locating a single-eye robot"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
, address =	"Fukuoka, Japan"
, year =	1987
}

@article{i-nfalt-83
, author =	"H. Imai"
, title =	"Network-Flow Algorithms for Lower-Tuncated Transversal Polymatroids"
, journal =	"J. Oper. Res. Soc. Japan"
, volume =	26
, number =	3
, year =	1983
, pages =	"186--210"
, update =	"98.07 bibrelex"
}

@article{i-csldp-85
, author =	"H. Imai"
, title =	"On combinatorial structures of line drawings of polyhedra"
, journal =	"Discrete Appl. Math."
, volume =	10
, year =	1985
, pages =	"79--92"
, update =	"97.11 bibrelex"
}

@article{i-wcapm-86
, author =	"H. Imai"
, title =	"Worst-case analysis for planar matching and tour heuristics with bucketing techniques and spacefilling curves"
, journal =	"J. Oper. Res. Soc. Japan"
, volume =	29
, number =	1
, year =	1986
, pages =	"43--68"
}

@techreport{ia-eafmm-83
, author =	"H. Imai and Ta. Asano"
, title =	"An efficient algorithm for finding a maximum matching of an intersection graph of horizontal and vertical line segments"
, type =	"Paper"
, number =	"{CAS} 83-143"
, institution =	"IECE Tech. Group Circuits \& Systems"
, year =	1983
}

@techreport{ia-oghmc-??
, author =	"H. Imai and Ta. Asano"
, title =	"An {$O(n \log n)$} greedy heuristic for the minimum chord-length rectangular partition (extended abstract)"
, type =	"Technical {Report}"
, number =	"CAS84-115"
, institution =	"IECE of Japan"
, year =	"??"
, pages =	"1--4"
, keywords =	"decomposition, approximation, VLSI design"
}

@article{ia-dosis-87
, author =	"H. Imai and Ta. Asano"
, title =	"Dynamic orthogonal segment intersection search"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"1--18"
, keywords =	"intersection, dynamizing, data structuring, searching, VLSI design, decomposition, amortized analysis"
, succeeds =	"ia-dsisa-84"
, update =	"97.11 bibrelex"
}

@inproceedings{ia-dsisa-84
, author =	"H. Imai and Ta. Asano"
, title =	"Dynamic Segment Intersection Search with Applications"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, publisher =	"IEEE Computer Society Press"
, address =	"Los Angeles, Ca., USA"
, year =	1984
, pages =	"393--402"
, precedes =	"ia-dosis-87"
, update =	"97.11 bibrelex"
}

@article{ia-eaggs-86
, author =	"H. Imai and Ta. Asano"
, title =	"Efficient algorithms for geometric graph search problems"
, journal =	"SIAM J. Comput."
, volume =	15
, number =	2
, year =	1986
, pages =	"478--494"
, keywords =	"intersection, dynamizing, data structuring, searching, VLSI design, decomposition, amortized analysis"
, update =	"97.11 bibrelex"
}

@article{ia-fccmc-83
, author =	"H. Imai and Ta. Asano"
, title =	"Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane"
, journal =	"J. Algorithms"
, volume =	4
, year =	1983
, pages =	"310--323"
, keywords =	"VLSI design, plane-sweep, rectangles, intersection"
}

@inproceedings{ii-vdmp-90
, author =	"H. Imai and K. Imai"
, title =	"Voronoi Diagrams of Moving Points"
, booktitle =	"Proc. Int. Computer Symp."
, site =	"Taiwan"
, year =	1990
, pages =	"600--606"
, update =	"98.11 bibrelex"
}

@article{ii-gca-96
, author =	"H. Imai and M. Inaba"
, title =	"Geometric clustering with applications"
, journal =	"Zeitschrift f{\"u}r Angewandte Mathematik"
, volume =	3
, year =	1996
, pages =	"183--186"
, note =	"ICIAM95 Proc., Applied Stochastics and Optimzation"
, update =	"98.07 bibrelex"
}

@techreport{ii-oaapl-86t
, author =	"H. Imai and M. Iri"
, title =	"An optimal algorithm for approximating a piecewise linear function"
, type =	"Report"
, number =	"CSCE-86-C03"
, institution =	"Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
, address =	"Fukuoka, Japan"
, year =	1986
, precedes =	"ii-oaapl-86a"
}

@article{ii-oaapl-86a
, author =	"H. Imai and M. Iri"
, title =	"An Optimal Algorithm for Approximating a Piecewise Linear Function"
, journal =	"J. Inform. Process."
, volume =	9
, number =	3
, year =	1986
, pages =	"159--162"
, succeeds =	"ii-oaapl-86t"
}

@techreport{ii-cgmpa-85
, author =	"H. Imai and M. Iri"
, title =	"Computational-geometric methods for polygonal approximations of a curve"
, type =	"Report"
, number =	"RMI 85-01"
, institution =	"Dept. Math. Engrg. Instrumentation Phys., Univ. Tokyo"
, address =	"Bunkyo-ku, Tokyo, Japan"
, year =	1985
, precedes =	"ii-cgmpa-86"
, update =	"98.07 bibrelex"
}

@article{ii-cgmpa-86
, author =	"Hiroshi Imai and Masao Iri"
, title =	"Computational-Geometric Methods for Polygonal Approximations of a Curve"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	36
, year =	1986
, pages =	"31--41"
, succeeds =	"ii-cgmpa-85"
, update =	"98.07 bibrelex"
}

@incollection{ii-pacfa-88
, author =	"H. Imai and M. Iri"
, title =	"Polygonal approximations of a curve-formulations and algorithms"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"71--86"
, succeeds =	"ii-pacfs-86"
}

@techreport{ii-pacfs-86
, author =	"H. Imai and M. Iri"
, title =	"Polygonal approximations of a curve-formulations and solution algorithms"
, type =	"Report"
, number =	"CSCE-86-C07"
, institution =	"Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
, address =	"Fukuoka, Japan"
, year =	1986
, precedes =	"ii-pacfa-88"
}

@article{iim-vdlgi-85
, author =	"H. Imai and M. Iri and K. Murota"
, title =	"Voronoi diagrams in the {Laguerre} geometry and its applications"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"93--105"
}

@techreport{iky-ltall-87
, author =	"H. Imai and K. Kato and P. Yamamoto"
, title =	"A linear-time algorithm for linear {$L_{1}$} approximation of points"
, type =	"Report"
, number =	"CSCE-87-C30"
, institution =	"Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
, address =	"Kukuoka, Japan"
, year =	1987
, precedes =	"iky-ltall-89"
}

@article{iky-ltall-89
, author =	"H. Imai and K. Kato and P. Yamamoto"
, title =	"A linear-time algorithm for linear {$L_{1}$} approximation of points"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"77--96"
, succeeds =	"iky-ltall-87"
}

@article{ily-sccp-92
, author =	"H. Imai and D. Lee and C. Yang"
, title =	"$1$-Segment center covering problems"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"426--434"
, update =	"98.03 mitchell, 96.09 agarwal, 95.09 agarwal"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@inproceedings{ily-1scp-89
, author =	"H. Imai and D. T. Lee and C. D. Yang"
, title =	"On the $1$-segment-center problem"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	18
}

@article{i-vdmp-89
, author =	"K. Imai"
, title =	"{Voronoi} Diagrams for Moving Points"
, journal =	"Memoirs of Mathematical Research Institute, Kyoto Univ."
, volume =	695
, year =	1989
, pages =	"225--232"
, note =	"In Japanese"
, update =	"97.11 bibrelex"
}

@inproceedings{isi-mgftc-89
, author =	"K. Imai and S. Sumino and H. Imai"
, title =	"Minimax geometric fitting of two corresponding sets of points"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"266--275"
, cites =	"ass-sulbl-89, amww-cssgo-88, a-sdcgp-85, epss-lebfi-87, h-fuenl-89, ms-rcibt-88, m-lpltw-84, m-dlp-86, n-avsir-87, s-ossac-86, s-pds-74, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{i-stdgp-98
, author =	"Toshiyuki Imai"
, title =	"A Simple Treatment for Degeneracies in Geometric Programs"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"103--105"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{i-toavd-96
, author =	"T. Imai"
, title =	"A topology oriented algorithm for the {Voronoi} diagram of polygons"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"107--112"
, update =	"96.09 mitchell"
}

@mastersthesis{i-nracv-89
, author =	"T. Imai"
, title =	"Numerically robust algorithm for constructing {Voronoi} diagrams for line segments (in {Japanese})"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Math. Engr. Info. Phys., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1989
, keywords =	"master thesis"
}

@inproceedings{i-smdsi-97
, author =	"Toshiyuki Imai"
, title =	"Some Methods to Determine the Sign of an Integer from its Remainders"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"117--122"
, update =	"97.11 jones"
}

@article{iw-dstp-91
, author =	"M. Imase and B. M. Waxman"
, title =	"Dynamic {Steiner} tree problem"
, journal =	"SIAM J. Discrete Math."
, volume =	4
, year =	1991
, pages =	"369--384"
, update =	"97.11 bibrelex"
}

@article{i-pnm-75
, author =	"E. Imhof"
, title =	"Positioning Names on Maps"
, journal =	"Amer. Cartogr."
, volume =	2
, year =	1975
, pages =	"128--144"
, update =	"97.11 bibrelex"
}

@inproceedings{ik-chmhe-89
, author =	"C. Imielinska and B. Kalantari"
, title =	"On the complexity of the hypergreeedy matching heuristic for the {Euclidean} points in the plane"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	17
}

@inproceedings{iah-ldra-94
, author =	"M. Inaba and Y. Aoki and S. Hasegawa"
, title =	"Level Difference of the Reconstructed Arrangement"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"12--17"
, cites =	"a-ccra-93, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{iik-errca-96
, author =	"Mary Inaba and Hiroshi Imai and Naoki Katoh"
, title =	"Experimental Results of a Randomized Clustering Algorithm"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C1--C2"
, cites =	"h-ciqfb-80, iki-awvdr-94, si-kmtag-84, wwp-amdc-88, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{iins-aegcm-97
, author =	"M. Inaba and H. Imai and M. Nakade and T. Sekiguchi"
, title =	"Application of an Effective Geometric Clustering Method to Color Quantization Problem"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"477--478"
, keywords =	"video review"
, cites =	"h-ciqfb-82, hiikn-eavbk-93, imo-fvdaa-83, ii-gca-96, iki-awvdr-94, iik-errca-96, si-kmtag-84, wwp-amdc-88, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{iki-awvdr-94
, author =	"M. Inaba and N. Katoh and H. Imai"
, title =	"Applications of Weighted {Voronoi} Diagrams and Randomization to Variance-Based $k$-Clustering"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"332--339"
, cites =	"abky-cabmm-88, bh-cpcoe-88, crw-gc-91, fg-oaac-88i, hr-tcpp-93, h-senea-93, hiikn-eavbk-93, hii-eakls-93, h-ciqfb-82, h-msde-92, i-ecchs-94, ki-pceas-87, kl-ehppg-70, ms-cscgl-84, wwp-amdc-88, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@inproceedings{is-nracc-94
, author =	"H. Inagaki and K. Sugihara"
, title =	"Numerically Robust Algorithm for Constructing Constrained {Delaunay} Triangulation"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"171--176"
, cites =	"ps-cgi-85, a-vdsfg-91, obs-stcav-92, be-mgot-92i, hhk-tirgc-88, m-vigau-88a, si-cvdom-92, iss-nriac-92, oim-iimvd-84, ZZZ"
, update =	"98.11 bibrelex, 97.03 schwarzkopf, 94.09 jones"
}

@inproceedings{iss-nriac-92
, author =	"H. Inagaki and K. Sugihara and N. Sugie"
, title =	"Numerically robust incremental algorithm for constructing three-dimensional {Voronoi} diagrams"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"334--339"
, cites =	"h-pargc-89, si-tdpga-89, si-cvdom-92, oim-iimvd-84, ZZZ"
, update =	"98.07 bibrelex, 95.05 schwarzkopf"
}

@inproceedings{i-stasc-99
, author =	"Piotr Indyk"
, title =	"A Sublinear-time Approximation Scheme for Clustering in Metric Spaces"
, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1999
, pages =	"154--159"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{i-drtpp-00
, author =	"Piotr Indyk"
, title =	"Dimensionality reduction techniques for proximity problems"
, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
, year =	2000
, pages =	"371--378"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{i-annne-98
, author =	"Piotr Indyk"
, title =	"On Approximate Nearest Neighbors in Non-{Euclidean} Spaces"
, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1998
, pages =	"148--155"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{if-annah-99
, author =	"Piotr Indyk and M. Farach-Colton"
, title =	"Approximate Nearest Neighbor Algorithms for {Hausdorff} Metrics via Embeddings"
, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1999
, pages =	"171--180"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{im-anntr-98
, author =	"Piotr Indyk and Rajeev Motwani"
, title =	"Approximate Nearest Neighbors: {Towards} Removing the Curse of Dimensionality"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, year =	1998
, pages =	"to appear"
, update =	"98.03 mitchell"
}

@inproceedings{imrv-lphms-97
, author =	"P. Indyk and R. Motwani and P. Raghavan and S. Vempala"
, title =	"Locality-preserving hashing in multidimensional spaces"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '97"
, year =	1997
, pages =	"618--625"
, update =	"98.07 bibrelex, 98.03 smid, 97.07 agarwal"
}

@inproceedings{i-crosp-89
, author =	"A. Inselberg"
, title =	"Conflict resolution, one-shot problem, and air traffic control"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	26
}

@techreport{i-ndgp1-81
, author =	"A. Inselberg"
, title =	"{$N$}-dimensional graphics, part {I}: lines and hyperplanes"
, type =	"Report"
, number =	"G320-2711"
, institution =	"IBM Sci. Center"
, address =	"Los Angeles, CA"
, year =	1981
}

@article{i-ppc-85
, author =	"A. Inselberg"
, title =	"The plane with parallel coordinates"
, journal =	"Visual Comput."
, volume =	1
, year =	1985
, pages =	"69--91"
}

@article{icr-capc-87
, author =	"A. Inselberg and T. Chomut and M. Reif"
, title =	"Complexity algorithms in parallel coordinates"
, journal =	"J. ACM"
, volume =	34
, year =	1987
, pages =	"765--801"
}

@techreport{ir-cpc-84
, author =	"A. Inselberg and M. Reif"
, title =	"Convexity in parallel coordinates"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Univ. California"
, address =	"Los Angeles, CA"
, year =	1984
, update =	"98.03 bibrelex"
}

@inproceedings{i-cigol-90
, author =	"S. Irani"
, title =	"Coloring Inductive Graphs On-Line"
, booktitle =	"Proc. 30th FOCS"
, year =	1990
, pages =	"470--479"
, update =	"98.07 bibrelex"
}

@inproceedings{ir-cerrp-96
, author =	"Sandy Irani and Prabhakar Raghavan"
, title =	"Combinatorial and Experimental Results for Randomized Point Matching Algorithms"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"68--77"
, cites =	"cghkkk-gpmem-93, ee-scpps-, fb-rscpm-81, gh-sgh-90, hh-gicv-92, hu-orua-87, hu-rsoa-90, lsw-oraim-88, lw-ghgem-88, lw-eagh-91, w-mborg-90, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@book{i-smp-79
, author =	"?? Iri"
, title =	"Survey of mathematical programming"
, editor =	"A. Pr{\'e}kopa"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1979
, update =	"98.03 bibrelex"
}

@techreport{i-fagdp-83
, author =	"M. Iri"
, title =	"Fundamental algorithms for geographical data processing"
, type =	"Report"
, number =	"T-83-1"
, institution =	"Oper. Res. Soc. of Japan"
, year =	1983
}

@article{if-umtor-81
, author =	"M. Iri and S. Fujishige"
, title =	"Use of matroid theory in operating research, circuits and systems theory"
, journal =	"Int. J. Systems Sci."
, volume =	12
, number =	1
, year =	1981
, pages =	"27--54"
, update =	"98.11 bibrelex"
}

@article{imm-hpmwp-83
, author =	"M. Iri and K. Murota and S. Matsui"
, title =	"Heuristics for planar minimum-weight perfect matchings"
, journal =	"Networks"
, volume =	13
, year =	1983
, pages =	"67--92"
}

@article{imm-ltaaf-81
, author =	"M. Iri and K. Murota and S. Matsui"
, title =	"Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane"
, journal =	"Inform. Process. Lett."
, volume =	12
, year =	1981
, pages =	"206--209"
}

% I think I corrected it now.
% This entry is/was incorrect; LNCS 59 is not that proceedings
@inproceedings{imo-fvdaa-83
, author =	"M. Iri and K. Murota and T. Ohya"
, title =	"A fast {Voronoi}-diagram algorithm with applications to geographical optimization problems"
, booktitle =	"Proc. 11th IFIP Conf."
, series =	"Lecture Notes in Control and Information Science"
, volume =	59
, publisher =	"Springer-Verlag"
, year =	1983
, pages =	"253--288"
, update =	"95.01 mitchell"
}

@inproceedings{imo-goptp-83
, author =	"M. Iri and K. Murota and T. Ohya"
, title =	"Geographical optimization problems and their practical solutions"
, booktitle =	"Proc. Spring Conf. Oper. Res. Soc. of Japan"
, volume =	"C-2"
, year =	1983
, pages =	"92--93"
}

@techreport{ir-scstp-92
, author =	"G. Iribarren and M. C. Rivara"
, title =	"A study on the classes of similar triangles produced by 4-T-bisection"
, institution =	"Dept. of Computer Science, University of Chile"
, year =	1992
, update =	"98.11 bibrelex"
}

@article{i-amids-91
, author =	"R. W. Irving"
, title =	"On Approximating the Minimum Independent Dominating Set"
, journal =	"Inf. Proc. Lett."
, volume =	37
, year =	1991
, pages =	"197--200"
, update =	"98.07 bibrelex"
}

@inproceedings{i-tfebc-00
, author =	"Martin Isenburg"
, title =	"Triangle Fixer: Edge-Based Connectivity Compression"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"18--23"
, update =	"00.03 bibrelex"
}

@article{is-srrde-01
, author =	"M. Isenburg and J. Snoeyink"
, title =	"Spirale {Reversi}: {Reverse} decoding of the {Edgebreaker} encoding"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"39--52"
, update =	"01.11 smid"
}

@inproceedings{is-ffv-00
, author =	"Martin Isenburg and Jack Snoeyink"
, title =	"The Face Fixer Video"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"377--378"
, keywords =	"video review"
, update =	"00.11 jones"
}

@mastersthesis{i-ecchs-94
, author =	"M. Ishiguro"
, title =	"Evaluation of combinatorial complexity for hypothesis spaces in learning theory with applications"
, school =	"Dept. Inform. Sci., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1994
, keywords =	"master thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{i-mlpd-92
, author =	"H. Ishii"
, title =	"Minimax location problem with a distance"
, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
, site =	"Kyoto, Japan"
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@article{ishs-spadc-83
, author =	"M. Ishijama and S.-B. Shin and G. H. Hostetter and J. Sklansky"
, title =	"Scan-along polygonal approximation for data compression of electrocardiograms"
, journal =	"IEEE Trans. on Biomedical Engg."
, volume =	"BME-30"
, number =	11
, year =	1983
, pages =	"723--729"
, update =	"98.07 bibrelex"
}

@article{iso-vvd-87
, author =	"S. Isoda and T. Shimonmura and Y. Ono"
, title =	"VIPS: A visual Debugger"
, journal =	"IEEE Softw."
, volume =	4
, number =	3
, year =	1987
, pages =	"8--19"
, keywords =	"graph drawing, system"
, update =	"96.09 tamassia, 96.04 garg"
}

@article{ips-hpgg-82
, author =	"A. Itai and C. H. Papadimitriou and J. L. Szwarcfiter"
, title =	"Hamilton paths in grid graphs"
, journal =	"SIAM J. Comput."
, volume =	11
, year =	1982
, pages =	"676--686"
, update =	"95.09 mitchell"
}

@inproceedings{ir-mtard-84
, author =	"A. Itai and M. Rodeh"
, title =	"The multi-tree approach to reliability in distributed networks"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"137--147"
, update =	"98.11 bibrelex"
}

@article{is-mfpn-79
, author =	"A. Itai and Y. Shiloach"
, title =	"Maximum flow in planar networks"
, journal =	"SIAM J. Comput."
, volume =	8
, number =	2
, month =	may
, year =	1979
, pages =	"135--150"
, update =	"98.03 bibrelex"
}

@incollection{ityik-msrdd-95
, author =	"A. Itai and N. Tomioka and M. Yamada and A. Inoue and Y. Kato"
, title =	"Molecular superposition for rational drug design"
, editor =	"?? Kubingi"
, booktitle =	"3D QSAR in Drug Design: Theory, Methods, and Applications"
, publisher =	"ESCOM"
, year =	1995
, update =	"98.07 bibrelex"
}

@article{i-aeprd-86
, author =	"G. F. Italiano"
, title =	"Amortized Efficiency of a Path Retrieval Data Structure"
, journal =	"Theoret. Comput. Sci."
, volume =	48
, year =	1986
, pages =	"273--281"
, update =	"94.01 tamassia"
}

@article{i-fpded-88
, author =	"G. F. Italiano"
, title =	"Finding Paths and Deleting Edges in Directed Acyclic Graphs"
, journal =	"Inform. Process. Lett."
, volume =	28
, number =	1
, year =	1988
, pages =	"5--11"
, update =	"94.01 tamassia"
}

@inproceedings{ipr-fdptp-93
, author =	"Giuseppe F. Italiano and Johannes A. {La Poutr{\'e}} and Monika H. Rauch"
, title =	"Fully Dynamic Planarity Testing in Planar Embedded Graphs"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"212--223"
, update =	"00.03 vismara, 95.05 tamassia, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{iuy-npsip-98
, author =	"H. Ito and H. Uehara and M. Yokayama"
, title =	"NP-completeness of stage illumination problem"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
, site =	"Tokyo"
, year =	1998
, pages =	"88--92"
, update =	"00.11 smid, 00.07 icking, 99.07 orourke"
}

@article{ik-aipue-95
, author =	"T. Itoh and K. Koyamada"
, title =	"Automatic isosurface propagation using an extrema graph and sorted boundary cell lists"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	1
, year =	1995
, pages =	"319--327"
, update =	"98.07 bibrelex"
}

@inproceedings{il-eltac-97
, author =	"Claudia Iturriaga and Anna Lubiw"
, title =	"Elastic Labels: the Two-Axis Case"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"181--192"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{isn-spapr-94
, author =	"M. Iwai and H. Suzuki and T. Nishizeki"
, title =	"Shortest path algorithm in the plane with rectilinear polygonal obstacles"
, booktitle =	"Proc. SIGAL Workshop"
, month =	jul
, year =	1994
, update =	"98.03 bibrelex"
}

@techreport{isn-spprp-95
, author =	"M. Iwai and H. Suzuki and T. Nishizeki"
, title =	"Shortest paths in a plane with rectiliinear polygonal obstacles"
, type =	"Report"
, institution =	"Graduate School of Information Science, Tohoku University, Japan"
, year =	"1995??"
, keywords =	"shortest paths, L1 metric, shortest path query, rectilinear polygons"
, update =	"96.05 efrat, 96.01 mitchell"
, annote =	"abstract in English, but paper in Japanese
		Submitted to a journal: Institute of Electronics, Information
		and Communication Engineers (IEICE), Tokyo"
}

@inproceedings{it-fhcaj-94i
, author =	"C. Iwamoto and G. T. Toussaint"
, title =	"Finding {Hamiltonian} Circuits in Arrangements of {Jordan} Curves is {NP}-Complete"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"93--98"
, cites =	"ans-nchcp-80, c-hc-85, egt-cal-92, egt-eal-93, gjt-phcpn-76, g-hcppc-82, lw-ehppn-93, or-cswvg-91, r-cscsl-87, rit-cscsl-90, t-tpg-56, w-tg-31, k-racpc-72, ZZZ"
, update =	"98.11 bibrelex, 95.01 smid, 94.09 jones"
}

@article{it-fhcaj-94a
, author =	"C. Iwamoto and G. T. Toussaint"
, title =	"Finding {Hamiltonian} Circuits in Arrangements of {Jordan} Curves is {NP}-Complete"
, journal =	"Inform. Process. Lett."
, volume =	52
, year =	1994
, pages =	"183--189"
, update =	"95.01 smid"
}

@article{i-smdnc-91
, author =	"K. Iwano"
, title =	"Strong {Minkowski} decomposition is {NP}-complete"
, journal =	"IEICE Trans."
, volume =	"E74"
, number =	4
, year =	1991
, pages =	"653--656"
, update =	"96.05 ramkumar"
}

@inproceedings{irt-tcpaa-94
, author =	"K. Iwano and P. Raghavan and H. Tamaki"
, title =	"The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"29--37"
, update =	"98.03 mitchell+smid, 96.05 mitchell"
}

@article{is-scpzs-90
, author =	"K. Iwano and K. Steiglitz"
, title =	"A semiring on convex polygons and zero-sum cycle problems"
, journal =	"SIAM J. Comput."
, volume =	19
, year =	1990
, pages =	"883--901"
}

@phdthesis{i-acsdp-90
, author =	"S. Iwanowski"
, title =	"Approximate congruence and symmetry detection in the plane"
, type =	"Ph.{D}. Thesis"
, school =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, year =	1990
, keywords =	"doctoral thesis"
}

@inproceedings{i-ltata-89
, author =	"S. Iwanowski"
, title =	"Linear Time Algorithms for Testing Approximate Congruence in the Plane"
, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, year =	1989
, pages =	"213--228"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{i-taspi-89
, author =	"S. Iwanowski"
, title =	"Testing approximate symmetry in the plane is {$NP$}-hard"
, booktitle =	"Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1989
, update =	"96.05 agarwal, 93.09 milone+mitchell"
}

@article{i-taspn-91
, author =	"S. Iwanowski"
, title =	"Testing Approximate Symmetry in the Plane is {NP}-Hard"
, journal =	"Theoret. Comput. Sci."
, volume =	80
, year =	1991
, pages =	"227--262"
, update =	"97.03 gaertner+salinger"
}

@article{iti-ieesu-92
, author =	"M. Iwata and J. Tanida and Y. Ichioka"
, title =	"Inference engine for expert system by using optical array logic"
, journal =	"Appl. Optics"
, volume =	31
, number =	26
, year =	1992
, pages =	"5604--5613"
, update =	"98.03 bibrelex"
}

@inproceedings{it-cbtcc-95
, author =	"M. Iwayama and T. Tokunaga"
, title =	"Cluster-Based Text Categorization: {A} Comparison of Category Search Strategies"
, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
, year =	1995
, pages =	"273--280"
, update =	"98.07 agarwal"
}

@book{ik-edm-68
, author =	"S. Iyanaga and Y. Kawada"
, title =	"Encyclopedic Dictionary of Mathematics"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1968
}

@book{ie-amrpm-91
, title =	"Autonomous Mobile Robots: Perception, Mapping, and Navigation"
, editor =	"S. Sitharama Iyengar and Alberto Elfes"
, publisher =	"IEEE Computer Society Press"
, address =	"Los Alamitos, CA"
, year =	1991
, pages =	"408--427"
}

@article{ijrw-rnaul-86
, author =	"S. S. Iyengar and C. C. Jorgensen and S. V. N. Rao and C. R. Weisbin"
, title =	"Robot Navigation Algorithms Using Learned Spatial Graphs"
, journal =	"Robotica"
, volume =	4
, year =	1986
, pages =	"93--100"
}

@inproceedings{i-favdc-88
, author =	"David Izraelevitz"
, title =	"Fast Algorithm For {Voronoi} Diagram Calculation Based On Distance Doubling"
, booktitle =	"Proceedings: The 2nd Symposium on the Frontiers of Massively Parallel Computations"
, publisher =	"IEEE"
, address =	"IEEE Service Center, Piscataway, NJ"
, year =	1988
, pages =	"173--176"
, keywords =	"Voronoi diagrams, fine-grain parallel computers"
, annote =	"Discrete VD on parallel machine."
, abstract =	"An efficient algorithm is described for calculation of
		 the Voronoi diagram over one- and two-dimensional
		 lattices. The algorithm proceeds by propagating the
		 location of Voronoi points through the lattice using a
		 distance-doubling strategy. This algorithm is designed
		 for implementation on a fine-grain parallel computer
		 such as the connection machine. It is shown how the
		 algorithm is extended to calculation of
		 distance-from-region computations and the use of
		 nonstandard metrics. Two algorithms are presented for
		 the calculation of the Voronoi diagram over one- and
		 two- dimensional lattices. Both algorithms propagate
		 the explicit location of the nearest Voronoi point
		 rather than the distance to the point and so are more
		 accurate than traditional methods. The first algorithm
		 is based on brushfire propagation while the second
		 algorithm relies on distance doubling. It is found that
		 the distance-doubling algorithm is more efficient than
		 the classical algorithm when at least one Voronoi
		 polygon is large. It is found that there is little
		 penalty in using the updated brushfire algorithm over
		 the traditional algorithm. 6 Refs."
}

@article{jmr-drafm-98
, author =	"T. Jabbour and C. Mascle and R. Maranzana"
, title =	"A Database for the Representation of Assembly Features in Mechanical Products"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"483--509"
, update =	"98.11 devillers"
}

@article{jg-gtmag-89
, author =	"D. Jablonowsky and V. A. Guarna"
, title =	"{GMB}: {A} Tool for Manipulating and Animating Graph Data Structures"
, journal =	"Softw. -- Pract. Exp."
, volume =	19
, number =	3
, year =	1989
, pages =	"283--301"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{jt-ottur-80
, author =	"C. Jackins and S. L. Tanimoto"
, title =	"Oct-trees and their use in representing $3$-d objects"
, journal =	"Comput. Graph. Image Process."
, volume =	14
, year =	1980
, pages =	"249--270"
}

@mastersthesis{j-cmtdo-79
, author =	"C. L. Jackins"
, title =	"Computer Modeling of three-dimensional objects using oct-trees"
, school =	"Univ. Washington"
, address =	"Seattle, WA"
, year =	1979
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@techreport{jt-otur3-82
, author =	"C. L. Jackins and S. L. Tanimoto"
, title =	"Octrees and their use in representing $3$-d objects"
, type =	"Technical {Report}"
, number =	"82-02-02"
, institution =	"Dept. Comput. Sci., Univ. Washington"
, address =	"Seattle, WA"
, year =	1982
, update =	"97.11 bibrelex"
}

@inproceedings{jw-opr-96
, author =	"L. Jackson and S. K. Wismath"
, title =	"Orthogonal polygon reconstruction"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"44--49"
, update =	"96.09 mitchell"
}

@inproceedings{j-euimp-89
, author =	"R. Jacob"
, title =	"Emerging user-interface media: potentials and challenges - eye tracking"
, booktitle =	"Tutorial SIGGRAPH '89"
, year =	1989
, update =	"98.07 bibrelex"
}

@article{j-dfaed-41
, author =	"C. G. J. Jacobi"
, title =	"De functionibus alternatibus earumque divisione per productum e differentiis elementorum conflatum"
, journal =	"J. Reine Angew. Math."
, volume =	22
, year =	1841
, pages =	"360--371"
, update =	"97.11 bibrelex"
}

@techreport{j-mlccp-90
, author =	"P. Jacobs"
, title =	"Minimal Length Curvature Constrained Paths in the Presence of Obstacles"
, type =	"Research {Report}"
, number =	90042
, institution =	"LAAS"
, address =	"7, av du colonel-Roche 31077 Toulouse Cedex"
, year =	1990
, update =	"95.01 devillers"
}

@inproceedings{jc-pspmr-89
, author =	"P. Jacobs and J. Canny"
, title =	"Planning Smooth Paths for Mobile Robots"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1989
, pages =	"2--7"
, precedes =	"jc-pspmr-92"
, update =	"98.03 mitchell"
}

@incollection{jc-pspmr-92
, author =	"P. Jacobs and J. Canny"
, title =	"Planning Smooth Paths for Mobile Robots"
, editor =	"Z. Li and J. F. Canny"
, booktitle =	"Nonholonomic Motion Planning"
, publisher =	"Kluwer Academic Pubishers"
, address =	"Norwell, MA"
, year =	1992
, pages =	"271--342"
, succeeds =	"jc-pspmr-89"
, update =	"98.03 mitchell"
}

@techreport{jhcp-pgnto-89
, author =	"P. Jacobs and G. Heinzinger and J. Canny and B. Paden"
, title =	"Planning Guaranteed Near-Time-Optimal Trajectories for a Manipulator in a Cluttered Workspace"
, type =	"Technical {Report}"
, number =	"ESRC 89-20/RAMP 89-15"
, institution =	"Engineering Systems Research Center, Univ. California"
, address =	"Berkeley, CA"
, month =	oct
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{jhcp-pgnto-89i
, author =	"P. Jacobs and G. Heinzinger and J. Canny and B. Paden"
, title =	"Planning Guaranteed Near-Time-Optimal Trajectories in a Cluttered Workspace"
, booktitle =	"Internat. Workshop on Sensorial Integration for Industrial Robots: Architectures and Applications"
, site =	"Zaragoza, Spain"
, month =	nov
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{jlt-empnm-91
, author =	"P. Jacobs and J.-P. Laumond and M. Taix"
, title =	"Efficient motion planners for nonholonomic mobile robots"
, booktitle =	"Proc. IEEE/RSJ Internat. Workshop Intell. Robots Syst."
, year =	1991
, pages =	"1229--1235"
, update =	"97.11 bibrelex"
}

@book{j-ba1-74
, author =	"N. Jacobson"
, title =	"Basic Algebra {I}"
, publisher =	"W. H. Freeman"
, address =	"San Francisco, CA"
, year =	1974
, precedes =	"j-ba1-85"
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@book{j-ba1-85
, author =	"N. Jacobson"
, title =	"Basic algebra {I}"
, edition =	"2nd"
, publisher =	"W. H. Freeman"
, address =	"New York, NY"
, year =	1985
, succeeds =	"j-ba1-74"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@techreport{j-guapd-92
, author =	"W. R. Jacometti"
, title =	"GeoLab - um ambiente para desenvolvimento de algoritmos em geometria computacional"
, number =	"DCC-IMECC-UNICAMP"
, institution =	"Departamento de Ci{\^e}ncia da Computa{\c c}{\~a}o, Universidade Estadual de Campinas"
, address =	"Campinas, Brazil"
, year =	1992
, keywords =	"master thesis"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@techreport{j-acaqt-80
, author =	"K. J. Jacquemin"
, title =	"Average case analysis of quad-trees"
, type =	"Report"
, number =	8003
, institution =	"Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
, address =	"Aachen, West Germany"
, year =	1980
}

@techreport{j-eduaf-82
, author =	"K. J. Jacquemin"
, title =	"Effiziente {Datenstrukturen} und {Algorithmen} f{\"u}r ausgew{\"a}hlte mehrdimensionale {Suchprobleme}"
, type =	"Manuscript"
, institution =	"Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
, address =	"Aachen, West Germany"
, year =	1982
}

@techreport{j-lubac-80
, author =	"K. J. Jacquemin"
, title =	"Lower and upper bounds for the average case complexity of quad-trees of arbitrary dimension"
, type =	"Report"
, number =	9011
, institution =	"Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
, address =	"Aachen, West Germany"
, year =	1980
}

@incollection{j-cegt-70
, author =	"A. Jacques"
, title =	"Constellations et Graphes Topologiques"
, booktitle =	"Combinatorial Theory and Applications"
, series =	"Colloquia Mathematica Societatis J{\'a}nos Bolyai"
, publisher =	"??"
, address =	"Budapest"
, year =	1970
, pages =	"657--672"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{jm-ccfps-93
, author =	"S. Jadhav and A. Mukhopadhyay"
, title =	"Computing a centerpoint of a finite planar set of points in linear time"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"83--90"
, cites =	"c-sdsno-87, csy-khrp-87, e-acg-87, ls-otahs-90, m-aogdc-91, m-apcad-83, m-ltalp-83, m-ptlp-85, yb-cf-61, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{jm-ccfps-94
, author =	"S. Jadhav and A. Mukhopadhyay"
, title =	"Computing a centerpoint of a finite planar set of points in linear time"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"291--312"
, update =	"95.01 smid"
}

@inproceedings{jmb-oairs-92
, author =	"S. Jadhav and A. Mukhopadhyay and B. K. Bhattacharya"
, title =	"An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons"
, booktitle =	"Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"New Delhi, India"
, year =	1992
, update =	"98.07 agarwal, 93.09 milone+mitchell"
}

@article{jmb-oairs-96
, author =	"S. Jadhav and A. Mukhopadhyay and B. K. Bhattacharya"
, title =	"An optimal algorithm for the intersection radius of a set of convex polygons"
, journal =	"J. Algorithms"
, volume =	20
, year =	1996
, pages =	"244--267"
, keywords =	"prune and search, optimization"
, update =	"98.07 agarwal, 96.05 agarwal+smid"
}

@inproceedings{jmm-sbq-95
, author =	"H. V. Jagadish and A. O. Mendelzon and T. Milo"
, title =	"Similarity-based queries"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Principles Database Syst."
, nickname =	"PODS '95"
, year =	1995
, pages =	"36--45"
, update =	"98.07 bibrelex"
}

@inproceedings{j-lcoma-90
, author =	"H. V. Jagdish"
, title =	"Linear clustering of objects with multiple attributes"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1990
, pages =	"332--342"
, update =	"97.07 agarwal"
}

@inproceedings{j-oils-90
, author =	"H. V. Jagdish"
, title =	"On indexing line segments"
, booktitle =	"Proc. 16th VLDB Conference"
, year =	1990
, pages =	"614--625"
, update =	"97.07 agarwal"
}

@article{jmsw-uomwi-89
, author =	"B. Jaggi and P. Mani-Levitska and B. Sturmfels and N. White"
, title =	"Uniform oriented matroids without the isotopy property"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"97--100"
}

@article{j-ehdim-90
, author =	"K.-U. Jahn"
, title =	"Evaluation of {Hausdorff} distances in interval mathematics"
, journal =	"Computing"
, volume =	45
, year =	1990
, pages =	"69--77"
, update =	"97.03 rote"
}

@inproceedings{jsv-pbsss-97
, author =	"Fabrice Jaillet and Behzad Shariat and Denis Vandorpe"
, title =	"Periodic {B}--Spline Surface Skinning Of Anatomic Shapes"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"199--204"
, update =	"97.11 jones"
}

@unpublished{j-leair-93
, author =	"P. Jaillon"
, title =	"{LEA}, a lazy exact arithmetic: Implementation and related problems"
, year =	1993
, note =	"Technical Report in preparation, {\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
, update =	"98.11 bibrelex"
}

@book{jd-acd-88
, author =	"A. K. Jain and R. C. Dubes"
, title =	"Algorithms for Clustering Data"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1988
, update =	"98.07 agarwal"
}

@book{j-ipa-92
, author =	"J. J\'aJ\'a"
, title =	"An Introduction to Parallel Algorithms"
, publisher =	"Addison-Wesley"
, address =	"Reading, Mass."
, year =	1992
, update =	"96.09 orourke"
}

@article{js-pagtp-82
, author =	"J. Ja'Ja' and J. Simon"
, title =	"Parallel Algorithms in Graph Theory: Planarity Testing"
, journal =	"SIAM J. Comput."
, volume =	11
, number =	2
, year =	1982
, pages =	"314--328"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{jd-hfdt-99
, author =	"A. James and A. M. Day"
, title =	"The Hidden Face Determination Tree"
, journal =	"Comput. \& Graphics"
, volume =	23
, number =	3
, month =	jun
, year =	1999
, pages =	"377--387"
, update =	"00.03 held"
}

@inproceedings{jb-iaem-87
, author =	"A. Jameson and T. Baker"
, title =	"Improvements to the aircraft {Euler} method"
, booktitle =	"AIAA 25th Aerospace Science Meeting"
, year =	1987
, note =	"Paper AIAA-87-0452"
, update =	"98.03 bibrelex"
}

@phdthesis{j-atag-85
, author =	"J. Jameson"
, title =	"Analytic techniques for automated grasp"
, school =	"Stanford Univ."
, address =	"Stanford, CA"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@article{j-dt-87
, author =	"R. E. Jamison"
, title =	"Direction trees"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"249--254"
}

@inproceedings{j-pacca-82
, author =	"R. E. Jamison-Waldner"
, title =	"A perspective of abstract convexity: classifying alignments by varieties"
, editor =	"D. C. Kay and M. Breen"
, booktitle =	"Convexity and Related Combinatorial Geometry, Proc. 2nd University of Oklahoma Conference"
, series =	"Lecture Notes in Pure and Applied Mathematics"
, volume =	76
, publisher =	"Marcel Dekker, Inc."
, year =	1982
, pages =	"113--150"
, update =	"98.07 bibrelex"
}

@techreport{jp-wcp-93t
, author =	"R. Janaardan and F. P. Preparata"
, title =	"Widest-corridor problemes"
, type =	"Technical Report"
, number =	"TR-93-17"
, institution =	"Dept. of Computer Science, University of Minnesota"
, address =	"Twin Cities"
, month =	may
, year =	1993
, precedes =	"jp-wcp-93, jp-wcp-94"
, update =	"98.11 bibrelex"
}

@inproceedings{j-mwdpp-91
, author =	"R. Janardan"
, title =	"On maintaining the width and diameter of a planar point-set online"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"137--149"
, precedes =	"j-mwdpp-93, j-mwdpp-93"
, update =	"96.09 devillers, 95.01 smid"
}

@article{j-mwdpp-93
, author =	"R. Janardan"
, title =	"On maintaining the width and diameter of a planar point-set online"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"331--344"
, keywords =	"diameter, duality, dynamization, width"
, succeeds =	"j-mwdpp-91"
, update =	"96.09 devillers, 95.01 smid"
}

@article{j-dmmpp-91
, author =	"R. Janardan"
, title =	"On the dynamic maintenance of maximal points in the plane"
, journal =	"Inform. Process. Lett."
, volume =	40
, year =	1991
, pages =	"59--64"
, update =	"95.01 smid"
}

@article{jl-gisp-93
, author =	"R. Janardan and M. Lopez"
, title =	"Generalized intersection searching problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"39--69"
, update =	"95.01 smid"
}

@inproceedings{jp-wcp-93
, author =	"R. Janardan and F. P. Preparata"
, title =	"Widest-corridor problems"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"426--431"
, succeeds =	"jp-wcp-93t"
, cites =	"cd-kdcp-90, cgl-pgd-85, eg-tsa-89, egs-oplms-86, hm-fwecs-88, jp-wcp-93t, ps-cgi-85, t-sgprc-83, ZZZ"
, update =	"01.11 devillers, 98.11 bibrelex, 93.09 milone+mitchell"
}

@article{jp-wcp-94
, author =	"R. Janardan and F. P. Preparata"
, title =	"Widest-corridor problems"
, journal =	"Nordic J. Comput."
, volume =	1
, year =	1994
, pages =	"231--245"
, succeeds =	"jp-wcp-93t"
, update =	"98.11 bibrelex, 95.01 smid"
}

@incollection{jw-mp-97
, author =	"R. Janardan and T. Woo"
, title =	"Manufacturing processes"
, chapter =	46
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"851--862"
, update =	"97.11 orourke"
}

@article{jl-rrt-92
, author =	"E. Jansen and W. de Leeuw"
, title =	"Recursive ray traversal"
, journal =	"Ray Tracing News"
, volume =	5
, number =	1
, year =	1992
, url =	"nic.funet.fi:/pub/graphics/misc/RTNews"
, update =	"98.07 bibrelex"
}

@article{j-dopct-91
, author =	"F. W. Jansen"
, title =	"Depth-Order Point Classification Techniques for {CSG} Display Algorithms"
, journal =	"ACM Trans. Graph."
, volume =	10
, number =	1
, year =	1991
, pages =	"40--70"
, update =	"93.09 goodrich"
}

@inproceedings{j-asbpc-98
, author =	"Klaus Jansen"
, title =	"An Approximation Scheme for Bin Packing with Conflicts"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"35--46"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

@article{j-sammd-93
, author =	"K. Jansen"
, title =	"One strike against the min-max degree triangulation problem"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"107--120"
, update =	"96.09 devillers"
}

@inproceedings{j-cmmdt-93
, author =	"Klaus Jansen"
, title =	"The complexity of the min-max degree triangulation problem"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"40--43"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{jw-cdccp-93
, author =	"K. Jansen and G. J. Woeginger"
, title =	"The complexity of detecting crossingfree configurations in the plane"
, journal =	"BIT"
, volume =	33
, number =	4
, year =	1993
, pages =	"580--595"
, update =	"97.11 bibrelex"
}

@techreport{jptw-sgas-90
, author =	"V. Jansen and A. Potthoff and W. Thomas and U. Wermuth"
, title =	"A Short Guide to the {AMORE} System"
, number =	"90-2"
, institution =	"Fachgruppe Informatik, RWTH Aachen"
, year =	1990
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{jkl-ebncl-98
, author =	"H. Jaouni and M. Khatib and J.-P. Laumond"
, title =	"Elastic Bands for Nonholonomic Car-Like Robots: {Algorithms} and Combinatorial Issues"
, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
, nickname =	"WAFR '98"
, year =	1998
, pages =	"to appear"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@article{j-ugukk-25
, author =	"V. Jarnik"
, title =	"{\"U }ber {Gitterpunkte} und konvexe {Kurven}"
, journal =	"Math. Zeitschrift"
, volume =	24
, year =	1925
, pages =	"500--518"
, update =	"97.11 bibrelex"
}

@inproceedings{j-actgr-89
, author =	"J. W. Jaromczyk"
, title =	"Algorithmic and combinatorial techniques for graphs in {$R^{d}$}"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	27
}

@article{j-ldtat-81
, author =	"J. W. Jaromczyk"
, title =	"Linear decision trees are too weak for convex hull problem"
, journal =	"Inform. Process. Lett."
, volume =	12
, year =	1981
, pages =	"138--141"
}

@inproceedings{j-lbpst-84
, author =	"J. W. Jaromczyk"
, title =	"Lower Bounds for Polygon Simplicity Testing and Other Problems"
, booktitle =	"Proc. Math. Found. of Computer Science '84"
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"339--347"
, update =	"93.09 held"
}

@techreport{j-polbm-87
, author =	"J. W. Jaromczyk"
, title =	"Proof of {$\Omega(n \log n)$} lower bound for maximal gap problem using slicer transformation approach"
, type =	"Report"
, number =	"91-87"
, institution =	"Dept. Comput. Sci., Univ. Kentucky"
, address =	"Lexington, KY"
, year =	1987
, keywords =	"lower bounds"
}

@inproceedings{jk-gpcbn-95
, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
, title =	"A Geometric Proof of the Combinatorial Bounds for the Number of Optimal Solutions to the $2$-Center {Euclidean} Problem"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"19--24"
, update =	"95.09 jones"
}

@inproceedings{jk-nrng-87
, author =	"J. W. Jaromczyk and M. Kowaluk"
, title =	"A note on relative neighborhood graphs"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"233--241"
, cites =	"e-acg-87, gf-iea-64, l-rtaa-69, lw-vdllm-80, l-tdvdl-80, s-rngam-83, t-egbnl-75, t-dsna-83, t-rngfp-80, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{jk-eaetc-94
, author =	"J. W. Jaromczyk and M. Kowaluk"
, title =	"An Efficient Algorithm for the {Euclidean} Two-Center Problem"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"303--311"
, cites =	"as-pglp-90, d-ptctm-84, e-acg-87, f-nolnm-61, f-samlp-67, hm-lnta-79, hs-ftp-91, k-sades-91a, ks-ebago-93, m-ltalp-83, rt-em-57, s-qgs-57, sh-cpp-75, v-cbrdf-87, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@inproceedings{jk-oicps-96
, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
, title =	"Orientation Independent Covering of Point Sets in {$R^2$} with Pairs of Rectangles or Optimal Squares"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"77--84"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{jk-rngnn-87
, author =	"J. W. Jaromczyk and M. Kowaluk"
, title =	"Relative neighborhood graphs and nearest neighbor pairs in $d$-dimensional space with the metric {$L^{p}$}"
, type =	"Report"
, number =	"98-87"
, institution =	"Dept. Comput. Sci., Univ. Kentucky"
, address =	"Lexington, KY"
, year =	1987
}

@inproceedings{jk-slcop-01
, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
, title =	"Sets of Lines and Cutting Out Polyhedral Objects"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"183--186"
, update =	"01.04 icking"
}

@inproceedings{jk-spals-88
, author =	"J. W. Jaromczyk and M. Kowaluk"
, title =	"Skewed Projections with an Application to Line Stabbing in {$R^3$}"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, organization =	"ACM"
, publisher =	"ACM Press"
, address =	"New York"
, year =	1988
, pages =	"362--370"
, keywords =	"image part pattern"
, cites =	"ab-eact-87, a-dp-86, ad-ahdsp-87, aw-alts-87, b-mag-69, dgk-htir-63, ds-cpcde-65, emprww-sls-82, e-ftssg-85, es-mnwsn-87, egs-ueplf-87, epss-lebfi-87, et-eaide-85, g-ct-58, hdk-cgp-64, hs-ndssg-86, klz-gpcs-85, scklps-gadss-86, s-pds-74, w-ublo-86, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@inproceedings{jk-fwchw-00
, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
, title =	"The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"93--97"
, update =	"00.03 bibrelex"
}

@inproceedings{jk-tlcpp-95
, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
, title =	"The Two-Line Center Problem from a Polar view: {A} new algorithm and data structure"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"13--25"
, update =	"99.11 bibrelex, 99.07 bibrelex, 97.03 agarwal, 96.09 agarwal, 95.05 mitchell"
}

@article{js-rfccg-91
, author =	"J. W. Jaromczyk and G. {\'S}wi{\c a}tek"
, title =	"A role of lower semi-continuous functions in combinatorial complexity of geometric problems"
, journal =	"J. Complexity"
, volume =	"??"
, year =	1991
, update =	"98.07 bibrelex"
}

@article{jt-rngtr-92
, author =	"J. W. Jaromczyk and G. T. Toussaint"
, title =	"Relative Neighborhood Graphs and Their Relatives"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1502--1517"
, update =	"93.09 held"
}

@article{jw-cchfp-94
, author =	"J. W. Jaromczyk and G. W. Wasilkowski"
, title =	"Computing convex hull in a floating point arithmetic"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"283--292"
, update =	"95.01 smid"
}

@inproceedings{jw-nscha-90
, author =	"J. W. Jaromczyk and G. W. Wasilkowski"
, title =	"Numerical stability of a convex hull algorithm for simple polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"257--260"
, cites =	"e-acg-87, f-smpst-89, g-eadch-72, gy-fchsp-83, l-fchsp-83, ps-cgi-85, ZZZ"
, update =	"98.07 bibrelex"
}

@article{jw-nscha-93
, author =	"J. W. Jaromczyk and G. W. Wasilkowski"
, title =	"Numerical stability of a convex hull algorithm for simple polygons"
, journal =	"Algorithmica"
, volume =	10
, year =	1993
, pages =	"457--472"
, update =	"95.01 smid"
}

@inproceedings{j-cshpp-77
, author =	"R. A. Jarvis"
, title =	"Computing the shape hull of points in the plane"
, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
, year =	1977
, pages =	"231--241"
}

@article{j-ichfs-73
, author =	"R. A. Jarvis"
, title =	"On the identification of the convex hull of a finite set of points in the plane"
, journal =	"Inform. Process. Lett."
, volume =	2
, year =	1973
, pages =	"18--21"
, keywords =	"designing algorithms, convex hull, two-dimensional, worst-case analysis"
, annote =	"$O(n h)$ time"
}

@inproceedings{j-snnms-78
, author =	"R. A. Jarvis"
, title =	"Shared near neighbor maximal spanning trees for cluster analysis"
, booktitle =	"Proc. 4th IEEE Internat. Conf. Pattern Recogn."
, site =	"Kyoto, Japan"
, year =	1978
, update =	"98.03 bibrelex"
}

@inproceedings{jts-oampn-86
, author =	"R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
, title =	"An Optimal Algorithm for Maximal Planarization of Nonplanar Graphs"
, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
, year =	1986
, pages =	"1237--1240"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{jts-oagp-88
, author =	"R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
, title =	"${O}(n^2)$ Algorithms for Graph Planarization"
, number =	"CSD-88-01"
, institution =	"Department of Computer Science, Concordia University"
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{jts-oagp-89
, author =	"R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
, title =	"${O}(n^2)$ Algorithms for Graph Planarization"
, journal =	"IEEE Trans. Comp.-Aided Design"
, volume =	8
, year =	1989
, pages =	"257--267"
, keywords =	"graph drawing, planarization"
, update =	"95.05 tamassia"
}

@article{jts-pelta-88
, author =	"R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
, title =	"Planar Embedding: Linear-Time Algorithms for Vertex Placement and Edge Ordering"
, journal =	"IEEE Trans. Circuits Syst."
, volume =	35
, number =	3
, year =	1988
, pages =	"334--344"
, keywords =	"graph drawing"
, update =	"96.09 devillers, 93.09 tamassia"
}

@techreport{js-vbrct-87
, author =	"R. Jayaraman and V. Srinivasan"
, title =	"Virtual boundary requirements and conditional tolerances in mechanical design"
, type =	"Report"
, number =	"RC 12942 (\#58050)"
, institution =	"Auto. Res. Group, IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1987
}

@article{jnr-dippl-87
, author =	"R. J{\`e}gan and R. Nowakowski and I. Rival"
, title =	"The Diagram Invariant Problem for Planar Lattices"
, journal =	"Acta Sci. Math. Szeged"
, volume =	51
, year =	1987
, pages =	"103--121"
, update =	"97.11 bibrelex"
}

@inproceedings{jl-rcgs-92
, author =	"E. Jennings and A. Lingas"
, title =	"On the Relationships among Constrained Geometric Structures"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"289--298"
, update =	"94.09 smid, 93.09 milone+mitchell"
}

@incollection{jl-agtls-93
, author =	"G. F. Jennings and W. J. Lenhart"
, title =	"An art gallery theorem for line segments in the plane"
, editor =	"G. T. Toussaint"
, booktitle =	"Pattern Recognition Letters Special Issue on Computational Geometry"
, month =	sep
, year =	1993
, update =	"98.11 bibrelex"
}

@inproceedings{j-rcnls-96
, author =	"Henrik Wann Jensen"
, title =	"Rendering Caustics on Non-Lambertian Surfaces"
, booktitle =	"Proc. Graphics Interface '96"
, site =	"Toronto"
, year =	1996
, pages =	"116--121"
, update =	"00.11 smid, 00.07 icking, 99.07 orourke"
}

@article{j-pvdll-91
, author =	"C.-J. Jeong"
, title =	"Parallel {Voronoi} Diagram in ${L}_{1}$ (${L}_{\infty}$) Metric on a Mesh-connected Computer"
, journal =	"Parallel Comput."
, volume =	17
, number =	"2--3"
, month =	jun
, year =	1991
, pages =	"241--252"
, update =	"93.09 held"
}

@article{jl-pgamc-90
, author =	"C. S. Jeong and D. T. Lee"
, title =	"Parallel geometric algorithms on a mesh-connected computer"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"155--177"
}

@inproceedings{jdh-ucgtd-87
, author =	"R. B. Jerard and R. L. Drysdale and K. Hauck"
, title =	"The Uses of Computer Graphics as a Tool for Detecting Errors in Numerical Control Machining of Sculptured Surfaces"
, booktitle =	"Proceedings of NCGA's Computer Graphics '87"
, site =	"Philadelphia"
, month =	mar
, year =	1987
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@inproceedings{jhd-sncms-86
, author =	"R. B. Jerard and K. Hauck and R. L. Drysdale"
, title =	"Simulation of Numerical Control Machining of Sculptured Surfaces"
, booktitle =	"15th International Symposium on Automative Technology and Automation"
, nickname =	"ISATA"
, month =	oct
, year =	1986
, note =	"Paper No. 86057"
, update =	"98.03 bibrelex"
}

@article{jk-rbhat-85
, author =	"B. Jeromin and F. K{\"o}rner"
, title =	"On the refinement of bounds of heuristic algorithms for the traveling salesman problem"
, journal =	"Math. Program."
, volume =	32
, year =	1985
, pages =	"114--117"
, keywords =	"heuristics, approximation"
}

@inproceedings{jj-3dlrg-95
, author =	"T. J{\'e}ron and C. Jard"
, title =	"{3D} Layout of Reachability Graphs of Communicating Processes"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"25--32"
, keywords =	"graph drawing, 3D"
, update =	"95.01 tamassia"
}

@article{j-saprm-73
, author =	"R. G. Jeroslow"
, title =	"The simplex algorithm with the pivot rule of maximizing criterion improvement"
, journal =	"Discrete Math."
, volume =	4
, year =	1973
, pages =	"367--377"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{j-crpg-82
, author =	"M. Jerrum"
, title =	"A Compact Representation for Permutation Groups"
, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1982
, pages =	"126--133"
, update =	"97.11 bibrelex"
}

@article{j-crpg-86
, author =	"M. Jerrum"
, title =	"A compact representation for permutation groups"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"60--78"
}

@techreport{j-dsson-87
, author =	"M. Jerrum"
, title =	"A data structure for systems of orthogonal, non-overlapping rectangles"
, type =	"Report"
, number =	"CSR-239-87"
, institution =	"Dept. Comput. Sci., Univ. Edinburgh"
, address =	"Edinburgh, Scotland"
, year =	1987
}

@techreport{j-cporp-85
, author =	"M. Jerrum"
, title =	"Complementary partial orders and rectangle packing"
, type =	"Report"
, number =	"CSR-190-85"
, institution =	"Dept. Comput. Sci., Univ. Edinburgh"
, address =	"Edinburgh, Scotland"
, year =	1985
}

@article{jvv-rgcsu-86
, author =	"M. Jerrum and L. Valiant and V. Vazirani"
, title =	"Random generation of combinatorial structures from a uniform distribution"
, journal =	"Theoret. Comput. Sci."
, volume =	43
, year =	1986
, pages =	"169--188"
, update =	"98.03 bibrelex"
}

@inproceedings{jjm-asest-01
, author =	"M{\'a}rio Jesus and S{\'e}rgio Jesus and Alberto M{\'a}rquez"
, title =	"Approximated Solutions for the {Euclidean} {Steiner} Tree Problem with Large Sets of Points"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"174--177"
, update =	"01.04 icking"
}

@inproceedings{je-sppi-94
, author =	"Yan-Bin Jia and Michael Erdmann"
, title =	"Sensing Polygon Poses by Inscription"
, booktitle =	"Proc. 1994 IEEE Internat. Conf. Robot. Autom."
, publisher =	"IEEE Computer Society"
, year =	1994
, pages =	"1642--1649"
, keywords =	"probing, point probes, part orientation"
, update =	"96.09 romanik"
}

@inproceedings{je-csps-94
, author =	"Yan-Bin Jia and Michael Erdmann"
, title =	"The Complexity of Sensing by Point Sampling"
, booktitle =	"Proc. 1st Workshop Algorithmic Found. Robot."
, publisher =	"A.~K. Peters"
, address =	"Wellesley, MA"
, year =	1995
, pages =	""
, keywords =	"probing, point probes, NP-complete"
, update =	"98.07 agarwal, 96.09 romanik"
}

@inproceedings{jw-assst-94
, author =	"T. Jiang and L. Wang"
, title =	"An Approximation Scheme for Some {Steiner} Tree Problems in the Plane"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"414--422"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
}

@article{jyb-drisc-96
, author =	"X. Jiang and K. Yu and H. Bunke"
, title =	"Detection of Rotational and Involutional Symmetries and Congruity of Polyhedra"
, journal =	"Visual Comput."
, volume =	12
, number =	4
, year =	1996
, pages =	"193--201"
, update =	"96.09 held"
}

@inproceedings{jb-dspao-91
, author =	"Xiao-Yi Jiang and Horst Bunke"
, title =	"Determination of the symmetries of polyhedra and an application to object recognition"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"113--121"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
, abstract =	"In this paper we present a simple and efficient algorithm
                 for determining the rotational symmetries of polyhedral
                 objects in $O(m^2)$ time using $O(m)$ space where
                 $m$ represents the number of edges of the object.
                 Our algorithm is an extension of Weinberg's algorithm for
                 determining isomorphisms of planar triply connected graphs.
                 The symmetry information detected by our algorithm can be
                 utilized for various purposes in artificial intelligence,
                 robotics, assembly planning and machine vision.
                 In particular, an application of symmetry analysis to object
                 recognition will be described in some detail."
}

@article{jabccpw-ifemp-93
, author =	"R. A. Jinkerson and S. L. Abrams and L. Bardis and C. Chryssostomidis and A. Cl{\'e}ment and N. M. Patrikalakis and F.-E. Wolter"
, title =	"Inspection and Feature Extraction of Marine Propellers"
, journal =	"Journal of Ship Production"
, volume =	9
, number =	2
, year =	1993
, pages =	"88--106"
, update =	"95.05 abrams"
}

@article{j-3dtlt-89
, author =	"B. Joe"
, title =	"3-Dimensional Triangulations from Local Transformations"
, journal =	"SIAM J. Sci. Statist. Comput."
, volume =	10
, number =	4
, year =	1989
, pages =	"718--741"
, annote =	"Considers 3D DT and max-min solid angle criterion.
		 Shows 3D DT has local optimality property, but
		 switchings will not necessarily converge to DT.
		 Conjectures that switchings based on insertion
		 algorithm give DT. Experiments with variations on
		 switching order."
}

@techreport{j-ckddt-93
, author =	"Barry Joe"
, title =	"Construction of $k$-dimensional {Delaunay} triangulations using local transformations"
, institution =	"University of Alberta"
, address =	"Edmonton, Alberta, Canada"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@article{j-ctddt-91
, author =	"B. Joe"
, title =	"Construction of Three-Dimensional {Delaunay} Triangulations Using Local Transformations"
, journal =	"Comput. Aided Geom. Design"
, volume =	8
, number =	2
, month =	may
, year =	1991
, pages =	"123--142"
, update =	"93.09 held"
}

@techreport{j-ctdiq-93
, author =	"Barry Joe"
, title =	"Construction of three-dimensional improved-quality triangulations using local transformations"
, institution =	"University of Alberta"
, address =	"Edmonton, Alberta, Canada"
, month =	jul
, year =	1993
, update =	"93.09 milone+mitchell"
}

@techreport{j-dtmcp-84
, author =	"B. Joe"
, title =	"Delaunay triangular meshes in convex polygons"
, type =	"Report"
, number =	"CS-84-15"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1984
, keywords =	"finite element method, mesh generation, numerical analysis, decomposition, Delaunay triangulations"
, precedes =	"j-dtmcp-86"
}

@article{j-dtmcp-86
, author =	"B. Joe"
, title =	"{Delaunay} Triangular Meshes in Convex Polygons"
, journal =	"SIAM J. Sci. Statist. Comput."
, volume =	7
, number =	2
, year =	1986
, pages =	"514--539"
, succeeds =	"j-dtmcp-84"
, annote =	"Finds a Delaunay Triangulation of a convex polygon.
		 Extra points are added on a semiregular grid and on
		 boundary. Hard part is strip around boundary. Initial
		 triangle constructed by a ``walk'' method, improved by
		 switchings."
}

@article{j-dvmms-91
, author =	"Barry Joe"
, title =	"{Delaunay} Versus Max-Min Solid Angle Triangulations For Three-Dimensional Mesh Generation"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	31
, number =	5
, month =	apr
, year =	1991
, pages =	"987--997"
, keywords =	"mesh generation, Delaunay triangulations"
, annote =	"Builds 3D DT by incremental flip. Then flips to
		 maximize minimum solid angle. Max-min seems to give
		 better shapes."
, abstract =	"The Delaunay triangulation has been used in several
		 methods for generating finite element tetrahedral
		 meshes in three-dimensional polyhedral regions. Other
		 types of three-dimensional triangulations are possible,
		 such as a triangulation satisfying a local max-min
		 solid angle criterion. In this paper, we present
		 experimental results to show that max-min solid angle
		 triangulations are better than Delaunay triangulations
		 for finite element tetrahedral meshes, since the former
		 type of triangulations contains tetrahedra of better
		 shape than the latter type. We also describe how mesh
		 points are generated and triangulated in our
		 tetrahedral mesh generation method. (Author abstract)
		 16 Refs."
}

@techreport{j-fetcr-84
, author =	"B. Joe"
, title =	"Finite element triangulation of complex regions using computational geometry"
, type =	"Report"
, number =	"CS-84-19"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1984
}

@article{j-gspgm-91
, author =	"B. Joe"
, title =	"Geompack. {A} Software Package For The Generation Of Meshes Using Geometric Algorithms"
, journal =	"Advances in Engineering Software and Workstations"
, volume =	13
, number =	"5--6"
, month =	sep
, year =	1991
, pages =	"325--331"
, keywords =	"geompack computer software, mesh generation software, geometric algorithms, Delaunay triangulation, visibility polygons"
, annote =	"2D and 3D triangulations via insertion flip alg.
		 Vertices are bin sorted in $\sqrt(n)$ bins."
, abstract =	"We describe the mathematical software package
		 GEOMPACK, which contains standard Fortran 77 routines
		 for the generation of two-dimensional triangular and
		 three-dimensional tetrahedral finite element meshes
		 using efficient geometric algorithms. This package
		 results from our research into mesh generation and
		 geometric algorithms. It contains routines for
		 constructing two- and three-dimensional Delaunay
		 triangulations, decomposing a general polygonal region
		 into simple or convex polygons, constructing the
		 visibility polygon of a simple polygon from a
		 viewpoint, and other geometric algorithms, from which
		 our mesh generation method is built and others can be
		 implemented. Our method generates meshes in polygonal
		 or polyhedral regions specified by their boundary
		 representation and possible interfaces between
		 subregions. (Author abstract) 15 Refs."
}

@techreport{j-gspgm-93
, author =	"Barry Joe"
, title =	"GEOMPACK: A software package for the generation of meshes using geometric algorithms"
, institution =	"University of Alberta"
, address =	"Edmonton, Alberta, Canada"
, month =	jul
, year =	1993
, update =	"93.09 milone+mitchell"
}

@article{j-ocltv-90
, author =	"B. Joe"
, title =	"On the correctness of a linear-time visibility polygon algorithm"
, journal =	"Internat. J. Comput. Math."
, volume =	32
, year =	1990
, pages =	"155--172"
, update =	"97.03 smid+icking"
}

@article{j-qmgpr-95
, author =	"B. Joe"
, title =	"Quadrilateral mesh generation in polygonal regions"
, journal =	"Comput. Aided Design"
, volume =	27
, year =	1995
, pages =	"209--222"
, update =	"98.07 bibrelex"
}

@techreport{j-tdbct-93
, author =	"Barry Joe"
, title =	"Three-dimensional boundary-constrained triangulations"
, institution =	"University of Alberta"
, address =	"Edmonton, Alberta, Canada"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@techreport{js-acpvp-87
, author =	"B. Joe and R. B. Simpson"
, title =	"Algorithms and correctness proofs for visibility polygon computations"
, type =	"Report"
, number =	"CS-87-03"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1987
, keywords =	"visibility, hidden line/surface elimination"
}

@article{js-clvpa-87
, author =	"B. Joe and R. B. Simpson"
, title =	"Correction to {Lee}'s visibility polygon algorithm"
, journal =	"BIT"
, volume =	27
, year =	1987
, pages =	"458--473"
}

@techreport{js-fetcr-??
, author =	"B. Joe and R. B. Simpson"
, title =	"Finite element triangulation of complex regions"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	"??"
}

@article{js-tmrcs-86
, author =	"B. Joe and R. B. Simpson"
, title =	"Triangular meshes for regions of complicated shape"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	23
, year =	1986
, pages =	"751--778"
, keywords =	"finite element method, mesh generation, numerical analysis, decomposition, multiply-connected"
}

@techreport{js-vspp-85
, author =	"B. Joe and R. B. Simpson"
, title =	"Visibility of a simple polygon from a point"
, type =	"Report"
, number =	"CS-85-38"
, institution =	"Dept. Math. Comput. Sci., Drexel Univ."
, address =	"Philadelphia, PA"
, year =	1985
, keywords =	"visibility, hidden line/surface elimination, algorithm correctness"
}

@techreport{jw-dcvdd-88
, author =	"B. Joe and C. Wang"
, title =	"Duality constrained {Voronoi} diagrams and {Delaunay} triangulation of a set of line segments"
, type =	"Technical {Report}"
, institution =	"Memorial Univ. of Newfoundland"
, year =	1988
, update =	"98.07 bibrelex"
}

@article{jss-pccrp-77
, author =	"L. S. Joel and D. R. Shier and M. L. Stein"
, title =	"Planes, Cubes and Center-Representable Polytopes"
, journal =	"Amer. Math. Monthly"
, volume =	84
, year =	1977
, pages =	"360--363"
, update =	"94.05 aich"
}

@article{j-sadki-74
, author =	"A. Joffe"
, title =	"On a set of almost deterministic k-independent random variables"
, journal =	"Ann. Probab."
, volume =	2
, year =	1974
, pages =	"161--162"
, update =	"96.09 orourke"
}

@article{jg-sab3d-83
, author =	"G. H. Johansen and C. Gram"
, title =	"A simple algorithm for building the $3$-d convex hull"
, journal =	"BIT"
, volume =	23
, year =	1983
, pages =	"146--160"
}

@techreport{j-wdmim-97
, author =	"Peter Johansson"
, title =	"On a Weighted Distance Model for Injection Moulding"
, type =	"Link{\"o}ping Studies in Science and Technology, Thesis No. 604"
, number =	"LiU-TEK-LIC-1997:05"
, institution =	"Division of Applied Mathematics, Link{\"o}ping University"
, address =	"Link{\"o}ping, Sweden"
, month =	feb
, year =	1997
, keywords =	"shortest paths, injection molding, weighted region problem"
, update =	"98.03 mitchell"
, annote =	"Licentiate thesis"
}

@article{j-episc-48
, author =	"F. John"
, title =	"Extremum problems with inequalities as subsidary conditions"
, journal =	"Courant Anniversary"
, volume =	"??"
, year =	1948
, pages =	"187--204"
, update =	"97.11 bibrelex"
}

@inproceedings{j-ttvhs-93
, author =	"B. Johnson"
, title =	"TreeViz: TreeMap Visualization of Hierarchically Structured Information"
, booktitle =	"Proc. ACM Conf. on Human Factors in Computing Systems"
, nickname =	"CHI"
, year =	1993
, pages =	"369--370"
, keywords =	"graph drawing, planar"
, update =	"96.09 tamassia, 96.04 garg"
}

@article{js-tmsat-91
, author =	"B. Johnson and B. Shneiderman"
, title =	"Tree-Maps: A Space-Filling Approach to the Visualization of Hierarchical Information Systems"
, journal =	"IEEE Visualization"
, volume =	"??"
, year =	1991
, keywords =	"graph drawing, planar"
, update =	"96.09 tamassia, 96.04 garg"
}

@book{j-nspde-87
, author =	"C. Johnson"
, title =	"Numerical solution of partial differential equations by the finite element method"
, publisher =	"Cambridge University Press"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{j-pqiqo-82
, author =	"D. B. Johnson"
, title =	"A priority queue in which initialization and queue operations take $O(\log\log D)$ time"
, journal =	"Math. Syst. Theory"
, volume =	"??"
, year =	1982
, pages =	"295--309"
, update =	"97.11 bibrelex"
}

@article{jm-sktex-78
, author =	"D. B. Johnson and T. Mizoguchi"
, title =	"Selecting the $k$-th element in {$X+Y$} and {$X_{1}+X_{2} + ... +X_{m}$}"
, journal =	"SIAM J. Comput."
, volume =	7
, year =	1978
, pages =	"147--153"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{j-aacp-74
, author =	"D. S. Johnson"
, title =	"Approximation algorithms for combinatorial problems"
, journal =	"J. Comput. Syst. Sci."
, volume =	9
, year =	1974
, pages =	"256--278"
}

@article{j-nccog-82
, author =	"D. S. Johnson"
, title =	"The {NP}-Completeness Column: an Ongoing Guide"
, journal =	"J. Algorithms"
, volume =	3
, number =	1
, year =	1982
, pages =	"89--99"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{j-nccog-84
, author =	"D. S. Johnson"
, title =	"The {NP}-Completeness Column: an Ongoing Guide"
, journal =	"J. Algorithms"
, volume =	5
, number =	2
, year =	1984
, pages =	"147--160"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{jdugg-wcpbs-74
, author =	"D. S. Johnson and A. Demers and J. D. Ullmann and M. R. Garey and R. L. Graham"
, title =	"Worst-case performance bounds for simple one-dimensional packing algorithms"
, journal =	"SIAM J. Comput."
, volume =	3
, year =	1974
, pages =	"299--325"
, update =	"97.03 icking"
}

@inproceedings{jmr-aeahk-96
, author =	"D. S. Johnson and L. A. McGeoch and E. E. Rothberg"
, title =	"Asymptotic experimental analysis for the {Held}-{Karp} traveling salesman bound"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"341--350"
, keywords =	"integer programming, linear programming, approximation, TSP, uniform random points"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@incollection{jp-cctsp-85
, author =	"D. S. Johnson and C. H. Papadimitriou"
, title =	"Computational complexity and the traveling salesman problem"
, editor =	"E. Lawler and J. Lenstra and A. Rinnooy Kan and D. Shmoys"
, booktitle =	"The Traveling Salesman Problem"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1985
, pages =	"68--74"
, update =	"95.09 mitchell"
}

@article{jp-hpcdv-87
, author =	"D. S. Johnson and H. O. Pollak"
, title =	"Hypergraph Planarity and the Complexity of Drawing {Venn} Diagrams"
, journal =	"J. Graph Theory"
, volume =	11
, number =	3
, year =	1987
, pages =	"309--325"
, keywords =	"graph drawing"
, update =	"97.07 guedes, 93.09 tamassia"
}

@article{jp-dhp-78
, author =	"D. S. Johnson and F. P. Preparata"
, title =	"The densest hemisphere problem"
, journal =	"Theoret. Comput. Sci."
, volume =	6
, year =	1978
, pages =	"93--107"
}

@book{j-aeg-60
, author =	"R. A. Johnson"
, title =	"Advanced {Euclidean} Geometry"
, publisher =	"Dover"
, address =	"New York"
, year =	1960
, update =	"98.11 bibrelex"
}

@article{j-hcs-67
, author =	"S. C. Johnson"
, title =	"Hierarchical clustering schemes"
, journal =	"Psychometrika"
, volume =	32
, year =	1967
, pages =	"241--254"
, update =	"98.03 bibrelex"
}

@article{jl-elmhs-84
, author =	"W. Johnson and J. Lindenstrauss"
, title =	"Extensions of {Lipschitz} maps into a {Hilbert} space"
, journal =	"Contemp. Math."
, volume =	26
, year =	1984
, pages =	"189--206"
, update =	"00.11 smid, 00.07 agarwal"
}

@article{jsk-actfm-91
, author =	"B. P. Johnston and J. M. Sullivan and A. Kwasnik"
, title =	"Automatic Conversion of Triangular Finite Meshes to Quadrilateral Elements"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	31
, number =	1
, year =	1991
, pages =	"67--84"
, annote =	"Works by combining adjacent triangles---looking at
		 those with one neighbour first and trying to combine
		 them with adjacent nodes. Bad quads are rejected.
		 Splitting triangles may be necessary."
}

@techreport{j-niauc-91
, author =	"J. K. Johnstone"
, title =	"A new intersection algorithm using circle decomposition"
, type =	"Technical {Report}"
, number =	"JHU-91-20"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	oct
, year =	1991
}

@techreport{j-fgdcr-91
, author =	"J. K. Johnstone"
, title =	"Finding generators and directrix curves on ruled surfaces"
, type =	"Technical {Report}"
, number =	"91-17"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	sep
, year =	1991
, succeeds =	"j-wrssm-89"
}

@phdthesis{j-spaac-87
, author =	"J. K. Johnstone"
, title =	"The sorting of points along an algebraic curve"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1987
, note =	"Technical Report TR 87-841"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@incollection{j-wrssm-89
, author =	"J. K. Johnstone"
, title =	"Working with ruled surfaces in solid modeling"
, booktitle =	"Computers and Mathematics"
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"260--268"
, precedes =	"j-fgdcr-91"
}

@article{jb-spaac-90
, author =	"J. K. Johnstone and C. Bajaj"
, title =	"Sorting points along an algebraic curve"
, journal =	"SIAM J. Comput."
, volume =	19
, year =	1990
, pages =	"925--967"
}

@article{jg-lmipa-91
, author =	"J. K. Johnstone and M. Goodrich"
, title =	"A localized method for intersecting plane algebraic curve segments"
, journal =	"Visual Comput."
, volume =	7
, year =	1991
, pages =	"60--71"
}

@techreport{js-cipnq-91
, author =	"J. K. Johnstone and C.-K. Shene"
, title =	"Computing the intersection of a plane and a natural quadric"
, type =	"Technical {Report}"
, number =	"JHU-91-04"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1991
, comments =	"to appear in Computers and Graphics 16 (1992)"
}

@techreport{js-drqsr-90
, author =	"J. K. Johnstone and C. K. Shene"
, title =	"The distance Representation of Quadric surfaces: {Ruled} quadrics"
, number =	"JHU-90/08"
, institution =	"Dept. of Comp. Sci., Johns Hopkins Univ"
, address =	"Baltimore, MD"
, month =	jul
, year =	1990
, keywords =	"representation of surfaces, bisector, quadric surfaces, design, solid modeling"
, update =	"93.09 milone+mitchell"
}

@techreport{js-rahos-91
, author =	"J. K. Johnstone and C.-K. Shene"
, title =	"The representation of all hyperboloids of one sheet by two lines"
, type =	"Technical {Report}"
, number =	"JHU-91-19"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	jul
, year =	1991
}

@article{jmb-rcacv-91
, author =	"J. Jolion and P. Meer and S. Batauche"
, title =	"Robust Clustering with Applications in Computer Vision"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	13
, year =	1991
, pages =	"791--802"
, update =	"98.07 agarwal"
}

@article{jk-tawai-78
, author =	"A. T. Jonassen and D. E. Knuth"
, title =	"A trivial algorithm whose analysis isn't"
, journal =	"J. Comput. Syst. Sci."
, volume =	16
, year =	1978
, pages =	"301--322"
}

@article{j-cnpp-89
, author =	"C. Jones"
, title =	"Cartographic name placement with {Prolog}"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	5
, year =	1989
, pages =	"36--47"
, update =	"98.07 bibrelex"
}

@article{j-nahlp-71
, author =	"C. B. Jones"
, title =	"A new approach to the ``hidden line'' problem"
, journal =	"Comput. J."
, volume =	14
, year =	1971
, pages =	"232--237"
}

@article{jwe-tsmns-99
, author =	"C. B. Jones and J. M. Ware and C. D. Enyon"
, title =	"Triangulated Spatial Models and Neighborhood Search: An Experimental Comparison with Quadtrees"
, journal =	"Visual Comput."
, volume =	15
, number =	5
, year =	1999
, pages =	"235--248"
, update =	"00.03 held"
}

@techreport{j-orvgt-93
, author =	"C. H. Jones"
, title =	"An obstacle to realizing visibility graphs and triangle intersection graphs"
, institution =	"Washington State University"
, address =	"Pullman, WA"
, month =	jul
, year =	1993
, update =	"93.09 milone+mitchell"
}

@article{j-ecpqe-86
, author =	"D. W. Jones"
, title =	"An Empirical Comparison of Priority-Queue and Event-Set Implementations"
, journal =	"Commun. ACM"
, volume =	29
, number =	4
, month =	apr
, year =	1986
, pages =	"300--311"
, update =	"98.11 bibrelex"
}

@techreport{j-icfsi-87
, author =	"L. G. Jones"
, title =	"Incremental Compaction of Flat Symbolic IC Layouts"
, type =	"Technical {Report}"
, number =	"UIUCDCS-R-87-1386"
, institution =	"Dept. Computer Science, Univ. Illinois."
, address =	"Urbana, IL"
, year =	1987
, update =	"96.01 tamassia"
}

@inproceedings{js-hvdsb-86
, author =	"L. G. Jones and J. Simon"
, title =	"Hierarchical VLSI Design Systems Based on Attribute Grammars"
, booktitle =	"13th ACM Sympos. on Principles of Programming Languages"
, year =	1986
, pages =	"58--69"
, update =	"96.01 tamassia"
}

@inproceedings{jpb-gmsam-95
, author =	"M. R. Jones and M. A. Price and G. Butlin"
, title =	"Geometry Management Support for Auto-meshing"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"153--164"
, update =	"96.01 samitchell"
}

@article{jc-nacsc-94
, author =	"M. W. Jones and M. Chen"
, title =	"A new approach to the construction of surfaces from contour data"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	3
, year =	1994
, pages =	"75--84"
, keywords =	"computer graphics, contours, surfaces, approximation"
, update =	"95.09 korneenko"
}

@article{jw-asts-91
, author =	"Norman L. Jones and Stephen G. Wright"
, title =	"Algorithm For Smoothing Triangulated Surfaces"
, journal =	"Journal of Computing in Civil Engineering"
, volume =	5
, number =	1
, month =	jan
, year =	1991
, pages =	"85--102"
, keywords =	"contouring, volume calculations, smooth interpolation surfaces, triangulated surface smoothing"
, annote =	"Extra points added where deviation is maximum.
		 Insertion inside flip to update tri. Also suggests
		 flips to minimize deviation."
, abstract =	"Surfaces defined by linearly interpolating a
		 two-dimensional triangulation of a set of scattered
		 data points are frequently used to describe geometry in
		 computer applications. The linear nature of such
		 surfaces simplifies many subsequent operations on the
		 surface such as contouring and volume calculations.
		 However, if the data points defining the surface are
		 sparse, the resulting triangulated surface may be
		 unacceptably rough or irregular. An algorithm is
		 presented for smoothing a triangulated surface by
		 adding extra data points at special locations in the
		 interior of the triangulated region. The incremental
		 addition of the supplemental data points forces the
		 triangulated surface to approximate or converge to a
		 previously specified smooth surface that interpolates
		 the original data points. A unique feature of the
		 algorithm is that any smooth interpolation scheme or
		 surface can be used to smooth the triangulated surface.
		 The algorithm has been implemented on a microcomputer
		 and the results have been satisfactory. (Author
		 abstract) 21 Refs."
}

@article{j-rstsp-90
, author =	"P. Jones"
, title =	"Rectifiable sets and the {Traveling} {Salesman} {Problem}"
, journal =	"Invent. Math."
, volume =	102
, year =	1990
, pages =	"1--15"
, update =	"97.11 bibrelex"
}

@techreport{jemwdt-npgda-91
, author =	"S. Jones and P. Eades and A. Moran and N. Ward and G. Delott and R. Tamassia"
, title =	"A Note on Planar Graph Drawing Algorithms"
, number =	216
, institution =	"Department of Computer Science, University of Queensland"
, year =	1991
, keywords =	"graph drawing, experiments, planar, straight-line"
, update =	"96.09 tamassia, 93.09 tamassia"
}

@article{jo-nmctd-90
, author =	"S. Jones and J. O'Rourke"
, title =	"A note on moving a chair through a doorway"
, journal =	"Algorithms Rev."
, volume =	1
, number =	3
, year =	1990
, pages =	"139--149"
, note =	"S. Jones is now S. Dorward"
, keywords =	"motion planning, lower bounds"
}

@article{j-spivt1-80
, author =	"S. T. Jones"
, title =	"Solving Problems Involving Variable Terrain. Part {1}: {A} General Algorithm"
, journal =	"Byte"
, volume =	5
, number =	2
, month =	feb
, year =	1980
, pages =	"58--68"
, update =	"93.09 milone+mitchell"
}

@article{j-spivt2-80
, author =	"S. T. Jones"
, title =	"Solving Problems Involving Variable Terrain. Part {2}: {Special} Case"
, journal =	"Byte"
, volume =	5
, number =	3
, month =	mar
, year =	1980
, pages =	"74--82"
, update =	"93.09 milone+mitchell"
}

@misc{j-cgcb-
, author =	"W. D. Jones"
, title =	"Computational Geometry, a Community Bibliography"
, note =	"Overview at \url{http://compgeom.cs.duke.edu/~jeffe/compgeom/biblios.html#geombib}"
, url =	"ftp://ftp.cs.usask.ca/pub/geometry/geombib.tar.gz"
, keywords =	"bibliography"
, update =	"99.03 jones, 97.03 tamassia"
}

@inproceedings{jk-msssp-90
, author =	"W. D. Jones and Y. Ke"
, title =	"Maximal segment-stabbing of segments in the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"85--88"
, keywords =	"stabbing, line segments, two-dimensional, plane-sweep, configuration space"
, cites =	"ab-eact-87, ad-ahdsp-87, aw-alts-87, e-ftssg-85, e-ftssg-85, emprww-sls-82, epss-lebfi-87, ew-spdtl-89, gs-spscp-90, g-ct-58, g-scop-83, hdk-cgp-64, jk-spals-88, ls-esmpa-87, o-olafs-81, ss-pmp1c-83, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{h-zp-99m
, author =	"H{\aa}kan Jonsson"
, title =	"On the Zookeeper's Problem"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"141--144"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{js-csml-99
, author =	"Denis Jordan and Marcel Steiner"
, title =	"Configuration spaces of mechanical linkages"
, journal =	"Discrete Comput. Geom."
, volume =	22
, year =	1999
, pages =	"297--315"
, update =	"02.03 orourke"
}

@misc{j-icm-93
, author =	"H. F. Jordan"
, title =	"Interview to 'Computerworld' magazine"
, journal =	"Computerworld"
, month =	mar
, year =	1993
, pages =	28
, update =	"98.11 bibrelex"
}

@article{jhw-arn-86
, author =	"C. Jorgensen and W. Hamel and C. Weisbin"
, title =	"Autonomous Robot Navigation"
, journal =	"Byte"
, volume =	11
, number =	1
, month =	jan
, year =	1986
, pages =	"223--235"
, update =	"93.09 milone+mitchell"
}

@techreport{jmo-acrbv-94
, author =	"A. Josefczyk and J. Miller and J. O'Rourke"
, title =	"Arkin's conjecture for rectangle and box visibility graphs"
, type =	"Technical {Report}"
, number =	036
, institution =	"Dept. Comput. Sci., Smith College"
, month =	jul
, year =	1994
, keywords =	"visibility graphs"
, update =	"94.09 orourke"
}

@article{j-ptcme-83
, author =	"D. Joseph"
, title =	"Polynomial time computations in models of {ET}"
, journal =	"J. Comput. Syst. Sci."
, volume =	26
, year =	1983
, pages =	"311--338"
}

@inproceedings{jmt-ddssu-92
, author =	"D. Joseph and J. Meidanis and P. Tiwari"
, title =	"Determining {DNA} sequence similarity using maximum independent set algorithms for interval graphs"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"326--337"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{jp-crmpq-85
, author =	"D. A. Joseph and W. H. Plantinga"
, title =	"On the complexity of reachability and motion planning questions"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"62--66"
, cites =	"h-sp-68, lw-apcfp-79, r-cmpg-79, b-pcfmp-83, ss-pmp2g-83, hss-cmpmi-84, hjw-mra2d-85, hjw-mp2dl-84, k-racpc-72, ZZZ"
, update =	"97.11 bibrelex"
}

@article{js-mbpsc-92
, author =	"Eugene Joseph and Steven S. Skiena"
, title =	"Model-Based Probing Strategies for Convex Polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, year =	1992
, pages =	"209--221"
, keywords =	"probing, model-based, convex polygons"
, update =	"96.09 romanik"
}

@article{js-ck-91
, author =	"L. Joskowicz and E. Sacks"
, title =	"Computational Kinematics"
, journal =	"Artif. Intell."
, volume =	51
, number =	"1-3"
, year =	1991
, update =	"98.03 bibrelex"
}

@inproceedings{jss-kta-95
, author =	"L. Joskowicz and E. Sacks and V. Srinivasan"
, title =	"Kinematic tolerance analysis"
, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
, publisher =	"ACM Press"
, year =	1995
, update =	"98.03 bibrelex"
}

@inproceedings{js-himad-95
, author =	"Leo Joskowitz and Elisha Sacks"
, title =	"{HIPAIR}: {Interactive} Mechanism Analysis and Design Using Configuration Spaces"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"V5--V6"
, keywords =	"video review"
, cites =	"js-ck-91, sj-amksm-93, sj-cscmd-94, jss-kta-95, sj-ckahp-95, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{jkk-kssp-01
, author =	"Michael Joswig and Volker Kaibel and Friederike K{\"o}rner"
, title =	"On the $k$-Systems of a Simple Polytope"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"140--141"
, update =	"01.04 icking"
}

@inproceedings{jz-pvhc-01
, author =	"Michael Joswig and G{\"u}nter M. Ziegler"
, title =	"Polytope Verification by Homology Computation"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"142--145"
, update =	"01.04 icking"
}

@inproceedings{jdl-macrd-98
, author =	"A. Joukhadar and A. Deguet and C. Laugier"
, title =	"Models and Algorithms for the Collision of Rigid and Deformable Bodies"
, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
, nickname =	"WAFR '98"
, year =	1998
, pages =	"to appear"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{jrz-udpgu-95
, author =	"G.-V. Jourdan and I. Rival and N. Zaguia"
, title =	"Upward Drawing on the Plane Grid Using Less Ink"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"318--327"
, keywords =	"graph drawing, order, upward"
, update =	"95.01 tamassia"
}

@article{j-uphmm-91
, author =	"K. I. Joy"
, title =	"Utilizing parametric hyperpatch methods for modeling and display of free-form solids"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	4
, year =	1991
, pages =	"455--471"
, keywords =	"Bsplines, hypermatch models, free form surfaces, free form solids, sweeping operation"
}

@article{j-msndc-83
, author =	"A. J{\'o}{\'z}wik"
, title =	"A method for solving the $n$-dimensional convex hull problem"
, journal =	"Pattern Recogn. Lett."
, volume =	2
, year =	1983
, pages =	"23--25"
}

@article{j-rmils-83
, author =	"A. J{\'o}{\'z}wik"
, title =	"A recursive method for the investigation of the linear separability of two sets"
, journal =	"Pattern Recogn."
, volume =	11
, year =	1983
, pages =	"429--431"
}

@book{t-cseh-96
, title =	"The Computer Science and Engineering Handbook"
, editor =	"Allen B. Tucker, Jr."
, publisher =	"CRC Press"
, address =	"Boca Raton, FL"
, year =	1996
, isbn =	"0-8493-2909-4"
, comments =	"contains survey articles, 130 chapters, 2500 pages"
, update =	"98.07 bibrelex"
}

@inproceedings{j-mbfip-94
, author =	"Robert Juan-Arinyo"
, title =	"Monotone Boolean Formulae for Isothetic Polyhedra"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"58--61"
, update =	"00.11 smid, 00.07 icking"
}

@article{jvb-cprpv-96
, author =	"R. Juan-Arinyo and A. Vinacua and P. Brunet"
, title =	"Classification of a point with respect to a polyhedron vertex"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"157--168"
, update =	"96.09 devillers"
}

@article{js-niqpr-91
, author =	"E. Jucovic and S. Sevec"
, title =	"Note on inscribability of quadrangular polyhedra with restricted number of edge-types"
, journal =	"J. Geom."
, volume =	42
, number =	"1--2"
, year =	1991
, pages =	"126--131"
, update =	"98.11 bibrelex"
}

@techreport{j-levso-90
, author =	"F. Juhnke"
, title =	"{L{\"o}wner} ellipsoids via semiinfinite optimization and (quasi-) convexity theory"
, type =	"Report"
, number =	"4/90"
, institution =	"Sektion Mathematik, Technische Universit{\"a}t Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1990
, update =	"97.11 bibrelex"
}

@techreport{j-ccdt-88
, author =	"D. Jung"
, title =	"On Constructing the Constrained {Delaunay} Triangulation"
, type =	"report"
, number =	100
, institution =	"Electrical, Computer and Systems Engineering Department, Rensselaer Polytechnic Institute"
, year =	1988
, update =	"98.07 bibrelex"
}

@inproceedings{j-oacdt-88
, author =	"Dz-Mou Jung"
, title =	"An Optimal Algorithm for Constrained {Delaunay} Triangulation"
, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
, publisher =	"Univ. Illinois"
, address =	"Urbana, IL"
, year =	1988
, pages =	"85--86"
, annote =	"O(n log n) algorithm for CDT. First build DT, delete
		 edges intersected by constraint edges and then builds
		 CDT for the resulting simple polygons."
}

@article{j-udkkd-01
, author =	"H. Jung"
, title =	"{\"U}ber die kleinste {Kugel}, die eine r{\"a}umliche {Figur} einschlie{\ss}t"
, journal =	"J. Reine Angew. Math."
, volume =	123
, year =	1901
, pages =	"241--257"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@inproceedings{jlmo-pamlc-97
, author =	"Michael J{\"u}nger and Eva K. Lee and Petra Mutzel and Thomas Odenthal"
, title =	"A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, number =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"13--24"
, keywords =	"graph drawing"
, update =	"99.07 vismara, 98.11 bibrelex, 98.07 patrignani+tamassia+vismara"
}

@inproceedings{jlm-pupqt-97
, author =	"Michael J{\"u}nger and Sebastian Leipert and Petra Mutzel"
, title =	"Pitfalls of Using {PQ-Trees} in Automatic Graph Drawing"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"193--204"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{jm-2lscm-97
, author =	"Michael J{\"u}nger and Petra Mutzel"
, title =	"2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms"
, journal =	"J. Graph Algorithms Appl."
, volume =	1
, number =	1
, year =	1997
, pages =	"1--25"
, url =	"http://www.cs.brown.edu/publications/jgaa/accepted/97/JuengerMutzel97.1.1.ps.gz"
, keywords =	"graph drawing, straight-line, planarization, crossings, experiments"
, succeeds =	"jm-eha2s-96"
, update =	"99.07 vismara, 98.07 tamassia+vismara"
}

@inproceedings{jm-eha2s-96
, author =	"Michael J{\"u}nger and Petra Mutzel"
, title =	"Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"337--348"
, keywords =	"graph drawing, straight-line, layered, crossings, experiments"
, update =	"96.09 tamassia"
}

@article{jm-mpsne-96
, author =	"M. J{\"u}nger and P. Mutzel"
, title =	"Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools"
, journal =	"Algorithmica"
, volume =	16
, number =	1
, year =	1996
, pages =	"33--59"
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
, keywords =	"graph drawing, planarization"
, update =	"98.07 tamassia, 96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@inproceedings{jm-pamps-95
, author =	"M. J{\"u}nger and P. Mutzel"
, title =	"The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"119--130"
, keywords =	"graph drawing, planarization"
, update =	"95.01 tamassia"
}

@article{jp-gdco-93
, author =	"M. J{\"u}nger and W. Pulleyblank"
, title =	"Geometric duality and combinatorial optimization"
, journal =	"Jahrb. Ueberbl. Math"
, volume =	"??"
, year =	1993
, pages =	"1--24"
, update =	"98.03 agarwal"
}

@article{jp-npdmh-95
, author =	"M. J{\"u}nger and W. Pulleyblank"
, title =	"New primal and dual matching heuristics"
, journal =	"Algorithmica"
, volume =	13
, number =	4
, year =	1995
, pages =	"357--380"
, update =	"98.03 agarwal"
}

@incollection{jrr-tsp-95
, author =	"M. J{\"u}nger and G. Reinelt and G. Rinaldi"
, title =	"The Traveling Salesman Problem"
, editor =	"M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser"
, booktitle =	"Network Models"
, series =	"Handbook of Operations Research/Management Science"
, publisher =	"Elsevier Science"
, address =	"Amsterdam"
, year =	1995
, pages =	"225--330"
, update =	"98.03 mitchell"
}

@article{jrz-ccdt-91
, author =	"M. J{\"u}nger and G. Reinelt and D. Zepf"
, title =	"Computing Correct {Delaunay} Triangulations"
, journal =	"Computing"
, volume =	47
, number =	1
, year =	1991
, pages =	"43--49"
, keywords =	"Delaunay triangulation, computational geometry"
, update =	"93.09 rote"
, annote =	"For cc test need numbers up $6M^4$"
, abstract =	"In recent years the practical computation of Delaunay
		 triangulations, resp. Voronoi diagrams has received a
		 lot of attention in the literature. While the Delaunay
		 triangulation is an important basic tool in geometric
		 optimization algorithms, it is nontrivial to achieve a
		 numerically stable computer implementation. In this
		 technical note we assume that all generating points are
		 grid points of a regular M by M lattice in the plane.
		 Depending on M we derive the necessary word length a
		 binary computer must have for integer representation in
		 order to obtain exact Delaunay triangulations. This
		 analysis is carried out for the L//1-, L//2- and L//
		 infinity -metric. (Author abstract) 4 Refs."
}

@article{j-adsfk-78
, author =	"D. L. B. Jupp"
, title =	"Approximation to data by splines with free knots"
, journal =	"SIAM J. Numer. Anal."
, volume =	15
, number =	2
, year =	1978
, pages =	"328--343"
, update =	"96.09 orourke"
}

@techreport{jl-dhdpo-79
, author =	"H. Jurgensen and J. Loewer"
, title =	"Drawing Hasse Diagrams of Partially Ordered Sets"
, number =	"TI 5/79"
, institution =	"Institut fur Theoretische Informatik, Technische Hochschule Darmstad"
, year =	1979
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{kan-w1cps-90
, author =	"S. Kabadi and Y. P. Aneja and K. P. K. Nair"
, title =	"Weighted $1$-center problem in a simple polygon"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"306--308"
, cites =	"d-mstia-86, m-lpltw-84, m-bsb-89, psr-cgcsp-89, ZZZ"
, update =	"98.07 bibrelex"
}

@unpublished{kc-scgts-85
, author =	"S. N. Kabadi and R. Chandrasekaran"
, title =	"Solvable classes of generalized traveling salesman problem"
, year =	1985
, note =	"??"
, update =	"98.07 bibrelex"
}

@inproceedings{kc-ttsp-90
, author =	"S. N. Kabadi and R. Chandrasekaran"
, title =	"Tree traveling salesman problem"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"366--371"
, cites =	"gg-sosvm-64, k-sssgt-56, kc-scgts-85, llrs-tsp-85, ZZZ"
, update =	"98.07 bibrelex"
}

@book{k-sipan-59
, author =	"M. Kac"
, title =	"Statistical Independence in Probability , Analysis and Number Theory"
, series =	"The Carus Mathematical Monographs"
, volume =	12
, publisher =	"Mathematical Association of America"
, year =	1959
, update =	"97.11 bibrelex"
}

@article{k-c-47
, author =	"I. N. Kagno"
, title =	"Corrections"
, journal =	"Amer. J. Math."
, volume =	69
, year =	1947
, pages =	872
, update =	"97.11 bibrelex"
}

@article{k-dpgtg-47
, author =	"I. N. Kagno"
, title =	"Desargue's and Pappus' Graphs and their Groups"
, journal =	"Amer. J. Math."
, volume =	69
, year =	1947
, pages =	"859--862"
, update =	"97.11 bibrelex"
}

@article{k-lgdlt-46
, author =	"I. N. Kagno"
, title =	"Linear Graphs of Degree $\leq 6$ and their Groups"
, journal =	"Amer. J. Math."
, volume =	68
, year =	1946
, pages =	"505--520"
, update =	"97.11 bibrelex"
}

@inproceedings{k-mdm-91
, author =	"S. Kahan"
, title =	"A model for data in motion"
, booktitle =	"Proc. 23th Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"267--277"
, update =	"94.05 franciosa"
}

@phdthesis{k-rtpmd-91
, author =	"S. Kahan"
, title =	"Real time processing of moving data"
, type =	"Ph.{D}. Dissertation"
, school =	"University of Washington"
, address =	"Seattle, WA"
, year =	1991
, keywords =	"doctoral thesis"
, update =	"95.01 franciosa"
}

@inproceedings{ks-bcmlp-96
, author =	"Simon Kahan and Jack Snoeyink"
, title =	"On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear time"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"151--158"
, cites =	"abosy-fmcnp-89, ams-olpqs-92, c-tpca-82, d-haitn-83, dls-oaclc-92, g-cvpcs-91, gm-rad-95, ghms-apsml-93, hs-cmlpg-94, h-psifp-94, h-patmn-93, k-ealdp-89, lp-esppr-84, lpsssstwy-clcsp-88, m-cacau-89, m-dpggt-89, m-vigau-88p, m-pmsop-95, mrw-mlpop-92, ps-cgi-85, s-tfga-94, s-ltaml-86, s-mlppr-87, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{k-lmfp-87
, author =	"J. Kahn"
, title =	"On lattices with {M{\"o}bius} function $\pm1,0$"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"1--8"
, update =	"93.09 rote"
}

@article{kkk-tgrfw-83
, author =	"J. Kahn and M. M. Klawe and D. Kleitman"
, title =	"Traditional galleries require fewer watchmen"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	4
, year =	1983
, pages =	"194--206"
, update =	"96.09 agarwal, 94.05 devillers"
}

@techreport{kr-oadrp-90
, author =	"Andrew Kahng and Gabriel Robins"
, title =	"Optimal algorithms for determining regularity in pointsets"
, type =	"Technical Report"
, number =	"CSD-900045"
, institution =	"UCLA CS Department"
, year =	1990
, precedes =	"kr-oadrp-91"
, update =	"98.07 bibrelex"
}

@inproceedings{kr-oadrp-91
, author =	"Andrew Kahng and Gabriel Robins"
, title =	"Optimal algorithms for determining regularity in pointsets"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"167--170"
, succeeds =	"kr-oadrp-90"
, cites =	"bs-cht-90, dh-uhtdl-72, e-acg-87, eg-tsa-86, kr-oadrp-90, ps-cgi-85, r-trcad-89,"
, update =	"98.07 bibrelex"
}

@article{kr-ncist-92
, author =	"A. B. Kahng and G. Robins"
, title =	"A new class of iterative {Steiner} tree heuristics with good performance"
, journal =	"IEEE Trans. Comput. Aided Design"
, volume =	11
, year =	1992
, pages =	"893--902"
, update =	"98.03 bibrelex"
}

@misc{kt-rdgpm-89
, author =	"Y. Kajitani and H. Takahashi"
, title =	"Rectilinear Drawing of a Graph on a Plane with the Minimum Number of Segments"
, year =	1989
, note =	"presented at the 2nd Internat. Catania Combinatorial
                 Conf."
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{k-rtpp-82
, author =	"J. Kajiya"
, title =	"Ray tracing parametric patches"
, journal =	"Comput. Graph."
, volume =	16
, number =	3
, year =	1982
, pages =	"245--254"
, update =	"97.11 bibrelex"
}

@article{k-re-86
, author =	"J. T. Kajiya"
, title =	"The Rendering Equation"
, journal =	"Comput. Graph."
, volume =	20
, year =	1986
, pages =	"143--150"
, update =	"98.03 bibrelex"
}

@inproceedings{kt-alehd-97
, author =	"Konstantinos G. Kakoulis and Ioannis G. Tollis"
, title =	"An Algorithm for Labeling Edges of Hierarchical Drawings"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"169--180"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani+tamassia+vismara"
}

@article{kt-celpp-01
, author =	"K. G. Kakoulis and I. G. Tollis"
, title =	"On the complexity of the edge label placement problem"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"1--17"
, update =	"01.04 smid"
}

@inproceedings{k-srsa-92
, author =	"G. Kalai"
, title =	"A subexponential randomized simplex algorithm"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"475--482"
}

@article{k-ipcs-84
, author =	"G. Kalai"
, title =	"Intersection patterns of convex sets"
, journal =	"Israel J. Math."
, volume =	48
, year =	1984
, pages =	"161--174"
, update =	"97.11 bibrelex"
}

@article{k-mts-88
, author =	"G. Kalai"
, title =	"Many triangulated spheres"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"1--14"
}

@incollection{k-psp-97
, author =	"G. Kalai"
, title =	"Polytope skeletons and paths"
, chapter =	17
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"331--344"
, update =	"97.11 orourke"
}

@article{kk-qpbdg-92
, author =	"G. Kalai and D. J. Kleitman"
, title =	"A quasi-polynomial bound for the diameter of graphs of polyhedra"
, journal =	"Bull. Amer. Math. Soc."
, volume =	26
, year =	1992
, pages =	"315--316"
, update =	"97.03 gaertner+salinger"
}

@book{kz-pcc-00
, title =	"Polytopes -- Combinatorics and Computation"
, editor =	"G. Kalai and G. Ziegler"
, publisher =	"Birkh{\"a}user"
, year =	2000
, update =	"02.03 pocchiola"
}

@article{km-dsanp-83
, author =	"I. Kalantari and G. McDonald"
, title =	"A data structure and an algorithm for the nearest point problem"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-9"
, year =	1983
, pages =	"631--634"
}

@article{k-dscpg-82
, author =	"Y. E. Kalay"
, title =	"Determining the spatial containment of a point in general polyhedra"
, journal =	"Comput. Graph. Image Process."
, volume =	19
, year =	1982
, pages =	"303--330"
, update =	"98.11 bibrelex"
}

@book{k-moe-89
, author =	"Y. E. Kalay"
, title =	"Modeling Objects and Environments"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1989
, keywords =	"CAD, geometric primitives, solid modeling, computational geometry"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@techreport{k-vicgb-85
, author =	"Y. E. Kalay"
, title =	"Vertically integrated computational geometry based on the hybrid-edge data model"
, type =	"Report"
, number =	"??"
, institution =	"Comput.-Aided Design Graph. Lab., School Architect., State Univ. New York Buffalo"
, address =	"Buffalo, NY"
, year =	1985
}

@techreport{kr-nacap-84
, author =	"R. Kalin and N. Ramsey"
, title =	"A new analysis and comparison of algorithms for the planar segment intersection problem"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1984
}

@article{ks-dpbst-58
, author =	"G. K. Kalisch and E. G. Straus"
, title =	"On the Determination of Points in a {Banach} space by Their Distances from Points of a Given Set"
, journal =	"Acad. Brasil. Ci."
, volume =	29
, year =	1958
, pages =	"501--519"
, update =	"99.11 bibrelex"
}

@techreport{k-chahd-81
, author =	"M. Kallay"
, title =	"Convex Hull Algorithms in Higher Dimensions"
, type =	"Manuscript"
, institution =	"??"
, year =	1981
, update =	"97.11 bibrelex"
}

@article{k-chme-86
, author =	"M. Kallay"
, title =	"Convex hull made easy"
, journal =	"Inform. Process. Lett."
, volume =	22
, year =	1986
, pages =	161
}

@article{k-cicha-84
, author =	"M. Kallay"
, title =	"The complexity of incremental convex hull algorithms in {$R^{d}$}"
, journal =	"Inform. Process. Lett."
, volume =	19
, year =	1984
, pages =	197
}

@inproceedings{k-cirfc-89
, author =	"E. Kaltofen"
, title =	"Computing the irreducible real factors and components of an algebraic curve"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"79--87"
, cites =	"acm-cad1b-84, c-qercf-75, ch-mrsp-74, c-sagcp-88, cg-stssa-83, j-ba1-74, k-ptrmb-85, k-fpait-85, k-ditpo-87, l-eaac-81, m-idp-64, r-fpade-88, s-ftatc-82, s-ndmea-54, t-iaf-84, w-ma-53, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@article{k-ditpo-87
, author =	"E. Kaltofen"
, title =	"Deterministic irreducibility testing of polynomials over large finite fields"
, journal =	"J. Symbolic Comput."
, volume =	4
, year =	1987
, pages =	"77--82"
, update =	"98.03 bibrelex"
}

@article{k-fpait-85
, author =	"E. Kaltofen"
, title =	"Fast parallel absolute irreducibility testing"
, journal =	"J. Symbolic Computation 1"
, volume =	"??"
, year =	1985
, pages =	"57--67"
, update =	"98.03 bibrelex"
}

@article{k-ptrmb-85
, author =	"E. Kaltofen"
, title =	"Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"469--489"
, update =	"98.03 bibrelex"
}

@article{ksss-tdmbb-86
, author =	"A. Kalvin and E. Schonberg and J. T. Schwartz and Micha Sharir"
, title =	"Two dimensional model based boundary matching using footprints"
, journal =	"Internat. J. Robot. Res."
, volume =	5
, number =	4
, year =	1986
, pages =	"38--55"
, keywords =	"computer vision, curves, matchings, two-dimensional"
, update =	"98.03 mitchell"
}

@article{kt-spmsb-96
, author =	"A. D. Kalvin and R. H. Taylor"
, title =	"Superfaces: Polygonal Mesh Simplification with Bounded Error"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	16
, number =	3
, month =	may
, year =	1996
, pages =	"64--77"
, update =	"96.09 held"
}

@article{kp-caasu-93
, author =	"B. Kalyanasundaram and K. Pruhs"
, title =	"A competitive analysis of algorithms for searching unknown scenes"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"139--155"
, succeeds =	"kp-cannb-92"
, update =	"96.09 devillers"
}

@inproceedings{kp-cannb-92
, author =	"B. Kalyanasundaram and K. Pruhs"
, title =	"A competitive analysis of nearest neighbor based algorithms for searching unknown scenes"
, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	577
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"147--157"
, precedes =	"kp-caasu-93"
, update =	"96.09 devillers"
}

@article{kp-cctli-94
, author =	"B. Kalyanasundaram and K. Pruhs"
, title =	"Constructing Competitive Tours from Local Information"
, journal =	"Theoret. Comput. Sci."
, volume =	130
, year =	1994
, pages =	"125--138"
, keywords =	"mapping an unknown environment, limited distance visibility, on-line d-sweeper problem, watchman route, competitive analysis, shortest paths, on-line navigation"
, update =	"98.03 mitchell"
, annote =	"Originally appeared in ICALP 1993."
}

@incollection{kp-onop-98
, author =	"Bala Kalyanasundaram and Kirk Pruhs"
, title =	"Online Network Optimization Problems"
, editor =	"Amos Fiat and Gerhard Woeginger"
, booktitle =	"Online Algorithms: The State of the Art"
, series =	"Lecture Notes Comput. Sci."
, volume =	1442
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"268--280"
, comments =	"chapter 8 of fw-ola-98"
, update =	"02.03 icking, 98.07 bibrelex, 98.03 mitchell"
}

@phdthesis{k-vaor-88
, author =	"T. Kamada"
, title =	"On Visualization of Abstract Objects and Relations"
, school =	"Department of Information Science, University of Tokyo"
, year =	1988
, keywords =	"doctoral thesis, graph drawing"
, update =	"93.09 tamassia"
}

@techreport{k-sgdsa-89
, author =	"T. Kamada"
, title =	"Symmetric Graph Drawing by a Spring Algorithm and its Applications to Radial Drawing"
, institution =	"Department of Information Science, University of Tokyo"
, year =	1989
, keywords =	"graph drawing"
, update =	"98.07 tamassia, 93.09 tamassia"
}

%  is this a book
@book{k-vaor-89
, author =	"T. Kamada"
, title =	"Visualizing Abstract Objects and Relations"
, publisher =	"World Scientific Series in Computer Science"
, year =	1989
, keywords =	"graph drawing"
, update =	"94.05 devillers, 93.09 tamassia"
}

@article{kk-athl-87
, author =	"T. Kamada and S. Kawai"
, title =	"An advanced treatment of hidden lines"
, journal =	"ACM Trans. Graph."
, volume =	6
, year =	1987
, pages =	"308--323"
}

@article{kk-adgug-89
, author =	"T. Kamada and S. Kawai"
, title =	"An Algorithm for Drawing General Undirected Graphs"
, journal =	"Inform. Process. Lett."
, volume =	31
, year =	1989
, pages =	"7--15"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{kk-adnsh-88
, author =	"T. Kamada and S. Kawai"
, title =	"Automatic Display of Network Structures for Human Understanding"
, number =	"88-007"
, institution =	"Department of Information Science, University of Tokyo"
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{kd-mppmr-86
, author =	"S. Kambhampati and L. S. Davis"
, title =	"Multiresolution Path Planning for Mobile Robots"
, journal =	"Internat. J. Robot. Autom."
, volume =	"RA-2"
, number =	3
, month =	sep
, year =	1986
, pages =	"135--145"
, keywords =	"quadtree, shortest paths"
}

@article{k-vrrpd-75
, author =	"T. Kameda"
, title =	"On the vector representation of the reachability in planar directed graphs"
, journal =	"Inform. Process. Lett."
, volume =	3
, number =	3
, year =	1975
, pages =	"75--77"
, update =	"98.03 bibrelex"
}

@inproceedings{kf-hrtir-94
, author =	"I. Kamel and C. Faloutsos"
, title =	"Hilbert {R}-tree: {A}n improved {R}-tree using fractals"
, booktitle =	"Proc. 20th VLDB Conference"
, year =	1994
, pages =	"500--510"
, update =	"97.07 agarwal"
}

@inproceedings{kf-prt-93
, author =	"I. Kamel and C. Faloutsos"
, title =	"On packing {R}-trees"
, booktitle =	"Proc. 2nd Internat. Conf. on Information and Knowledge Management"
, year =	1993
, pages =	"490--499"
, update =	"97.07 agarwal"
}

@inproceedings{kf-prt-92
, author =	"I. Kamel and C. Faloutsos"
, title =	"Parallel {R}-trees"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1992
, pages =	"195--204"
, update =	"97.07 agarwal"
}

@book{k-dv1-83
, author =	"E. Kamke"
, title =	"Differentialgleichungen, Volume I"
, publisher =	"B. G. Teubner"
, address =	"Stuttgart"
, year =	1983
, update =	"98.11 bibrelex"
}

@article{k-amrts-84
, author =	"K. Kammerlander"
, title =	"C 900 - An Advanced Mobile Radio Telephone System with Optimum Frequency Utilization"
, journal =	"IEEE Trans. Selected Areas in Communication"
, volume =	2
, year =	1984
, pages =	"589--597"
, update =	"98.07 bibrelex"
}

@article{k-ker-32
, author =	"R. E. van Kampen"
, title =	"Komplexe in euklidischen {R\"aumen}"
, journal =	"Abh. Math. Sem. Hamburg"
, volume =	9
, year =	1932
, pages =	"72--78"
, note =	"Berightigung dazu, {\em ibid.} (1932) 152--153"
, update =	"95.01 matousek"
}

@article{k-tow-80
, author =	"T. Kanade"
, title =	"A theory of origami world"
, journal =	"Artif. Intell."
, volume =	13
, year =	1980
, pages =	"279--311"
, update =	"97.11 bibrelex"
}

@article{kg-cfpaa-91
, author =	"S. Kanaganathan and N. B. Goldstein"
, title =	"Comparison Of Four-Point Adding Algorithms For Delaunay-Type Three Dimensional Mesh Generators"
, journal =	"IEEE Trans. Magn."
, volume =	27
, number =	3
, month =	may
, year =	1991
, pages =	"3444--3451"
, keywords =	"three-dimensional tetrahedral meshes, Delaunay triangulation, Dirichlet tessellation, pascal primitives, point adding algorithms"
, annote =	"Does not understand what DT is! Three of the
		 algorithms do not give DT (and give bad meshes.)"
, abstract =	"Four different approaches to generating
		 three-dimensional tetrahedral meshes were tested and
		 compared in regard to the complexity and quality of the
		 elements they produce as points are added into the
		 existing coarse meshes. Points are added according to
		 Delaunay triangulation. It was found that there is a
		 marked difference between the different approaches and
		 that the method suggested by D. F. Watson (1981) is the
		 better one in terms of quality of the meshes generated,
		 although its time complexity is a little higher than
		 that of the other methods. 8 Refs."
}

@inproceedings{kna-eegpp-92
, author =	"N. Kanamaru and T. Nishizeki and T. Asano"
, title =	"Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming"
, booktitle =	"Integer Programming and Combinatorial Optimization"
, year =	1992
, pages =	"??"
, precedes =	"kna-eegpp-94"
, update =	"96.09 devillers, 93.09 milone+mitchell"
}

@article{kna-eegpp-94
, author =	"N. Kanamaru and T. Nishizeki and T. Asano"
, title =	"Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"69--85"
, keywords =	"convex polygon, grid point enumeration, integer programming, polygon filling"
, succeeds =	"kna-eegpp-92"
, update =	"96.09 devillers"
}

@book{k-gcmv-93
, author =	"K. Kanatani"
, title =	"Geometric Computation for Machine Vision"
, publisher =	"Clarendon Press"
, address =	"Oxford"
, year =	1993
, update =	"98.07 orourke"
}

@techreport{kd-mtspp-??
, author =	"Y. Kanayama and G. R. DeHaan"
, title =	"A Mathematical Theory of Safe Path Planning"
, type =	"Technical {Report}"
, institution =	"Department of Computer Science, University of California, Santa Barbara"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{k-bpppt-97
, author =	"Atsushi Kaneko"
, title =	"A Balanced Partition of Points in the Plane and Tree Embedding Problems"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"56--58"
, update =	"97.11 jones"
}

@book{kp-td-86
, title =	"The Theory of Databases"
, editor =	"Paris C. Kanellakis and Franco P. Preparata"
, series =	"Adv. Comput. Res."
, volume =	3
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1986
, update =	"01.04 icking"
}

@inproceedings{krvv-idmcc-93
, author =	"P. C. Kanellakis and S. Ramaswamy and D. E. Vengroff and J. S. Vitter"
, title =	"Indexing for data models with constraints and classes"
, booktitle =	"Proc. 12th ACM SIGACT-SIGMOD-SIGART Conf. Princ. Database Sys."
, year =	1993
, pages =	"233--243"
, update =	"93.09 vengroff"
}

@inproceedings{ko-ichspa-00
, author =	"Biliana Kaneva and J. O'Rourke"
, title =	"An Implementation of {Chen \& Han's} Shortest Paths Algorithm"
, booktitle =	"Proc. 12th Canad. Conf. Comput. Geom."
, site =	"New Brunswick"
, month =	aug
, year =	2000
, pages =	"139--146"
, url =	"http://cs.smith.edu/~orourke/ShortestPaths/"
, keywords =	"shortest paths"
, update =	"02.03 icking, 01.11 orourke, 01.04 icking+orourke, 00.11 smid, 00.07 orourke"
}

@article{k-csptg-90
, author =	"A. Kanevsky"
, title =	"A Characterization of Separating Pairs and Triplets in a Graph"
, journal =	"Congr. Numer."
, volume =	74
, year =	1990
, pages =	"213--232"
, update =	"94.01 tamassia"
}

@inproceedings{ktdc-olmfc-91
, author =	"A. Kanevsky and R. Tamassia and G. {Di Battista} and J. Chen"
, title =	"On-line Maintenance of the Four-Connected Components of a Graph"
, booktitle =	"Proc. Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"793--801"
, update =	"94.05 tamassia"
}

@article{k-ccchf-85
, author =	"B. S. Kang"
, title =	"Computer construction of the convex hull of a finite set of points in space ({Chinese} {English} summary)"
, journal =	"J. Northwest Univ."
, volume =	15
, year =	1985
, pages =	"17--23"
}

@inproceedings{kg-srrg-92
, author =	"D. Kang and K. Y. Goldberg"
, title =	"Shape recognition by random grasping"
, booktitle =	"Proc. IEEE Internat. Conf. Intell. Robots Syst."
, month =	jul
, year =	1992
, update =	"98.07 bibrelex"
}

@article{kg-sprg-95
, author =	"Dukhyun Kang and Kenneth Y. Goldberg"
, title =	"Sorting Parts by Random Grasping"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	11
, number =	1
, month =	feb
, year =	1995
, pages =	"146--152"
, keywords =	"probing, diameter probes, parallel-jaw gripper, random grasping"
, update =	"96.09 romanik"
}

@phdthesis{k-tpgc-90
, author =	"Mohan Kankanhalli"
, title =	"Techniques for Parallel Geometric Computations"
, school =	"Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
, month =	oct
, year =	1990
, keywords =	"doctoral thesis, area, parallel computation, grids"
, update =	"93.09 franklin"
}

@techreport{kf-apcus-92
, author =	"Mohan Kankanhalli and Wm. Randolph Franklin"
, title =	"Area and Perimeter Computation of the Union of a Set of Iso-Rectangles in Parallel"
, type =	"Technical {Report}"
, number =	"TR92-81-0"
, institution =	"Institute Of Systems Science, National University of Singapore"
, address =	"Kent Ridge, Singapore 0511"
, year =	1992
, keywords =	"intersection, parallel computation, grids, area"
, update =	"93.09 franklin"
}

@techreport{k-cgrw-93
, author =	"Ravi Kannan"
, title =	"Convergence of a geometric random walk"
, institution =	"Princeton University"
, month =	feb
, year =	1993
, comments =	"DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
, update =	"93.09 milone+mitchell"
}

@inproceedings{k-iaipr-83
, author =	"R. Kannan"
, title =	"Improved algorithms for integer programming and related lattice problems"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
, year =	1983
, pages =	"193--206"
, precedes =	"k-mcbti-87"
}

@article{k-mcbti-87
, author =	"R. Kannan"
, title =	"Minkowski's convex body theorem and integer programming"
, journal =	"Math. Oper. Res."
, volume =	12
, year =	1987
, pages =	"415--440"
, succeeds =	"k-iaipr-83"
}

@techreport{k-rwcs-92
, author =	"R. Kannan"
, title =	"Random Walks in Convex Sets"
, type =	"Manuscript"
, institution =	"Indian Institute of Technology"
, address =	"New Delhi"
, year =	1992
, note =	"Presented at Workshop on Approximation Algorithms"
, update =	"93.09 milone+mitchell"
}

@article{kb-ptacs-79
, author =	"R. Kannan and A. Bachem"
, title =	"Polynomial time algorithms for computing the {Smith} and {Hermite} normal forms of an integer matrix"
, journal =	"SIAM J. Comput."
, volume =	8
, year =	1979
, pages =	"499--507"
, update =	"97.11 bibrelex"
}

@inproceedings{knr-irg-88
, author =	"S. Kannan and M. Naor and S. Rudich"
, title =	"Implicit representation of graphs"
, booktitle =	"Proc. 20th ACM Sympoos. Theory. Comput."
, year =	1988
, pages =	"334--343"
, update =	"98.11 bibrelex"
}

@article{ks-tpp-92
, author =	"S. Kannan and D. Soroker"
, title =	"Tiling polygons with parallelograms"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"175--188"
}

@incollection{km-alnor-93
, author =	"Sampath K. Kannan and Eugene W. Myers"
, title =	"An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score"
, booktitle =	"Combinatorial Pattern Matching"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, institution =	"University of Arizona, USA"
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{k-sletm-97
, author =	"M. Kano"
, title =	"A Straight-Line Embedding of Two or More Rooted Trees in the Plane"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"50--55"
, update =	"97.11 jones"
}

@inproceedings{k-mcvr-93
, author =	"G. Kant"
, title =	"A More Compact Visibility Representation"
, editor =	"J. van Leeuwen"
, booktitle =	"Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '93"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1993
, precedes =	"k-mcvr-97"
, update =	"98.11 bibrelex, 98.07 bibrelex, 97.07 devillers, 94.01 tamassia, 93.09 milone+mitchell"
}

@article{k-mcvr-97
, author =	"G. Kant"
, title =	"A More Compact Visibility Representation"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"197--210"
, succeeds =	"k-mcvr-93"
, update =	"98.07 tamassia, 97.07 devillers"
, annote =	"$\lfloor 3/2 n \rfloor - 3) \times (n-1)$"
}

% ### same pages as k-dpgul-92
@inproceedings{k-mpgdg-92
, author =	"G. Kant"
, title =	"A New Method for Planar Graph Drawings on a Grid"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"101--110"
, update =	"99.03 forrest, 98.11 bibrelex"
}

@phdthesis{k-adpg-93
, author =	"G. Kant"
, title =	"Algorithms for Drawing Planar Graphs"
, school =	"Dept. Comput. Sci., Univ. Utrecht"
, address =	"Utrecht, Netherlands"
, year =	1993
, keywords =	"doctoral thesis, graph drawing"
, update =	"94.05 tamassia"
}

@techreport{k-ompab-92
, author =	"G. Kant"
, title =	"An ${O}(n^2)$ Maximal Planarization Algorithm based on {PQ}-trees"
, number =	"RUU-CS-92-03"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1992
, keywords =	"graph drawing"
, update =	"94.05 schwarzkopf, 93.09 tamassia"
}

@article{k-dpguc-96
, author =	"G. Kant"
, title =	"Drawing Planar Graphs Using the Canonical Ordering"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"4--32"
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
, keywords =	"graph drawing, planar, orthogonal, straight-line, polyline, convex, angular resolution"
, succeeds =	"k-dpgul-92"
, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@inproceedings{k-dpgul-92
, author =	"G. Kant"
, title =	"Drawing Planar Graphs Using the {\it{}lmc}-Ordering"
, booktitle =	"Proc. 33th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"101--110"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{k-hgd-92t
, author =	"G. Kant"
, title =	"Hexagonal Grid Drawings"
, number =	"RUU-CS-92-06"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1992
, keywords =	"graph drawing"
, update =	"94.05 schwarzkopf, 93.09 milone+mitchell+tamassia"
}

@inproceedings{k-hgd-92i
, author =	"Goos Kant"
, title =	"Hexagonal grid drawings"
, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, year =	1992
, update =	"98.07 tamassia, 93.09 milone+mitchell"
}

@inproceedings{kb-pgap-92
, author =	"G. Kant and H. L. Bodlaender"
, title =	"Planar Graph Augmentation Problems"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"286--298"
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@inproceedings{kb-tpgwm-92
, author =	"G. Kant and H. L. Bodlaender"
, title =	"Triangulating planar graphs while minimizing the maximum degree"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"258--271"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{kh-rdvr-93
, author =	"Goos Kant and Xin He"
, title =	"Rectangular Duals and Visibility Representations"
, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
, month =	jun
, year =	1993
, pages =	"??"
, comments =	"does it exist?"
, update =	"94.09 franciosa, 93.09 milone+mitchell"
}

@inproceedings{kh-tafrd-93
, author =	"Goos Kant and Xin He"
, title =	"Two Algorithms for Finding Rectangular Duals of Planar Graphs"
, booktitle =	"Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	790
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"396--410"
, update =	"98.07 bibrelex+vismara, 95.01 schwarzkopf, 94.09 franciosa, 93.09 milone+mitchell"
}

@inproceedings{kltt-arvrt-93
, author =	"G. Kant and G. Liotta and R. Tamassia and I. Tollis"
, title =	"Area requirement of visibility representations of trees"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"192--197"
, cites =	"a-srvg-89, k-mcvr-93, o-cgc18-93, rt-rplbo-86, tt-uavrp-86, kw-wvgbr-89, w-brvgr-89, cdp-noaau-92, dett-adgab-93, dtt-cvrg-92, dtt-arsdp-92, ZZZ"
, update =	"98.11 bibrelex, 94.05 tamassia, 93.09 milone+mitchell"
}

@article{kltt-arvrt-97
, author =	"G. Kant and G. Liotta and R. Tamassia and I. G. Tollis"
, title =	"Area Requirement of Visibility Representations of Trees"
, journal =	"Inform. Process. Lett."
, volume =	62
, number =	2
, year =	1997
, pages =	"81--88"
, url =	"http://www.cs.brown.edu/cgc/papers/kltt-arvrt-97.ps.gz"
, keywords =	"graph drawing, visibility, tree, CGC, Brown"
, update =	"98.11 tamassia, 97.03 tamassia"
}

@techreport{kltt-vrt-96
, author =	"G. Kant and G. Liotta and R. Tamassia and I. G. Tollis"
, title =	"Visibility Representations of Trees"
, type =	"Technical Report"
, number =	"CS-96-23"
, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-23.ps.Z"
, keywords =	"graph drawing, visibility, tree, CGC, Brown"
, update =	"97.03 tamassia"
}

@article{k-fibrp-85
, author =	"K. Kant"
, title =	"Finding interferences between rectangular paths"
, journal =	"IEEE Trans. Comput."
, volume =	34
, number =	11
, year =	1985
, pages =	"1045--1049"
, update =	"94.01 tuan"
}

@article{kz-tetpp-86
, author =	"K. Kant and S. Zucker"
, title =	"Toward efficient trajectory planning: {The} path-velocity decomposition"
, journal =	"Internat. J. Robot. Res."
, volume =	5
, number =	3
, year =	1986
, pages =	"72--89"
, update =	"98.03 bibrelex"
}

@article{kz-pcftt-88
, author =	"Kamal Kant and Steven W. Zucker"
, title =	"Planning collision-free trajectories in time-varying environments: a two-level hierarchy"
, journal =	"Visual Comput."
, volume =	3
, number =	5
, month =	mar
, year =	1988
, pages =	"304--313"
, keywords =	"robotics, trajectory planning, path planning, obstacle avoidance, velocity planning"
}

@article{k-mslra-92
, author =	"V. Kantabutra"
, title =	"Motions of a short-linked robot arm in a square"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"69--76"
}

@article{k-rpura-97
, author =	"V. Kantabutra"
, title =	"Reaching a Point with an Unanchored Robot Arm in a Square"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"539--550"
, update =	"98.11 devillers+orourke"
}

@article{k-tscan-83
, author =	"V. Kantabutra"
, title =	"Traveling salesman cycles are not always subgraphs of {Voronoi} duals"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, pages =	"11--12"
}

@inproceedings{kk-aram-84
, author =	"V. Kantabutra and S. R. Kosaraju"
, title =	"Algorithms for robot arm movements"
, booktitle =	"Proc. Conf. Inform. Sci. \& Sys."
, site =	"Princeton, NJ"
, year =	1984
, pages =	"??"
}

@article{kk-namra-86
, author =	"V. Kantabutra and S. R. Kosaraju"
, title =	"New algorithms for multilink robot arms"
, journal =	"J. Comput. Syst. Sci."
, volume =	32
, month =	feb
, year =	1986
, pages =	"136--153"
, update =	"98.07 bibrelex"
}

@inproceedings{kmnpsw-askmc-00
, author =	"Tapas Kanungo and David M. Mount and Nathan S. Netanyahu and Christine Piatko and Ruth Silverman and Angela Y. Wu"
, title =	"The Analysis of a Simple $k$-Means Clustering Algorithm"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"100--109"
, update =	"00.11 jones"
}

@article{kfhr-opasl-94
, author =	"M.-Y. Kao and M. F{\"u}rer and X. He and B. Raghavachari"
, title =	"Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs"
, journal =	"SIAM J. Discrete Math."
, volume =	7
, number =	4
, year =	1994
, pages =	"632--646"
, keywords =	"graph drawing, planar, straight-line, grid, parallel"
, update =	"98.11 vismara, 98.07 tamassia+vismara, 96.09 tamassia, 93.09 tamassia"
}

% also claimed pages =	"441--448"
@inproceedings{krt-sueor-93
, author =	"M.-Y. Kao and J. H. Reif and S. R. Tate"
, title =	"Searching in an Unknown Environment: {An} Optimal Randomized Algorithm for the Cow-Path Problem"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"441--447"
, precedes =	"krt-sueor-96"
, update =	"98.03 mitchell, 93.09 milone+mitchell, 93.05 smid"
}

@article{krt-sueor-96
, author =	"M.-Y. Kao and J. H. Reif and S. R. Tate"
, title =	"Searching in an Unknown Environment: {An} Optimal Randomized Algorithm for the Cow-Path Problem"
, journal =	"Inform. Comput."
, volume =	133
, number =	1
, year =	1996
, pages =	"63--79"
, succeeds =	"krt-sueor-93"
, update =	"99.07 bibrelex, 98.03 mitchell"
}

@inproceedings{ks-lrgop-89
, author =	"M.-Y. Kao and G. E. Shannon"
, title =	"Local Reorientations, Global Order, and Planar Topology"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"286--296"
, update =	"95.01 tamassia"
}

@inproceedings{kms-dmdt-91
, author =	"Thomas Kao and David Mount and Alan Saalfeld"
, title =	"Dynamic Maintenance of {Delaunay} Triangulations"
, booktitle =	"Proc. 10th Internat. Sympos. Comput.-Assist. Cartog."
, series =	"Technical Papers 1991 ACSM-ASPRS Annual Convention"
, volume =	6
, year =	1991
, pages =	"219--233"
, update =	"93.05 freimer"
, annote =	"Incremental insertion and deletion of points based on
		 \cite{gks-ricdv-90}. Earlier versions of the
		 triangulation can be recovered. In a sequence of
		 deletions and insertions, periodic rebalancing of the
		 history graph is required. Implemented."
}

@inproceedings{kk-cpcfv-90
, author =	"T. C. Kao and G. D. Knott"
, title =	"Computing polygonal chords and the farthest visibility polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"332--336"
, cites =	"as-cldsp-89, bkt-dsvp-89, cs-agpli-88, cg-vippg-89, dls-rphs-88, ea-lacvp-81, g-cvpcs-86, ghlst-ltavs-86, l-vsp-83, ll-cvpe-86, ps-cgi-85, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{km-accvd-91
, author =	"T. C. Kao and D. M. Mount"
, title =	"An algorithm for computing compacted {Voronoi} diagrams defined by convex distance functions"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"104--109"
, cites =	"cd-vdbcd-85, eghsssw-irals-89, f-fapct-85, gs-ccrs-87, k-eccs-79, l-csa-72, ls-pptmc-87, lw-vdllm-80, ps-cgi-85, y-oavds-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{km-icdmc-92
, author =	"T. C. Kao and D. M. Mount"
, title =	"Incremental construction and dynamic maintenance of constrained {Delaunay} triangulations"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"170--175"
, cites =	"agss-ltacv-89, b-amgct-89, beg-pgmg-90, c-tpca-82, c-tsplt-90i, c-cdt-89, dp-olacd-91, g-eadch-72, gs-pmgsc-85, l-vsp-83, ll-gdtpg-86, ls-tacdt-80, s-let-78, sp-htucc-92, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{k-agnta-97
, author =	"Sanjiv Kapoor"
, title =	"Approximate Geographic Neighbor Tree with Applications"
, type =	"Manuscript"
, institution =	"IIT, New Delhi"
, year =	1997
, update =	"98.07 mitchell"
}

@techreport{k-dm2dc-95
, author =	"S. Kapoor"
, title =	"Dynamic maintenance of 2-d convex hulls and order decomposable problems"
, number =	"MPI-I-95-1-015"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1995
, update =	"95.09 smid"
}

@article{k-dmm2d-00
, author =	"S. Kapoor"
, title =	"Dynamic maintenance of maxima of $2$-d point sets"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"1858--1877"
, update =	"01.04 smid"
}

@inproceedings{k-dmm2d-94
, author =	"S. Kapoor"
, title =	"Dynamic Maintenance of Maximas of $2$-d Point Sets"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"140--149"
, cites =	"ps-cgi-85, fr-nadmm-90, hs-ompc-91, j-dmmpp-91, klp-fmsv-75, ol-mcp-81, t-ubstr-83, wl-arrcd-85, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@inproceedings{k-ecgsp-99
, author =	"S. Kapoor"
, title =	"Efficient computation of geodesic shortest paths"
, booktitle =	"Proc. 32nd Annu. ACM Sympos. Theory Comput."
, year =	1999
, pages =	"??--??"
, note =	"To appear"
, update =	"99.07 orourke"
}

@techreport{k-tdaca-86
, author =	"S. Kapoor"
, title =	"Topics in the design and analysis of combinatorial algorithms"
, type =	"Report"
, number =	"86-1297"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1986
, keywords =	"NP-completeness, data structuring"
}

@techreport{km-eaesp-94
, author =	"S. Kapoor and S. N. Maheshwari"
, title =	"An efficient algorithm for {Euclidean} shortest path with polygonal obstacles"
, type =	"Technical {Report}"
, institution =	"IIT, New Delhi"
, year =	1994
, precedes =	"kmm-eaesp-97"
, update =	"98.03 mitchell, 96.05 mitchell"
, annote =	"Gives an $O(n+ h^2\log n)$ algorithm for shortest paths"
}

@inproceedings{km-eaesp-88
, author =	"S. Kapoor and S. N. Maheshwari"
, title =	"Efficient algorithms for {Euclidean} shortest path and visibility problems with polygonal obstacles"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"172--182"
, precedes =	"kmm-eaesp-97"
, cites =	"gh-ospqs-87, gm-osacv-87, h-fvgsp-87, lp-esppr-84, rs-spesp-85, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{kmm-eaesp-97
, author =	"S. Kapoor and S. N. Maheshwari and Joseph S. B. Mitchell"
, title =	"An Efficient Algorithm for {Euclidean} Shortest Paths among Polygonal Obstacles in the Plane"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"377--383"
, succeeds =	"m-esppo-94, km-eaesp-94"
, update =	"98.03 mitchell"
, annote =	"Gives an $O(n+ h^2\log n)$ algorithm for shortest paths"
}

@article{kr-lbmcl-89
, author =	"S. Kapoor and P. Ramanan"
, title =	"Lower bounds for maximal and convex layers problems"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"447--459"
, keywords =	"maxima, maximal depth, convex hull, convex depth, two-dimensional"
, annote =	"$\Omega(n \log n)$"
}

@incollection{ks-dmspt-96
, author =	"S. Kapoor and T. Singh"
, title =	"Dynamic maintenance of shortest path trees in simple polygons"
, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1180
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"123--134"
, update =	"97.03 smid"
}

@techreport{ks-ntead-93
, author =	"S. Kapoor and M. Smid"
, title =	"New techniques for exact and approximate dynamic closest-point problems"
, number =	"MPI-I-93-159"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, succeeds =	"ks-ntead-"
, update =	"98.11 bibrelex, 94.01 smid"
}

@inproceedings{ks-ntead-94
, author =	"S. Kapoor and M. Smid"
, title =	"New Techniques for Exact and Approximate Dynamic Closest-Point Problems"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"165--174"
, cites =	"am-annqf-93, amnsw-oaann-94, c-racpq-88, ehh-rpldd-86, grss-rdsdc-93i, mn-dfc-90, ps-cgi-85, s-eis-92, s-dsadc-93, sss-oaolc-92, s-rpldc-91, s-mmdpsp-92a, s-ntsdc-90, v-oaann-89, y-cmstk-82, ZZZ"
, update =	"98.03 bibrelex, 94.09 smid, 94.01 jones"
}

@article{ks-ntead-96
, author =	"S. Kapoor and M. Smid"
, title =	"New techniques for exact and approximate dynamic closest-point problems"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"775--796"
, update =	"97.03 smid"
}

@techreport{ks-ntead-
, author =	"S. Kapoor and M. Smid"
, title =	"New Techniques for Exact and Approximate Dynamic Closest-PointProblems"
, type =	"manuscript"
, precedes =	"ks-ntead-93"
, update =	"98.11 bibrelex"
}

@inproceedings{kv-facqp-86
, author =	"S. Kapoor and P. M. Vaidya"
, title =	"Fast algorithms for convex quadratic programming and multicommodity flows"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"147--159"
, comments =	"Submitted to Math. Program."
}

@article{km-mspep-95
, author =	"M. Kapovich and J. Millson"
, title =	"On the moduli spaces of polygons in the {Euclidean} plane"
, journal =	"J. Differential Geom."
, volume =	42
, number =	1
, year =	1995
, pages =	"133--164"
, url =	"http://www.math.utah.edu/~kapovich/eprints.html"
, update =	"02.03 orourke"
}

@incollection{k-ragtp-89
, author =	"D. Kapur"
, title =	"A refutational approach to geometry theorem proving"
, editor =	"D. Kapur and J. L. Mundy"
, booktitle =	"Geometric Reasoning"
, publisher =	"MIT Press"
, year =	1989
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{k-gtpuh-86
, author =	"D. Kapur"
, title =	"Geometry theorem proving using {Hilbert}'s {Nullstellensatz}"
, booktitle =	"Proc. ACM Sympos. Symbolic and Algebraic Computation"
, site =	"Waterloo, Canada"
, year =	1986
, pages =	"202--208"
, update =	"98.03 bibrelex"
}

@book{km-gr-89
, title =	"Geometric Reasoning"
, editor =	"D. Kapur and J. L. Mundy"
, publisher =	"MIT Press"
, year =	1989
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{kptb-itcdp-99
, author =	"E.-A. Karabassi and G. Papaioannou and T. Theoharis and A. B{\"o}hm"
, title =	"Intersection Test for Collision Detection in Particle Systems"
, journal =	"J. Graphics Tools"
, volume =	4
, number =	1
, year =	1999
, pages =	"25--37"
, update =	"00.03 held"
}

@manual{klpy-clp-99
, author =	"Vijay Karamcheti and Chen Li and Igor Pechtchanski and Chee Yap"
, title =	"The {CORE} Library Project"
, edition =	"1.2"
, year =	1999
, url =	"https://www.cs.nyu.edu/exact/core/"
, update =	"00.03 devillers"
}

@inproceedings{k-bisoa-89
, author =	"M. Karasick"
, title =	"Benchmarks for implementations of set-operations algorithms on polyhedral solids"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	13
}

@phdthesis{k-rmrs-89
, author =	"M. Karasick"
, title =	"On the Representation and Manipulation of Rigid Solids"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1989
, keywords =	"doctoral thesis"
}

@techreport{kln-edtur-89
, author =	"M. Karasick and D. Lieber and L. R. Nackman"
, title =	"Efficient {Delaunay} triangulations using rational arithmetic"
, type =	"Report"
, number =	"RC 14455"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, month =	mar
, year =	1989
, precedes =	"kln-edtur-91"
}

@article{kln-edtur-91
, author =	"M. Karasick and D. Lieber and L. R. Nackman"
, title =	"Efficient {Delaunay} triangulations using rational arithmetic"
, journal =	"ACM Trans. Graph."
, volume =	10
, number =	1
, month =	jan
, year =	1991
, pages =	"71--91"
, succeeds =	"kln-edtur-89"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@article{klnr-vtddm-97
, author =	"M. S. Karasick and D. Lieber and L. R. Nackman and V. T. Rajan"
, title =	"Visualization of Three-Dimensional {Delaunay} Meshes"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"114--128"
, update =	"97.07 held"
}

@inproceedings{ks-oag-93
, author =	"Y. Karasik and Micha Sharir"
, title =	"Optical algorithms in geometry"
, booktitle =	"Proc. Optical Comput. Topical Meeting, Optical Society of America"
, year =	1993
, pages =	"164--167"
, update =	"98.03 mitchell, 94.05 sharir"
}

@inproceedings{k-coctk-94
, author =	"Y. B. Karasik"
, title =	"Constructing Optically in Constant Time the $k$-Level of an Arrangement of Lines in the Plane and Other Related Problems"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"212--218"
, cites =	"b-omt-74, e-acg-87, ed-copht-83, erk-oalla-93, ers-ufwsc-, gchhzy-otmo-92, k-oacg-91, k-oaiht-92, ks-ocg-92, ks-pgdms-93, j-icm-93, ohg-riitf-85, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{k-fhtuh-89
, author =	"Y. B. Karasik"
, title =	"Formalization of heuristic tactics used by human beings in searching for the closest packing of arbitrary objects in a given domain"
, journal =	"Cybernetics \& Systems: An International Journal"
, volume =	20
, number =	1
, year =	1989
, pages =	"43--49"
, update =	"98.03 bibrelex"
}

@techreport{k-oacg-91
, author =	"Y. B. Karasik"
, title =	"Optical algorithms of computational geometry"
, type =	"Technical {Report}"
, number =	"199/91"
, institution =	"The Eskenasy Institute of Computer Science, Tel Aviv Univ."
, address =	"Tel Aviv, Israel"
, year =	1991
, update =	"98.03 bibrelex"
}

@inproceedings{k-ocvsg-94
, author =	"Y. B. Karasik"
, title =	"Optical Computer Vision: Some Geometrical Algorithms"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"207--211"
, cites =	"b-omt-74, ed-copht-83, fh-cfaia-82, g-vscfa-81, gchhzy-otmo-92, k-oacg-91, k-oaiht-92, ks-ocg-92, ks-pgdms-93, kr-glcd-82, ohg-riitf-85, p-lb-71, rsb-ocd-88, s-oiphv-82, s-hctoc-86, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{k-ofa-92
, author =	"Y. B. Karasik"
, title =	"Optical filling algorithm"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"328--333"
, cites =	"ks-ocg-92, m-rtisu-86, v-sdcsf-64, wt-ommsl-83, agw-fqo-86, ca-hadla-86, gr-ssaip-88, f-ocscs-88, fl-cstds-86, p-farg-79, r-ospft-86, s-frbri-80, ZZZ"
, update =	"98.07 bibrelex"
}

@article{k-oaiht-92
, author =	"Y. B. Karasik"
, title =	"The optical algorithm for the inverse {Hough} transform"
, journal =	"Optical computing and processing"
, volume =	2
, number =	2
, year =	1992
, pages =	"127--136"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ks-ocg-92
, author =	"Y. B. Karasik and Micha Sharir"
, title =	"Optical computational geometry"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"232--241"
, cites =	"ate-plcsl-89, b-gto-74, b-omt-74, br-lbceo-87, br-pcamm-87, cgl-pgd-83, cky-ommmu-88, clpp-odpfs-60, d-htrt-81, ed-copht-83, f-ocscs-88, fn-rtisa-90, g-ifo-68, get-hpfrt-89, ggsbcg-ocrot-89, gt-cghgt-84, hcy-iatwm-90, ls-mtoap-83, m-rtisu-86, ma-oaslm-89, r-asoi-53, rt-epaoc-90, sc-ctrmh-90, v-sdcsf-64, w-blsf-87, wt-ommsl-83, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{ks-pgdms-93
, author =	"Y. B. Karasik and Micha Sharir"
, title =	"The power of geometric duality and {Minkowski} sums in optical computational geometry"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"379--388"
, cites =	"br-lbceo-87, br-pcamm-87, cgl-pgd-83, d-htrt-81, dh-uhtdl-72, ek-iodc-90, ghlst-ltavs-87, h-odcbl-90, iti-ieesu-92, k-fhtuh-89, k-oacg-91, ks-ocg-92, ka-oci-92, klps-ujrcf-86, l-tdoad-91, m-oca-91, ph-ddocs-92, rt-epaoc-90, ZZZ"
, update =	"98.03 bibrelex+mitchell, 93.09 jones"
}

@proceedings{knv-ewcg-97
, title =	"Abstracts 13th European Workshop Comput. Geom."
, editor =	"Oliver Karch and Hartmut Noltemeier and Knut Verbarg"
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, update =	"00.03 bibrelex"
}

@inproceedings{knw-rlti-97
, author =	"Oliver Karch and Hartmut Noltemeier and Thomas Wahl"
, title =	"Robot Localization: Theory and Implementation"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"17--19"
, update =	"99.07 bibrelex, 98.07 bibrelex"
}

@article{kkt-rltaf-95
, author =	"D. Karger and P. N. Klein and R. E. Tarjan"
, title =	"A randomized linear-time algorithm to find minimum spanning trees"
, journal =	"J. ACM"
, volume =	42
, year =	1995
, pages =	"321--328"
, update =	"98.07 bibrelex"
}

@article{k-rtorc-96
, author =	"H. A. Karimi"
, title =	"Real-time optimal-routing computation: {A} heuristic approach"
, journal =	"ITS Journal"
, volume =	3
, year =	1996
, pages =	"111--127"
, update =	"98.03 agarwal"
}

@article{kh-esiem-96
, author =	"H. A. Karimi and B. H. Houston"
, title =	"Evaluating strategies for integrating environmental models with GIS: Current trends and future need"
, journal =	"Comput., Environ. and Urban Systems"
, volume =	20
, year =	1996
, pages =	"413--425"
, update =	"98.03 agarwal"
}

@book{ka-oci-92
, author =	"A. M. Karin and A. Awwal"
, title =	"Optical Computing: {An} Introduction"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1992
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{kh-aanlp-79
, author =	"O. Kariv and S. L. Hakimi"
, title =	"An algorithmic approach to network location problems. I: The $p$-centers"
, journal =	"SIAM J. Appl. Math."
, volume =	37
, year =	1979
, pages =	"513--538"
, update =	"97.11 bibrelex"
}

@phdthesis{k-rop-91
, author =	"W. C. Karl"
, title =	"Reconstructing Objects from Projections"
, school =	"Dept. EECS, Massachusetts Institute of Technology"
, address =	"Boston, MA"
, month =	feb
, year =	1991
, keywords =	"doctoral thesis, probing, x-ray probes"
, update =	"96.09 romanik"
}

@article{ku-pheis-88
, author =	"A. R. Karlin and E. Upfal"
, title =	"Parallel hashing: An efficient implementation of shared memory"
, journal =	"J. ACM"
, volume =	35
, number =	4
, year =	1988
, pages =	"876--892"
, update =	"96.09 orourke"
}

@book{k-lp-91
, author =	"H. Karloff"
, title =	"Linear Programming"
, publisher =	"Birkh{\"a}user"
, address =	"Boston"
, year =	1991
, update =	"96.09 orourke"
}

@techreport{k-olakr-89
, author =	"H. Karloff"
, title =	"Online algorithms for the $k$-robot problem on the line."
, type =	"Manuscript"
, institution =	"Univ. of Chicago"
, address =	"Univ. Illinois, Urbana, IL."
, year =	1989
, comments =	"talk was the Semi-Annual Lunch, Algorithms, and Dinner Symposium"
, update =	"93.09 milone+mitchell"
}

@inproceedings{km-ckwir-94
, author =	"H. Karloff and Y. Mansour"
, title =	"On construction of $k$--wise independent random variables"
, booktitle =	"Proc. Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"564--573"
, update =	"96.09 orourke"
}

@inproceedings{krr-lbrks-91
, author =	"H. Karloff and Y. Rabani and Y. Ravid"
, title =	"Lower bounds for randomized $k$-servers and motion planning algorithms"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"278--288"
, keywords =	"path planning, on-line"
}

@article{kr-rapn-93
, author =	"H. Karloff and P. Raghavan"
, title =	"Randomized algorithms and pseudorandom numbers"
, journal =	"J. ACM"
, volume =	40
, number =	3
, year =	1993
, pages =	"454--476"
, comments =	"using few random bits; precedes Mulmuley's work"
, update =	"94.01 matousek"
}

@techreport{k-hlcet-87
, author =	"H. J. Karloff"
, title =	"How long can a {Euclidean} traveling salesman tour be?"
, type =	"Technical {Report}"
, number =	"87-20"
, institution =	"Dept. Comput. Sci., Univ. Chicago"
, address =	"Chicago, IL"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{k-hlcet-89
, author =	"H. J. Karloff"
, title =	"How long can a {Euclidean} traveling salesman tour be?"
, journal =	"SIAM J. Discrete Math."
, volume =	2
, year =	1989
, pages =	"91--99"
, update =	"97.11 bibrelex"
}

@techreport{k-aru-84
, author =	"R. G. Karlsson"
, title =	"Algorithms in a restricted universe"
, type =	"Report"
, number =	"CS-84-50"
, institution =	"Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1984
}

@article{k-gmg-88
, author =	"R. G. Karlsson"
, title =	"Greedy matching on a grid"
, journal =	"BIT"
, volume =	28
, year =	1988
, pages =	"19--26"
}

@incollection{km-pg-85
, author =	"R. G. Karlsson and J. I. Munro"
, title =	"Proximity on a grid"
, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	182
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"187--196"
, update =	"97.03 schwarzkopf"
}

@inproceedings{kmr-nnpbd-85
, author =	"R. G. Karlsson and J. I. Munro and E. L. Robertson"
, title =	"The nearest neighbor problem on bounded domains"
, booktitle =	"Proc. 12th Internat. Colloq. Automata Lang. Program."
, nickname =	"ICALP '85"
, series =	"Lecture Notes Comput. Sci."
, volume =	194
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"318--327"
, update =	"99.11 bibrelex, 97.11 bibrelex"
}

@article{ko-ndcst-88
, author =	"R. G. Karlsson and M. H. Overmars"
, title =	"Normalized divide-and-conquer: a scaling technique for solving multi-dimensional problems"
, journal =	"Inform. Process. Lett."
, volume =	26
, year =	1988
, pages =	"307--312"
}

@article{ko-sag-88
, author =	"R. G. Karlsson and M. H. Overmars"
, title =	"Scanline algorithms on a grid"
, journal =	"BIT"
, volume =	28
, year =	1988
, pages =	"227--241"
, update =	"97.03 schwarzkopf"
}

@inproceedings{k-nptal-84i
, author =	"N. Karmarkar"
, title =	"A new polynomial-time algorithm for linear programming"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"302--311"
, precedes =	"k-nptal-84a"
}

@article{k-nptal-84a
, author =	"N. Karmarkar"
, title =	"A new polynomial-time algorithm for linear programming"
, journal =	"Combinatorica"
, volume =	4
, year =	1984
, pages =	"373--395"
, succeeds =	"k-nptal-84i"
}

@techreport{kkkll-mcaep-90
, author =	"N. Karmarkar and R. Karp and R. Karp and L. Lovasz and M. Luby"
, title =	"A {Monte}-{Carlo} algorithm for estimating the permanent"
, type =	"Technical {Report}"
, number =	"TR-90-063"
, institution =	"International Computer Science Institute"
, address =	"Berkeley, CA"
, year =	1990
, update =	"98.03 bibrelex"
}

@inproceedings{kg-scmg-00
, author =	"Zachi Karni and Craig Gotsman"
, title =	"Spectral Compression of Mesh Geometry"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"27--30"
, update =	"00.03 bibrelex"
}

@inproceedings{k-rrcse
, author =	"Gyula K{\'a}rolyi"
, title =	"{Ramsey}-Remainder for Convex Sets and the {Erd{\H o}s-Szekeres Theorem}"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"107--108"
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{k-rrcse-01
, author =	"Gyula K{\'a}rolyi"
, title =	"{Ramsey}-Remainder for Convex Sets and the {Erd{\H o}s-Szekeres} theorem"
, journal =	"Discrete Appl. Math."
, volume =	109
, year =	2001
, pages =	"163--175"
, succeeds =	"k-rrcse"
, update =	"02.03 devillers"
}

@incollection{kptt-afmdm-
, author =	"G. K{\'a}rolyi and J. Pach and G. Tardos and G. T{\'o}th"
, title =	"An algorithm for finding many disjoint monochromatic edges in a complete $2$-colored geometric graph"
, editor =	"I. B{\'a}r{\'a}ny and K. B{\"o}r{\"o}czky"
, booktitle =	"Intuitive Geometry"
, series =	"Bolyai Soc. Math. Studies"
, volume =	6
, publisher =	"??"
, year =	"??"
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@inproceedings{kpt-rtrgg-96
, author =	"Gyula K{\'a}rolyi and J{\'a}nos Pach and G{\'e}za T{\'o}th"
, title =	"Ramsey-Type Results for Geometric Graphs"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"359--365"
, update =	"96.05 efrat"
}

@article{kpt-rtrgg-97
, author =	"G. K{\'a}rolyi and J. Pach and G. T{\'o}th"
, title =	"Ramsey-Type Results for Geometric Graphs, I"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"247--255"
, succeeds =	"kpt-rtrgg-96"
, update =	"02.03 devillers"
}

@inproceedings{kptv-rttgg-97
, author =	"G. K{\'a}rolyi and J. Pach and G. T{\'o}th and P. Valtr"
, title =	"Ramsey-Type Results for Geometric Graphs II"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, publisher =	"ACM Press"
, year =	1997
, pages =	"94--103"
, cites =	"b-grtgs-74, bes-rtmcg-75, d-dtpos-50, elss-dgpps-73, gmpp-eptvs-91, grs-rt-90, hs-asdch-92, kpt-rtrgg-96, kptt-afmdm-, pa-cg-95, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
}

@article{kptv-rttgg-98
, author =	"G. K{\'a}rolyi and J. Pach and G. T{\'o}th and P. Valtr"
, title =	"Ramsey-Type Results for Geometric Graphs, II"
, journal =	"Discrete Comput. Geom."
, volume =	20
, year =	1998
, pages =	"375--388"
, succeeds =	"kptv-rttgg-97"
, update =	"02.03 devillers"
}

@article{k-ira-91
, author =	"R. Karp"
, title =	"An introduction to randomized algorithms"
, journal =	"Discrete Appl. Math."
, volume =	34
, year =	1991
, pages =	"165--201"
, update =	"94.05 matousek"
}

@incollection{k-racpc-72
, author =	"R. Karp"
, title =	"Reducibility among combinatorical problems of computer computaions"
, editor =	"E. Miller and J. W. Thatcher"
, booktitle =	"Complexity of Computer Computations"
, publisher =	"Plenum Press"
, address =	"New York"
, year =	1972
, pages =	"88--104"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@article{kl-tscap-75
, author =	"R. Karp and S. Li"
, title =	"Two special cases of the assignment problem"
, journal =	"Discrete Math."
, volume =	13
, year =	1975
, pages =	"129--142"
, update =	"98.03 bibrelex"
}

@inproceedings{klm-epsdm-92
, author =	"R. Karp and M. Luby and F. {Meyer auf der Heide}"
, title =	"Efficient PRAM simulation on distributed machines"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"318--326"
, update =	"96.09 orourke"
}

@unpublished{km-pstoo-85
, author =	"R. Karp and R. Motwani"
, title =	"Preprocessing search trade-offs: an optimal randomized algorithm"
, year =	1985
, note =	"Computer Science Division U.C. Berkeley"
, update =	"98.03 bibrelex"
}

@article{k-papat-77
, author =	"R. M. Karp"
, title =	"Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane"
, journal =	"Math. Oper. Res."
, volume =	2
, year =	1977
, pages =	"209--224"
}

@incollection{k-pascs-76
, author =	"R. M. Karp"
, title =	"The probabilistic analysis of some combinatorial search algorithms"
, editor =	"J. F. Traub"
, booktitle =	"Algorithms and Complexity: New Directions and Recent Results"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1976
, pages =	"1--19"
, update =	"98.11 bibrelex"
}

@inproceedings{klm-pambp-84
, author =	"R. M. Karp and M. Luby and A. Marchetti-Spaccamela"
, title =	"A probabilistic analysis of multidimensional bin-packing problems"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"289--299"
}

@article{kmr-dds-88
, author =	"R. M. Karp and R. Motwani and P. Raghavan"
, title =	"Deferred data structuring"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"883--902"
, succeeds =	"mr-ddsqd-86"
}

@techreport{kr-spasm-88t
, author =	"R. M. Karp and V. Ramachandran"
, title =	"A survey of parallel algorithms for shared-memory machines"
, number =	"UCB/CSD 88/408"
, institution =	"University of California, Berkeley"
, year =	1988
, precedes =	"kr-pasmm-90"
, update =	"98.07 bibrelex"
}

@incollection{kr-pasmm-90
, author =	"R. M. Karp and V. Ramachandran"
, title =	"Parallel algorithms for shared memory machines"
, editor =	"J. van Leeuwen"
, booktitle =	"Handbook of Theoretical Computer Science"
, publisher =	"Elsevier/The MIT Press"
, address =	"Amsterdam"
, year =	1990
, pages =	"869--941"
, succeeds =	"kr-spasm-88t"
, update =	"98.07 bibrelex, 93.05 devillers"
}

@inproceedings{ksss-obslm-93
, author =	"R. M. Karp and A. Sahay and E. Santos and K. E. Schauser"
, title =	"Optimal Broadcast and Summation in the {LogP} Model"
, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
, year =	1993
, pages =	"142--153"
, update =	"96.09 orourke"
}

@inproceedings{kw-fpami-84
, author =	"R. M. Karp and A. Wigderson"
, title =	"A Fast Parallel Algorithm for the Maximal Independent Set Problem"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"86--109"
, update =	"98.03 bibrelex"
}

@techreport{kz-fista-94
, author =	"M. Karpinski and A. Zelikovsky"
, title =	"Further improvements of {Steiner} tree approximations"
, type =	"Report"
, number =	"MPI-I-94-158"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"95.01 smid"
}

@inproceedings{k-ecbmf-73
, author =	"A. V. Karzanov"
, title =	"Exact complexity bound for a max-flow algorithm applied to ''representatives``"
, booktitle =	"Voprosy Kibernetiki (Proc. of the Seminar on Combinatorial Mathematics)"
, year =	1973
, pages =	"66--70"
, update =	"97.11 bibrelex"
}

@book{k-co-67
, author =	"K. Kasahara"
, title =	"Creative Origami"
, publisher =	"Japan Publications"
, year =	1967
, update =	"97.11 bibrelex"
}

@book{kt-oc-78
, author =	"K. Kasahara"
, title =	"Origami for the Connoisseur"
, publisher =	"Japan Publications"
, year =	1978
, update =	"97.11 bibrelex"
}

@book{k-oo-88
, author =	"K. Kasahara"
, title =	"Origami Omnibus"
, publisher =	"Japan Publications"
, year =	1988
, update =	"97.11 bibrelex"
}

@inproceedings{ko-gapdc-82
, author =	"R. L. Kashyap and B. J. Oommen"
, title =	"A geometrical approach to polygonal dissimilarity and the classification of closed boundaries"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
, year =	1982
, pages =	"472--481"
}

@article{k-drpte-89
, author =	"E. A. Kasimatis"
, title =	"Dissections of regular polygons into triangles of equal areas"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"375--381"
}

@techreport{k-adppr-85
, author =	"D. T. Kasper"
, title =	"An algorithm for determining the position of a point relative to a polygon"
, type =	"Report"
, number =	"??"
, institution =	"Advanced Products Lab., Hughes Support Syst."
, address =	"Long Beach, CA"
, year =	1985
}

@article{kk-rtcs-86
, author =	"T. Kat and J. Kajiya"
, title =	"Ray tracing complex scenes"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1986
, pages =	"269--278"
, update =	"98.07 bibrelex"
}

@article{km-etdpp-88
, author =	"M. Katachalski and A. Meir"
, title =	"On empty triangles determined by points in the plane"
, journal =	"Acta Math. Hungar."
, volume =	51
, year =	1988
, pages =	"323--328"
, update =	"01.07 devillers, 98.03 bibrelex"
}

@article{k-wcmst-82
, author =	"J. Katajainen"
, title =	"On the worst case of a minimal spanning tree algorithm for {Euclidean} space"
, journal =	"BIT"
, volume =	23
, year =	1982
, pages =	"2--8"
}

@techreport{k-racrn-85
, author =	"J. Katajainen"
, title =	"The region approach for computing relative neighborhood graphs in the {$L_{p}$} metric"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Math. Sci., Univ. Turku"
, address =	"Turku, Finland"
, year =	1985
}

@article{k-racrn-88
, author =	"J. Katajainen"
, title =	"The region approach for computing relative neighborhood graphs in the {$L_{p}$} metric"
, journal =	"Computing"
, volume =	40
, year =	1988
, pages =	"147--161"
, update =	"98.07 bibrelex"
}

@article{kk-cdtmb-88
, author =	"Jyrki Katajainen and Markku Koppinen"
, title =	"Constructing {Delaunay} triangulations by merging buckets in quadtree order"
, journal =	"Annales Societatis Mathematicae Polonae, Series IV, Fundamenta Informaticae"
, volume =	11
, number =	3
, year =	1988
, pages =	"275--288"
, update =	"98.03 mitchell"
, abstract =	"Recently R. A. Dwyer [Algorithmica 2, 137 - 151 (1987;
		 Zbl. 631.68043)] presented an algorithm which
		 constructs a Delaunay triangulation for a planar set of
		 N sites in O(N log log N) expected time and O(N log N)
		 worst-case-time. We show that a slight modification of
		 his algorithm preserves the worst-case running time,
		 but has only O(N) average running time. The method is a
		 hybrid which combines the cell techniques with the
		 divide-and-conquer algorithm of Leonidas J. Guibas and J. Stolfi
		 [ACM Trans. Graphics 4, 74 - 123 (1985; Zbl.
		 586.68059)]. First a square grid of size about sqrt(N)
		 by sqrt(N) is placed on the set of sites. The grid
		 forms about N cells (buckets), each of which is
		 implemented as a list of the sites which fall into the
		 corresponding square of the grid. A Delaunay
		 triangulation of the generally rather few sites within
		 each cell is constructed with the Guibas \& Stolfi
		 algorithm. Then the triangulations are merged, four by
		 four, in a quadtree-like order"
}

@article{knt-letac-87
, author =	"J. Katajainen and O. Nevalainen and J. Teuhola"
, title =	"A linear expected-time algorithm for computing planar relative neighbourhood graphs"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"77--86"
}

@unpublished{kk-cdtmb-87
, author =	"J. Katakjainen and M. Koppinen"
, title =	"Constructing {Delaunay} triangulations by merging buckets in quad-tree order"
, year =	1987
, note =	"Unpublished Manuscript"
, update =	"98.03 bibrelex"
}

@inproceedings{ks-stish-97
, author =	"Norio Katayama and Shin'ichi Satoh"
, title =	"The {SR}-tree: {An} Index Structure for High-Dimensional Nearest Neighbor Queries"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1997
, pages =	"369--380"
, keywords =	"nearest neighbor, R-trees, bounding volume hierarchies"
, update =	"99.03 forrest, 98.03 mitchell, 97.07 agarwal"
, abstract =	"Recently, similarity queries on feature vectors have been widely used to
perform content-based retrieval of images. To apply this technique to large
databases, it is required to develop multidimensional index structures
supporting nearest neighbor queries efficiently. The SS-tree had been
proposed for this purpose and is known to outperform other index structures
such as the R*-tree and the K-D-B-tree. One of its most important features
is that it employs bounding spheres rather than bounding rectangles for the
shape of regions. However, we demonstrate in this paper that bounding
spheres occupy much larger volume than bounding rectangles with
high-dimensional data and that this reduces search efficiency. To overcome
this drawback, we propose a new index structure called the SR-tree
(Sphere/Rectangle-tree) which integrates bounding spheres and bounding
rectangles. A region of the SR-tree is specified by the intersection of a
bounding sphere and a bounding rectangle. Incorporating bounding rectangles
permits neighborhoods to be partitioned into smaller regions than the
SS-tree and improves the disjointness among regions. This enhances the
performance on nearest neighbor queries especially for high-dimensional and
non-uniform data which can be practical in actual image/video similarity
indexing. We include the performance test results that verify this advantage
of the SR-tree and show that the SR-tree outperforms both the SS-tree and
the R*-tree."
}

@article{k-cgct-86
, author =	"M. Katchalski"
, title =	"A conjecture of Gr{\"u}nbaum on common transversals"
, journal =	"Math. Scan."
, volume =	59
, year =	1986
, pages =	"192--198"
, update =	"98.03 bibrelex"
}

@article{k-tsct-80
, author =	"M. Katchalski"
, title =	"Thin Sets and Common Transversals"
, journal =	"J. Geom."
, volume =	14
, year =	1980
, pages =	"103--107"
, update =	"98.03 bibrelex"
}

@article{kll-gpct-86
, author =	"M. Katchalski and T. Lewis and A. Liu"
, title =	"Geometric permutations and common transversals"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"371--377"
}

@article{kll-gpdt-87
, author =	"M. Katchalski and T. Lewis and A. Liu"
, title =	"Geometric permutations of disjoint translates of convex sets"
, journal =	"Discrete Math."
, volume =	65
, year =	1987
, pages =	"249--259"
, update =	"95.09 agarwal"
}

@article{kll-dwsdc-92
, author =	"M. Katchalski and T. Lewis and A. Liu"
, title =	"The different ways of stabbing disjoint convex sets"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"197--206"
}

@article{klz-gpcs-85
, author =	"M. Katchalski and T. Lewis and J. Zaks"
, title =	"Geometric permutations for convex sets"
, journal =	"Discrete Math."
, volume =	54
, year =	1985
, pages =	"271--284"
, update =	"95.09 agarwal"
}

@article{kl-pgr-79
, author =	"M. Katchalski and A. Liu"
, title =	"A problem of geometry in ${R}^n$"
, journal =	"Proc. Amer. Math. Soc."
, volume =	75
, year =	1979
, pages =	"284--288"
, update =	"97.11 bibrelex"
}

@incollection{kn-cdg-96
, author =	"M. Katchalski and D. Nashtir"
, title =	"On a conjecture of {Danzer} and {Gr{\"u}nbaum}"
, booktitle =	"Proc. Amer. Math. Soc."
, year =	1996
, update =	"97.11 bibrelex"
}

@article{ki-pceas-87
, author =	"N. Katoh and T. Ibaraki"
, title =	"A parametric characterization and an $\varepsilon$-approximation scheme for the minimization of a quasiconcave program"
, journal =	"Discrete Appl. Math."
, volume =	17
, year =	1987
, pages =	"39--66"
, update =	"98.03 bibrelex"
}

@techreport{ki-tnprc-83
, author =	"N. Katoh and T. Ibaraki"
, title =	"On the total number of pivots required for certain parametric combinatorial optimization problems"
, type =	"Working {Paper}"
, number =	71
, institution =	"Institute of Economic Research, Kobe University"
, address =	"Kobe, Japan"
, year =	1983
, update =	"98.03 bibrelex"
}

@techreport{ki-fkbdn-91
, author =	"N. Katoh and K. Iwano"
, title =	"Finding $k$ best distances of $n$ points in the plane"
, institution =	"Kobe Univ."
, address =	"Kobe, Japan"
, year =	1991
, update =	"98.07 bibrelex"
}

@article{ki-fkfpk-95
, author =	"N. Katoh and K. Iwano"
, title =	"Finding $k$ farthest pairs and $k$ closest/farthest bichromatic pairs for points in the plane"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"37--51"
, keywords =	"k farthest pairs, k closest/farthest bichromatic pairs, higher order Voronoi diagrams"
, succeeds =	"ki-fkfpk-92"
, update =	"96.09 devillers"
}

@inproceedings{ki-fkfpk-92
, author =	"N. Katoh and K. Iwano"
, title =	"Finding $k$ farthest pairs and $k$ closest pairs/farthest bichromatic pairs for points in the plane"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"320--329"
, precedes =	"ki-fkfpk-95"
, cites =	"aass-sdp-90, aiks-fkpmd-91, bfprt-tbs-73, c-ntcos-85, ce-iacko-87, c-narsc-87, dd-ekdnp-91, ds-ekldn-92, ddg-fsp-83, e-esaa-86, fj-csrxm-82, k-osps-83, l-knnvd-82, lt-apst-80, ps-cgi-85, s-lisps-89, s-sisie-91, hss-pgcrm-87, s-mmdpsl-90t, v-oaann-89, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@inproceedings{kt-ncpkp-01
, author =	"Naoki Katoh and Takeshi Tokuyama"
, title =	"Notes on Computing Peaks in K-Levels and Parametric Spanning Trees"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"241--248"
, update =	"01.11 pocchiola"
}

@inproceedings{kti-mmstl-92
, author =	"N. Katoh and T. Tokuyama and K. Iwano"
, title =	"On minimum and maximum spanning trees of linearly moving points"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"396--405"
}

@article{kti-mmstl-95
, author =	"N. Katoh and T. Tokuyama and K. Iwano"
, title =	"On minimum and maximum spanning trees of linearly moving points"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"161--176"
, update =	"95.05 smid"
}

@article{ks-pgt-67
, author =	"G. Katona and E. Szemer{\'e}di"
, title =	"On a problem in a graph theory"
, journal =	"Studia Scientiarium Mathematicarum Hungarica"
, volume =	2
, year =	1967
, pages =	"23--28"
, update =	"98.03 bibrelex"
}

@article{k-dess-89
, author =	"M. Katz"
, title =	"Diameter-extremal subsets of spheres"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"117--137"
}

@techreport{kn-pso-96-t
, author =	"Matthew Katz and Franck Nielsen"
, title =	"On Piercing Sets of Objects"
, type =	"Rapport de recherche"
, number =	2874
, institution =	"INRIA"
, year =	1996
, url =	"http://www.inria.fr/rrrt/rr-2874.html"
, update =	"02.03 devillers, 97.11 bibrelex"
, abstract =	"A set of objects is $k$-pierceable if there exists a set of $k$ poin ts such that each object is pierced by (contains) at least one of these points.  Finding the smallest integer $k$ such that a set is $k$-pierceable is NP-complete. In this technical report, we present efficient algorithms for findi ng a piercing set (i.e., a set of $k$ points as above) for several classes of convex objects and small values of $k$.  In some of the cases, our algorithms imply known as well as new Helly-type theorems, thus adding to previous results of Danzer and Gr{\"u}nbaum who studied the case of axis-parallel boxes.  The problems studied here are related to the collection of optimization problems in which one seeks the smallest scaling factor of a centrally symmetric convex object $K$, so that a set of points can be covered by $k$ congruent homothets of $K$."
}

@phdthesis{k-grdsc-85
, author =	"M. D. Katz"
, title =	"Geometric retrieval: data structures and computational complexity"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Inform. Comput. Sci., Univ. California Irvine"
, address =	"Irvine, CA"
, year =	1985
, keywords =	"doctoral thesis"
}

@article{kv-dsrsq-86
, author =	"M. D. Katz and D. J. Volper"
, title =	"Data structures for retrieval on square grids"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"919--931"
, update =	"97.07 agarwal"
}

@article{k-3vrs2-??
, author =	"M. J. Katz"
, title =	"{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
, journal =	"Comput. Geom. Theory Appl."
, note =	"to appear"
, succeeds =	"k-3vrs2-95"
, update =	"97.11 katz"
}

@techreport{k-3vrs2-95
, author =	"M. J. Katz"
, title =	"{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
, type =	"Research {Report}"
, number =	2583
, institution =	"INRIA"
, address =	"BP93, 06902 Sophia-Antipolis, France"
, year =	1995
, update =	"97.11 katz, 96.09 smid"
}

@phdthesis{k-
, author =	"M. J. Katz"
, title =	"Geometric Optimization via Expanders and Visibility of Fat Objects in Three Dimensions: Two Studies in Computational Geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Tel-Aviv University"
, address =	"Tel-Aviv, Israel"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"97.11 katz"
}

@inproceedings{k-iagoe-95
, author =	"M. J. Katz"
, title =	"Improved algorithms in geometric optimization via expanders"
, booktitle =	"Proc. 3rd Israel Symposium on Theory of Computing and Systems"
, year =	1995
, pages =	"78--87"
, update =	"96.01 devillers"
}

@inproceedings{kks-cscp-98
, author =	"Matthew J. Katz and Klara Kedem and Michael Segal"
, title =	"Constrained Square Center Problems"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"95--106"
, precedes =	"kks-dr2cp-00"
, update =	"00.03 smid, 99.03 bibrelex, 98.07 mitchell"
}

@article{kks-dr2cp-00
, author =	"M. J. Katz and K. Kedem and M. Segal"
, title =	"Discrete rectilinear $2$-center problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	15
, year =	2000
, pages =	"203--214"
, succeeds =	"kks-cscp-98"
, update =	"00.03 smid"
}

@inproceedings{kks-iapuf-99
, author =	"Matthew J. Katz and Klara Kedem and Michael Segal"
, title =	"Improved Algorithms for Placing Undesirable Facilities"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"39--42"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{kn-pso-96-i
, author =	"M. J. Katz and F. Nielsen"
, title =	"On Piercing Sets of Objects"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"113--121"
, cites =	"a-httgl-94, bglr-epcpa-93, c-ghscp-79, cm-ltdao-93, dg-ipbr-82, dgk-htir-63, fpt-opcpa-81, gw-hcg-93a, hd-kgde-60, h-aascv-82, k-racpc-72, kn-cdg-96, kn-pso-t, m-apcad-83, msw-sblp-92, s-nlap2-96, sw-rpppp-96, ZZZ"
, update =	"02.03 devillers, 98.03 bibrelex, 97.11 bibrelex+katz, 96.05 efrat"
}

@inproceedings{kns-sltps-00
, author =	"Matthew J. Katz and Frank Nielsen and Micheal Segal"
, title =	"Shooter Location Through Piercing Sets"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"55--58"
, update =	"00.03 bibrelex"
}

@inproceedings{kos-ehsro-91
, author =	"M. J. Katz and M. H. Overmars and Micha Sharir"
, title =	"Efficient hidden surface removal for objects with small union size"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"31--40"
, keywords =	"hidden surface removal"
, cites =	"as-anspt-91, b-hsrr-90, bo-arcgi-79, bo-hsrap-90, cegpsss-ccclr-90, cs-vppt-89, d-qbhle-86, g-pahle-87i, gao-isost-90, go-nasch-87, klps-ujrcf-86, ms-rcibt-88, mpssw-ftdlm-90, m-wcohs-87, m-eahsr-89, n-flsah-85, os-oshsr-89, os-itosh-89, os-mvm-91, py-bpahs-89, ps-cgi-85, pvy-cavsi-90, rs-eoshs-88i, so-sosah-92, s-tsbhl-81, sss-cthsa-74, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{kos-ehsro-92
, author =	"M. J. Katz and M. H. Overmars and Micha Sharir"
, title =	"Efficient hidden surface removal for objects with small union size"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, year =	1992
, pages =	"223--234"
, keywords =	"hidden surface removal"
, update =	"98.03 mitchell, 96.05 ramkumar"
}

@inproceedings{ks-ebago-93
, author =	"M. J. Katz and Micha Sharir"
, title =	"An expander-based approach to geometric optimization"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"198--207"
, cites =	"aass-sdp-90, aest-cscpp-91, am-rsps-92, as-pglp-90, ast-apsgo-92, am-dptnp-96, as-pm-92, cegs-dwclp-92, csw-qoubs-92, cw-qorss-89, cs-arscg-89, c-sdsno-87, csss-otass-89, dmn-rass-92, hw-ensrq-87, hs-ftp-91, ks-osse-, lps-rg-88, m-egtcc-88, m-roass-91, m-ept-92, m-rsehc-92, ms-datdd-93, m-apcad-83, st-epcp-91, v-pcp-75, ZZZ"
, update =	"99.03 forrest, 98.11 bibrelex, 98.03 bibrelex+mitchell, 93.09 jones"
}

@article{ks-ebago-97
, author =	"M. J. Katz and Micha Sharir"
, title =	"An expander-based approach to geometric optimization"
, journal =	"SIAM J. Comput."
, volume =	26
, year =	1997
, pages =	"1384--1408"
, succeeds =	"ks-ebago-93"
, update =	"98.03 mitchell, 97.11 katz+smid"
}

@techreport{ks-osse-
, author =	"M. J. Katz and M. Sharir"
, title =	"Optimal slope selection via expanders"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, precedes =	"ks-osse-93i"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{ks-osse-93i
, author =	"M. J. Katz and Micha Sharir"
, title =	"Optimal slope selection via expanders"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"139--144"
, succeeds =	"ks-osse-"
, cites =	"as-pm-92, am-dptnp-92, cegs-dwclp-92, c-sdsno-87, csss-oss-88, dmn-rass-92, e-acg-87, ks-ebago-93, lps-eerc-86, m-egtcc-88, m-roass-91, m-cha-91, m-apcad-83, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 95.09 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@article{ks-osse-93
, author =	"M. J. Katz and Micha Sharir"
, title =	"Optimal slope selection via expanders"
, journal =	"Inform. Process. Lett."
, volume =	47
, year =	1993
, pages =	"115--122"
, update =	"98.03 mitchell, 94.05 sharir"
}

@unpublished{kv-tbngp-99
, author =	"M. J. Katz and K. R. Varadarajan"
, title =	"A tight bound on the number of geometric permutations of convex fat objects in {$\Re^d$}"
, year =	1999
, note =	"Dept. Comput. Sci., Ben-Gurion University of the Negev, Israel"
, update =	"01.04 orourke"
}

@article{ks-gictr-??
, author =	"S. Katz and T. W. Sederberg"
, title =	"Genus of the intersection curve of two rational surface patches"
, journal =	"Comput. Aided Geom. Design"
, volume =	5
, year =	"??"
, pages =	"253--258"
, update =	"97.11 bibrelex"
}

@article{k-aairm-83
, author =	"S. Kauffman"
, title =	"An Algorithmic Approach to Intelligent Robot Mobility"
, journal =	"Robotics Age"
, volume =	5
, number =	3
, year =	1983
, pages =	"38--47"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ks-saplc-99
, author =	"Pierre Kauffmann and Jean-Claude Spehner"
, title =	"Sweeping Along a Polygonal Line to Construct a {Delaunay} Diagram"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"153--155"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@article{kcy-vg-93
, author =	"A. Kaufman and D. Cohen and R. Yagel"
, title =	"Volumetric Graphics"
, journal =	"IEEE Computer"
, volume =	26
, number =	7
, year =	1993
, pages =	"51--64"
, update =	"98.03 mitchell"
}

@book{k-vv-90
, author =	"A. E. Kaufman"
, title =	"Volume Visualization"
, publisher =	"IEEE Computer Society Press"
, address =	"Los Alamitos, CA"
, year =	1990
, isbn =	"908186-9020-8"
, update =	"98.03 mitchell"
}

@book{kr-fgdic-90
, author =	"L. Kaufman and P. J. Rousseeuw"
, title =	"Finding Groups in Data: An Introduction to Cluster Analysis"
, publisher =	"John Wiley \& Sons"
, year =	1990
, update =	"99.11 bibrelex, 98.07 agarwal"
}

@book{ks-sts-93
, author =	"W. J. {Kaufmann III} and L. L. Smarr"
, title =	"Supercomputing and the transformation of science"
, publisher =	"Scientific American Library"
, address =	"New York, NY"
, year =	1993
, update =	"98.03 bibrelex"
}

@inproceedings{kgt-smtgg-94
, author =	"M. Kaufmann and S. Gao and K. Thulasiraman"
, title =	"On {Steiner} Minimal Tree in Grid Graphs and Its Application to {VLSI} Routing"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"351--359"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
}

@inproceedings{kk-faedp-91
, author =	"Michael Kaufmann and Gerhard Kl{\"a}r"
, title =	"A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"336--348"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@techreport{km-lrttn-84
, author =	"M. Kaufmann and K. Mehlhorn"
, title =	"Local routing of two-terminal nets is easy"
, type =	"Report"
, number =	"A84/12"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1984
}

@article{km-rtgs-86
, author =	"M. Kaufmann and K. Mehlhorn"
, title =	"Routing through a generalized switchbox"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"510--531"
}

@inproceedings{krb-sadlg-95
, author =	"K. Kaugars and J. Reinfelds and A. Brazma"
, title =	"A Simple Algorithm for Drawing Large Graphs on Small Screens"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"278--281"
, keywords =	"graph drawing, system, fisheye view"
, update =	"95.01 tamassia"
}

@article{kf-cmspc-95
, author =	"A. Kaul and R. Farouki"
, title =	"Computing {Minkowski} sums of plane curves"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"413--432"
, keywords =	"Minkowski sums, plane curves, convolutions, Gauss maps, shape design, configuration space"
, update =	"96.09 devillers"
}

@techreport{ko-cmsrp-93
, author =	"A. Kaul and M. A. O'Connor"
, title =	"Computing {Minkowski} sums of regular polyhedra"
, type =	"Report"
, number =	"RC 18891 (82557) 5/12/93"
, institution =	"IBM T.J. Watson Research Center"
, address =	"Yorktown Heights, NY 10598"
, year =	1993
, update =	"98.07 bibrelex, 96.05 ramkumar"
}

@inproceedings{kos-cmsrp-91i
, author =	"A. Kaul and M. A. O'Connor and V. Srinivasan"
, title =	"Computing {Minkowski} sums of regular polygons"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"74--77"
, cites =	"bo-arcgi-79, dhks-isccd-90, g-ctfsr-86, g-cp-67, grs-kfcg-83, gs-lncg-83, kos-cmsrp-91t, klps-ujrcf-86, m-rsig-75, ps-cgi-85, s-iamm-82, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@techreport{kos-cmsrp-91t
, author =	"A. Kaul and M. A. O'Connor and V. Srinivasan"
, title =	"Computing {Minkowski} sums of regular polygons"
, type =	"Report"
, number =	"RC 18523 (80982) 11/13/93"
, institution =	"IBM T.J. Watson Research Center"
, address =	"Yorktown Heights, NY 10598"
, year =	1992
, update =	"98.07 bibrelex, 96.05 ramkumar"
}

@inproceedings{kr-sidc-92
, author =	"A. Kaul and J. Rossignac"
, title =	"Solid-interpolating deformations: construction and animation of {PIPs}"
, booktitle =	"Proc. Eurographics '91"
, year =	1991
, pages =	"493--505"
, comments =	"use of Minkowski sums for animation"
, update =	"96.05 ramkumar"
}

@phdthesis{k-rncsf-95
, author =	"L. Kavraki"
, title =	"Random Networks in Configuration Space for Fast Path Planning"
, school =	"Stanford Univ."
, address =	"Stanford, CA"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@techreport{kl-cppa-93t
, author =	"L. Kavraki and J.-C. Latombe"
, title =	"Complexity of partitioning a planar assembly"
, number =	"STAN-CS-93-1467"
, institution =	"Department of Computer Science, Stanford University"
, year =	1993
, precedes =	"klw-cap-93"
, update =	"98.11 bibrelex"
}

@inproceedings{klw-cap-93
, author =	"L. Kavraki and J.-C. Latombe and R. Wilson"
, title =	"On the Complexity of Assembly Partitioning"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"12--17"
, succeeds =	"kl-cppa-93t"
, cites =	"acm-mpoap-89, gj-cigtn-79, m-camap-91, kl-cppa-93t, n-pa-88, pss-stsps-88, ss-pmp1c-83, ss-otcbt-93, t-mss-85, w-fap-92, hr-s-83, wll-cpa-92, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{kk-ppatc-95
, author =	"L. E. Kavraki and M. N. Kolountzakis"
, title =	"Partitioning a planar assembly into two connected components is {NP}-complete"
, journal =	"Inform. Process. Lett."
, volume =	55
, number =	3
, year =	1995
, pages =	"159--165"
, keywords =	"polygons, assembly, robotics, planning, NP-hardness"
, update =	"95.09 mitchell"
}

@inproceedings{klmr-rqprp-95
, author =	"L. E. Kavraki and J.-C. Latombe and R. Motwani and P. Raghavan"
, title =	"Randomized query processing in robot path planning"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, year =	1995
, pages =	"353--362"
, update =	"95.09 smid"
}

@article{kslo-prpph-96
, author =	"L. E. Kavraki and P. {\v S}vestka and J.-C. Latombe and M. H. Overmars"
, title =	"Probabilistic Roadmaps for Path Planning in High Dimensional Configuration Spaces"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	12
, year =	1996
, pages =	"566--580"
, update =	"98.07 agarwal, 97.03 schwarzkopf"
}

@book{k-fo-95
, author =	"F. Kawahata"
, title =	"Fantasy Origami"
, publisher =	"Gallery Origami House"
, address =	"Tokyo, Japan"
, year =	1995
, update =	"97.11 bibrelex"
}

@inproceedings{k-tffaf-94
, author =	"F. Kawahata"
, title =	"The technique to fold free angles of formative art 'origami'"
, booktitle =	"Proc. 2nd Internat. Meeting on Origami Science and Scientific Origami"
, site =	"Otsu, Japan"
, year =	1994
, update =	"97.11 bibrelex"
}

@incollection{k-rbmcv-89
, author =	"T. Kawasaki"
, title =	"On the relation between mountain-creases and valley-creases of a flat origami"
, editor =	"H. Huzita"
, booktitle =	"Origami Science and Technology"
, year =	1989
, pages =	"229--237"
, update =	"97.11 bibrelex"
}

@inproceedings{k-ealdp-89
, author =	"Y. Ke"
, title =	"An efficient algorithm for link-distance problems"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"69--78"
, keywords =	"motion planning, visibility, polygonal chains"
, cites =	"cg-vippg-85, dls-oaclc-88, egs-oplms-86, gh-ospqs-87, ghlst-ltavs-86, k-ealdp-88, k-pvawv-89, k-twvsp-87, kr-wvpsp-87, lpsssstwy-clcsp-87, gjpt-tsp-78, s-ltaml-86, s-mlppr-87, tv-otats-88, ZZZ"
, update =	"98.03 bibrelex"
}

@techreport{k-ealdp-88
, author =	"Y. Ke"
, title =	"An Efficient Algorithm for Link Distance Problems inside a Simple Polygon"
, type =	"Technical {Report}"
, number =	"JHU-87/28"
, institution =	"Dept. of Computer Science, Johns Hopkins Univ."
, year =	1988
, update =	"93.09 milone+mitchell"
}

@techreport{k-dwvsp-88
, author =	"Y. Ke"
, title =	"Detecting the weak visibility of a simple polygon and related problems"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1988
, update =	"97.11 bibrelex"
}

@phdthesis{k-pvawv-89
, author =	"Y. Ke"
, title =	"Polygon visibility algorithms for weak visibility and link distance problems"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1989
, keywords =	"doctoral thesis"
, update =	"96.01 aronov+orourke"
}

@techreport{k-twvsp-87
, author =	"Y. Ke"
, title =	"Testing the weak visibility of a simple polygon and related problems"
, number =	27
, institution =	"Department of Computer Science, The Johns Hopkins University"
, year =	1987
, update =	"98.03 bibrelex"
}

@techreport{ko-amltd-87
, author =	"Y. Ke and J. O'Rourke"
, title =	"An algorithm for moving a ladder in three dimensions"
, type =	"Technical {Report}"
, number =	"JHU-87/17"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	sep
, year =	1987
, keywords =	"motion planning, three-dimensional, lower bounds, cell complexes"
, precedes =	"ko-mltdu-87"
}

@techreport{ko-oamlt-87
, author =	"Y. Ke and J. O'Rourke"
, title =	"An ${O} (n^{6} \log n)$ algorithm for moving a ladder in three dimensions"
, type =	"Technical {Report}"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	may
, year =	1987
, update =	"98.03 bibrelex"
}

@article{ko-ckpsp-
, author =	"Y. Ke and J. O'Rourke"
, title =	"Computing the kernel of a point set in a polygon"
, journal =	"Visual Comput."
, volume =	""
, year =	""
, pages =	""
, keywords =	"visibility, points, polygons, kernel"
, comments =	"submitted"
, succeeds =	"ko-ckpsp-89"
, update =	"94.05 devillers"
}

@inproceedings{ko-ckpsp-89
, author =	"Y. Ke and J. O'Rourke"
, title =	"Computing the kernel of a point set in a polygon"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"135--146"
, keywords =	"visibility, points, polygons, kernel"
, precedes =	"ko-ckpsp-"
, update =	"97.11 bibrelex"
}

@techreport{ko-lbmlt-87t
, author =	"Y. Ke and J. O'Rourke"
, title =	"Lower bounds on moving a ladder in two and three dimensions"
, type =	"Technical {Report}"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	may
, year =	1987
, update =	"98.03 bibrelex"
}

@article{ko-lbmlt-87a
, author =	"Y. Ke and J. O'Rourke"
, title =	"Lower bounds on moving a ladder in two and three dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1987
, pages =	"197--218"
, update =	"98.03 bibrelex"
}

@article{ko-lbmlt-88
, author =	"Y. Ke and J. O'Rourke"
, title =	"Lower bounds on moving a ladder in two and three dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"197--217"
, keywords =	"motion planning, two-dimensional, three-dimensional, lower bounds, cell complexes"
, succeeds =	"ko-mltdu-87"
}

@inproceedings{ko-mltdu-87
, author =	"Y. Ke and J. O'Rourke"
, title =	"Moving a ladder in three dimensions: upper and lower bounds"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"136--145"
, keywords =	"motion planning, three-dimensional, lower bounds, cell complexes"
, succeeds =	"ko-amltd-87"
, precedes =	"ko-lbmlt-88"
, cites =	"c-emscc-87, eos-calha-86, ko-lbmlt-87t, ko-oamlt-87, ls-esmpa-85, o-lbml-85, osy-gvdl1-84, osy-gvdl2-84, osy-rnamp-83, ss-pmp1c-83, ss-pmp5c-84, ss-nempa-86, ZZZ"
, update =	"98.03 bibrelex"
}

@techreport{kr-wvpsp-87
, author =	"Y. Ke and J. O'Rourke"
, title =	"Weak visibility problems for a set of points in a simple polygon"
, institution =	"Department of Computer Science, The Johns Hopkins University"
, year =	1987
, update =	"98.03 bibrelex"
}

@techreport{k-nr-
, author =	"P. Kearney"
, title =	"On {NeST} representations"
, type =	"manuscript"
, update =	"98.11 bibrelex"
}

@proceedings{k-ewcg-00
, title =	"Abstracts 16th European Workshop Comput. Geom."
, editor =	"Klara Kedem"
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, update =	"00.03 bibrelex"
}

@article{kc-ebrut-97
, author =	"K. Kedem and D. Cohen"
, title =	"Efficient bitmap resemblance under translations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"57--84"
, update =	"97.07 devillers"
}

@article{klps-ujrcf-86
, author =	"K. Kedem and R. Livne and J. Pach and Micha Sharir"
, title =	"On the union of {Jordan} regions and collision-free translational motion amidst polygonal obstacles"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"59--71"
, keywords =	"motion planning, two-dimensional, Jordan curves"
, succeeds =	"ks-eapcf-85"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{ks-ampsc-88
, author =	"K. Kedem and Micha Sharir"
, title =	"An automatic motion planning system for a convex polygonal mobile robot in $2$-d polygonal space"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"329--340"
, precedes =	"ks-ampsc-90"
, cites =	"ass-sulbl-87, a-sdcgp-85, bz-stdfp-86, bl-sacsf-83, hs-ndssg-86, hss-pgcrm-87, ksss-tdmbb-86, klps-ujrcf-86, ks-eapcf-85, ls-esmpa-87, ls-pptmc-87, ls-ncfcc-87, l-smpag-86, l-dpppa-87, l-acirm-87, ls-ppspm-87, oy-rmpmd-85, osy-gvdl-86, osy-gvdl-87, o-lbml-85, ss-pmp1c-83, ss-mprga-86, ss-nempa-87, y-amp-87, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@incollection{ks-ampsc-90
, author =	"K. Kedem and Micha Sharir"
, title =	"An automatic motion planning system for a convex polygonal mobile robot in $2$-d polygonal space"
, editor =	"I. J. Cox and G. T. Wilfong"
, booktitle =	"Autonomous Robot Vehicles"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1990
, pages =	"349--362"
, keywords =	"motion planning, robotics, implementing algorithms"
, succeeds =	"ks-ampsc-88"
, update =	"98.03 mitchell"
}

@inproceedings{ks-eapcf-85
, author =	"K. Kedem and Micha Sharir"
, title =	"An efficient algorithm for planning collision-free translational motion of a convex polygonal object in $2$-dimensional space amidst polygonal obstacles"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"75--80"
, keywords =	"motion planning, convex objects, two-dimensional"
, precedes =	"ks-empac-90"
, cites =	"b-egc-66, bo-arcgi-79, gk-shfmp-70, grs-kfcg-83, k-osps-83, ls-esmpa-84, lw-apcfp-79, np-psaig-82, oy-rmpmd-85, osy-gvdl1-84, osy-gvdl2-84, oww-fabmo-82, ss-pmp1c-83, ss-spps-86, w-cvgnl-84, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
}

@article{ks-empac-90
, author =	"K. Kedem and Micha Sharir"
, title =	"An efficient motion planning algorithm for a convex rigid polygonal object in $2$-dimensional polygonal space"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"43--75"
, keywords =	"motion planning, convex objects, Davenport-Schinzel sequences, two-dimensional"
, succeeds =	"ks-eapcf-85"
, update =	"98.03 mitchell"
}

@techreport{kst-coksm-93t
, author =	"K. Kedem and Micha Sharir and S. Toledo"
, title =	"On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
, number =	"273/93"
, institution =	"Department of Computer Science, Tel-Aviv University"
, year =	1993
, precedes =	"kst-coksm-93i"
, update =	"98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell, 93.05 orourke"
, annote =	"Fixes bug in Kedem-Sharir algorithm"
}

@inproceedings{kst-coksm-93i
, author =	"K. Kedem and Micha Sharir and S. Toledo"
, title =	"On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"204--209"
, succeeds =	"kst-coksm-93t"
, precedes =	"kst-coksm-97"
, update =	"98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell"
}

@article{kst-coksm-97
, author =	"K. Kedem and Micha Sharir and S. Toledo"
, title =	"On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	17
, year =	1997
, pages =	"227--240"
, succeeds =	"kst-coksm-93i"
, update =	"98.03 mitchell, 97.07 devillers"
}

@inproceedings{ky-cbsmu-96
, author =	"Klara Kedem and Yana Yarmovski"
, title =	"Curve Based Stereo Matching Using the Minimum {Hausdorff} Distance"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C15--C18"
, cites =	"af-ersmg-87, a-avmrs-91, ct-lsm3d-93, hkr-ciuhd-93, hks-uevsi-93, sp-simc-90, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{ksd-ttute-92
, author =	"S. S. Keerthi and N. K. Sancheti and A. Dattasharma"
, title =	"Transversality Theorem: A Useful Tool for Establishing Genericity"
, booktitle =	"Proc. IEEE Conf. on Decision and Control"
, year =	1992
, update =	"98.11 bibrelex"
}

@inproceedings{ks-micco-91
, author =	"S. Sathiya Keerthi and K. Sridharan"
, title =	"Measures of intensity of collision between convex objects and their efficient computation"
, booktitle =	"Proceedings of the International Symposium on Intelligent Robotics, Bangalore, India"
, month =	jan
, year =	1991
, pages =	"266--275"
, update =	"98.07 bibrelex"
}

@inproceedings{ks-cdctd-91
, author =	"S. S. Keerthi and K. Sridharan"
, title =	"On computing depth of collision in two dimensions"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"19--25"
, cites =	"gpwz-eaes-91, bhh-fgavt-81, dk-ladsc-85, gjk-fpcdb-88, cc-dmtdb-86, bl-pmcpp-85, ds-splif-90, grs-kfcg-83, l-spcsa-83, cd-icott-87, r-ca-70, k-smsm-55, cg-vippg-85, ks-micco-91, ZZZ"
, update =	"98.07 bibrelex"
}

@article{ds-splif-90
, author =	"S. S. Keerthi and K. Sridharan"
, title =	"Solution of parametrized linear inequalities by Fourier Elimination and its applications"
, journal =	"J. Optim. Theory Appl."
, volume =	65
, month =	apr
, year =	1990
, update =	"98.07 bibrelex"
}

@article{kf-fsr3d-88
, author =	"N. Kehtarnavaz and R. J. P. de Figueiredo"
, title =	"A framework for surface reconstruction from $3$-d contours"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	42
, year =	1988
, pages =	"32--47"
, update =	"98.03 bibrelex"
}

@article{ksf-sstsr-88
, author =	"N. Kehtarnavaz and L. R. Simar and R. J. P. de Figueiredo"
, title =	"Syntactic/Semantic Technique For Surface Reconstruction From Cross- Sectional Contours"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	42
, number =	3
, month =	jun
, year =	1988
, pages =	"399--409"
, keywords =	"syntactic/semantic technique, surface reconstruction, cross-sectional contours, weighted levenshtein graph"
, annote =	"Breaks contours into ``syntactic'' components, matches
		 and triangulates between each piece."
, abstract =	"Surface reconstruction from cross-sectional contours
		 has become increasingly important in medicine. In this
		 paper, a surface reconstruction technique has been
		 developed to improve the conventional triangulation
		 techniques by taking into account local shape
		 characteristics of the surface being reconstructed. The
		 technique involves a syntactic/semantic contour
		 representation which allows a similarity relation,
		 based on the weighted Levenshtein graph, to be
		 established between adjacent contours. This similarity
		 relation is then employed as a guide to form the
		 surface by triangulating similar substructures. (Author
		 abstract) 11 refs."
}

@inproceedings{k-aceg-88
, author =	"J. M. Keil"
, title =	"Approximating the complete {Euclidean} graph"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"208--213"
, keywords =	"geometric graphs, path planning"
}

@mastersthesis{k-cgig-80
, author =	"J. M. Keil"
, title =	"Computational geometry on the integer grid"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Comput. Sci., Univ. British Columbia"
, address =	"Vancouver, BC"
, year =	1980
, keywords =	"master thesis, priority search trees, bucketing, design of algorithms, data structuring, sorting, convex hull, intersection"
, precedes =	"kk-cgig-81"
}

@article{k-copnp-97
, author =	"J. M. Keil"
, title =	"Covering Orthogonal Polygons with Non-Piercing Rectangles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"473--484"
, update =	"98.11 devillers"
}

@article{k-dpsc-85
, author =	"J. M. Keil"
, title =	"Decomposing a polygon into simpler components"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"799--817"
, keywords =	"dynamic programming, convex, polygons, star-shaped, partition, decomposition"
}

@phdthesis{k-dpsc-83
, author =	"J. M. Keil"
, title =	"Decomposing Polygons into Simpler Components"
, school =	"Dept. Comput. Sci., Univ. Toronto"
, address =	"Toronto, ON"
, year =	1983
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{k-mchco-86
, author =	"J. M. Keil"
, title =	"Minimally covering a horizontally convex orthogonal polygon"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"43--51"
, keywords =	"covering, polygons, convex, star-shaped"
, cites =	"a-agpiv-84, acyb-idcat-80, cd-dpicp-79, c-cgc-79, eow-sgrag-84, fk-acrri-84, g-dpcp-83, g-dpcp-83, kkk-tgrfw-83, k-dpsc-83, k-dpsc-85, ks-mdpo-85, l-pnrh-82, lllmp-tddo2-79, mw-sprag-84, m-snpcs-79, mf-diasp-82, ostt-mprr-83, o-aprag-83, os-snhpd-83, s-oadrp-82, s-rcg-84, sl-tssp-80, ZZZ"
, update =	"97.11 bibrelex"
}

@incollection{k-pd-00
, author =	"J. Mark Keil"
, title =	"Polygon Decomposition"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"491--518"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 11 of su-hcg-00"
}

@proceedings{k-p6ccc-94
, title =	"Proc. 6th Canad. Conf. Comput. Geom."
, editor =	"J. Mark Keil"
, publisher =	"Dept. Comput. Sci., Univ. Saskatchewan"
, address =	"Saskatoon, SK"
, month =	aug
, year =	1994
, comments =	"C\$40 cheque or money order payable to Univ. Saskatchewan, includes postage"
, update =	"95.01 smid, 94.09 jones"
}

@article{kg-cgwac-92
, author =	"J. M. Keil and C. A. Gutwin"
, title =	"Classes of graphs which approximate the complete {Euclidean} graph"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"13--28"
}

@inproceedings{kg-dtcac-89
, author =	"J. M. Keil and C. A. Gutwin"
, title =	"The {Delaunay} triangulation closely approximates the complete {Euclidean} graph"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"47--56"
, keywords =	"geometric graphs, Delaunay triangulations"
}

@inproceedings{kk-cgig-81
, author =	"J. M. Keil and D. G. Kirkpatrick"
, title =	"Computational geometry on the integer grid"
, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
, year =	1981
, pages =	"41--50"
, keywords =	"priority search trees, bucketing, design of algorithms, data structuring, sorting, convex hull, intersection"
, succeeds =	"k-cgig-80"
}

@incollection{ks-mdpo-85
, author =	"J. M. Keil and J.-R. Sack"
, title =	"Minimum decompositions of polygonal objects"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"197--216"
, keywords =	"survey paper, convex, polygons, star-shaped, partition, decomposition, covering"
}

@unpublished{kt-dcicc-91u
, author =	"J. Mark Keil and Godfried T. Toussaint"
, title =	"Detecting and computing intersections of convex chains"
, year =	1991
, note =	"manuscript in preparation"
, succeeds =	"kt-dcicc-91i"
, update =	"98.07 bibrelex"
}

@techreport{k-sades-91t
, author =	"M. Keil"
, title =	"A simple algorithm for determining the envelope of a set of lines"
, type =	"Technical {Report}"
, number =	"91-1"
, institution =	"University of Saskatchewan"
, year =	1991
, update =	"98.07 mitchell, 97.11 bibrelex"
}

@article{k-sades-91a
, author =	"M. Keil"
, title =	"A simple algorithm for determining the envelope of a set of lines"
, journal =	"Inform. Process. Lett."
, volume =	39
, year =	1991
, pages =	"121--124"
, update =	"98.07 bibrelex, 95.01 smid"
}

@article{k-csmwt-94
, author =	"M. Keil"
, title =	"Computing a subgraph of the minimum weight triangulation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"13--26"
, update =	"96.09 devillers"
}

@article{kmw-vsdfs-00
, author =	"M. Keil and D. M. Mount and S. K. Wismath"
, title =	"Visibility stabs and depth-first spiralling on line segments in output sensitive time"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"535--552"
, update =	"01.04 smid"
}

@inproceedings{kt-dcicc-91i
, author =	"M. Keil and G. Toussaint"
, title =	"Detecting and computing intersections of convex chains"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"7--10"
, update =	"98.07 bibrelex"
}

@inproceedings{kw-cvpes-92
, author =	"M. Keil and S. Wismath"
, title =	"Computing the visibility polygons of the endpoints of a set of line segments in output sensitive time"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"39--45"
, cites =	"aaghi-vdp-86, c-tsplt-91a, h-fvgsp-87, gm-osacv-87, ow-nmcvg-88, v-dmvg-91, w-cvgnl-85, w-cfvgs-92, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{km-psptv-84
, author =	"D. M. Keirsey and Joseph S. B. Mitchell"
, title =	"Planning Strategic Paths Through Variable Terrain Data"
, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
, volume =	485
, year =	1984
, pages =	"172--179"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{kmpp-mppav-84
, author =	"D. M. Keirsey and Joseph S. B. Mitchell and D. W. Payton and E. P. Preyss"
, title =	"Multilevel Path Planning for Autonomous Vehicles"
, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
, volume =	485
, year =	1984
, pages =	"133--137"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@article{k-mcp-93
, author =	"T. Keleti"
, title =	"The Mountain Climbers' Problem"
, journal =	"Proc. Amer. Math. Soc."
, volume =	117
, number =	1
, year =	1993
, pages =	"89--97"
}

@article{k-facp-85
, author =	"W. Keller-Gehrig"
, title =	"Fast algorithms for the characteristic polynomial"
, journal =	"Theoret. Comput. Sci."
, volume =	36
, year =	1985
, pages =	"309--317"
, update =	"97.11 bibrelex"
}

@book{kn-lts-63
, author =	"J. L. Kelley and I. Namioka"
, title =	"Linear Topological Spaces"
, publisher =	"Van Nostrand"
, address =	"Princeton, NJ"
, year =	1963
, update =	"97.11 bibrelex"
}

@book{kn-lts-76
, author =	"J. L. Kelley and I. Namioka"
, title =	"Linear Topological Spaces"
, publisher =	"Springer-Verlag"
, year =	1976
, update =	"98.07 bibrelex"
}

@article{k-fpos-87
, author =	"D. Kelly"
, title =	"Fundamentals of Planar Ordered Sets"
, journal =	"Discrete Math."
, volume =	63
, year =	1987
, pages =	"197--216"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{k-3ipos-77
, author =	"D. Kelly"
, title =	"The 3-irreducible partially ordred sets"
, journal =	"Canad. J. Math."
, volume =	24
, number =	2
, year =	1977
, pages =	"367--383"
, update =	"98.11 bibrelex"
}

@article{kr-pl-75
, author =	"D. Kelly and I. Rival"
, title =	"Planar Lattices"
, journal =	"Canad. J. Math."
, volume =	27
, number =	3
, year =	1975
, pages =	"636--665"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{k-srrlp-81
, author =	"D. G. Kelly"
, title =	"Some results on random linear programs"
, journal =	"Methods of Operations Research"
, volume =	40
, year =	1981
, pages =	"351--355"
, update =	"97.03 gaertner+salinger"
}

@article{km-noldn-58
, author =	"L. Kelly and W. Moser"
, title =	"On the number of ordinary lines determined by $n$ points"
, journal =	"Canad. J. Math."
, volume =	10
, year =	1958
, pages =	"210--219"
, update =	"98.03 devillers"
}

@article{k-rsgpj-86
, author =	"L. M. Kelly"
, title =	"A resolution of the {Sylvester}-{Gallai} problem of {J.-P. Serre}"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"101--104"
}

@book{kw-gcsmm-79
, author =	"P. Kelly and M. Weiss"
, title =	"Geometry and Convexity: {A} Study in Mathematical Methods"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1979
, update =	"99.11 bibrelex"
}

@Article{k-dfcosubm-09,
  author =       {Michael Kerber},
  title =        {Division-Free Computation of Subresultants Using Bezout Matrices},
  journal =      {International Journal of Computer Mathematics},
  year =         2009,
  note =         {in print; a technical report with the same name appeared as MPI-I-2006-1-006, Saabr\"ucken, Germany}
}

@book{k-hdsl-1877
, author =	"Alfred Bray Kempe"
, title =	"How to Draw a Straight Line; a Lecture on Linkages"
, publisher =	"Macmillan \& co."
, year =	1877
, location =	"London"
, update =	"02.03 orourke"
}

@article{k-gmdpc-1876
, author =	"Alfred Bray Kempe"
, title =	"On a general method of describing plane curves of the nth degree by linkwork"
, journal =	"Proc. London Math. Soc."
, volume =	7
, year =	1876
, pages =	"213--216"
, update =	"02.03 orourke"
}

@book{km-gp-63
, author =	"N. G. Kendall and P. A. P. Moran"
, title =	"Geometrical Probability"
, publisher =	"Hafner"
, address =	"New York, NY"
, year =	1963
}

@book{k-eag-77
, author =	"K. Kendig"
, title =	"Elementary Algebraic Geometry"
, publisher =	"Springer-Verlag"
, year =	1977
, update =	"98.03 bibrelex"
}

@article{khh-eeuap-89
, author =	"N. C. Kenkel and W. D. Hoskins and J. A. Hoskins"
, title =	"Edge Effects in the Use of Area Polygons to Study Competition"
, journal =	"Ecology"
, volume =	70
, number =	1
, year =	1989
, pages =	"272--274"
, annote =	"Points out that if we take sample of points contained
		 some region, and calculate the Voronoi polygons, then
		 to avoid edge effects it is necessary to exclude the
		 polygons which potentially could be made smaller by
		 points outside the region. (These are not necessarily
		 adjacent to the boundary.) Simulation shows that for
		 500 points in a square 0.77 of the polygons can be
		 kept."
}

@inproceedings{kk-htsc-91
, author =	"C. Kenyon and R. Kenyon"
, title =	"How to take short cuts"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"250--255"
, cites =	"j-rstsp-90, ZZZ"
, update =	"97.11 bibrelex"
}

@article{kk-htsc-92
, author =	"C. Kenyon and R. Kenyon"
, title =	"How To Take Short Cuts"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"251--264"
, update =	"99.07 smid"
}

@inproceedings{kk-tpr-92
, author =	"C. Kenyon and R. Kenyon"
, title =	"Tiling a polygon with rectangles"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"610--619"
}

@techreport{kt-rduf-??
, author =	"C. Kenyon and W. P. Thurston"
, title =	"Rotation distance using flows"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
, update =	"97.11 bibrelex"
}

@inproceedings{kv-mqshl-88
, author =	"C. M. Kenyon and J. S. Vitter"
, title =	"Maximum queue size and hashing with lazy deletion"
, booktitle =	"Proceedings of the 20th Annual Symposium on the Interface of Computing Science and Statistics"
, site =	"Reston, VA"
, year =	1988
, pages =	"743--748"
, precedes =	"kv-mqshl-91"
, update =	"94.09 vitter"
}

@article{kv-mqshl-91
, author =	"C. M. Kenyon and J. S. Vitter"
, title =	"Maximum queue size and hashing with lazy deletion"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"597--619"
, succeeds =	"kv-mqshl-88"
, update =	"94.09 vitter"
}

@inproceedings{kv-gmams-89
, author =	"C. M. Kenyon-Mathieu and J. S. Vitter"
, title =	"General methods for the analysis of the maximum size of dynamic data structures"
, booktitle =	"Proc. 16th Internat. Colloq. Automata Lang. Program."
, nickname =	"ICALP '89"
, series =	"Lecture Notes Comput. Sci."
, volume =	372
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"473--487"
, precedes =	"kv-gmams-91"
, update =	"94.09 vitter"
}

@article{kv-gmams-91
, author =	"C. M. Kenyon-Mathieu and J. S. Vitter"
, title =	"General methods for the analysis of the maximum size of dynamic data structures"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"807--823"
, succeeds =	"kv-gmams-89"
, update =	"94.09 vitter"
}

@article{k-acstc-75
, author =	"E. Keppel"
, title =	"Approximating complex surfaces by triangulation of contour lines"
, journal =	"IBM J. Res. Develop."
, volume =	19
, year =	1975
, pages =	"2--11"
, update =	"98.03 bibrelex"
}

@article{kw-2dfpi-90
, author =	"J. P. Kermode and D. Weaire"
, title =	"2{D}-Froth --- {A} Program for the Investigation of 2-Dimensional Froths"
, journal =	"Computer Physics Communications"
, volume =	60
, number =	1
, year =	1990
, pages =	"75--109"
, update =	"94.09 lambert"
, annote =	"Basic circumcircle algorithm for DT and get VD from
		 that."
}

@article{kw-pacls-90
, author =	"W. Kern and A. Wanka"
, title =	"On a problem about covering lines by squares"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"77--82"
}

@article{kl-ehppg-70
, author =	"B. W. Kernighan and S. Lin"
, title =	"An efficient heuristic procedure for partitioning graphs"
, journal =	"Bell Syst. Tech. J."
, volume =	49
, number =	2
, year =	1970
, pages =	"291--307"
, update =	"98.03 bibrelex"
}

@techreport{ke-loqt-79
, author =	"M. L. Kersten and P. van {Emde Boas}"
, title =	"Local optimizations of quad trees"
, type =	"Report"
, number =	"IR-51"
, institution =	"Univ. Amsterdam"
, address =	"Amsterdam, Netherlands"
, year =	1979
, update =	"93.09 rote"
}

@article{ks-rgrf-81
, author =	"J. Ketonen and R. Solovay"
, title =	"Rapidly growing {R}amsey functions"
, journal =	"Annals of Math."
, volume =	113
, year =	1981
, pages =	"267--314"
, update =	"95.09 agarwal"
}

@inproceedings{k-cebpv-00
, author =	"Lutz Kettner"
, title =	"Contour-Edge Based Polyhedron Visualization"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"77--80"
, update =	"00.03 bibrelex"
}

@inproceedings{k-ddsps-98
, author =	"L. Kettner"
, title =	"Designing a data structure for polyhedral surfaces"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"146--154"
, update =	"99.03 devillers"
}

@article{k-ugpdd-99
, author =	"L. Kettner"
, title =	"Using generic programming for designing a data structure for polyhedral surfaces"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"65--90"
, update =	"00.03 smid"
}

@inproceedings{kmsst-bdptp-01
, author =	"Lutz Kettner and Andrea Mantler and Jack Snoeyink and Bettina Speckmann and Fumihiko Takeuchi"
, title =	"Bounded-Degree Pseudo-Triangulations of Points"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"19--22"
, update =	"01.04 icking"
}

@inproceedings{kkm-sabrg-97
, author =	"J. Keyser and S. Krishnan and D. Manocha"
, title =	"Efficient and Accurate {B}-rep Generation of Low Degree Sculptured Solids using Exact Arithmetic"
, booktitle =	"Proceedings of ACM Solid Modeling"
, year =	1997
, note =	"To appear"
, update =	"98.03 agarwal"
}

@techreport{kkm-ebrgl-96
, author =	"J. Keyser and S. Krishnan and D. Manocha"
, title =	"Efficient {B}-rep generation of low degree sculptured solids using exact arithmetic"
, type =	"Technical {Report}"
, number =	40
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, year =	1996
, update =	"98.07 bibrelex"
}

@techreport{k-cpvc-90
, author =	"L. Khachiyan"
, title =	"Complexity of polytope volume computation"
, type =	"Report"
, number =	"90-59"
, institution =	"DIMACS, Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1990
, keywords =	"approximation, volume, convex"
, precedes =	"k-cpvc-93"
, update =	"93.09 erickson"
}

@incollection{k-cpvc-93
, author =	"L. Khachiyan"
, title =	"Complexity of polytope volume computation"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"91--101"
, keywords =	"survey paper, approximation, volume, convex polytopes"
, succeeds =	"k-cpvc-90"
, update =	"93.09 erickson"
}

@article{k-ivie-90
, author =	"L. G. Khachiyan"
, title =	"An inequality for the volume of inscribed ellipsoids"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"219--222"
}

@article{k-palp-80
, author =	"L. G. Khachiyan"
, title =	"Polynomial algorithm in linear programming"
, journal =	"U.S.S.R. Comput. Math. and Math. Phys."
, volume =	20
, year =	1980
, pages =	"53--72"
, update =	"95.09 devillers"
}

@techreport{kmy-aalcs-95
, author =	"S. Khanna and R. Motwani and F. F. Yao"
, title =	"Approximation algorithms for the largest common subtree problem"
, type =	"Technical {Report}"
, number =	"STAN-CS-95-1545"
, institution =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, year =	1995
, update =	"98.07 bibrelex"
}

@inproceedings{kmp-artp-98
, author =	"Sanjeev Khanna and S. Muthukrishnan and Mike Paterson"
, title =	"On Approximating Rectangle Tiling and Packing"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"384--393"
, update =	"99.07 bibrelex, 98.07 mitchell"
}

@article{k-rtoam-85
, author =	"O. Khatib"
, title =	"Real-time obstacle avoidance for manipulators and mobile robots"
, journal =	"Internat. J. Robot. Res."
, volume =	5
, year =	1985
, pages =	"90--98"
, update =	"95.05 agarwal"
}

@book{k-f-91
, author =	"A. G. Khovanski\u{\i}"
, title =	"Fewnomials"
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1991
, update =	"98.03 agarwal"
}

@inproceedings{km-srsac-91
, author =	"S. Khuller and Y. Matias"
, title =	"A simple randomized sieve algorithm for the closest-pair problem"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"130--134"
, precedes =	"km-srsac-95"
, cites =	"b-mdc-80, b-lbact-83, bs-dcms-76, c-faann-83, clr-ia-90, fks-sstwc-84, hns-psscp-88, m-iaca-89, ps-cgi-85, r-pa-76, sh-cpp-75, v-oaann-89, ZZZ"
, update =	"98.07 bibrelex, 95.09 smid"
}

@article{km-srsac-95
, author =	"S. Khuller and Y. Matias"
, title =	"A simple randomized sieve algorithm for the closest-pair problem"
, journal =	"Inform. Comput."
, volume =	118
, year =	1995
, pages =	"34--37"
, succeeds =	"km-srsac-91"
, update =	"95.09 smid"
}

@article{km-tcp-90
, author =	"S. Khuller and Joseph S. B. Mitchell"
, title =	"On a triangle counting problem"
, journal =	"Inform. Process. Lett."
, volume =	33
, number =	6
, year =	1990
, pages =	"319--321"
, keywords =	"range query, counting"
, update =	"98.03 mitchell"
}

@article{kry-ldsts-96
, author =	"S. Khuller and B. Raghavachari and N. Young"
, title =	"Low-degree spanning trees of small weight"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"355--368"
, update =	"96.05 smid"
}

@inproceedings{ks-ckcp-96
, author =	"S. Khuller and Y. J. Sussmann"
, title =	"The capacitated $k$-center problem"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"152--166"
, update =	"98.07 agarwal"
}

@article{k-rf23d-66
, author =	"T. Kiang"
, title =	"Random fragmentation in $2$ and $3$ dimensions"
, journal =	"Z. Astrophys."
, volume =	64
, year =	1966
, pages =	"433--439"
}

@inproceedings{k-smsm-55
, author =	"J. Kiefer"
, title =	"Sequential minimax search for a maximum"
, booktitle =	"Proc. Amer. Math. Soc."
, volume =	4
, year =	1955
, pages =	"502--506"
, update =	"98.07 bibrelex"
}

@article{kt-eprc-81
, author =	"H. A. Kierstead and W. T. Trotter"
, title =	"An extremal problem in recursive combinatorics"
, journal =	"Congr. Numer."
, volume =	33
, year =	1981
, pages =	"143--153"
, update =	"98.07 bibrelex"
}

@article{k-dcscp-82
, author =	"C. Kim"
, title =	"Digital convexity, straightness, and convex polygons"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-4"
, year =	1982
, pages =	"618--626"
, update =	"98.07 bibrelex"
}

@techreport{k-ltcha-80
, author =	"C. E. Kim"
, title =	"A linear time convex hull algorithm for simple polygons"
, type =	"Report"
, number =	"TR-956"
, institution =	"Univ. Maryland, Dept. Comput. Sci."
, address =	"Baltimore, MD"
, year =	1980
}

@article{ka-dd-84
, author =	"C. E. Kim and T. Anderson"
, title =	"Digital disks"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-6"
, number =	5
, year =	1984
, pages =	"639--645"
, succeeds =	"ka-dddcm-84"
}

@inproceedings{ka-dddcm-84
, author =	"C. E. Kim and T. Anderson"
, title =	"Digital disks and a digital compactness measure"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"117--124"
, precedes =	"ka-dd-84"
}

@article{kr-dslcd-82
, author =	"C. E. Kim and A. Rosenfeld"
, title =	"Digital straight lines and convexity of digital regions"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-4"
, year =	1982
, pages =	"149--153"
, succeeds =	"kr-dsc-81"
}

@inproceedings{kr-dsc-81
, author =	"C. E. Kim and A. Rosenfeld"
, title =	"Digital straightness and convexity"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
, year =	1981
, pages =	"80--89"
, precedes =	"kr-dslcd-82"
}

@inproceedings{kr-cdr-80
, author =	"C. E. Kim and A. Rosenfeld"
, title =	"On the convexity of digital regions"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
, year =	1980
, pages =	"1010--1015"
}

@inproceedings{kgs-fcdmm-97
, author =	"D. Kim and L. J. Guibas and S. Shin"
, title =	"Fast collision detection among multiple moving spheres"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"373--375"
, cites =	"b-cscnp-90, bgh-dsmd-97, fls-flp-63, glm-othsr-96, h-rarb-88, ho-smhsr-94, h-apstc-96, l-mmbc-66, m-pbpsm-96, mw-cdrca-88, ob-dtdos-79, r-pstmc-83, r-fhsdb-87, s-parud-90, st-smops-92, t-icdmg-90, hafg-ecpmm-95, wg-udbvh-92, wl-arrcd-85, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@article{khp-rvdsp-95
, author =	"D. S. Kim and I. K. Hwang and B. J. Park"
, title =	"Representing the {Voronoi} Diagram of a Simple Polygon Using Rational Quadratic Bezi\'er Curves"
, journal =	"Comput. Aided Design"
, volume =	27
, number =	8
, month =	aug
, year =	1995
, pages =	"605--614"
, update =	"97.11 held"
}

@article{ksc-easdv-95
, author =	"S. H. Kim and S. Y. Shin and K. Y. Chwa"
, title =	"Efficient algorithms for solving diagonal visibility problems in a simple polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"433--458"
, keywords =	"visibility, polygon, weak visibility, guard diagonal"
, update =	"96.09 devillers"
}

@techreport{k-pafmc-89
, author =	"S. K. Kim"
, title =	"A parallel algorithm for finding a maximum clique of a set of circular-arcs of a circle"
, institution =	"Univ. Washington"
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{k-saoud-95
, author =	"Sung Kwon Kim"
, title =	"Simple Algorithms for Orthogonal Upward Drawings of Binary and Ternary Trees"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"115--120"
, update =	"95.09 jones"
}

@techreport{ks-cobbt-99
, author =	"S. K. Kim and C. S. Shin"
, title =	"Computing the optimal bridge between two polygons"
, type =	"Research Report {TCSC-99-14}"
, institution =	"HKUST"
, year =	1999
, precedes =	"ks-cobbt-01"
, update =	"02.03 cheong"
}

@article{ks-cobbt-01
, author =	"S. K. Kim and C.-S. Shin"
, title =	"Computing the optimal bridge between two polygons"
, journal =	"Theory of Computing Systems"
, volume =	34
, year =	2001
, pages =	"337--354"
, succeeds =	"ks-cobbt-99"
, update =	"02.03 cheong"
}

@article{ksy-lrmsl-01
, author =	"S. K. Kim and C.-S. Shin and T.-C. Yang"
, title =	"Labeling a rectilinear map with sliding labels"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"167--179"
, update =	"01.07 smid"
}

@article{ksy-ptdcp-00
, author =	"S. K. Kim and C.-S. Shin and T.-C. Yang"
, title =	"Placing two disks in a convex polygon"
, journal =	"Inform. Process. Lett."
, volume =	73
, year =	2000
, pages =	"33--39"
, update =	"01.07 smid"
}

@article{ka-rpcsm-86
, author =	"Y. Kim and J. Aggarwal"
, title =	"Rectangular parallelepiped coding for solid modeling"
, journal =	"Internat. J. Robot. Autom."
, volume =	"??"
, year =	1986
, pages =	"77--85"
, update =	"98.11 bibrelex"
}

@inproceedings{klrz-rvcdg-95
, author =	"D. Kimelman and B. Leban and T. Roth and D. Zernik"
, title =	"Reduction of Visual Complexity in Dynamic Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"218--225"
, keywords =	"graph drawing, software visualization, system"
, update =	"95.01 tamassia"
}

@inproceedings{ks-pviac-92
, author =	"D. Kimelman and G. Sangudi"
, title =	"Program Visualization by Integration of Advanced Compiler Technology with Configurable Views"
, editor =	"J. J. Dongarra and B. Tourancheau"
, booktitle =	"Proc. CNRS-NSF Collaboration Workshop on Environments and Tools for Parallel Scientific Computing, Saint Hilaire du Touvert, France"
, publisher =	"Elsevier Science"
, year =	"September, 1992"
, pages =	"73--84"
, keywords =	"graph drawing"
, update =	"96.09 tamassia, 96.04 garg"
}

@techreport{kab-fspgs-93
, author =	"R. Kimmel and A. Amir and A. M. Bruckstein"
, title =	"Finding shortest paths on graph surfaces"
, number =	"CIS 9301"
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, month =	jan
, year =	1993
, update =	"93.09 milone+mitchell"
}

@techreport{kb-sols-92
, author =	"R. Kimmel and A. M. Bruckstein"
, title =	"Shape offsets via level sets"
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, month =	jul
, year =	1992
, update =	"93.09 milone+mitchell"
}

@article{kb-sols-93
, author =	"R. Kimmel and A. M. Bruckstein"
, title =	"Shape Offsets via Level Sets"
, journal =	"Comput. Aided Design"
, volume =	25
, number =	3
, month =	mar
, year =	1993
, pages =	"154--162"
, update =	"93.09 held"
}

@techreport{kb-spdmw-93
, author =	"R. Kimmel and A. M. Bruckstein"
, title =	"Sub-pixel distance maps and weighted distance transforms"
, number =	"CIS 9314"
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, month =	apr
, year =	1993
, update =	"93.09 milone+mitchell"
}

@techreport{ks-stdct-93
, author =	"R. Kimmel and G. Sapiro"
, title =	"Shortening three dimensional curves via two dimensional flows"
, number =	"CIS 9315"
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, month =	apr
, year =	1993
, update =	"93.09 milone+mitchell"
}

@inproceedings{ks-fvdts-00
, author =	"R. Kimmel and J. A. Sethian"
, title =	"Fast {Voronoi} Diagrams on Triangulated Surfaces"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"1--4"
, update =	"00.03 bibrelex"
}

@article{k-opcbf-95
, author =	"J. Kincses"
, title =	"On polytopes cut by flats"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"287--294"
, update =	"96.05 pascucci"
}

@techreport{ksr-sawrp1-91
, author =	"M. Kindl and M. Shing and N. Rowe"
, title =	"A stochastic approach to the weighted-region problem, {I}: The design of the path annealing algorithm"
, institution =	"Computer Science, U.S. Naval Postgraduate School"
, address =	"Monterey, CA"
, year =	1991
}

@techreport{ksr-sawrp2-91
, author =	"M. Kindl and M. Shing and N. Rowe"
, title =	"A stochastic approach to the weighted-region problem, {II}: Performance enhancement techniques and experimental results"
, institution =	"Computer Science, U.S. Naval Postgraduate School"
, address =	"Monterey, CA"
, year =	1991
}

@inproceedings{krt-fdmfa-92
, author =	"V. King and S. Rao and R. E. Tarjan"
, title =	"A faster deterministic maximum flow algorithm"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"157--164"
, update =	"97.11 bibrelex"
}

@book{k-ts-93
, author =	"C. Kinsey"
, title =	"Topology of Surfaces"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1993
, update =	"98.07 bibrelex"
}

@inproceedings{k-pldt-97
, author =	"Rob Kirby"
, title =	"Problems in Low-Dimensional Topology"
, booktitle =	"Geometric Topology: Proceedings of the 1993 Georgia International Topology Conference"
, site =	"Conference held on August 2--13, 1993 in Athens, Georgia."
, series =	"AMS/IP Studies in Advanced Mathematics"
, volume =	"2.2"
, publisher =	"American Mathematical Society and International Press"
, year =	1997
, pages =	"35--473"
, url = "http://www.math.berkeley.edu/~kirby/problems.ps.gz"
, update =	"02.03 orourke"
}

@incollection{ks-sbtat-77
, author =	"R. C. Kirby and L. C. Siebenmann"
, title =	"Some basic theorems about topological manifolds"
, booktitle =	"Foundational Essays on Topological Manifolds, Smoothings, and Triangulations"
, series =	"Ann. Math. Studies"
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1977
, pages =	"79--152"
, update =	"97.11 bibrelex"
}

@article{k-ta-03
, author =	"P. Kirchberger"
, title =	"{\"U}ber Tschebyschefsche Ann{\"a}herungsmethoden"
, journal =	"Math. Ann."
, volume =	57
, year =	1903
, pages =	"509--540"
, update =	"98.03 bibrelex"
}

@book{k-gg3-92
, title =	"Graphics Gems {III}"
, editor =	"David Kirk"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1992
, update =	"98.07 tamassia+vismara"
}

@article{kl-dmraa-70
, author =	"D. Kirk and L. Lim"
, title =	"A Dual-Mode Routing Algorithm for an Autonomous Roving Vehicle"
, journal =	"IEEE Trans. Aerosp. Electron. Syst."
, volume =	6
, number =	3
, year =	1970
, pages =	"290--294"
, comments =	"Oldest paper found on shortest paths among obstacles in the plane"
, update =	"96.09 devillers, 93.09 milone+mitchell"
}

@techreport{kkmy-qstam-89
, author =	"D. Kirkpatrick and S. Kosaraju and B. Mishra and C. Yap"
, title =	"Quantitative {Steinitz}'s theorems with applications to multifinger grasping"
, type =	"Technical {Report}"
, number =	460
, institution =	"New York University"
, address =	"New York, NY"
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{kmy-qstam-90
, author =	"D. Kirkpatrick and B. Mishra and C. K. Yap"
, title =	"Quantitative {Steinitz}'s theorems with applications to multifingered grasping"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"341--351"
, precedes =	"kmy-qstam-92"
}

@article{kmy-qstam-92
, author =	"D. Kirkpatrick and B. Mishra and C.-K. Yap"
, title =	"Quantitative {Steinitz}'s theorems with applications to multifingered grasping"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"295--318"
, succeeds =	"kmy-qstam-90"
}

@inproceedings{ks-cctws-95
, author =	"David Kirkpatrick and Jack Snoeyink"
, title =	"Computing Common Tangents Without a Separating Line"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"183--193"
, update =	"99.07 bibrelex, 98.11 bibrelex, 95.05 mitchell"
}

@inproceedings{ks-ccssb-93
, author =	"D. Kirkpatrick and J. Snoeyink"
, title =	"Computing constrained shortest segments: {Butterfly} wingspans in logarithmic time"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"163--168"
, cites =	"bt-cst-91a, bcetsu-csts-91, bet-cwb-91, dk-fdpi-83, e-cedbt-85, ghs-citds-91, ks-tpscv-93, ol-mcp-81, ps-cgi-85, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{ks-tpscf-95
, author =	"D. Kirkpatrick and J. Snoeyink"
, title =	"Tentative prune-and-search for computing fixed-points with applications to geometric computation"
, journal =	"Fundam. Inform."
, volume =	22
, year =	1995
, pages =	"353--370"
, update =	"96.09 smid"
}

@inproceedings{ks-tpscv-93
, author =	"D. Kirkpatrick and J. Snoeyink"
, title =	"Tentative prune-and-search for computing {Voronoi} vertices"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"133--142"
, cites =	"bet-cwb-91, c-oaitd-89t, dk-fdpi-83, dk-dsppu-90, e-cedbt-85, em-feptd-85, e-dtdlp-91, ghs-citds-91, km-accvd-91, k-osps-83, ls-pptmc-87, m-spai3-91, mks-avdpt-93, m-ddlpc-91i, ol-mcp-81, ps-cgi-85, y-oavds-87, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@inproceedings{kss-kcdsp-00
, author =	"David Kirkpatrick and Jack Snoeyink and Bettina Speckmann"
, title =	"Kinetic Collision Detection for Simple Polygons"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"322--330"
, update =	"00.11 jones"
}

@article{kw-dbrow-96
, author =	"D. Kirkpatrick and S. Wismath"
, title =	"Determining bar-representability for ordered weighted graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"99--122"
, update =	"97.07 devillers"
}

@article{k-ndot-80
, author =	"D. G. Kirkpatrick"
, title =	"A note on {Delaunay} and optimal triangulations"
, journal =	"Inform. Process. Lett."
, volume =	10
, number =	3
, year =	1980
, pages =	"127--128"
, keywords =	"triangulations, Delaunay triangulations, worst-case analysis"
, update =	"98.11 bibrelex"
}

@inproceedings{k-ubsir-80
, author =	"D. G. Kirkpatrick"
, title =	"An upper bound for sorting integers in restricted ranges"
, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
, year =	1980
, update =	"97.11 bibrelex"
}

@inproceedings{k-eccs-79
, author =	"D. G. Kirkpatrick"
, title =	"Efficient computation of continuous skeletons"
, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1979
, pages =	"18--27"
, keywords =	"design of algorithms, Voronoi diagrams, merging, generalized Voronoi diagrams, minimum spanning trees"
}

@inproceedings{k-eops-87
, author =	"D. G. Kirkpatrick"
, title =	"Establishing order in planar subdivisions"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"316--321"
, keywords =	"data structuring, construction, plane graph representation, subdivisions"
, precedes =	"k-eops-88"
, cites =	"ahu-daca-74, b-prcv-75, b-lbact-83, dl-ccvsp-79, egs-oplms-86, e-ga-79, f-slrpg-48, grs-kfcg-83, gs-pmgsc-83, ht-ept-74, k-osps-83, k-ss-73, lp-lppsi-77, lec-aptg-67, mp-fitcp-78, ps-dtram-80, ps-cgi-85, t-dfslg-72, tv-otats-86, ZZZ"
, update =	"98.03 bibrelex"
}

@article{k-eops-88
, author =	"D. G. Kirkpatrick"
, title =	"Establishing order in planar subdivisions"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"267--280"
, keywords =	"data structuring, construction, plane graph representation, subdivisions"
, succeeds =	"k-eops-87"
}

@inproceedings{k-alcmw-89
, author =	"D. G. Kirkpatrick"
, title =	"On the absence of local characterizations of minimum weight triangulations"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	16
}

@techreport{k-osps-81
, author =	"D. G. Kirkpatrick"
, title =	"Optimal Search in Planar Subdivisions"
, type =	"Technical {Report}"
, number =	"81-13"
, institution =	"Dept. Comput. Sci., Univ. British Columbia"
, address =	"Vancouver, BC"
, year =	1981
, update =	"97.11 bibrelex"
}

@article{k-osps-83
, author =	"D. G. Kirkpatrick"
, title =	"Optimal search in planar subdivisions"
, journal =	"SIAM J. Comput."
, volume =	12
, number =	1
, year =	1983
, pages =	"28--35"
, keywords =	"data structuring, searching, subdivisions, plane graph representation, hierarchical representations"
, update =	"98.07 bibrelex+tamassia"
}

@techreport{kkt-ptots-90t
, author =	"D. G. Kirkpatrick and M. M. Klawe and R. E. Tarjan"
, title =	"Polygon triangulation in {$O(n \log\log n)$} time with simple data structures"
, type =	"Technical {Report}"
, number =	"90-17"
, institution =	"Dept. Comput. Sci., Univ. British Columbia"
, address =	"Vancouver, BC"
, month =	jun
, year =	1990
, precedes =	"kkt-ptots-90i"
}

@inproceedings{kkt-ptots-90i
, author =	"D. G. Kirkpatrick and M. M. Klawe and R. E. Tarjan"
, title =	"Polygon triangulation in {$O(n \log\log n)$} time with simple data structures"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"34--43"
, succeeds =	"kkt-ptots-90t"
, cites =	"bt-ladts-86, c-tpca-82, ci-tsc-84, c-ept-90, ctv-flvat-88i, egs-oplms-86, ffr-pscaa-83, fm-tspep-84, fntv-sltjs-88, ghlst-ltavs-87, gjpt-tsp-78, hm-ftsp-83, hmrt-sjslt-86, kk-cgig-81, k-osps-83, l-srvdd-81, ltl-mpsrp-89, tv-otats-88, t-prgc-80, t-cgm-86, t-ocspt-88, t-cm-88, ta-chapi-82, ZZZ"
, update =	"97.11 bibrelex"
}

@incollection{kr-fcm-85
, author =	"D. G. Kirkpatrick and J. D. Radke"
, title =	"A framework for computational morphology"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"217--248"
, keywords =	"design of algorithms, construction, pattern recognition, shape"
}

@inproceedings{ks-ossaf-85
, author =	"D. G. Kirkpatrick and R. Seidel"
, title =	"Output-size sensitive algorithms for finding maximal vectors"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"89--96"
, keywords =	"domination, divide-and-conquer, output dependent"
, cites =	"ahu-daca-74, b-lbact-83, bs-dclet-78, bkst-anmsv-78, gbt-srtgp-84, ks-upcha-82t, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{ks-upcha-82
, author =	"D. G. Kirkpatrick and R. Seidel"
, title =	"The Ultimate Planar Convex Hull Algorithm?"
, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
, site =	"Monticello, Illinois"
, year =	1982
, pages =	"35--42"
, precedes =	"ks-upcha-86"
, update =	"94.05 grigni, 93.09 held"
}

@article{ks-upcha-86
, author =	"D. G. Kirkpatrick and R. Seidel"
, title =	"The ultimate planar convex hull algorithm?"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"287--299"
, keywords =	"designing algorithms, convex hull, two-dimensional, divide-and-conquer, output-dependent, lower bounds, linear programming"
, succeeds =	"ks-upcha-82"
, update =	"94.05 grigni"
, annote =	"$O(n \log h)$ time"
}

@techreport{ks-upcha-82t
, author =	"D. G. Kirkpatrick and R. Seidel"
, title =	"The Ultimate Planar Convex Hull Algorithm"
, type =	"Technical {Report}"
, number =	"83-577"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	oct
, year =	1982
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@inproceedings{kw-wvgbr-89
, author =	"D. G. Kirkpatrick and S. K. Wismath"
, title =	"Weighted visibility graphs of bars and related flow problems"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"325--334"
, succeeds =	"w-cblsg-85"
, update =	"93.09 milone+mitchell"
}

@article{kgv-osa-83
, author =	"S. Kirkpatrick and C. D. Gelatt and M. P. Vecchi"
, title =	"Optimization by simulated annealing"
, journal =	"Science"
, volume =	220
, year =	1983
, pages =	"671--680"
, update =	"97.11 bibrelex"
}

@techreport{k-elppp-89
, author =	"L. M. Kirousis"
, title =	"Effectively Labeling Planar Projections of Polyhedra"
, type =	"Technical {Report}"
, number =	"89.08.88"
, institution =	"Univ. of Patras"
, address =	"Greece"
, year =	1989
, keywords =	"polyhedron, labeling, $2$-dimensional image of a polyhedron"
, update =	"93.09 milone+mitchell"
}

@inproceedings{kp-crps-85
, author =	"L. M. Kirousis and C. H. Papadimitriou"
, title =	"The complexity of recognizing polyhedral scenes"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"175--185"
, precedes =	"kp-crps-88"
}

@article{kp-crps-88
, author =	"L. M. Kirousis and C. H. Papadimitriou"
, title =	"The complexity of recognizing polyhedral scenes"
, journal =	"J. Comput. Syst. Sci."
, volume =	37
, year =	1988
, pages =	"14--38"
, succeeds =	"kp-crps-85"
}

@article{keb-pht-91
, author =	"N. Kiryai and Y. Eldar and A. M. Bruckstein"
, title =	"A probabilistic {Hough} transform"
, journal =	"Pattern Recogn."
, volume =	24
, number =	4
, year =	1991
, pages =	"303--316"
, update =	"98.07 bibrelex"
}

@techreport{kb-wsp-90
, author =	"N. Kiryati and A. M. Bruckstein"
, title =	"What's in a set of points"
, number =	605
, institution =	"Israel Inst. of Tech."
, address =	"Haifa, Israel"
, month =	jan
, year =	1990
, update =	"93.09 milone+mitchell"
}

@book{k-ss-65
, author =	"L. Kish"
, title =	"Survey Sampling"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1965
, update =	"99.11 bibrelex, 98.07 bibrelex"
}

@article{khw-3dcmu-91
, author =	"E. Kishon and T. Hastie and H. Wolfson"
, title =	"$3$-d curve matching using splines"
, journal =	"J. Robot. Syst."
, volume =	8
, year =	1991
, pages =	"723--743"
, update =	"98.03 bibrelex"
}

@article{kr-glcd-82
, author =	"L. Kitchen and A. Rosenfeld"
, title =	"Gray level corner detection"
, journal =	"Pattern Rec. Lett."
, volume =	1
, year =	1982
, pages =	"95--102"
, update =	"98.11 bibrelex"
}

@article{kt-srehl-96
, author =	"N. Kitsios and A. Tsakalidis"
, title =	"Space reduction and an extension for a hidden line elimination algorithm"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"397--404"
, update =	"97.03 devillers"
}

@article{kl-pic-80
, author =	"M. S. Klamkin and A. Liu"
, title =	"Polyominoes on the Infinite Checkerboard"
, journal =	"J. Combin. Theory Ser. A"
, volume =	28
, year =	1980
, pages =	"7--16"
, update =	"98.07 bibrelex"
}

@article{k-lbcch-87
, author =	"A. Klapper"
, title =	"A lower bound on the complexity of the convex hull problem for simple polyhedra"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"159--161"
}

@incollection{k-p-97
, author =	"D. A. Klarner"
, title =	"Polyominoes"
, chapter =	12
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"225--242"
, update =	"97.11 orourke"
}

@incollection{k-ipccm-94
, author =	"R. Victor Klassen"
, title =	"Intersecting Parametric Cubic Curves by Midpoint Subdivision"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"261--277"
, keywords =	"Bezier curve, curve intersection, curve subdivision"
, update =	"94.09 heckbert"
, annote =	"Provides code to find the intersection points of planar
cubic curves. Contains C++ code."
}

@techreport{km-ocogd-98
, author =	"Gunnar W. Klau and Petra Mutzel"
, title =	"Optimal Compaction of Orthogonal Grid Drawings"
, type =	"Technical {Report}"
, number =	"MPI-I-98-1-031"
, institution =	"Max Planck Institut f{\"u}r Informatik"
, address =	"Saarbr{\"u}cken, Germany"
, month =	dec
, year =	1998
, url =	"http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1998-1-031"
, update =	"99.07 vismara, 99.03 patrignani+vismara"
}

@inproceedings{km-ocogd-99
, author =	"G. W. Klau and P. Mutzel"
, title =	"Optimal Compaction of Orthogonal Grid Drawings"
, editor =	"G. Cornuejols and R. E. Burkard and G. J. Woeginger"
, booktitle =	"Integer Programming and Combinatorial Optimization"
, nickname =	"IPCO '99"
, series =	"Lecture Notes Comput. Sci."
, volume =	1610
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"304--319"
, update =	"00.03 vismara"
}

@techreport{km-qodpg-98
, author =	"Gunnar W. Klau and Petra Mutzel"
, title =	"Quasi-Orthogonal Drawing of Planar Graphs"
, type =	"Technical {Report}"
, number =	"MPI-I-98-1-013"
, institution =	"Max Planck Institut f{\"u}r Informatik"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1998
, update =	"99.03 patrignani"
}

@techreport{k-sltac-89
, author =	"M. Klawe"
, title =	"A simple linear time algorithm for concave one-dimensional dynamic programming"
, type =	"Technical {Report}"
, number =	"89-16"
, institution =	"Univ. Britisch Columbia"
, address =	"Vancouver, BC"
, year =	1989
, update =	"98.03 bibrelex"
}

@techreport{kk-altag-88
, author =	"M. Klawe and D. Kleitman"
, title =	"An almost linear time algorithm for generalized matrix"
, type =	"Technical {Report}"
, number =	"RJ6275"
, institution =	"IBM Almaden Research Center"
, year =	1988
, update =	"98.03 bibrelex"
}

@unpublished{kpp-nrvu-82
, author =	"M. Klawe and M. Paterson and N. Pippenger"
, title =	"Inversions with $n2^{1+\Omega(1+\sqrt{\log n})}$ transpositions at the median"
, year =	1982
, note =	"unpublished manuscript"
, update =	"98.03 agarwal"
}

@inproceedings{k-sbms-90
, author =	"M. M. Klawe"
, title =	"Superlinear bounds on matrix searching"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"485--493"
}

@article{kk-altag-90
, author =	"M. M. Klawe and D. J. Kleitman"
, title =	"An almost linear time algorithm for generalized matrix searching"
, journal =	"SIAM J. Discrete Math."
, volume =	3
, number =	1
, year =	1990
, pages =	"81--97"
, update =	"98.11 bibrelex"
}

@article{k-gubet-92
, author =	"M. Klazar"
, title =	"A general upper bound in extremal theory of sequences"
, journal =	"Comment. Math. Univ. Carol."
, volume =	33
, year =	1992
, pages =	"737--746"
, update =	"95.09 agarwal"
}

@article{k-lubet-94
, author =	"M. Klazar"
, title =	"A linear upper bound in extremal theory of sequences"
, journal =	"J. Combin. Theory Ser. A"
, volume =	68
, year =	1994
, pages =	"454--464"
, update =	"95.09 agarwal"
}

@phdthesis{k-cadss-95
, author =	"M. Klazar"
, title =	"Combinatorial Aspects of Davenport--Schinzel Sequences"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Applied Mathematics, Charles University"
, address =	"Prague, Czech Republic"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"95.09 agarwal"
}

@article{k-trpo-93
, author =	"M. Klazar"
, title =	"Two results on a partial ordering of finite sequences"
, journal =	"Comment. Math. Univ. Carol."
, volume =	34
, year =	1993
, pages =	"667--675"
, update =	"95.09 agarwal"
}

@article{kv-gdss-94
, author =	"M. Klazar and P. Valtr"
, title =	"Generalized {Davenport--Schinzel} sequences"
, journal =	"Combinatorica"
, volume =	14
, year =	1994
, pages =	"463--476"
, update =	"95.09 agarwal"
}

@article{km-femgb-94
, author =	"G. Klebe and T. Mietzener"
, title =	"A fast and efficient method to generate biologically relevant conformations"
, journal =	"J. Computer Aided Molecular Design"
, volume =	8
, year =	1994
, pages =	"583--606"
, update =	"98.07 bibrelex"
}

@inproceedings{k-ltatf-80
, author =	"V. Klee"
, title =	"A linear-time algorithm that finds all local minima among triangles containing a given convex polygon"
, booktitle =	"Proc. 5th Sympos. Operations Res."
, site =	"K{\"o}ln, West Germany"
, year =	1980
, pages =	"??"
}

@article{k-cmbbc-77
, author =	"V. Klee"
, title =	"Can the measure of $\bigcup_{1}^{n}[{a_{i}},b_{i}]$ be computed in less than {$O(n \log n)$} steps?"
, journal =	"Amer. Math. Monthly"
, volume =	84
, year =	1977
, pages =	"284--285"
, precedes =	"oy-nubkm-88"
}

@inproceedings{k-cplp-66
, author =	"V. Klee"
, title =	"Convex polytopes and linear programming"
, booktitle =	"Proc. IBM Sci. Comput. Symp.: Combinatorial Problems"
, publisher =	"IBM"
, year =	1966
, pages =	"123--158"
, update =	"98.11 bibrelex"
}

@article{k-fcvm-86
, author =	"Victor Klee"
, title =	"Facet-centroids and volume minimization"
, journal =	"Studia Scientiarum Mathematicarum Hungarica"
, volume =	21
, year =	1986
, pages =	"143--147"
, note =	"Fejes T{\'o}th Festschrift"
, update =	"01.04 orourke, 99.07 orourke"
}

@article{k-iepri-69
, author =	"Victor Klee"
, title =	"Is Every Polygonal Region Illuminable from Some Point?"
, journal =	"Amer. Math. Monthly"
, volume =	76
, year =	1969
, pages =	180
, update =	"01.04 orourke, 96.01 aronov"
}

@article{k-cddvd-80
, author =	"V. Klee"
, title =	"On the complexity of $d$-dimensional {Voronoi} diagrams"
, journal =	"Archiv der Mathematik"
, volume =	34
, year =	1980
, pages =	"75--80"
}

@article{k-pptrl-74
, author =	"V. Klee"
, title =	"Polytope pairs and their relationship to linear programming"
, journal =	"Acta Math."
, volume =	133
, year =	1974
, pages =	"1--25"
, update =	"98.03 bibrelex"
}

@article{k-cscb-53
, author =	"V. Klee"
, title =	"The Critical Set of a Convex Body"
, journal =	"Amer. J. Math."
, volume =	75
, year =	1953
, pages =	"178--188"
, update =	"98.07 bibrelex"
}

@book{k-vmafs-72
, author =	"V. Klee"
, title =	"Viewers Manual to accompany the film shapes of the futur e - some unsolved problems in geometry, Part II: Three Dimensions"
, publisher =	"Modern Learning Aids"
, year =	1972
, update =	"97.11 bibrelex"
}

@article{kk-ggspc-90
, author =	"V. Klee and P. Kleinschmidt"
, title =	"Geometry of the {Gass}-{Saaty} parametric cost {LP} algorithm"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"13--26"
}

@article{kk-dscir-87
, author =	"V. Klee and P. Kleinschmidt"
, title =	"The $d$-steps conjecture and its relatives"
, journal =	"Math. Oper. Res."
, volume =	12
, year =	1987
, pages =	"718--755"
, update =	"93.09 milone+mitchell"
}

% also claimed pages =	"457--464"
@article{kl-fstcg-85
, author =	"V. Klee and M. C. Laskowski"
, title =	"Finding the smallest triangles containing a given convex polygon"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"359--375"
}

@article{klh-arsss-97
, author =	"V. Klee and T. Lewis and B. {von Hohenbalken}"
, title =	"{Apollonius} Revisited: {Supporting} Spheres for Sundered Systems"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"385--395"
, cites =	"g-sih-69, ks-dpbst-58, s-scpe-80"
, update =	"99.11 bibrelex"
}

@incollection{km-hgisa-72
, author =	"V. Klee and G. J. Minty"
, title =	"How good is the simplex algorithm?"
, editor =	"O. Shisha"
, booktitle =	"Inequalities III"
, publisher =	"Academic Press"
, year =	1972
, pages =	"159--175"
, update =	"93.09 milone+mitchell"
}

@book{kw-onupp-91
, author =	"Victor Klee and Stan Wagon"
, title =	"Old and New Unsolved Problems in Plane Geometry"
, publisher =	"Mathematical Association of America"
, year =	1991
, update =	"01.04 orourke, 98.03 bibrelex"
}

@article{kw-dscpd-??
, author =	"V. Klee and D. Walkup"
, title =	"The $d$-step conjecture for polyhedra of dimension $d<6$"
, journal =	"Acta Math."
, volume =	133
, year =	"??"
, pages =	"53--78"
, update =	"93.09 milone+mitchell"
}

@article{kl-sc-72
, author =	"S. Kleiman and D. Laksov"
, title =	"Schubert calculus"
, journal =	"Amer. Math. Monthly"
, volume =	79
, year =	1972
, pages =	"1061--1082"
, update =	"98.03 bibrelex"
}

@book{k-emasg-39
, author =	"F. Klein"
, title =	"Elementary Mathematics from an Advanced Standpoint: Geometry"
, publisher =	"Macmillan"
, address =	"New York, NY"
, year =	1939
, update =	"97.11 bibrelex"
}

@inproceedings{kt-rltaf-94
, author =	"Philip Klein and Robert E. Tarjan"
, title =	"A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	""
, update =	"94.01 jones"
}

@article{kr-epap-88
, author =	"P. N. Klein and J. H. Reif"
, title =	"An Efficient Parallel Algorithm for Planarity"
, journal =	"J. Comput. Syst. Sci."
, volume =	37
, number =	2
, year =	1988
, pages =	"190--246"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{ks-prass-92
, author =	"P. N. Klein and S. Sairam"
, title =	"A parallel randomized approximation scheme for shortest paths"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"750--758"
}

@inproceedings{ks-fdasa-93
, author =	"P. N. Klein and S. Subramanian"
, title =	"A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs"
, booktitle =	"Proc. 1993 Workshop Algorithms Data Struct."
, year =	1993
, pages =	"442--451"
, update =	"94.01 tamassia"
}

@inproceedings{k-avdta-88
, author =	"Rolf Klein"
, title =	"Abstract {Voronoi} Diagrams and Their Applications"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"148--157"
, comments =	"extended abstract"
, succeeds =	"k-vdmm-87"
, update =	"00.03 bibrelex, 99.11 bibrelex, 99.07 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@book{k-ag-97
, author =	"Rolf Klein"
, title =	"Algorithmische Geometrie"
, publisher =	"Addison-Wesley"
, address =	"Bonn"
, year =	1997
, url =	"http://www.oldenbourg.de/cgi-bin/rotitel?T=24382"
, keywords =	"textbook, in German"
, update =	"01.04 icking, 99.07 bibrelex, 97.03 icking+smid"
}

@inproceedings{k-cpavd-89
, author =	"Rolf Klein"
, title =	"Combinatorial Properties of Abstract {Voronoi} Diagrams"
, editor =	"M. Nagl"
, booktitle =	"Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	411
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"356--369"
, update =	"97.03 icking"
}

@book{k-cavd-89
, author =	"Rolf Klein"
, title =	"Concrete and Abstract {Voronoi} Diagrams"
, series =	"Lecture Notes Comput. Sci."
, volume =	400
, publisher =	"Springer-Verlag"
, year =	1989
, isbn =	"3-540-52055-4"
, keywords =	"book"
, update =	"99.07 bibrelex, 93.09 held"
}

@incollection{k-dsv-98
, author =	"Rolf Klein"
, title =	"Das {Sweep-Verfahren}"
, editor =	"Thomas Ottmann"
, booktitle =	"Prinzipien des {Algorithmenentwurfs}"
, publisher =	"Spektrum Akademischer Verlag"
, year =	1998
, pages =	"67--89"
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/sweep.pdf"
, cites =	"b-oafsi-95, b-pp-85, bo-arcgi-79, ce-oails-92, hns-psscp-88, k-ag-97, m-mdscg-84, ps-vvasq-91, ZZZ"
, update =	"00.03 bibrelex"
, annote =	"The book comes with a CD-ROM which contains, for each chapter, a lecture
		 held by the author of that chapter."
}

@techreport{k-ddp-85
, author =	"Rolf Klein"
, title =	"Direct Dominance of Points"
, number =	154
, institution =	"Institut f{\"u}r {Angewandte} {Informatik} und {Formale} {Beschreibungsverfahren}, Universit{\"a}t Karlsruhe"
, year =	1985
, update =	"99.07 bibrelex, 97.11 bibrelex"
}

@inproceedings{k-mas-91
, author =	"Rolf Klein"
, title =	"Moving Along a Street"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"123--140"
, precedes =	"k-wusbd-91"
, update =	"00.03 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@techreport{k-vdmm-87
, author =	"Rolf Klein"
, title =	"Voronoi diagrams in the {Moscow} metric"
, type =	"Technical {Report}"
, number =	7
, institution =	"Inst. Inform., Univ. Freiburg"
, year =	1987
, precedes =	"k-vdmm-89"
, update =	"99.07 bibrelex, 98.11 bibrelex"
}

@inproceedings{k-vdmm-89
, author =	"Rolf Klein"
, title =	"{Voronoi} Diagrams in the Moscow Metric"
, booktitle =	"Proc. Graph-Theoretic Concepts in Computer Science. Proceedings."
, nickname =	"WG '88"
, site =	"Amsterdam"
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"434--441"
, succeeds =	"k-vdmm-87"
, update =	"98.11 bibrelex"
}

@inproceedings{k-wusbd-91
, author =	"Rolf Klein"
, title =	"Walking an Unknown Street with Bounded Detour"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"304--313"
, succeeds =	"k-mas-91"
, precedes =	"k-wusbd-92t"
, update =	"99.07 bibrelex, 98.11 bibrelex"
}

@techreport{k-wusbd-92t
, author =	"Rolf Klein"
, title =	"Walking an Unknown Street with Bounded Detour"
, number =	122
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1992
, succeeds =	"k-wusbd-91"
, precedes =	"k-wusbd-92"
, update =	"98.11 bibrelex"
}

@article{k-wusbd-92
, author =	"Rolf Klein"
, title =	"Walking an Unknown Street with Bounded Detour"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1992
, pages =	"325--351"
, succeeds =	"k-wusbd-92t"
, update =	"99.07 bibrelex, 98.11 bibrelex"
}

@techreport{kl-ltrab-93t
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
, number =	150
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1993
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr150.pdf"
, succeeds =	"lk-ltrab-91"
, precedes =	"kl-ltrab-93"
, update =	"98.11 bibrelex"
}

@inproceedings{kl-ltrab-93
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"124--132"
, succeeds =	"kl-ltrab-93t"
, precedes =	"kl-ltrab-96"
, cites =	"agss-ltacv-89, a-vds-88, c-tsplt-90i, c-bvdcp-86, c-cdt-87, dl-cvdrp-91, k-cavd-89, kl-mpsp-92, kl-cgdts-92, ll-gdtpg-86, l-hmdp-87, ll-fagt-90, l-vdbsd-89, ps-cgi-85, s-cdtvd-88, s-sfira-91, ws-oacdt-87, ZZZ"
, update =	"99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 97.03 devillers, 93.09 jones"
}

@article{kl-ltrab-96
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"263--278"
, succeeds =	"kl-ltrab-93"
, update =	"99.07 bibrelex, 97.03 devillers+icking"
}

@inproceedings{kl-ngcav-93
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"A Note on Generalizations of {Chew's} Algorithm for the {Voronoi} Diagram of a Convex Polygon"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"370--374"
, cites =	"a-vds-88, c-bvdcp-86, d-rysoa-92, dl-cvdrp-91, e-acg-87, gs-pmgsc-85, kl-ltrab-93, k-eccs-79, k-cavd-89, kl-havdl-93, ps-cgi-85, ya-mpce-89, s-barga-91, agss-ltacv-89, ZZZ"
, update =	"99.07 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{kl-fsc-95
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"Fast Skeleton Construction"
, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	979
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"582--595"
, update =	"00.03 bibrelex, 99.07 bibrelex, 97.03 icking"
}

@techreport{kl-havdl-93
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
, type =	"manuscript"
, year =	1993
, precedes =	"kl-havdl-94c"
, update =	"00.11 smid, 00.07 icking, 99.07 bibrelex, 98.11 bibrelex"
}

@inproceedings{kl-havdl-94
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"11--19"
, succeeds =	"kl-havdl-94c"
, update =	"00.11 smid, 00.07 icking, 99.11 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 98.03 smid, 96.05 mitchell"
}

@inproceedings{kl-havdl-94c
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"1--4"
, succeeds =	"kl-havdl-93"
, precedes =	"kl-havdl-94"
, update =	"00.11 smid, 00.07 icking"
}

@techreport{kl-mpsp-92t
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"Manhattonian Proximity in a Simple Polygon"
, number =	124
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1992
, precedes =	"kl-mpsp-92"
, update =	"98.11 bibrelex"
}

@inproceedings{kl-mpsp-92
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"Manhattonian Proximity in a Simple Polygon"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"312--319"
, succeeds =	"kl-mpsp-92t"
, precedes =	"kl-mpsp-95"
, cites =	"agss-ltacv-89, a-gvdps-87, a-vds-88, c-tsplt-90i, c-cdt-87, cf-shvd-91, dk-bsbav-91, dl-cvdrp-91, egs-oplms-86, f-savd-87, k-cavd-89, kmm-cavd2-90, l-hmdp-87, ll-fagt-90, l-vdbsd-89, lk-ltrab-91, ps-cgi-85, s-cdtvd-88, s-mplbc-85, sh-cpp-75, ws-oacdt-87, ZZZ"
, update =	"99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex, 96.09 devillers"
}

@article{kl-mpsp-95
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"Manhattonian proximity in a simple polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"53--74"
, keywords =	"Voronoi diagram, simple polygon, computational geometry"
, succeeds =	"kl-mpsp-92"
, update =	"99.07 bibrelex, 96.09 devillers"
}

@techreport{kl-cgdts-92
, author =	"Rolf Klein and Andrzej Lingas"
, title =	"On Computing the Generalized {Delaunay} Triangulation of a Simple Polygon"
, type =	"Manuscript"
, institution =	"Lund University"
, address =	"Lund, Sweden"
, year =	1992
, update =	"99.07 bibrelex, 98.03 bibrelex"
}

@techreport{km-weacs-92
, author =	"Rolf Klein and Lihong Ma"
, title =	"Wrapping Ellipses Around a Convex Skeleton"
, number =	132
, institution =	"Fachbereich Informatik, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1992
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr132.pdf"
, precedes =	"km-weacs-95"
, update =	"98.07 icking, 98.03 bibrelex"
}

@article{km-weacs-95
, author =	"Rolf Klein and Lihong Ma"
, title =	"Wrapping Ellipses Around a Convex Skeleton"
, journal =	"Internat. J. Comput. Math."
, volume =	55
, year =	1995
, pages =	"173--181"
, succeeds =	"km-weacs-92"
, update =	"98.07 icking, 97.03 icking"
}

@incollection{kmm-cavd-92
, author =	"Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
, title =	"On the Construction of Abstract {Voronoi} Diagrams"
, editor =	"J. Buchmann and H. Ganzinger and W. J. Paul"
, booktitle =	"{Festschrift} zum 60. {Geburtstag} von {G{\"u}nter} {Hotz}"
, series =	"Teubner-Texte zur Informatik"
, publisher =	"B. G. Teubner"
, year =	1992
, pages =	"283--308"
, update =	"97.03 icking"
}

@inproceedings{kmm-cavd2-90
, author =	"Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
, title =	"On the Construction of Abstract {Voronoi} Diagrams {II}"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"138--154"
, precedes =	"kmm-ricav-93"
, update =	"99.07 bibrelex, 93.05 smid"
}

@techreport{kmm-ricav-93
, author =	"Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
, title =	"Randomized Incremental Construction of Abstract {Voronoi} Diagrams"
, number =	"MPI-I-93-105"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, succeeds =	"kmm-cavd2-90"
, precedes =	"kmm-ricav-93a"
, update =	"99.07 bibrelex, 94.05 devillers, 93.05 smid"
}

@article{kmm-ricav-93a
, author =	"Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
, title =	"Randomized Incremental Construction of Abstract {Voronoi} Diagrams"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, number =	3
, year =	1993
, pages =	"157--184"
, succeeds =	"kmm-ricav-93"
, update =	"99.07 bibrelex, 97.11 bibrelex, 94.05 devillers"
}

@techreport{know-dfwp-87
, author =	"Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
, title =	"A Dynamic Fixed Windowing Problem"
, type =	"Report"
, number =	"CS-87-56"
, institution =	"Data Struct. Group, Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1987
, precedes =	"know-odsfw-86"
, update =	"99.07 bibrelex"
}

@article{know-dfwp-89
, author =	"Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
, title =	"A Dynamic Fixed Windowing Problem"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"535--550"
, keywords =	"points, range searching, polygons, two-dimensional, dynamizing data structures, priority search trees"
, succeeds =	"know-odsfw-86"
, update =	"99.07 bibrelex"
}

@inproceedings{know-odsfw-86
, author =	"Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
, title =	"Optimal Dynamic Solutions for Fixed Windowing Problems"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"109--115"
, succeeds =	"know-dfwp-87"
, precedes =	"know-dfwp-89"
, cites =	"asss-moacp-85, b-sbbtd-72, bs-dsp1s-80, ce-oscpr-85, g-dcopi-84, m-pst-85, m-pst-85, o-ddds-83, ol-tgmdd-81, t-ubstr-83, lw-ddsp-80, ZZZ"
, update =	"99.07 bibrelex, 97.11 bibrelex"
}

@book{kst-cg-97
, title =	"Computational Geometry"
, editor =	"Rolf Klein and Raimond Seidel and Seth Teller"
, series =	"Dagstuhl-Seminar-Report"
, volume =	168
, publisher =	"Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
, address =	"Schloss Dagstuhl, Germany"
, year =	1997
, url =	"ftp://ftp.dagstuhl.de/pub/Reports/97/9707.ps.gz"
, update =	"01.04 icking"
}

@article{kw-tubla-90
, author =	"Rolf Klein and Derick Wood"
, title =	"A Tight Upper Bound for the Length of {AVL} Trees"
, journal =	"Theoret. Comput. Sci."
, volume =	72
, year =	1990
, pages =	"251--264"
, update =	"98.11 bibrelex"
}

@inproceedings{kw-bt-89
, author =	"Rolf Klein and Derick Wood"
, title =	"On Binary Trees"
, booktitle =	"Information Processing 89, 11th World Computer Congress"
, nickname =	"IFIP '89"
, site =	"San Francisco"
, year =	1989
, pages =	"449--454"
, update =	"98.11 bibrelex"
}

@inproceedings{kw-mplat-88
, author =	"Rolf Klein and Derick Wood"
, title =	"On the Maximum Path Length of {AVL}-Trees"
, booktitle =	"Proc. 13th Colloquium on Trees in Algebra and Programming"
, nickname =	"CAAP '88"
, site =	"Nancy"
, series =	"Lecture Notes Comput. Sci."
, volume =	299
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"16--27"
, update =	"98.11 bibrelex"
}

@inproceedings{kw-plbt-89p
, author =	"Rolf Klein and Derick Wood"
, title =	"On the Path Length of Binary Trees"
, booktitle =	"Proc. 3rd International Conference on Foundations of Data Organization and Algorithms"
, nickname =	"FODO '89"
, series =	"Lecture Notes Comput. Sci."
, volume =	367
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"128--136"
, precedes =	"kw-plbt-89"
, update =	"98.11 bibrelex"
}

@article{kw-plbt-89
, author =	"Rolf Klein and Derick Wood"
, title =	"On the Path Length of Binary Trees"
, journal =	"J. ACM"
, volume =	36
, number =	2
, year =	1989
, pages =	"280--289"
, succeeds =	"kw-plbt-89p"
, update =	"98.11 bibrelex"
}

@inproceedings{kw-vdbgm-88
, author =	"Rolf Klein and Derick Wood"
, title =	"Voronoi Diagrams Based on General Metrics in the Plane"
, editor =	"R. Cori and M. Wirsing"
, booktitle =	"Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	294
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"281--291"
, update =	"97.03 icking"
}

@inproceedings{k-tanns-97
, author =	"J. Kleinberg"
, title =	"Two Algorithms for Nearest-Neighbor Search in High Dimension"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '97"
, year =	1997
, pages =	"599--608"
, update =	"98.07 bibrelex, 97.07 agarwal"
}

@inproceedings{kpr-sp-98
, author =	"Jon Kleinberg and Christos Papadimitriou and Prabhakar Raghavan"
, title =	"Segmentation Problems"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, year =	1998
, pages =	"473--482"
, update =	"00.11 smid, 00.07 smid, 98.03 mitchell"
}

@mastersthesis{k-olarn-94
, author =	"Jon Michael Kleinberg"
, title =	"On-line algorithms for robot navigation and server problems"
, school =	"MIT, Dept. of Electr. Engineering and Comp. Science"
, year =	1994
, keywords =	"master thesis"
, update =	"98.07 icking"
}

@inproceedings{k-olssp-94
, author =	"Jon M. Kleinberg"
, title =	"On-Line Search in a Simple Polygon"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '94"
, year =	1994
, pages =	"8--15"
, comments =	"Contains, among other things, a 2.83-competitive algorithm for searching in streets
(but not 1.62-competitive as said in the abstract)."
, update =	"98.03 bibrelex+icking+mitchell"
}

@inproceedings{k-lpmr-94
, author =	"J. M. Kleinberg"
, title =	"The localization problem for mobile robots"
, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1994
, pages =	"521--531"
, update =	"97.11 bibrelex"
}

@mastersthesis{k-rspqw-94
, author =	"K. S. Klenk"
, title =	"Rectilinear shortest path queries among weighted obstacles"
, school =	"University of Notre Dame"
, month =	nov
, year =	1994
, keywords =	"master thesis"
, update =	"98.03 bibrelex"
}

@article{k-achfg-83
, author =	"R. Klette"
, title =	"On the approximation of convex hulls of finite grid point sets"
, journal =	"Pattern Recogn. Lett."
, volume =	2
, year =	1983
, pages =	"19--22"
}

@article{kk-atcdp-81
, author =	"R. Klette and E. V. Krishnamurthy"
, title =	"Algorithms for testing convexity of digital polygons"
, journal =	"Comput. Graph. Image Process."
, volume =	16
, year =	1981
, pages =	"177--184"
}

@article{ks-frtua-97
, author =	"K. Klimaszewski and T. Sederberg"
, title =	"Faster ray-tracing using adaptive grids"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, month =	"jan-feb"
, year =	1997
, pages =	"42--51"
, update =	"98.07 bibrelex"
}

@article{k-mtpd-80
, author =	"G. T. Klincsek"
, title =	"Minimal triangulations of polygonal domains"
, journal =	"Discrete Math."
, volume =	9
, year =	1980
, pages =	"121--123"
}

@book{k-vd-73
, author =	"W. Klingenberg"
, title =	"Eine Vorlesung {\"uber} Differentialgeometrie"
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1973
, update =	"98.11 bibrelex"
}

@article{kd-epurd-76
, author =	"A. Klinger and C. R. Dyer"
, title =	"Experiments on pictures using regular decompositions"
, journal =	"Comput. Graph. Image Process."
, volume =	5
, year =	1976
, pages =	"68--105"
, update =	"97.11 bibrelex"
}

@techreport{k-cizct-85
, author =	"D. A. Klip"
, title =	"The completeness issue of the zero curve tracing algorithm for the isolation of the zeros of an analytic function defined on a disk"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Inform. Sci., Univ. Alabama Birmingham"
, address =	"Birmingham, AL"
, year =	1985
}

@article{khmsz-ecdubv-98
, author =	"J. Klosowski and M. Held and Joseph S. B. Mitchell and K. Zikan and H. Sowizral"
, title =	"Efficient Collision Detection Using Bounding Volume Hierarchies of {$k$-DOPs}"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	4
, number =	1
, year =	1998
, pages =	"21--36"
, succeeds =	"hkm-rtcdm-96"
, update =	"98.11 held, 98.03 mitchell"
}

@inproceedings{ks-spc1a-96
, author =	"Petra Knieper and Anand Srivastav"
, title =	"Sequential and Parallel Construction of {$(1/r)$}-Approximations"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"123--125"
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@mastersthesis{k-iacgw-90
, author =	"A. Knight"
, title =	"Implementation of algorithms in a computational geometry workbench"
, school =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, month =	apr
, year =	1990
, keywords =	"master thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{kmmns-cgw-90
, author =	"A. Knight and J. May and M. McAffer and T. Nguyen and J.-R. Sack"
, title =	"A Workbench for Computational Geometry (WOCG)"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	370
, cites =	"ZZZ"
, update =	"97.11 bibrelex+sack"
}

@article{kf-p841d-84
, author =	"G. Knott and H. Flanders"
, title =	"Problem 84-1: determine if a polygon is clockwise or counterclockwise"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	591
}

@techreport{kj-pdwtl-87
, author =	"G. Knott and E. Jou"
, title =	"A Program to Determine Whether Two Line Segments Intersect"
, type =	"Technical {Report}"
, number =	"CAR-TR-306, CS-TR-1884, DCR-86-05557"
, institution =	"Dept. Comput. Sci., Univ. Maryland College Park"
, address =	"College Park, MD"
, month =	aug
, year =	1987
, update =	"98.03 bibrelex"
}

@book{k-acp-73
, author =	"D. Knuth"
, title =	"The art of computer programming"
, publisher =	"Addison-Wesley"
, year =	1973
, update =	"98.03 bibrelex"
}

@book{k-ah-92
, author =	"Donald E. Knuth"
, title =	"Axioms and Hulls"
, series =	"Lecture Notes Comput. Sci."
, volume =	606
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, Germany"
, year =	1992
, update =	"94.05 grigni"
}

@article{k-cdf-63
, author =	"D. E. Knuth"
, title =	"Computer Drawn Flowcharts"
, journal =	"Commun. ACM"
, volume =	6
, year =	1963
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{k-fa-68
, author =	"D. E. Knuth"
, title =	"Fundamental Algorithms"
, series =	"The Art of Computer Programming"
, volume =	1
, edition =	"1st"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1968
, update =	"97.11 bibrelex"
}

@book{k-fa-73
, author =	"D. E. Knuth"
, title =	"Fundamental Algorithms"
, series =	"The Art of Computer Programming"
, volume =	1
, edition =	"2nd"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1973
}

@book{k-fa-97
, author =	"D. E. Knuth"
, title =	"Fundamental Algorithms"
, series =	"The Art of Computer Programming"
, volume =	1
, edition =	"3rd"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1997
, update =	"98.07 smid"
}

@article{k-scfl-68
, author =	"D. E. Knuth"
, title =	"Semantics of Context-Free Languages"
, journal =	"Math. Syst. Theory"
, volume =	2
, year =	1968
, pages =	"127--145"
, update =	"96.01 tamassia"
}

@book{k-sa-69
, author =	"D. E. Knuth"
, title =	"Seminumerical Algorithms"
, series =	"The Art of Computer Programming"
, volume =	2
, edition =	"1st"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1969
, update =	"97.11 bibrelex"
}

@book{k-sa-81
, author =	"D. E. Knuth"
, title =	"Seminumerical Algorithms"
, series =	"The Art of Computer Programming"
, volume =	2
, edition =	"2nd"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1981
}

@book{k-sa-98
, author =	"D. E. Knuth"
, title =	"Seminumerical Algorithms"
, series =	"The Art of Computer Programming"
, volume =	2
, edition =	"3rd"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1998
, update =	"98.07 smid"
}

@book{k-ss-73
, author =	"D. E. Knuth"
, title =	"Sorting and Searching"
, series =	"The Art of Computer Programming"
, volume =	3
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1973
}

@book{k-sg-93
, author =	"D. E. Knuth"
, title =	"The {Stanford} {GraphBase}: A Platform for Combinatorial Computing"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1993
, update =	"98.07 tamassia"
}

@article{kr-pcr-92
, author =	"D. E. Knuth and A. Raghunathan"
, title =	"The problem of compatible representatives"
, journal =	"SIAM J. Discrete Math."
, volume =	5
, year =	1992
, pages =	"422--427"
, update =	"98.03 bibrelex"
}

@book{k-ctrf-91
, author =	"K.-I. Ko"
, title =	"Complexity Theory of Real Functions"
, publisher =	"Birkh{\"a}user"
, address =	"Boston"
, year =	1991
, update =	"98.11 bibrelex"
}

@inproceedings{kc-ltawr-89
, author =	"M. T. Ko and Y. T. Ching"
, title =	"A linear time algorithm for the weighted rectilinear 2-center problem"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"75--82"
, update =	"95.09 mitchell"
}

@article{kc-ltawt-92
, author =	"M. T. Ko and Y. T. Ching"
, title =	"Linear time algorithms for the weighted tailored $2$-partition problem and the weighted rectilinear 2-center problem under ${L}_\infty$-distance"
, journal =	"Discrete Appl. Math."
, volume =	40
, year =	1992
, pages =	"397--410"
, update =	"97.03 agarwal, 96.05 agarwal, 95.09 mitchell"
}

@article{kl-wrccp-91
, author =	"M. T. Ko and R. C. T. Lee"
, title =	"On weighted rectilinear $2$-center and $3$-center problems"
, journal =	"Inform. Sci."
, volume =	54
, year =	1991
, pages =	"169--190"
, update =	"96.05 agarwal"
}

@article{klc-oaarm-90
, author =	"M. T. Ko and R. C. T. Lee and J. S. Chang"
, title =	"An optimal approximation algorithm for the rectilinear $m$-center problem"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"341--352"
}

@inproceedings{klc-rmcp-87
, author =	"M. T. Ko and R. C. T. Lee and J. S. Chang"
, title =	"Rectilinear $m$-center problem"
, booktitle =	"Proc. National Computer Symp."
, site =	"Taipei, Taiwan, R. O. C."
, year =	1987
, pages =	"325--329"
, update =	"97.11 bibrelex"
}

@incollection{k-ccl-67
, author =	"S. Kobayashi"
, title =	"On conjugate and cut loci"
, editor =	"S. S. Chern"
, booktitle =	"Studies in Global Geometry and Analysis"
, publisher =	"Mathematical Association of America"
, year =	1967
, pages =	"96--122"
, keywords =	"shortest paths"
, update =	"93.09 erickson, 93.05 orourke"
}

@article{k-fdpam-94
, author =	"L. Kobbelt"
, title =	"A fast dot-product algorithm with minimal rounding errors"
, journal =	"Computing"
, volume =	52
, year =	1994
, pages =	"355--369"
, update =	"98.07 bibrelex"
}

@mastersthesis{k-ibme-
, author =	"L. Kobbelt"
, title =	"Iterative {Berechnung} metrischer {Eigenschaften}"
, school =	"Universit{\"a}t Karlsruhe"
, address =	"Karlsruhe, Germany"
, year =	"??"
, note =	"Thesis"
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@inproceedings{k-reefp-97
, author =	"L. Kobbelt"
, title =	"Robust and efficient evaluation of functionals on parametric surfaces"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"376--378"
, cites =	"b-wdwnb-90, bs-aulbr-66, bs-nqe-67, d-fptea-71, g-igar-96, f-pcg-93, f-riga-96, fv-eeacg-93, k-ibme-, k-fdpam-94, km-catp-81, p-pfpan-92, s-apfpa-96, s-aeqes-82, s-eidnm-83, s-acmi-71, ts-cggps-80, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{kcvs-imrma-98
, author =	"L. Kobbelt and S. Campagna and J. Vorsatz and H.-P. Seidel"
, title =	"Interactive Multi-Resolution Modeling on Arbitrary Meshes"
, booktitle =	"Proc. SIGGRAPH '98"
, site =	"Orlando, FL"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, month =	jul
, year =	1998
, pages =	"105--114"
, update =	"98.11 held"
}

@article{kk-mpf-89
, author =	"M. W. Koch and R. L. Kashyap"
, title =	"Matching polygon fragments"
, journal =	"Pattern Recogn. Lett."
, volume =	10
, year =	1989
, pages =	"297--308"
, keywords =	"shape matching"
, update =	"98.07 rote"
}

@article{k-ambsc-84
, author =	"P. Kochevar"
, title =	"An application of multivariate {B}-splines to computer-aided geometric design"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"159--175"
}

@inproceedings{k-ernmp-87
, author =	"D. E. Koditschek"
, title =	"Exact robot navigation by means of potential functions: some topological considerations"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1987
, pages =	"1--6"
, update =	"95.05 agarwal"
}

@article{k-kdka-36
, author =	"P. Koebe"
, title =	"Kontaktprobleme der konformen {Abbildung}"
, journal =	"Ber. Verh. S{\"a}chs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse"
, volume =	88
, year =	1936
, pages =	"141--164"
, update =	"97.11 bibrelex"
}

@book{k-ss-89
, author =	"J. Koenderink"
, title =	"Solid Shape"
, publisher =	"MIT Press"
, year =	1989
, update =	"95.01 mitchell"
}

@article{kd-irssr-79
, author =	"J. J. Koenderink and A. J. van Doorn"
, title =	"The internal representation of solid shape with respect to vision"
, journal =	"Biological Cybernetics"
, volume =	32
, year =	1979
, pages =	"211--216"
}

@article{kd-svm-76
, author =	"J. J. Koenderink and A. J. van Doorn"
, title =	"The singularities of the visual mapping"
, journal =	"Biological Cybernetics"
, volume =	24
, year =	1976
, pages =	"51--59"
}

@inproceedings{k-atdvo-92
, author =	"H. Koike"
, title =	"An Application of Three Dimensional Visualization to Object-Oriented Programming"
, booktitle =	"Proc. Advanced Visual Interfaces"
, series =	"World Scientific Series in Computer Science"
, volume =	36
, year =	1992
, pages =	"180--192"
, keywords =	"graph drawing"
, update =	"94.01 tamassia, 93.09 tamassia"
}

@inproceedings{kts-vsmbc-85
, author =	"P. Koistinen and M. Tamminen and H. Samet"
, title =	"Viewing solid models by bintree conversion"
, editor =	"C. E. Vandoni"
, booktitle =	"Proceedings of the {EUROGRAPHICS'85} Conference"
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	1985
, pages =	"147--157"
, update =	"96.05 efrat"
}

@inproceedings{kk-nnfmd-95
, author =	"V. Koivune and S. Kassam"
, title =	"Nearest neighbor filters for multivariate data"
, booktitle =	"IEEE Workshop on Nonlinear Signal and Image Processing"
, year =	1995
, update =	"97.07 agarwal"
}

@article{k-ptldt-87
, author =	"M. Kolinek"
, title =	"A polynomial-time linear decision tree for the traveling salesman problem and other {NP}-complete problems"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"37--48"
}

@article{k-3dlca-94
, author =	"I. Kolingerov{\'a}"
, title =	"3D-Line Clipping Algorithms -- A Comparative Study"
, journal =	"Visual Comput."
, volume =	11
, number =	2
, year =	1994
, pages =	"96--104"
, update =	"96.01 held"
}

@inproceedings{k-ccheu-94
, author =	"Ivana Kollingerova"
, title =	"Creating convex hulls in {$E^2$} using dual representation"
, booktitle =	"Winter School of Computer Graphics and CAD Systems 94"
, publisher =	"University of West Bohemia"
, address =	"Pilsen, Czech Republic"
, month =	jan
, year =	1994
, pages =	"158--167"
, comments =	"$O(n \log h)$ 2D convex hull algorithm using duality
mapping"
, update =	"98.07 icking, 95.09 korneenko, 95.05 korneenko"
}

@inproceedings{kr-nltas-99
, author =	"S. Kolliopoulos and S. Rao"
, title =	"A nearly linear-time approximation scheme for the {Euclidean} $k$-median problem"
, booktitle =	"Proc. 7th Annu. European Sympos. Algorithms"
, year =	1999
, pages =	"378--389"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{k-atubv-01
, author =	"Vladlen Koltun"
, title =	"Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions"
, booktitle =	"Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	2001
, update =	"01.07 orourke"
}

@inproceedings{k-ispgs-01
, author =	"Vladlen Koltun"
, title =	"Intersection Searching Problems in General Settings"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"89--92"
, update =	"01.04 icking"
}

@article{kkv-arcbt-89
, author =	"D. K{\"o}lzow and A. Kuba and A. Vol{\v c}i{\v c}"
, title =	"An algorithm for reconstructing convex bodies from their projections"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"205--237"
}

@article{k-scnds-88
, author =	"P. Komj{\'a}th"
, title =	"A simplified construction of nonlinear {Davenport--Schinzel} sequences"
, journal =	"J. Combin. Theory Ser. A"
, volume =	49
, year =	1988
, pages =	"262--267"
, update =	"98.07 icking, 95.09 agarwal"
}

@incollection{k-stces-93
, author =	"P. Komj{\'a}th"
, title =	"Set Theoretic Constructions in {Euclidean} Spaces"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"303--325"
, keywords =	"survey paper, axiom of choice, decomposition, coloring, continuum hypothesis, Hilbert space, paradoxical sets"
, update =	"93.09 erickson"
}

@article{kpw-atben-92
, author =	"J. Koml{\'o}s and J. Pach and G. Woeginger"
, title =	"Almost tight bounds for $\epsilon$-nets"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"163--173"
, succeeds =	"pw-snben-90"
, update =	"93.09 rote"
}

@article{ks-ppars-85
, author =	"J. Komlos and M. T. Shing"
, title =	"Probabilistic partitioning algorithms for the rectilinear {Steiner} tree problem"
, journal =	"Networks"
, volume =	15
, year =	1985
, pages =	"413--423"
, update =	"01.07 devillers, 98.07 bibrelex"
}

@article{kmr-drrmp-88
, author =	"T. Y. Kong and D. M. Mount and A. W. Roscoe"
, title =	"The decomposition of a rectangle into rectangles of minimal perimeter"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"1215--1231"
}

@article{kmw-dsrmp-87
, author =	"T. Y. Kong and D. M. Mount and M. Werman"
, title =	"The Decomposition of a Square into Rectangles of Minimal Perimeter"
, journal =	"Discrete Appl. Math."
, volume =	16
, year =	1987
, pages =	"239--243"
, update =	"96.01 werman"
}

@book{k-eidat-03
, author =	"Julius K{\"o}nig"
, title =	"{Einleitung} in die allgemeine {Theorie} der algebraischen {Gr{\"o}{\ss}en}"
, publisher =	"B. G. Teubner"
, address =	"Leipzig"
, year =	1903
, update =	"99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
}

@article{ks-envci-84
, author =	"S. B. Konyagin and K. A. Savastyanov"
, title =	"Estimation of the number of vertices of a convex integral polyhedron in terms of its volume"
, journal =	"Functional Anal. Appl."
, volume =	18
, year =	1984
, pages =	"13--15"
, update =	"97.11 bibrelex"
}

@article{kf-nvstc-72
, author =	"W. L. G. Koontz and K. Fukunaga"
, title =	"A nonparametric valley-seeking technique for clustering analysis"
, journal =	"IEEE Trans. Comput."
, volume =	"C-21"
, year =	1972
, pages =	"171--178"
}

@article{knf-gtanp-76
, author =	"W. L. G. Koontz and P. M. Narendra and K. Fukunaga"
, title =	"A graph-theoretical approach to non-parametric cluster analysis"
, journal =	"IEEE Trans. Comput."
, volume =	"C-25"
, year =	1976
, pages =	"936--944"
}

@phdthesis{k-stpvp-92
, author =	"A. A. Kooshesh"
, title =	"Structuring Techniques for Path and Visibility Problems"
, type =	"Ph.{D}. Thesis"
, school =	"University of New Mexico"
, address =	"Albuquerque, NM 87131"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"93.05 moret"
}

@inproceedings{km-fsp-95
, author =	"A. A. Kooshesh and B. M. E. Moret"
, title =	"Folding a simple polygons: a paradigm for computational geometry"
, booktitle =	"Proc. ACM Comput. Science Conf."
, year =	1995
, pages =	"114--118"
, update =	"98.03 moret"
}

@inproceedings{km-ftsps-91
, author =	"A. A. Kooshesh and B. M. E. Moret"
, title =	"Folding triangulated simple polygons: structural and algorithmic results"
, booktitle =	"Proc. 3rd Int'l Conf. on Information and Computing"
, series =	"Lecture Notes Comput. Sci."
, volume =	497
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"102--110"
, update =	"93.09 erickson, 93.05 moret"
}

@article{km-tcvts-92
, author =	"A. A. Kooshesh and B. M. E. Moret"
, title =	"Three-coloring the vertices of a triangulated simple polygon"
, journal =	"Pattern Recogn."
, volume =	25
, year =	1992
, pages =	443
, update =	"93.05 moret"
}

@article{kms-ibpyp-90
, author =	"A. A. Kooshesh and B. M. E. Moret and L. A. Sz{\'e}kely"
, title =	"Improved bounds for the prison yard problem"
, journal =	"Congr. Numer."
, volume =	76
, year =	1990
, pages =	"145--149"
, update =	"93.09 rote, 93.05 moret"
}

@article{k-amctp-63
, author =	"R. J. Kopec"
, title =	"An alternate method for the construction of {Thiessen} polygons"
, journal =	"Professional Geographer"
, volume =	14
, year =	1963
, pages =	"24--26"
}

@article{kj-mecha-78
, author =	"J. Koplowitz and D. Jouppi"
, title =	"A more efficient convex hull algorithm"
, journal =	"Inform. Process. Lett."
, volume =	7
, year =	1978
, pages =	"56--57"
}

@incollection{kg-xdgc-94
, author =	"Manfred Kopp and Michael Gervautz"
, title =	"{XOR}-Drawing with Guaranteed Contrast"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"413--414"
, keywords =	"cursor"
, update =	"94.09 heckbert"
, annote =	"Gives simple guidelines for the choice of write mask when
drawing cursors and other graphics with exclusive-OR on multi-bit frame
buffers."
}

@article{k-aapge-78
, author =	"R. Koppe"
, title =	"Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Orten der Knotenbilder"
, journal =	"Computing"
, volume =	20
, year =	1978
, pages =	"61--73"
, update =	"98.03 bibrelex"
}

@article{kmw-jsttd-91
, author =	"R. Kopperman and P. R. Meyer and R. G. Wilson"
, title =	"A {Jordan} surface theorem for three-dimensional digital spaces"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"155--161"
}

@techreport{k-smrra-
, author =	"J. U. Korien"
, title =	"Solid Modeling Requirements for Robotic Applications"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	"??"
, update =	"97.11 bibrelex"
}

@inproceedings{ksfsp-fnnsm-96
, author =	"Flip Korn and Nikolaos Sidiropoulos and Christos Faloutsos and Eliot Siegel and Zenon Protopapa"
, title =	"Fast Nearest Neighbor Search in Medical Image Database"
, booktitle =	"Proc. 22nd VLDB Conference"
, year =	1996
, pages =	"215--226"
, update =	"97.07 agarwal"
}

@inproceedings{k-vdags-91
, author =	"N. M. Korneenko"
, title =	"Voronoi diagrams: applications and generalizations: a survey"
, booktitle =	"Geometrical Problems of Image Processing, Proc. 5th Workshop, Georgenthal, March 11--15, 1991"
, series =	"Research in Informatics"
, volume =	4
, publisher =	"Akademie-Verlag"
, address =	"Berlin, Germany"
, year =	1991
, pages =	"136--146"
, keywords =	"{Voronoi} diagram, generalized {Voronoi} diagram, bibliography"
, update =	"95.01 korneenko"
, annote =	"Partly classified bibliography"
}

@inproceedings{km-afwps-90
, author =	"N. M. Korneenko and H. Martini"
, title =	"Approximating finite weighted point sets by hyperplanes"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"276--286"
}

@incollection{km-hart-93
, author =	"N. M. Korneenko and H. Martini"
, title =	"Hyperplane Approximation and Related Topics"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, address =	"Heidelberg"
, year =	1993
, pages =	"135--161"
, keywords =	"survey paper, hyperplane approximation/fitting"
, update =	"97.03 agarwal, 93.09 erickson"
}

@article{km-lppcs-93
, author =	"N. M. Korneenko and N. N. Metelskij"
, title =	"On lattice points in polyhedral cross-sections"
, journal =	"Discrete Comput. Geom."
, volume =	10
, number =	1
, year =	1993
, pages =	"95--99"
, keywords =	"convex polyhedron, integer points"
, update =	"95.01 korneenko"
}

@article{km-fpraa-83
, author =	"P. Kornerup and D. Matula"
, title =	"Finite Precision Rational Arithmetic: {An} Arithmetic Unit"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, number =	4
, month =	apr
, year =	1983
, update =	"98.03 bibrelex"
}

@mastersthesis{k-gbs-83
, author =	"M. Korp"
, title =	"Geradlinig begrenztes {Suchen}"
, type =	"M.{Sc}. Thesis"
, school =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1983
, keywords =	"master thesis"
}

@incollection{kps-stvl-90
, author =	"B. Korte and H. J. Pr{\"o}mel and A. Steger"
, title =	"Steiner trees in {VLSI}-Layout"
, editor =	"B. Korte and L. Lov{\'a}sz and H. J. Pr{\"o}mel and A. Schrijver"
, booktitle =	"Paths, Flows and VLSI-Layout"
, publisher =	"Springer-Verlag"
, year =	1990
, update =	"98.07 bibrelex"
}

@book{kv-cota-00
, author =	"B. Korte and J. Vygen"
, title =	"Combinatorial Optimization, Theory and Algorithms"
, series =	"Algorithms and Combinatorics"
, volume =	21
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	2000
, update =	"00.11 smid"
}

@inproceedings{kr-dgipc-99
, author =	"Ulrich H. Kortenkamp and J{\"u}rgen Richter-Gebert"
, title =	"Dynamic Geometry {I}: The Problem of Continuity"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"51--53"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{kr-dgiia-99
, author =	"Ulrich H. Kortenkamp and J{\"u}rgen Richter-Gebert"
, title =	"Dynamic Geometry {II}: Applications"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"109--111"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@incollection{kg-ifics-96
, author =	"P. Kortum and S. Geisler"
, title =	"Implementation of a foveated image coding system for image bandwidth reduction"
, booktitle =	"Human Visions and Electronic Imaging"
, series =	"Proc. SPIE"
, volume =	2657
, publisher =	"SPIE"
, year =	1996
, pages =	"350--360"
, update =	"98.07 bibrelex"
}

@article{kt-cdcct-90
, author =	"G. K{\'o}s and J. T{\"o}r{\H o}csik"
, title =	"Convex disks can cover their shadow"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"529--531"
}

@inproceedings{km-pgand-91
, author =	"C. Kosak and J. Marks"
, title =	"A Parallel Genetic Algorithm for Network-Diagram Layout"
, booktitle =	"Proc. 4th Internat. Conf. on Genetic Algorithms"
, nickname =	"ICGA '91"
, year =	1991
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 93.09 tamassia"
}

@article{kms-alnds-94
, author =	"C. Kosak and J. Marks and S. Shieber"
, title =	"Automating the Layout of Network Diagrams with Specified Visual Organization"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	24
, number =	3
, year =	1994
, pages =	"440--454"
, keywords =	"graph drawing"
, update =	"95.05 tamassia"
}

@inproceedings{k-oricm-94
, author =	"S. R. Kosaraju"
, title =	"An Optimal {RAM} Implementation of Catenable Min Double-ended Queues"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"195--203"
, update =	"98.03 bibrelex"
}

@inproceedings{k-lssl-81
, author =	"S. R. Kosaraju"
, title =	"Localized Search in Sorted Lists"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
, year =	1981
, pages =	"62--69"
, update =	"98.03 bibrelex"
}

@inproceedings{k-msp-79
, author =	"S. R. Kosaraju"
, title =	"On a multidimensional search problem"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
, year =	1979
, pages =	"67--73"
}

@article{ka-osbmc-88
, author =	"S. R. Kosaraju and M. J. Atallah"
, title =	"Optimal simulations between meshed-connected arrays of processors"
, journal =	"J. ACM"
, volume =	"??"
, month =	jul
, year =	1988
, pages =	"635--650"
, update =	"98.03 bibrelex"
}

@incollection{kd-opets-88
, author =	"S. R. Kosaraju and A. L. Delcher"
, title =	"Optimal Parallel Evaluation of Tree-Structured Computations by Raking"
, booktitle =	"Proc. AWOC 88"
, series =	"Lecture Notes Comput. Sci."
, volume =	319
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"101--110"
, update =	"96.09 orourke"
}

@techreport{ksb-aagdp-97
, author =	"S. R. Kosaraju and A. A. Sch{\"a}ffer and L. G. Biesecker"
, title =	"Approximation Algorithms for a Genetic Diagnostics Problem"
, type =	"Research {Report}"
, institution =	"Center for Geometric Computing"
, address =	"Johns Hopkins Univ."
, year =	1997
, update =	"97.03 tamassia"
}

@book{k-tvs1-69
, author =	"G. K{\"o}the"
, title =	"Topological Vector Spaces {I}"
, publisher =	"Springer-Verlag"
, year =	1969
, update =	"98.03 bibrelex"
}

@inproceedings{ks-sssj-97
, author =	"N. Koudas and K. C. Sevcik"
, title =	"Size separation spatial join"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1997
, pages =	"324--335"
, update =	"97.07 agarwal"
}

@techreport{ko-fapd-82
, author =	"N. Kouta and J. O'Rourke"
, title =	"Fast algorithms for polygon decomposition"
, type =	"Report"
, number =	"JHU82-10"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1982
}

@misc{kn-dgd-93
, author =	"E. Koutsofios and S. North"
, title =	"Drawing graphs with {\em dot}"
, year =	1993
, note =	"{\em dot} user's manual. \url{ftp.research.bell-labs.com/dist/drawdag/}"
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@techreport{kn-dgd-95
, author =	"E. Koutsofios and S. North"
, title =	"Drawing Graphs with {\em dot}"
, institution =	"AT\&T Bell Laboratories, Murray Hill, NJ."
, year =	1995
, note =	"Available from \url{http://www.research.bell-labs.com/dist/drawdag}"
, keywords =	"graph drawing, system"
, update =	"96.09 tamassia, 96.04 garg"
}

@inproceedings{k-grsmo-85
, author =	"A. Koutsou"
, title =	"A geometric reasoning system for moving an object while maintaining contact with others"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"67--74"
, cites =	"hw-moc-84, hw-rmomp-84, k-srspm-84, lw-apcfp-79, m-cfccc-79, m-hct-78, p-smtsr-79, rt-mfcsg-78, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{k-srspm-84
, author =	"A. Koutsou"
, title =	"A Spatial Reasoning System for Parts Mating Operations"
, type =	"Working {Paper}"
, number =	173
, institution =	"Dept. Artif. Intell., Univ. Edinburgh"
, address =	"Edingburgh, Scotland"
, month =	oct
, year =	1984
, update =	"97.11 bibrelex"
}

@techreport{k-oeupj-88
, author =	"A. Koutsou"
, title =	"Object exploration using a parallel-jaw gripper"
, type =	"Technical {Report}"
, number =	"MS-CIS-88-48"
, institution =	"Grasp Lab, Univ. Pennsylvania"
, year =	1988
, update =	"98.07 bibrelex"
}

@inproceedings{kps-obp-90
, author =	"E. Koutsoupias and C. H. Papadimitriou and M. Sideri"
, title =	"On the optimal bisection of a polygon"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"198--202"
, precedes =	"kps-obp-92"
, cites =	"ps-bwgg-90, ps-coac-82, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{kps-obp-92
, author =	"Elias Koutsoupias and Christos H. Papadimitriou and Martha Sideri"
, title =	"On the Optimal Bisection of a Polygon"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"435--438"
, succeeds =	"kps-obp-90"
, update =	"98.03 mitchell"
, annote =	"Special issue on computational geometry; J. Mitchell and
                  J. Karel Lenstra, eds."
}

@article{kst-pkz-54
, author =	"T. K{\H o}v{\'a}ri and V. T. S{ \'o}s and P. Tur{\'a}n"
, title =	"On a problem of {K}. {Zarankiewicz}"
, journal =	"Colloq. Math."
, volume =	3
, year =	1954
, pages =	"50--57"
, update =	"98.03 bibrelex"
}

@techreport{ky-acdn-??
, author =	"D. Kozen and C. K. Yap"
, title =	"Algebraic cell decomposition in {NC}"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@techreport{k-apacl-94
, author =	"B. van de Kraats"
, title =	"Approximation of polygons with applications to circuit layout"
, type =	"Report"
, number =	"INF/SC-94-39"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1994
, update =	"98.03 bibrelex"
}

@incollection{kl-cwrfm-84
, author =	"M. R. Kramer and J. van Leeuwen"
, title =	"The Complexity of Wire-Routing and Finding Minimum Area Layouts for Arbitrary {VLSI} Circuits"
, editor =	"Franco P. Preparata"
, booktitle =	"VLSI Theory"
, series =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1984
, pages =	"129--146"
, keywords =	"graph drawing"
, update =	"01.04 icking, 93.09 tamassia"
}

@inproceedings{kkm-llrwt-90
, author =	"E. Kranakis and D. Krizanc and L. Meertens"
, title =	"Link length of rectilinear watchman tours in grids"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"328--331"
, cites =	"cn-owr-86, dls-oaclc-89, g-sncpg-77, h-ragp-90, lpsssstwy-clcsp-87, n-gwg-86, o-agta-87, s-pptld-86, s-agfnp-87, s-mlppr-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{kku-ndvrg-95
, author =	"E. Kranakis and D. Krizanc and J. Urrutia"
, title =	"On the Number of Directions in Visibility Representations of Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"167--176"
, keywords =	"graph drawing, visibility"
, update =	"95.01 tamassia"
}

@unpublished{kp-vil-90
, author =	"E. Kranakis and M. Picchiola"
, title =	"Visibility in integer lattices"
, year =	1990
, note =	"In Preparation"
, update =	"97.11 bibrelex"
}

@inproceedings{kp-agpil-92
, author =	"Evangelos Kranakis and Michel Pocchiola"
, title =	"Art Gallery Problems in Integer Lattice Systems"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	29
, update =	"00.03 bibrelex"
}

@article{kp-cpil-94
, author =	"E. Kranakis and M. Pocchiola"
, title =	"Camera placement in integer lattices"
, journal =	"Discrete Comput. Geom."
, volume =	12
, number =	1
, month =	jul
, year =	1994
, pages =	"91--104"
, keywords =	""
, succeeds =	"kp-evpil-90"
, update =	"96.05 pocchiola, 95.11 pocchiola"
}

@article{kp-cprdt-94
, author =	"E. Kranakis and M. Pocchiola"
, title =	"Counting problems relating to a {Dirichlet}'s theorem"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, number =	6
, month =	dec
, year =	1994
, pages =	"309--325"
, succeeds =	"kp-evpil-90"
, update =	"96.05 pocchiola, 95.11 pocchiola"
}

@techreport{kp-evpil-89
, author =	"E. Kranakis and M. Pocchiola"
, title =	"Enumeration and Visibility Problems in Integer Lattices"
, type =	"Technical {Report}"
, number =	13
, institution =	"LIENS"
, month =	dec
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{kp-evpil-90
, author =	"E. Kranakis and M. Pocchiola"
, title =	"Enumeration and visibility problems in integer lattices"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"261--270"
, cites =	"a-srcg-74, a-iant-76, bz-gi-88, cegsw-ccbac-88t, e-acg-87, e-irpnn-62, hs-pvnlp-71, hw-itn-79, k-sipan-59, k-sa-81, kp-evpil-89, kp-vil-90, m-pepfs-85, n-nt-83, n-edlde-48, o-agta-87, r-lent-64, r-??-60, r-svp-66, so-wcoac-86, st-epdg-83, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{ks-aools-97
, author =	"Evangelos Kranakis and Anthony Spatharis"
, title =	"Almost Optimal On-line Search in Unknown Streets"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"93--99"
, update =	"98.11 bibrelex, 97.11 jones"
}

@inproceedings{ku-itsns-95
, author =	"Evangelos Kranakis and Jorge Urrutia"
, title =	"Isomorphic Triangulations with Small Number of {Steiner} Points"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"291--296"
, update =	"95.09 jones"
}

@article{kkmnsu-sgr-97
, author =	"E. Kranankis and D. Krizanc and A. Maheshwari and M. Noy and J.-R. Sack and J. Urrutia"
, title =	"Stage-graph representations"
, journal =	"Discrete Applied Mathematic"
, volume =	75
, number =	1
, year =	1997
, pages =	"71--80"
, update =	"97.11 sack"
}

@proceedings{k-gd-99
, title =	"Graph Drawing (Proc. GD~'99)"
, editor =	"J. Kratochv{\'\i}l"
, series =	"Lecture Notes Comput. Sci."
, volume =	1731
, publisher =	"Springer-Verlag"
, year =	1999
, update =	"00.03 vismara"
}

@article{kln-ncstl-91
, author =	"J. Kratochvil and A. Lubiw and J. Ne{\v s}et{\v r}il"
, title =	"Non-crossing subgraphs in topological layouts"
, journal =	"SIAM J. Discrete Math."
, volume =	4
, year =	1991
, pages =	"223--244"
, update =	"97.11 bibrelex"
}

@article{km-igs-94
, author =	"J. Kratochv{\'\i}l and J. Matou{\v s}ek"
, title =	"Intersection graphs of segments"
, journal =	"J. Combin. Theory Ser. B"
, volume =	35
, number =	2
, year =	1994
, pages =	"317--339"
, update =	"95.01 matousek"
}

@article{km-sgrhr-91
, author =	"J. Kratochv{\'\i}l and J. Matou{\v s}ek"
, title =	"String graphs requiring huge representations"
, journal =	"J. Combin. Theory Ser. B"
, volume =	31
, number =	1
, year =	1991
, pages =	"1--4"
, comments =	"Shows that there are n-vertex graphs representable as
intersection graphs of curves in the plane, such that in any representation
some 2 curves cross exponentially many times."
, update =	"95.01 matousek"
}

@article{kn-iscpi-90
, author =	"J. Kratochvil and J. Ne{\v s}et{\v r}il"
, title =	"Independend set and clique problems in intersection-defined classes of graphs"
, journal =	"Comment. Math. Univ. Carol."
, volume =	31
, year =	1990
, pages =	"85--93"
, update =	"97.11 bibrelex"
}

@inproceedings{ksl-pcdcv-97
, author =	"F.-L. Krause and C. Stiel and J. Luddermann"
, title =	"Processing of {CAD}-data-conversion, verification and repair"
, booktitle =	"Proc. 4th ACM Sympos. Solid Modeling"
, site =	"Atlanta, GA"
, year =	1997
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@inproceedings{kp-sstma-90
, author =	"D. Kravets and J. K. Park"
, title =	"Selection and sorting in totally monotone arrays"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"494--502"
}

@book{kn-mmpep-77
, author =	"M. G. Krein and A. A. Nudel'man"
, title =	"The {Markov} moment problem and extremal problems"
, publisher =	"American Mathematical Society"
, year =	1977
}

@phdthesis{k-nrdsc-92
, author =	"M. J. van Kreveld"
, title =	"New Results on Data Structures in Computational Geometry"
, type =	"Ph.{D}. Dissertation"
, school =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"97.07 agarwal, 94.05 schwarzkopf"
}

@article{kb-fsrsp-91
, author =	"M. J. van Kreveld and M. T. de Berg"
, title =	"Finding squares and rectangles in sets of points"
, journal =	"BIT"
, volume =	31
, year =	1991
, pages =	"202--219"
}

@techreport{ko-cst-88
, author =	"M. J. van Kreveld and M. H. Overmars"
, title =	"Concatenable segment trees"
, number =	"RUU-CS-88-36"
, institution =	"Computer Science Department, Univ. of Utrecht"
, address =	"Utrecht, Netherlands"
, year =	1988
, update =	"98.03 bibrelex"
}

@inproceedings{ko-csdp-90
, author =	"Marc J. van Kreveld and Mark H. Overmars"
, title =	"Concatenable Structures for Decomposable Problems"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	15
, update =	"00.03 bibrelex"
}

@article{ko-dkdt-91
, author =	"M. J. van Kreveld and M. H. Overmars"
, title =	"Divided $k$-d trees"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"840--858"
}

@inproceedings{koa-iqsd-90i
, author =	"M. J. van Kreveld and M. H. Overmars and P. K. Agarwal"
, title =	"Intersection queries in sets of disks"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"393--403"
}

@inproceedings{k-att-97
, author =	"M. van Kreveld"
, title =	"Algorithms for triangulated terrains"
, booktitle =	"Proc. XXIV-th SOFSEM"
, series =	"Lecture Notes Comput. Sci."
, number =	1338
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"19--36"
, update =	"98.07 oostrum"
}

@incollection{k-demta-97
, author =	"M. van Kreveld"
, title =	"Digital elevation models and {TIN} algorithms"
, editor =	"M. van Kreveld and J. Nievergelt and T. Roos and P. Widmayer"
, booktitle =	"Algorithmic Foundations of Geographic Information Systems"
, series =	"Lecture Notes Comput. Sci."
, number =	1340
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"37--78"
, update =	"99.11 bibrelex, 98.07 oostrum"
}

@inproceedings{k-emied-94
, author =	"M. van Kreveld"
, title =	"Efficient methods for isoline extraction from a digital elevation model based on triangulated irregular networks"
, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
, publisher =	"Taylor \& Francis"
, year =	1994
, pages =	"835--847"
, note =	"to appear in: {\em Int.\ J. on GIS}"
, keywords =	"isolines, contours, interval tree, polyhedral terrains"
, update =	"96.09 kreveld"
}

@article{k-emiet-96
, author =	"M. van Kreveld"
, title =	"Efficient methods for isoline extraction from a {TIN}"
, journal =	"Internat. J. of GIS"
, volume =	10
, year =	1996
, pages =	"523--540"
, update =	"98.07 bibrelex+oostrum"
}

@techreport{k-fpfcu-93t
, author =	"M. van Kreveld"
, title =	"On fat partitioning, fat covering and the union size of polygons"
, type =	"Technical Report"
, number =	"SOCS-93.2"
, institution =	"School of Computer Science, McGill University"
, year =	1993
, precedes =	"k-fpfcu-98, k-fpfcu-93"
, update =	"98.11 bibrelex"
}

@inproceedings{k-fpfcu-93
, author =	"Marc van Kreveld"
, title =	"On Fat Partitioning, Fat Covering, and the Union Size of Polygons"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"452--463"
, succeeds =	"k-fpfcu-93t"
, precedes =	"k-fpfcu-98"
, update =	"98.11 bibrelex, 98.03 mitchell, 95.01 smid, 93.09 smid, 93.05 jones"
}

@article{k-fpfcu-98
, author =	"Marc van Kreveld"
, title =	"On Fat Partitioning, Fat Covering, and the Union Size of Polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, number =	4
, year =	1998
, pages =	"197--210"
, issn =	"0925-7721"
, succeeds =	"k-fpfcu-93t, k-fpfcu-93"
, update =	"98.11 bibrelex, 98.03 mitchell"
}

@inproceedings{k-qppt-94
, author =	"M. van Kreveld"
, title =	"On Quality Paths in Polyhedral Terrains"
, booktitle =	"Proc. IGIS'94: Geographic Information Systems"
, series =	"Lecture Notes Comput. Sci."
, volume =	884
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"113--122"
, keywords =	"shortest paths, polyhedral terrains"
, update =	"96.09 kreveld"
}

@techreport{k-ppp-92
, author =	"M. van Kreveld"
, title =	"The power of parallel projection"
, type =	"Report"
, number =	"RUU-CS-92-17"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1992
, update =	"94.05 schwarzkopf, 94.01 smid"
}

@article{k-ppp-93
, author =	"M. van Kreveld"
, title =	"The power of parallel projection"
, journal =	"Inform. Process. Lett."
, volume =	46
, year =	1993
, pages =	"185--191"
, succeeds =	"k-ppp-92"
, update =	"97.11 bibrelex, 94.01 smid"
}

@inproceedings{k-vsaec-96
, author =	"M. van Kreveld"
, title =	"Variations on sweep algorithms: efficient computation of extended viewsheds and classifications"
, booktitle =	"Proc. 7th Internat. Sympos. Spatial Data Handling"
, year =	1996
, pages =	"13A.15--13A.27"
, update =	"98.07 oostrum"
}

@inproceedings{kko-pcbss-95
, author =	"Marc van Kreveld and Berto van de Kraats and Mark Overmars"
, title =	"Printed Circuit Board Simplification: {Simplifying} Subdivisions in Practice"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C30--C31"
, keywords =	"polygon simplification, decimation"
, cites =	"abb-amps-91, bks-nass-95, be-mgot-95, cmwms-feps-93, elosu-scqp-92, ghms-apsml-93, h-patmn-93, k-apacl-94, ZZZ"
, update =	"98.07 icking, 98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{kobps-ctsss-97
, author =	"M. van Kreveld and R. van Oostrum and C. Bajaj and V. Pascucci and D. Schikore"
, title =	"Contour Trees and Small Seed Sets for Isosurface Traversal"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"212--220"
, cites =	"amo-nftaa-93, afh-tdie3-81, bps-fiii-96, bcd-auhsm-95, cmps-oieiv-96, bk-tawfg-93, db-dcghs-94, fm-scmgt-67, gc-sontr-86, h-dt-76, hb-mpaic-94, ik-aipue-95, kk-ettfe-94, lsj-noiea-96, m-mt-63, ps-cgi-85, r-slpsd-46, sk-crgac-91, skk-scbmt-91, sc-aipta-86, tisku-aeccp-95, k-emiet-96, w-cgads-92, wv-ofig-92, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{kos-essid-97
, author =	"M. van Kreveld and R. van Oostrum and J. Snoeyink"
, title =	"Efficient settlement selection for interactive display"
, booktitle =	"Proc. Auto-Carto 13: ACSM/ASPRS Annual Convention Technical Papers"
, year =	1997
, pages =	"287--296"
, update =	"98.07 oostrum"
}

@article{ko-ucsds-93
, author =	"M. van Kreveld and M. Overmars"
, title =	"Union-Copy Structures and Dynamic Segment Trees"
, journal =	"J. ACM"
, volume =	40
, year =	1993
, pages =	"635--652"
, keywords =	"union-find, data structures, dynamic segment trees"
, update =	"96.09 kreveld"
}

@techreport{koa-iqsd-90t
, author =	"M. van Kreveld and M. Overmars and P. K. Agarwal"
, title =	"Intersection Queries in Sets of Disks"
, type =	"Technical {Report}"
, number =	"90-26"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{koa-iqsd-92
, author =	"M. van Kreveld and M. Overmars and P. K. Agarwal"
, title =	"Intersection queries in sets of disks"
, journal =	"BIT"
, volume =	32
, year =	1992
, pages =	"268--279"
, keywords =	"disks, partition trees, intersection"
, succeeds =	"koa-iqsd-90i"
, update =	"96.09 kreveld"
}

@inproceedings{ksw-frit-93
, author =	"M. van Kreveld and J. Snoeyink and S. Whitesides"
, title =	"Folding rulers inside triangles"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"1--6"
, cites =	"hjw-mp2dl-84, hjw-mra2d-85, jp-crmpq-85, k-mslra-92, kk-namra-86, lw-tpio-91, lw-rltm-92, lw-rcpce-95, w-aigpl-92, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{ksw-frit-96
, author =	"M. van Kreveld and J. Snoeyink and S. Whitesides"
, title =	"Folding rulers inside triangles"
, journal =	"Discrete Comput. Geom."
, volume =	15
, year =	1996
, pages =	"265--285"
, keywords =	"rulers, linkages, reconfiguration"
, succeeds =	"ksw-frit-93"
, update =	"96.09 kreveld"
}

@inproceedings{kbs-csamc-91
, author =	"H.-P. Kriegel and T. Brinkhoff and R. Schneider"
, title =	"The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems"
, booktitle =	"Proc. 2rd Sympos. Advances in Spatial Databases"
, series =	"Lecture Notes Comput. Sci."
, number =	525
, year =	1991
, pages =	"5--21"
, update =	"96.09 kreveld"
}

@techreport{kmo-iftme-85
, author =	"H.-P. Kriegel and R. Mannss and M. H. Overmars"
, title =	"The inverted file tree machine: efficient multi-key retrieval for {VLSI}"
, type =	"Report"
, number =	"RUU-CS-85-8"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1985
, update =	"94.05 schwarzkopf"
}

@inproceedings{ks-erigm-90
, author =	"H.-P. Kriegel and M. Schiwietz"
, title =	"{Eine} effiziente und robuste {Indexstruktur} f{\"u}r gro{\ss}e {Mengen} polygonaler {Objekte}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	16
, update =	"00.03 bibrelex"
}

@incollection{ks-moplh-86
, author =	"H.-P. Kriegel and B. Seeger"
, title =	"Multidimensional order preserving linear hashing with partial expansions"
, booktitle =	"Proc. Intl. Conf. on Database Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	243
, publisher =	"Springer-Verlag"
, year =	1986
, pages =	"203--220"
, update =	"97.07 agarwal"
}

@inproceedings{kv-nodts-81
, author =	"H. P. Kriegel and V. K. Vaishnavi"
, title =	"A nearly optimal dynamic tree structure for partial-match queries with time-varying access frequencies"
, booktitle =	"Proc. 1981 Conf. Inform. Sci. Systems"
, publisher =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1981
, pages =	"??"
}

@inproceedings{kv-wmbtu-81
, author =	"H. P. Kriegel and V. K. Vaishnavi"
, title =	"Weighted multidimensional $b$-trees used as nearly optimal dynamic dictionaries"
, booktitle =	"Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	118
, publisher =	"Springer-Verlag"
, year =	1981
, pages =	"410--417"
}

@article{k-cspps-92
, author =	"D. J. Kriegman"
, title =	"Computing stable poses of piecewise smooth objects"
, journal =	"CVGIP: Image Understanding"
, volume =	55
, number =	2
, month =	mar
, year =	1992
, update =	"98.03 bibrelex"
}

@phdthesis{k-arssi-90
, author =	"G. A. Kriezis"
, title =	"Algorithms for Rational Spline Surface Intersections"
, type =	"Ph.{D}. Thesis"
, school =	"Massachusetts Institute of Technology"
, address =	"Cambridge, Massachusetts"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"95.05 abrams"
}

@inproceedings{kp-rpsi-91
, author =	"G. A. Kriezis and N. M. Patrikalakis"
, title =	"Rational Polynomial Surface Intersections"
, editor =	"G. A. Gabriele"
, booktitle =	"Proc. 17th ASME Design Automation Conference"
, volume =	"II"
, year =	1991
, pages =	"43--53"
, update =	"95.05 abrams"
}

@article{kpw-tdems-92
, author =	"G. A. Kriezis and N. M. Patrikalakis and F.-E. Wolter"
, title =	"Topological and Differential Equation Methods for Surface Intersections"
, journal =	"Comput. Aided Design"
, volume =	24
, number =	1
, year =	1992
, pages =	"41--55"
, update =	"95.05 abrams"
}

@article{kpp-miasr-90
, author =	"G. A. Kriezis and P. V. Prakash and N. M. Patrikalakis"
, title =	"A Method for Intersecting Algebraic Surfaces with Rational Polynomial Patches"
, journal =	"Comput. Aided Design"
, volume =	22
, number =	10
, year =	1990
, pages =	"645--654"
, update =	"95.05 abrams"
}

@inproceedings{k-mpnte-95
, author =	"J. Kripac"
, title =	"A mechanism for persistently naming topological entities in history-based parametric solid models"
, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
, site =	"Salt Lake City, UT"
, month =	may
, year =	1995
, update =	"98.07 bibrelex"
}

@techreport{kw-mgf-85
, author =	"R. Krishnamurthy and K.-Y. Wang"
, title =	"Multilevel grid files"
, type =	"Tech.\ Report"
, institution =	"IBM T. J. Watson Center"
, address =	"Yorktown Heights, NY"
, year =	1985
, update =	"97.07 agarwal"
}

@techreport{km-esiab-94
, author =	"S. Krishnan and D. Manocha"
, title =	"An efficient surface intersection algorithm based on the lower dimensional formulation"
, type =	"Technical {Report}"
, number =	"TR94-062"
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, year =	1994
, update =	"98.03 bibrelex"
}

@techreport{knm-bscbc-94
, author =	"S. Krishnan and A. Narkhede and D. Manocha"
, title =	"Boole: {A} system to compute boolean combinations of sculptured solids"
, type =	"Technical {Report}"
, number =	"TR95-008"
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, year =	1994
, update =	"98.03 bibrelex"
}

@inproceedings{knm-rcbcs-95
, author =	"Shankar Krishnan and Atul Narkhede and Dinesh Manocha"
, title =	"Representation and Computation of Boolean Combinations of Sculptured Models"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C8--C9"
, keywords =	"CSG"
, cites =	"h-gsm-89, km-esiab-94, knm-bscbc-94, s-lpchm-90, s-sfira-91, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{kplm-sshob-98
, author =	"S. Krishnan and A. Pattekar and M. Lin and D. Manocha"
, title =	"Spherical Shells: {A} Higher Order Bounding Volume for Fast Proximity Queries"
, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
, nickname =	"WAFR '98"
, year =	1998
, pages =	"to appear"
, url =	"http://www.cs.unc.edu/~dm/collision.html"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{kk-ppsva-88
, author =	"R. P. Krishnaswamy and C. E. Kim"
, title =	"Problems of posting sentries: variations of the {Art} {Gallery} {Theorem}"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"74--85"
}

@inproceedings{krsv-vprma-96
, author =	"K. Krithivasan and A. Rema and S. Schirra and P. I. Vijaykumar"
, title =	"Velocity planning for a robot moving along the shortest straight line path among moving obstacles"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"149--154"
, update =	"96.09 mitchell"
}

@article{ks-maptr-01
, author =	"K. Krithivasan and V. Srilakshmi"
, title =	"Minimum area polygons with two reflex angles enclosing {$k$} points"
, journal =	"Internat. J. Comput. Math."
, volume =	78
, year =	2001
, comments =	"to appear"
, update =	"01.04 smid"
}

@techreport{kvd-lhrtd-92
, author =	"K. Krithivasan and R. Vanisree and A. Datta"
, title =	"The largest hyper-rectangle in a three dimensional orthogonal polyhedron"
, type =	"Report"
, number =	"MPI-I-92-123"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
}

@inproceedings{km-cmsvc-85
, author =	"M. Kriv{\'a}nek and J. Mor{\'a}vek"
, title =	"Clustering to minimize the sum of volumes of convex hulls of clusters is {NP}-complete"
, editor =	"L. Budach"
, booktitle =	"Proc. Found. Comput. Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	199
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"234--241"
}

@article{k-geatd-82
, author =	"L. Kronecker"
, title =	"{Grundz{\"u}ge} einer arithmetischen {Theorie} der algebraischen {Gr{\"o}{\ss}e}"
, journal =	"Crelle J."
, volume =	92
, year =	1882
, pages =	"1--122"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@inproceedings{kc-ecntm-00
, author =	"Boris Kronrod and Craig Cotsman"
, title =	"Efficient Coding of Non-Triangular Meshes"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"24--26"
, update =	"00.03 bibrelex"
}

@article{k-isasm-82
, author =	"J. K. Krouse"
, title =	"Industry gets serious about solid modeling"
, journal =	"Computer Aided Engineering"
, volume =	1
, year =	1982
, pages =	"22--26"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@phdthesis{k-ippvt-92
, author =	"J. Krozel"
, title =	"Intelligent Path Prediction for Vehicular Travel"
, type =	"Ph.{D}. Thesis"
, school =	"Purdue Univ."
, address =	"W. Lafayette, IN"
, month =	may
, year =	1992
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@article{ka-ippvt-93
, author =	"J. Krozel and D. Andrisani"
, title =	"Intelligent Path Prediction for Vehicular Travel"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	23
, year =	1993
, pages =	"478--487"
, keywords =	"path prediction, gradient field representation, generalized cost criteria, path similarity"
, update =	"98.11 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
}

@phdthesis{k-darp-85
, author =	"F. Krueger"
, title =	"$d$-Arrangements and random polyhedra"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. of Operations Research, Stanford University"
, year =	1985
, keywords =	"arrangements, face counting, Zaslavski's formulas, duality"
}

@book{k-eukav-52
, author =	"W. Krull"
, title =	"Elementare und klassische {Algebra} vom modernen {Standpunkt}, Part I"
, publisher =	"DeGruyter"
, address =	"Berlin, Germany"
, year =	1952
, update =	"97.11 bibrelex"
}

@book{k-eukav-59
, author =	"W. Krull"
, title =	"Elementare und klassische {Algebra} vom modernen {Standpunkt}, Part II"
, publisher =	"DeGruyter"
, address =	"Berlin, Germany"
, year =	1959
, update =	"97.11 bibrelex"
}

@article{krs-ctepa-90
, author =	"C. Kruskal and L. Rudolph and M. Snir"
, title =	"A complexity theory of efficient parallel algorithms"
, journal =	"Theoret. Comput. Sci."
, volume =	71
, year =	1990
, pages =	"95--132"
, update =	"96.09 orourke"
}

@inproceedings{krs-ppp-85
, author =	"C. P. Kruskal and L. Rudolph and M. Snir"
, title =	"The Power of Parallel Prefix"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1985
, pages =	"180--185"
, update =	"97.11 bibrelex"
}

@article{krs-ppp-85a
, author =	"C. P. Kruskal and L. Rudolph and M. Snir"
, title =	"The power of parallel prefix"
, journal =	"IEEE Trans. Comput."
, volume =	"C-34"
, year =	1985
, pages =	"965--968"
, update =	"97.11 bibrelex"
}

@inproceedings{ks-dnd-80
, author =	"J. B. Kruskal and J. B. Seery"
, title =	"Designing Network Diagrams"
, booktitle =	"Proc. First General Conference on Social Graphics"
, publisher =	"U. S. Department of the Census"
, year =	1980
, pages =	"22--50"
, keywords =	"graph drawing, physical simulation, force-directed"
, update =	"95.05 tamassia"
}

@article{k-sssgt-56
, author =	"J. B. {Kruskal, Jr.}"
, title =	"On the shortest spanning subtree of a graph and the traveling salesman problem"
, journal =	"Proc. Amer. Math. Soc."
, volume =	7
, year =	1956
, pages =	"48--50"
}

@article{ks-nhovd-94
, author =	"J. W. Krussel and B. F. Schaudt"
, title =	"A note on higher order {Voronoi} diagrams"
, journal =	"Nordic J. Comput."
, volume =	1
, year =	1994
, pages =	"268--272"
, update =	"95.01 smid"
}

@phdthesis{k-phcmw-97
, author =	"D. Krznaric"
, title =	"Progress in Hierarchical Clustering \& Minimum Weight Triangulation"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Computer Science, Lund University"
, address =	"Lund, Sweden"
, year =	1997
, keywords =	"doctoral thesis"
, update =	"01.11 smid"
}

@inproceedings{kl-ctqlb-95
, author =	"Drago Krznaric and Christos Levcopoulos"
, title =	"Computing a Threaded Quadtree (with Links between Neighbours) from the {Delaunay} Triangulation in Linear Time"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"187--192"
, update =	"95.09 jones"
}

@incollection{kl-chcem-95
, author =	"D. Krznaric and C. Levcopoulos"
, title =	"Computing hierarchies of clusters from the {Euclidean} minimum spanning tree in linear time"
, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1026
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"443--455"
, update =	"96.01 smid"
}

@article{kl-faclc-98
, author =	"D. Krznaric and C. Levcopoulos"
, title =	"Fast Algorithms for Complete Linkage Clustering"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"131--145"
, update =	"01.11 smid"
}

@inproceedings{kl-fsacl-95
, author =	"Drago Krznaric and Christos Levcopoulos"
, title =	"The First Subquadratic Algorithm for Complete Linkage Clustering"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"392--401"
, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@inproceedings{kln-mstd-97
, author =	"D. Krznaric and C. Levcopoulos and Bengt J. Nilsson"
, title =	"Minimum Spanning Trees in {$d$} Dimensions"
, booktitle =	"Proc. 5th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1284
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"341--349"
, url =	"http://www.dna.lth.se/home/Drago_Krznaric/mst.ps"
, update =	"98.03 mitchell"
}

@inproceedings{k-tmkrs-84
, author =	"D. T. Kuan"
, title =	"Terrain Map knowledge representation for spatial planning"
, booktitle =	"The 1st IEEE Conference of Artificial Intelligence Applications"
, month =	dec
, year =	1984
, pages =	"578--584"
, keywords =	"feature-based planning, weighted region problem, hierarchical planning"
}

@inproceedings{kzb-ndfsp-85
, author =	"D. T. Kuan and J. C. Zamiska and R. A. Brooks"
, title =	"Natural Decomposition of Free Space for Path Planning"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"St. Louis, MO"
, month =	mar
, year =	1985
, pages =	"168--173"
, update =	"93.09 milone+mitchell"
}

@inproceedings{kmps-eagpp-93
, author =	"L. Ku{\v c}era and K. Mehlhorn and B. Preis and E. Schwarzenecker"
, title =	"Exact algorithms for a geometric packing problem"
, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	665
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"317--322"
, update =	"93.05 smid"
}

@inproceedings{kww-aotlc-89
, author =	"R. Kuchem and D. Wagner and F. Wagner"
, title =	"Area-Optimal Three-Layer Channel Routing"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"506--511"
, update =	"97.03 gaertner+salinger"
}

@incollection{k-irt-88
, author =	"R. Kuchkuda"
, title =	"An introduction to ray tracing"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"1039--1060"
, update =	"99.11 bibrelex"
}

@article{k-hmap-55
, author =	"H. Kuhn"
, title =	"The {Hungarian} method for the assignment problem"
, journal =	"Naval Res. Logist. Q."
, volume =	2
, year =	1955
, pages =	"83--97"
, update =	"97.11 bibrelex"
}

@inproceedings{k-rpavd-98
, author =	"Ulrich K{\"u}hn"
, title =	"A Randomized Parallel Algorithm for {Voronoi} Diagrams based on Symmetric Convex Distance Functions"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"109--111"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{k-cvduc-96
, author =	"Ulrich K{\"u}hn"
, title =	"Computing {Voronoi} Diagrams Using Convex Sweep Curves"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"41--44"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{kl-cdtls-88
, author =	"W. K{\"u}hnel and G. Lassmann"
, title =	"Combinatorial $d$-tori with a large symmetry group"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"169--176"
}

@article{k-acpr-79
, author =	"G. Kulcsar"
, title =	"Algorithm to cover polygons by rectangles"
, journal =	"Comput. Aided Data Preparation Pattern Generator Cont."
, volume =	30
, year =	1979
, pages =	"161--167"
}

@book{km-nasc-83
, title =	"A new approach to scientific computation"
, editor =	"U. Kulisch and W. L. Miranker"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1983
, update =	"98.03 bibrelex"
}

@book{km-catp-81
, author =	"U. Kulisch and W. L. Miranker"
, title =	"Computer Arithmetic in Theory and Practice"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1981
, update =	"98.03 bibrelex"
}

@article{kd-asplm-96
, author =	"Prashant Kulkarni and Deba Dutta"
, title =	"An accurate slicing procedure for layered manufacturing"
, journal =	"Comput. Aided Design"
, volume =	28
, number =	9
, year =	1996
, pages =	"683--697"
, update =	"98.03 mitchell"
}

@article{kry-ldstsw-96
, author =	"S. Kuller and B. Raghavachari and N. Young"
, title =	"Low-Degree Spanning Tree of small Weight"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, update =	"02.03 cheong"
}

@inproceedings{kv-swtwv-93
, author =	"P. Kumar and C. {Veni Madhavan}"
, title =	"Shortest watchman tours in weak visibility polygons"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"91--96"
, cites =	"p-wvrp-90, cn-swrsp-, cn-owr-88, thi-iacsw-91, ZZZ"
, update =	"98.11 bibrelex, 94.09 lambert, 93.09 milone+mitchell"
}

@inproceedings{kk-rers-99
, author =	"Ravi Kumar and D. Sivakumar"
, title =	"Roundness Estimation via Random Sampling"
, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1999
, pages =	"603--612"
, update =	"99.03 agarwal"
}

@article{kkbs-p3dpv-92
, author =	"S. Kumar and S. K. Kurtz and J. R. Banavar and M. G. Sharma"
, title =	"Properties of a 3-Dimensional {Poisson}-{Voronoi} Tesselation: a {Monte}-{Carlo} Study"
, journal =	"Journal Of Statistical Physics"
, volume =	67
, number =	"3--4"
, year =	1992
, pages =	"523--551"
}

@inproceedings{km-dmgps-96
, author =	"S. Kumar and D. Manocha"
, title =	"Dynamic mesh generation for parametric surfaces"
, booktitle =	"5th Internat. Conf. Numerical Grid Generation in Computational Fluid Dynamics and Related Fields"
, site =	"Starkville, MS"
, year =	1996
, update =	"97.11 bibrelex"
}

@article{km-ertns-95
, author =	"S. Kumar and D. Manocha"
, title =	"Efficient rendering of trimmed {NURBS} surfaces"
, journal =	"Comput. Aided Design"
, volume =	27
, number =	7
, month =	jul
, year =	1995
, pages =	"509--521"
, update =	"97.11 bibrelex"
}

@techreport{km-idlst-94
, author =	"S. Kumar and D. Manocha"
, title =	"Interactive display of large scale trimmed {NURBS} models"
, type =	"Technical {Report}"
, number =	"TR94-008"
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, year =	1994
, update =	"97.11 bibrelex"
}

@inproceedings{km-pcfds-96
, author =	"Suboth Kumar and Dinesh Manocha"
, title =	"The power of coherence: fast tessellation of surfaces"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V15--V16"
, cites =	"c-tsplt-91a, c-farps-79, ctv-flvat-89, f-cscag-93, k-rtpp-82, km-idlst-94, km-ertns-95, km-dmgps-96, lc-rtns-93, lcwb-slmdp-80, rhd-rtrts-89, s-sfira-91, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{kmgl-bfcpc-97
, author =	"S. Kumar and D. Manocha and W. Garret and M. Lin"
, title =	"Back-Face Computation of Polygon Clusters"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"487--488"
, keywords =	"video review"
, cites =	"bv-vbcd-95, c-hgmvs-76, c-sacg-77, dk-fdpi-82, fkn-vsgpt-80, kmgl-hbfc-96, nns-nshsp-72, sbgs-sacgi-69, sss-cthsa-74, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{kmgl-hbfc-96
, author =	"S. Kumar and D. Manocha and B. Garrett and M. Lin"
, title =	"Hierarchical back-face culling"
, booktitle =	"Proc. 7th Eurographics Workshop on Rendering"
, site =	"Porto, Portugal"
, year =	1996
, pages =	"231--240"
, update =	"98.07 bibrelex"
}

@article{kmgl-hbfc-99
, author =	"S. Kumar and D. Manocha and W. Garrett and M. Lin"
, title =	"Hierarchical Back-face Computation"
, journal =	"Comput. \& Graphics"
, volume =	23
, number =	5
, month =	oct
, year =	1999
, pages =	"681--692"
, update =	"00.03 held"
}

@article{kml-idlnm-96
, author =	"S. Kumar and D. Manocha and A. Lastra"
, title =	"Interactive display of large {NURBS} models"
, journal =	"IEEE Trans. on Visualization and Computer Graphics"
, volume =	2
, year =	1996
, pages =	"323--336"
, update =	"98.11 bibrelex, 97.03 tamassia"
}

@article{kr-icmmb-89
, author =	"V. K. P. Kumar and D. I. Reisis"
, title =	"Image Computations on Meshes with Multiple Broadcast"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	11
, year =	1989
, pages =	"1194--1201"
, update =	"98.07 bibrelex"
}

@article{klp-fmsv-75
, author =	"H. T. Kung and F. Luccio and F. P. Preparata"
, title =	"On Finding the Maxima of a Set of Vectors"
, journal =	"J. ACM"
, volume =	22
, year =	1975
, pages =	"469--476"
, update =	"93.09 milone+mitchell"
}

@article{k-cgrgf-90
, author =	"J. P. S. Kung"
, title =	"Combinatorial geometries representable over {$GF(3)$} and {$FG(q)$}, {I}: {The} number of points"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"83--95"
}

@techreport{kwr-gvdps-97
, author =	"Richard Kunze and Franz-Erich Wolter and Thomas Rausch"
, title =	"Geodesic {Voronoi} Diagrams on Parametric Surfaces"
, number =	2
, institution =	"Welfen Laboratory, Universit{\"a}t Hannover"
, month =	jul
, year =	1997
, url =	"http://www-c.informatik.uni-hannover.de"
, keywords =	"Voronoi diagram, parametric surface, geodesics on surfaces"
, update =	"98.03 mitchell"
, annote =	"Appeared in IEEE Computer Society Press Conference
                  Proceedings of the Computer Graphics International
                  1997 conference, pp. 230--237, June 1997"
}

@article{kk-dlpcb-90
, author =	"G. Kuperberg and W. Kuperberg"
, title =	"Double-lattice packings of convex bodies in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"389--397"
}

@techreport{k-dwp-90
, author =	"W. Kuperberg"
, title =	"{DIMACS} Workshop on Polytopes"
, institution =	"Rutgers University"
, month =	jan
, year =	1990
, update =	"98.07 bibrelex"
}

@techreport{k-epcg-79
, author =	"Y. S. Kupitz"
, title =	"Extremal problems in combinatorial geometry"
, type =	"Aarhus {University} {Lecture} {Notes} {Series}"
, number =	53
, institution =	"Aarhus University"
, address =	"Aarhus, Denmark"
, year =	1979
, update =	"98.03 bibrelex"
}

@article{k-ggst-92
, author =	"Y. S. Kupitz"
, title =	"On a generalization of the {Gallai}-{Sylvester} theorem"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"87--106"
}

@book{km-st-76
, author =	"K. Kuratowski and A. Mostowski"
, title =	"Set Theory"
, publisher =	"North-Holland"
, address =	"Amsterdam, the Netherlands"
, year =	1976
, update =	"98.11 bibrelex"
}

@article{kt-ltldp-92
, author =	"K. Kuroda and H. Tanemura"
, title =	"Limit-Theorem and Large Deviation Principle for the {Voronoi} Tessellation Generated by a {Gibbs} Point Process"
, journal =	"Adv. Appl. Probab."
, volume =	24
, number =	1
, year =	1992
, pages =	"45--70"
}

@article{kd-pamm-82
, author =	"Y. Kurozumi and W. A. Davis"
, title =	"Polygonal approximation by the minimax method"
, journal =	"Comput. Graph. Image Process."
, volume =	19
, year =	1982
, pages =	"248--264"
}

@inproceedings{kn-afrmt-97
, author =	"Yoshiyuki Kusakari and Takao Nishizeki"
, title =	"An Algorithm for Finding a Region with the Minimum Total {$L_1$}-Distance from Prescibed Terminals"
, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '97"
, site =	"Singapore"
, series =	"Lecture Notes Comput. Sci."
, volume =	1350
, publisher =	"Springer-Verlag"
, month =	dec
, year =	1997
, pages =	"324--333"
, update =	"00.11 smid, 00.07 icking, 99.11 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 mitchell"
}

@article{ksn-spppo-99
, author =	"Y. Kusakari and H. Suzuki and T. Nishizeki"
, title =	"A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, year =	1999
, pages =	"151--170"
, update =	"99.07 smid"
}

@inproceedings{ksn-fsppp-95
, author =	"Yoshiyuki Kusakari and Hitoshi Suzuki and Takao Nishizeki"
, title =	"Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas"
, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1004
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"42--51"
, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
}

@inproceedings{kor-esann-98
, author =	"E. Kushilevitz and R. Ostrovsky and Y. Rabani"
, title =	"Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, year =	1998
, pages =	"to appear"
, update =	"98.03 mitchell"
}

@phdthesis{k-cmppl-92
, author =	"J. Kutcher"
, title =	"Coordinated motion planning of planar linkages"
, school =	"Johns Hopkins University"
, year =	1992
, keywords =	"doctoral thesis"
}

@inproceedings{kms-spafa-85
, author =	"B. C. Kuttner and D. S. Majcher and P. B. Snedecor"
, title =	"Systematic Processing: {An} Approach to Fully Automatic {NC} Tool Path Generation"
, booktitle =	"Proceedings of Autofact '85 Conference"
, month =	nov
, year =	1985
, pages =	"18--22"
, update =	"98.03 bibrelex"
}

@inproceedings{ks-agtpu-86
, author =	"B. Kutzler and S. Stifter"
, title =	"Automated geometry theorem proving using {Buchberger}'s algorithm"
, booktitle =	"SYMSAC '86"
, site =	"Waterloo, Canada"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{ks-abaag-86
, author =	"B. Kutzler and S. Stifter"
, title =	"On the application of {Buchberger}'s algorithm to automated geometry theorem proving"
, journal =	"J. Symbolic Comput."
, volume =	2
, year =	1986
, pages =	"409--420"
, update =	"98.03 bibrelex"
}

@article{kk-ettfe-94
, author =	"I. S. Kweon and T. Kanade"
, title =	"Extracting topographic terrain features from elevation maps"
, journal =	"CVGIP: Image Understanding"
, volume =	59
, year =	1994
, pages =	"171--182"
, update =	"98.07 bibrelex"
}

@phdthesis{k-caplp-92
, author =	"K. K. Kwong"
, title =	"Computer-aided parting line and parting surface generation in mould design"
, school =	"University of Hong Kong"
, address =	"Hong Kong"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@mastersthesis{k-sgmwt-96
, author =	"Y. Kyoda"
, title =	"A Study of Generating Minimum Weight Triangulation within Practical Time"
, school =	"Dept. Inform. Sci., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1996
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{ki-bcamw-97
, author =	"Yoshiaki Kyoda and Keiko Imai"
, title =	"A Branch-and-Cut Approach for Minimum Weight Triangulation"
, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '97"
, site =	"Singapore"
, series =	"Lecture Notes Comput. Sci."
, volume =	1350
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"384--393"
, update =	"99.11 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 mitchell"
}

@phdthesis{k-sccad-80
, author =	"L. K. Kyprianou"
, title =	"Shape classification in computer aided design"
, school =	"Cambridge Univ."
, address =	"Cambridge, UK"
, year =	1980
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{l-aaipt-94
, author =	"J. A. {La Poutr{\'e}}"
, title =	"Alpha-algorithms for incremental planarity testing"
, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"706--715"
, keywords =	"graph drawing"
, update =	"95.09 tamassia, 95.05 tamassia, 95.01 tamassia"
}

@phdthesis{l-dgads-91
, author =	"J. A. {La Poutr{\'e}}"
, title =	"Dynamic Graph Algorithms and Data Structures"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Utrecht."
, year =	1991
, keywords =	"dynamic algorithm"
, update =	"96.01 tamassia"
}

@inproceedings{l-mtcg-92
, author =	"J. A. {La Poutr{\'e}}"
, title =	"Maintenance of Triconnected Components of Graphs"
, booktitle =	"Automata, Languages and Programming (Proc. 19th ICALP)"
, series =	"Lecture Notes Comput. Sci."
, volume =	623
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"354--365"
, update =	"98.07 vismara, 96.05 agarwal, 96.01 tamassia, 95.05 tamassia, 94.01 tamassia"
}

@inproceedings{l-ntufp-90
, author =	"J. A. {La Poutr{\'e}}"
, title =	"New techniques for the {Union}-{Find} problem"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"54--63"
, update =	"95.05 tamassia"
}

@inproceedings{pl-mtctr-88
, author =	"J. A. {La Poutr{\'e}} and J. van Leeuwen"
, title =	"Maintenance of Transitive Closures and Transitive Reductions of Graphs"
, editor =	"H. Gottler and H. J. Schneider"
, booktitle =	"Graph-Theoretic Concepts in Computer Science (Proc. WG '87)"
, series =	"Lecture Notes Comput. Sci."
, volume =	314
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"106--120"
, update =	"95.05 tamassia, 94.01 tamassia"
}

@book{la-satp-87
, author =	"P. J. M. van Laarhoven and E. H. L. Aarts"
, title =	"Simulated Annealing: Theory and Practice"
, publisher =	"Kluwer Academic Publications"
, year =	1987
, update =	"97.11 bibrelex"
}

@inproceedings{l-sirdi-99
, author =	"Jean-Marie Laborde"
, title =	"Some Issues Raised by the Development of Implemented Dynamic Geometry as with {Cabri-g{\'e}om{\`e}tre}"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"7--19"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@book{lb-cg2-93
, author =	"Jean-Marie Laborde and Franck Bellemain"
, title =	"{Cabri} {Geometry} {II}"
, publisher =	"Texas Instruments"
, address =	"Dallas"
, year =	1993
, update =	"99.07 bibrelex"
}

@article{lsv-gmabm-94
, author =	"B. Lacolle and N. Szafran and P. Valentin"
, title =	"Geometric Modelling and Algorithms for Binary Mixtures"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"243--260"
, keywords =	"computational geometry, convex sets, zonotopes, separation theory"
, update =	"96.09 devillers, 94.05 devillers"
}

@article{lf-ppc-80
, author =	"R. E. Ladner and M. J. Fischer"
, title =	"Parallel prefix computation"
, journal =	"J. Assoc. Comput. Machinery"
, volume =	27
, number =	4
, month =	oct
, year =	1980
, pages =	"831--838"
, update =	"97.11 bibrelex"
}

@article{l-ccsda-85
, author =	"J. Lagarias"
, title =	"The computational complexity of simultaneos {Diophantine} approximation problems"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"196--209"
, update =	"98.03 bibrelex"
}

@incollection{lpr-psdsc-96
, author =	"J. C. Lagarias and N. Prabhu and J. A. Reeds"
, title =	"The parameter space of the $d$-step conjecture"
, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1180
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"52--63"
, update =	"97.03 smid"
}

@inproceedings{ls-sdiuc-94
, author =	"M. J. Lai and L. L. Schumaker"
, title =	"Scattered data interpolation using {$C^{2}$} piecewise polynomials of degree six"
, booktitle =	"3rd Workshop Proximity Graphs"
, year =	1994
, update =	"97.11 bibrelex"
}

@article{lw-ehppn-93
, author =	"T.-H. Lai and S.-S. Wei"
, title =	"The edge {Hamiltonian} path problem is {NP}-complete for bipartite graphs"
, journal =	"Inform. Process. Lett."
, volume =	46
, year =	1993
, pages =	"21--26"
, update =	"98.11 bibrelex"
}

@article{lth-csgpo-86
, author =	"D. H. Laidlaw and W. B. Trumbore and J. F. Hughes"
, title =	"Constructive Solid Geometry for Polyhedral Objects"
, journal =	"Comput. Graph."
, volume =	20
, number =	4
, year =	1986
, pages =	"161--170"
, note =	"Proc. SIGGRAPH '86"
, update =	"93.09 goodrich"
}

@inproceedings{l-ssxoc-90
, author =	"J.-L. Lambert"
, title =	"Sorting the sums ($x_i+y_j$) in {$O(n^2)$} comparisons"
, booktitle =	"Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	415
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"195--206"
, update =	"99.11 bibrelex"
}

@inproceedings{l-sxyoc-91
, author =	"J. L. Lambert"
, title =	"Sorting {X + Y} in $O(n^2)$ comparisons"
, booktitle =	"Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
, year =	1991
, pages =	"195--206"
, update =	"98.11 bibrelex"
}

@phdthesis{l-esta-94
, author =	"T. Lambert"
, title =	"Empty-Shape Triangulation Algorithms"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. of Manitoba"
, address =	"Winnipeg, MB"
, month =	aug
, year =	1994
, url =	"ftp://ftp.cse.unsw.edu.au/pub/users/lambert/thesis.ps.Z"
, keywords =	"doctoral thesis"
, update =	"94.09 lambert"
, abstract =	"The Delaunay triangulation of a set of sites (points in
the plane) can be defined as the triangulation with the property that the
circumcircle of each triangle is empty (contains no site).  I generalize
this to define {\em empty-shape triangulations}.  An empty-shape
triangulation is defined by a set of shapes with the property that any
triangle has a unique circumscribing shape.  The Delaunay triangulation is
the empty-shape triangulation where the shapes consist of the set of all
circles.
\par
In this thesis I develop a taxonomy for triangulation algorithms, describe
and implement a plane sweep algorithm for empty-shape triangulations,
describe algorithms for constrained empty-shape triangulations and an
algorithm for higher-dimensional empty-shape triangulations.  I implement
an algorithm for computing convex-distance-function Delaunay triangulations
by extending them to empty-shape triangulations and then extracting the
appropriate subtriangulation.
\par
Two properties of the Delaunay triangulation are necessary for the
correctness of the known efficient algorithms.  I prove that the only
triangulations with these properties are empty-shape triangulations.
\par
I analyze, implement and measure the performance of Delaunay triangulation
algorithms on random convex polygons.
\par
There is no generally accepted definition of what a random convex polygon
is.  I give several operational definitions, design efficient algorithms
and implement some of them."
}

@techreport{l-lot-93
, author =	"T. Lambert"
, title =	"Local optimization of triangulations"
, type =	"manuscript"
, year =	1993
, update =	"98.11 bibrelex"
}

@techreport{l-lot-93a
, author =	"T. Lambert"
, title =	"Local optimization of triangulations"
, type =	"manuscript"
, year =	1993
, update =	"98.11 bibrelex"
}

@inproceedings{l-slfra-93
, author =	"T. Lambert"
, title =	"Systematic local flip rules are generalized {Delaunay} rules"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"352--357"
, cites =	"a-vdsfg-91, be-mgot-92i, b-koejk-36, d-pacdt-90, d-srbtg-87, fdfh-cgpp-90, f-skgk-20, g-itsn-86, gks-ricdv-92, gs-pmgsc-85, k-cavd-89, l-lot-93, l-gtgac-72, ls-tacdt-80, nf-scbut-83, o-dtfl-90, ba-acfem-76, s-let-78, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{l-dtmmi-94
, author =	"T. Lambert"
, title =	"The {Delaunay} Triangulation Maximizes the Mean Inradius"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"201--206"
, cites =	"a-vdsfg-91, b-ras-77, be-mgot-92i, ds-oiti-89, d-iw-86, fdfh-cgpp-90, f-vddt-92, h-mg-85, j-aeg-60, l-lot-93, ba-acfem-76, d-srbtg-87, ls-agt-, o-dtfl-90, p-mrpdt-92, r-odtr-91, r-mrpdt-90, s-tm-87, s-let-78, w-pdcig-91, fp-jtgp-89, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{lsw-oraim-88
, author =	"Y. Lamdan and J. T. Schwartz and H. J. Wolfson"
, title =	"Object recognition by affine invariant mapping"
, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
, year =	1988
, pages =	"335--344"
, update =	"97.11 bibrelex"
}

@inproceedings{lw-ghgem-88
, author =	"Y. Lamdan and H. J. Wolfson"
, title =	"Geometric hashing: a general and efficient model-based recognition scheme"
, booktitle =	"2nd Inter. Conf. on Comput. Vision"
, year =	1988
, pages =	"238--249"
, update =	"96.09 orourke"
}

@inproceedings{lw-eagh-91
, author =	"Y. Lamdan and H. J. Wolfson"
, title =	"On the error analysis of geometric hashing"
, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
, year =	1991
, pages =	"22--27"
, update =	"97.11 bibrelex"
}

@inproceedings{lhn-ddq2d-97
, author =	"Michael G. Lamoureux and Joseph D. Horton and Bradford G. Nickerson"
, title =	"Dynamizing Domination Queries in 2--dimensions: The Paper Stabbing Problem Revisited"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"211--216"
, update =	"97.11 jones"
}

@book{l-dpslu-86
, author =	"Leslie Lamport"
, title =	"A Document Preparation System {Latex} User's Guide and Reference Manual"
, publisher =	"Addison-Wesley"
, year =	1986
, update =	"98.11 bibrelex"
}

@inproceedings{lm-sgch-95
, author =	"H. Lamure and D. Michelucci"
, title =	"Solving geometric constraints by homotopy"
, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
, site =	"Salt Lake City, UT"
, month =	may
, year =	1995
, update =	"98.07 bibrelex"
}

@article{lccg-dforp-97
, author =	"P.-T. Lan and S.-Y. Chou and L.-L. Chen and D. Gemmill"
, title =	"Determining Fabrication Orientations for Rapid Prototyping with Stereolithography Apparatus"
, journal =	"Comput. Aided Design"
, volume =	29
, number =	1
, month =	jan
, year =	1997
, pages =	"53--62"
, update =	"97.11 held"
}

@inproceedings{lv-pmdi-92
, author =	"G. M. Landau and U. Vishkin"
, title =	"Pattern matching in a digitized image"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"453--462"
}

@incollection{lv-tdpmd-93
, author =	"Gad M. Landau and Uzi Vishkin"
, title =	"Two Dimensional Pattern Matching in a Digitized Image"
, booktitle =	"Combinatorial Pattern Matching"
, series =	"Lecture Notes Comput. Sci."
, volume =	684
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"134--151"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{l-fpq-87
, author =	"S. Landau"
, title =	"Factoring polynomials quickly"
, journal =	"Notices Amer. Math. Soc."
, volume =	34
, number =	1
, year =	1987
, pages =	"3--8"
, update =	"97.11 bibrelex"
}

@inproceedings{lm-srpt-83
, author =	"S. Landau and G. L. Miller"
, title =	"Solvability by radicals in polynomial time"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
, year =	1983
, pages =	"140--151"
, precedes =	"lm-srpt-85"
}

@article{lm-srpt-85
, author =	"S. Landau and G. L. Miller"
, title =	"Solvability by radicals in polynomial time"
, journal =	"J. Comput. Syst. Sci."
, volume =	30
, year =	1985
, pages =	"179--208"
, succeeds =	"lm-srpt-83"
}

@article{l-ecacr-87
, author =	"U. M. Landau"
, title =	"Estimation of circular arc center and its radius"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	38
, year =	1987
, pages =	"317--326"
, update =	"98.11 bibrelex, 97.03 agarwal"
}

@article{lmr-eppa-84
, author =	"J. Lane and B. Magedson and M. Rarick"
, title =	"An efficient point in polyhedron algorithm"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	26
, year =	1984
, pages =	"118--125"
, update =	"98.11 bibrelex"
}

@article{lcwb-slmdp-80
, author =	"J. M. Lane and L. C. Carpenter and J. T. Whitted and J. F. Blinn"
, title =	"Scan line methods for displaying parametrically defined surfaces"
, journal =	"Commun. ACM"
, volume =	23
, number =	1
, year =	1980
, pages =	"23--34"
, update =	"97.11 bibrelex"
}

@article{lr-bp-81
, author =	"J. M. Lane and R. Riesenfeld"
, title =	"Bounds on a polynomial"
, journal =	"BIT"
, volume =	21
, year =	1981
, pages =	"112--117"
, update =	"97.11 bibrelex"
}

@article{lr-tdcgd-80
, author =	"J. M. Lane and R. R. Riesenfeld"
, title =	"A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-2"
, number =	1
, month =	jan
, year =	1980
, update =	"97.11 bibrelex"
}

@inproceedings{l-caod-96
, author =	"Robert J. Lang"
, title =	"A Computational Algorithm for Origami Design"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"98--105"
, cites =	"ml-osl-90, m-oe-79, l-oi-95, k-fo-95, m-po-89, k-co-67, kt-oc-78, k-oo-88, e-oaz-94, m-??-94, k-tffaf-94, k-rbmcv-89, l-maod-94, h-mfo-94, h-ccpp-76, bh-cfo-96, v-noted-84, pftv-nrc-93, g-tc-92, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
}

@article{l-maod-94
, author =	"R. J. Lang"
, title =	"Mathematical algorithms for origami design"
, journal =	"Symmetry: Culture and Science"
, volume =	5
, number =	2
, year =	1994
, pages =	"115--152"
, update =	"97.11 bibrelex"
}

@book{l-oi-95
, author =	"R. J. Lang"
, title =	"Origami Insects"
, publisher =	"Dover"
, year =	1995
, update =	"97.11 bibrelex"
}

@book{l-a1-69
, author =	"Serge Lang"
, title =	"Analysis {I}"
, publisher =	"Addison-Wesley"
, address =	"New York, NY"
, year =	1969
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@phdthesis{l-agas-98
, author =	"E. de Lange"
, title =	"Aide g{\'e}om{\'e}trique {\`a} l'am{\'e}nagement de satellites"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"{\'E}cole Nationale Sup\'erieure des Mines de Paris"
, address =	"France"
, year =	1998
, url =	"http://www-sop.inria.fr/prisme/publis/these-delange.ps.gz"
, keywords =	"doctoral thesis"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers"
}

@inproceedings{lrsw-clprt-01
, author =	"K. Lange and R. Ray and M. Smid and U. Wendt"
, title =	"Computing large planar regions in terrains"
, booktitle =	"Proc. 8th International Workshop on Combinatorial Image Analysis"
, nickname =	"IWCIA '01"
, year =	2001
, pages =	"139--151"
, comments =	"Appears also in Electronic Notes in Theoretical
                 Computer Science, Volume 46,
                 www.elsevier.nl/locate/entcs/volume46.html"
, update =	"01.11 smid"
}

@inproceedings{l-chaq-01
, author =	"Stefan Langermann"
, title =	"On the Complexity of Halfspace Area Queries"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"86--88"
, update =	"01.04 icking"
}

@phdthesis{l-dasas-00
, author =	"Elmar Langetepe"
, title =	"Design and Analysis of Strategies for Autonomous Systems in Motion Planning"
, school =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, year =	2000
, keywords =	"doctoral thesis"
, cites =	"aaiklr-psac-97, aaiklr-gsac-98p, admss-esstl-95, bcr-sp-93, b-olsn-98, brs-nugt-97, bl-piss-99, bs-srsc-99, bsmm-tdm-93, cn-cvpp-99, cgglmw-m5lrm-91, cgglmw-fltim-92, cn-owr-88, c-lp-83, cg-opapp-92, cghj-lwfm-93, cfg-upg-90, dhn-lvp-97, dcd-ncaas-96, dhs-cspbg-95, di-csgs-94, di-csgs-99, bkos-cgaa-97, ew-mmcfs-99, fw-ola-98, g-sg-80, g-csg-89, gj-cigtn-79, gs-oolaw-97, hns-psmr-99, hikl-hfplf-97, hikl-hfplf-99, hikk-cslp-97, hikk-maar-98, hikk-pepns-98, hikk-pep1c-98, hikk-pep2a-98, i-mvsp-94, ik-skpcs-95, ikl-skpcs-97, ikl-sac-97, ikl-ocsws-98, ikl-ocsws-99, ikl-sgmrw-99, ikl-sac-99, ikm-hlac-93, ilss-ghtus-98, jdugg-wcpbs-74, k-wusbd-91, k-wusbd-92, k-ag-97, k-olssp-94, ks-aools-97, lp-oafkp-79, lc-tasso-99, lsksc-ncssu-97, l-oltsb-96, ls-ghtus-95, ls-serst-95, ls-gsr-96, ls-wsf-96, ls-pinos-97, ls-ecesc-98, ls-lbsgs-98, ls-ussmr-98, m-gspno-00, osh-kaoa-94, ps-cgi-85, rksi-rnut-93, r-cic-94, rs-addce-91, s-smbr-98, ss-oss-98, ss-ossus-99, s-naci-89, s-aeusf-96, st-aelup-85, th-cswrd-93, thl-tgwsp-98, ZZZ"
, update =	"00.11 smid, 00.07 icking, 00.03 bibrelex"
}

@article{l-rtaa-69
, author =	"P. M. Lankford"
, title =	"Regionalization: theory and alternative algorithms"
, journal =	"Geogr. Anal."
, volume =	1
, year =	1969
, pages =	"196--212"
, update =	"98.03 bibrelex"
}

@techreport{lms-awspp-96
, author =	"M. Lanthier and A. Maheshwari and J.-R. Sack"
, title =	"Approximating weighted shortest paths on polyhedral surfaces"
, type =	"Technical {Report}"
, number =	"TR-96-32"
, institution =	"Carleton Univ."
, address =	"Ottawa, ON"
, month =	dec
, year =	1996
, update =	"98.07 bibrelex"
}

@inproceedings{lms-awspp-97i
, author =	"M. Lanthier and A. Maheshwari and J.-R. Sack"
, title =	"Approximating weighted shortest paths on polyhedral surfaces"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"274--283"
, keywords =	"shortest paths, weighted region problem, discrete geodesic problem"
, cites =	"hsv-aspcp-96, aaos-supa-97, ch-spp-90, c-aaspm-87, d-ntpcg-59, gh-ospqs-87, hs-pmasp-95, hlmnrs-pnm-96, lms-awspp-96, lms-awspp-97v, mmp-dgp-87, mp-wrpfs-91, ms-scg-95, m-fspcp-85, osb-spps-84, rr-ogfpp-90, ss-spps-86, va-aspp-96, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@inproceedings{lms-awspp-97v
, author =	"M. Lanthier and A. Maheshwari and J.-R. Sack"
, title =	"Approximating Weighted Shortest Paths on Polyhedral Surfaces"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"485--486"
, keywords =	"video review"
, cites =	"aaos-supa-97, ch-spp-90, lms-awspp-96, lms-awspp-97i, mmp-dgp-87, mp-wrpfs-91, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{lm-gmqia-84
, author =	"C. Lantuejoul and F. Maisonneuve"
, title =	"Geodesic methods in quantitative image analysis"
, journal =	"Pattern Recogn."
, volume =	17
, year =	1984
, pages =	"177--187"
, update =	"98.03 bibrelex"
}

@phdthesis{l-aicla-80
, author =	"A. LaPaugh"
, title =	"Algorithms for Integrated Circuit Layout: {An} Analytic Approach"
, school =	"Laboratory for Computer Science, MIT"
, year =	1980
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@article{lmn-eaacv-86
, author =	"G. Laporte and H. Mercure and Y. Nobert"
, title =	"An exact algorithm for the asymmetrical capacitated vehicle routing problem"
, journal =	"Networks"
, volume =	16
, year =	1986
, pages =	"47--50"
}

@article{l-htpuc-68
, author =	"D. G. Larman"
, title =	"Helly type properties of unions of convex sets"
, journal =	"Mathematica"
, volume =	15
, year =	1968
, pages =	"53--59"
, update =	"98.03 bibrelex"
}

@inproceedings{l-pp-70
, author =	"D. G. Larman"
, title =	"Paths on polytopes"
, booktitle =	"Proc. Lon. Math. Soc."
, volume =	20
, year =	1970
, pages =	"161--178"
, update =	"93.09 milone+mitchell"
}

@article{lmpt-rtrpc-94
, author =	"D. G. Larman and J. Matou{\v s}ek and J. Pach and J. T{\H o}r{\H o}csik"
, title =	"A {Ramsey}-type result for planar convex sets"
, journal =	"Bull. London Math. Soc."
, volume =	26
, year =	1994
, pages =	"132--136"
, update =	"97.11 bibrelex"
}

@inproceedings{lh-llc-90
, author =	"L. Larmore and D. Hirschberg"
, title =	"Length-limited coding"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"310--318"
, update =	"98.03 bibrelex"
}

@inproceedings{lp-pctow-91
, author =	"L. Larmore and T. Przytycka"
, title =	"Parallel construction of trees with optimal weighted path length"
, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Arch."
, year =	1991
, pages =	"71--80"
, update =	"98.03 bibrelex"
}

@article{ls-oldpa-91
, author =	"L. Larmore and B. Schieber"
, title =	"On-line dynamic programming with applications to prediction of {RNA} secondary structure"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"490--515"
, update =	"98.03 bibrelex"
}

@article{l-oautc-90
, author =	"L. L. Larmore"
, title =	"An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching"
, journal =	"Inform. Process. Lett."
, volume =	36
, year =	1990
, pages =	"147--151"
}

@inproceedings{ls-oldpa-90
, author =	"L. L. Larmore and B. Schieber"
, title =	"On-line dynamic programming with applications to the prediction of {RNA} secondary structure"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"503--512"
}

@book{l-pstp-83
, author =	"L. C. Larson"
, title =	"Problem-Solving Through Problems"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1983
, update =	"98.03 bibrelex"
}

@article{ll-fmrdp-81
, author =	"R. C. Larson and V. O. K. Li"
, title =	"Finding minimum rectilinear distance paths in the presence of barriers"
, journal =	"Networks"
, volume =	11
, year =	1981
, pages =	"285--304"
}

@article{l-com-80
, author =	"M. {Las Vergnas}"
, title =	"Convexity in oriented matroids"
, journal =	"J. Combin. Theory Ser. B"
, volume =	29
, year =	1980
, pages =	"231--243"
, update =	"98.07 agarwal"
}

@book{l-vta-50
, author =	"H. Lass"
, title =	"Vector and Tensor Analysis"
, publisher =	"McGraw-Hill"
, year =	1950
, update =	"98.03 bibrelex"
}

@article{lz-olpst-91
, author =	"M. Lassak and J. Zhang"
, title =	"An on-line potato-sack theorem"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"1--7"
}

@inproceedings{l-kfv-90
, author =	"Dieter Lasser"
, title =	"{Kurven-} und {Fl{\"a}chen}-{Verschneidungsmethoden}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	17
, update =	"00.03 bibrelex"
}

@article{l-aeavc-83
, author =	"J. B. Lasserre"
, title =	"An analytical expression and an algorithm for the volume of a convex polyhedron in {$R^{n}$}"
, journal =	"J. Optim. Theory Appl."
, volume =	39
, year =	1983
, pages =	"363--377"
}

@book{l-cgcgc-96
, author =	"M. Laszlo"
, title =	"Computational Geometry and Computer Graphics in C++"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1996
, isbn =	"0-13-290842-5"
, update =	"98.07 tamassia+vismara, 97.11 icking, 96.05 held"
}

@phdthesis{l-dsmtd-87
, author =	"M. J. Laszlo"
, title =	"A data structure for manipulating three-dimensional subdivisions"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1987
, note =	"Report CS-TR-125-87"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@inproceedings{l-fppcl-91
, author =	"J.-C. Latombe"
, title =	"A fast path-planner for a car-like indoor mobile robot"
, booktitle =	"Proc. 9th Nat. Conf. Artif. Intell."
, year =	1991
, pages =	"659--665"
, update =	"97.11 bibrelex"
}

@techreport{l-mpupb-88
, author =	"J.-C. Latombe"
, title =	"Motion planning with uncertainty: The preimage backchaining approach"
, number =	"STAN-CS-88-1196"
, institution =	"Department of Computer Science, Stanford University"
, year =	1988
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@book{l-rmp-91
, author =	"J.-C. Latombe"
, title =	"Robot Motion Planning"
, publisher =	"Kluwer Academic Publishers"
, address =	"Boston"
, year =	1991
, keywords =	"robotics"
, update =	"93.05 orourke"
}

@inproceedings{lwc-astp-95
, author =	"J.-C. Latombe and R. H. Wilson"
, title =	"Assembly sequencing with toleranced parts"
, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
, site =	"Salt Lake City"
, year =	1995
, update =	"99.11 bibrelex, 96.05 ramkumar"
}

@inproceedings{les-gsd-97
, author =	"Harald Lauer and Matthias Ettrich and Klaus Soukup"
, title =	"{GraVis} - System Demonstration"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"344--349"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@incollection{l-chi-82
, author =	"M. Lauer"
, title =	"Computing by homomorphic images"
, editor =	"B. Buchberger and G. E. Collins and R. Loos"
, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
, publisher =	"Springer-Verlag"
, year =	1982
, pages =	"139--168"
, update =	"98.07 bibrelex"
}

@article{l-cpt-90
, author =	"J.-P. Laumond"
, title =	"Connectivity of planar triangulations"
, journal =	"Inform. Process. Lett."
, volume =	34
, number =	2
, month =	mar
, year =	1990
, pages =	"87--96"
, update =	"98.11 bibrelex"
}

@inproceedings{l-ftmrk-86
, author =	"J. P. Laumond"
, title =	"Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints"
, editor =	"L. O. Hertzberger and F. C. A. Groen"
, booktitle =	"Conference on Intelligent Autonomous Systems (Amsterdam, the Netherlands, December 8--11, 1986)"
, publisher =	"Elsevier Science Publishers"
, month =	dec
, year =	1986
, pages =	"346--354"
, update =	"95.01 mitchell, 95.01 mitchell"
}

@inproceedings{l-fcfst-87
, author =	"J.-P. Laumond"
, title =	"Finding collision-free smooth trajectories for a non-holonomic mobile robot"
, booktitle =	"Proc. Internat. Joint Conf. Artif. Intell."
, year =	1987
, pages =	"1120--1123"
, update =	"97.11 bibrelex"
}

@article{l-ognw-87
, author =	"J.-P. Laumond"
, title =	"Obstacle growing in a nonpolygonal world"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"41--50"
, keywords =	"combinatorial geometry"
}

@inproceedings{la-gapmt-89
, author =	"J.-P. Laumond and R. Alami"
, title =	"A geometrical approach to planning manipulation tasks in robotics"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	21
}

@article{ljtm-mpnmr-94
, author =	"J.-P. Laumond and P. Jacobs and M. Taix and R. M. Murray"
, title =	"A Motion Planner for Nonholonomic Mobile Robots"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	10
, number =	5
, year =	1994
, pages =	"577--593"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex"
}

@book{lo-afr2-96
, title =	"Algorithms for Robotic Motion and Manipulation"
, editor =	"J.-P. Laumond and M. H. Overmars"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1996
, update =	"97.03 schwarzkopf"
}

@inproceedings{ls-mispc-93
, author =	"J.-P. Laumond and P. Sou{\`e}res"
, title =	"Metric induced by the shortest paths for a car-like robot"
, booktitle =	"IEEE Internat. Workshop on Intelligent Robots and Systems"
, site =	"Yokohama, Japan"
, year =	1993
, pages =	""
, update =	"94.05 devillers"
}

@inproceedings{l-isroo-93
, author =	"A. Laurentini"
, title =	"Inferring the shape of the real object from the object reconstructid by volume intersection"
, booktitle =	"Proc. IEEE CVPR"
, site =	"New York"
, month =	jun
, year =	1993
, pages =	"280--285"
, update =	"98.11 bibrelex"
}

@inproceedings{l-mnvio-93
, author =	"A. Laurentini"
, title =	"On the minimal number of volume intersection operations necessary for reconstructing a {$3D$} object"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"285--290"
, cites =	"s-rtddi-81, ka-rpcsm-86, ca-mrsro-89, sa-agoos-87, t-impbp-87, av-gooso-89, hs-drwsv-85, sp-viosd-91, ma-vdomv-83, s-cgmvi-90, p-gom3o-87, n-coatd-88, ca-vsort-86, c-mvor-87, l-viacd-89, n-loviu-92, l-vhntc-91, l-vhsr-92, l-vhcsi-, lpr-lovi-89, l-isroo-93, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{l-swag-96
, author =	"A. Laurentini"
, title =	"The surveillance of the walls of an art gallery"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"223--233"
, update =	"96.09 mitchell"
}

@inproceedings{l-vhntc-91
, author =	"A. Laurentini"
, title =	"The visual Hull: a new tool for contour-based image understanding"
, booktitle =	"Proc. 7th Scandinavian Conf. on Image Analysis"
, year =	1991
, pages =	"993--1002"
, update =	"98.11 bibrelex"
}

@unpublished{l-vhcsi-
, author =	"A. Laurentini"
, title =	"The visual hull concept for silhouette-based image understanding"
, note =	"to appear in IEEE Trans. Pattern Anal. Machine Intell."
, update =	"98.11 bibrelex"
}

@inproceedings{l-vhsr-92
, author =	"A. Laurentini"
, title =	"The visual hull of solids of revolution"
, booktitle =	"Proc. 11th IAPR Int. Conf. on Pattern Recognition"
, site =	"The Hague"
, year =	1992
, pages =	"720--724"
, update =	"98.11 bibrelex"
}

@book{lt-fsis-92
, author =	"Robert Laurini and Derek Thompson"
, title =	"Fundamentals of Spatial Information Systems"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1992
, isbn =	"0-12-438380-7"
, update =	"95.09 mitchell"
}

@article{l-cwffd-85
, author =	"C. Lautemann"
, title =	"Cases where the floor function doesn't help"
, journal =	"Bull. EATCS"
, volume =	26
, year =	1985
, pages =	159
, comments =	"Talk presented at the 2nd Meeting on Efficient
		 Algorithms, Oberwolfach, West Germany (Nov. 1984)."
}

@article{l-4dbst-78
, author =	"L. Lauther"
, title =	"$4$-dimensional binary search trees as $2$ means to speed up associative searches in design rule verification of integrated circuits"
, journal =	"J. Design Autom. Fault-Tolerant Comput."
, volume =	2
, year =	1978
, pages =	"241--247"
}

@article{lg-gcvfm-85
, author =	"S. E. Laux and B. M. Grossman"
, title =	"A general control volume formulation for modeling impact ionization in semiconductor transport"
, journal =	"IEEE Trans. Electron. Devices"
, volume =	32
, year =	1985
, pages =	"2076--2081"
, update =	"97.11 bibrelex"
}

% ### others?
@inproceedings{l-viacd-89
, author =	"Lavakusha and others"
, title =	"Volume intersection algorithms with changing directions of views"
, booktitle =	"Proc. MIV-89"
, site =	"Tokyo"
, year =	1989
, pages =	"309--314"
, update =	"98.11 bibrelex"
}

@article{lpr-lovi-89
, author =	"Lavakusha and Arun K. Pujari and P. G. Reddy"
, title =	"Linear octrees by volume intersection"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	45
, month =	mar
, year =	1989
, pages =	"371--379"
, update =	"98.11 bibrelex"
}

@inproceedings{llglm-futwo-97
, author =	"S. M. LaValle and D. Lin and L. J. Guibas and J.-C. Latombe and R. Motwani"
, title =	"Finding an unpredictable target in a workspace with obstacles"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, month =	apr
, year =	1997
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@inproceedings{lss-asprf-00
, author =	"Steven M. LaValle and Borislav Simov and Giora Slutzki"
, title =	"An Algorithm for Searching a Polygonal Region with a Flashlight"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"260--269"
, update =	"00.11 jones"
}

@article{lbdww-vdsts-92
, author =	"David Lavender and Adrian Bowyer and James Davenport and Andrew Wallis and John Woodwark"
, title =	"{Voronoi} Diagrams of Set-Theoretic Solid Models"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	12
, number =	5
, month =	sep
, year =	1992
, pages =	"69--77"
, update =	"95.01 schwarzkopf"
}

@book{l-conm-76
, author =	"E. Lawler"
, title =	"Combinatorial Optimization: {Networks} and Matroids"
, publisher =	"Holt, Rinehart \& Winston"
, address =	"New York"
, year =	1976
, update =	"93.09 milone+mitchell"
}

@book{llrs-tsp-85
, title =	"The Traveling Salesman Problem"
, editor =	"E. L. Lawler and J. K. Lenstra and A. H. G. {Rinnooy Kan} and D. B. Shmoys"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1985
, isbn =	"0-471-90413-9"
, keywords =	"book"
, update =	"99.11 bibrelex, 97.03 pocchiola, 93.09 rote"
, annote =	"a collection of survey articles by various authors (the BIBLE on the TSP)"
}

@techreport{lm-mcnif-91
, author =	"G. Lawlor and F. Morgan"
, title =	"Minimizing cones and networks: immiscible fluids, norms, and calibrations"
, type =	"Preprint"
, institution =	"Williams College"
, year =	1991
, update =	"97.11 bibrelex"
}

@misc{lm-pcasi-91
, author =	"G. Lawlor and F. Morgan"
, title =	"Paired calibrations applied to soapfilms, immiscible fluids, and surfaces or networks minimizing other norms"
, howpublished =	"Preprint"
, year =	1991
, update =	"98.03 bibrelex"
}

@article{l-pvc-91
, author =	"J. Lawrence"
, title =	"Polytope volume computation"
, journal =	"Math. Comput."
, volume =	57
, number =	195
, year =	1991
, pages =	"259--271"
, update =	"97.11 bibrelex"
}

@article{l-vp-88
, author =	"J. Lawrence"
, title =	"Valuations and polarity"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"307--324"
}

@book{l-cspc-72
, author =	"J. D. Lawrence"
, title =	"A Catalog of Special Plane Curves"
, publisher =	"Dover Publications"
, address =	"New York, NY"
, year =	1972
, update =	"94.01 tamassia"
}

@techreport{l-ccit-76
, author =	"C. L. Lawson"
, title =	"{$C^{1}$}-compatible interpolation over a triangle"
, type =	"Technical {Memo}"
, number =	"33-770"
, institution =	"Jet Propulsion Lab., California Inst. Tech."
, address =	"Pasadena, CA"
, year =	1976
}

@article{l-csisd-84
, author =	"C. L. Lawson"
, title =	"${C}^1$ Surface Interpolation For Scattered Data on a Sphere"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"177--202"
, annote =	"Triangulates sphere using incremental algorithm with
		 switching. Switching rule is to make the quadrilateral
		 convex with respect to the sphere."
}

@techreport{l-gtgac-72
, author =	"C. L. Lawson"
, title =	"Generation of a triangular grid with applications to contour plotting"
, type =	"Memo"
, number =	299
, institution =	"Jet Propulsion Lab., California Inst. Tech."
, address =	"Pasadena, CA"
, year =	1972
}

@techreport{l-i2cts-76
, author =	"C. L. Lawson"
, title =	"Integrals of {$2C^{1}$}-compatible triangular surface element"
, type =	"Technical {Memo}"
, number =	"33-808"
, institution =	"Jet Propulsion Lab., California Inst. Tech."
, address =	"Pasadena, CA"
, year =	1976
}

@article{l-pndt-86
, author =	"Charles L. Lawson"
, title =	"Properties Of {N}-Dimensional Triangulations"
, journal =	"Comput. Aided Geom. Design"
, volume =	3
, number =	4
, month =	dec
, year =	1986
, pages =	"231--246"
, keywords =	"n-dimensional triangulation, Delaunay triangulation, Dirichlet tessellation"
, annote =	"Generalizes some of the properties of 2D
		 triangulations."
, abstract =	"This paper establishes a number of mathematical
		 results relevant to the problem of constructing a
		 triangulation, i. e. , a simplical tessellation of the
		 convex hull of an arbitrary finite set of points in
		 n-space. The principal results of the present paper are
		 (a) A set of n PLUS 2 points in n-space may be
		 triangulated in at most 2 different ways. (b) The
		 'sphere test' defined in this paper selects a preferred
		 one of these two triangulations. (c) A set of
		 parameters is defined that permits the characterization
		 and enumeration of all sets of n PLUS 2 points in
		 n-space that are significantly different from the point
		 of view of their possible triangulations. (d) The local
		 sphere test induces a global sphere test property for a
		 triangulation. (e) A triangulation satisfying the
		 global sphere property is dual to the n-dimensional
		 Dirichlet tessellation, i. e. , it is a Delaunay
		 triangulation. (Author abstract) 12 refs."
}

@incollection{l-scsi-77
, author =	"C. L. Lawson"
, title =	"Software for {$C^{1}$} surface interpolation"
, editor =	"J. R. Rice"
, booktitle =	"Math. Software III"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1977
, pages =	"161--194"
, update =	"97.03 schwarzkopf"
}

@techreport{l-spndt-85
, author =	"C. L. Lawson"
, title =	"Some properties of $n$-dimensional triangulations"
, type =	"Publication"
, number =	"85-42"
, institution =	"Jet Propulsion Lab., California Inst. Tech."
, address =	"Pasadena, CA"
, year =	1985
}

@article{l-tt-72
, author =	"C. L. Lawson"
, title =	"Transforming Triangulations"
, journal =	"Discrete Math."
, volume =	3
, year =	1972
, pages =	"365--372"
, annote =	"Proves that any triangulation of a given set of points
		 can be transformed into any other by a sequence of
		 ``exchanges''. (If two adjacent triangles form a convex
		 quadrilateral, replace the included diagonal with the
		 other one.)"
}

@book{l-csa-72
, author =	"S. R. Lay"
, title =	"Convex Sets and Their applications"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1972
, update =	"99.11 bibrelex, 98.07 bibrelex"
}

@book{l-csta-82
, author =	"Steven R. Lay"
, title =	"Convex Sets and Their Applications"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1982
, keywords =	"book"
, update =	"98.11 kuehn"
}

@article{l-sss-71
, author =	"S. R. Lay"
, title =	"On separation by spherical surfaces"
, journal =	"Amer. Math. Monthly"
, volume =	78
, year =	1971
, pages =	"1112--1113"
, update =	"99.11 devillers"
}

@techreport{ll-lbrn-92
, author =	"A. Lazanas and J.-C. Latombe"
, title =	"Landmark-based robot navigation"
, type =	"Technical {Report}"
, institution =	"Dept. of Computer Science, Stanford University"
, year =	1992
, update =	"99.11 bibrelex, 93.09 milone+mitchell"
}

@techreport{ll-mpula-92
, author =	"A. Lazanas and J.-C. Latombe"
, title =	"Motion planning with uncertainty: {A} landmark approach"
, type =	"Technical {Report}"
, institution =	"Dept. of Computer Science, Stanford University"
, year =	1992
, update =	"99.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{l-gbger-83
, author =	"D. Lazard"
, title =	"{Gr{\"o}bner}-Bases, {Gaussian} Elimination and Resolution of Systems of Algebraic Equations"
, booktitle =	"Proc. EUROCAL 83"
, year =	1983
, pages =	"146--156"
, update =	"97.11 bibrelex"
}

@phdthesis{l-ptrmn-96
, author =	"Sylvain Lazard"
, title =	"Planification de trajectoires de robots mobiles non-holonomes et de robots {\`a} pattes"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"universit\'e Paris 6"
, address =	"France"
, year =	1996
, url =	"http://www-sop.inria.fr/prisme/publis/these-lazard.ps.gz"
, keywords =	"doctoral thesis"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers"
}

@techreport{l-spbcc-97
, author =	"Sylvain Lazard"
, title =	"Shortest Paths of Bounded Curvature in a Convex Polygon"
, type =	"Manuscript, Presented at the 2nd CGC Workshop on Computational Geometry, October, 1997"
, institution =	"McGill University"
, year =	1997
, update =	"98.03 mitchell"
}

@inproceedings{lpvv-ccpso-01
, author =	"Francis Lazarus and Michel Pocchiola and Gert Vegter and Anne Verroust"
, title =	"Computing a Canonical Polygonal Schema of an Orientable Triangulated Surface"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"146--149"
, update =	"01.04 icking"
}

@inproceedings{lsfb-hdtcb-88
, author =	"E. {Le Bras-Mehlman} and M. Schmitt and O. D. Faugeras and J. D. Boissonnat"
, title =	"How The {Delaunay} Triangulation Can Be Used For Representing Stereo Data"
, booktitle =	"Second International Conference on Computer Vision"
, publisher =	"IEEE"
, address =	"New York, NY"
, year =	1988
, pages =	"54--63"
, keywords =	"Delaunay triangulation, stereo data"
, annote =	"Uses Watson style insertion algorithm. Constraints are
		 dealt with by adding extra points. To get a
		 triangulated surface we discard tetrahedra that block
		 visibility of line segments. This is combined with 3D
		 DT calculation."
, abstract =	"A coherent method is discussed of interpolating 3-D
		 data with a polyhedral surface by the Delaunay
		 triangulation. First some theoretical properties are
		 given concerning the approximation of sampled objects
		 obtained when the sampling rate increases, based on
		 study of object skeletons using some tools of
		 mathematical morphology. Then the algorithms and their
		 complexity analysis are presented which yield both a
		 surface representation of objects and a volume
		 representation of free space. This goal is achieved by
		 means of a simple visibility criterion. The method is
		 intrinsically discontinuity- preserving and is useful
		 for the integration of multiple viewpoints. 32 Refs."
}

@inproceedings{l-qsan-97
, author =	"Ngoc-Minh L{\^e}"
, title =	"A Quantum--Searching Application Note"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"113--116"
, update =	"99.03 bibrelex, 97.11 jones"
}

@techreport{l-avd3s-99
, author =	"Ngoc-Minh L{\^e}"
, title =	"Abstract {Voronoi} Diagrams in 3-Space"
, number =	"HKUST-TCSC-99-11"
, institution =	"Hong Kong University of Science and Technology, Theoretical Computer Science Center"
, year =	1999
, url =	"http://www.cs.ust.hk/tcsc/RR/1999-11.ps.gz"
, update =	"00.03 bibrelex"
}

@inproceedings{l-clvd3-98
, author =	"Ngoc-Minh L{\^e}"
, title =	"Computing the {$L_\infty$}-{Voronoi} Diagram in 3-Space Optimally"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	113
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@techreport{l-dospg-95t
, author =	"Ngoc-Minh L{\^e}"
, title =	"On Determining Optimal Strategies in Pursuit Games in the Plane"
, number =	172
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1995
, precedes =	"l-dospg-95"
, update =	"98.11 bibrelex"
}

@inproceedings{l-dospg-95
, author =	"Ngoc-Minh L{\^e}"
, title =	"On Determining Optimal Strategies in Pursuit Games in the Plane"
, booktitle =	"Proc. 22th Internat. Colloq. Automata Lang. Program."
, nickname =	"ICALP '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	944
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"499--510"
, succeeds =	"l-dospg-95t"
, update =	"98.11 bibrelex"
}

@inproceedings{l-gpscs-93
, author =	"Ngoc-Minh L{\^e}"
, title =	"On General Properties of Strictly Convex Smooth Distance Functions in {$R^d$}"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"375--380"
, cites =	"ei-drmwc-79, h-dt-76, iklm-cdf3s-93, k-vd-73, m-dmpcg-90, s-nfa-69, ZZZ"
, update =	"99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{l-nscdf-96
, author =	"Ngoc-Minh L{\^e}"
, title =	"On Non-Smooth Convex Distance Functions"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, publisher =	"Carleton University Press, Ottawa, Canada"
, year =	1996
, pages =	"113--118"
, update =	"99.07 bibrelex, 99.03 bibrelex, 96.09 mitchell"
}

@article{l-nscdf-97
, author =	"Ngoc-Minh L{\^e}"
, title =	"On Non-Smooth Convex Distance Functions"
, journal =	"Inform. Process. Lett."
, volume =	63
, number =	6
, year =	1997
, pages =	"323--329"
, keywords =	"Voronoi diagram, convex distance function, abstract Voronoi diagram"
, update =	"99.07 bibrelex, 99.03 bibrelex"
}

@inproceedings{l-vdlmh-94
, author =	"Ngoc-Minh L{\^e}"
, title =	"On {Voronoi} Diagrams in the {$L_p$} Metric in Higher Dimensions"
, booktitle =	"Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	755
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"711--722"
, precedes =	"l-vdlm-96"
, update =	"99.11 bibrelex, 99.03 bibrelex, 98.03 icking"
}

@article{l-vdlm-96
, author =	"Ngoc-Minh L{\^e}"
, title =	"On {Voronoi} diagrams in the {$L_p$}-metric in {$R^D$}"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"177--196"
, succeeds =	"l-vdlmh-94"
, update =	"99.03 bibrelex, 97.03 smid"
}

@techreport{l-ricsa-95t
, author =	"Ngoc-Minh L{\^e}"
, title =	"Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
, number =	174
, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
, address =	"Germany"
, year =	1995
, precedes =	"l-ricsa-95"
, update =	"98.11 bibrelex"
}

@inproceedings{l-ricsa-95
, author =	"Ngoc-Minh L{\^e}"
, title =	"Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
, booktitle =	"Proc. 10th Internat. Conf. Fund. Comput. Theory"
, nickname =	"FCT '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	965
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"333--342"
, succeeds =	"l-ricsa-95t"
, precedes =	"l-ricsa-97"
, update =	"99.03 bibrelex, 98.11 bibrelex"
}

@inproceedings{l-ricsa-95c
, author =	"Ngoc-Minh L{\^e}"
, title =	"Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"17--20"
, update =	"00.03 bibrelex"
}

@article{l-ricsa-97
, author =	"Ngoc-Minh L{\^e}"
, title =	"Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"279--298"
, keywords =	"computational geometry, Voronoi diagrams, power diagrams, convex distance functions"
, succeeds =	"l-ricsa-95"
, update =	"99.03 bibrelex"
}

@article{ll-orpr-91
, author =	"V. B. Le and D. T. Lee"
, title =	"Out-of-roundness problem revisited"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-13"
, number =	3
, year =	1991
, pages =	"217--223"
}

@incollection{l-smscs-91
, author =	"A. Leach"
, title =	"A survey of methods for searching the conformational space of small and medium sized molecules"
, editor =	"K. Lipkowitz and D. Boyd"
, booktitle =	"Reviews in Computational Chemistry"
, volume =	2
, publisher =	"VCH Publishers"
, year =	1991
, pages =	"1--47"
, update =	"98.07 bibrelex"
}

@inproceedings{l-iwcod-92
, author =	"G. Leach"
, title =	"Improving worst-case optimal {Delaunay} triangulation algorithms"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"340--346"
, cites =	"d-fdcac-87, e-acg-87, f-savd-87, gs-dfbt-78, ps-cgi-85, b-prcv-75, dk-savd-87, gs-pmgsc-85, j-ecpqe-86, kln-edtur-91, ls-tacdt-80, s-a-88, s-cg-78, sh-cpp-75, st-sah-86, ZZZ"
, update =	"99.03 forrest, 98.11 bibrelex, 98.07 bibrelex"
}

@techreport{l-satps-90
, author =	"A. Leblanc"
, title =	"Some Applications of the Topological Plane Sweep Algorithm"
, type =	"Technical {Report}"
, number =	"SOCS 90.5"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{lt-sptcc-91
, author =	"?? L'Ecuyer and ?? Tezuka"
, title =	"Structural properties for two classes of combined random number generators"
, journal =	"Math. Comput."
, volume =	57
, year =	1991
, update =	"98.03 bibrelex"
}

@article{l-epcrn-88
, author =	"Pierre L'Ecuyer"
, title =	"Efficient and portable combined random number generators"
, journal =	"Commun. ACM"
, volume =	31
, year =	1988
, pages =	"742--749, 774"
, update =	"99.03 forrest, 98.03 bibrelex"
}

@inproceedings{lsscd-mmaps-98
, author =	"A. W. F. Lee and W. Swelden and P. Schr{\"o}der and L. Cowsar and D. Dobkin"
, title =	"MAPS: Multiresolution Adaptive Parameterization of Surfaces"
, booktitle =	"Proc. SIGGRAPH '98"
, site =	"Orlando, FL"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, month =	jul
, year =	1998
, pages =	"95--104"
, update =	"98.11 held"
}

@article{lr-ipses-71
, author =	"B. Lee and F. M. Richards"
, title =	"The interpretation of protein structure: {Estimation} of static accessibility"
, journal =	"J. Molecular Biology"
, volume =	55
, year =	1971
, pages =	"379--400"
, update =	"98.03 agarwal+bibrelex"
}

@incollection{l-rtp-91
, author =	"C. Lee"
, title =	"Regular Triangulations of Polytopes"
, editor =	""
, booktitle =	"Applied Geometry and Discrete Mathematics"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	4
, publisher =	"AMS Press"
, year =	1991
, pages =	"443--456"
, keywords =	"convex hull, expected-case analysis"
, update =	"97.11 bibrelex, 95.05 korneenko"
}

@article{ll-ccmp-84
, author =	"C. C. Lee and D. T. Lee"
, title =	"On a circle-cover minimization problem"
, journal =	"Inform. Process. Lett."
, volume =	18
, year =	1984
, pages =	"109--115"
}

@incollection{l-stp-97
, author =	"C. W. Lee"
, title =	"Subdivisions and triangulations of polytopes"
, chapter =	14
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"271--290"
, update =	"97.11 orourke"
}

@article{l-atng-89
, author =	"C. W. Lee"
, title =	"The Associahedron and Triangulations of the $n$-gon"
, journal =	"European J. Combin."
, volume =	10
, year =	1989
, pages =	"551--560"
, update =	"97.11 bibrelex"
}

@article{ll-ccagp-86
, author =	"D. Lee and A. Lin"
, title =	"Computational complexity of art gallery problems"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	32
, number =	2
, year =	1986
, pages =	"276--282"
, update =	"98.11 bibrelex, 94.05 devillers"
}

@techreport{l-afknn-81
, author =	"D. T. Lee"
, title =	"An approach to finding the $k$-nearest neighbors in the {Eucliedean} plane"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
, address =	"Evanston, IL"
, year =	1981
, update =	"97.11 bibrelex"
}

@incollection{l-cg-96
, author =	"D. T. Lee"
, title =	"Computational Geometry"
, chapter =	6
, editor =	"Allen B. Tucker, Jr."
, booktitle =	"The Computer Science and Engineering Handbook"
, publisher =	"CRC Press"
, address =	"Boca Raton, FL"
, year =	1996
, url =	"http://www.ece.nwu.edu/~dtlee/CRCHandbook_chap6.ps.Z"
, comments =	"survey article, 36 pages, 128 references"
, update =	"98.07 bibrelex"
}

@techreport{l-fnvda-80
, author =	"D. T. Lee"
, title =	"Furthest neighbor {Voronoi} diagrams and applications"
, type =	"Report"
, number =	"80-11-FC-04"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
, address =	"Evanston, IL"
, year =	1980
}

@inproceedings{l-gavr-97
, author =	"D. T. Lee"
, title =	"Geometric Algorithm Visualization Revisited"
, booktitle =	"Workshop on Geometric Computing"
, year =	1997
, url =	"http://www-sop.inria.fr/prisme/scg97/prog\_workshop.html"
, update =	"99.07 devillers, 98.07 tamassia"
}

@incollection{l-mcprg-83
, author =	"D. T. Lee"
, title =	"Maximum Clique Problem of Rectangle Graphs"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"91--107"
, update =	"01.04 icking"
}

@article{l-matps-82
, author =	"D. T. Lee"
, title =	"Medial axis transformation of a planar shape"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-4"
, number =	4
, year =	1982
, pages =	"363--369"
, update =	"98.11 bibrelex"
}

@techreport{l-fchsp-80
, author =	"D. T. Lee"
, title =	"On Finding the Convex Hull of a Simple Polygon"
, type =	"Technical {Report}"
, number =	"80-03-FC-01"
, institution =	"Northwestern Univ."
, address =	"Evanston, IL"
, month =	mar
, year =	1980
, update =	"97.11 bibrelex"
}

@article{l-fchsp-83
, author =	"D. T. Lee"
, title =	"On finding the convex hull of a simple polygon"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	12
, year =	1983
, pages =	"87--98"
}

@mastersthesis{l-fknnp-76
, author =	"D. T. Lee"
, title =	"On finding the $k$-nearest neighbors in the plane"
, school =	"Coordinated Sci. Lab., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1976
, note =	"Report R-728"
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@article{l-knnvd-82
, author =	"D. T. Lee"
, title =	"On $k$-nearest neighbor {Voronoi} diagrams in the plane"
, journal =	"IEEE Trans. Comput."
, volume =	"C-31"
, year =	1982
, pages =	"478--487"
}

@techreport{l-prp-78
, author =	"D. T. Lee"
, title =	"Proximity and reachability in the plane"
, type =	"Report"
, number =	"R-831"
, institution =	"Dept. Elect. Engrg., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1978
, succeeds =	"l-prp-78p"
, update =	"98.11 bibrelex"
}

@phdthesis{l-prp-78p
, author =	"D. T. Lee"
, title =	"Proximity and reachability in the plane"
, school =	"Coordinated Science Lab., Univ. Illinois"
, address =	"Urbana, Ill."
, year =	1978
, keywords =	"doctoral thesis"
, precedes =	"l-prp-78"
, update =	"98.11 bibrelex"
}

@inproceedings{l-rpro-92
, author =	"D. T. Lee"
, title =	"Rectilinear Paths among Rectilinear Obstacles"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"5--20"
, precedes =	"lyw-rpro-96"
, update =	"96.05 mitchell"
, annote =	"This is an abridged version of the journal paper by Lee, Yang, and Wong"
}

@article{l-rnglm-85
, author =	"D. T. Lee"
, title =	"Relative Neighborhood Graphs in the ${L}_1$ Metric"
, journal =	"Pattern Recogn."
, volume =	18
, number =	5
, year =	1985
, pages =	"327--335"
, annote =	"$O(n\log n)$ algorithm for RNG in ${L}_1$, from DT. Scan
		 in each of four directions, removing non RNG edges."
}

@article{l-srvdd-81
, author =	"D. T. Lee"
, title =	"Shading of regions on vector display devices"
, journal =	"Comput. Graph."
, volume =	15
, number =	3
, year =	1981
, pages =	"37--44"
, note =	"Proc. SIGGRAPH '81"
}

@article{l-tdvdl-80
, author =	"D. T. Lee"
, title =	"Two-dimensional {Voronoi} diagrams in the {$L_p$}-metric"
, journal =	"J. ACM"
, volume =	27
, number =	4
, year =	1980
, pages =	"604--618"
, update =	"99.03 bibrelex, 98.11 bibrelex"
}

@article{l-vsp-83
, author =	"D. T. Lee"
, title =	"Visibility of a simple polygon"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	22
, year =	1983
, pages =	"207--221"
}

@techreport{l-wfnvd-93
, author =	"D. T. Lee"
, title =	"Weighted farthest neighbor {Voronoi} Diagrams"
, type =	"Manuscript"
, institution =	"Mississippi State University"
, month =	feb
, year =	1993
, comments =	"Second Workshop on Proximity Graphs"
, update =	"93.09 milone+mitchell"
}

@article{lcw-occss-81
, author =	"D. T. Lee and C.-H. Chang and C. K. Wong"
, title =	"An on-chip compare steer bubble sorter"
, journal =	"IEEE Trans. Comput."
, volume =	"??"
, year =	1981
, pages =	"396--405"
, update =	"98.03 bibrelex"
}

@incollection{lc-dvesc-85
, author =	"D. T. Lee and I. M. Chen"
, title =	"Display of visible edges of a set of convex polygons"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"249--265"
}

@inproceedings{lcy-srpwo-90
, author =	"D. T. Lee and T. H. Chen and C. D. Yang"
, title =	"Shortest rectilinear paths among weighted obstacles"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"301--310"
, cites =	"aaghi-vdp-86, ckv-rsptp-87, rlw-rsppr-89, ft-fhtu-84, gh-ospqs-87, gs-canen-83, ll-fmrdp-81, l-prp-78, lp-esppr-84, lw-apcfp-79, mp-psp-85, m-srpo-87t, m-naspo-88, ps-cgi-85, w-cvgnl-85, w-ndiv-89, wwsw-rspms-87, ZZZ"
, update =	"97.11 bibrelex"
}

@article{lc-pgdr-85
, author =	"D. T. Lee and Y. T. Ching"
, title =	"The power of geometric duality revisited"
, journal =	"Inform. Process. Lett."
, volume =	21
, year =	1985
, pages =	"117--122"
}

@article{ld-gvdp-81
, author =	"D. T. Lee and R. L. {Drysdale, III}"
, title =	"Generalization of {Voronoi} diagrams in the plane"
, journal =	"SIAM J. Comput."
, volume =	10
, year =	1981
, pages =	"73--87"
, keywords =	"Voronoi diagrams, line segments, two-dimensional"
}

@techreport{ll-cvpe-84
, author =	"D. T. Lee and A. Lin"
, title =	"Computing the Visibility Polygon from an Egde"
, type =	"Technical {Report}"
, institution =	"Northwestern University"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{ll-cvpe-86
, author =	"D. T. Lee and A. K. Lin"
, title =	"Computing the visibility polygon from an edge"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	34
, year =	1986
, pages =	"1--19"
, update =	"93.09 milone+mitchell"
}

@article{ll-gdtpg-86
, author =	"D. T. Lee and A. K. Lin"
, title =	"Generalized {Delaunay} Triangulation for Planar Graphs"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"201--217"
}

@techreport{lm-rac-83
, author =	"D. T. Lee and N. Megiddo"
, title =	"Routing around circles"
, type =	"Manuscript"
, institution =	"??"
, year =	1983
}

@techreport{ln-ddsvd-80
, author =	"D. T. Lee and A. Naamad"
, title =	"A dynamic data structure for {Voronoi} diagrams and its applications"
, type =	"Report"
, number =	"80-10-FC-03"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
, address =	"Evanston, IL"
, year =	1980
}

@article{lp-iarep-82
, author =	"D. T. Lee and F. P. Preparata"
, title =	"An improved algorithm for the rectangle enclosure problem"
, journal =	"J. Algorithms"
, volume =	3
, year =	1982
, pages =	"218--224"
}

@article{lp-oafkp-79
, author =	"D. T. Lee and F. P. Preparata"
, title =	"An optimal algorithm for finding the kernel of a polygon"
, journal =	"J. ACM"
, volume =	26
, number =	3
, month =	jul
, year =	1979
, pages =	"415--421"
, update =	"98.11 bibrelex"
}

@article{lp-cgs-84
, author =	"D. T. Lee and F. P. Preparata"
, title =	"Computational geometry: a survey"
, journal =	"IEEE Trans. Comput."
, volume =	"C-33"
, year =	1984
, pages =	"1072--1101"
}

@article{lp-esppr-84
, author =	"D. T. Lee and F. P. Preparata"
, title =	"Euclidean shortest paths in the presence of rectilinear barriers"
, journal =	"Networks"
, volume =	14
, year =	1984
, pages =	"393--410"
, keywords =	"triangulations"
}

@inproceedings{lp-lppsi-76
, author =	"D. T. Lee and F. P. Preparata"
, title =	"Location of a point in a planar subdivision and its applications"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
, year =	1976
, pages =	"231--235"
, precedes =	"lp-lppsi-77"
}

@article{lp-lppsi-77
, author =	"D. T. Lee and F. P. Preparata"
, title =	"Location of a point in a planar subdivision and its applications"
, journal =	"SIAM J. Comput."
, volume =	6
, number =	3
, year =	1977
, pages =	"594--606"
, succeeds =	"lp-lppsi-76"
, update =	"98.07 tamassia"
}

@article{lp-pbppl-89
, author =	"D. T. Lee and F. P. Preparata"
, title =	"Parallel batched planar point location on the {CCC}"
, journal =	"Inform. Process. Lett."
, volume =	33
, year =	1989
, pages =	"175--179"
, update =	"93.05 devillers"
}

@article{lp-annpc-78
, author =	"D. T. Lee and F. P. Preparata"
, title =	"The all nearest-neighbor problem for convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	7
, year =	1978
, pages =	"189--192"
}

@article{ls-mispg-93
, author =	"D. T. Lee and M. Sarrafzadeh"
, title =	"Maximum independent set of a permutation graph in K tracks"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"291--304"
, keywords =	"Permutation graphs, maximum independent set, maximum chain, track assignment, plane sweep technique"
, update =	"96.09 devillers"
}

@article{ls-tacdt-80
, author =	"D. T. Lee and B. J. Schachter"
, title =	"Two algorithms for constructing {Delaunay} triangulations"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	9
, number =	3
, year =	1980
, pages =	"219--242"
, update =	"01.11 smid, 98.07 bibrelex"
}

@article{lss-gdvtg-98
, author =	"D. T. Lee and C.-F. Shen and D. S. Sheu"
, title =	"Geosheet: A Distributed Visualization Tool for Geometric Algorithms"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"119--156"
, update =	"98.11 devillers"
}

@article{ls-oirac-82
, author =	"D. T. Lee and C. B. Silio"
, title =	"An optimal illumination region algorithm for convex polygons"
, journal =	"IEEE Trans. Comput."
, volume =	"C-31"
, year =	1982
, pages =	"1225--1227"
}

@techreport{ls-oscac-80
, author =	"D. T. Lee and C. B. {Silio, Jr.}"
, title =	"An optimal simplex coverability algorithm for convex polygons"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
, address =	"Evanston, IL"
, year =	1980
}

@article{lw-firrs-81
, author =	"D. T. Lee and C. K. Wong"
, title =	"Finding intersections of rectangles by range search"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"337--347"
}

@article{lw-qtfsm-80
, author =	"D. T. Lee and C. K. Wong"
, title =	"Quintary trees: a file structure for multidimensional database systems"
, journal =	"ACM Trans. Database Syst."
, volume =	5
, year =	1980
, pages =	"339--353"
}

@article{lw-vdllm-80
, author =	"D. T. Lee and C. K. Wong"
, title =	"Voronoi diagrams in {$L_{1}$} ({$L_{\infty}$}) metrics with $2$-dimensional storage applications"
, journal =	"SIAM J. Comput."
, volume =	9
, number =	1
, year =	1980
, pages =	"200--211"
, update =	"98.11 bibrelex"
}

@article{lw-wcarp-77
, author =	"D. T. Lee and C. K. Wong"
, title =	"Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees"
, journal =	"Acta Inform."
, volume =	9
, year =	1977
, pages =	"23--29"
}

@inproceedings{lw-eae1l-87
, author =	"D. T. Lee and Y. F. Wu"
, title =	"Efficient algorithms for {Euclidean} $1$-line center and problems"
, booktitle =	"Proc. ISOLDE III"
, site =	"Boston, MA"
, year =	1987
, pages =	"??"
}

@article{lw-gcslp-86
, author =	"D. T. Lee and Y. F. Wu"
, title =	"Geometric complexity of some location problems"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"193--211"
}

@article{ly-lmpps-79
, author =	"D. T. Lee and C. C. Yang"
, title =	"Location of multiple points in a planar subdivision"
, journal =	"Inform. Process. Lett."
, volume =	9
, year =	1979
, pages =	"190--193"
}

@article{lyc-srpwo-91
, author =	"D. T. Lee and C. D. Yang and T. H. Chen"
, title =	"Shortest rectilinear paths among weighted obstacles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	2
, year =	1991
, pages =	"109--124"
, keywords =	"shortest path, rectilinear path, weighted obstacle, graph theoretic approach"
}

@article{lyw-frpao-97
, author =	"D. T. Lee and C. D. Yang and C. K. Wong"
, title =	"Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"581--598"
, update =	"98.11 devillers"
}

@article{lyw-rpro-96
, author =	"D. T. Lee and C. D. Yang and C. K. Wong"
, title =	"Rectilinear paths among rectilinear obstacles"
, journal =	"Discrete Appl. Math."
, volume =	70
, year =	1996
, pages =	"185--215"
, keywords =	"survey, shortest paths, rectilinear geometry, bicriteria paths, VLSI, wire routing"
, succeeds =	"l-rpro-92"
, update =	"97.03 schwarzkopf, 96.05 mitchell"
}

@inproceedings{lc-avcpg-92
, author =	"H. S. Lee and R. C. Chang"
, title =	"Approximating Vertices of a Convex Polygon with Grid Points in the Polygon"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"269--278"
, update =	"94.09 smid, 93.09 milone+mitchell"
}

@inproceedings{lc-hgpcp-91
, author =	"H. S. Lee and R. C. Chang"
, title =	"On hitting grid points in a convex polygon with straight lines"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"176--189"
}

@article{lc-regpc-93
, author =	"H. S. Lee and R. C. Chang"
, title =	"Regular enumeration of grid points in a convex polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"305--322"
, keywords =	"approximation algorithms, continued fraction expansions, hitting set problem, number theory"
, update =	"96.09 devillers"
}

@inproceedings{l-dhcme-89
, author =	"Jay Lee"
, title =	"A drop heuristic conversion method for extracting irregular network for digital elevation models"
, booktitle =	"GIS/LIS '89 Proc."
, volume =	1
, publisher =	"American Congress on Surveying and Mapping"
, month =	nov
, year =	1989
, pages =	"30--39"
, keywords =	"triangulated irregular network, terrain, surface simplification"
, update =	"95.09 mitchell"
, abstract =	"The advantages and disadvantages of various DEMs have
been discussed extensively and authors have concluded that for many
types of applications the triangulated irregular network is better
suited for approximating terrain surfaces because of its efficiency in
data storage and its simple structure for accommodating irregular data
points. While the USGS grid DEM files are the most widely available
digital elevation data, an efficient conversion algorithm between
grid-based DEM and TIN models becomes more important as TIN models are
increasingly more popular. The author examines and compares several
existing methods of converting grid DEMs to TIN models with a new method
which uses a drop heuristic approach. The drop heuristic method may be
used either to extract TINs from grid DEM or to reduce the size of an
irregularly spaced point set."
}

@article{l-avsts-91
, author =	"J. Lee"
, title =	"Analyses of Visibility Sites on Topographic Surfaces"
, journal =	"Internat. J. Geogr. Inform. Syst."
, volume =	5
, year =	1991
, pages =	"413--430"
, update =	"96.09 kreveld"
}

@article{l-cembt-91
, author =	"Jay Lee"
, title =	"Comparison of existing methods for building triangular irregular network models of terrain from grid digital elevation models"
, journal =	"Internat. J. Geogr. Inform. Syst."
, volume =	5
, number =	3
, month =	jul # "-" # sep
, year =	1991
, pages =	"267--285"
, keywords =	"terrain, triangulated irregular network, TIN"
, update =	"96.09 devillers, 95.09 mitchell"
, annote =	"Compares his drop heuristic algorithm to Chen-Guevara
and DeFloriani84"
, abstract =	"Triangulated irregular networks (TINs) are
increasingly popular for their efficiency in data storage and their
ability to accommodate irregularly spaced elevation points for many
applications of geographical information systems. The paper reviews and
evaluates various methods for extracting TINs from dense digital
elevation models (DEMs) on a sample DEM. Both structural and statistical
comparisons show that the methods perform with different rates of
success in different settings. Users of DEM to TIN conversion methods
should be aware of the strengths and weaknesses of the methods in
addition to their own purposes before conducting the conversion."
}

@techreport{lc-tasso-98
, author =	"Jae-Ha Lee and Kyung-Yong Chwa"
, title =	"Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem"
, institution =	"Department of Computer Science, KAIST"
, address =	"Taejon, Korea"
, year =	1998
, precedes =	"lc-tasso-99"
, update =	"99.07 bibrelex, 98.07 icking"
}

@article{lc-tasso-99
, author =	"Jae-Ha Lee and Kyung-Yong Chwa"
, title =	"Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem"
, journal =	"Inform. Process. Lett."
, volume =	69
, year =	1999
, pages =	"39--45"
, succeeds =	"lc-tasso-98"
, update =	"99.07 bibrelex+smid"
}

@inproceedings{lsksc-ncssu-97
, author =	"Jae-Ha Lee and Chan-Su Shin and Jae-Hoon Kim and Sung Yong Shin and Kyung-Yong Chwa"
, title =	"New Competitive Strategies for Searching in Unknown Star-Shaped Polygons"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"427--429"
, cites =	"bcr-sp-93, di-csgs-94, ik-skpcs-95, l-oltsb-96, ls-pinos-97, k-wusbd-91, k-olssp-94, py-spwm-89, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex+icking, 98.03 mitchell, 97.06 efrat"
, annote =	"They assume an input of a star-shaped polygon, P.
                 For the problem of getting from s to the kernel,
                 they give an algorithm with competitive ratio
                 $1+2\sqrt{2}\approx 3.829$, while for getting from s
                 to a target point t, a ratio of 17 is obtained
                 (which is improved to 12.72 by \cite{ls-pinos-97})."
}

@article{twccwj-cpspu-97
, author =	"M. K. Lee"
, title =	"A New Convex-Hull Based Approach to Evaluating Flatness Tolerance"
, journal =	"Comput. Aided Design"
, volume =	29
, number =	12
, year =	1997
, pages =	"861--868"
, update =	"98.03 mitchell"
}

@article{lcc-apcam-76
, author =	"R. C. T. Lee and Y. H. Chin and S. C. Chang"
, title =	"Application of principal component analysis to multikey searching"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-2"
, year =	1976
, pages =	"185--193"
}

@article{lsb-tmsmp-77
, author =	"R. C. T. Lee and J. R. Slagle and H. Blum"
, title =	"A triangulation method for the sequential mapping of points from $n$-space to $2$-space"
, journal =	"IEEE Trans. Comput."
, volume =	"C-26"
, year =	1977
, pages =	"288--292"
}

@techreport{lt-asspm-76
, author =	"R. C. T. Lee and R. C. Tsai"
, title =	"Application of short spanning path to multi-key searching"
, type =	"Report"
, number =	"??"
, institution =	"Inst. Appl. Math., National Tsing Hua Univ."
, address =	"Hsinchu, Taiwan"
, year =	1976
}

@article{lc-ntlcs-87
, author =	"S. H. Lee and K. Y. Chwa"
, title =	"A new triangulation-linear class of simple polygons"
, journal =	"Internat. J. Comput. Math."
, volume =	22
, year =	1987
, pages =	"135--147"
}

@article{lc-scvps-90
, author =	"S. H. Lee and K. Y. Chwa"
, title =	"Some chain visibility problems in a simple polygon"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"485--507"
}

@article{lds-afemg-84
, author =	"Y. T. Lee and A. {De Pennington} and N. K. Shaw"
, title =	"Automatic finite-element mesh generation from geometric models: a point-based approach"
, journal =	"ACM Trans. Graph."
, volume =	3
, number =	4
, year =	1984
, pages =	"287--311"
}

@article{lr-acvoi1-82
, author =	"Y. T. Lee and A. A. G. Requicha"
, title =	"Algorithms for computing the volume and other integral properties of solids. {I}. {Known} methods and open issues"
, journal =	"Commun. ACM"
, volume =	25
, year =	1982
, pages =	"635--641"
}

@article{lr-acvoi2-82
, author =	"Y. T. Lee and A. A. G. Requicha"
, title =	"Algorithms for computing the volume and other integral properties of solids. {II}. {A} family of algorithms based on representation conversion and cellular approximation"
, journal =	"Commun. ACM"
, volume =	25
, year =	1982
, pages =	"642--650"
}

@techreport{l-gcg-82
, author =	"J. van Leeuwen"
, title =	"Graphics and computational geometry"
, type =	"Report"
, number =	"RUU-CS-81-18"
, institution =	"Les Mathematiques de Informatique, Colloq. AFCET"
, address =	"Paris, France"
, year =	1982
, pages =	"159--165"
}

@article{l-pp-83
, author =	"J. van Leeuwen"
, title =	"Problem {P}20"
, journal =	"Bull. EATCS"
, volume =	19
, year =	1983
, pages =	150
}

@techreport{lm-dssds-80
, author =	"J. van Leeuwen and H. A. Maurer"
, title =	"Dynamic systems of static data-structures"
, type =	"Report"
, number =	"F42"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1980
}

@inproceedings{lo-ad-81
, author =	"J. van Leeuwen and M. H. Overmars"
, title =	"The art of dynamizing"
, booktitle =	"Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	118
, publisher =	"Springer-Verlag"
, year =	1981
, pages =	"121--131"
}

@inproceedings{ls-utstp-82
, author =	"J. van Leeuwen and Anneke A. Schoone"
, title =	"Untangling a travelling salesman tour in the plane"
, editor =	"J. R. M{\"u}hlbacher"
, booktitle =	"Proc. 7th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '81"
, publisher =	"Hanser"
, address =	"M{\"u}nchen"
, year =	1982
, pages =	"87--98"
, comments =	"replaces the old techreport vs-utstp-80"
, update =	"98.07 bibrelex, 93.09 rote"
}

@article{lw-ddsp-80
, author =	"J. van Leeuwen and D. Wood"
, title =	"Dynamization of decomposable searching problems"
, journal =	"Inform. Process. Lett."
, volume =	10
, year =	1980
, pages =	"51--56"
}

@article{lw-mprrd-81
, author =	"J. van Leeuwen and D. Wood"
, title =	"The measure problem for rectangular ranges in $d$-space"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"282--300"
}

@article{lm-tmd-98
, author =	"Vincent Lef{\'e}vre and Jean-Michel Muller"
, title =	"The Table Maker's Dilemma"
, journal =	"IEEE Trans. Comput."
, volume =	47
, number =	11
, year =	1998
, update =	"00.03 devillers"
}

@book{l-at-42
, author =	"S. Lefschetz"
, title =	"Algebraic topology"
, publisher =	"American Mathematical Society"
, year =	1942
, update =	"97.11 bibrelex"
}

@book{l-aat-75
, author =	"S. Lefschetz"
, title =	"Applications of Algebraic Topology"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1975
, update =	"98.03 bibrelex"
}

@book{l-it-49
, author =	"S. Lefschetz"
, title =	"Introduction to Topology"
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1949
, update =	"98.03 bibrelex"
}

@article{ld-cccoe-81
, author =	"P. Lehert and P. A. Devijver"
, title =	"Clustering by connected components in {$O(n)$} expected time"
, journal =	"RAIRO Inform. Theor."
, volume =	15
, year =	1981
, pages =	"207--218"
}

@article{l-rpo3d-90
, author =	"G. Lei"
, title =	"Recognition of planar objects in 3-D space from single perspective views using cross ratio"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, number =	4
, year =	1990
, pages =	"432--437"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ll-dtvdr-00
, author =	"Greg Leibon and David Letscher"
, title =	"Delaunay Triangulations and {Voronoi} Diagrams for {Riemannian} Manifolds"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"341--349"
, update =	"00.11 jones"
}

@article{l-udaek-59
, author =	"K. Leichtwei{\ss}"
, title =	"{\"U}ber die affine {Exzentrizit{\"a}t} konvexer {K{\"o}rper}"
, journal =	"Arch. Math."
, volume =	10
, year =	1959
, pages =	"187--199"
, update =	"97.11 bibrelex"
}

@inproceedings{l-lsvwi-82
, author =	"F. T. Leighton"
, title =	"A layout strategy for {VLSI} which is provably good"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
, year =	1982
, pages =	"85--98"
, precedes =	"bl-fsvgl-84"
}

@book{l-civ-83
, author =	"F. T. Leighton"
, title =	"Complexity issues in {VLSI}"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1983
, update =	"97.11 bibrelex"
}

@book{l-ipaaa-92
, author =	"F. T. Leighton"
, title =	"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes"
, publisher =	"Morgan-Kaufmann"
, address =	"San Mateo, CA"
, year =	1992
, update =	"96.09 orourke"
}

@inproceedings{l-nlbtv-81
, author =	"F. T. Leighton"
, title =	"New lower bound techniques for {VLSI}"
, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1981
, pages =	"1--12"
, precedes =	"l-nlbtv-84"
}

@article{l-nlbtv-84
, author =	"F. T. Leighton"
, title =	"New lower bound techniques for {VLSI}"
, journal =	"Math. Syst. Theory"
, volume =	17
, year =	1984
, pages =	"47--70"
, succeeds =	"l-nlbtv-81"
}

@article{l-tbcps-85
, author =	"F. T. Leighton"
, title =	"Tight Bounds on the Complexity of Parallel Sorting"
, journal =	"IEEE Trans. Comput."
, volume =	"C-34"
, number =	4
, year =	1985
, pages =	"344--354"
, update =	"96.09 orourke"
}

@article{ll-wsisa-85
, author =	"F. T. Leighton and C. E. Leiserson"
, title =	"Wafer-scale integration of systolic arrays"
, journal =	"IEEE Trans. Comput."
, volume =	"??"
, year =	1985
, pages =	"448--461"
, update =	"98.03 bibrelex"
}

@article{lr-3dcl-86
, author =	"F. T. Leighton and A. Rosenberg"
, title =	"{3D} Circuit Layouts"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"793--813"
, update =	"96.09 tamassia"
}

@inproceedings{l-sndsn-89
, author =	"P. Leinhardt"
, title =	"Subdivision of $n$-dimensional spaces and $n$-dimensional generalized maps"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"228--236"
}

@article{ln-dnnp-79
, author =	"T. Leipaelae and O. Nevalainen"
, title =	"On a dynamic nearest neighbour problem"
, journal =	"RAIRO Inform. Theor."
, volume =	13
, year =	1979
, pages =	"3--15"
}

@inproceedings{l-aeglv-80
, author =	"C. E. Leiserson"
, title =	"Area-efficient graph layouts (for {VLSI})"
, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1980
, pages =	"270--281"
}

@book{l-aeglv-83
, author =	"C. E. Leiserson"
, title =	"Area-efficient graph layouts (for {VLSI})"
, series =	"ACM Doctoral Dissertation Award Series"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1983
}

@inproceedings{lm-artrp-85
, author =	"C. E. Leiserson and F. M. Maley"
, title =	"Algorithms for routing and testing routability of planar {VLSI} layouts"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"69--78"
}

@techreport{lp-seafc-83
, author =	"C. E. Leiserson and C. A. Phillips"
, title =	"A space-efficient algorithm for finding the connected components of rectangles in the plane"
, type =	"Report"
, number =	"??"
, institution =	"Lab. Comput. Sci., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1983
}

@article{lp-oprr-83
, author =	"C. E. Leiserson and R. Y. Pinter"
, title =	"Optimal placement for river routing"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"447--462"
}

@inproceedings{ls-tdgs-91
, author =	"A. L. Leistman and T. C. Shermer"
, title =	"Two-dimensional grid spanners"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"211--214"
, cites =	"ckv-fhe-87, c-t2s-91, kl-pic-80, ls-ghs-91, ps-gs-89, pu-osh-87, rl-dcps-90, ZZZ"
, update =	"98.07 bibrelex"
}

@unpublished{l-ceaaw-
, author =	"L. D. Lejter"
, title =	"A Collaborative Environment for Algorithm Animation on the {WWW}"
, url =	"http://loki.cs.brown.edu:8080/CollaborativeMocha/paper_html/index.html"
, update =	"98.07 tamassia"
, annote =	"M.Sc. thesis manuscript"
}

@article{lmr-smoop-92
, author =	"Moises Lejter and Scott Meyers and Steven P. Reiss"
, title =	"Support for maintaining object-oriented programs"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	18
, number =	12
, month =	dec
, year =	1992
, pages =	"1045--1052"
, update =	"97.03 tamassia"
}

@book{l-gn-69
, author =	"G. Lekkerkerker"
, title =	"Geometry of Numbers"
, publisher =	"Wolters-Noordhoff"
, address =	"Groningen, Netherlands"
, year =	1969
, precedes =	"gl-gn-87"
, update =	"93.09 rote"
}

@phdthesis{l-tdam-97
, author =	"C. Lemaire"
, title =	"Triangulation de {Delaunay} et arbres multidimensionnels"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"{\'E}cole des Mines de St-Etienne"
, address =	"France"
, year =	1997
, keywords =	"doctoral thesis"
, update =	"98.07 devillers"
}

@article{lm-prmdd-00
, author =	"C. Lemaire and J.-M. Moreau"
, title =	"A probabilistic result on multi-dimensional {Delaunay} triangulations, and its application to the {2D} case"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"69--96"
, update =	"01.04 smid"
}

@inproceedings{lm-ackdm-97
, author =	"Christophe Lemaire and Jean-Michel Moreau"
, title =	"Analysis of a Class of $k$--Dimensional Merge Procedures, with an Application to 2$D$ {Delaunay} Triangulation in Expected Linear Time After Two--Directional Sorting"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"129--134"
, update =	"98.07 devillers, 97.11 jones"
}

@unpublished{lw-ciaff-88
, author =	"P. Lemke and M. Werman"
, title =	"On the complexity of inverting the autocorrelation function of a finite integer sequence, and the problem of locating $n$ points on a line, given the unlabeled distances between them"
, year =	1988
, note =	"Manuscript"
, update =	"97.11 bibrelex"
}

@inproceedings{lec-aptg-67
, author =	"A. Lempel and S. Even and I. Cederbaum"
, title =	"An Algorithm for Planarity Testing of Graphs"
, booktitle =	"Theory of Graphs: Internat. Symposium (Rome 1966)"
, publisher =	"Gordon and Breach"
, address =	"New York"
, year =	1967
, pages =	"215--232"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{l-arpmb-93
, author =	"T. Lengauer"
, title =	"Algorithmic research problems in molecular bioinformatics"
, booktitle =	"Proc. 2nd IEEE Israeli Sympos. Theory of Comput. and Systems"
, year =	1993
, pages =	"177--192"
, update =	"98.03 agarwal"
}

@book{l-caicl-90
, author =	"T. Lengauer"
, title =	"Combinatorial Algorithms for Integrated Circuit Layout"
, publisher =	"B. G. Teubner"
, year =	1990
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{l-sisri-84
, author =	"T. Lengauer"
, title =	"On the solution of inequality systems relevant to {IC}-layout"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"408--421"
, update =	"98.03 bibrelex"
}

@inproceedings{ll-dfmwt-97
, author =	"William Lenhart and Giuseppe Liotta"
, title =	"Drawable and Forbidden Minimum Weight Triangulations"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"1--12"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{ll-domwt-96
, author =	"W. Lenhart and G. Liotta"
, title =	"Drawing Outerplanar Minimum Weight Triangulations"
, journal =	"Inform. Process. Lett."
, volume =	57
, number =	5
, year =	1996
, pages =	"253--260"
, url =	"http://www.cs.brown.edu/cgc/papers/ll-domwt-96.ps.gz"
, keywords =	"graph drawing, planar, minimum weight triangulation"
, update =	"98.11 tamassia, 97.03 tamassia, 96.01 liotta"
}

@inproceedings{ll-hdomw-96
, author =	"W. Lenhart and G. Liotta"
, title =	"How to Draw Outerplanar Minimum Weight Triangulations"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"373--384"
, url =	"http://www.cs.brown.edu/cgc/papers/ll-hdomw-96.ps.gz"
, keywords =	"graph drawing"
, update =	"97.03 tamassia, 96.09 tamassia"
}

@techreport{ll-pdog-96
, author =	"W. Lenhart and G. Liotta"
, title =	"Proximity Drawings of Outerplanar Graphs"
, type =	"Technical Report"
, number =	"CS-96-21"
, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-21.ps.Z"
, keywords =	"graph drawing, proximity, CGC, Brown"
, update =	"97.03 tamassia"
}

@inproceedings{ll-pdog-97
, author =	"W. Lenhart and G. Liotta"
, title =	"Proximity Drawings of Outerplanar Graphs"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"286--302"
, url =	"http://www.cs.brown.edu/cgc/papers/ll-pdog-97.ps.gz"
, keywords =	"graph drawing, proximity, CGC, Brown"
, update =	"98.07 tamassia, 97.03 tamassia"
}

@inproceedings{lpsssstwy-clcsp-87
, author =	"W. Lenhart and R. Pollack and J.-R. Sack and R. Seidel and Micha Sharir and Subhash Suri and G. T. Toussaint and S. Whitesides and C. K. Yap"
, title =	"Computing the link center of a simple polygon"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"1--10"
, keywords =	"polygons, simple, link distance, visibility, construction, diameter, covering"
, precedes =	"lpsssstwy-clcsp-88"
, cites =	"at-cgcsp-86, at-oadvp-81, c-tpca-82, cg-vippg-85, ea-lacvp-81, gjpt-tsp-78, g-agtpg-80, ghlst-ltavs-86t, lp-esppr-84, ps-cgcsp-86, s-pptld-86, s-cagfn-86, tv-otats-86, ZZZ"
, update =	"98.03 bibrelex+mitchell, 93.05 smid"
}

@article{lpsssstwy-clcsp-88
, author =	"W. Lenhart and R. Pollack and J.-R. Sack and R. Seidel and Micha Sharir and Subhash Suri and G. T. Toussaint and S. Whitesides and C. K. Yap"
, title =	"Computing the link center of a simple polygon"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"281--293"
, keywords =	"polygons, simple, link distance, visibility, construction, diameter, covering"
, succeeds =	"lpsssstwy-clcsp-87"
, update =	"98.03 mitchell"
}

@inproceedings{lw-rltm-92
, author =	"W. J. Lenhart and S. H. Whitesides"
, title =	"Reconfiguration with line tracking motions"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"198--203"
, cites =	"hjw-mra2d-85, k-mslra-92, kk-namra-86, lw-tpio-91, ss-pmp2g-83, w-aigpl-92, ZZZ"
, update =	"98.07 bibrelex"
}

@article{lw-rcpce-95
, author =	"W. J. Lenhart and S. H. Whitesides"
, title =	"Reconfiguring closed polygonal chains in {Euclidean} $d$-space"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"123--140"
, update =	"96.05 smid"
}

@techreport{lw-rsp-93
, author =	"William J. Lenhart and Sue H. Whitesides"
, title =	"Reconfiguring Simple Polygons"
, number =	"SOCS-93.3"
, institution =	"School of Computer Science, McGill University"
, month =	mar
, year =	1993
, update =	"02.03 orourke"
}

@inproceedings{lw-tpio-91
, author =	"W. J. Lenhart and S. H. Whitesides"
, title =	"Turning a polygon inside-out"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"66--69"
, cites =	"hjw-mra2d-85, kk-namra-86, k-mslra-92, ZZZ"
, update =	"98.07 bibrelex"
}

@phdthesis{l-dusda-93
, author =	"H. P. Lenhof"
, title =	"Distanz- und {Suchprobleme} in der algorithmischen {Geometrie} und {Anwendungen} in der {Bioinformatik}"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"94.05 smid"
}

@inproceedings{ls-afran-94
, author =	"H.-P. Lenhof and M. Smid"
, title =	"An animation of a fixed-radius all-nearest-neighbors algorithm"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	387
, keywords =	"video review"
, cites =	"hsb-tarms-90, ls-ekcpo-92i, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones"
}

@techreport{ls-ocmgc-91t
, author =	"H. P. Lenhof and M. Smid"
, title =	"An optimal construction method for generalized convex layers"
, type =	"Report"
, number =	"MPI-I-91-112"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1991
, precedes =	"ls-ocmgc-91i"
}

@inproceedings{ls-ocmgc-91i
, author =	"H. P. Lenhof and M. Smid"
, title =	"An optimal construction method for generalized convex layers"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"349--363"
, succeeds =	"ls-ocmgc-91t"
, precedes =	"ls-ocmgc-93"
, update =	"94.01 smid"
}

@article{ls-ocmgc-93
, author =	"H. P. Lenhof and M. Smid"
, title =	"An optimal construction method for generalized convex layers"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"245--267"
, succeeds =	"ls-ocmgc-91i"
, update =	"94.01 smid"
}

@techreport{ls-ekcpo-92t
, author =	"H. P. Lenhof and M. Smid"
, title =	"Enumerating the $k$ closest pairs optimally"
, type =	"Report"
, number =	"MPI-I-92-118"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
}

@inproceedings{ls-ekcpo-92i
, author =	"H.-P. Lenhof and M. Smid"
, title =	"Enumerating the $k$ closest pairs optimally"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"380--386"
}

@techreport{ls-mvmsw-92t
, author =	"H. P. Lenhof and M. Smid"
, title =	"Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
, type =	"Report"
, number =	"MPI-I-92-102"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
, precedes =	"ls-mvmsw-92i"
}

@inproceedings{ls-mvmsw-92i
, author =	"H.-P. Lenhof and M. Smid"
, title =	"Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"388--398"
, succeeds =	"ls-mvmsw-92t"
, precedes =	"ls-mvmsw-95"
, update =	"95.05 smid"
}

@article{ls-mvmsw-95
, author =	"H.-P. Lenhof and M. Smid"
, title =	"Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
, journal =	"Algorithmica"
, volume =	13
, year =	1995
, pages =	"301--312"
, succeeds =	"ls-mvmsw-92i"
, update =	"95.05 smid"
}

@techreport{ls-spakc-92
, author =	"H. P. Lenhof and M. Smid"
, title =	"Sequential and parallel algorithms for the $k$ closest pairs problem"
, type =	"Report"
, number =	"MPI-I-92-134"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
}

@article{ls-spakc-95
, author =	"H. P. Lenhof and M. Smid"
, title =	"Sequential and parallel algorithms for the $k$ closest pairs problem"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"273--288"
, update =	"95.09 smid"
}

@techreport{ls-updsa-90
, author =	"H. P. Lenhof and M. Smid"
, title =	"Using persistent data structures for adding range restrictions to searching problems"
, type =	"Report"
, number =	"A-22/90"
, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1990
, update =	"94.05 smid"
}

@article{ls-updsa-94
, author =	"H. P. Lenhof and M. Smid"
, title =	"Using persistent data structures for adding range restrictions to searching problems"
, journal =	"RAIRO Inform. Theor."
, volume =	28
, year =	1994
, pages =	"25--49"
, update =	"94.05 smid"
}

@article{l-tsfpp-11
, author =	"N. J. Lennes"
, title =	"Theorems on the simple finite polygon and polyhedron"
, journal =	"Amer. J. Math."
, volume =	33
, year =	1911
, pages =	"37--62"
, keywords =	"decomposition, polygon triangulation, elementary geometry"
, annote =	"Proves that convex decomposition, without introducing
		 new vertices, exists for any polygon but not
		 necessarily for any polyhedron."
}

@article{lll-fprc-82
, author =	"A. K. Lenstra and H. W. {Lenstra, Jr.} and L. Lovasz"
, title =	"Factoring polynomials with rational coefficients"
, journal =	"Math. Ann."
, volume =	261
, year =	1982
, pages =	"514--534"
, update =	"97.11 bibrelex"
}

@article{l-ipfnv-83
, author =	"H. W. Lenstra"
, title =	"Integer programming with a fixed number of variables"
, journal =	"Math. Oper. Res."
, volume =	8
, year =	1983
, pages =	"538--548"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{l-ptaor-80
, author =	"A. S. LePaugh"
, title =	"A polynomial time algorithm for optimal routing around a rectangle"
, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1980
, pages =	"292--293"
}

@article{l-slfde-45
, author =	"J. Leray"
, title =	"Sur la forme des espaces topologiques et sur les points fixes des repr{\`e}sentations"
, journal =	"J. Math. Pure Appl."
, volume =	24
, year =	1945
, pages =	"95--167"
, update =	"98.03 bibrelex"
}

@inproceedings{js-nchga-95
, author =	"John S. {Letcher, Jr.} and Michael Shook"
, title =	"NURBS Considered Harmful for Gridding (Alternative Offered)"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"253--264"
, update =	"96.01 samitchell"
}

@inproceedings{lle-ssea-97
, author =	"S. T. Leutenegger and M. A. Lopez and J. Edington"
, title =	"{STR}: {A} simple and efficient algorithm for {R}-tree packing"
, booktitle =	"Proc. 13th IEEE Internat. Conf. Data Eng."
, year =	1997
, pages =	"497--506"
, update =	"97.07 agarwal"
}

@article{l-olbng-87
, author =	"C. Levcopoulos"
, title =	"An {$\Omega(\sqrt{n})$} lower bound for the non-optimality of the greedy triangulation"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"247--251"
, update =	"98.07 bibrelex"
}

@inproceedings{l-fhmlr-86
, author =	"C. Levcopoulos"
, title =	"Fast heuristics for minimum length rectangular partitions of polygons"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"100--108"
, cites =	"cd-vdbcd-85, f-fapct-85, gz-bprp-85, ia-dsisa-84, ks-mdpo-85, k-ubsir-80, ll-blcpp-84, l-hmelr-83, lprs-melpr-82, l-tspp-77, ps-cgi-85, r-ppis-82, ZZZ"
, update =	"97.11 bibrelex"
}

@phdthesis{l-hmdp-87
, author =	"C. Levcopoulos"
, title =	"Heuristics for Minimum Decompositions of Polygons"
, school =	"Link{\"o}ping Studies in Science and Technology"
, address =	"Link{\"o}ping, Sweden"
, year =	1987
, note =	"No. 155"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@inproceedings{l-mltfr-85
, author =	"C. Levcopoulos"
, title =	"Minimum length and 'thickest-first' rectangular partitions of polygons"
, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
, year =	1985
, update =	"97.11 bibrelex"
}

@incollection{lg-lthmr-97
, author =	"C. Levcopoulos and J. Gudmundsson"
, title =	"A Linear Time Heuristic for Minimum Rectangle Coverings"
, booktitle =	"11th International Symposium on Fundamentals of Computation Theory"
, nickname =	"FCT '97"
, site =	"Krakow, Poland"
, series =	"Lecture Notes Comput. Sci."
, volume =	1279
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"305--316"
, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@incollection{lg-camrc-96
, author =	"C. Levcopoulos and J. Gudmundsson"
, title =	"Close approximations of minimum rectangular coverings"
, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1180
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"135--146"
, update =	"97.03 smid"
}

@inproceedings{lkl-oetpa-88
, author =	"C. Levcopoulos and J. Katajainen and A. Lingas"
, title =	"An optimal expected-time parallel algorithm for {Voronoi} diagrams"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"190--198"
}

@article{lk-ltasm-98
, author =	"C. Levcopoulos and D. Krznaric"
, title =	"A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons"
, journal =	"Algorithmica"
, volume =	21
, year =	1998
, pages =	"285--311"
, update =	"01.11 smid"
}

@inproceedings{lk-qgtam-96
, author =	"Christos Levcopoulos and Drago Krznaric"
, title =	"Quasi-greedy triangulations approximating the minimum weight triangulation"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"392--401"
, keywords =	"greedy triangulation, approximation of MWT"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@inproceedings{ll-blcpp-84
, author =	"C. Levcopoulos and A. Lingas"
, title =	"Bounds on the length of convex partitions of polygons"
, booktitle =	"Proc. 4th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	181
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"279--295"
, keywords =	"design of algorithms, VLSI design, partition, approximation, length, polygons, convex, rectangles"
}

@inproceedings{ll-cstam-92
, author =	"C. Levcopoulos and A. Lingas"
, title =	"C-Sensitive Triangulations Approximate the Minmax Length Triangulation"
, booktitle =	"Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"New Delhi, India"
, year =	1992
, update =	"93.09 milone+mitchell"
}

@inproceedings{ll-cpmnr-84
, author =	"C. Levcopoulos and A. Lingas"
, title =	"Covering polygons with minimum number of rectangles"
, booktitle =	"Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	166
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"63--72"
, keywords =	"design of algorithms, VLSI design, covering, approximation, polygons, rectangles"
}

@inproceedings{ll-fagt-90
, author =	"C. Levcopoulos and A. Lingas"
, title =	"Fast algorithms for greedy triangulation"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"238--250"
, precedes =	"ll-fagt-92"
}

@article{ll-fagt-92
, author =	"Christos Levcopoulos and Andrzej Lingas"
, title =	"Fast Algorithms for Greedy Triangulations"
, journal =	"BIT"
, volume =	32
, year =	1992
, pages =	"280--296"
, succeeds =	"ll-fagt-90"
, update =	"94.05 drysdale"
}

@inproceedings{ll-gtaoc-91
, author =	"C. Levcopoulos and A. Lingas"
, title =	"Greedy trianglation approximates the optimum and can be implemented in linear time in the average case"
, booktitle =	"Proc. 3rd Internat. Conf. on Information and Computing"
, series =	"Lecture Notes Comput. Sci."
, volume =	497
, year =	1991
, pages =	"139--148"
, succeeds =	"ll-gtaoc-90"
, update =	"98.11 bibrelex"
}

@techreport{ll-gtamw-92
, author =	"C. Levcopoulos and A. Lingas"
, title =	"Greedy Triangulation Approximates the Minimum Weight Triangulation and Can be Computed in Linear Time in the Average Case"
, type =	"Technical {Report}"
, number =	"LU-CS-TR:92-105"
, institution =	"Dept. Comput. Sci., Lund Univ."
, address =	"Lund, Sweden"
, year =	1992
, update =	"98.03 bibrelex"
}

@techreport{ll-gtaoc-90
, author =	"C. Levcopoulos and A. Lingas"
, title =	"Greedy triangulation approximates the optimum and can be implemented in linear time in the average case"
, number =	"90-72"
, institution =	"Dept. of Comp. Sci., Lund University"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{ll-abgtc-87
, author =	"C. Levcopoulos and A. Lingas"
, title =	"On approximation behavior of the greedy triangulation for convex polygons"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"175--193"
, keywords =	"implementing algorithms, approximation, length, triangulations, polygons, convex"
}

@techreport{ll-solbl-??
, author =	"C. Levcopoulos and A. Lingas"
, title =	"Supplement: {An} {$\Omega(p \log k)$} lower bound on the length of convex partitions of polygons"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@article{ll-tapga-92
, author =	"C. Levcopoulos and A. Lingas"
, title =	"There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"251--256"
, update =	"95.01 mitchell"
}

@inproceedings{ll-tapga-89
, author =	"C. Levcopoulos and A. Lingas"
, title =	"There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees"
, booktitle =	"Proc. International Symposium on Optimal Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	401
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"9--13"
, update =	"96.05 smid"
}

@techreport{lls-amlpp-87t
, author =	"C. Levcopoulos and A. Lingas and J.-R. Sack"
, title =	"Algorithms for minimum length partitions of polygons"
, type =	"Report"
, number =	"SCS-TR-119"
, institution =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1987
, keywords =	"design of algorithms, decomposition, triangulations, partition, dynamic programming, length, two-dimensional, convex, polygons"
, precedes =	"lls-amlpp-87a"
}

@article{lls-hobst-89
, author =	"Christos Levcopoulos and Andrzej Lingas and Jorg-R. Sack"
, title =	"Heuristics For Optimum Binary Search Trees And Minimum Weight Triangulation Problems"
, journal =	"Theoret. Comput. Sci."
, volume =	66
, number =	2
, month =	aug
, year =	1989
, pages =	"181--203"
, keywords =	"optimum binary search trees, minimum weight triangulation, amortization argument"
, annote =	"Amortized linear algorithm for GT of semi-circular
		 polygons."
, abstract =	"We establish new bounds on the problem of constructing
		 optimum binary search trees with zero-key access
		 probabilities (with applications e.g. to point location
		 problems). We present a linear-time heuristic for
		 constructing such trees so that their cost is within a
		 factor of 1 plus epsilon from the optimum cost, where
		 epsilon is an arbitrary positive constant. Furthermore,
		 by using an interesting amortization argument, we give
		 a simple and practical, linear-time implementation of a
		 known greedy heuristics for such trees. The above
		 results are obtained in a more general setting, namely,
		 in the context of minimum length triangulations of so-
		 called semi-circular polygons. They are carried over to
		 binary search trees by proving a duality between
		 optimum (m minus 1)-way search trees and minimum weight
		 partitions of infinitely-flat semi-circular polygons
		 into m- gons. With this duality we can also obtain
		 better heuristics for minimum length partitions of
		 polygons by using known algorithms for optimum search
		 trees. (Author abstract) 14 Refs."
}

@inproceedings{lls-nohbs-87
, author =	"C. Levcopoulos and A. Lingas and J.-R. Sack"
, title =	"Nearly optimal heuristics for binary search trees with geometric generalizations"
, booktitle =	"Proc. 14th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	267
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"376--385"
, keywords =	"decomposition, partition, polygons, two-dimensional"
}

@incollection{llw-pcpt-95
, author =	"C. Levcopoulos and A. Lingas and C. Wang"
, title =	"On parallel complexity of planar triangulations"
, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1026
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"413--427"
, update =	"96.01 smid"
}

@techreport{lns-eacft-97
, author =	"C. Levcopoulos and G. Narasimhan and M. Smid"
, title =	"Efficient algorithms for constructing fault-tolerant geometric spanners"
, type =	"Report"
, number =	16
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1997
, update =	"98.03 smid"
}

@inproceedings{lns-eacft-98
, author =	"C. Levcopoulos and G. Narasimhan and M. Smid"
, title =	"Efficient algorithms for constructing fault-tolerant geometric spanners"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC 98"
, year =	1998
, pages =	"186--195"
, update =	"98.07 smid, 98.03 mitchell"
}

@techreport{lns-iacft-99
, author =	"C. Levcopoulos and G. Narasimhan and M. Smid"
, title =	"Improved algorithms for constructing fault-tolerant geometric spanners"
, type =	"Report"
, number =	15
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1999
, update =	"99.07 smid"
}

@article{lns-iacft-02
, author =	"C. Levcopoulos and G. Narasimhan and M. Smid"
, title =	"Improved algorithms for constructing fault-tolerant spanners"
, journal =	"Algorithmica"
, volume =	32
, year =	2002
, pages =	"144--156"
, update =	"01.11 smid"
}

@phdthesis{l-eampr-86
, author =	"D. Leven"
, title =	"Efficient algorithms for motion planning of robot systems amidst obstacles"
, type =	"Ph.{D}. Thesis"
, school =	"Tel-Aviv Univ."
, address =	"Tel-Aviv, Israel"
, year =	1986
, keywords =	"doctoral thesis"
}

@techreport{l-mrsva-84
, author =	"D. Leven"
, title =	"Multidimensional reconstruction by set-valued approximations"
, type =	"Report"
, number =	"018-84"
, institution =	"Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
, address =	"Tel-Aviv, Israel"
, year =	1984
}

@techreport{ls-esmpa-84
, author =	"D. Leven and Micha Sharir"
, title =	"An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
, type =	"Technical {Report}"
, number =	"84-014"
, institution =	"Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
, address =	"Tel-Aviv, Israel"
, month =	nov
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{ls-esmpa-85
, author =	"D. Leven and Micha Sharir"
, title =	"An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"221--227"
, keywords =	"motion planning, two-dimensional"
, precedes =	"ls-esmpa-87"
, cites =	"ls-esmpa-84, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, osy-gvdl1-84, osy-gvdl2-84, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ls-esmpa-87
, author =	"D. Leven and Micha Sharir"
, title =	"An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"192--215"
, keywords =	"motion planning, two-dimensional"
, succeeds =	"ls-esmpa-85"
, update =	"98.03 mitchell"
}

@incollection{ls-ippvd-87
, author =	"D. Leven and Micha Sharir"
, title =	"Intersection and proximity problems and {Voronoi} diagrams"
, editor =	"J. T. Schwartz and C.-K. Yap"
, booktitle =	"Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
, publisher =	"Lawrence Erlbaum Associates"
, address =	"Hillsdale, NJ"
, year =	1987
, pages =	"187--228"
, keywords =	"survey paper, Voronoi diagrams"
, update =	"98.03 mitchell"
}

@article{ls-ncfcc-87
, author =	"D. Leven and Micha Sharir"
, title =	"On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"255--270"
, update =	"98.03 mitchell"
}

@techreport{ls-pptmc-85
, author =	"D. Leven and M. Sharir"
, title =	"Planning a purely translational motion for a convex object in two-dimensional space using generalized {Voronoi} diagrams"
, number =	"34/85"
, institution =	"Tel Aviv University"
, month =	jun
, year =	1985
, update =	"98.03 bibrelex"
}

@article{ls-pptmc-87
, author =	"D. Leven and Micha Sharir"
, title =	"Planning a purely translational motion for a convex object in two-dimensional space using generalized {Voronoi} diagrams"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"9--31"
, keywords =	"motion planning, convex objects, Voronoi diagrams, convex distance functions"
, update =	"98.03 mitchell"
}

@article{kl-bpss-78
, author =	"G. A. Kabatjansky ans V. Leven{\v s}te{\v i}n"
, title =	"Bounds for packings of the sphere and in space"
, journal =	"Prob. Information Trans."
, volume =	14
, year =	1978
, pages =	"1--17"
, update =	"98.03 bibrelex"
}

@article{l-dtdpe-26
, author =	"F. Levi"
, title =	"Die {Teilung} der projektiven {Ebene} durch {Gerade} oder {Pseudogerade}"
, journal =	"Ber. Math.-Phys. Kl. s{\"a}chs. Akad. Wiss. Leipzig"
, volume =	78
, year =	1926
, pages =	"256--267"
, update =	"97.11 bibrelex"
}

@article{l-htac-51
, author =	"F. W. Levi"
, title =	"On {Helly}'s theorem and the axioms of convexity"
, journal =	"J. Indian Math. Soc."
, volume =	15
, year =	1951
, pages =	"65--76"
, update =	"98.07 bibrelex"
}

@inproceedings{l-misi-99
, author =	"David Levin"
, title =	"Mesh-Independent Surface Interpolation"
, booktitle =	"4th International Conference on Curves and Surfaces"
, year =	1999
, pages =	46
, note =	"Saint-Malo, France"
, update =	"00.03 devillers"
}

@article{l-padps-76
, author =	"J. Levin"
, title =	"Algorithm for Drawing Pictures of Solid Objects Composed of Quadratic Surfaces"
, journal =	"Commun. ACM"
, volume =	19
, number =	10
, month =	oct
, year =	1976
, pages =	"555--563"
, update =	"97.11 bibrelex"
}

@article{l-mmdiq-79
, author =	"J. Levin"
, title =	"Mathematical Models for Determining the Intersections of Quadric Surfaces"
, journal =	"Comput. Graph. Image Process."
, volume =	11
, year =	1979
, pages =	"73--87"
, update =	"97.11 bibrelex"
}

@article{l-mmbc-66
, author =	"C. Levinthal"
, title =	"Molecular model-building by computer"
, journal =	"Scientific Amer."
, volume =	213
, number =	6
, month =	jun
, year =	1966
, pages =	"42--52"
, update =	"99.07 orourke, 98.07 bibrelex"
}

@article{l-eciul-92
, author =	"N. Levitt"
, title =	"The {Euler} characteristic is the unique locally determined numerical homotopy invariant of finite completeness"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"59--67"
}

@article{l-emnmo-90
, author =	"A. Levy"
, title =	"Energy-minimizing networks meet only in threes"
, journal =	"J. Und. Math."
, volume =	22
, year =	1990
, pages =	"53--59"
, update =	"97.11 bibrelex"
}

@article{lr-tpra-78
, author =	"B. A. Lewis and J. S. Robinson"
, title =	"Triangulation of planar regions with applications"
, journal =	"Comput. J."
, volume =	21
, year =	1978
, pages =	"324--332"
, keywords =	"point-set triangulation, implementing algorithms"
}

@book{ld-dsta-91
, author =	"H. R. Lewis and L. Denenberg"
, title =	"Data Structures and Their Algorithms"
, publisher =	"Harper Collins"
, year =	1991
, update =	"97.03 tamassia"
}

@inproceedings{l-vvhc-95
, author =	"Robert R. Lewis"
, title =	"{VideHoc}: {A} Visualizer for Homogeneous Coordinates"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C14--C15"
, keywords =	""
, cites =	"h-hgc-84, nslab-xpegc-91, s-edpti-88, s-opgfg-91, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{l-tcctc-80
, author =	"T. Lewis"
, title =	"Two counterexamples concerning transversals for convex subsets of the plane"
, journal =	"Geometriae Didacta"
, volume =	9
, year =	1980
, pages =	"461--465"
, update =	"98.03 bibrelex"
}

@book{l-rmctf-82
, author =	"S. Lhuilier"
, title =	"De relatione mutua capacitatis et terminorum figurarum etc."
, publisher =	"Versaviae"
, year =	1782
, update =	"97.11 bibrelex"
}

@article{lll-fhtha-85
, author =	"H. Li and M. A. Lavin and R. J. LeMaster"
, title =	"Fast {Hough} transform: a hierarchical approach"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	36
, year =	1985
, pages =	"139--161"
}

@inproceedings{ls-pso-94
, author =	"H. Li and K. C. Sevcik"
, title =	"Parallel sorting by overpartitioning"
, booktitle =	"Proc. 6th ACM Sympos. Parallel Algorithms Architect."
, year =	1994
, pages =	"46--56"
, update =	"96.09 orourke"
}

@article{lc-tdp-90
, author =	"K. Li and K.-H. Cheng"
, title =	"On three-dimensional packing"
, journal =	"SIAM J. Comput."
, volume =	19
, year =	1990
, pages =	"847--867"
}

@article{l-rpp-88
, author =	"Shuo-Yen Robert Li"
, title =	"Reconstruction of Polygons From Projections"
, journal =	"Inform. Process. Lett."
, volume =	28
, number =	5
, month =	aug
, year =	1988
, pages =	"235--240"
, keywords =	"probing, x-ray probes"
, update =	"96.09 romanik"
}

@article{ly-ptic-75
, author =	"T.-Y. Li and J. A. Yorke"
, title =	"Period three implies chaos"
, journal =	"Amer. Math. Monthly"
, volume =	82
, year =	1975
, pages =	"985--992"
, update =	"01.07 devillers, 98.11 bibrelex"
}

@phdthesis{l-canpt-94
, author =	"Z. Li"
, title =	"Compaction algorithms for nonconvex polygons and their applications"
, type =	"Ph.{D}. Thesis"
, school =	"Harvard University"
, address =	"Cambridge, MA"
, year =	1994
, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1994.html"
, keywords =	"doctoral thesis, concave, polygons, layout, packing, optimization, linear programming, physically-based modeling, separation, motion planning, rotation, Minkowski sum, configuration space"
, comments =	"is also Harvard DAS TechReport number: 15-94"
, update =	"97.03 daniels"
}

@book{lc-nmp-92
, title =	"Nonholonomic Motion Planning"
, editor =	"Z. Li and J. F. Canny"
, publisher =	"Kluwer Academic Pubishers"
, address =	"Norwell, MA"
, year =	1992
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{lm-cancp-93
, author =	"Z. Li and V. Milenkovic"
, title =	"A compaction algorithm for non-convex polygons and its application"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"153--162"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"optimization, CAD, CAM, packing, layout, linear programming, motion planning, separation, configuration space, Minkowski sum"
, cites =	"aks-oa1dt-90, b-amdsn-89, bb-msbdc-88, c-crmp-87, dhks-isccd-90, grs-kfcg-83, hss-cmpmi-84, kos-cmsrp-91i, l-sisri-84, m-hphc-90, mdl-amm-91, mdl-pcnpc-92, mw-cdrca-88, mfs-2dcmc-87, p-ccmsp-87, pb-cmfm-88, sss-tdczr-86, sp-cppca-92, w-otdcs-85, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex, 97.03 daniels, 93.09 rote"
}

@article{lm-csanp-95
, author =	"Z. Li and V. Milenkovic"
, title =	"Compaction and separation algorithms for nonconvex polygons and their applications"
, journal =	"European J. Oper. Res."
, volume =	84
, year =	1995
, pages =	"539--561"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"layout, packing, placement, linear programming, motion planning, Minkowski sum, configuration space"
, update =	"97.03 daniels"
}

@inproceedings{lm-cschu-90
, author =	"Z. Li and V. Milenkovic"
, title =	"Constructing strongly convex hulls using exact or rounded arithmetic"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"235--243"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, precedes =	"lm-cschu-92"
, cites =	"f-smpst-89, g-eadch-72, gss-egbra-89, m-cacau-89, m-dpggt-89, m-vigau-88p, si-cvd10-89, ZZZ"
, update =	"97.11 bibrelex, 97.03 daniels"
}

@article{lm-cschu-92
, author =	"Z. Li and V. Milenkovic"
, title =	"Constructing strongly convex hulls using exact or rounded arithmetic"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"345--364"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, succeeds =	"lm-cschu-90"
, update =	"97.03 daniels"
}

@inproceedings{lm-ccp-93
, author =	"Z. Li and V. Milenkovic"
, title =	"The complexity of the compaction problem"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"7--11"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"packing, layout, motion planning, PSPACE"
, cites =	"cosw-cds-84, hss-cmpmi-84, lm-cancp-93, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 daniels, 93.09 milone+mitchell"
}

@article{lo-aalgb-92
, author =	"Z. Li and S. Openshaw"
, title =	"Algorithms for automated line generalization based on a natural principle of objective generalization"
, journal =	"Internat. J. Geogr. Inform. Syst."
, volume =	6
, year =	1992
, pages =	"373--389"
, update =	"96.09 kreveld"
}

@inproceedings{l-c2dcm-91
, author =	"J. Liang"
, title =	"On a class of $2$-d compliant motion planning problems"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"70--73"
, cites =	"c-cfmp-89, lmt-asfms-84, ZZZ"
, update =	"98.07 bibrelex"
}

@article{lb-aapc-83
, author =	"Y.-D. Liang and B. A. Barsky"
, title =	"An analysis and algorithm for polygon clipping"
, journal =	"Commun. ACM"
, volume =	26
, year =	1983
, pages =	"868--877"
}

@techreport{lhl-mcgpk-93t
, author =	"B.-C. Liaw and N. Huang and R. Lee"
, title =	"The minimum cooperative guards problem on $k$-spiral polygons"
, type =	"Technical Report"
, institution =	"Department of Computer Science, National Tsing Hua University"
, year =	1993
, precedes =	"lhl-mcgpk-93, lhl-mcgpk-93"
, update =	"98.11 bibrelex"
}

@inproceedings{lhl-mcgpk-93
, author =	"B.-C. Liaw and N. Huang and R. Lee"
, title =	"The minimum cooperative guards problem on $k$-spiral polygons"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"97--102"
, succeeds =	"lhl-mcgpk-93t"
, cites =	"cn-owr-88, cn-wrsp-91, ghs-citds-91, ik-tgp-91, lhl-mcgpk-93t, ll-ccagp-86, mw-wrmg-91, o-agta-87, s-rrag-92, cnn-ogcmw-91, nw-owrsp-90i, t-pvldp-93, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{l-pftu-82
, author =	"D. Lichtenstein"
, title =	"Planar formulae and their uses"
, journal =	"SIAM J. Comput."
, volume =	11
, number =	2
, year =	1982
, pages =	"329--343"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{lw-aapsc-77
, author =	"L. I. Lieberman and M. A. Wesley"
, title =	"Autopass: an automatic programming system for computer controlled mechanical assembly"
, journal =	"IBM J. Res. Develop."
, volume =	21
, number =	4
, year =	1977
, pages =	"321--333"
}

@techreport{lmmps-dpp-93
, author =	"Th. M. Liebling and F. Margot and D. Muller and A. Prodon and L. Stauffer"
, title =	"Disjoint paths in the plane"
, number =	"RO 930628"
, institution =	"Ecole Polytechnique Federale de Lausanne"
, address =	"Lausanne, Suisse"
, month =	jun
, year =	1993
, keywords =	"Disjoint paths, computational geometry, routing, heuristics"
, update =	"93.09 milone+mitchell"
}

@inproceedings{l-btgm-90
, author =	"P. Lienhardt"
, title =	"Barycentric triangulation of generalized maps"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"129--133"
, cites =	"l-sndsn-89, l-ndgtm-89, b-rgsdd-89, e-crps-60, j-cegt-70, c-ucplg-75, bs-ftmsb-85, t-gt-84, gs-pmgsc-85, a-atfc-76, m-eat-84, l-ngcse-90, ZZZ"
, update =	"98.07 bibrelex"
}

@article{l-ndgcm-94
, author =	"P. Lienhardt"
, title =	"N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, number =	3
, year =	1994
, pages =	"275--324"
, update =	"96.05 pascucci"
}

@techreport{l-ndgtm-89
, author =	"P. Lienhardt"
, title =	"$N$-dimensional generalized topological maps"
, type =	"Research {Report}"
, number =	"R89-10"
, institution =	"D{\'e}partement d'Informatique, Universit{\'e} Louis Pasteur"
, address =	"Strasbourg, France"
, month =	dec
, year =	1989
, update =	"98.07 bibrelex"
}

@techreport{l-ngcse-90
, author =	"P. Lienhardt"
, title =	"N-{G}-cartes simplexes et triangulation barycentrique"
, type =	"Research {Report}"
, number =	"R90-08"
, institution =	"D{\'e}partement d'Informatique, Universit{\'e} Louis Pasteur"
, address =	"Strasbourg, France"
, year =	1990
, update =	"98.07 bibrelex"
}

@article{l-tmbrc-91
, author =	"P. Lienhardt"
, title =	"Topological models for boundary representation: {A} comparison with $n$-dimensional generalized maps"
, journal =	"Comput. Aided Design"
, volume =	23
, number =	1
, year =	1991
, pages =	"59--82"
, update =	"98.03 agarwal"
}

@techreport{ls-ghs-91
, author =	"A. L. Liestman and T. C. Shermer"
, title =	"Grid and Hypercube Spanners"
, type =	"Technical Report"
, number =	"TR 91-1"
, institution =	"Simon Fraser University"
, year =	1991
, update =	"98.07 bibrelex"
}

@techreport{liz-haspp-93
, author =	"J. Lim and S. Iyengar and S.-Q. Zheng"
, title =	"A heuristic approach for shortest path problem with rectilinear obstacles"
, type =	"Technical {Report}"
, institution =	"Dept. of Computer Science, Louisiana University"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@book{l-pagaa-44
, author =	"R. A. Liming"
, title =	"Practical analytical geometry with applications to aircraft"
, publisher =	"Macmillan"
, address =	"New York"
, year =	1944
, update =	"98.03 bibrelex"
}

@misc{l-artcn-94
, author =	"C. Lin"
, title =	"An application of {Ramsey} theory to the crossing number of posets"
, year =	1994
, note =	"Preprint"
, update =	"98.03 bibrelex"
}

@article{l-cnp-94
, author =	"C. Lin"
, title =	"The crossing number of posets"
, journal =	"Order"
, volume =	11
, year =	1994
, pages =	"1--25"
, update =	"98.03 bibrelex"
}

@article{ls-gcmme-97
, author =	"J. Lin and J. A. Storer"
, title =	"Geometric Clustering to Minimize the Mean-Square Error"
, journal =	"Unpublished Manuscript"
, volume =	"??"
, year =	1997
, update =	"98.07 agarwal"
}

@article{lv-aagmp-92
, author =	"J.-H. Lin and J. S. Vitter"
, title =	"Approximation Algorithms for Geometric Median Problems"
, journal =	"Inform. Process. Lett."
, volume =	44
, year =	1992
, pages =	"245--249"
, update =	"93.09 vengroff"
}

@inproceedings{lv-eampc-92
, author =	"J.-H. Lin and J. S. Vitter"
, title =	"$\epsilon$-Approximations with Minimum Packing Constraint Violation"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"771--782"
, update =	"93.09 vengroff"
}

@article{ljf-ttish-94
, author =	"K. I. Lin and H. V. Jagdish and C. Faloutsos"
, title =	"The {TV}-tree: {A}n index structure for higher dimensional data"
, journal =	"VLDB Journal"
, volume =	4
, year =	1994
, pages =	"517--542"
, update =	"97.07 agarwal"
}

@inproceedings{lp-pcilp-92
, author =	"Y. Lin-Kriz and V. Pan"
, title =	"On parallel complexity of integer linear programming, {GCD} and the iterated mod function"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"124--137"
}

@article{lm-ecdde-97
, author =	"M. Lin and D. Manocha"
, title =	"Efficient Contact Determination in Dynamic Environments"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"123--151"
, update =	"98.07 bibrelex, 97.07 devillers"
}

@phdthesis{l-ecdar-93
, author =	"M. C. Lin"
, title =	"Efficient Collision Detection for Animation and Robotics"
, school =	"University of California"
, address =	"Berkeley, CA"
, month =	dec
, year =	1993
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@phdthesis{l-efdar-93
, author =	"M. C. Lin"
, title =	"Efficient Collision Detection for Animation and Robotics"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Elec. Engin. Comput. Sci., Univ. California"
, address =	"Berkeley, CA"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"96.05 klosowski"
}

@inproceedings{lc-eaidc-91
, author =	"M. C. Lin and J. F. Canny"
, title =	"Efficient Algorithms for Incremental Distance Computation"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, volume =	2
, year =	1991
, pages =	"1008--1014"
, update =	"96.05 klosowski"
}

@article{lm-fidgm-95
, author =	"M. C. Lin and D. Manocha"
, title =	"Fast Interference Detection Between Geometric Models"
, journal =	"Visual Comput."
, volume =	11
, number =	10
, year =	1995
, pages =	"542--561"
, update =	"96.05 held+klosowski"
}

@incollection{lm-idbco-93
, author =	"M. C. Lin and D. Manocha"
, title =	"Interference Detection Between Curved Objects for Computer Animation"
, booktitle =	"Models and Techniques in Computer Animation"
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"43--57"
, update =	"96.05 klosowski"
}

@inproceedings{lmc-ecdde-94
, author =	"M. C. Lin and D. Manocha and J. Canny"
, title =	"Efficient contact determination for dynamic environments"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1994
, pages =	"602--608"
, update =	"98.07 bibrelex"
}

@techreport{losz-sema-
, author =	"R. Lin and S. Olariu and J. L. Schwing and J. Zhang"
, title =	"Simulating Enhanced Meshes, with Applications"
, type =	"Technical Report"
, number =	"TR-91-041"
, institution =	"Department of Computer Science, Old Dominion University"
, address =	"Norfolk, Virginia"
, year =	"??"
, update =	"98.07 bibrelex"
}

@inproceedings{lc-pvg-94
, author =	"S.-Y. Lin and C. Chen"
, title =	"Planar Visibility Graphs"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"30--35"
, keywords =	"Computational geometry, visibility graphs, planar graphs, visibility problems"
, cites =	"alp-vgsp-92, o-agta-87, t-tpg-56, o-cgc18-93a, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{le-idaal-95
, author =	"T. Lin and P. Eades"
, title =	"Integration of Declarative and Algorithmic Approaches for Layout Creation"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"376--387"
, keywords =	"graph drawing, declarative, system, trees"
, update =	"95.01 tamassia"
}

@phdthesis{l-aadg-92
, author =	"X. Lin"
, title =	"Analysis of Algorithms for Drawing Graphs"
, school =	"Department of Computer Science, University of Queensland"
, year =	1992
, keywords =	"doctoral thesis, graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{le-ardhp-97
, author =	"Xuemin Lin and Peter Eades"
, title =	"Area Requirements for Drawing Hierarchically Planar Graphs"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"219--229"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@techreport{ls-cavg-92
, author =	"Y. Lin and Steven S. Skiena"
, title =	"Complexity aspects of visibility graphs"
, type =	"Technical {Report}"
, number =	"92/08"
, institution =	"SUNY Stony Brook"
, year =	1992
, keywords =	"visibility graphs, polygons, area requirements, outerplanar graphs, isomorphism, independent sets"
, precedes =	"ls-cavg-95"
, update =	"98.03 mitchell, 96.09 devillers, 93.09 milone+mitchell"
}

@article{ls-cavg-95
, author =	"Y. Lin and Steven S. Skiena"
, title =	"Complexity aspects of visibility graphs"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"289--312"
, keywords =	"graph drawing, visibility graphs, polygons, area requirements, outerplanar graphs, isomorphism, independent sets"
, succeeds =	"ls-cavg-92"
, update =	"98.03 mitchell, 96.09 devillers"
}

@article{lbg-avqd-80
, author =	"Y. Linde and A. Buzo and R. M. Gray"
, title =	"An algorithm for vector quantiser design"
, journal =	"IEEE Transactions on Communications"
, volume =	"COM-28"
, year =	1980
, pages =	"84--95"
, update =	"98.07 agarwal"
}

@unpublished{lb-rpdcd-
, author =	"M. Lindenbaum and A. Bruckstein"
, title =	"On recursive {$o(n)$} partition of a digital curve into digital straight segments"
, note =	"to appear in IEEE Trans. on Pattern Analysis and Machine Intelligence(PAMI)"
, update =	"98.11 bibrelex"
}

@article{lb-bapcs-94
, author =	"M. Lindenbaum and A. M. Bruckstein"
, title =	"Blind Approximation of Planar Convex Sets"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	10
, number =	4
, month =	aug
, year =	1994
, pages =	"517--529"
, keywords =	"probing, line probes, approximation"
, update =	"96.09 romanik"
}

@article{lb-doslv-88
, author =	"M. Lindenbaum and A. M. Bruckstein"
, title =	"Determining object shape from local velocity measurements"
, journal =	"Pattern Recogn."
, volume =	21
, number =	6
, year =	1988
, pages =	"591--606"
, update =	"93.09 milone+mitchell"
}

@article{lb-psgp-92
, author =	"M. Lindenbaum and A. M. Bruckstein"
, title =	"Parallel Strategies for Geometric Probing"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"320--349"
, keywords =	"probing, composite probes, parallel"
, update =	"96.09 romanik"
}

@article{lb-rpscu-91
, author =	"M. Lindenbaum and A. M. Bruckstein"
, title =	"Reconstruction of Polygonal Sets by Constrained and Unconstrained Double Probing"
, journal =	"Ann. Math. Artif. Intell."
, volume =	4
, year =	1991
, pages =	"345--362"
, keywords =	"probing, line probes"
, update =	"96.09 romanik"
}

@inproceedings{ls-pahgd-90
, author =	"M. Lindenbaum and H. Samet"
, title =	"A probabilistic analysis of hierarchical geometric data structures"
, booktitle =	"Proceedings of the Tenth International Conference on Pattern Recognition"
, site =	"Atlantic City, NJ"
, volume =	"II"
, month =	jun
, year =	1990
, pages =	"91--96"
, update =	"96.05 efrat"
}

@techreport{ls-patbs-95
, author =	"M. Lindenbaum and H. Samet"
, title =	"A probabilistic analysis of trie-based sorting of large collections of line segments"
, type =	"Center for Automation Research"
, number =	"CAR-TR-766"
, institution =	"University of Maryland"
, month =	apr
, year =	1995
, update =	"01.07 devillers, 96.05 efrat"
}

@article{l-atmgs-83
, author =	"P. A. Lindholm"
, title =	"Automatic Triangle Mesh Generation on Surfaces of Polyhedra"
, journal =	"IEEE Trans. Magn."
, volume =	"MAG19"
, number =	6
, year =	1983
, pages =	"2539--2542"
, update =	"94.09 lambert"
, annote =	"Defines ``quality'' of two triangles as $(r/R)_{-1}$.
		 Used to triangulate strip along boundary. For interior
		 $(r/R)_\infty$ is used (sort of)."
}

@book{ly-jvms-97
, author =	"T. Lindholm and F. Yellin"
, title =	"The {J}ava Virtual Machine Specification"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1997
, update =	"98.07 tamassia"
}

@article{l-ltcrn-94
, author =	"A. Lingas"
, title =	"A Linear-Time Construction of the Relative Neighborhood Graph from the {Delaunay} triangulation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"199--208"
, update =	"98.07 mitchell, 96.09 devillers"
}

@inproceedings{l-lthmw-85
, author =	"A. Lingas"
, title =	"A linear-time heuristic for minimum weight triangulation of convex polygons"
, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
, year =	1985
, keywords =	"design of algorithms, approximation, length, triangulations, polygons, convex"
}

@article{l-nhmwt-87
, author =	"A. Lingas"
, title =	"A new heuristic for minimum weight triangulation"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	8
, number =	4
, year =	1987
, pages =	"646--658"
, keywords =	"design of algorithms, approximation, length, triangulations, minimum spanning trees, points, geometric graphs"
}

@inproceedings{l-seagt-87
, author =	"A. Lingas"
, title =	"A space efficient algorithm for the greedy triangulation"
, booktitle =	"Proc. 13th IFIP Conf. System Modelling and Optimization"
, site =	"Tokyo, Japan"
, year =	1987
, pages =	"??"
, keywords =	"implementing algorithms, approximation, length, triangulations, Delaunay triangulations, Voronoi diagrams, points, geometric graphs"
, precedes =	"l-seagt-87a"
, update =	"98.11 bibrelex"
}

@article{l-seagt-87a
, author =	"A. Lingas"
, title =	"A space efficient algorithm for the greedy triangulation"
, journal =	"Lecture Notes in Control and Information  Sci."
, volume =	113
, year =	1987
, pages =	"359--364"
, succeeds =	"l-seagt-87"
, update =	"98.11 bibrelex"
}

@techreport{l-amwt-83
, author =	"A. Lingas"
, title =	"Advances in minimum-weight triangulation"
, type =	"Link{\"o}ping {Studies} in {Sci}. {Technical} {Dissertations}"
, number =	97
, institution =	"Link{\"o}ping Univ."
, address =	"Link{\"o}ping, Sweden"
, year =	1983
, keywords =	"design of algorithms, approximation, NP-completeness, length, triangulations, minimum spanning trees, points, polygons"
}

@techreport{l-avdbe-85
, author =	"A. Lingas"
, title =	"Applications of {Voronoi} diagrams with barriers to efficient implementations of greedy triangulations"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Inform. Sci., Link{\"o}ping Univ."
, address =	"Link{\"o}ping, Sweden"
, year =	1985
}

@inproceedings{l-fabvd-90
, author =	"A. Lingas"
, title =	"Fast algorithms for bounded {Voronoi} diagrams of restricted polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"204--208"
, cites =	"a-rtcg-89, agss-ltacv-87, c-tpca-82, e-acg-87, ll-gdtpg-86, ll-fagt-90, l-pp-85, l-vdbsd-89, ps-cgi-85, tv-otats-88, ws-oacdt-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{l-gtcbe-89
, author =	"Andrzej Lingas"
, title =	"Greedy triangulation can be efficiently implemented in the average case"
, booktitle =	"Graph-Theoretic Concepts in Computer Science. Proceedings."
, year =	1989
, update =	"97.03 rote"
, abstract =	"Let $S$ be a set of $n$ points uniformly distributed
		 in a unit square. We show that the greedy triangulation
		 of $S$ can be computed in $O(n \log^{1.5} n)$ expected
		 time (without bucketing). The best previously known
		 upper-bound on the expected-time performance of an
		 algorithm for the greedy triangulation was $O(n^2)$."
}

@inproceedings{l-hmelr-83
, author =	"A. Lingas"
, title =	"Heuristics for minimum edge length rectangular partitions of rectilinear figures"
, booktitle =	"Proc. 6th GI Conf. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	145
, publisher =	"Springer-Verlag"
, year =	1983
, pages =	"199--210"
, keywords =	"design of algorithms, VLSI design, length, partition, approximation, polygons, geometric graphs, rectangles"
}

@inproceedings{l-abigt-86
, author =	"A. Lingas"
, title =	"On approximation behavior and implementation of the greedy triangulation for convex planar point sets"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"72--79"
, keywords =	"implementing algorithms, approximation, length, triangulations, points, polygons, convex"
, cites =	"g-nrpt-79, k-ndot-80, k-mtpd-80, lp-annpc-78, l-lthmw-85, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, ps-cgi-85, yl-nannp-79, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{l-pp-85
, author =	"A. Lingas"
, title =	"On partitioning polygons"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"288--295"
, keywords =	"design of algorithms, partition, divide-and-conquer, triangulations, polygons"
, cites =	"c-tpca-82, d-pppg-82, h-gt-72, hm-ftsp-83, lt-stpg-77, lt-apst-77, m-spgus-84, u-cav-84, ZZZ"
, update =	"97.11 bibrelex"
}

@article{l-gdtan-86
, author =	"A. Lingas"
, title =	"The greedy and {Delaunay} triangulations are not bad in the average case"
, journal =	"Inform. Process. Lett."
, volume =	22
, year =	1986
, pages =	"25--31"
, keywords =	"approximation, Delaunay triangulations, triangulations, average-case analysis, points"
, succeeds =	"l-gdtan-83"
}

@inproceedings{l-gdtan-83
, author =	"A. Lingas"
, title =	"The Greedy and {Delaunay} Triangulations are Not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-connected Polygons is {NP}-Complete"
, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1983
, pages =	"270--284"
, precedes =	"l-gdtan-86"
, annote =	"Geometric Triangulation just has to cover all points
		 with edges."
}

@inproceedings{l-pnrh-82
, author =	"A. Lingas"
, title =	"The power of non-rectilinear holes"
, booktitle =	"Proc. 9th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	140
, publisher =	"Springer-Verlag"
, year =	1982
, pages =	"369--383"
, keywords =	"complexity theory, partition, NP-completeness, polygons, geometric graphs, rectangles"
, update =	"93.09 rote"
, annote =	"One of the six NP-hardness results is incorrect,
		 see sg-mdrpa-92, sg-mdrra-?? for a polynomial solution.
		 The error is in cases G and H on p. 374, where the
		 claimed partition is not optimal."
}

@article{l-vdbsd-89
, author =	"A. Lingas"
, title =	"Voronoi diagrams with barriers and the shortest diagonal problem"
, journal =	"Inform. Process. Lett."
, volume =	32
, year =	1989
, pages =	"191--198"
, keywords =	"design of algorithms, Delaunay triangulations, Voronoi diagrams, geometric graphs"
}

@techreport{lk-ltrab-91
, author =	"Andrzej Lingas and Rolf Klein"
, title =	"A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
, type =	"Manuscript"
, institution =	"Lund Univ."
, address =	"Lund, Sweden"
, year =	1991
, precedes =	"kl-ltrab-93t"
, update =	"99.07 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
}

@article{lls-amlpp-87a
, author =	"A. Lingas and C. Levcopoulos and J.-R. Sack"
, title =	"Algorithms for minimum length partitions of polygons"
, journal =	"BIT"
, volume =	27
, year =	1987
, pages =	"474--479"
, keywords =	"design of algorithms, decomposition, triangulations, partition, dynamic programming, length, two-dimensional, convex, polygons"
, succeeds =	"lls-amlpp-87t"
}

@techreport{lms-parld-92
, author =	"A. Lingas and A. Maheshwari and J.-R. Sack"
, title =	"Parallel Algorithms for Rectilinear Link Distance Problems"
, type =	"Technical Report"
, number =	"SCS-TR-213"
, institution =	"Carleton University,  School of Computer Science"
, year =	1992
, update =	"97.11 sack"
}

@inproceedings{lms-parld-93
, author =	"Andrzej Lingas and Anil Maheshwari and Jorg-Rudiger Sack"
, title =	"Parallel Algorithms for Rectilinear Link Distance Problems"
, booktitle =	"Proc. 7th IEEE Internat. Parallel Process. Sympos."
, site =	"Newport Beach"
, publisher =	"IEEE Computer Society"
, year =	1993
, pages =	"65--72"
, precedes =	"lms-parld-95"
, update =	"98.03 mitchell, 97.11 sack"
}

@article{lms-parld-95
, author =	"Andrzej Lingas and Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack"
, title =	"Parallel Algorithms for Rectilinear Link Distance Problems"
, journal =	"Algorithmica"
, volume =	14
, year =	1995
, pages =	"261--289"
, keywords =	"link distance, parallel algorithms, rectilinear paths"
, succeeds =	"lms-parld-93"
, update =	"98.07 bibrelex+devillers, 98.03 mitchell, 97.11 sack"
, abstract =	"
We provide optimal parallel solutions to several link distance
problems set in trapezoided rectilinear polygons. All our main
parallel algorithms are deterministic and designed to run on the
exclusive read exclusive write parallel random-access machine (EREW
PRAM). Let $P$ be a trapezoided rectilinear simple polygon with $n$
vertices. In $O(\log n)$ time using $O(n/{\log n})$ processors we can
optimally compute
\begin{enumerate}
\item minimum rectilinear link paths, or shortest paths in the $L_1$
metric from any point in $P$ to all vertices of $P$,
\item minimum rectilinear link paths from any segment inside $P$ to
all vertices of $P$,
\item the rectilinear window (histogram) partition of $P$,
\item both covering radii and vertex intervals for any diagonal of $P$,
\item a data structure to support rectilinear link distance queries
between any two points in $P$ (queries can be answered optimally in
$O(\log n)$ time by a uniprocessor).
\end{enumerate}
Our solution to 5 is based on a new linear-time sequential algorithm
for this problem which is also provided here.
(Independently, Schuierer \cite{s-odssr-96} obtained a linear-time
sequential algorithm.)  This improves on the previously best known
sequential algorithm for this problem which used $O(n \log n)$ time
and space.  We develop techniques for solving link distance problems
in parallel which are expected to find applications in the design of
other parallel computational geometry algorithms.  We employ these
parallel techniques for example to optimally compute (on a CREW PRAM)
the link diameter, the link center and the central diagonal of a
rectilinear polygon."
}

@inproceedings{lm-ltcrn-95
, author =	"Andrzej Lingas and Asish Mukhopadhyay"
, title =	"A Linear-Time Construction of the Relative Neighborhood Graph within a Histogram"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"228--238"
, update =	"99.07 bibrelex, 98.07 mitchell, 96.01 smid, 95.05 mitchell"
}

@inproceedings{lprs-melpr-82
, author =	"A. Lingas and R. Pinter and R. Rivest and A. Shamir"
, title =	"Minimum edge length partitioning of rectilinear polygons"
, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
, year =	1982
, pages =	"53--63"
, keywords =	"design of algorithms, VLSI design, partition, length, dynamic programming, NP-completeness, polygons, geometric graphs, rectangles"
}

@unpublished{lprs-meldr-
, author =	"A. Lingas and R. Y. Pinter and R. L. Rivest and A. Shamir"
, title =	"Minimum edge length decomposition of rectilinear polygons"
, note =	"Unpublished Manuscript"
, update =	"97.11 bibrelex"
}

@article{l-qppt-90
, author =	"J. Linhart"
, title =	"A Quick Point-in-Polyhedron Test"
, journal =	"Comput. Graph. (UK)"
, volume =	14
, number =	"3--4"
, year =	1990
, pages =	"445--447"
, update =	"96.09 held"
}

@inproceedings{llsz-ecshs-93
, author =	"N. Linial and M. Luby and M. Saks and D. Zuckerman"
, title =	"Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"??"
, update =	"94.05 devillers"
}

@inproceedings{lmr-rlvcd-88
, author =	"N. Linial and Y. Mansour and R. L. Rivest"
, title =	"Results on learnability and the {Vapnik}-{Chervonekis} dimension"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"120--129"
, precedes =	"lmr-rlvcd-91"
}

@article{lmr-rlvcd-91
, author =	"N. Linial and Y. Mansour and R. L. Rivest"
, title =	"Results on learnability and the {Vapnik}-{Chervonekis} dimension"
, journal =	"Inform. Comput."
, volume =	90
, year =	1991
, pages =	"33--49"
, succeeds =	"lmr-rlvcd-88"
}

@inproceedings{ls-dgrsd-91
, author =	"Nathan Linial and Michael Saks"
, title =	"Decomposing Graphs Into Regions of Small Diameter"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ls-neh-96
, author =	"N. Linial and O. Sasson"
, title =	"Non-expansive hashing"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '96"
, year =	1996
, pages =	"509--517"
, update =	"98.07 bibrelex, 97.07 agarwal"
}

@techreport{l-ldacc-96
, author =	"G. Liotta"
, title =	"Low Degree Algorithms for Computing and Checking {Gabriel} Graphs"
, type =	"Technical Report"
, number =	"CS-96-28"
, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-28.ps.Z"
, keywords =	"graph drawing, proximity, CGC, Brown"
, update =	"97.03 tamassia"
}

@inproceedings{ld-cpdt3-95
, author =	"Giuseppe Liotta and Giuseppe {Di Battista}"
, title =	"Computing Proximity Drawings of Trees in the 3-Dimensional Space"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"239--250"
, keywords =	"graph drawing, 3D, proximity"
, update =	"99.07 bibrelex, 96.09 tamassia, 95.05 mitchell+tamassia"
}

@techreport{llmw-crig-96
, author =	"G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
, title =	"The Rectangle of Influence Drawability Problem"
, type =	"Technical Report"
, number =	"CS-96-22"
, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-22.ps.Z"
, keywords =	"graph drawing, proximity, CGC, Brown"
, precedes =	"llmw-crig-98"
, update =	"98.03 mitchell, 97.03 tamassia"
}

@article{llmw-crig-98
, author =	"G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
, title =	"The Rectangle of Influence Drawability Problem"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, number =	1
, year =	1998
, pages =	"1--22"
, issn =	"0925-7721"
, succeeds =	"llmw-crig-96"
, update =	"98.03 mitchell"
}

@inproceedings{lpt-rpqid-97
, author =	"Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
, title =	"Robust Proximity Queries: an Illustration of Degree-Driven Algorithm Design"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"156--165"
, keywords =	"nearest-neighbor search, point location, arithmetic precision, CGC, Brown"
, cites =	"b-iha-07, b-ecvdl-96, bkmnsu-egcl-95, bms-dgc-94, c-hsh-85, c-sede-92, d-cgcg-92, dk-fdpi-83, dl-pmtds-89, egs-oplms-86, em-feptd-85, f-smpst-89, fv-eeacg-93, gks-ricdv-92, gs-pmgsc-85, h-pargc-89, kln-edtur-91, k-osps-83, lp-lppsi-77, lpt-rpqid-96, p-nappl-81, ps-cgi-85, pt-eplcs-92, st-pplup-86, si-cvdom-92, tv-ocsfc-96, y-stgd-90, y-tegc-97, ZZZ"
, update =	"99.11 bibrelex, 98.07 bibrelex, 97.07 efrat, 97.03 tamassia"
}

@article{lpt-rpqid-98
, author =	"Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
, title =	"Robust Proximity Queries: An Illustration of Degree-driven Algorithm Design"
, journal =	"SIAM J. Comput."
, volume =	28
, number =	3
, year =	1998
, pages =	"864--889"
, keywords =	"nearest-neighbor search, point location, arithmetic precision, CGC, Brown"
, update =	"99.11 smid, 99.07 vismara, 97.03 tamassia"
}

@techreport{lpt-rpqiv-96
, author =	"Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
, title =	"Robust Proximity Queries in Implicit {Voronoi} Diagrams"
, type =	"Technical Report"
, number =	"CS-96-16"
, institution =	"Center for Geometric Computing, Comput. Sci. Dept., Brown Univ."
, address =	"Providence, RI"
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-16.ps.Z"
, update =	"96.09 devillers+tamassia"
}

@techreport{lttv-argd-96
, author =	"G. Liotta and R. Tamassia and I. G. Tollis and P. Vocca"
, title =	"Area Requirement of {Gabriel} Drawings"
, type =	"Technical Report"
, number =	"CS-96-29"
, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-29.ps.Z"
, keywords =	"graph drawing, proximity, CGC, Brown"
, update =	"97.03 tamassia"
}

@inproceedings{lttv-argd-97
, author =	"G. Liotta and R. Tamassia and I. G. Tollis and P. Vocca"
, title =	"Area Requirement of {Gabriel} Drawings"
, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1203
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"135--146"
, url =	"http://www.cs.brown.edu/cgc/papers/lttv-argd-97.ps.gz"
, keywords =	"graph drawing, proximity, CGC, Brown"
, update =	"98.07 tamassia, 97.03 tamassia"
}

@inproceedings{lvd-odmnb-94
, author =	"G. Liotta and F. Vargiu and G. {Di Battista}"
, title =	"Orthogonal Drawings with the Minimum Number of Bends"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"281--286"
, cites =	"dt-ipt-89, dlv-sorod-93, e-ga-79, gt-ccurp-94, k-mpgdg-92, l-conm-76, t-eggmn-87, tt-pgelt-89, ttv-lbpap-91, ttv-lbpod-91, v-ucvc-81, dett-adgab-94, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@book{lw-spgd-
, title =	"Special Issue on Selected Papers from the 1998 Symposium on Graph Drawing"
, editor =	"G. Liotta and S. Whitesides"
, series =	"J. Graph Algorithms Appl."
, note =	"To appear"
, keywords =	"graph drawing, collection"
, update =	"98.11 tamassia"
}

@inproceedings{ltl-mpsrp-89
, author =	"W. T. Liou and J. J. M. Tan and R. C. T. Lee"
, title =	"Minimum partitioning simple rectilinear polygons in {$O(n \log\log n)$} time"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"344--353"
, cites =	"ahu-daca-74, aap-ptem-86, ckss-crr-81, fss-mrpdb-84, fk-acpr-84, gt-ltasc-85, g-mmbg-67, cg-prca-83, h-acpr-82, hk-nammb-73, ia-eaggs-86, lllmp-tddo2-79, lp-eafmm-81, m-dsa-84, ns-fapd-88, o-mdrr-83, ostt-mprr-83, ps-coac-82, tv-otats-88, ZZZ"
, update =	"98.03 bibrelex"
}

@article{ltl-ccrpl-91
, author =	"W. T. Liou and C. Y. Tang and R. C. T. Lee"
, title =	"Covering convex rectilinear polygons in linear time"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	2
, year =	1991
, pages =	"137--185"
, keywords =	"optimal covering problem, convex rectilinear polygon, optimum algorithm"
}

@article{l-ompa-84
, author =	"W. {Lipski, Jr.}"
, title =	"An {$O(n \log n)$} {Manhattan} path algorithm"
, journal =	"Inform. Process. Lett."
, volume =	19
, year =	1984
, pages =	"99--102"
}

@article{l-fmprp-83
, author =	"W. {Lipski, Jr.}"
, title =	"Finding a {Manhattan} path and related problems"
, journal =	"Networks"
, volume =	13
, year =	1983
, pages =	"399--409"
}

@incollection{l-stlwl-84
, author =	"W. {Lipski, Jr.}"
, title =	"On the structure of three-layer wirable layouts"
, editor =	"Franco P. Preparata"
, booktitle =	"VLSI Theory"
, series =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1984
, pages =	"231--243"
, update =	"01.04 icking"
}

@article{lllmp-tddo2-79
, author =	"W. {Lipski, Jr.} and E. Lodi and F. Luccio and C. Mugnai and L. Pagli"
, title =	"On two-dimensional data organization , {Part} {II}"
, journal =	"Fundam. Inform."
, volume =	2
, year =	1979
, pages =	"245--260"
, update =	"97.11 bibrelex"
}

@article{lp-fatsd-81
, author =	"W. {Lipski, Jr.} and C. H. Papadimitriou"
, title =	"A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"211--226"
}

@article{lp-eafmm-81
, author =	"W. {Lipski, Jr.} and F. P. Preparata"
, title =	"Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems"
, journal =	"Acta Inform."
, volume =	15
, year =	1981
, pages =	"329--346"
, update =	"98.03 bibrelex"
}

@article{lp-fcuio-80
, author =	"W. {Lipski, Jr.} and F. P. Preparata"
, title =	"Finding the contour of a union of iso-oriented rectangles"
, journal =	"J. Algorithms"
, volume =	1
, year =	1980
, pages =	"235--246"
, note =	"Errata in 2(1981), 105; corrigendum in 3(1982),
		 301--302"
}

@article{lp-src-81
, author =	"W. {Lipski, Jr.} and F. P. Preparata"
, title =	"Segments, rectangles, contours"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"63--76"
}

@book{l-eaac-81
, author =	"J. Lipson"
, title =	"Elements of Algebra and Algebraic Computing"
, publisher =	"Addison-Wesley"
, year =	1981
, update =	"98.03 bibrelex"
}

@article{ls-mmpmm-88
, author =	"M. Lipton and W. Still"
, title =	"The multiple minimum problem in molecular modeling: {Tree} searching internal coordinate conformational space"
, journal =	"J. Computational Chemistry"
, volume =	9
, number =	4
, year =	1988
, pages =	"343--355"
, update =	"98.07 bibrelex"
}

@article{lm-bmcpg-78
, author =	"R. J. Lipton and R. E. Miller"
, title =	"A Batching Method for Coloring Planar Graphs"
, journal =	"Inform. Process. Lett."
, volume =	7
, number =	4
, year =	1978
, pages =	"185--188"
, update =	"98.03 bibrelex"
}

@inproceedings{lns-mdg-85
, author =	"R. J. Lipton and S. C. North and J. S. Sandberg"
, title =	"A method for drawing graphs"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"153--160"
, keywords =	"graph drawing"
, cites =	"b-agt-74, c-agg-83, c-cgts-69, cm-ecgt-78, c-tggr-95, c-sdcrg-50, cm-grdg-80, cfp-zsg-81, er-ag-63, f-gcen-32, f-egavp-83, f-grg-49, f-gdtga-49, f-hdg-70, fhl-ptapg-80, gj-cigtn-79, gw-cetg-77, gm-gtg-64, ht-ogpm-66, h-gt-72, h-vsag-65, j-crpg-82, k-c-47, k-lgdlt-46, k-dpgtg-47, k-cdf-63, l-cpe-79, m-caclg-77, m-sgta-72, p-kafgg-37, rt-tdt-81, s-ggggg-57, s-cg-59, s-mogga-59, s-gm-60, s-cmspg-70, sr-cdtn-83, t-scg-59, t-crg-60, t-hdg-63, t-cg-66, t-wim-73, t-gt-84, u-ascan-84, w-grras-, w-anagg-71, w-moagp-66, ws-tdt-79, w-s-51, w-fpg-64, ZZZ"
, update =	"97.11 bibrelex, 93.09 tamassia, 93.05 jones"
}

@article{lns-vlp-83
, author =	"R. J. Lipton and S. C. North and R. Sledgewick"
, title =	"VLSI layout as programming"
, journal =	"ACM Trans. on Programming Languages and Systems"
, volume =	"??"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{lrt-gnd-79
, author =	"R. J. Lipton and D. J. Rose and R. E. Tarjan"
, title =	"Generalized nested dissection"
, journal =	"SIAM J. Numer. Anal."
, volume =	16
, number =	2
, year =	1979
, pages =	"346--358"
, update =	"97.11 bibrelex"
}

@inproceedings{ls-lbv-81
, author =	"R. J. Lipton and R. Sedgewick"
, title =	"Lower bounds for {VLSI}"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
, year =	1981
, pages =	"300--307"
}

@inproceedings{lt-stpg-77
, author =	"R. J. Lipton and R. E. Tarjan"
, title =	"A separator theorem for planar graphs"
, booktitle =	"Proc. GI Conf. Theoret. Comput. Sci."
, year =	1977
, update =	"97.11 bibrelex"
}

@article{lt-stpg-79
, author =	"R. J. Lipton and R. E. Tarjan"
, title =	"A separator theorem for planar graphs"
, journal =	"SIAM J. Appl. Math."
, volume =	36
, year =	1979
, pages =	"177--189"
, update =	"97.11 bibrelex"
}

@inproceedings{lt-apst-77
, author =	"R. J. Lipton and R. E. Tarjan"
, title =	"Applications of a planar separator theorem"
, booktitle =	"Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1977
, pages =	"162--170"
, precedes =	"lt-apst-80"
}

@article{lt-apst-80
, author =	"R. J. Lipton and R. E. Tarjan"
, title =	"Applications of a planar separator theorem"
, journal =	"SIAM J. Comput."
, volume =	9
, year =	1980
, pages =	"615--627"
, succeeds =	"lt-apst-77"
}

@incollection{l-crpbt-94
, author =	"Dani Lischinski"
, title =	"Converting Rectangular Patches into {B{\'e}zier} Triangles"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"278--285"
, keywords =	"Bezier surface, biquadratic patch"
, update =	"94.09 heckbert"
, annote =	"A parametric surface conversion routine. Contains C++
code."
}

@incollection{l-idt-94
, author =	"Dani Lischinski"
, title =	"Incremental {Delaunay} Triangulation"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"47--59"
, keywords =	"mesh generation, polygonization, Voronoi diagram"
, update =	"94.09 heckbert"
, annote =	"Gives some code to solve a very important problem: finding
Delaunay triangulations and Voronoi diagrams in 2D. These two geometric
constructions are useful for triangular mesh generation and for nearest
neighbor finding, respectively. Triangular mesh generation comes up when
doing interpolation of surfaces from scattered data points, and in finite
element simulations of all kinds, such as radiosity. Voronoi diagrams are
used in many computational geometry algorithms. Contains C++ code."
}

@article{ltg-dmar-92
, author =	"Dani Lischinski and Filippo Tampieri and Donald Greenberg"
, title =	"Discontinuity meshing for accurate radiosity"
, journal =	"IEEE Comp. Graph. App."
, volume =	"??"
, month =	nov
, year =	1992
, pages =	"25--39"
, update =	"98.11 bibrelex"
}

@article{lsg-beer-94
, author =	"D. Lishinski and B. Smith and D. P. Greenberg"
, title =	"Bounds and error estimates for radiosity"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1994
, pages =	"67--74"
, note =	"Proc. SIGGRAPH '94"
, update =	"98.03 bibrelex"
}

@unpublished{l-tpfc-88
, author =	"B. Lisper"
, title =	"Theory{N}et posting and followup communication"
, month =	jul
, year =	1988
, note =	"??"
, update =	"97.11 bibrelex"
}

% ###
@misc{ls-agt-
, author =	"F. F. Little and J. L. Schwing"
, title =	"Automatic Generation of Triangulations"
}

@inproceedings{l-imrcp-83
, author =	"J. J. Little"
, title =	"An Iterative Method for Reconstructing Convex Polyhedra from Extended {Gaussian} Image"
, booktitle =	"Proc. AAAI"
, year =	1983
, pages =	"247--250"
, update =	"97.11 bibrelex"
}

@inproceedings{l-doaeg-85
, author =	"J. J. Little"
, title =	"Determining Object Attitude from Extended {Gaussian} Image"
, booktitle =	"Proc. Internat. Joint Conf. Artif. Intell."
, year =	1985
, note =	"Submitted"
, update =	"97.11 bibrelex"
}

@inproceedings{l-egimv-85
, author =	"J. J. Little"
, title =	"Extended gaussian images, mixed volumes, and shape reconstruction"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"15--23"
, cites =	"bb-deibs-81, b-fodm-84, b-fihs-78, gmw-po-81, g-iscsh-81, g-cp-67, grs-kfcg-83, h-egi-84, i-r3dou-81, ihncf-puopo-83, l-imrcp-83, l-doaeg-85, l-cfp-66, m-aludk-97, ps-coac-82, ph-chfsp-77, s-mplbc-84, s-uesi-79, s-pur-22, t-cpt-62, w-pmdso-80, ZZZ"
, update =	"97.11 bibrelex, 93.05 jones"
}

@article{lp-rpfit-79
, author =	"J. J. Little and T. K. Peucker"
, title =	"A recursive procedure for finding the intersection of two digital curves"
, journal =	"Comput. Graph. Image Process."
, volume =	10
, year =	1979
, pages =	"159--171"
}

@inproceedings{l-lqwia-87
, author =	"N. Littlestone"
, title =	"Learning quickly when irrelevant attributes abound: {A} new linear-threshold algorithm"
, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1987
, pages =	"68--77"
, update =	"98.03 bibrelex"
}

@techreport{lj-rbtsm-93
, author =	"Anwei Liu and Barry Joe"
, title =	"Relationship between tetrahedron shape measures"
, institution =	"University of Alberta"
, address =	"Edmonton, Alberta, Canada"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@article{lefm-dvnmp-96
, author =	"C. Liu and D. M. Esterling and J. Fontdecaba and E. Mosel"
, title =	"Dimensional Verification of {NC} Machining Profiles Using Extended Quadtrees"
, journal =	"Comput. Aided Design"
, volume =	28
, number =	11
, month =	nov
, year =	1996
, pages =	"845--852"
, update =	"97.03 held"
}

@article{ln-dpump-88
, author =	"Robin Liu and Simeon Ntafos"
, title =	"On Decomposing Polygons into Uniformly Monotone Parts"
, journal =	"Inform. Process. Lett."
, volume =	27
, number =	2
, month =	feb
, year =	1988
, pages =	"85--89"
, update =	"98.03 mitchell"
}

@article{ln-prpss-91
, author =	"R. Liu and S. Ntafos"
, title =	"On partitioning rectilinear polygons into star-shaped polygons"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"771--800"
}

@inproceedings{ls-smm-85
, author =	"S. Liu and K. Singhal"
, title =	"A statistical mosfet model"
, booktitle =	"Proc. of the International Conference on Computer-Aided Design"
, site =	"San Jose"
, year =	1985
, pages =	"78--80"
, update =	"98.03 bibrelex"
}

@unpublished{lsv-cacsc-86
, author =	"S. Liu and K. Singhal and V. Visivanathan"
, title =	"CENTER/ADVICE: A CAD system for circuit design optimization"
, year =	1986
, note =	"Manuscript in preparation"
, update =	"98.03 bibrelex"
}

@inproceedings{lg-blbsb-96
, author =	"Shang-Sheng Liu and Rajit Gadh"
, title =	"Basic Logical Bulk shapes (BLOBs) for finite element hexahedral mesh generation"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"291--304"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{lr-eodbr-90
, author =	"W.-P. Liu and I. Rival"
, title =	"Enumerating one-directional blocking relations and embedding them in small areas on the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"138--141"
, cites =	"d-rbwdo-84, fpp-sssfe-88, mt-tqcp-85, nru-roptp-90, ru-roptc-88, dtt-arsdd-89, tt-uavrp-86, w-cblsg-85, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{lmp-sbeac-94
, author =	"Y. Liu and P. Marchioro and R. Petreschi"
, title =	"A Single Bend Embedding Algorithm for Cubic Graphs"
, type =	"Manuscript"
, year =	1994
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@techreport{lmps-trm1b-90
, author =	"Y. Liu and P. Marchioro and R. Petreschi and B. Simeone"
, title =	"Theoretical Results on at Most 1-Bend Embeddability of Graphs"
, type =	"Technical Report"
, institution =	"Dipartimento di Statistica, Univ. di Roma ``La Sapienza''"
, year =	1990
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@techreport{lms-la3be-93
, author =	"Y. Liu and A. Morgana and B. Simeone"
, title =	"A Linear Algorithm for 3-Bend Embeddings of Planar Graphs in the Grid"
, type =	"Manuscript"
, year =	1993
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@article{lms-gtrre-91
, author =	"Y. Liu and A. Morgana and B. Simeone"
, title =	"General Theoretical Results on Rectilinear Embeddability of Graphs"
, journal =	"Acta Math. Appl. Sinica"
, volume =	7
, year =	1991
, pages =	"187--192"
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@article{la-fspdp-95
, author =	"Y.-H. Liu and S. Arimoto"
, title =	"Finding the Shortest Path of a Disc Among Polygonal Obstacles Using a Radius-Independent Graph"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	11
, number =	5
, month =	oct
, year =	1995
, pages =	"682--691"
, update =	"96.01 held"
}

@article{ld-smtld-92
, author =	"Z. C. Liu and D. Z. Du"
, title =	"On {Steiner} minimal trees with {$L_p$} distance"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"179--191"
, update =	"99.03 bibrelex, 98.03 bibrelex"
}

@book{l-kt-93
, author =	"C. Livingston"
, title =	"Knot Theory"
, publisher =	"Mathematical Association of America"
, address =	"Washington"
, year =	1993
, update =	"00.11 smid, 00.07 icking, 98.07 orourke"
}

@article{lsj-noiea-96
, author =	"Y. Livnat and H.-W. Shen and C. R. Johnson"
, title =	"A near optimal isosurface extraction algorithm using the span space"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	2
, year =	1996
, pages =	"73--84"
, update =	"98.07 bibrelex"
}

@techreport{ls-ipjc-85
, author =	"R. Livne and Micha Sharir"
, title =	"On Intersection of Planar {Jordan} Curves"
, type =	"Technical {Report}"
, number =	153
, institution =	"Courant Institute of Mathematical Sciences"
, year =	1985
, comments =	"Robotics Report number 37"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{l-tspp-77
, author =	"E. L. Lloyd"
, title =	"On triangulations of a set of points in the plane"
, booktitle =	"Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1977
, pages =	"228--240"
}

@article{l-opmr-80
, author =	"J. W. Lloyd"
, title =	"Optimal partial-match retrieval"
, journal =	"BIT"
, volume =	20
, year =	1980
, pages =	"406--413"
}

@article{l-pmrdf-82
, author =	"J. W. Lloyd"
, title =	"Partial-match retrieval for dynamic files"
, journal =	"BIT"
, volume =	22
, year =	1982
, pages =	"150--168"
}

@inproceedings{lms-hscr-92
, author =	"C.-Y. Lo and J. Matou{\v s}ek and W. Steiger"
, title =	"Ham-sandwich cuts in {$\Re^d$}"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"539--545"
, update =	"96.09 agarwal"
}

@article{lms-ahsc-94
, author =	"C.-Y. Lo and J. Matou{\v s}ek and W. L. Steiger"
, title =	"Algorithms for ham-sandwich cuts"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"433--452"
, succeeds =	"lms-hscr-92"
, update =	"97.11 bibrelex, 97.03 agarwal, 96.09 agarwal, 95.01 matousek"
}

@inproceedings{ls-otahs-90
, author =	"C.-Y. Lo and W. Steiger"
, title =	"An optimal-time algorithm for ham-sandwich cuts in the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"5--9"
, cites =	"csss-otass-89, csy-khrp-87, e-acg-87, ew-chsct-86, m-cen-89, m-ptlp-85, w-pr-82, ZZZ"
, update =	"98.07 bibrelex"
}

@article{l-dtncp-89
, author =	"S. H. Lo"
, title =	"Delaunay Triangulation Of Non-Convex Planar Domains"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	28
, number =	11
, month =	nov
, year =	1989
, pages =	"2695--2707"
, keywords =	"Delaunay triangulation, planar domains, mesh generation techniques"
, annote =	"Triangle quality measure of $$2\sqrt3 \frac{|a\times
		 b|}{a^2+b^2+c^2}$$. Circumcircle algorithm for CDT.
		 Keep track of non-Delaunay edges. Initially the
		 boundary, edges of non-Delaunay triangles are added to
		 this list, which is all that must be checked for
		 intersections."
, abstract =	"This paper investigates the possibility of integrating
		 the two currently most popular mesh generation
		 techniques, namely the method of advancing front and
		 the Delaunay triangulation algorithm. The merits of the
		 resulting scheme are its simplicity, efficiency and
		 versatility. With the introduction of 'non-Delaunay'
		 line segments, the concept of using Delaunay
		 triangulation as a means of mesh generation is
		 clarified. An efficient algorithm is proposed for the
		 construction of Delaunay triangulations over non-convex
		 planar domains. Interior nodes are first generated
		 within the planar domain. These interior nodes and the
		 boundary nodes are then linked up together to produce a
		 valid triangulation. Through the study of numerous
		 examples of various characteristics, it is found that
		 high-quality triangular element meshes are obtained by
		 the proposed algorithm, and the mesh generation time
		 bears a linear relationship with the number of
		 elements/nodes of the triangulation. (Edited author
		 abstract) 37 Refs."
}

@article{l-vdt1v-91
, author =	"S. H. Lo"
, title =	"Volume Discretization Into Tetrahedra. {I}. Verification and Orientation of Boundary Surfaces"
, journal =	"Comput. Struct."
, volume =	39
, number =	5
, year =	1991
, pages =	"493--500"
, annote =	"Mesh quality is harmonic mean of $A/(a^2+b^2+c^2)$."
}

@article{l-vdt23-91
, author =	"S. H. Lo"
, title =	"Volume Discretization Into Tetrahedra. {II}. 3{D} Triangulation By Advancing Front Approach"
, journal =	"Comput. Struct."
, volume =	39
, number =	5
, year =	1991
, pages =	"501--511"
, keywords =	"discretization, tetrahedra, mesh generation, triangulation, advancing fronts"
, annote =	"Doesn't like 3DDT. Advancing front picks next vertex
		 as one that maximizes `quality' with a lookahead."
, abstract =	"Existing methods of automatic mesh generation for 3D
		 solid objects are reviewed. Although the 3D Delaunay
		 triangulation recently aroused much attention, its
		 suitability as a finite element mesh generator is
		 questioned. Although in 2D Delaunay triangulation, the
		 'max-min' angle criterion can be verified over the
		 entire domain, no equivalent or similar criterion can
		 be defined for its extension to 3D situations to ensure
		 that tetrahedron elements so generated are well
		 proportioned for numerical calculations. In this paper,
		 a simple but versatile 3D triangulation scheme based on
		 the advancing front technique for the discretization of
		 arbitrary volumes is presented. To ensure that the
		 tetrahedron elements generated are as equilateral as
		 possible, the ratio of volume of the element to the sum
		 of squares of edges put into a dimensionless form is
		 adopted to judge the quality of a tetrahedron element.
		 The quality of the finite element mesh can thus be
		 ensured if the shape of each tetrahedron element is
		 carefully controlled in the mesh construction process.
		 Through the study of numerous examples of various
		 characteristics, it is found that high-quality
		 tetrahedron element meshes are obtained by the proposed
		 algorithm. (Author abstract) 24 Refs."
}

@inproceedings{ltc-pafaq-95
, author =	"Randy Lober and Timothy J. Tautges and Rich A. Cairncross"
, title =	"The Parallelization of an Advancing-front, All-quadrilateral Meshing Algorithm for Adaptive Analysis"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"59--71"
, update =	"96.01 samitchell"
}

@book{l-bc-61
, author =	"E. Lockwood"
, booktitle =	"A Book of Curves"
, publisher =	"Cambridge University Press"
, address =	"Cambridge, UK"
, year =	1961
, update =	"95.09 agarwal"
}

@article{l-tpst-90
, author =	"M. Loczkovich"
, title =	"Tilings of polygons with similar triangles"
, journal =	"Combinatorica"
, volume =	10
, year =	1990
, pages =	"281--306"
}

@article{llmp-tddo1-79
, author =	"E. Lodi and F. Luccio and C. Mugnai and L. Pagli"
, title =	"On two-dimensional data organization, {Part} {I}"
, journal =	"Fundam. Inform."
, volume =	2
, year =	1979
, pages =	"211--226"
, update =	"97.11 bibrelex"
}

@article{lp-vsvsv-86
, author =	"E. Lodi and L. Pagli"
, title =	"A {VLSI} Solution to the Vertical Segment Visibility Problem"
, journal =	"IEEE Trans. Comput."
, volume =	"C-35"
, number =	10
, year =	1986
, pages =	"923--928"
, update =	"93.09 held"
}

@book{l-ssthc-76
, author =	"A. L. Loeb"
, title =	"Space Structures, their Harmony and Counterpoint"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1976
}

@inproceedings{lhss-96
, author =	"Jes{\'u}s A. de Loera and Serkan Ho{\c s}ten and Francisco Santos and Bernd Sturmfels"
, title =	"The Polytope of all Triangulations of a Point Configuration"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"21--24"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{l-crtpc-94
, author =	"J. de Loera"
, title =	"Computing Regular Traiangulations of Point Configurations"
, type =	"Preprint"
, year =	1994
, update =	"97.11 bibrelex"
}

@article{lst-gbtsh-95
, author =	"J. de Loera and B. Sturmfels and R. Thomas"
, title =	"Gr{\"o}bner bases and triangulation of the second hypersimplex"
, journal =	"Combinatorica"
, volume =	15
, number =	3
, year =	1995
, pages =	"409--424"
, update =	"97.11 bibrelex, 95.05 orourke"
}

@techreport{lmtw-vbrtc-97
, author =	"I. P. Logan and W. A. McNeely and J. J. Troy and D. P. Wills"
, title =	"Voxel Based Real-Time Collision Detection"
, type =	"Manuscript"
, institution =	"Univ. Hull"
, year =	1997
, keywords =	"intersection detection, collision detection, voxels, haptics"
, update =	"98.03 mitchell"
}

@article{ls-mtoap-83
, author =	"A. W. Lohman and N. Sreibl"
, title =	"Map transformation by optical anamorphic processing"
, journal =	"Appl. Optics"
, volume =	22
, number =	6
, year =	1983
, pages =	"780--783"
, update =	"97.11 bibrelex"
}

@inproceedings{l-sgdd-95
, author =	"Rainald Lohner"
, title =	"Surface Gridding from Discrete Data"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"29--45"
, update =	"96.01 samitchell"
}

@inproceedings{lp-gtdug-88
, author =	"Rainald Lohner and Paresh Parikh"
, title =	"Generation of three-dimensional unstructured grids by the advancing-front method"
, booktitle =	"AIAA 26th Aerospace Sciences Meeting"
, month =	jan
, year =	1988
, note =	"AIAA Paper AIAA-88-0515"
, update =	"98.11 bibrelex"
}

@article{l-tsas-64
, author =	"S. Lojasiewicz"
, title =	"Triangulation of semi-analytic sets"
, journal =	"Annali della Scuola Normale Superiore de Pisa, Annali Scienze, Fisiche i Mathimatische Serie III"
, volume =	18
, year =	1964
, pages =	"449--474"
, update =	"98.07 bibrelex"
}

@article{ls-htmim-90
, author =	"D. B. Lomet and B. Salzberg"
, title =	"The h{B}-tree: {A} multiattribute indexing method with good guaranteed performance"
, journal =	"ACM Trans. Database Syst."
, volume =	15
, year =	1990
, pages =	"625--658"
, update =	"97.07 agarwal"
}

@inproceedings{l-ccm-94
, author =	"M. J. Longtin"
, title =	"Cover and concealment in {ModSAF}"
, booktitle =	"Proc. 4th Conf. on Computer Generated Forces and Behavioral Representation"
, year =	1994
, pages =	"239--247"
, update =	"98.07 bibrelex"
}

@inproceedings{lm-crm-95
, author =	"M. J. Longtin and D. Megherbi"
, title =	"Concealed routes in {ModSAF}"
, booktitle =	"Proc. 5th Conf. on Computer Generated Forces and Behavioral Representation"
, year =	1995
, pages =	"305--313"
, update =	"98.07 bibrelex"
}

@incollection{l-cae-83
, author =	"R. Loos"
, title =	"Computing in algebraic extensions"
, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
, publisher =	"Springer-Verlag"
, year =	1983
, pages =	"173--187"
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@incollection{l-gprs-83
, author =	"R. Loos"
, title =	"Generalized Polynomial Remainder Sequences"
, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
, publisher =	"Springer-Verlag"
, address =	"Wien"
, year =	1983
, pages =	"115--137"
, update =	"00.03 bibrelex, 99.11 bibrelex, 97.11 bibrelex"
}

@inproceedings{l-cv-93
, author =	"Jes{\'u}s Garc{\'\i}a L{\'o}pez and Pedro Ramos-Alonso"
, title =	"Circular Visibility"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"61--65"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{lm-edpls-96
, author =	"Mario Lopez and Dinesh Mehta"
, title =	"Efficient decomposition of polygons into {L}-shapes with applications to {VLSI} layouts"
, journal =	"ACM Trans. Design. Autom. Electr. Syst."
, volume =	1
, number =	3
, year =	1996
, pages =	"371--395"
, update =	"97.11 orourke"
}

@article{lr-eacp-00
, author =	"M. A. Lopez and S. Reisner"
, title =	"Efficient approximation of convex polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"445--452"
, update =	"01.04 smid"
}

@phdthesis{l-oltsb-96
, author =	"A. L{\'o}pez-Ortiz"
, title =	"On-line target searching in bounded and unbounded domains"
, school =	"Univ. Waterloo"
, address =	"Waterloo, Canada"
, year =	1996
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex+icking"
}

@inproceedings{ls-gsr-96
, author =	"A. L{\'o}pez-Ortiz and S. Schuierer"
, title =	"Generalized streets revisited"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"546--558"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 smid"
}

@techreport{ls-ghtun-94
, author =	"A. L{\'o}pez-Ortiz and S. Schuierer"
, title =	"Going home through an unknown neighbourhood"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, Canada"
, year =	1994
, update =	"98.03 bibrelex"
}

@inproceedings{ls-ghtus-95
, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
, title =	"Going Home Through an Unknown Street"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"135--146"
, isbn =	"3-540-60220-8"
, update =	"99.07 bibrelex, 98.07 icking, 98.03 icking+mitchell, 95.05 mitchell"
}

@misc{ls-lbsgs-98
, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
, title =	"Lower Bounds for Searching on Generalized Streets"
, howpublished =	"University of New Brunswick, Canada"
, year =	1998
, update =	"00.03 bibrelex"
}

@article{ls-lbsgs-01
, author =	"A. L{\'o}pez-Ortiz and S. Schuierer"
, title =	"Lower bounds for streets and generalized streets"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"401--421"
, update =	"01.11 smid"
}

@inproceedings{ls-pinos-97
, author =	"A. L{\'o}pez-Ortiz and S. Schuierer"
, title =	"Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"445--447"
, precedes =	"ls-pinos-97b"
, cites =	"bcr-sp-93, dhs-cspbg-95, di-csgs-94, g-sg-80, ik-skpcs-95, k-wusbd-92, k-olssp-94, l-oltsb-96, ls-ghtus-95, ls-gsr-96, ls-wsf-96, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@inproceedings{ls-pinos-97b
, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
, title =	"Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"284--296"
, update =	"99.07 bibrelex, 98.03 mitchell"
}

@inproceedings{ls-serst-95
, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
, title =	"Simple, Efficient and Robust Strategies to Traverse Streets"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"217--222"
, update =	"95.09 jones"
}

@techreport{ls-ecesc-98
, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
, title =	"The Exact Cost of Exploring Streets with {CAB}"
, type =	"Technical Report"
, institution =	"Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
, year =	1998
, update =	"00.03 bibrelex"
}

@inproceedings{ls-ussmr-98
, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
, title =	"The Ultimate Strategy to Search on $m$ Rays?"
, booktitle =	"Proc. 4th Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '98"
, site =	"Taipei, Taiwan"
, series =	"Lecture Notes Comput. Sci."
, volume =	1449
, publisher =	"Springer-Verlag"
, year =	1998
, update =	"99.11 bibrelex"
}

@inproceedings{ls-wsf-96
, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
, title =	"Walking Streets Faster"
, booktitle =	"Proc. 5th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '96"
, series =	"Lecture Notes Comput. Sci."
, volume =	1097
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"345--356"
, isbn =	"3-540-61422-2"
, update =	"98.07 icking, 98.03 mitchell"
}

@article{lc-mchr3-87
, author =	"W. Lorensen and H. Cline"
, title =	"Marching cubes: a high resolution 3d surface construction algorithm"
, journal =	"Comput. Graph."
, volume =	21
, number =	4
, year =	1987
, pages =	"163--170"
, update =	"98.11 devillers, 97.11 bibrelex"
}

@book{l-cw-83
, author =	"M. Lothaire"
, title =	"Combinatorics on Words"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1983
, update =	"98.07 bibrelex"
}

@inproceedings{lsl-oamtc-90
, author =	"R. D. Lou and M. Sarrafzadeh and D. T. Lee"
, title =	"An optimal algorithm for the maximum two-chain problem"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"149--158"
}

@article{l-sdrtc-96
, author =	"Michael C. Loui and others"
, title =	"Strategic Directions in Research in Theory of Computing"
, journal =	"ACM Comput. Surv."
, volume =	28
, number =	4
, year =	1996
, pages =	"575--590"
, url =	"http://geisel.csl.uiuc.edu/~loui/complete.html"
, update =	"98.07 tamassia+vismara, 97.03 tamassia"
}

@article{ldw-masat-97
, author =	"M. Lounsbery and T. D. DeRose and J. Warren"
, title =	"Multiresolution Analysis for Surfaces of Arbitrary Topological Type"
, journal =	"ACM Trans. Graph."
, volume =	16
, number =	1
, month =	jan
, year =	1997
, pages =	"34--73"
, update =	"97.11 held"
}

@article{l-tdoad-91
, author =	"A. Louri"
, title =	"Three-dimensional optical architecture and data-parallel algorithms for massively parallel computing"
, journal =	"IEEE Micro"
, volume =	"??"
, month =	apr
, year =	1991
, pages =	"24--81"
, update =	"98.03 bibrelex"
}

@article{l-shlpc-70
, author =	"P. P. Loutrel"
, title =	"A solution to the hidden-line problem for computer drawn polyhedra"
, journal =	"IEEE Trans. Comput."
, volume =	"C-19"
, year =	1970
, pages =	"205--213"
}

@book{l-atngc-86
, author =	"L. Lovasz"
, title =	"An Algorithmic Theory of Numbers, Graphs, and Convexity"
, series =	"CBMS-NSF Regional Conference Series in Applied Mathematics"
, publisher =	"Society of Industrial and Applied Mathematicians"
, address =	"Philadelphia, PA"
, year =	1986
, update =	"98.11 bibrelex"
}

@book{l-cpe-79
, author =	"L. Lov{\'a}sz"
, title =	"Combinatorial Problems and Exercises"
, publisher =	"North-Holland"
, year =	1979
, update =	"97.11 bibrelex"
}

@incollection{l-ccs-90
, author =	"L. Lov{\`a}sz"
, title =	"Communication complexity: {A} survey"
, booktitle =	"Paths, Flows, and VLSI Layout"
, series =	"Algorithms and Combinatorics"
, volume =	9
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"235--265"
, update =	"98.03 bibrelex"
}

@article{l-nhl-71
, author =	"L. Lov{\'a}sz"
, title =	"On the number of halving lines"
, journal =	"Annal. Univ. Scie. Budapest. de Rolando E{\"o}tv{\"o}s Nominatae, Sectio Math."
, volume =	14
, year =	1971
, pages =	"107--108"
, update =	"95.09 agarwal"
}

@article{l-roifc-75
, author =	"L. Lov{\'a}sz"
, title =	"On the ratio of optimal integral and fractional covers"
, journal =	"Discrete Math."
, volume =	13
, year =	1975
, pages =	"383--390"
, keywords =	"approximation"
}

@inproceedings{lps-ctc-95
, author =	"L{\'a}szl{\'o} Lov{\'a}sz and J{\'a}nos Pach and Mario Szegedy"
, title =	"On Conway's Thrackle Conjecture"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"147--151"
, keywords =	""
, cites =	"bf-lamcp-88, b-siec-69, be-cp-48, dett-adgab-94, fs-lda1-35, f-edpsp-40, gj-cninc-83, g-lsh-75, g-tsdg-93, g-cng-72, hp-an1-34, kst-pkz-54, lst-gbtsh-95, pa-cg-95, prs-crtcs-94, prs-pnmcs-91, rsp-sbmc-91, t-nw-77, t-ttcn-70, wb-tgt-78, w-td-69, w-op-72, ZZZ"
, update =	"98.03 bibrelex, 97.11 icking, 95.09 mitchell"
}

@book{lp-mt-86
, author =	"L. Lovasz and M. D. Plummer"
, title =	"Matching Theory"
, series =	"Ann. Discrete Math."
, volume =	29
, publisher =	"North-Holland"
, year =	1986
, update =	"96.09 devillers, 95.01 tamassia"
}

@techreport{ls-gbra-92
, author =	"L. Lovasz and H. E. Scarf"
, title =	"The Generalized Basis Reduction Algorithm"
, type =	"Cowles Foundation Paper"
, number =	818
, institution =	"Yale University"
, year =	1992
, update =	"98.11 bibrelex"
}

@inproceedings{ls-mrmci-90
, author =	"L. Lov{\'a}sz and M. Siminovits"
, title =	"The mixing rate of {Markov} chains, an isoperimetric inequality, and computing the volume"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"346--354"
, keywords =	"approximation, volume, convex"
}

@inproceedings{ls-rcvd-92
, author =	"L. Lov{\'a}sz and M. Simonovits"
, title =	"On the randomized complexity of volume and diameter"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"482--492"
}

@article{ly-grp-82
, author =	"L. Lovasz and Y. Yemini"
, title =	"On generic rigidity in the plane"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	3
, year =	1982
, pages =	"91--98"
, update =	"98.11 bibrelex"
}

@article{llw-rbceg-88
, author =	"N. Linial L. Lovasz and A. Wigderson"
, title =	"Rubber Bands, Convex Embeddings and Graph Connectivity"
, journal =	"Combinatorica"
, volume =	8
, year =	1988
, pages =	"91--102"
, update =	"95.09 tamassia"
}

@incollection{l-pg-83
, author =	"L. Lov{\'a}z"
, title =	"Perfect Graphs"
, editor =	"L. W. Beineke and R. J. Wilson"
, booktitle =	"Selected Topics in Graph Theory"
, volume =	2
, publisher =	"Academic Press"
, address =	"London, UK"
, year =	1983
, pages =	"55--85"
, update =	"98.03 bibrelex"
}

@techreport{l-tdors-86
, author =	"D. G. Lowe"
, title =	"Three-dimensional object recognition from single two-dimensional images"
, type =	"Report"
, number =	202
, institution =	"Comput. Sci. Div., New York Univ."
, address =	"New York, NY"
, year =	1986
}

@techreport{l-smpag-86
, author =	"T. Lozano-P{\'e}rez"
, title =	"A simple motion planning algorithm for general robot manipulators"
, type =	"Technical {Report}"
, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{l-smpag-87
, author =	"T. Lozano-P{\'e}rez"
, title =	"A simple motion planning algorithm for general robot manipulators"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	"RA-3"
, number =	3
, year =	1987
, pages =	"224--238"
, update =	"02.03 orourke"
}

@article{l-apmtm-81
, author =	"T. Lozano-P{\'e}rez"
, title =	"Automatic planning of manipulator transfer movements"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-11"
, number =	10
, year =	1981
, pages =	"681--698"
}

@inproceedings{l-rp-83
, author =	"T. Lozano-P{\'e}rez"
, title =	"Robot programming"
, booktitle =	"IEEE Poceedings"
, year =	1983
, update =	"98.03 bibrelex"
}

@article{l-spcsa-83
, author =	"T. Lozano-P{\'e}rez"
, title =	"Spatial planning: {A} configuration space approach"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, year =	1983
, pages =	"108--120"
}

@article{lmt-asfms-84
, author =	"T. Lozano-P{\'e}rez and M. T. Mason and R. Taylor"
, title =	"Automatic Synthesis of Fine-Motion Strategies for Robots"
, journal =	"Internat. J. Robot. Res."
, volume =	3
, number =	1
, year =	1984
, update =	"93.09 milone+mitchell"
}

@article{lw-apcfp-79
, author =	"T. Lozano-P{\'e}rez and M. A. Wesley"
, title =	"An algorithm for planning collision-free paths among polyhedral obstacles"
, journal =	"Commun. ACM"
, volume =	22
, number =	10
, year =	1979
, pages =	"560--570"
, update =	"98.11 bibrelex"
}

@inproceedings{l-cvdmc-85
, author =	"M. Lu"
, title =	"Constructing the {Voronoi} diagram on a mesh-connected computer"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1985
, pages =	"806--811"
, update =	"98.07 bibrelex"
}

@inproceedings{l-dprcq-85
, author =	"A. Lubiw"
, title =	"Decomposing polygonal regions into convex quadrilaterals"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"97--106"
, cites =	"ahu-daca-74, cd-dpicp-79, eow-sgrag-84, f-spcwt-78, gj-cigtn-79, gjpt-tsp-78, k-dpsc-83, kkk-tgrfw-83, l-pftu-82, l-pnrh-82, lprs-meldr-, o-aprag-83, ps-dtram-80, lllmp-tddo2-79, s-oadrp-82, sh-gip-76, t-prgc-80, t-dsna-83, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@phdthesis{l-ocopg-85
, author =	"A. Lubiw"
, title =	"Ordering and some Combinatorial optimization Problems with some Geometric Applications"
, school =	"University of Waterloo"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@techreport{l-bbpcp-88
, author =	"A. Lubiw"
, title =	"The Boolean Basis Problem and how to Cover Polygons by Rectangles"
, type =	"Manuscript"
, institution =	"University of Waterloo"
, year =	1988
, update =	"98.07 bibrelex"
}

@inproceedings{lm-igvgs-94
, author =	"A. Lubiw and N. Mouawad"
, title =	"Interval Graphs as Visibility Graphs of Simple Polygons, Part I: Parachutes"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"18--23"
, cites =	"c-vpgr-92, o-agta-87, o-cgc18-93a, ec-rvgsp-90, g-rcvgs-88, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@techreport{lo-wcpfp-96
, author =	"A. Lubiw and J. O'Rourke"
, title =	"When can a polygon fold to a polytope?"
, type =	"Technical {Report}"
, number =	048
, institution =	"Dept. Comput. Sci., Smith College"
, month =	jun
, year =	1996
, note =	"Presented at AMS Conf., 5 Oct. 1996"
, keywords =	"polytopes"
, update =	"96.09 orourke"
}

@inproceedings{ls-mogar-93
, author =	"A. Lubiw and N. Sleumer"
, title =	"Maximal outerplanar graphs are relative neighborhood graphs"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"198--203"
, cites =	"am-rngtd-92a, bll-cpt-93t, c-psepg-92, d-rdt-90, jt-rngtr-92, ms-pggrg-80, o-agta-87, s-rngam-83, t-rngfp-80, u-spper-83, v-gng-92, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{lps-eerc-86
, author =	"A. Lubotzky and R. Phillips and P. Sarnak"
, title =	"Explicit expanders and the {Ramanujan} conjectures"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"240--246"
, precedes =	"lps-rg-88"
, update =	"98.11 bibrelex"
}

@article{lps-rg-88
, author =	"A. Lubotzky and R. Phillips and P. Sarnak"
, title =	"Ramanujan graphs"
, journal =	"Combinatorica"
, volume =	8
, year =	1988
, pages =	"261--277"
, succeeds =	"lps-eerc-86"
, update =	"98.11 bibrelex, 95.01 matousek"
}

@inproceedings{l-spami-85
, author =	"M. Luby"
, title =	"A Simple Parallel Algorithm for the Maximal Independent Set Problem"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"1--10"
, update =	"98.03 bibrelex"
}

@article{l-spami-86
, author =	"M. Luby"
, title =	"A simple parallel algorithm for the maximal independent set problem"
, journal =	"SIAM J. Comput."
, volume =	15
, number =	4
, year =	1986
, pages =	"1036--1053"
, update =	"96.09 orourke"
}

@inproceedings{l-rrpcw-88
, author =	"M. Luby"
, title =	"Removing randomness in parallel computation without a processor penalty"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"162--173"
, update =	"96.09 orourke"
}

@incollection{l-ggwpp-88
, author =	"M. G. Luby"
, title =	"Grid geometries which preserve properties of {Euclidean} geometry: a study of graphics line drawing algorithms"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"397--432"
, update =	"99.11 bibrelex"
}

@article{l-rgbth-88
, author =	"J. Lucas"
, title =	"The rotation graph of binary trees is {Hamiltonian}"
, journal =	"J. Algorithms"
, volume =	9
, year =	1988
, pages =	"503--535"
, update =	"97.11 bibrelex"
}

@article{lrr-rgbth-93
, author =	"J. Lucas and D. {Roelants van Baronaigien} and F. Ruskey"
, title =	"On rotations and the generation of binary trees {Hamiltonian}"
, journal =	"J. Algorithms"
, volume =	15
, year =	1993
, pages =	"343--366"
, update =	"97.11 bibrelex"
}

@article{lmw-nvg-87
, author =	"F. Luccio and S. Mazzone and C. Wong"
, title =	"A Note on Visibility Graphs"
, journal =	"Discrete Math."
, volume =	64
, year =	1987
, pages =	"209--219"
, keywords =	"graph drawing"
, update =	"94.01 tamassia, 93.09 tamassia"
}

@article{lp-ubrdb-89
, author =	"F. Luccio and L. Pagli"
, title =	"On The Upper Bound On The Rotation Distance Of Binary Trees"
, journal =	"Inform. Process. Lett."
, volume =	31
, number =	2
, month =	apr
, year =	1989
, pages =	"57--60"
, keywords =	"rotation distance, binary search trees, upper bounds, tree transformation algorithm"
, annote =	"Exhibits an algorithm to transform from one tree to
		 another by rotations."
, abstract =	"The rotation distance d(T//1,T//2) between two binary
		 search trees T//1 and T//2 on n nodes is the minimum
		 number of rotations needed to transform T//1 into T//2.
		 D.D. Sleator, R.E. Tarjan and W.R. Thurston have proved
		 an upper bound 2n minus 6 to d(T//1,T//2), using
		 triangulation of polyhedra. Makinen has subsequently
		 shown that a weaker upper bound of 2n minus 5 can be
		 simply proved with elementary tree concepts. In this
		 note we present a new tree transformation algorithm,
		 leading to an elementary proof of the bound 2n minus 6.
		 (Author abstract) 4 Refs."
}

@article{lpp-nsdsp-90
, author =	"F. Luccio and A. Pietracaprina and G. Pucci"
, title =	"A new scheme for the deterministic simulation of PRAMs in VLSI"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"529--544"
, update =	"96.09 orourke"
}

@article{l-srass-95
, author =	"W. Ludwig"
, title =	"A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem"
, journal =	"Inform. Comput."
, volume =	117
, number =	1
, year =	1995
, pages =	"151--155"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{le-vdsap-97
, author =	"David Luebke and Carl Erikson"
, title =	"View-Dependent Simplification of Arbitrary Polygonal Environments"
, booktitle =	"Proc. SIGGRAPH '97"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"ACM Press"
, month =	aug
, year =	1997
, pages =	"199--208"
, update =	"98.07 agarwal, 98.03 agarwal+mitchell"
}

@inproceedings{lg-pmsfe-95
, author =	"D. Luebke and C. Georges"
, title =	"Portals and mirrors: {Simple}, fast evaluation of potentially visible sets"
, booktitle =	"Proc. ACM Interactive 3D Graphics Conf."
, site =	"Monterey, CA"
, year =	1995
, update =	"98.07 bibrelex"
}

@inproceedings{l-dsorq-78
, author =	"G. S. Lueker"
, title =	"A data structure for orthogonal range queries"
, booktitle =	"Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1978
, pages =	"28--34"
, precedes =	"lw-dsdrq-82"
, update =	"97.11 bibrelex"
}

@techreport{l-tarrc-79
, author =	"G. S. Lueker"
, title =	"A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems"
, type =	"Report"
, number =	"R129"
, institution =	"Dept. Inform. Comput. Sci., Univ. California"
, address =	"Irvine, CA"
, year =	1979
}

@inproceedings{lmr-lptvp-86
, author =	"G. S. Lueker and N. Megiddo and V. Ramachandran"
, title =	"Linear programming with two variables per inequality in poly log time"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"196--205"
, keywords =	"parallel computation, linear programming, $d$-dimensional"
, precedes =	"lmr-lptvp-90"
}

@article{lmr-lptvp-90
, author =	"G. S. Lueker and N. Megiddo and V. Ramachandran"
, title =	"Linear programming with two variables per inequality in poly log time"
, journal =	"SIAM J. Comput."
, volume =	19
, year =	1990
, pages =	"1000--1010"
, keywords =	"parallel computation, linear programming, $d$-dimensional"
, succeeds =	"lmr-lptvp-86"
}

@article{lw-dsdrq-82
, author =	"G. S. Lueker and D. E. Willard"
, title =	"A data structure for dynamic range queries"
, journal =	"Inform. Process. Lett."
, volume =	15
, number =	5
, year =	1982
, pages =	"209--213"
, succeeds =	"l-dsorq-78"
, update =	"97.11 bibrelex"
}

@inproceedings{l-hdspl-89
, author =	"H. Lukatela"
, title =	"Hipparchus data structures: {Points}, lines and regions in spherical {Voronoi} grid"
, booktitle =	"Proc. 9th Internat. Sympos. Comput.-Assist. Cartog."
, year =	1989
, pages =	"164--170"
, update =	"93.05 freimer"
}

@techreport{lc-rtns-93
, author =	"W. L. Luken and F. Cheng"
, title =	"Rendering trimmed {NURB} surfaces"
, type =	"Research {Report}"
, number =	"18669 (81711)"
, institution =	"IBM Research Division"
, year =	1993
, update =	"97.11 bibrelex"
}

@inproceedings{l-nrftg-99
, author =	"T. Lukovszki"
, title =	"New results on fault tolerant geometric spanners"
, booktitle =	"Proc. 6th Workshop Algorithms Data Struct."
, nickname =	"WADS '99"
, site =	"Vancouver, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1663
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"193--204"
, update =	"00.03 smid, 99.11 bibrelex, 99.07 smid"
}

@phdthesis{l-nrgst-99
, author =	"T. Lukovszki"
, title =	"New results on geometric spanners and their applications"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Computer Science, University of Paderborn"
, address =	"Paderborn, Germany"
, year =	1999
, keywords =	"doctoral thesis"
, update =	"00.11 smid, 00.07 smid"
}

@article{l-marci-70
, author =	"V. Y. Lum"
, title =	"Multi-attribute retrieval with combined indexes"
, journal =	"Commun. ACM"
, volume =	13
, year =	1970
, pages =	"660--665"
}

@article{l-dpppa-87
, author =	"V. J. Lumelski"
, title =	"Dynamic path planning for planar articulated robot arm moving amidst moving obstacles"
, journal =	"Automatica"
, volume =	"??"
, year =	1987
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@inproceedings{ls-pivrn-88
, author =	"V. Lumelsky and T. Skewis"
, title =	"A paradigm for incorporating vision in the robot navigation function"
, booktitle =	"Proc. 1988 IEEE Internat. Conf. Robot. Autom."
, site =	"Philadelphia"
, month =	apr
, year =	1988
}

@article{l-csplp-91
, author =	"V. J. Lumelsky"
, title =	"A Comparative Study on the Path Length Performance of Maze-Searching and Robot Motion Planning Algorithms"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	7
, number =	1
, year =	1991
, pages =	"57--66"
}

@article{l-acirm-87
, author =	"V. J. Lumelsky"
, title =	"Algorithmic and Complexity Issues of Robot Motion in an Uncertain Environment"
, journal =	"J. Complexity"
, volume =	3
, year =	1987
, pages =	"146--182"
, update =	"96.09 devillers"
}

@inproceedings{l-aisbr-87
, author =	"V. J. Lumelsky"
, title =	"Algorithmic Issues of Sensor-Based Robot Motion Planning"
, booktitle =	"Proc. 26th IEEE Conf. Decision Control"
, year =	1987
, pages =	"1796--1801"
, update =	"98.03 mitchell"
}

@inproceedings{l-cmpue-86
, author =	"V. J. Lumelsky"
, title =	"Continous motion planning in unknown environment for a $3$d cartesian robot arm"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1986
, pages =	"1569--1574"
, update =	"98.03 bibrelex"
}

@article{l-ekdpp-87
, author =	"V. J. Lumelsky"
, title =	"Effect of Kinematics on Dynamic Path Planning for Planar Robot Arms Moving Amidst Unknown Obstacles"
, journal =	"Internat. J. Robot. Autom."
, volume =	"RA-3"
, number =	3
, year =	1987
, pages =	"207--223"
}

@article{l-fcdbl-85
, author =	"V. J. Lumelsky"
, title =	"On fast computation of distance between line segments"
, journal =	"Inform. Process. Lett."
, volume =	21
, year =	1985
, pages =	"55--61"
}

@article{lms-dppsb-90
, author =	"V. J. Lumelsky and S. Mukhopadhyay and K. Sun"
, title =	"Dynamic Path Planning in Sensor-Based Terrain Acquisition"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, number =	4
, month =	aug
, year =	1990
, pages =	"462--472"
}

@article{ls-irsrn-90
, author =	"V. J. Lumelsky and T. Skewis"
, title =	"Incorporating Range Sensing in the Robot Navigation Function"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	20
, number =	5
, year =	1990
, pages =	"1058--1069"
}

@article{ls-dppma-86
, author =	"V. J. Lumelsky and A. A. Stepanov"
, title =	"Dynamic Path Planning for a Mobile Automaton with Limited Information on the Environment"
, journal =	"IEEE Trans. Autom. Control"
, volume =	"AC-31"
, year =	1986
, pages =	"1058--1063"
}

@article{ls-ppspm-87
, author =	"V. J. Lumelsky and A. A. Stepanov"
, title =	"Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"403--430"
}

@article{ls-ummpu-90
, author =	"V. J. Lumelsky and K. Sun"
, title =	"A Unified Methodology for Motion Planning with Uncertainty for 2D and 3D Two-Link Robot Arm Manipulators"
, journal =	"Internat. J. Robot. Res."
, volume =	9
, number =	5
, year =	1990
, pages =	"89--104"
}

@article{ls-ppuoc-92
, author =	"V. J. Lumelsky and K. Sun"
, title =	"Path Planning Among Unknown Obstacles: {The} Case of a 3D Cartesian Arm"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	8
, number =	6
, year =	1992
, pages =	"??"
}

@inproceedings{ly-hamp-93
, author =	"C. Lund and M. Yannakakis"
, title =	"On the hardness of approximating minimization problems"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"286--293"
, update =	"98.03 bibrelex"
}

@article{ly-ohamp-94
, author =	"Carsten Lund and Mihalis Yannakakis"
, title =	"On the Hardness of Approximating Minimization Problems"
, journal =	"J. ACM"
, volume =	41
, number =	5
, year =	1994
, pages =	"960--981"
, update =	"98.03 agarwal"
}

@book{lw-tcc-69
, author =	"A. T. Lundell and S. Weingram"
, title =	"The topology of {CW} complexes"
, publisher =	"Van Nostrand"
, address =	"New York, NY"
, year =	1969
, update =	"98.03 bibrelex"
}

@techreport{l-imsim-95
, author =	"Mikael Lundquist"
, title =	"An implementation of a method for simulating injection moulding of non-planar objects"
, type =	"Technical {Report}"
, number =	"LiTH-MAT-R-95-09"
, institution =	"Link{\"o}ping University"
, month =	oct
, year =	1995
, keywords =	"injection molding, continuous Dijkstra, geodesic metric, shortest paths, wavefront propagation"
, update =	"96.05 mitchell"
}

@inproceedings{lm-pasnp-95
, author =	"J. Luo and K. Miriyala"
, title =	"A Practical Approach to Static Node Positioning"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"436--443"
, keywords =	"graph drawing, placement, system"
, update =	"95.01 tamassia"
}

@inproceedings{lmy-dcsds-96
, author =	"Robert Lupton and F. Miller Maley and Neal Young"
, title =	"Data Collection for the {Sloan} {Digital} {Sky} {Survey} -- {A} Network-Flow Heuristic"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"296--303"
, keywords =	"covering, capacitated covering of point sets, facility location, disk covers, sphere covers, implementation"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@inproceedings{lmk-vcpim-01
, author =	"A. M. Lyakh and V. S. Mukhanov and R. B. Kemp"
, title =	"The Virtual Cell Project for the Investigation of Microalgal Morphology and Dispersity of Natural Phytoplankton"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"57--58"
, update =	"01.04 icking"
}

@incollection{l-csbsu-90
, author =	"T. Lybrand"
, title =	"Computer simulation of biomolecular systems using molecular dynamics and free energy perturbation methods"
, editor =	"K. Lipkowitz and D. B. Boyd"
, booktitle =	"Reviews in Computational Chemistry"
, volume =	1
, publisher =	"VCH Publishers"
, year =	1990
, pages =	"295--320"
, update =	"98.07 bibrelex"
}

@article{lm-krpbc-87
, author =	"T. Lyche and K. Morken"
, title =	"Knot Removal for parametric B-spline curves and surfaces"
, journal =	"Comput. Aided Geom. Design"
, volume =	4
, number =	3
, year =	1987
, pages =	"217--230"
, update =	"98.07 bibrelex"
}

@article{lm-spmcp-96
, author =	"K. M. Lynch and M. T. Mason"
, title =	"Stable pushing: {M}echanics, controllability, and planning"
, journal =	"Internat. J. Robot. Res."
, volume =	15
, year =	1996
, pages =	"533--556"
, update =	"98.03 agarwal"
}

@inproceedings{l-cbagd-92
, author =	"K. Lyons"
, title =	"Cluster Busting in Anchored Graph Drawing"
, booktitle =	"Proceedings of the 1992 CAS Conference"
, year =	1992
, pages =	"7--16"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{lmr-mpcil-90
, author =	"K. Lyons and H. Meijer and D. Rappaport"
, title =	"Minimum polygon covers for isothetic line segments"
, type =	"Manuscript"
, institution =	"??"
, year =	1990
, note =	"In preparation"
, succeeds =	"lmr-mpsil-"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@mastersthesis{l-aiorp-88
, author =	"Kelly A. Lyons"
, title =	"An Efficient Algorithm for Identifying Objects Using Robot Probes"
, school =	"Queen's University, Kingston"
, month =	dec
, year =	1988
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@phdthesis{l-cbagd
, author =	"K. A. Lyons"
, title =	"Cluster Busting in Anchored Graph Drawing"
, school =	"??"
, note =	"in preparation"
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@article{lmr-acbag-98
, author =	"Kelly A. Lyons and Henk Meijer and David Rappaport"
, title =	"Algorithms for Cluster Busting in Anchored Graph Drawing"
, journal =	"J. Graph Algorithms Appl."
, volume =	2
, number =	1
, year =	1998
, pages =	"1--24"
, keywords =	"graph drawing, straight-line, interactive"
, update =	"98.07 tamassia"
}

@techreport{lmr-mpsil-
, author =	"Kelly A. Lyons and Henk Meijer and David Rappaport"
, title =	"Minimum polygon stabbers of isothetic line segments"
, institution =	"Dept. of Computing and Information Science, Queen's University"
, address =	"Ontario, Canada"
, precedes =	"lmr-mpcil-90"
, update =	"98.11 bibrelex"
}

@inproceedings{lmr-pvdcb-93
, author =	"K. A. Lyons and H. Meijer and D. Rappaport"
, title =	"Properties of the {Voronoi} Diagram Cluster Buster"
, editor =	"A. Gawman and W. M. Getleman and E. Kidd and P. Larson and J. Slonim"
, booktitle =	"Proc. 1993 CAS Conference"
, volume =	2
, publisher =	"IBM Canada Ltd. Laboratory Center for Advanced Studies and National Research Council Canada"
, address =	"Toronto, Ontario, Canada"
, month =	oct
, year =	1993
, pages =	"1148--1163"
, update =	"98.11 bibrelex"
}

@techreport{lr-eaiou-89t
, author =	"K. A. Lyons and D. Rappaport"
, title =	"An Efficient Algorithm for Identifying Objects Using Robot Probes"
, number =	"TR CISC 89-259"
, institution =	"Queen's University"
, address =	"Kingston, Ontario"
, year =	1989
, precedes =	"lr-eaiou-89, lr-eaiou-94"
, update =	"98.11 bibrelex"
}

@article{lr-eaiou-94
, author =	"K. A. Lyons and D. Rappaport"
, title =	"An efficient algorithm for identifying objects using robot probes"
, journal =	"Visual Comput."
, volume =	10
, year =	1994
, pages =	"452--458"
, succeeds =	"lr-eaiou-89t"
, update =	"98.11 bibrelex, 95.01 smid"
}

@inproceedings{lr-eaiou-89
, author =	"K. A. Lyons and D. H. Rappaport"
, title =	"An efficient algorithm for identifying objects using robot probes"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	7
, succeeds =	"lr-eaiou-89t"
, update =	"98.11 bibrelex"
}

@book{l-cfp-66
, author =	"L. A. Lyusternik"
, title =	"Convex Figures and Polyhedra"
, publisher =	"D. C. Heath"
, address =	"Boston, MA"
, year =	1966
, update =	"94.09 orourke"
}

@book{l-spvp-64
, author =	"L. A. Lyusternik"
, title =	"Shortest Paths: {Variational} Problems"
, publisher =	"Macmillan Company"
, address =	"New York"
, year =	1964
, update =	"93.09 milone+mitchell"
}

@phdthesis{m-bvdcd-00
, author =	"Lihong Ma"
, title =	"Bisectors and {Voronoi} Diagrams for Convex Distance Functions"
, school =	"Department of Computer Science, FernUniversit{\"a}t Hagen, Technical Report 267"
, year =	2000
, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr267.pdf"
, keywords =	"doctoral thesis"
, update =	"01.04 icking, 00.11 smid, 00.07 icking, 00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{m-eapls-94
, author =	"Wolfgang Maass"
, title =	"Efficient Agnostic {PAC}-Learning with Simple Hypotheses"
, booktitle =	"Proc. 7th Ann. ACM Conf. Comput. Learning Theory"
, nickname =	"COLT '94"
, year =	1994
, pages =	"67--75"
, update =	"00.11 smid, 00.07 icking, 98.03 bibrelex"
}

@article{m-cnc-86
, author =	"Wolfgang Maass"
, title =	"On the Complexity of Nonconvex Covering"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"453--467"
, update =	"00.11 smid, 00.07 icking"
}

@article{m-sfe-02
, author =	"F. Macaulay"
, title =	"Some Formulae in Elimination"
, journal =	"Proc. London Math. Soc."
, volume =	35
, year =	1902
, pages =	"3--27"
, update =	"97.11 bibrelex"
}

@article{m-tnhl-52
, author =	"A. M. Macbeath"
, title =	"A theorem on non-homogeneous lattices"
, journal =	"Ann. Math."
, volume =	56
, year =	1952
, pages =	"269--293"
, update =	"97.11 bibrelex"
}

@article{mb-hrtus-90
, author =	"J. MacDanold and K. Booth"
, title =	"Heuristics for ray tracing using space subdivision"
, journal =	"Visual Comput."
, volume =	6
, year =	1990
, pages =	"153--166"
, keywords =	"ray tracing"
, update =	"96.05 agarwal"
}

@article{ms-isp-96
, author =	"G. MacDonald and T. Shermer"
, title =	"Isomophism of spiral polygons"
, journal =	"Discrete Comput. Geom."
, volume =	16
, number =	2
, year =	1996
, pages =	"277--304"
, keywords =	"visibility graphs"
, update =	"97.11 orourke, 96.09 orourke"
}

@article{mp-atadp-91
, author =	"G. Macedonio and M. T. Pareschi"
, title =	"An Algorithm for the Triangulation of Arbitrarily Distributed Points: Applications to Volume Estimate and Terrain Fitting"
, journal =	"Comput. Geosci."
, volume =	17
, number =	7
, year =	1991
, pages =	"859--874"
, annote =	"Just Lee-Schachter Insertion algorithm. Includes C
		 code."
}

@techreport{m-psdss-85
, author =	"J. {MacGregor Smith}"
, title =	"Point set decomposition and suboptimal {Steiner} minimal trees"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Indust. Engrg. Oper. Res., Univ. Massachusetts Amherst"
, address =	"Amherst, MA"
, year =	1985
}

@inproceedings{m-ena2r-50
, author =	"C. Mack"
, title =	"The expected number of aggregates in $2$ random distribution of $n$ points"
, booktitle =	"Proc. Cambridge Phil. Soc."
, volume =	46
, year =	1950
, pages =	"285--292"
}

@article{m-scaac-72
, author =	"A. L. Mackay"
, title =	"Stereological Characteristics of Atomic Arrangements in Crystals"
, journal =	"Journal of Microscopy"
, volume =	95
, year =	1972
, pages =	"217--227"
, annote =	"{Voronoi} polyhedron as a model of crystal structures.
		 $O(N^3)$ algorithm to find one polyhedron (all triples
		 neighbouring)"
}

@inproceedings{ms-ufetp-91
, author =	"P. D. MacKenzie and Q. F. Stout"
, title =	"Ultra-fast expected time parallel algorithms"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"414--423"
, update =	"93.05 smid"
}

@article{m-adgpr-86
, author =	"J. D. Mackinley"
, title =	"Automating the Design of Graphical Presentations of Relational Information"
, journal =	"ACM Trans. Graph."
, volume =	5
, number =	2
, year =	1986
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{m-ipps-73
, author =	"A. K. Mackworth"
, title =	"Interpreting pictures of polyhedral scenes"
, journal =	"Artif. Intell."
, volume =	4
, year =	1973
, pages =	"121--137"
, update =	"97.11 bibrelex"
}

@inproceedings{m-smcam-67
, author =	"J. MacQueen"
, title =	"Some Methods for Classification and Analysis of Multivariate Observations"
, booktitle =	"Proceedings of the Fifth Berkeley Symposium on Math., Stat. and Prob."
, year =	1967
, pages =	"281--296"
, update =	"98.07 agarwal"
}

@inproceedings{mmph-pgle-96
, author =	"B. Madden and P. Madden and S. Powers and M. Himsolt"
, title =	"Portable Graph Layout and Editing"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"385--395"
, update =	"98.11 bibrelex, 98.07 vismara"
}

@inproceedings{my-mpacc-86
, author =	"S. Maddila and C. K. Yap"
, title =	"Moving a polygon around the corner in a corridor"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"187--192"
, cites =	"b-sfppg-83, m-damlr-86, s-wc-82, y-hmctd-87, y-amp-87, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{m-damlr-86
, author =	"S. R. Maddila"
, title =	"Decomposition algorithm for moving a ladder among rectangular obstacles"
, booktitle =	"Proc. of IEEE Inter. Conf. on Robotics and Automation"
, site =	"San Francisco"
, month =	apr
, year =	1986
, update =	"98.03 bibrelex"
}

@techreport{m-mpalr-??
, author =	"S. R. Maddila"
, title =	"Motion planning algorithm for a ladder among rectangular obstacles"
, type =	"Manuscript"
, institution =	"Dept. Elect. Comput. Engrg., Univ. Illinois"
, address =	"Urbana, IL"
, year =	"??"
}

@article{mk-impgo-84
, author =	"S. P. Madur and P. A. Koparkar"
, title =	"Interval Methods for Processing Geometric Objects"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"7--17"
, month =	feb
, year =	1984
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{m-up-93
, author =	"R. E. Maeder"
, title =	"Uniform Polyhedra"
, journal =	"The Mathematica Journal"
, volume =	3
, number =	4
, year =	1993
, pages =	"48--57"
, update =	"96.05 orourke"
}

@techreport{m-oe-80
, author =	"D. Maegher"
, title =	"Octree Encoding"
, type =	"Technical {Report}"
, number =	"TR-IPL-80-111"
, institution =	"Dept. Electrical Syst., Rensselaer Polytechnic Inst."
, address =	"Troy, NY"
, year =	1980
, update =	"97.11 bibrelex"
}

@article{m-dpgec-91
, author =	"H. Maehara"
, title =	"Dispersed points and geometric embeddings of complete bipartite graphs"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"57--67"
}

@article{m-htts-89
, author =	"H. Maehara"
, title =	"Helly-type theorems for spheres"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"279--285"
}

@article{m-nisud-89
, author =	"H. Maehara"
, title =	"Note on induced subgraphs of the unit distance graph {$E^n$}"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"15--18"
}

@article{m-gccrp-91
, author =	"H. Maehara"
, title =	"On {Graver}'s conjecture concerning the rigidity problem of graphs"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"339--342"
}

@inproceedings{mh-dges-89
, author =	"H. Maehara and M. Homma"
, title =	"Distance graphs in {Euclidean} space"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	29
}

@article{m-??-94
, author =	"J. Maekawa"
, title =	"??"
, journal =	"Oru"
, volume =	2
, number =	2
, year =	1994
, update =	"97.11 bibrelex"
}

@phdthesis{m-rcmsi-93
, author =	"T. Maekawa"
, title =	"Robust Computational Methods for Shape Interrogation"
, type =	"Ph.{D}. Thesis"
, school =	"Massachusetts Institute of Technology"
, address =	"Cambridge, Massachusetts"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"95.05 abrams"
}

@article{mp-csiop-93
, author =	"T. Maekawa and N. M. Patrikalakis"
, title =	"Computation of Singularities and Intersections of Offsets of Planar Curves"
, journal =	"Comput. Aided Geom. Design"
, volume =	10
, number =	5
, year =	1993
, pages =	"407--429"
, update =	"95.05 abrams+held"
}

@article{mp-idgdm-94
, author =	"T. Maekawa and N. M. Patrikalakis"
, title =	"Interrogation of Differential Geometry Properties for Design and Manufacture"
, journal =	"Visual Comput."
, volume =	10
, number =	4
, year =	1994
, pages =	"216--237"
, update =	"95.05 abrams"
}

@article{mwp-ulcsi-95
, author =	"T. Maekawa and F.-E. Wolter and N. M. Patrikalakis"
, title =	"Umbilics and Lines of Curvature for Shape Interrogation"
, journal =	"Comput. Aided Geom. Design"
, volume =	"??"
, year =	1995
, note =	"To appear"
, update =	"95.05 abrams"
}

@inproceedings{mf-cvmht-94
, author =	"P. Magillo and L. {De Floriani}"
, title =	"Computing visibility maps on hierarchical terrain models"
, booktitle =	"Proc. 2nd ACM Workshop on Advances in GIS"
, year =	1994
, pages =	""
, update =	"96.09 kreveld"
}

@inproceedings{mf-mmldo-96
, author =	"P. Magillo and L. {De Floriani}"
, title =	"Maintaining multiple levels of detail in the overlay of hierarchical subdivisions"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"190--195"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{mjs-spstg-83
, author =	"E. R. Magnus and C. C. Joyce and W. D. Scott"
, title =	"A Spiral Procedure for Selecting a Triangular Grid from Random Data"
, journal =	"Journal for Applied Mathematics and Physics (ZAMP)"
, volume =	34
, month =	mar
, year =	1983
, pages =	"231--235"
, annote =	"Constructs a spiral through successive convex hulls by
		 a variation of Jarvis scan. Spiral is then triangulated
		 (when a choice is possible Delaunay triangles are
		 chosen). Then switchings are applied to produce DT.
		 Claim measured $O(n^{1.6})$ but initial step is clearly
		 $O(n^2)$."
}

@book{mgr-gispa-91
, title =	"Geographical Information Systems: Principles and Applications"
, editor =	"D. J. Maguire and M. F. Goodchild and D. W. Rhind"
, publisher =	"Longman"
, address =	"London"
, year =	1991
, update =	"96.09 kreveld"
}

@phdthesis{m-pamlp-92
, author =	"Anil Maheshwari"
, title =	"Parallel algorithms for minimum link path and related problems"
, type =	"Ph.{D}. Dissertation"
, school =	"Univ. Bombay"
, address =	"Bombay, India"
, month =	feb
, year =	1992
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@article{ms-soarl-97
, author =	"A. Maheshwari and J.-R. Sack"
, title =	"Simple Optimal Algorithms for Rectilinear link Path and Polygon Separation Problems"
, journal =	"Parallel Processing Letter"
, volume =	"??"
, month =	jun
, year =	1997
, update =	"97.11 sack"
}

@incollection{msd-ldp-00
, author =	"Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack and Hristo N. Djidjev"
, title =	"Link Distance Problems"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"519--558"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 12 of su-hcg-00"
}

@inproceedings{msz-ioesp-01
, author =	"A. Maheshwari and M. Smid and N. Zeh"
, title =	"I/O-efficient shortest path queries in geometric spanners"
, booktitle =	"Proc. 7th Workshop Algorithms Data Struct."
, nickname =	"WADS '01"
, series =	"Lecture Notes Comput. Sci."
, volume =	2125
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"287--299"
, update =	"01.11 smid"
}

@inproceedings{mb-pachp-81
, author =	"S. N. Maheshwari and P. C. P. Bhatt"
, title =	"Parallel algorithms for the convex hull problems in two dimensions"
, booktitle =	"Conf. Analy. Prob. Classes Program. Parallel Comput."
, series =	"Lecture Notes Comput. Sci."
, volume =	111
, publisher =	"Springer-Verlag"
, year =	1981
, pages =	"358--372"
}

@article{mhm-cacjm-80
, author =	"K. W. Mahin and K. Hanson and J. W. {Morris Jr.}"
, title =	"Comparative analysis of the cellular and {Johnson-Mehl} microstructures through computer simulation"
, journal =	"Acta Metallurgica"
, volume =	"??"
, year =	1980
, update =	"97.11 bibrelex"
}

@article{m-idp-64
, author =	"K. Mahler"
, title =	"An inequality for the discriminant of polynomial"
, journal =	"Michigan Math. J."
, volume =	11
, year =	1964
, pages =	"257--262"
, update =	"98.03 bibrelex"
}

@incollection{m-ltn-76
, author =	"K. Mahler"
, title =	"Lectures on transcendental numbres"
, booktitle =	"??"
, series =	"Lecture Notes Math."
, volume =	546
, publisher =	"Springer-Verlag"
, year =	1976
, update =	"97.11 bibrelex"
}

@article{ms-hbt-81
, author =	"D. Maier and C. Salveter"
, title =	"Hysterical {B}-trees"
, journal =	"Inform. Process. Lett."
, volume =	12
, year =	1981
, pages =	"199--202"
, update =	"97.11 bibrelex"
}

@techreport{ms-hbt-79
, author =	"D. Maier and S. C. Salveter"
, title =	"Hysterical {B}-Trees"
, type =	"Technical {Report}"
, number =	"79/007"
, institution =	"Univ. Stony Brook"
, year =	1979
, update =	"97.11 bibrelex"
}

@techreport{m-mddlp-79
, author =	"M. Maille"
, title =	"Methodes d'evaluation de la precision d'une mesure ou d'un calcul numerique"
, type =	"Rapport {L.I.T.P.}"
, institution =	"Universite P. et M. Curie"
, address =	"Paris, France"
, year =	1979
, update =	"98.03 bibrelex"
}

@techreport{m-rlsi-81
, author =	"H. G. Mairson"
, title =	"Reporting line segment intersections"
, type =	"manuscript"
, year =	1981
, update =	"98.11 bibrelex"
}

@incollection{ms-rcibt-88
, author =	"H. G. Mairson and J. Stolfi"
, title =	"Reporting and counting intersections between two sets of line segments"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"307--325"
, update =	"97.03 schwarzkopf"
}

@inproceedings{mkfa-aascs-86
, author =	"M. A. Majewski and F. N. Krull and T. E. Fuhrman and P. J. Ainslie"
, title =	"Autodraft: Automatic Synthesis of Circuit Schematics"
, booktitle =	"Proc. IEEE Internat. Conf. on Computer-Aided Design"
, year =	1986
, pages =	"435--438"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@phdthesis{m-gmcad-98
, author =	"J. Majhi"
, title =	"Geometric Methods in Computer-Aided Design and Manufacturing"
, type =	"Ph.{D}. Thesis"
, school =	"University of Minnesota"
, address =	"Minneapolis"
, year =	1998
, keywords =	"doctoral thesis"
, update =	"98.11 smid"
}

@inproceedings{mgj-cfufp-96
, author =	"J. Majhi and P. Gupta and R. Janardan"
, title =	"Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"39--47"
, update =	"99.11 bibrelex, 98.07 bibrelex, 97.11 orourke"
}

@article{mgj-cfufp-99
, author =	"J. Majhi and P. Gupta and R. Janardan"
, title =	"Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"229--252"
, update =	"00.03 smid"
}

@techreport{mjssg-mssta-98
, author =	"J. Majhi and R. Janardan and J. Schwerdt and M. Smid and P. Gupta"
, title =	"Minimizing support structures and trapped area in two-dimensional layered manufacturing"
, type =	"Report"
, number =	1
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1998
, succeeds =	"mjsg-osgop-97i"
, update =	"00.03 smid, 98.03 smid"
}

@article{mjssg-mssta-99
, author =	"J. Majhi and R. Janardan and J. Schwerdt and M. Smid and P. Gupta"
, title =	"Minimizing support structures and trapped area in two-dimensional layered manufacturing"
, journal =	"Comput. Geom. Theory Appl."
, volume =	12
, year =	1999
, pages =	"241--267"
, succeeds =	"mjssg-osgop-98"
, update =	"00.03 smid, 99.07 smid"
}

@techreport{mjsg-osgop-97t
, author =	"J. Majhi and R. Janardan and M. Smid and P. Gupta"
, title =	"On some geometric optimization problems in layered manufacturing"
, type =	"Report"
, number =	1
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1997
, update =	"97.11 smid, 97.03 smid"
}

@inproceedings{mjsg-osgop-97i
, author =	"J. Majhi and R. Janardan and M. Smid and P. Gupta"
, title =	"On some geometric optimization problems in layered manufacturing"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"136--149"
, update =	"99.07 bibrelex, 97.11 smid"
}

@techreport{mjsg-osgop-98
, author =	"J. Majhi and R. Janardan and M. Smid and P. Gupta"
, title =	"On some geometric optimization problems in layered manufacturing"
, type =	"Report"
, number =	2
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1998
, succeeds =	"mjsg-osgop-97i"
, update =	"98.03 smid"
}

@article{mjsg-osgop-99
, author =	"J. Majhi and R. Janardan and M. Smid and P. Gupta"
, title =	"On some geometric optimization problems in layered manufacturing"
, journal =	"Comput. Geom. Theory Appl."
, volume =	12
, year =	1999
, pages =	"219--239"
, succeeds =	"mjsg-osgop-98"
, update =	"99.07 smid"
}

@techreport{mjss-mcgop-98t
, author =	"J. Majhi and R. Janardan and M. Smid and J. Schwerdt"
, title =	"Multi-criteria geometric optimization problems in layered manufacturing"
, type =	"Report"
, number =	4
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1998
, update =	"98.07 smid, 98.03 smid"
}

@inproceedings{mjss-mcgop-98i
, author =	"J. Majhi and R. Janardan and M. Smid and J. Schwerdt"
, title =	"Multi-criteria geometric optimization problems in layered manufacturing"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"19--28"
, update =	"98.07 smid"
}

@article{m-dmpcg-90
, author =	"V. V. Makeev"
, title =	"The degree of a mapping in some problems in combinatiorial geometry"
, journal =	"J. of Soviet Math."
, volume =	51
, number =	5
, month =	oct
, year =	1990
, note =	"Plenum Publ. Corp."
, update =	"98.11 bibrelex"
}

@inproceedings{md-sepct-93
, author =	"I. M{\"a}kel{\"a} and A. Dolenc"
, title =	"Some efficient procedures for correcting triangulated models"
, booktitle =	"Proc. Sympos. on Solid Freeform Fabrication"
, site =	"Austin, TX"
, organization =	"Dept. Mech. Eng., Univ. Texas Austin"
, year =	1993
, update =	"98.07 bibrelex"
}

@article{mrg-vqsc-85
, author =	"J. Makhoul and S. Roucos and H. Gish"
, title =	"Vector Quantization in Speech Coding"
, journal =	"Proc. IEEE"
, volume =	73
, number =	11
, month =	nov
, year =	1985
, pages =	"1551--1588"
, update =	"98.07 agarwal"
}

@techreport{m-nmhdb-88
, author =	"E. Makinen"
, title =	"A Note on the Median Heuristic for Drawing Bipartite Graphs"
, number =	"A-1988-4"
, institution =	"Department of Computer Science, University of Tampere"
, month =	may
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{m-ed2lh-88
, author =	"E. Makinen"
, title =	"Experiments of Drawing 2-Level Hierarchical Graphs"
, number =	"A-1988-1"
, institution =	"Department of Computer Science, University of Tampere"
, month =	jan
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{m-ed2lh-90
, author =	"E. M{\"a}kinen"
, title =	"Experiments on Drawing 2-Level Hierarchical Graphs"
, journal =	"Internat. J. Comput. Math."
, volume =	36
, year =	1990
, pages =	"175--181"
, update =	"98.07 vismara"
}

@misc{m-hdh-89
, author =	"E. Makinen"
, title =	"How to Draw a Hypergraph"
, institution =	"Department of Computer Science, University of Tampere"
, year =	1989
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{m-cl-88
, author =	"E. Makinen"
, title =	"On Circular Layouts"
, journal =	"Internat. J. Comput. Math."
, volume =	24
, year =	1988
, pages =	"29--37"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{m-drbg-90
, author =	"E. Makinen"
, title =	"On Drawing Regular Bipartite Graphs"
, number =	"A-1990-8"
, institution =	"Department of Computer Science, University of Tampere"
, year =	1990
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{m-rahdb-90
, author =	"E. Makinen"
, title =	"Remarks on the Assignment Heuristic for Drawing Bipartite Graphs"
, number =	"A-1990-7"
, institution =	"Department of Computer Science, University of Tampere"
, year =	1990
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{mt-fpior-97
, author =	"Christos Makris and Athanasios Tsakalidis"
, title =	"Fast Piercing of Iso--Oriented Rectangles"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"217--222"
, update =	"97.11 jones"
}

@phdthesis{m-slwr-87
, author =	"F. M. Maley"
, title =	"Single-Layer Wire Routing"
, school =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, month =	aug
, year =	1987
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@book{m-slwrc-90
, author =	"F. M. Maley"
, title =	"Single-Layer Wire Routing and Compaction"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1990
, update =	"98.07 bibrelex"
}

@inproceedings{mp-arpg-92
, author =	"S. Malitz and A. Papakostas"
, title =	"On the Angular Resolution of Planar Graphs"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"527--538"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{mp-arpg-94
, author =	"S. Malitz and A. Papakostas"
, title =	"On the Angular Resolution of Planar Graphs"
, journal =	"SIAM J. Discrete Math."
, volume =	7
, year =	1994
, pages =	"172--183"
, keywords =	"graph drawing"
, succeeds =	"mp-arpg-92"
, update =	"95.01 tamassia"
}

@article{m-cqrbb-96
, author =	"P. Malraison"
, title =	"Constraining a quadratic rational {Bezier} to be an elliptical arc"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"435--441"
, update =	"97.03 devillers"
}

@article{m-apmpg-76
, author =	"G. K. Manacher"
, title =	"An application of pattern matching to a problem in geometrical complexity"
, journal =	"Inform. Process. Lett."
, volume =	5
, year =	1976
, pages =	"6--7"
, precedes =	"a-cgmap-78"
}

% no relation to 395
@inproceedings{mz-fseac-78
, author =	"G. K. Manacher and A. L. Zobrist"
, title =	"A fast, space-efficient average-case algorithm for the ``greedy'' triangulation of a point set, and a proof that the greedy triangulation is not approximately optimal"
, booktitle =	"Proc. 16th Allerton Conf. Commun. Control Comput."
, year =	1978
, pages =	"824--832"
}

@article{mz-ngndt-79
, author =	"G. K. Manacher and A. L. Zobrist"
, title =	"Neither the greedy nor the {Delaunay} triangulation of a planar point set approximates the optimal triangulation"
, journal =	"Inform. Process. Lett."
, volume =	9
, year =	1979
, pages =	"31--34"
}

@incollection{mz-pmhfa-83
, author =	"Glenn K. Manacher and Albert L. Zobrist"
, title =	"Probabilistic Methods with Heaps for Fast Average-Case Greedy Algorithms"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"261--278"
, update =	"01.04 icking, 93.09 erickson"
, annote =	"By using a $O(1)$ ``pretest'' for edges to be added
		 get average case $\Theta(n^2)$ algorithm for Greedy
		 Triangulation."
}

@inproceedings{mms-caolp-88
, author =	"M. S. Manasse and L. A. McGeoch and D. D. Sleator"
, title =	"Competitive Algorithms for On-line Problems"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, month =	may
, year =	1988
, pages =	"322--333"
, update =	"94.05 franciosa"
}

@article{m-mfavc-69
, author =	"M. Manav"
, title =	"Methods for finding all vertices of a convex polyhedron"
, journal =	"Ekonom. Mat. Obzor"
, volume =	5
, year =	1969
, pages =	"325--342"
}

@article{mn-favcp-68
, author =	"M. Manav and J. Nedoma"
, title =	"Finding all vertices of a convex polyhedron"
, journal =	"Numer. Math."
, volume =	12
, year =	1968
, pages =	"226--229"
}

@book{m-iaca-89
, author =	"U. Manber"
, title =	"Introduction to Algorithms: A Creative Approach"
, publisher =	"Addison-Wesley"
, year =	1989
, update =	"98.07 bibrelex"
}

@techreport{mt-pnadt-82
, author =	"U. Manber and M. Tompa"
, title =	"Probabilistic, Nondeterministic and Alternating Decision Trees"
, type =	"Technical {Report}"
, number =	"82-03-01"
, institution =	"Univ. Washington"
, year =	1982
, update =	"98.03 bibrelex"
}

@article{mt-cppna-85
, author =	"U. Manber and M. Tompa"
, title =	"The complexity of problems on probabilistic, nondeterministic, and alternating decision trees"
, journal =	"J. ACM"
, volume =	32
, number =	3
, year =	1985
, pages =	"720--732"
, keywords =	"lower bounds"
}

@phdthesis{m-tom-82
, author =	"A. Mandel"
, title =	"Topology of Oriented Matroids"
, school =	"Univ. Waterloo"
, address =	"Waterloo"
, year =	1982
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@article{mc-dmsoc-72
, author =	"P. Mandel and C. Chryssostomidis"
, title =	"A Design Methodology for Ships and Other Complex Systems"
, journal =	"Philosophical Transactions of the Royal Society of London"
, volume =	"A 273"
, year =	1972
, pages =	"85--98"
, update =	"95.05 abrams"
}

@article{ml-sipat-91
, author =	"A. Mangen and N. Lasudry"
, title =	"Search for the Intersection Polygon of any Two Polygons: Application at the Garment Industry"
, journal =	"Comput. Graph. Forum"
, volume =	10
, number =	3
, month =	sep
, year =	1991
, pages =	"195--208"
, update =	"93.09 held"
}

@inproceedings{m-tha-89
, author =	"P. Mani-Levitska"
, title =	"Types of Hyperplane Arrangements"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{mw-posfp-85
, author =	"M. Mani and R. D. W. Wilson"
, title =	"A programmable orienting system for flat parts"
, booktitle =	"Proc. North American Mfg. Research Inst. Conf XIII"
, year =	1985
, update =	"98.07 bibrelex"
}

@article{mw-nlerp-88
, author =	"H. Mannila and D. Wood"
, title =	"A note on the largest empty rectangle problem"
, journal =	"BIT"
, volume =	28
, year =	1988
, pages =	"179--183"
}

@techreport{mw-sprag-84
, author =	"H. Mannila and D. Wood"
, title =	"A simple proof of the rectilinear art gallery theorem"
, type =	"Report"
, number =	"C-1984-16"
, institution =	"Dept. Comput. Sci., Univ. Helsinki"
, address =	"Helsinki, Finland"
, year =	1984
, precedes =	"mw-sprag-85"
}

@article{mw-sprag-85
, author =	"H. Mannila and D. Wood"
, title =	"A simple proof of the rectilinear art gallery theorem"
, journal =	"Internat. J. Comput. Math."
, volume =	17
, year =	1985
, pages =	"141--149"
, succeeds =	"mw-sprag-84"
}

@inproceedings{maclp-sdggs-95
, author =	"J. Manning and M. Atallah and K. Cudjoe and J. Lozito and R. Pacheco"
, title =	"A System for Drawing Graphs with Geometric Symmetry"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"262--265"
, keywords =	"graph drawing, system, symmetry"
, update =	"95.01 tamassia"
}

@techreport{ma-fddso-86
, author =	"J. Manning and M. J. Atallah"
, title =	"Fast Detection and Display of Symmetry in Outerplanar Graphs"
, number =	"CSD-TR-606"
, institution =	"Department of Computer Science, Purdue University"
, year =	1986
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ma-fddst-88
, author =	"J. Manning and M. J. Atallah"
, title =	"Fast Detection and Display of Symmetry in Trees"
, journal =	"Congr. Numer."
, volume =	64
, year =	1988
, pages =	"159--169"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{mc-nasi-91
, author =	"D. Manocha and J. F. Canny"
, title =	"A new approach for surface intersection"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	4
, year =	1991
, pages =	"491--516"
, keywords =	"surface, curve, intersection, solid modeling, resultants, matrix operations"
}

@article{mzw-camcu-95
, author =	"D. Manocha and Y. Zhu and W. Wright"
, title =	"Conformational analysis of molecular chains using nano-kinematics"
, journal =	"Computer Application of Biological Sciences (CABIOS)"
, volume =	11
, number =	1
, year =	1995
, pages =	"71--86"
, update =	"98.07 bibrelex"
}

@article{mpss-istma-93
, author =	"Y. Mansour and J. Park and B. Schieber and S. Sen"
, title =	"Improved selection in totally monotone arrays"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"115--132"
, keywords =	"Planar distance, convex polygons, totally monotone arrays, Monge arrays"
, update =	"96.09 devillers"
}

@inproceedings{mt-rltcp-87
, author =	"M. Mansouri and G. T. Toussaint"
, title =	"On the reachability of a ladder in two convex polygons"
, booktitle =	"Proc. 13th IFIP Conf. on System Modelling and Optimization"
, site =	"Tokyo, Japan"
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{mt-tqcp-85
, author =	"M. Mansouri and G. T. Toussaint"
, title =	"Translation queries for convex polygons"
, booktitle =	"Proc. IASTED, International Symposium on Robotics and Automation"
, site =	"Lugano, Switzerland"
, year =	1985
, update =	"98.07 bibrelex"
}

@article{mt-tqcp-86
, author =	"M. Mansouri and G. T. Toussaint"
, title =	"Translation queries for convex polygons"
, journal =	"Internat. J. Robot. Autom."
, volume =	1
, number =	3
, year =	1986
, pages =	"90--95"
, update =	"96.09 devillers, 94.05 devillers, 93.09 milone+mitchell"
}

@article{m-nmseo-84
, author =	"M. M{\"a}ntyl{\"a}"
, title =	"A Note on the Modeling Space of {Euler} Operators"
, journal =	"Comput. Vison Graph. Image Process."
, volume =	26
, year =	1984
, pages =	"45--60"
, update =	"98.03 bibrelex"
}

@book{m-ism-88
, author =	"M. M{\"a}ntyl{\"a}"
, title =	"An Introduction to Solid Modeling"
, publisher =	"Computer Science Press"
, address =	"Rockville, MD"
, year =	1988
, update =	"93.09 devillers+goodrich"
}

@techreport{m-ismp1-84
, author =	"M. M{\"a}ntyl{\"a}"
, title =	"An introduction to solid modeling, part {I}: fundamentals"
, type =	"Report"
, number =	"HTKK-TKO-C10"
, institution =	"Lab. Inform. Process., Helsinki Univ. Tech."
, address =	"Helsinki, Finland"
, year =	1984
}

@techreport{m-ismp2-84
, author =	"M. M{\"a}ntyl{\"a}"
, title =	"An introduction to solid modeling, part {II}: boundary models"
, type =	"Report"
, number =	"HTKK-TKO-C11"
, institution =	"Lab. Inform. Process., Helsinki Univ. Tech."
, address =	"Helsinki, Finland"
, year =	1984
}

@techreport{m-ismp3-84
, author =	"M. M{\"a}ntyl{\"a}"
, title =	"An introduction to solid modeling, part {III}: advanced topics"
, type =	"Report"
, number =	"HTKK-TKO-C12"
, institution =	"Lab. Inform. Process., Helsinki Univ. Tech."
, address =	"Helsinki, Finland"
, year =	1984
}

@article{m-ctstm-83
, author =	"M. J. M{\"a}ntyl{\"a}"
, title =	"Computational topology: a study of topological manipulations and interrogations in computer graphics and geometric modeling"
, journal =	"Acta Polytech. Scand. Math. Comput. Sci. Ser."
, volume =	37
, year =	1983
, pages =	"??"
}

@article{ms-gsmeo-82
, author =	"M. J. M{\"a}ntyl{\"a} and R. Sulonen"
, title =	"{GWB}: {A} solid modeler with {Euler} operators"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	2
, number =	5
, year =	1982
, pages =	"17--31"
}

@article{msv-pedse-86
, author =	"Y. Maon and B. Schieber and U. Vishkin"
, title =	"Parallel Ear Decomposition Search (EDS) and $st$-Numbering in Graphs"
, journal =	"Theoret. Comput. Sci."
, volume =	47
, year =	1986
, pages =	"277--298"
, update =	"94.05 tamassia"
}

@inproceedings{m-hphc-90
, author =	"D. Maple"
, title =	"A hierarchy preserving hierarchical compaction"
, booktitle =	"Proc. 27th Design Autom. Conf."
, year =	1990
, pages =	"375--381"
, update =	"98.03 bibrelex"
}

@incollection{maf-dgoap-96
, author =	"C. D. Maranas and I. P. Androulakis and C. A. Floudas"
, title =	"A deterministic global optimization approach for the protein folding problem"
, editor =	"P. M. Pardalos and D. Shalloway and G. Xue"
, booktitle =	"Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	23
, publisher =	"America Mathematical Society"
, year =	1996
, pages =	"133--150"
, update =	"02.03 orourke"
}

@article{mm-sscep-73
, author =	"J. Marasa and D. Matula"
, title =	"A Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics"
, journal =	"IEEE Trans. Comput."
, volume =	"C-22"
, number =	6
, month =	jun
, year =	1973
, pages =	"587--597"
, update =	"98.03 bibrelex"
}

@article{mbhrr-shudg-95
, author =	"M. V. Marathe and H. Breu and H. B. {Hunt III} and S. S. Ravi and D. J. Rosenkrantz"
, title =	"Simple heuristics for unit disk graphs"
, journal =	"Networks"
, volume =	25
, year =	1995
, pages =	"59--68"
, update =	"97.07 agarwal"
}

@inproceedings{mhr-gbaig-92
, author =	"M. V. Marathe and H. B. {Hunt III} and S. S. Ravi"
, title =	"Geometry-based approximations for intersection graphs"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"244--249"
, cites =	"ccj-udg-90, cs-splg-88, gj-cigtn-79, g-agtpg-80, hm-ascpp-85, be-lrtaw-85, b-aancp-83, fr-amdst-92, gl-ofcg-88, h-fata-80, h-ebssv-83, i-cigol-90, i-amids-91, k-amrts-84, s-caig-87, yws-opmtd-84, wk-stglp-88, be-avcpg-82, kt-eprc-81, r-gtaps-78, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{mrhr-hsudg-93
, author =	"M. V. Marathe and V. Radhakrishnan and H. B. {Hunt III} and S. S. Ravi"
, title =	"Hierarchically Specified Unit Disk Graphs"
, booktitle =	"Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '93"
, institution =	"SUNY Albany"
, year =	1993
, pages =	"??"
, update =	"98.07 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{m-csgcf-96
, author =	"Pedro V. Marcal"
, title =	"Constructive solid geometry, the CAD-FEM connection"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"157--167"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{m-pcppi-81
, author =	"A. Marchetti-Spaccamela"
, title =	"The $p$-center problem in the plane is {NP}-complete"
, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
, year =	1981
, pages =	"31--40"
}

@inproceedings{ms-fmapp-89
, author =	"O. Marcotte and Subhash Suri"
, title =	"Fast matching algorithms for points on a polygon"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"60--65"
, succeeds =	"ms-gm-89"
, precedes =	"ms-fmapp-91"
, update =	"98.03 mitchell"
}

@article{ms-fmapp-91
, author =	"O. Marcotte and Subhash Suri"
, title =	"Fast matching algorithms for points on a polygon"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"405--422"
, succeeds =	"ms-fmapp-89"
, update =	"98.03 mitchell"
}

@inproceedings{ms-gm-89
, author =	"O. Marcotte and Subhash Suri"
, title =	"On geometric matching"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"302--314"
, precedes =	"ms-fmapp-89"
, cites =	"akt-om-84, a-nemts-83, c-wcanh-76, df-pamwe-84, gh-ospqs-87, kl-tscap-75, kk-altag-88, k-aapge-78, l-conm-76, ps-coac-82, v-ghm-88, wpmk-bgmpl-86, e-mmpv-65, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{mkb-ma-79
, author =	"K. V. Mardia and J. T. Kent and J. M. Bibby"
, title =	"Multivariate Analysis"
, journal =	"Academic Press"
, volume =	"??"
, year =	1979
, pages =	"213--250"
, update =	"01.07 devillers, 98.07 bibrelex"
}

@inproceedings{m-paice-78
, author =	"M. Marek-Sadowska"
, title =	"Planarization Algorithms for Integrated Circuits Engineering"
, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
, year =	1978
, pages =	"919--923"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ml-cascv-89
, author =	"M. Maresca and H. Li"
, title =	"Connection autonomy and {SIMD} computers: a {VLSI} implementation"
, journal =	"J. Parallel Distrib. Comput."
, volume =	7
, year =	1989
, pages =	"302--320"
, update =	"98.11 bibrelex"
}

@article{m-egtcc-88
, author =	"G. A. Margulis"
, title =	"Explicit group-theoretical constructions of combinatorial schemes and their applications to the design of expanders and superconcentrators"
, journal =	"Problemy Peredachi Informatsii"
, volume =	24
, year =	1988
, pages =	"51--60"
, note =	"In Russian, Englisch Translation in Problems of Information Transmission 24, 39-46"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{mu-ps-94
, author =	"A. Mariano and L. Upson"
, title =	"Penumbral Shadows"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	390
, keywords =	"video review"
, cites =	"hs-rt-67, fdfh-cgpp-90, v-gspc-92, t-caals-92, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones"
}

@techreport{mlk-mstmw-76
, author =	"D. M. Mark and J. J. Little and D. G. Kirkpatrick"
, title =	"Minimum spanning trees and minimum weight triangulations"
, type =	"Report"
, number =	8
, institution =	"Geog. Data Struct. Project, Simon Fraser Univ."
, address =	"Burnaby, BC"
, year =	1976
, keywords =	"survey paper, design of algorithms, triangulations, minimum spanning trees"
}

@article{mnp-gg-90
, author =	"X. Markenscoff and L. Ni and C. H. Papadimitriou"
, title =	"The geometry of grasping"
, journal =	"Internat. J. Robot. Res."
, volume =	9
, number =	1
, month =	feb
, year =	1990
, update =	"98.03 bibrelex"
}

@article{mnp-ogp-89
, author =	"X. Markenscoff and L. Ni and Ch. H. Papadimitriou"
, title =	"Optimal Grip of a Polygon"
, journal =	"Internat. J. Robot. Res."
, volume =	8
, number =	2
, year =	1989
, pages =	"17--29"
, update =	"98.07 bibrelex"
}

@article{mw-fowf-80
, author =	"G. Markowsky and M. A. Wesley"
, title =	"Fleshing out wire frames"
, journal =	"IBM J. Res. Develop."
, volume =	24
, number =	5
, year =	1980
, pages =	"582--597"
}

@article{m-fsndt-91
, author =	"J. Marks"
, title =	"A formal specification for network diagrams that facilitates automated design"
, journal =	"J. Visual Lang. Comput."
, volume =	2
, year =	1991
, pages =	"395--414"
, keywords =	"graph drawing"
, update =	"94.01 tamassia"
}

@article{m-rtisu-86
, author =	"E. Marom"
, title =	"Real-time image subtraction using a liquid crystal light valve"
, journal =	"Optical. Eng."
, volume =	25
, number =	2
, year =	1986
, pages =	"274--276"
, update =	"97.11 bibrelex"
}

@book{m-vcihr-82
, author =	"D. Marr"
, title =	"Vision: {A} computational investigation into human representation and processing of visual information"
, publisher =	"W. H. Freeman"
, year =	1982
, update =	"98.03 bibrelex"
}

@techreport{mn-rrsot-77
, author =	"D. Marr and H. K. Nishihara"
, title =	"Representation and recognition of the spatial organization of three dimensional shapes"
, type =	"Report"
, number =	"AIM 416"
, institution =	"Comput. Sci. Lab., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1977
}

@article{mps-woaas-92
, author =	"C. Martel and A. Park and R. Subramonian"
, title =	"Work-optimal asynchronous algorithms for shared memory parallel computers"
, journal =	"SIAM J. Comput."
, volume =	21
, number =	6
, year =	1992
, pages =	"1070--1099"
, update =	"96.09 orourke"
}

@inproceedings{msp-apaag-90
, author =	"C. Martel and R. Subramonian and A. Park"
, title =	"Asynchronous {PRAM}s are (almost) as good as Synchronous {PRAM}s"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"590--599"
, update =	"96.09 orourke"
}

@book{m-jtlfe-62
, author =	"G. Martelli"
, title =	"Jemmy Twitcher - {A} Life of the Fourth Earl of Sandwich, 1718-1792"
, publisher =	"Jonathan Cape"
, address =	"London, UK"
, year =	1962
, update =	"98.07 bibrelex"
}

@techreport{m-spai3-91
, author =	"A. Martin"
, title =	"A simple primal algorithm for intersecting $3$-polyhedra in linear time"
, type =	"Technical {Report}"
, number =	"91-16"
, institution =	"Dept. Comput. Sci., Univ. British Columbia"
, address =	"Vancouver, BC"
, year =	1991
, update =	"98.03 bibrelex"
}

@book{m-tgis-66
, author =	"G. E. Martin"
, title =	"Transformation Geometry: An Introduction to Symmetry"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1966
, precedes =	"m-tgis-82"
, update =	"97.11 bibrelex"
}

@book{m-tgis-82
, author =	"G. E. Martin"
, title =	"Transformation Geometry: An Introduction to Symmetry"
, publisher =	"Springer-Verlag"
, year =	1982
, succeeds =	"m-tgis-66"
, update =	"97.11 bibrelex"
}

@article{m-sp628-65
, author =	"J. L. Martin"
, title =	"Solution to problem 62-8, spatial navigation"
, journal =	"SIAM Rev."
, volume =	7
, year =	1965
, pages =	"132--134"
}

@article{ma-vdomv-83
, author =	"W. N. Martin and J. K. Aggarwal"
, title =	"Volumetric description of objects from multiple views"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	5
, year =	1983
, pages =	"150--158"
, update =	"98.11 bibrelex"
}

@article{mbddl-fnapm-93
, author =	"Y. Martin and M. Bures and E. Danaher and J. DeLazzer and I. Lico"
, title =	"A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists"
, journal =	"J. Computer Aided Molecular Design"
, volume =	7
, year =	1993
, pages =	"83--102"
, update =	"98.07 bibrelex"
}

@incollection{mbw-sdtds-90
, author =	"Y. C. Martin and M. G. Bures and P. Willet"
, title =	"Searching databases of three-dimensional structures"
, editor =	"K. Lipkowitz and D. B. Boyd"
, booktitle =	"Reviews in Computational Chemistry"
, volume =	1
, publisher =	"VCH Publishers"
, year =	1990
, pages =	"213--256"
, update =	"98.07 bibrelex"
}

@article{ms-chrfm-
, author =	"T. Martinetz and K. Schulten"
, title =	"Competitive {Hebain} rule forms manifold representing networks"
, journal =	"Neural Networks"
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@article{m-cpwpb-91
, author =	"H. Martini"
, title =	"Convex polytopes whose projections bodies and difference sets are polars"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"83--91"
}

@article{ms-mcppd-98
, author =	"H. Martini and V. Soltan"
, title =	"Minimum convex partition of polygonal domains by guillotine cuts"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"291--304"
, update =	"01.07 orourke"
}

@inproceedings{mmw-occha-96
, author =	"V. Martynchik and N. Metelski and D. Wood"
, title =	"{O-Convexity}: {Computing} hulls, approximations, and orientation sets"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"2--7"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{m-pdibp-72
, author =	"K. Maruyama"
, title =	"A procedure to determine intersections between polyhedral objects"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	1
, year =	1972
, pages =	"255--266"
}

@techreport{m-svsp-72
, author =	"K. Maruyama"
, title =	"A study of visual shape perception"
, type =	"Report"
, number =	"UIUCDCS-R-72-533"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1972
}

@inproceedings{m-pprsp-98
, author =	"Michael N. Maryukov"
, title =	"Problems of Pattern Recognition on the Set of Polyhedra and their Plane Images"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"115--116"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{mn-ekbps-01
, author =	"A. Marzetta and J. Nievergelt"
, title =	"Enumerating the {$k$} best plane spanning trees"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"55--64"
, update =	"01.04 smid"
}

@mastersthesis{m-aert-95
, author =	"T. Masada"
, title =	"An Algorithm for the Enumeration of Regular Triangulations"
, school =	"Department of Information Science, University of Tokyo"
, address =	"Tokyo, Japan"
, month =	mar
, year =	1995
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@techreport{m-ossae-94
, author =	"T. Masada"
, title =	"An Output Size Sensitive Algorithm for the Enumeration of Regular Triangulations"
, type =	"Technical {Report}"
, number =	"94-1"
, institution =	"Department of Information Science, University of Tokyo"
, address =	"Tokyo, Japan"
, month =	nov
, year =	1994
, update =	"97.11 bibrelex"
}

@inproceedings{mii-ert-96
, author =	"Tomonari Masada and Hiroshi Imai and Keiko Imai"
, title =	"Enumeration of Regular Triangulations"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"224--233"
, cites =	"af-pachv-92, bfs-ccsp-90, c-ochan-91, l-crtpc-94, lst-gbtsh-95, es-itfwr-92, f-iradr-95, gkz-drmd-94, j-3dtlt-89, l-rtp-91, m-ossae-94, m-aert-95, r-dchhd-92, s-chdch-86, s-gbtv-91, s-gbcp-95, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@techreport{m-ncscp-78
, author =	"W. J. Masek"
, title =	"Some NP-complete Set Covering Problems"
, type =	"Manuscript"
, institution =	"MIT"
, year =	1978
, update =	"98.07 bibrelex"
}

@unpublished{m-snpcs-79
, author =	"W. J. Masek"
, title =	"Some {NP}-complete set covering problems"
, year =	1979
, note =	"unpublished manuscript"
, update =	"97.11 bibrelex"
}

@article{ma-oaslm-89
, author =	"J. Maserjian and P. O. Anderson"
, title =	"Optically addressed spatial light modulator by {MBE} - grown nipi {MQW} structures"
, journal =	"Appl. Optics"
, volume =	28
, number =	22
, year =	1989
, pages =	"4801--4807"
, update =	"97.11 bibrelex"
}

@inproceedings{m-apfmc-84
, author =	"M. T. Mason"
, title =	"Automatic planning of fine motions: Correctness and completeness"
, booktitle =	"IEEE International Conference on Robotics"
, year =	1984
, update =	"98.03 bibrelex"
}

@article{m-cfccc-81
, author =	"M. T. Mason"
, title =	"Compliance and force control for computer controlled manipulators"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-11"
, year =	1981
, pages =	"418--432"
, update =	"98.03 bibrelex"
}

@techreport{m-cfccc-79
, author =	"M. T. Mason"
, title =	"Compliance and Force Control of Computer Controlled Manipulator"
, number =	"A. I. Memo No. 605"
, institution =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1979
, update =	"97.11 bibrelex"
}

@techreport{m-mgpo-82
, author =	"M. T. Mason"
, title =	"Manipulator grasping and pushing operations"
, number =	"MIT-AI-TR 690"
, institution =	"Artificial Intelligence Laboratory, MIT"
, year =	1982
, update =	"98.03 bibrelex"
}

@article{m-mpmpo-86
, author =	"M. T. Mason"
, title =	"Mechanics and planning of manipulator pushing operations"
, journal =	"Internat. J. Robot. Res."
, volume =	5
, year =	1986
, pages =	"53--71"
, update =	"98.03 agarwal"
}

@book{ms-rhmm-85
, author =	"M. T. Mason and J. K. Salisbury"
, title =	"Robot hands and the mechanics of manipulation"
, publisher =	"MIT Press"
, year =	1985
, update =	"98.07 bibrelex"
}

@article{m-dac-56
, author =	"R. M. Mason"
, title =	"The digital approximation of contours"
, journal =	"J. ACM"
, volume =	3
, year =	1956
, pages =	"355--359"
}

@book{m-ati-77
, author =	"W. S. Massey"
, title =	"Algebraic Topology: {An} Introduction"
, series =	"Graduate Texts in Mathematics"
, volume =	56
, publisher =	"Springer-Verlag"
, year =	1977
, update =	"97.11 bibrelex"
}

@book{m-hct-78
, author =	"W. S. Massey"
, title =	"Homology and Cohomology Theory"
, publisher =	"Marcel Dekker, Inc."
, address =	"New York, NY"
, year =	1978
, update =	"97.11 bibrelex"
}

@article{m-ctqdab-86
, author =	"Howard Masur"
, title =	"Closed trajectories for quadratic differentials with an application to billiards"
, journal =	"Duke Math. J."
, volume =	53
, year =	1986
, pages =	"307--314"
, update =	"01.04 orourke"
}

@article{mih-ccmcp-81
, author =	"S. Masuyama and T. Ibaraki and T. Hasegawa"
, title =	"The computational complexity of the $m$-center problem"
, journal =	"Trans. IECE Japan"
, volume =	"E 64"
, number =	2
, year =	1981
, pages =	"57--64"
, update =	"97.11 bibrelex"
}

@techreport{m-cfaar-95
, author =	"C. Mata"
, title =	"A Constant Factor Approximation Algorithm for the Red-Blue Separation Problem"
, institution =	"Manuscript, Dept. of Computer Science, SUNY Stony Brook, NY"
, year =	1995
, keywords =	"TSP, k-MST, approximation, separation"
, update =	"95.09 mitchell"
}

@inproceedings{mm-nacsp-97
, author =	"Cristian Mata and Joseph S. B. Mitchell"
, title =	"A new algorithm for computing shortest paths in weighted planar subdivisions"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"264--273"
, cites =	"ar-ppopm-90, ckt-spqwo-95, c-aaspm-87, d-reidt-92, d-lcpgi-93, gmmn-pp0wr-90, gs-pmgsc-85, j-wdmim-97, kg-cgwac-92, ksr-sawrp1-91, ksr-sawrp2-91, lms-awspp-97i, l-ccm-94, lm-crm-95, m-aaspt-91, m-lsppo-92, mp-wrpfs-91, mpk-pravc-87, p-aspmt-85, r-edt-93, rrzm-sgtdr-87, rr-eslmo-90, w-tsplr-57, y-cmstk-82, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@techreport{mm-aagtn-94
, author =	"C. Mata and J. S. B. Mitchell"
, title =	"Approximation Algorithms for Geometric Tour and Network Design Problems"
, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
, year =	1994
, keywords =	"watchman route, TSP, k-MST, approximation, separation, covering TSP"
, precedes =	"mm-aagtn-95"
, update =	"98.03 mitchell, 95.09 mitchell"
}

@inproceedings{mm-aagtn-95
, author =	"Cristian Mata and Joseph S. B. Mitchell"
, title =	"Approximation Algorithms for Geometric Tour and Network Design Problems"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"360--369"
, keywords =	"watchman route, TSP, k-MST, approximation, separation, covering TSP"
, succeeds =	"mm-aagtn-94"
, cites =	"as-sagp-94, ah-aagcs-94, akm-gkp-93, aabv-iagmw-95, bk-rdlsn-93, bcv-cfakm-95, cjn-fswrs-93, cn-owr-88, c-wcanh-76, c-aapts-91, dps-melgr-86, er-ccmsp-93, e-amwt-92, f-cmlrb-92, gh-oaakm-94, grz-edcaa-90, hs-parss-93, irw-sncpp-91, l-fhmlr-86, l-hmdp-87, ll-blcpp-84, m-aagsp-93, n-gagmm-95, py-ebsph-90, py-obspo-92, rw-bspvo-89, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@book{m-rsig-75
, author =	"G. Matheron"
, title =	"Random Sets and Integral Geometry"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1975
, update =	"99.11 bibrelex, 98.07 bibrelex"
}

@article{m-spcg-87
, author =	"C. Mathieu"
, title =	"Some problems in computational geometry"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"131--134"
}

@article{mpy-aedsb-87
, author =	"C. Mathieu and C. Puech and H. Yahia"
, title =	"Average efficiency of data structures for binary image processing"
, journal =	"Inform. Process. Lett."
, volume =	26
, year =	1987
, pages =	"89--93"
}

@inproceedings{m-sdcpa-93
, author =	"Y. Matias"
, title =	"Semi-dynamic closest-pair Algorithms"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"264--271"
, cites =	"aesw-emstb-90, b-lbact-83, b-dsp-79, b-mdc-80, bs-dcms-76, clr-ia-90, dd-ekdnp-91, dgmp-phfr-92, dm-nuchf-90, fh-nrnna-79, fks-sstwc-84, fw-bitbf-90, grss-rdsdc-93i, grss-sracp-93, hns-psscp-88, km-srsac-91, ms-ufetp-91, m-iaca-89, mv-chpnc-91, m-mdscg-84, ps-cgi-85 , r-ppass-85, s-sisie-91, ss-oaolc-92, sss-oaolc-92, sh-cpp-75, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, gmv-ttnct-92, r-pa-76, y-lbact-91, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{mv-chpnc-91
, author =	"Y. Matias and U. Vishkin"
, title =	"Converting high probability into nearly constant time - with appliccations to parallel hashing"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, month =	may
, year =	1991
, pages =	"307--316"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@inproceedings{mvn-dgdrv-93
, author =	"Y. Matias and J. S. Vitter and W.-C. Ni"
, title =	"Dynamic generation of discrete random variates"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"187--194"
, update =	"96.09 agarwal, 94.09 vitter"
}

@inproceedings{mvw-wbhse-98
, author =	"Y. Matias and J. S. Vitter and M. Wang"
, title =	"Wavelet-Based Histograms for Selectivity Estimation"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1998
, update =	"98.03 agarwal"
}

@inproceedings{mvy-adsa-94
, author =	"Y. Matias and J. S. Vitter and N. Young"
, title =	"Approximate Data Structures with Applications"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"187--194"
, update =	"94.09 vitter"
}

@inproceedings{m-httuc-95
, author =	"Ji{\v r}{\'\i} Matou{\v s}ek"
, title =	"A {Helly}-type Theorem for Unions of Convex Sets"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"138--146"
, keywords =	""
, cites =	"abfk-pswen-92, ak-pcs-92a, ak-bpn-95, a-htglp-93, a-bbhdn-94, bfl-nhp-90, bk-gdtmc-76, c-lvalp-88, de-ctchp-93, d-httdb-70, dp-epgh-94, e-hrctt-93, e-gtp-59, f-undkd-, g-saaop-92, gm-csfs-61, grs-rt-90, h-usvam-30, l-htpuc-68, m-gofvc-94, m-tphpu-73, msw-sblp-92, m-eat-84, ps-cncsr-90, s-sesc-92, sw-cblpr-92, k-ker-32, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@techreport{m-aalpl-93
, author =	"J. Matou{\v s}ek"
, title =	"Algorithms for abstract linear programming: {Lower} bounds and experiments"
, institution =	"Princeton University"
, month =	feb
, year =	1993
, comments =	"DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
, update =	"96.09 agarwal, 93.09 milone+mitchell"
}

@techreport{m-ahrc-87
, author =	"J. Matou{\v s}ek"
, title =	"Approximate halfplanar range counting"
, type =	"KAM {Series}"
, number =	"59-87"
, institution =	"Charles Univ."
, address =	"Prague, Czechoslovakia"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{m-alla-91
, author =	"J. Matou{\v s}ek"
, title =	"Approximate levels in line arrangements"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"222--227"
, update =	"96.09 agarwal"
}

@techreport{m-aodq-90
, author =	"J. Matou{\v s}ek"
, title =	"Approximations and Optimal Divide-and-Conquer"
, type =	"Manuscript"
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{m-aogdc-91
, author =	"J. Matou{\v s}ek"
, title =	"Approximations and optimal geometric divide-and-conquer"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"505--511"
, keywords =	"approximations, VC-dimension, shatter function, derandomization, cutting, partition"
, update =	"00.03 smid, 96.09 agarwal, 93.09 erickson+matousek"
}

@article{m-aogdc-95
, author =	"J. Matou{\v s}ek"
, title =	"Approximations and optimal geometric divide-and-conquer"
, journal =	"J. Comput. Syst. Sci."
, volume =	50
, year =	1995
, pages =	"203--208"
, update =	"00.03 smid"
}

@unpublished{m-cag-
, author =	"J. Matou{\v s}ek"
, title =	"Combinatorial and algorithmic geometry"
, note =	"Unpublished lecture notes"
, update =	"98.07 bibrelex"
}

@article{m-cde-91
, author =	"J. Matou{\v s}ek"
, title =	"Computing dominances in {$E^{n}$}"
, journal =	"Inform. Process. Lett."
, volume =	38
, year =	1991
, pages =	"277--278"
, update =	"96.09 agarwal"
}

@incollection{m-ccpps-91
, author =	"J. Matou{\v s}ek"
, title =	"Computing the center of planar point sets"
, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
, booktitle =	"Computational Geometry: Papers from the DIMACS Special Year"
, publisher =	"American Mathematical Society"
, address =	"Providence"
, year =	1991
, pages =	"221--230"
, keywords =	"centerpoint, parametric search, cutting, k-level"
, update =	"98.07 agarwal, 96.05 agarwal, 93.09 matousek"
}

@inproceedings{m-cen-89
, author =	"J. Matou{\v s}ek"
, title =	"Construction of $\epsilon$-nets"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"1--10"
, precedes =	"m-cen-90"
, cites =	"aks-osn-83, c-ghscp-79, csss-otass-89, e-acg-87, ew-cbtda-86, hw-ensrq-87, l-roifc-75, m-ahrc-87, s-pptld-86, w-pttco-88, ZZZ"
, update =	"98.03 bibrelex, 96.09 agarwal"
}

@article{m-cen-90
, author =	"J. Matou{\v s}ek"
, title =	"Construction of $\epsilon$-nets"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"427--448"
, succeeds =	"m-cen-89"
, update =	"96.09 agarwal"
}

@techreport{m-cha-90t
, author =	"J. Matou{\v s}ek"
, title =	"Cutting Hyperplane Arrangements"
, type =	"Technical {Report}"
, number =	"90-7"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, precedes =	"m-cha-90i"
, update =	"96.09 agarwal, 93.09 milone+mitchell"
}

@inproceedings{m-cha-90i
, author =	"J. Matou{\v s}ek"
, title =	"Cutting hyperplane arrangements"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"1--9"
, precedes =	"m-cha-91"
, cites =	"ahu-dsa-83, a-dapal-89, a-rsoas-89, cegs-lscaa-89,  cf-dvrsi-88t, c-arscg-88, c-racpq-88, cegsw-ccbac-88, e-acg-87, eghsssw-irals-89, eos-calha-86, hw-ensrq-87, m-cen-89, m-ahrc-87, pw-snben-89, yy-gaddg-85, ZZZ"
, update =	"97.11 bibrelex, 96.09 agarwal, 93.09 milone+mitchell"
}

@article{m-cha-91
, author =	"J. Matou{\v s}ek"
, title =	"Cutting hyperplane arrangements"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"385--406"
, succeeds =	"m-cha-90i"
, update =	"96.09 agarwal, 93.09 milone+mitchell"
}

@article{m-dcg-96
, author =	"J. Matou{\v s}ek"
, title =	"Derandomization in computational geometry"
, journal =	"J. Algorithms"
, volume =	20
, year =	1996
, pages =	"545--580"
, update =	"97.03 smid"
}

@incollection{m-dcg-00
, author =	"Ji{\v r}{\'\i} Matou{\v s}ek"
, title =	"Derandomization in Computational Geometry"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"559--595"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 13 of su-hcg-00"
}

@inproceedings{m-ept-91
, author =	"J. Matou{\v s}ek"
, title =	"Efficient partition trees"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"1--9"
, keywords =	"range search, simplex, partition trees"
, cites =	"a-pal2a-90, ahl-sqrpc-90, b-dsp-79, c-lbcpr-89, cgl-pgd-85, csw-qoubs-90, cf-dvrsi-90, cp-hrsaa-86, cw-qorss-89, ew-hrsls-86, hw-ensrq-87, m-aogdc-91, m-cha-90i, m-mcast-90, o-ddds-83, so-dpt-90, vc-ucrfe-71, w-pttco-88, w-pr-82, yy-gaddg-85, ZZZ"
, update =	"97.11 bibrelex, 96.09 agarwal"
}

@article{m-ept-92
, author =	"J. Matou{\v s}ek"
, title =	"Efficient partition trees"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"315--334"
, keywords =	"simplex range searching, crossing number, multilevel data structure, approximations"
, succeeds =	"m-ept-91"
, update =	"93.09 matousek"
}

@incollection{m-encg-93
, author =	"J. Matou{\v s}ek"
, title =	"Epsilon-Nets and Computational Geometry"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, address =	"Heidelberg"
, year =	1993
, pages =	"69--89"
, keywords =	"survey paper, epsilon-nets, range spaces, VC-dimension, cuttings, derandomization"
, update =	"98.07 agarwal, 96.09 agarwal, 93.09 erickson"
}

@techreport{m-grs-93
, author =	"J. Matou{\v s}ek"
, title =	"Geometric range searching"
, type =	"Tech. Report"
, number =	"B-93-09"
, institution =	"Fachbereich Mathematik und Informatik, Free Univ. Berlin"
, year =	1993
, comments =	"A survey paper"
, update =	"96.09 agarwal, 94.01 matousek"
}

@article{m-grs-94
, author =	"J. Matou{\v s}ek"
, title =	"Geometric range searching"
, journal =	"ACM Comput. Surv."
, volume =	26
, year =	1994
, pages =	"421--461"
, keywords =	"survey paper"
, update =	"97.03 pocchiola, 95.05 agarwal"
}

@techreport{m-hsrr-90
, author =	"J. Matou{\v s}ek"
, title =	"Half-space range reporting"
, series =	"KAM Series"
, type =	"Report"
, number =	"90-188"
, institution =	"Charles Univ."
, address =	"Prague, Czechoslovakia"
, year =	1990
, keywords =	"range search, half spaces, polyhedra"
, update =	"96.09 agarwal"
}

@article{m-lars-88
, author =	"J. Matou{\v s}ek"
, title =	"Line arrangements and range search"
, journal =	"Inform. Process. Lett."
, volume =	27
, year =	1988
, pages =	"275--280"
, update =	"98.03 bibrelex"
}

@article{m-loq-93
, author =	"J. Matou{\v s}ek"
, title =	"Linear optimization queries"
, journal =	"J. Algorithms"
, volume =	14
, year =	1993
, pages =	"432--448"
, keywords =	"multidimensional parametric search, linear programming, separation, range search"
, update =	"97.11 bibrelex, 96.09 agarwal, 96.05 agarwal, 93.09 matousek"
, annote =	"See also J. Matou{\v s}ek and O. Schwarzkopf
		 {\em Proc. 8th ACM Sympos. Comput. Geom.},
		 1992, pp.\ 16--25"
}

@article{m-lbsoa-94
, author =	"J. Matou{\v s}ek"
, title =	"Lower bound for a subexponential optimization algorithm"
, journal =	"Random Structures \& Algorithms"
, volume =	5
, number =	4
, year =	1994
, pages =	"591--607"
, update =	"95.01 matousek"
}

@article{m-lblmp-91
, author =	"J. Matou{\v s}ek"
, title =	"Lower bounds on the length of monotone paths in arrangements"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"129--134"
, update =	"96.09 agarwal"
}

@techreport{m-mcast-90
, author =	"J. Matou{\v s}ek"
, title =	"More on cutting arrangements and spanning trees with low crossing number"
, number =	"B-90-2"
, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berlin"
, year =	1990
, update =	"96.09 agarwal, 93.09 milone+mitchell"
}

@unpublished{m-agkc-00
, author =	"J. Matou{\v s}ek"
, title =	"On approximate geometric k-clustering"
, year =	2000
, note =	"to appear in {\em Discrete Comput. Geom.}"
, update =	"00.11 smid, 00.07 agarwal"
}

@techreport{m-ekpc-93
, author =	"J. Matou{\v s}ek"
, title =	"On enclosing $k$ points by a circle"
, type =	"KAM Series"
, number =	"93-245"
, institution =	"Charles University"
, year =	1993
, update =	"96.05 smid, 94.01 matousek"
}

@article{m-ekpc-95
, author =	"J. Matou{\v s}ek"
, title =	"On enclosing $k$ points by a circle"
, journal =	"Inform. Process. Lett."
, volume =	53
, year =	1995
, pages =	"217--221"
, update =	"96.09 agarwal, 96.05 smid"
}

@inproceedings{m-gofvc-94
, author =	"J. Matou{\v s}ek"
, title =	"On Geometric Optimization with Few Violated Constraints"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"312--321"
, cites =	"acegsw-ptphp-91, abms-claho-94, aiks-fkpmd-91, am-dhsrr-91, a-htglp-93, c-narsc-87, c-lvalp-88, c-blmat-92, cm-ltdao-93, cs-arscg-89, csy-khrp-87, de-ctchp-93, dlss-sdakp-93i, ec-eargd-92, ee-innfm-93, els-fmcsh-93, em-sstcd-90, erk-oalla-93, es-blbda-93, esz-cskec-93i, g-saaop-92, go-nhpcg-93, k-srsa-92, m-loq-93, m-ekpc-93, m-we1cp-83, msw-sblp-92, m-lavd-91, m-gdsrs-91, ol-mcp-81, s-nmpgc-94, sw-cblpr-92, w-sedbe-91a, y-gctsp-90, ZZZ"
, update =	"98.03 bibrelex, 96.09 agarwal, 94.09 jones, 94.01 jones"
}

@article{m-gofvc-95
, author =	"J. Matou{\v s}ek"
, title =	"On Geometric Optimization with Few Violated Constraints"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"365--384"
, update =	"96.09 agarwal, 96.05 agarwal+smid"
}

@article{m-vrsa-93
, author =	"J. Matou{\v s}ek"
, title =	"On Vertical Ray Shooting in Arrangements"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	5
, month =	mar
, year =	1993
, pages =	"279--285"
, keywords =	"ray shooting, zone theorem, cutting, hyperplane arrangement"
, update =	"93.09 held+matousek+milone+mitchell"
}

@article{m-roass-91
, author =	"J. Matou{\v s}ek"
, title =	"Randomized optimal algorithm for slope selection"
, journal =	"Inform. Process. Lett."
, volume =	39
, year =	1991
, pages =	"183--187"
, update =	"96.09 agarwal"
}

@techreport{m-rsehc-91
, author =	"J. Matous{\v e}k"
, title =	"Range searching with efficient hierarchical cuttings"
, type =	"Manuscript"
, institution =	"??"
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{m-rsehc-92
, author =	"J. Matou{\v s}ek"
, title =	"Range searching with efficient hierarchical cuttings"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"276--285"
, cites =	"a-pal1e-90, as-anps-91, cf-dvrsi-90, c-lbcpr-89, c-chdc-91, csw-qoubs-90, cw-qorss-89, de-ssio-87, e-acg-87, eghsssw-irals-89, m-aogdc-91, m-cha-91, m-ept-91, m-splcn-91, oss-slspt-90, ps-cgi-85, ZZZ"
, update =	"97.11 bibrelex, 96.09 agarwal"
}

@article{m-rsehc-93
, author =	"J. Matou{\v s}ek"
, title =	"Range searching with efficient hierarchical cuttings"
, journal =	"Discrete Comput. Geom."
, volume =	10
, number =	2
, year =	1993
, pages =	"157--182"
, succeeds =	"m-rsehc-92"
, update =	"97.11 bibrelex, 94.01 matousek"
}

@inproceedings{m-rph-91
, author =	"J. Matou{\v s}ek"
, title =	"Reporting points in halfspaces"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"207--215"
, precedes =	"m-rph-92"
, update =	"96.09 agarwal"
}

@article{m-rph-92
, author =	"J. Matou{\v s}ek"
, title =	"Reporting points in halfspaces"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"169--186"
, succeeds =	"m-rph-91"
, update =	"96.09 agarwal"
}

@article{m-splcn-91
, author =	"J. Matou{\v s}ek"
, title =	"Spanning trees with low crossing numbers"
, journal =	"Informatique Th\'eorique et Applications"
, volume =	6
, number =	25
, year =	1991
, pages =	"103--123"
, keywords =	"spanning trees"
, update =	"96.05 pocchiola"
}

@techreport{m-tubdh-94
, author =	"J. Matou{\v s}ek"
, title =	"Tight upper bounds for the discrepancy of halfspaces"
, type =	"KAM Series"
, number =	""
, institution =	"Charles University"
, year =	1994
, note =	"Also submitted to {\em Discr. Comput. Geom.}"
, update =	"96.09 agarwal, 94.05 matousek"
}

@inproceedings{mmpssw-ftdlm-91
, author =	"J. Matou{\v s}ek and N. Miller and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
, title =	"Fat triangles determine linearly many holes"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"49--58"
, update =	"98.03 mitchell, 96.09 agarwal"
}

@unpublished{mmn-erarm-92
, author =	"J. Matou{\v s}ek and D. M. Mount and N. S. Netanyahu"
, title =	"Efficient Randomized Algorithms for the Repeated Median Line Estimator"
, year =	1992
, note =	"in preparation"
, precedes =	"mmn-erarm-93"
, update =	"98.07 bibrelex"
}

@inproceedings{mmn-erarm-93
, author =	"J. Matou{\v s}ek and D. M. Mount and N. S. Netanyahu"
, title =	"Efficient Randomized Algorithms for the Repeated Median Line Estimator"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1993
, pages =	"74--82"
, succeeds =	"mmn-erarm-92"
, update =	"98.11 bibrelex, 98.07 bibrelex, 96.09 agarwal, 93.05 smid"
}

@techreport{mpssw-ftdlm-90
, author =	"J. Matou{\v s}ek and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
, title =	"Fat triangles determine linearly many holes"
, type =	"Technical {Report}"
, number =	"174/90"
, institution =	"Eskenasy Inst. Comput. Sci., Tel Aviv Univ."
, address =	"Tel Aviv, Israel"
, month =	may
, year =	1990
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{mpssw-ftdlm-94
, author =	"J. Matou{\v s}ek and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
, title =	"Fat triangles determine linearly many holes"
, journal =	"SIAM J. Comput."
, volume =	23
, year =	1994
, pages =	"154--169"
, update =	"98.03 mitchell, 96.09 agarwal, 95.09 agarwal, 94.05 sharir"
}

@inproceedings{ms-datdd-93
, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"A Deterministic Algorithm for the Three-Dimensional Diameter Problem"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1993
, pages =	"478--484"
, keywords =	"diameter, three-dimensional, parametric search"
, precedes =	"ms-datdd-96"
, cites =	"cegs-dwclp-92"
, update =	"96.09 agarwal+devillers, 93.09 milone+mitchell, 93.05 schwarzkopf"
, abstract =	"A deterministic algorithm for computing the diameter
		of an $n$ point set in three dimensions with
		$O(n\log^c n)$ running time is given, $c$ a
		constant."
}

@article{ms-datdd-96
, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"A Deterministic Algorithm for the Three-Dimensional Diameter Problem"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"253--262"
, succeeds =	"ms-datdd-93"
, update =	"96.09 devillers"
}

@techreport{ms-loq-91
, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Linear optimization queries"
, type =	"Technical {Report}"
, number =	"B 91-19"
, institution =	"Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{ms-loq-92
, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"Linear optimization queries"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"16--25"
, keywords =	"separation, linear programming, prune-and-search"
, cites =	"am-dhsrr-91, am-rsps-92, cf-dvrsi-90, c-lpot-86, c-lvalp-88, c-arscg-88, cm-sptna-89, c-sdsno-87, csw-qoubs-90, csy-khrp-87, d-mstia-86, e-acg-87, e-dtdlp-91, gsc-srttd-87, hw-ensrq-87, m-aogdc-91, m-ept-91, m-rph-91, m-loq-93, ms-loq-91, m-apcad-83, m-lpltw-84, m-mdscg-84, m-rmstl-91, npt-usafd-90, ph-chfsp-77, s-pop-91, s-rscp-92, s-chdch-86, s-sdlpc-91, ZZZ"
, update =	"97.11 bibrelex, 96.09 agarwal"
}

@article{ms-rscp-93
, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
, title =	"On ray shooting in convex polytopes"
, journal =	"Discrete Comput. Geom."
, volume =	10
, number =	2
, year =	1993
, pages =	"215--232"
, keywords =	"ray shooting, convex polytope, range searching"
, comments =	"another part of the results of the conference version is in m-loq-93"
, succeeds =	"ms-loq-92"
, update =	"96.09 agarwal, 94.05 schwarzkopf, 94.01 matousek"
}

@unpublished{mss-ncric-96
, author =	"Ji{{\v r}}{\'{\i}} Matou{{\v s}}ek and Otfried Schwarzkopf and Jack Snoeyink"
, title =	"Non-Canonical Randomized Incremental Construction"
, year =	1997
, note =	"Manuscript"
, update =	"97.03 schwarzkopf"
}

@incollection{ms-temsi-92
, author =	"J. Matou{\v s}ek and R. Seidel"
, title =	"A Tail Estimate for {Mulmuley}'s Segment Intersection Algorithm"
, booktitle =	"Proc. 19th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	623
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"427--438"
, update =	"96.09 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{msw-hnlls-90
, author =	"J. Matou{\v s}ek and R. Seidel and Emo Welzl"
, title =	"How to net a lot with little: small $\epsilon$-nets for disks and halfspaces"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"16--22"
, cites =	"a-dapal-89, behw-clgcv-89, cf-dvrsi-88, cw-qorss-89, c-narsc-87, es-vda-86, ew-nlsfs-85, hw-ensrq-87, m-cen-89, pw-snben-90, w-uekgf-65, yy-gaddg-85, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 96.09 agarwal"
}

@inproceedings{msw-sblp-92
, author =	"J. Matou{\v s}ek and Micha Sharir and Emo Welzl"
, title =	"A subexponential bound for linear programming"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"1--8"
, cites =	"b-udkuu-38, c-ochan-91, c-lpot-86, c-lvali-89, dll-udleu-57, d-lpe-63, d-mstia-86, d-ccpac-92, df-rafdl-87, j-levso-90, j-udkkd-01, k-srsa-92, k-nptal-84a, k-palp-80, km-hgisa-72, m-lpltw-84, p-mse-84, s-sdlpc-91, s-barga-91, sw-cblpr-92, w-sedbe-91a, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 97.03 smid, 96.09 agarwal"
}

@article{msw-sblp-96
, author =	"J. Matou{\v s}ek and Micha Sharir and Emo Welzl"
, title =	"A subexponential bound for linear programming"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"498--516"
, update =	"98.03 mitchell, 97.03 agarwal+smid"
}

@incollection{mv-clesh-97
, author =	"J. Matou{\v s}ek and P. Valtr"
, title =	"The complexity of the lower envelope of segments with $h$ endpo ints"
, editor =	"I. Bar{' a}ny"
, booktitle =	"Intuitive Geometry, Colloq. Math. Society J{\'a}nos Bolyai"
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	1997
, pages =	"407--411"
, update =	"98.03 agarwal"
}

@techreport{mv-clesh-95
, author =	"J. Matou{\v s}ek and P. Valtr"
, title =	"The complexity of the lower envelope of segments with $h$ endpoints"
, institution =	"??"
, address =	"Prague"
, year =	1995
, update =	"97.03 agarwal"
}

@inproceedings{mw-gscpt-89
, author =	"J. Matou{\v s}ek and Emo Welzl"
, title =	"Good splitters for counting points in triangles"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"124--130"
, cites =	"b-gtfga-80, cgl-pgd-83, cw-rsvdc-88, csss-otass-89, e-acg-87, eghsssw-irals-88, ew-hrsls-86, ekm-pis-82, es-cpg-35, hw-ensrq-87, m-splcn-91, m-lars-88, w-pr-82, ZZZ"
, update =	"98.03 bibrelex+mitchell, 96.09 agarwal"
}

@article{mw-gscpt-92
, author =	"J. Matou{\v s}ek and Emo Welzl"
, title =	"Good splitters for counting points in triangles"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"307--319"
, succeeds =	"mw-gscpt-89"
, update =	"98.03 mitchell, 96.09 agarwal, 93.09 matousek"
}

@inproceedings{mww-deabv-91
, author =	"J. Matou{\v s}ek and Emo Welzl and L. Wernisch"
, title =	"Discrepancy and $\varepsilon$-approximations for bounded {VC}-dimension"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"424--430"
, update =	"98.03 mitchell, 96.09 agarwal"
}

@article{mww-deabv-93
, author =	"J. Matou{\v s}ek and Emo Welzl and L. Wernisch"
, title =	"Discrepancy and $\varepsilon$-approximations for bounded {VC}-dimension"
, journal =	"Combinatorica"
, volume =	13
, year =	1993
, pages =	"455--466"
, succeeds =	"mww-deabv-91"
, update =	"98.03 mitchell, 96.09 agarwal, 94.05 matousek"
}

@inproceedings{mhn-fogis-82
, author =	"T. Matsuyama and L. V. Hao and M. Nagao"
, title =	"A file organization for geographic information systems based on the spatial proximity"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
, year =	1982
, pages =	"83--88"
}

@inproceedings{mp-drlvd-84
, author =	"T. Matsuyama and T. Phillips"
, title =	"Digital Realization of the Labelled {Voronoi} Diagram and its Application to Closed Boundary Detection"
, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn."
, year =	1984
, pages =	"478--480"
, annote =	"Discrete VD of set of segments. Medial axis is used to
		 reconstruct a closed boundary."
}

@article{m-adica-73
, author =	"T. H. Mattheiss"
, title =	"An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities"
, journal =	"Oper. Res."
, volume =	21
, year =	1973
, pages =	"247--260"
}

@article{mr-scmfa-80
, author =	"T. H. Mattheiss and D. Rubin"
, title =	"A survey and comparison of methods for finding all vertices of convex polyhedral sets"
, journal =	"Math. Oper. Res."
, volume =	5
, year =	1980
, pages =	"167--185"
}

@article{ms-crafa-80
, author =	"T. H. Mattheiss and B. K. Schmidt"
, title =	"Computational results on an algorithm for finding all vertices of a polytope"
, journal =	"Math. Program."
, volume =	18
, year =	1980
, pages =	"308--329"
}

@article{ms-pggrg-80
, author =	"D. W. Matula and R. R. Sokal"
, title =	"Properties of {Gabriel} graphs relevant to geographic variation research and clustering of points in the plane"
, journal =	"Geogr. Anal."
, volume =	12
, number =	3
, year =	1980
, pages =	"205--222"
, update =	"98.11 bibrelex"
}

@inproceedings{m-elnlr-96
, author =	"Joseph M. Maubach"
, title =	"The efficient location of neighbors for locally refined n-simplicial grids"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"137--153"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{m-poprq-80
, author =	"H. A. Maurer"
, title =	"The post-office problem and related questions"
, booktitle =	"Proc. 6th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '80"
, series =	"Lecture Notes Comput. Sci."
, volume =	100
, publisher =	"Springer-Verlag"
, year =	1980
, pages =	"1--19"
, update =	"98.07 bibrelex"
}

@incollection{mo-dsdsp-79
, author =	"H. A. Maurer and T. A. Ottmann"
, title =	"Dynamic solutions of decomposable searching problems"
, editor =	"U. Pape"
, booktitle =	"Discrete Structures and Algorithms"
, publisher =	"Carl Hanser Verlag"
, address =	"M{\"u}nchen, Germany"
, year =	1979
, pages =	"17--24"
, update =	"97.03 schwarzkopf"
}

@incollection{mo-msps-79
, author =	"H. A. Maurer and T. A. Ottmann"
, title =	"Manipulating sets of points: a survey"
, editor =	"M. Nagl and H. J. Schneider"
, booktitle =	"Applied Computer Science 13"
, publisher =	"Carl Hanser Verlag"
, year =	1979
, pages =	"9--29"
}

@article{m-dtchn-84
, author =	"A. Maus"
, title =	"Delaunay triangulation and the convex hull of $n$ points in expected linear time"
, journal =	"BIT"
, volume =	24
, year =	1984
, pages =	"151--163"
, keywords =	"designing algorithms, convex hull, Delaunay triangulations, two-dimensional, expected-case analysis"
}

@article{m-amgvf-90
, author =	"Dimtri J. Mavriplis"
, title =	"Adaptive mesh generation for viscous flows using {Delaunay} triangulation"
, journal =	"J. Comp. Physik"
, volume =	90
, number =	2
, month =	oct
, year =	1990
, pages =	"271--291"
, update =	"98.07 bibrelex"
}

@techreport{m-adtad-92
, author =	"D. J. Mavriplis"
, title =	"An advancing front {Delaunay} triangulation algorithm designed for robustness"
, type =	"Report"
, number =	"92-49"
, institution =	"NASA Langly Research Center"
, year =	1992
, update =	"98.11 bibrelex"
}

@article{m-wcvnf-99
, author =	"N. Max"
, title =	"Weights for Computing Vertex Normals from Facet Normals"
, journal =	"J. Graphics Tools"
, volume =	4
, number =	2
, year =	1999
, pages =	"1--6"
, update =	"00.03 held"
}

@article{mhc-avcev-90
, author =	"N. Max and P. Hanrahan and R. Crawfis"
, title =	"Area and volume coherence for efficient visualization of $3$d scalar functions"
, journal =	"Comput. Graph."
, volume =	24
, number =	5
, year =	1990
, pages =	"27--33"
, update =	"97.11 bibrelex"
}

@article{m-orfdf-64
, author =	"J. C. Maxwell"
, title =	"On Reciprocal Figures and Diagrams of Forces"
, journal =	"Phil. Mag. Ser."
, volume =	27
, year =	1864
, pages =	"250--261"
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@article{mm-lsd-84
, author =	"M. May and P. Mennecke"
, title =	"Layout of Schematic Drawings"
, journal =	"Syst. Anal. Model. Simul."
, volume =	1
, number =	4
, year =	1984
, pages =	"307--338"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ms-bcn-88
, author =	"M. May and K. Szkatula"
, title =	"On the Bipartite Crossing Number"
, journal =	"Control and Cybernetics"
, volume =	17
, number =	1
, year =	1988
, pages =	"85--98"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{mm-cwpcs-82
, author =	"E. Mayr and A. Meyer"
, title =	"The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals"
, journal =	"Adv. Math."
, volume =	46
, year =	1982
, pages =	"305--329"
, update =	"97.11 bibrelex"
}

@article{mr-esrsu-95
, author =	"N. Mayya and V. T. Rajan"
, title =	"An Efficient Shape-Representation Scheme Using {Voronoi} Skeletons"
, journal =	"Pattern Recogn. Lett."
, volume =	16
, number =	2
, year =	1995
, pages =	"147--160"
, update =	"97.03 held"
}

@inproceedings{mb-cpvpe-96
, author =	"Marisa Maz{\'o}n and Daciana Bochis"
, title =	"Computing Periodic {Voronoi} Partitions on the {Euclidean} Plane"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"45--47"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{mr-cvdes-94
, author =	"Marisa Maz{\'o}n and Tomas Recio"
, title =	"The Computation of {Voronoi} Diagrams on the {Euclidean} and Spherical 2-Orbifolds"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"12--15"
, update =	"00.11 smid, 00.07 icking"
}

@proceedings{mrs-ewcg-94
, title =	"Abstracts 10th European Workshop Comput. Geom."
, editor =	"M. Maz{\'o}n and T. Recio and F. Santos"
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, update =	"00.03 bibrelex"
}

@phdthesis{m-ddvec-92
, author =	"M. L. Maz{\'o}n"
, title =	"Diagrams de {Voronoi} en caleidoscopios"
, school =	"Universidad de Cantabria"
, address =	"Santander, Spain"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@techreport{mr-vdbsc-91
, author =	"M. L. Maz{\'o}n and T. Recio"
, title =	"Voronoi Diagrams Bases on Stricly Convex Distances on the Plane"
, type =	"Manuscript"
, institution =	"Departamento de Matem{\'a}ticas, Universidad del Cantabria"
, address =	"Santander, Spain"
, year =	1991
, update =	"98.03 bibrelex"
}

@inproceedings{mr-vdcdg-90
, author =	"M. L. Maz{\'o}n and T. Recio"
, title =	"Voronoi diagrams coming from discrete groups on the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"223--226"
, cites =	"b-gtfga-80, dk-oacvd-87, ei-drmwc-79, k-cavd-89, ns-gg-87, ZZZ"
, update =	"99.07 bibrelex, 98.07 bibrelex"
}

@inproceedings{mks-cplvd-93
, author =	"Michael McAllister and David Kirkpatrick and Jack Snoeyink"
, title =	"A Compact Piecewise-Linear {Voronoi} Diagram for Convex Sites in the Plane"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"573--582"
, precedes =	"mks-cplvd-96"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@article{mks-cplvd2-96
, author =	"M. McAllister and D. Kirkpatrick and J. Snoeyink"
, title =	"A compact piecewise-linear {Voronoi} diagram for convex sites in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	15
, year =	1996
, pages =	"73--105"
, succeeds =	"mks-cplvd-93"
, update =	"00.03 bibrelex"
}

@article{mks-cplvd-96
, author =	"M. McAllister and D. Kirkpatrick and J. Snoeyink"
, title =	"A compact piecewise-linear {Voronoi} diagram for convex sites in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	15
, year =	1996
, pages =	"73--105"
, update =	"96.05 smid"
}

@misc{mks-avdpt-93
, author =	"M. McAllister and D. Kirkpatrick and J. Snoeyink"
, title =	"An approximate {Voronoi} diagram for planning translation motion"
, year =	1993
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@inproceedings{as-sdcav-94
, author =	"M. {McAllister} and J. Snoeyink"
, title =	"The spoke diagram: a compact approximate {Voronoi} diagram for spatial computation"
, booktitle =	"Proc. GIS'94"
, site =	"Vancouver"
, year =	1994
, update =	"98.11 bibrelex"
}

@inproceedings{ms-tdctd-93
, author =	"M. McAllister and J. Snoeyink"
, title =	"Two-dimensional computation of the three-dimensional reachableregion for a welding head"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"437--442"
, cites =	"bo-arcgi-79, cegghss-rspug-91, cg-vippg-89, hs-parss-93, klps-ujrcf-86, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@book{m-oca-91
, author =	"A. D. McAulay"
, title =	"Optical Computer Architecture"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1991
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{ma-lafch-79
, author =	"D. McCallum and D. Avis"
, title =	"A linear algorithm for finding the convex hull of a simple polygon"
, journal =	"Inform. Process. Lett."
, volume =	9
, year =	1979
, pages =	"201--206"
, keywords =	"polygons, convex hull"
}

@article{m-essle-73
, author =	"M. McClellan"
, title =	"The exact solution of systems of lienear equations with polynomial coefficients"
, journal =	"J. ACM"
, volume =	20
, number =	4
, year =	1973
, pages =	"563--588"
, update =	"98.03 bibrelex"
}

@article{mv-papcb-75
, author =	"D. E. McClure and R. A. Vitale"
, title =	"Polygonal approximation of plane convex bodies"
, journal =	"J. Math. Anal. Appl."
, volume =	51
, year =	1975
, pages =	"326--358"
, update =	"01.07 devillers, 98.07 bibrelex"
}

@article{m-htcsc-67
, author =	"M. C. McCord"
, title =	"Homotopy type comparison of a space with complexes associated with its open covers"
, journal =	"Proc. Amer. Math. Soc."
, volume =	18
, year =	1967
, pages =	"705--708"
, update =	"98.03 bibrelex"
}

@mastersthesis{m-isen-86
, author =	"J. S. McCranie"
, title =	"An investigation of the size of epsilon-nets"
, type =	"M.{Sc}. Thesis"
, school =	"Univ. Illinois"
, address =	"Urbana, IL"
, year =	1986
, keywords =	"master thesis"
}

@inproceedings{msg-cgdsu-95
, author =	"C. McCreary and F.-S. Shieh and H. Gill"
, title =	"{CG}: a Graph Drawing System Using Graph-Grammar Parsing"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"270--273"
, keywords =	"graph drawing, system, grammar"
, update =	"95.01 tamassia"
}

@techreport{m-eaeii-80
, author =	"E. M. McCreight"
, title =	"Efficient algorithms for enumerating intersecting intervals and rectangles"
, type =	"Report"
, number =	"CSL-80-9"
, institution =	"Xerox Palo Alto Res. Center"
, address =	"Palo Alto, CA"
, year =	1980
}

@techreport{m-pst-81
, author =	"E. M. McCreight"
, title =	"Priority search trees"
, type =	"Technical {Report}"
, number =	"CSL-81-5"
, institution =	"XEROX Palo Alto Research Centre"
, address =	"Palo Alto, CA"
, year =	1981
, update =	"97.11 bibrelex"
}

@article{m-pst-85
, author =	"E. M. McCreight"
, title =	"Priority search trees"
, journal =	"SIAM J. Comput."
, volume =	14
, number =	2
, year =	1985
, pages =	"257--276"
, update =	"98.11 bibrelex"
}

@article{ml-rcecs-94
, author =	"K. McCroan and R. Lacher"
, title =	"Region coloring, edge coloring, and scan-conversion of maps"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"423--455"
, keywords =	"polygon filling, polygon scan conversion, curve filling, color cycle, edge colring, region coloring"
, update =	"96.09 devillers"
}

@article{mr-dtrds-80
, author =	"M. J. McCullagh and C. G. Ross"
, title =	"{Delaunay} Triangulation of a Random Data Set for Isarithmic Mapping"
, journal =	"The Cartographic Journal"
, volume =	17
, number =	2
, year =	1980
, pages =	"93--99"
, annote =	"Circumcircle algorithm with 2D bucketing for search.
		 Discusses order of triangle construction. Bucket search
		 order discussed."
}

@techreport{mp-spsrp-89
, author =	"Kenneth M. McDonald and Joseph G. Peters"
, title =	"Smallest paths in simple rectilinear polygons"
, type =	"Technical Report"
, number =	"TR 89-4"
, institution =	"School of Computing Science, Simon Fraser Univ."
, year =	1989
, precedes =	"mp-spsrp-92, mp-spsrp-90"
, update =	"98.07 bibrelex"
}

@techreport{mp-spsrp-90
, author =	"Kenneth M. McDonald and J. G. Peters"
, title =	"Smallest paths in simple rectilinear polygons"
, type =	"Manuscript"
, month =	mar
, year =	1990
, succeeds =	"mp-spsrp-89"
, precedes =	"mp-spsrp-92"
, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
}

@article{mp-spsrp-92
, author =	"Kenneth M. McDonald and Joseph G. Peters"
, title =	"Smallest paths in simple rectilinear polygons"
, journal =	"IEEE Trans. on Computer Aided Design"
, volume =	11
, year =	1992
, pages =	"864--875"
, keywords =	"bicriteria shortest paths, link distance, L1 metric, rectilinear shortest paths"
, comments =	"Gives an $O(n)$ algorithm for finding a path that  is  `smallest' in the sense of minimizing both $L_1$ length and rectilinear link distance at the same time (after proving that such a path always exists in a rectilinear simple polygon).  They also give a parallel algorithm that takes time $O(\log n)$, on $O(n/\log n)$ processors, in EREW PRAM, after the  polygon is triangulated."
, succeeds =	"mp-spsrp-90, mp-spsrp-89"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@phdthesis{m-eaa-86
, author =	"C. McGeoch"
, title =	"Experimental analysis of algorithms"
, school =	"School Comput. Sci., Carnegie Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1986
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@incollection{m-caclg-77
, author =	"B. D. McKay"
, title =	"Computing Automorphisms and Canonical Labelings of Graphs"
, booktitle =	"??"
, series =	"Lecture Notes Math."
, volume =	686
, publisher =	"Springer-Verlag"
, year =	1977
, pages =	"223--232"
, update =	"97.11 bibrelex"
}

@article{m-strg-83
, author =	"B. D. McKay"
, title =	"Spanning trees in regular graphs"
, journal =	"European J. Combin."
, volume =	4
, year =	1983
, pages =	"149--160"
, update =	"01.04 orourke"
}

@inproceedings{m-ismit-87
, author =	"David G. McKenna"
, title =	"The Inward Spiral Method: An Improved {TIN} Generation Technique and Data Structure for Land Planning Applications"
, booktitle =	"Proceedings, AUTOCARTO 8"
, site =	"Baltimore, MD, March 29--April 3"
, year =	1987
, pages =	"670--679"
, annote =	"CDT via selection. Bucket search. Extra vertices are
		 added on boundary edges so that no constraint edge is
		 longer than the grid size. Queue to store boundary"
}

@phdthesis{m-aagph-89
, author =	"M. McKenna"
, title =	"Applications of arrangements to geometric problems in higher dimensions"
, school =	"Johns Hopkins University"
, year =	1989
, keywords =	"doctoral thesis"
}

@techreport{m-wcohs-86
, author =	"M. McKenna"
, title =	"Worst-case optimal hidden-surface removal"
, type =	"Technical {Report}"
, number =	"JHU/EECS-86/05"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{m-wcohs-87
, author =	"M. McKenna"
, title =	"Worst-case optimal hidden-surface removal"
, journal =	"ACM Trans. Graph."
, volume =	6
, year =	1987
, pages =	"19--28"
, keywords =	"design of algorithms, complexity theory, computer graphics, visibility, plane-sweep, hidden line/surface elimination"
}

@inproceedings{mo-al3sd-88
, author =	"M. McKenna and J. O'Rourke"
, title =	"Arrangements of lines in $3$-space: a data structure with applications"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"371--380"
, cites =	"ahu-daca-74, aw-alts-87, cgl-pgd-85, eg-tsa-86, egs-oplms-86, eos-calha-86, f-pp-87, gs-ccrs-86, hs-ndssg-86, kl-sc-72, m-wcohs-87, ms-foscp-85, w-cgpsl-87, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{mos-fmrio-85
, author =	"M. McKenna and J. O'Rourke and Subhash Suri"
, title =	"Finding maximal rectangles inscribed in an orthogonal polygon"
, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
, year =	1985
, pages =	"486--495"
, keywords =	"packing, area, rectangles"
, update =	"98.03 mitchell"
}

@inproceedings{ms-foscp-85
, author =	"M. McKenna and R. Seidel"
, title =	"Finding the optimal shadows of a convex polytope"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"24--28"
, keywords =	"optimization, volume, arrangements"
, cites =	"eos-calha-86, eos-calha-83, g-cp-67, t-sgprc-83, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{mt-fmvdb-83
, author =	"M. McKenna and G. T. Toussaint"
, title =	"Finding the minimum vertex distance between two disjoint convex polygons in linear time"
, type =	"Technical {Report}"
, number =	"SOCS-83-6"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, month =	apr
, year =	1983
, update =	"97.11 bibrelex"
}

@article{mt-fmvdb-85
, author =	"M. McKenna and G. T. Toussaint"
, title =	"Finding the minimum vertex distance between two disjoint convex polygons in linear time"
, journal =	"Comput. Math. Appl."
, volume =	11
, year =	1985
, pages =	"1227--1242"
, keywords =	"separation"
}

@article{mz-dsall-90
, author =	"M. McKenna and D. Zeltzer"
, title =	"Dynamic simulation of autonomous legged locomotion"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1990
, pages =	"29--38"
, note =	"Proc. SIGGRAPH '90"
, update =	"97.11 bibrelex"
}

@book{m-ir-91
, author =	"P. J. McKerrow"
, title =	"Introduction to Robotics"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1991
, update =	"97.03 schwarzkopf"
}

@article{m-dcadp-74
, author =	"D. H. McLain"
, title =	"Drawing contours from arbitrary data points"
, journal =	"Comput. J."
, volume =	17
, year =	1974
, pages =	"318--324"
, update =	"93.09 jones"
}

@article{m-etdir-76
, author =	"D. H. McLain"
, title =	"Errata to ``{Two} dimensional interpolation from random data''"
, journal =	"Comput. J."
, volume =	19
, number =	4
, year =	1976
, pages =	384
, succeeds =	"m-tdird-76"
, update =	"98.03 bibrelex"
}

@article{m-tdird-76
, author =	"D. H. McLain"
, title =	"Two dimensional interpolation from random data"
, journal =	"Comput. J."
, volume =	19
, year =	1976
, pages =	"178--181"
, precedes =	"m-etdir-76"
, update =	"98.03 bibrelex"
}

@inproceedings{m-ioopt-93
, author =	"M. J. McLennan"
, title =	"[{Inc} {Tcl}]: object-oriented programming in {Tcl}"
, booktitle =	"Proceedings of the Tcl/Tk Workshop 1993"
, year =	1993
, url =	"http://www.wn.com/biz/itcl"
, update =	"98.07 bibrelex"
}

@article{m-ssr-79
, author =	"R. McLeod"
, title =	"The {Steiner} Surface Revisited"
, journal =	"Proc. Roy. Soc. London Ser. A"
, volume =	369
, year =	1979
, pages =	"157--174"
, update =	"98.03 bibrelex"
}

@inproceedings{ms-cspsl-99
, author =	"S. McMains and C. S{\'e}quin"
, title =	"A coherent sweep plane slicer for layered manufacturing"
, booktitle =	"Proc. 5th ACM Symposium on Solid Modeling and Applications"
, year =	1999
, pages =	"285--295"
, update =	"00.03 smid"
}

@article{m-samml-86
, author =	"R. B. McMaster"
, title =	"A statistical analysis of mathematical measures for linear simplification"
, journal =	"Amer. Cartogr."
, volume =	13
, year =	1986
, pages =	"103--116"
, update =	"98.03 bibrelex"
}

@article{m-alg-87
, author =	"R. B. McMaster"
, title =	"Automated Line Generation"
, journal =	"Cartographica"
, volume =	24
, number =	2
, year =	1987
, pages =	"74--111"
}

@article{m-z-71
, author =	"P. McMullen"
, title =	"On zonotopes"
, journal =	"Trans. Amer. Math. Soc."
, volume =	159
, year =	1971
, pages =	"91--109"
, update =	"94.05 devillers"
}

@article{m-mnfcp-70
, author =	"P. McMullen"
, title =	"The maximal number of faces of a convex polytope"
, journal =	"Mathematika"
, volume =	17
, year =	1970
, pages =	"179--184"
, update =	"98.03 smid"
}

@book{ms-cpubc-71
, author =	"P. McMullen and G. C. Shephard"
, title =	"Convex Polytopes and the Upper Bound Conjecture"
, series =	"Lecture Notes"
, volume =	3
, publisher =	"Cambridge University Press"
, address =	"Cambridge, England"
, year =	1971
, update =	"97.11 bibrelex"
}

@article{mw-glbcs-71
, author =	"P. McMullen and D. Walkup"
, title =	"A generalized lower-bound conjecture for simplical polytopes"
, journal =	"Mathematika"
, volume =	18
, year =	1971
, pages =	"246--273"
, update =	"98.03 bibrelex"
}

@techreport{mt-uchap-84
, author =	"M. M. {McQueen} and G. T. Toussaint"
, title =	"On the Ultimate Convex Hull Algorithm in Practice"
, type =	"Technical {Report}"
, number =	"SOCS-84.2"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, month =	feb
, year =	1984
, update =	"97.11 bibrelex"
}

@article{mt-uchap-85
, author =	"M. M. McQueen and G. T. Toussaint"
, title =	"On the ultimate convex hull algorithm in practice"
, journal =	"Pattern Recogn. Lett."
, volume =	3
, year =	1985
, pages =	"29--34"
}

@article{md-aerpc-73
, author =	"W. B. McRae and E. R. Davidson"
, title =	"An algorithm for the extreme rays of a pointed convex polyhedral cone"
, journal =	"SIAM J. Comput."
, volume =	2
, year =	1973
, pages =	"281--293"
}

@article{m-erf-34
, author =	"E. J. McShane"
, title =	"Extensions of range functions"
, journal =	"Bull. Amer. Math. Soc."
, volume =	40
, year =	1934
, pages =	"837--842"
, update =	"98.07 bibrelex"
}

@inproceedings{m-digbv-95
, author =	"J. D. McWhirter"
, title =	"A Demonstration of Interactive Graph Based Visual Language Applications"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"274--277"
, keywords =	"graph drawing, system, visual language"
, update =	"95.01 tamassia"
}

@book{m-avns-89
, author =	"C. Mead"
, title =	"Analog {VLSI} and neural systems"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1989
, update =	"98.07 bibrelex"
}

@book{mc-ivs-80
, author =	"C. Mead and L. Conway"
, title =	"Introduction to VLSI Systems"
, publisher =	"Addison-Wesley"
, year =	1980
, update =	"97.11 bibrelex"
}

@article{m-ripsy-66
, author =	"R. Mead"
, title =	"A relation between the individual plant-spacing and yield"
, journal =	"Annals of Botany, N.S."
, volume =	30
, year =	1966
, pages =	"301--309"
, update =	"97.03 schwarzkopf"
}

@article{m-gmuqe-82
, author =	"D. J. R. Meagher"
, title =	"Geometric modeling using quadtree encoding"
, journal =	"Comput. Graph. Image Process."
, volume =	19
, year =	1982
, pages =	"129--147"
}

@techreport{m-ogam-82
, author =	"D. J. R. Meagher"
, title =	"Octree generation, analysis and manipulation"
, type =	"Report"
, number =	"IPL-TR-027"
, institution =	"Image Process. Lab., Rensselaer Polytech. Inst."
, address =	"Troy, NY"
, year =	1982
}

@techreport{m-oemes-82
, author =	"D. J. R. Meagher"
, title =	"The octree encoding method for efficient solid modeling"
, type =	"Report"
, number =	"IPL-TR-032"
, institution =	"Image Process. Lab., Rensselaer Polytech. Inst."
, address =	"Troy, NY"
, year =	1982
}

@inproceedings{m-asmab-92
, author =	"J. E. Mebius"
, title =	"Artibodies: A System for Modelling Articulated Bodies"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"9--11"
, update =	"00.03 bibrelex"
}

@incollection{m-rtgh-84
, author =	"J. Mecke"
, title =	"Random tesselations generated by hyperplanes"
, editor =	"R. Ambartzumian and W. Weil"
, booktitle =	"Stochastic Geometry, Geometric Statistics, Stereology"
, publisher =	"B. G. Teubner"
, address =	"Leipzig"
, year =	1984
, pages =	"104--109"
, update =	"99.11 bibrelex, 98.07 agarwal"
}

@inproceedings{mcd-vtsml-94
, author =	"M. R. Mediano and M. A. Casanova and M. Dreux"
, title =	"{V}-trees: {A} storage method for long vector data"
, booktitle =	"Proc. 20th VLDB Conference"
, year =	1994
, pages =	"321--329"
, update =	"97.07 agarwal"
}

@article{m-atdvp-86
, author =	"N. N. Medvedev"
, title =	"The Algorithm for Three Dimensional {Voronoi} Polyhedra"
, journal =	"J. Comput. Phys."
, volume =	67
, year =	1986
, pages =	"223--229"
, annote =	"Construction of a single Voronoi polyhedron.
		 Effectively follows edges."
}

@inproceedings{m-irmbc-95
, author =	"C. Meghini"
, title =	"An Image Retrieval Model Based on Classical Logic"
, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
, year =	1995
, pages =	"300--308"
, update =	"98.07 agarwal"
}

@article{m-ndlp-86
, author =	"N. Megiddo"
, title =	"A note on degeneracy in linear programming"
, journal =	"Math. Program."
, volume =	35
, year =	1986
, pages =	"365--367"
, keywords =	"complexity theory, linear programming"
}

@article{m-apcad-83
, author =	"N. Megiddo"
, title =	"Applying parallel computation algorithms in the design of serial algorithms"
, journal =	"J. ACM"
, volume =	30
, number =	4
, year =	1983
, pages =	"852--865"
, keywords =	"design of algorithms, parallel computation, binary search"
, update =	"98.11 bibrelex"
}

@article{m-corof-79
, author =	"N. Megiddo"
, title =	"Combinatorial optimization with rational objective functions"
, journal =	"Math. Oper. Res."
, volume =	4
, year =	1979
, pages =	"414--424"
, keywords =	"complexity theory, design of algorithms, optimization, binary search"
}

@article{m-dlp-86
, author =	"N. Megiddo"
, title =	"Dynamic location problems"
, journal =	"Oper. Res."
, volume =	6
, year =	1986
, pages =	"313--319"
, keywords =	"design of algorithms, balls, optimization"
}

@article{m-iaaan-86
, author =	"N. Megiddo"
, title =	"Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm"
, journal =	"Math. Program."
, volume =	35
, year =	1986
, pages =	"140--172"
, keywords =	"average-case analysis, linear programming"
}

@article{m-ibeap-82
, author =	"N. Megiddo"
, title =	"Is binary encoding appropriate for the problem-language relationship?"
, journal =	"Theoret. Comput. Sci."
, volume =	19
, year =	1982
, pages =	"337--341"
, keywords =	"computational model"
}

@article{m-lp198-87
, author =	"N. Megiddo"
, title =	"Linear programming (1986)"
, journal =	"Annu. Rev. Comput. Sci."
, volume =	2
, year =	1987
, pages =	"119--145"
, keywords =	"survey paper"
}

@article{m-lpltw-84
, author =	"N. Megiddo"
, title =	"Linear programming in linear time when the dimension is fixed"
, journal =	"J. ACM"
, volume =	31
, year =	1984
, pages =	"114--127"
, keywords =	"design of algorithms, linear programming, worst-case analysis, prune-and-search"
}

@inproceedings{m-ltalp-82
, author =	"N. Megiddo"
, title =	"Linear-time algorithms for linear programming in {$R^{3}$} and related problems"
, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1982
, pages =	"329--338"
, precedes =	"m-ltalp-83"
}

@article{m-ltalp-83
, author =	"N. Megiddo"
, title =	"Linear-time algorithms for linear programming in {$R^{3}$} and related problems"
, journal =	"SIAM J. Comput."
, volume =	12
, number =	4
, year =	1983
, pages =	"759--776"
, keywords =	"design of algorithms, linear programming, three-dimensional, graph theory, prune-and-search, geometric transformations, points, lines, planes"
, succeeds =	"m-ltalp-82"
, update =	"01.04 icking"
}

@article{m-nalp-86
, author =	"N. Megiddo"
, title =	"New approaches to linear programming"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"387--394"
, keywords =	"survey paper"
}

@techreport{m-splp-81
, author =	"N. Megiddo"
, title =	"On some planar location problems"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Statist., Tel-Aviv Univ."
, address =	"Tel-Aviv, Israel"
, year =	1981
}

@article{m-bsb-89
, author =	"N. Megiddo"
, title =	"On the ball spanned by balls"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"605--610"
}

@incollection{m-clp-85
, author =	"N. Megiddo"
, title =	"On the complexity of linear programming"
, editor =	"T. Bewley"
, booktitle =	"Advances in Economic Theory"
, publisher =	"Cambridge University Press"
, year =	1985
, pages =	"??"
, keywords =	"survey paper, linear programming, complexity theory, computational model"
}

@article{m-cps-88
, author =	"N. Megiddo"
, title =	"On the complexity of polyhedral separability"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"325--337"
, keywords =	"NP-completeness, separation, hyperplanes, two-dimensional, $d$-dimensional"
}

@techreport{m-csgpu-87
, author =	"N. Megiddo"
, title =	"On the complexity of some geometric problems in unbounded dimension"
, type =	"Report"
, number =	"RJ 5744"
, institution =	"IBM Almeden Res. Center"
, address =	"San Jose, CA"
, year =	1987
, keywords =	"balls, covering, stabbing, $d$-dimensional, NP-completeness"
}

@article{m-csgpu-90
, author =	"N. Megiddo"
, title =	"On the complexity of some geometric problems in unbounded dimension"
, journal =	"J. Symbolic Comput."
, volume =	10
, year =	1990
, pages =	"327--334"
, keywords =	"balls, covering, stabbing, $d$-dimensional, NP-completeness"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@article{m-cotnd-82
, author =	"N. Megiddo"
, title =	"On the complexity of the one-terminal network design problem"
, journal =	"Oper. Res. Lett."
, volume =	3
, year =	1982
, pages =	"105--107"
, keywords =	"VLSI design, NP-completeness"
}

@techreport{m-pafmm-82
, author =	"N. Megiddo"
, title =	"Parallel algorithms for finding the maximum and median almost surely in constant-time"
, type =	"Report"
, number =	"??"
, institution =	"Grad. School Indust. Admin., Carnegie-Mellon Univ."
, address =	"Philadelphia, PA"
, year =	1982
, keywords =	"complexity theory, parallel computation, searching, Las Vegas"
}

@article{m-ptlp-85
, author =	"N. Megiddo"
, title =	"Partitioning with two lines in the plane"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"430--433"
, keywords =	"prune-and-search, design of algorithms, points, lines, two-dimensional"
}

@techreport{m-plpal-82
, author =	"N. Megiddo"
, title =	"Poly-log parallel algorithms for {LP} with an application to exploding flying objects"
, type =	"Technical {Report}"
, number =	"??"
, institution =	"Grad. School Indust. Admin., Carnegie-Mellon Univ."
, address =	"Philadelphia, PA"
, year =	1982
, keywords =	"design of algorithms, parallel computation, optimization, balls, three-dimensional, $d$-dimensional"
}

@unpublished{m-ppaa-90
, author =	"N. Megiddo"
, title =	"Poly-log parallel algorithms for {LP} with an application to exploding flying objects"
, year =	1990
, note =	"Unpublished manuscript"
, update =	"99.03 bibrelex, 95.09 agarwal"
}

@article{m-we1cp-83
, author =	"N. Megiddo"
, title =	"The weighted {Euclidean} $1$-center problem"
, journal =	"Math. Oper. Res."
, volume =	8
, number =	4
, year =	1983
, pages =	"498--504"
, keywords =	"design of algorithms, binary search, two-dimensional, circles, weighted, proximity"
}

@article{m-tgpal-83
, author =	"N. Megiddo"
, title =	"Towards a genuinely polynomial algorithms for linear programming"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"347--353"
, keywords =	"design of algorithms, linear programming, binary search, worst-case analysis, convex, $d$-dimensional"
}

@inproceedings{mhgjp-csg-81
, author =	"N. Megiddo and S. L. Hakimi and M. R. Garey and D. S. Johnson and C. H. Papadimitriou"
, title =	"On the complexity of searching a graph"
, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1981
, pages =	"376--385"
, keywords =	"worst-case analysis, graph theory, dynamic programming, NP-completeness"
, precedes =	"mhgjp-csg-88"
}

@article{mhgjp-csg-88
, author =	"N. Megiddo and S. L. Hakimi and M. R. Garey and D. S. Johnson and C. H. Papadimitriou"
, title =	"On the complexity of searching a graph"
, journal =	"J. ACM"
, volume =	35
, year =	1988
, pages =	"18--44"
, succeeds =	"mhgjp-csg-81"
}

@article{ms-cscgl-84
, author =	"N. Megiddo and K. J. Supowit"
, title =	"On the complexity of some common geometric location problems"
, journal =	"SIAM J. Comput."
, volume =	13
, number =	1
, year =	1984
, pages =	"182--196"
, keywords =	"NP-completeness, packing, covering, proximity"
, update =	"98.03 bibrelex"
}

@article{tt-fldl-83
, author =	"N. Megiddo and A. Tamir"
, title =	"Finding least-distances lines"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	2
, year =	1983
, pages =	"207--211"
, keywords =	"design of algorithms, optimization, statistics"
, update =	"00.11 smid, 00.07 smid"
}

@article{mt-nrcpc-83
, author =	"N. Megiddo and A. Tamir"
, title =	"New results on the complexity of $p$-center problems"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"751--758"
, keywords =	"design of algorithms, graph theory, binary search, trees"
}

@article{mt-cllfp-82
, author =	"N. Megiddo and A. Tamir"
, title =	"On the complexity of locating linear facilities in the plane"
, journal =	"Oper. Res. Lett."
, volume =	1
, year =	1982
, pages =	"194--197"
, keywords =	"VLSI design, NP-completeness, points, lines, two-dimensional"
}

@article{mtzc-oaktn-81
, author =	"N. Megiddo and A. Tamir and E. Zemel and R. Chandrasekaran"
, title =	"An {$O(n (\log n)^{2})$} algorithm for the $k$-th nearest pair in a tree with applications to location problems"
, journal =	"SIAM J. Comput."
, volume =	10
, year =	1981
, pages =	"328--337"
, keywords =	"complexity theory, network algorithms, optimization, searching, centroid decomposition"
}

@article{mz-roawe-86
, author =	"N. Megiddo and E. Zemel"
, title =	"A randomized {$O(n \log n)$} algorithm for the weighted {Euclidean} $1$-center problem"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"358--368"
, keywords =	"Las Vegas, circles, proximity, weighted, worst-case analysis"
, update =	"97.03 agarwal"
}

@techreport{mzh-mclp-81
, author =	"N. Megiddo and E. Zemel and S. L. Hakimi"
, title =	"The maximum coverage location problem"
, type =	"Discuss. {Paper}"
, number =	490
, institution =	"Cent. Math. Stud. Econ. Manage. Sci., North-Western Univ."
, address =	"Evanston, IL"
, year =	1981
}

@techreport{m-ihtpt-93
, author =	"K. Mehlhorn"
, title =	"An implementation of the {Hopcroft} and {Tarjan} planarity test and embedding algorithm"
, type =	"Report"
, number =	"MPI-I-93-151"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, update =	"94.01 smid"
}

@article{m-awcdt-81
, author =	"K. Mehlhorn"
, title =	"Arbitrary weight changes in dynamic trees"
, journal =	"Theoretical Informatics"
, volume =	15
, year =	1981
, pages =	"183--211"
, update =	"98.03 bibrelex"
}

@book{m-dsass-81
, author =	"Kurt Mehlhorn"
, title =	"Data Structures and Algorithm 1: Sorting and Searching"
, series =	"EATCS Monographs on Theoretical Computer Science"
, volume =	1
, publisher =	"Springer-Verlag"
, address =	"Berlin/Heidelberg, Germany"
, year =	1981
, pages =	"68--71"
, precedes =	"m-ss-84"
, update =	"98.11 bibrelex"
}

@book{m-dsa-84
, author =	"Kurt Mehlhorn"
, title =	"Data Structures and Algorithms"
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, Germany"
, year =	1984
, note =	"Volumes 1--3"
, update =	"98.07 icking, 97.03 tamassia"
}

@book{m-ss-84
, author =	"Kurt Mehlhorn"
, title =	"Data Structures and Algorithms 1: Sorting and Searching"
, series =	"EATCS Monographs on Theoretical Computer Science"
, volume =	1
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, Germany"
, year =	1984
, isbn =	"3-540-13302-X"
, succeeds =	"m-dsass-81"
, update =	"98.11 bibrelex, 98.07 icking"
}

@book{m-ganc-84
, author =	"Kurt Mehlhorn"
, title =	"Data Structures and Algorithms 2: Graph Algorithms and {NP}-Completeness"
, series =	"EATCS Monographs on Theoretical Computer Science"
, volume =	2
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, Germany"
, year =	1984
, isbn =	"3-540-13641-X"
, update =	"98.07 icking"
}

@book{m-mdscg-84
, author =	"Kurt Mehlhorn"
, title =	"Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry"
, series =	"EATCS Monographs on Theoretical Computer Science"
, volume =	3
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, Germany"
, year =	1984
, isbn =	"3-540-13642-8"
, keywords =	"data structures,  algorithms, computational geometry, book"
, update =	"98.07 icking, 97.11 bibrelex"
}

@book{m-dea-86
, author =	"K. Mehlhorn"
, title =	"Datenstrukturen und effiziente Algorithmen 1"
, publisher =	"B. G. Teubner"
, address =	"Stuttgart, Germany"
, year =	1986
, update =	"98.11 bibrelex"
}

@article{m-lbets-85
, author =	"K. Mehlhorn"
, title =	"Lower bounds on the efficiency of transforming static data structures into dynamic structures"
, journal =	"Math. Syst. Theory"
, volume =	15
, year =	1985
, pages =	"1--16"
}

@inproceedings{m-pppd-96
, author =	"K. Mehlhorn"
, title =	"Position Paper for Panel Discussion"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, site =	"Philadelphia, PA, USA"
, month =	may
, year =	1996
, pages =	"111--112"
, update =	"97.11 held"
}

@techreport{mmo-cavd-89
, author =	"K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
, title =	"On the Construction of Abstract {Voronoi} Diagrams"
, type =	"Report"
, number =	"A01/89"
, institution =	"Department of Computer Science, Universit{\"a}t des Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1989
, keywords =	"Voronoi diagrams, randomized algorithms"
, precedes =	"mmo-cavd-90"
, update =	"99.07 bibrelex"
}

@inproceedings{mmo-cavd-90
, author =	"K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
, title =	"On the Construction of Abstract {Voronoi} Diagrams"
, booktitle =	"Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	415
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"227--239"
, succeeds =	"mmo-cavd-89"
, precedes =	"mmo-cavd-91"
, update =	"99.07 bibrelex"
}

@article{mmo-cavd-91
, author =	"K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
, title =	"On the Construction of Abstract {Voronoi} Diagrams"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"211--224"
, keywords =	"Voronoi diagrams, randomized algorithms"
, succeeds =	"mmo-cavd-90"
, update =	"99.07 bibrelex"
}

@techreport{mmr-fsavd-92
, author =	"K. Mehlhorn and S. Meiser and R. Rasch"
, title =	"Furthest site abstract {Voronoi} diagrams"
, type =	"Report"
, number =	"MPI-I-92-135"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
}

@inproceedings{mmnssuz-cbhdc-97
, author =	"K. Mehlhorn and M. M{\"u}ller and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig and J. Ziegler"
, title =	"A computational basis for higher dimensional computational geometry and Applications"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"254--263"
, cites =	"bdh-qach-96, blr-scanp-90, cms-frric-93, e-acg-87, e-sdrla-67, fgkss-ckbgc-96, mn-lpcgc-95, mnssssu-cgpvg-96, nu-lmum-95, mz-icha-94, s-tlip-86, y-fpaa-93, ZZZ"
, update =	"98.07 bibrelex+tamassia+vismara, 97.07 efrat"
}

@article{mmnssuz-cbhdc-98
, author =	"K. Mehlhorn and M. M{\"u}ller and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig and J. Ziegler"
, title =	"A Computational Basis for Higher-Dimensional Computational Geometry and Applications"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, number =	4
, year =	1998
, pages =	"289--303"
, succeeds =	"mmnssuz-cbhdc-97"
, update =	"98.11 devillers+vismara"
}

@inproceedings{mn-adslr-92
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"Algorithm design and software libraries: Recent developments in the {LEDA} project"
, booktitle =	"Algorithms, Software, Architectures, Information Processing 92"
, volume =	1
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	1992
, pages =	"493--505"
, update =	"00.11 smid, 00.07 icking, 97.11 bibrelex"
}

@article{mn-bodot-90
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"Bounded ordered dictionaries in {$O(\log\log n)$} time and {$O(n)$} space"
, journal =	"Inform. Process. Lett."
, volume =	35
, year =	1990
, pages =	"183--189"
, update =	"00.11 smid, 00.07 icking"
}

@manual{mn-cgs-96
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"Checking Geometric Structures"
, month =	dec
, year =	1996
, note =	"Program Documentation"
, update =	"00.11 smid, 00.07 icking, 98.11 tamassia, 97.03 tamassia"
}

@techreport{mn-dfc-86
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"Dynamic fractional cascading"
, type =	"Technical {Report}"
, number =	"??"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1986
, precedes =	"mn-dfc-90"
, update =	"00.11 smid, 00.07 icking"
}

@article{mn-dfc-90
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"Dynamic fractional cascading"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"215--241"
, succeeds =	"mn-dfc-86"
, update =	"00.11 smid, 00.07 icking"
}

@techreport{mn-islas-94
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"Implementation of a sweep line algorithm for the straight line segment intersection problem"
, type =	"Report"
, number =	"MPI-I-94-160"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"00.11 smid, 00.07 icking, 95.01 smid"
}

@techreport{mn-lledt-89
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"{LEDA}, a library of efficient data types and algorithms"
, type =	"Report"
, number =	"A 04/89"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1989
, comments =	"revisions published in MFCS '89 and ICALP '90"
, precedes =	"mn-lledt-89a"
, update =	"00.11 smid, 00.07 icking, 98.11 bibrelex, 93.05 jones"
}

@incollection{mn-lledt-89a
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"{LEDA}, a library of efficient data types and algorithms"
, booktitle =	"Proc. 14th Internat. Sympos. Math. Found. Comput. Sci."
, nickname =	"MFCS '89"
, series =	"Lecture Notes Comput. Sci."
, volume =	379
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"88--106"
, succeeds =	"mn-lledt-89"
, update =	"00.11 smid, 00.07 icking, 00.03 smid, 98.11 bibrelex"
}

@article{mn-lpcgc-95
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"{LEDA}: a platform for combinatorial and geometric computing"
, journal =	"Commun. ACM"
, volume =	38
, number =	1
, year =	1995
, pages =	"96--102"
, url =	"http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html"
, update =	"00.11 smid, 00.07 icking, 98.07 tamassia, 96.09 devillers, 96.01 tamassia"
}

@book{mn-lpcgc-00
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"{LEDA}: A Platform for Combinatorial and Geometric Computing"
, publisher =	"Cambridge University Press"
, address =	"Cambridge, UK"
, year =	2000
, update =	"00.11 smid, 00.07 icking, 00.03 orourke+smid+vismara, 98.07 orourke"
}

@inproceedings{mn-iga-94
, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
, title =	"The Implementation of Geometric Algorithms"
, booktitle =	"Proc. 13th World Computer Congress IFIP94"
, volume =	1
, year =	1994
, pages =	"223--231"
, update =	"00.11 smid, 00.07 icking, 97.03 devillers"
}

@techreport{mna-lbcus-86
, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Helmut Alt"
, title =	"A lower bound for the complexity of the union-split-find problem"
, type =	"Technical {Report}"
, number =	"??"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1986
, precedes =	"mna-lbcus-88"
, update =	"00.11 smid, 00.07 icking"
}

@article{mna-lbcus-88
, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Helmut Alt"
, title =	"A lower bound on the complexity of the union-split-find problem"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"1093--1102"
, succeeds =	"mna-lbcus-86"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{mnssssu-cgpvg-96
, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Thomas Schilz and Stefan Schirra and Michael Seel and Raimund Seidel and Christian Uhrig"
, title =	"Checking Geometric Programs or Verification of Geometric Structures"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"159--165"
, cites =	"as-rst-89, abs-hgach-97, bk-ptctw-89, blr-scanp-90, bms-dgc-94, cs-arscg-89, cms-frric-93, egs-oplms-86, k-osps-83, m-dsa-84, mn-adslr-92, mn-lpcgc-95, mz-icha-94, nu-lmum-95, r-dcptr-94, st-pplup-86, s-chdch-86, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@unpublished{mnssssu-cgpvg-97
, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Thomas Schilz and Stefan Schirra and Michael Seel and Raimund Seidel and Christian Uhrig"
, title =	"Checking Geometric Programs or Verification of Geometric Structures"
, year =	1997
, note =	"Manuscript"
, update =	"97.11 bibrelex, 97.03 tamassia"
}

@techreport{mnssu-acbhd-96
, author =	"K. Mehlhorn and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig"
, title =	"A computational basis for higher-dimensional computational geometry"
, type =	"Report"
, number =	"MPI-I-96-1-016"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1996
, update =	"96.09 smid"
}

@article{mnssssu-cgpvg-99
, author =	"K. Mehlhorn and S. N{\"a}her and M. Seel and R. Seidel and T. Schilz and S. Schirra and C. Uhrig"
, title =	"Checking Geometric Programs or Verification of Geometric Structures"
, journal =	"Comput. Geom. Theory Appl."
, volume =	12
, number =	"1--2"
, year =	1999
, pages =	"85--103"
, succeeds =	"mnssssu-cgpvg-96"
, update =	"99.07 smid+vismara"
}

@article{mnu-hleir-90
, author =	"K. Mehlhorn and S. N{\"a}her and C. Uhrig"
, title =	"Hidden line elimination for isooriented rectangles"
, journal =	"Inform. Process. Lett."
, volume =	35
, year =	1990
, pages =	"137--143"
}

@inproceedings{mnu-lpcgc-97
, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Christian Uhrig"
, title =	"The {LEDA} Platform for Combinatorial and Geometric Computing"
, editor =	"P. Degano and R. Gorrieri and A. Marchetti-Spaccamela"
, booktitle =	"Automata, Languages and Programming (Proc. ICALP~'97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1256
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"7--16"
, update =	"98.07 tamassia+vismara"
}

@article{mo-oddsp-81
, author =	"K. Mehlhorn and M. H. Overmars"
, title =	"Optimal dynamization of decomposable searching problems"
, journal =	"Inform. Process. Lett."
, volume =	12
, year =	1981
, pages =	"93--98"
}

@article{mp-rtr-86
, author =	"K. Mehlhorn and F. P. Preparata"
, title =	"Routing through a rectangle"
, journal =	"J. ACM"
, volume =	33
, year =	1986
, pages =	"60--85"
}

@article{mps-crkkm-86
, author =	"K. Mehlhorn and F. P. Preparata and M. Sarrafzadeh"
, title =	"Channel routing in knock-knee mode: {Simplified} algorithms and proofs"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"213--221"
, update =	"98.03 bibrelex"
}

@inproceedings{ms-iftml-01
, author =	"Kurt Mehlhorn and Michael Seel"
, title =	"Infimaximal Frames: A Technique for Making Lines Look Like Segments"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"78--81"
, update =	"01.04 icking"
}

@techreport{msw-teeri-93t
, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
, title =	"Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection"
, type =	"Report"
, number =	"MPI-I-93-103"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, succeeds =	"msw-tescr-92"
, precedes =	"msw-teeri-93a"
, update =	"98.03 mitchell, 94.01 smid, 93.05 smid"
}

@article{msw-teeri-93a
, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
, title =	"Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"235--246"
, succeeds =	"msw-teeri-93t"
, update =	"98.03 mitchell, 94.01 smid"
}

@techreport{msw-tescr-91
, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
, title =	"Tail estimates for the space complexity of randomized incremental algorithms"
, type =	"Report"
, number =	"MPI-I-91-113"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1991
, precedes =	"msw-tescr-92"
, update =	"98.03 mitchell"
}

@inproceedings{msw-tescr-92
, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
, title =	"Tail estimates for the space complexity of randomized incremental algorithms"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"89--93"
, succeeds =	"msw-tescr-91"
, precedes =	"msw-tescr-93"
, update =	"98.03 mitchell, 97.11 bibrelex, 93.05 smid"
}

@article{msw-tescr-93
, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
, title =	"Tail Estimates for the Space Complexity of Randomized Incremental Algorithms"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1993
, pages =	"185--246"
, update =	"98.03 mitchell, 97.03 gaertner+salinger"
}

@inproceedings{msy-crcp-97
, author =	"K. Mehlhorn and T. Shermer and C. Yap"
, title =	"A Complete Roundness Classification Procedure"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"129--138"
, cites =	"cy-sp-87, dgr-eaoac-97, efnn-rauvd-89, fh-rcgtt-91, f-gta-92, gr-fspc-97, ll-orpr-91, pbc-muccm-93, rlw-rdtrp-91, rz-epccm-92, sj-wrspp-94, sv-dtm-93, s-oardc-93, y-ecgtm-95, yc-imgt-96, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{ms-itpow-85
, author =	"K. Mehlhorn and K. Simon"
, title =	"Intersecting two polyhedra one of which is convex"
, editor =	"L. Budach"
, booktitle =	"Proc. Found. Comput. Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	199
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"534--542"
}

@incollection{mt-ds-90
, author =	"K. Mehlhorn and A. Tsakalidis"
, title =	"Data Structures"
, editor =	"J. van Leeuwen"
, booktitle =	"Algorithms and Complexity"
, series =	"Handbook of Theoretical Computer Science"
, volume =	"A"
, publisher =	"Elsevier"
, address =	"Amsterdam"
, year =	1990
, pages =	"303--334"
, keywords =	"dictionary problem, persistence, union-split-find problem, priority queues, nearest common ancestors, selection, merging, dynamization techniques, survey paper"
, update =	"97.03 pocchiola+tamassia"
}

@article{mv-rdspp-84
, author =	"K. Mehlhorn and U. Vishkin"
, title =	"Randomized and deterministic simulations of {PRAM}s by parallel machines with restricted granularity of parallel memories"
, journal =	"Acta Inform."
, volume =	9
, number =	1
, year =	1984
, pages =	"29--59"
, update =	"96.09 orourke"
}

@article{my-cwgth-91
, author =	"K. Mehlhorn and C. Yap"
, title =	"Constructive {Whitney}-{Graustein} theorem, or how to untangle closed planar curves"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"603--621"
}

@inproceedings{my-chthu-88
, author =	"K. Mehlhorn and C. K. Yap"
, title =	"Constructive {Hopf}'s theorem: or how to untangle closed planar curves"
, booktitle =	"Proc. 15 Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	317
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"410--423"
, update =	"97.11 bibrelex"
}

@inproceedings{mg-fbrss-93
, author =	"H. Mehrotra and J. E. Gary"
, title =	"Feature-based retrieval of similar shapes"
, booktitle =	"Proc. 9th IEEE Intl. Conf. on Data Engineering"
, year =	1996
, pages =	"108--115"
, update =	"97.07 agarwal"
}

@inproceedings{mmn-cia2d-90
, author =	"S. Mehta and M. Mukherjee and G. Nagy"
, title =	"Constrained integer approximation to $2$-d line intersections"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"302--305"
, cites =	"ZZZ"
, update =	"98.07 bibrelex"
}

@article{mi-rnsue-94
, author =	"Aohan Mei and Yoshihide Igarashi"
, title =	"A Robot Navigation Strategy in Unknown Environment and its Efficiency"
, journal =	"IEICE Trans. Fundamentals Electronics, Comm. and Comput. Sci."
, volume =	"E77-A"
, number =	7
, month =	jul
, year =	1994
, pages =	"1157--1162"
, keywords =	"competitive analysis, shortest paths, on-line navigation"
, update =	"98.03 mitchell"
}

@article{mi-esrnu-94
, author =	"Aohan Mei and Yoshihide Igarashi"
, title =	"An Efficient Strategy for Robot Navigation in Unknown Environment"
, journal =	"Inform. Process. Lett."
, volume =	52
, year =	1994
, pages =	"51--56"
, keywords =	"competitive analysis, shortest paths, on-line navigation"
, precedes =	"mi-esrnu-94a"
, update =	"98.07 icking, 98.03 mitchell"
}

@inproceedings{mi-esrnu-94a
, author =	"Aohan Mei and Yoshihide Igarashi"
, title =	"Efficient Strategies for Robot Navigation in Unknown Environment"
, booktitle =	"Proc. 21st Internat. Colloq. Automata Lang. Prog."
, nickname =	"ICALP '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	820
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"630--641"
, succeeds =	"mi-esrnu-94"
, update =	"98.07 icking"
}

@inproceedings{m-ardts-85
, author =	"A. Meier"
, title =	"Applying relational database techniques to solid modeling"
, booktitle =	"Proc. GI Conf. Database Syst. for Auto. Eng. and Sci. Applic."
, site =	"Karlsruhe, West Germany"
, year =	1985
, pages =	"??"
, update =	"94.05 devillers"
}

@inproceedings{mr-cmwts-91
, author =	"H. Meijer and D. Rappaport"
, title =	"Computing the minimum weight triangulation of a set of linearly ordered points"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"175--178"
, cites =	"a-pmwt-90, gj-cigtn-79, g-nrpt-79, k-ndot-80, k-mtpd-80, l-olbng-87, l-gdtan-86, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{mr-mpcpl-90
, author =	"H. Meijer and D. Rappaport"
, title =	"Minimum polygon covers of parallel line segments"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"324--327"
, cites =	"cr-wim-41, gs-spscp-89, lmr-mpcil-90, t-p4-87, ZZZ"
, update =	"98.07 bibrelex"
}

@article{mr-ulbnm-90
, author =	"H. Meijer and D. Rappaport"
, title =	"Upper and lower bounds for the number of monotone crossing free {Hamiltonian} cycles from a set of points"
, journal =	"Ars Combin."
, volume =	30
, year =	1990
, pages =	"203--208"
, update =	"98.07 bibrelex"
}

@inproceedings{ms-rpxr-93
, author =	"H. Meijer and S. Skiena"
, title =	"Reconstructing polygons from x-rays"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"381--386"
, precedes =	"ms-rpxr-96"
, cites =	"by-psncp-89, cy-sp-87, es-pcpxr-88, f-hxpsm-83, f-xpps-83, g-sxpcb-83, g-xrp-92, gg-sdvpx-92, gm-hxp-80, g-beess-62, h-p2-63, h-irpfc-80, h-sict-83, l-rpp-88, lb-rpscu-91, n-rpoca-88, r-bfigm-17, rsfl-sudp-91, sk-ctnmx-78, s-gp-88, s-ckpps-90, s-irgp-92, ssw-pmapr-77, v-tpshp-86, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
}

@article{ms-rpxr-96
, author =	"H. Meijer and S. Skiena"
, title =	"Reconstructing polygons from x-rays"
, journal =	"Geom. Dedicata"
, volume =	61
, year =	1996
, pages =	"191--204"
, succeeds =	"ms-rpxr-93"
, update =	"98.03 mitchell"
}

@techreport{m-iaeln-53
, author =	"J. L. Meijering"
, title =	"Interface area, edge length, and number of vertices in crystal aggregates with random nucleation"
, type =	"Research {Report}"
, number =	8
, institution =	"Philips"
, year =	1953
, pages =	"270--290"
}

@book{mbmv-iugis-94
, author =	"A. M. J. Meijerink and H. A. M. de Brouwer and C. M. Mannaerts and C. R. Valenzuela"
, title =	"Introduction to the Use of Geographic Information Systems for Practical Hydrology"
, series =	"ITC Publications"
, number =	23
, publisher =	"ITC"
, address =	"Enschede"
, year =	1994
, update =	"96.09 kreveld"
}

@article{m-gpinn-87
, author =	"A. Meir"
, title =	"A geometric problem involving the nearest neighbor algorithms"
, journal =	"Oper. Res. Lett."
, volume =	6
, year =	1987
, pages =	"289--291"
, update =	"97.11 bibrelex"
}

@article{mm-anrt-78
, author =	"A. Meir and J. W. Moon"
, title =	"On the altitude of nodes in random trees"
, journal =	"Cand. J. Math."
, volume =	30
, year =	1978
, pages =	"997--1015"
, update =	"97.11 bibrelex"
}

@inproceedings{m-cavd-89
, author =	"S. Meiser"
, title =	"On the Construction of Abstract {Voronoi} Diagrams"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{m-pla-88
, author =	"S. Meiser"
, title =	"Point location in arrangements"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"71--84"
, succeeds =	"m-seavh-88"
, precedes =	"m-plah-93"
, update =	"00.03 bibrelex, 99.11 bibrelex, 94.01 smid"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@article{m-plah-93
, author =	"S. Meiser"
, title =	"Point location in arrangements of hyperplanes"
, journal =	"Inform. Comput."
, volume =	106
, year =	1993
, pages =	"286--303"
, succeeds =	"m-pla-88"
, update =	"94.01 smid"
}

@techreport{m-seavh-88
, author =	"S. Meiser"
, title =	"Suche in einem {Arrangement} von {Hyperebenen}"
, type =	"Report"
, number =	"??"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1988
, precedes =	"m-pla-88"
}

@phdthesis{m-zkav-93
, author =	"S. Meiser"
, title =	"Zur {Konstruktion} abstrakter {Voronoidiagramme}"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"93.05 smid"
}

@article{m-phe-75
, author =	"G. Meisters"
, title =	"Polygons have ears"
, journal =	"Amer. Math. Monthly"
, volume =	82
, year =	1975
, pages =	"648--651"
, keywords =	"two-dimensional, triangles, polygon triangulation"
}

@inproceedings{ms-cinap-92
, author =	"E. A. Melissaratos and D. L. Souvaine"
, title =	"Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"202--211"
, succeeds =	"ms-cinap-91"
, cites =	"bgr-ntp-88, b-pug-90, beg-pgmg-90, be-psntp-91, be-mgot-92i, ceghss-sdash-90, c-cdt-87, c-gqtm-89, etw-otama-90, ff-mrnti-, f-cfemg-72, j-fetcr-84, lg-gcvfm-85, ll-gdtpg-86, ms-cinap-91, s-qrhds-84, s-dasds-90, sf-afem-73, s-aagcf-88, t-brtgi-80, ys-mqafe-83, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{ms-cinap-91
, author =	"E. A. Melissaratos and D. L. Souvaine"
, title =	"Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes for the finite element method"
, type =	"Report"
, number =	"LCSR-TR-163"
, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1991
, keywords =	"mesh generation, aspect ratio, quality triangulation, finite element method"
, precedes =	"ms-cinap-92"
}

@inproceedings{ms-sgopu-90
, author =	"E. A. Melissaratos and D. L. Souvaine"
, title =	"On solving geometric optimization problems using shortest paths"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"350--359"
, precedes =	"ms-sphsg-90"
, cites =	"a-lncg-88, acy-macp-85, akmsw-gamsa-87, ap-nsmma-88, bddg-fep-85, cy-psppp-86, c-pop-86, cg-vippg-85, ck-plscc-89, d-paope-87, dko-fliet-87, ds-gmmmc-79, ds-cgcw-90, dsv-diss-88, f-fapct-85, gjpt-tsp-78, ghlst-ltavs-87, gs-ccrs-87, gs-pmgsc-85, h-ovgat-89, kl-fstcg-85, fm-tspep-84, l-tpfc-88, ms-sabcp-89, oamb-oafme-86, ol-mcp-81, s-cgcw-86, tv-otats-88, ZZZ"
, update =	"01.04 icking, 97.11 bibrelex"
}

@techreport{ms-sphsg-90
, author =	"E. A. Melissaratos and D. L. Souvaine"
, title =	"Shortest paths help solve geometric optimization problems on planar regions"
, type =	"Report"
, number =	"LCSR-TR-150"
, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1990
, keywords =	"design of algorithms, visibility, shortest paths, optimization, inscribed, circumscribed, separator, curved polygon, splinegon"
, succeeds =	"ms-spvop-90, ms-sgopu-90"
}

@inproceedings{ms-spvop-90
, author =	"E. A. Melissaratos and D. L. Souvaine"
, title =	"Shortest paths, visibility, and optimization problems in planar curvilinear objects"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"337--342"
, precedes =	"ms-sphsg-90"
, cites =	"cg-vippg-85, ds-cgcw-90, dsv-diss-88, egs-oplms-86, gh-ospqs-87, ghlst-ltavs-87, h-ovgat-89, fm-tspep-84, ms-sgopu-90, s-cgcw-86, tv-tsp-87, ZZZ"
, update =	"01.04 icking, 98.07 bibrelex"
}

@inproceedings{m-astd-97
, author =	"M. Melkemi"
, title =	"A-Shapes and their derivatives"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"367--369"
, cites =	"eks-sspp-83, mm-addp-95, m-cspps-96, m-asfps-96, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{m-asfps-96
, author =	"M. Melkemi"
, title =	"A-shapes of a finite point set"
, type =	"Technical {Report}"
, number =	"LIGIM-TR.02.96"
, institution =	"LIGIM Universit{\'e} Claude Bernard Lyon"
, year =	1996
, update =	"98.07 bibrelex"
}

@techreport{m-cspps-96
, author =	"M. Melkemi"
, title =	"Computing the shape of a planar point set"
, type =	"Technical {Report}"
, number =	"LIGIM-TR.01.96"
, institution =	"LIGIM Universit{\'e} Claude Bernard Lyon"
, year =	1996
, note =	"Submitted to Pattern Recognition Journal"
, update =	"98.07 bibrelex"
}

@inproceedings{md-cspps-99
, author =	"Mahmoud Melkemi and Mourad Djebali"
, title =	"Computing the Shape of a Planar Points Set"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"69--71"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@incollection{mm-addp-95
, author =	"M. Melkemi and L. Melkemi"
, title =	"An algorithm for detecting dot patterns"
, editor =	"R. A. Earnshaw and J. A. Vince"
, booktitle =	"Computer Graphics"
, publisher =	"Academic Press"
, address =	"Leeds, UK"
, year =	1995
, pages =	"161--169"
, update =	"98.07 bibrelex"
}

@article{m-olcch-87
, author =	"A. Melkman"
, title =	"On-line construction of the convex hull of a simple polyline"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"11--12"
}

@techreport{m-apcp-85
, author =	"A. Melkman"
, title =	"On the approximation of polygonal curves in the plane"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Math. Comput. Sci., Univ. Negev"
, year =	1985
}

@incollection{mo-pca-88
, author =	"A. Melkman and J. O'Rourke"
, title =	"On polygonal chain approximation"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"87--95"
, keywords =	"approximation, circles"
}

@book{m-camap-91
, author =	"L. S. H. d. Mello"
, title =	"Computer-Aided Mechanical Assembly Planning"
, publisher =	"Kluwer Academic Publishers"
, address =	"Boston"
, year =	1991
, update =	"98.03 bibrelex"
}

@article{mks-eapuc-77
, author =	"T. W. Melnyk and O. Knop and W. R. Smith"
, title =	"Extremal arrangements of points and unit charges on a sphere: equilibrium configurations revisited"
, journal =	"Can. J. Chem."
, volume =	"??"
, year =	1977
, update =	"97.11 bibrelex"
}

@incollection{m-istam-85
, author =	"R. C. Melville"
, title =	"An implementation study of two algorithms for the minimum spanning circle problem"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"267--294"
}

@book{m-ccm-76
, author =	"Z. A. Melzak"
, title =	"Companion to concrete mathematics"
, volume =	2
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1976
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{m-ps-61
, author =	"Z. A. Melzak"
, title =	"On the problem of {Steiner}"
, journal =	"Canad. Math. Bull."
, volume =	4
, year =	1961
, pages =	"143--148"
}

@article{m-pmcl-61
, author =	"Z. A. Melzak"
, title =	"Plane motion with curvature limitations"
, journal =	"J. Soc. Indust. Appl. Math."
, volume =	9
, year =	1961
, pages =	"422--432"
, update =	"94.05 devillers"
}

@inproceedings{m-srups-95
, author =	"Robert Mencl"
, title =	"Surface Reconstruction from Unorganized Points in Space"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"67--70"
, update =	"00.03 bibrelex"
}

@book{m-it-62
, author =	"B. Mendelson"
, title =	"Introduction to Topology"
, publisher =	"Allyn \& Bacon"
, address =	"Boston"
, year =	1962
, update =	"97.11 bibrelex"
}

@misc{m-hpvs-92
, author =	"X. Mendonca"
, title =	"Heuristics for Planarization by Vertex Splitting"
, institution =	"University of Newcastle"
, year =	1992
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{m-fsmgm-87
, author =	"A. C.-C. Meng"
, title =	"Free-Space Modeling and Geometric Motion Planning Under Unexpected Obstacles"
, type =	"Technical {Report}"
, institution =	"Texas Instruments Artificial Intelligence Lab"
, year =	1987
, update =	"93.09 milone+mitchell"
}

@techreport{m-fsmpp-??
, author =	"A. C.-C. Meng"
, title =	"Free-Space Modeling and Path Planning Under Uncertainty for Autonomous Air Robots"
, type =	"Manuscript"
, institution =	"School of Operations Research and Industrial Engineering, Cornell University"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@article{m-uuam-28
, author =	"K. Menger"
, title =	"Untersuchungen {\"u}ber allgemeine {Metrik}"
, journal =	"Math. Ann."
, volume =	100
, year =	1928
, pages =	"75--163"
, update =	"00.03 bibrelex"
}

@inproceedings{ms-esasg-90
, author =	"A. Menn and A. K. Somani"
, title =	"An Efficient Sorting Algorithm for the Star Graph Interconnection Network"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, month =	aug
, year =	1990
, pages =	"1--8"
, update =	"98.07 bibrelex"
}

@article{mg-ffmbb-98
, author =	"J. Menon and B. Guo"
, title =	"Free-Form Modeling in Bilateral Brep and CSG Representation Schemes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"537--576"
, update =	"98.11 devillers"
}

@article{mr-anvmp-93
, author =	"J. P. Menon and D. M. Robinson"
, title =	"Advanced {NC} Verification via Massively Parallel Raycasting"
, journal =	"Manufact. Review"
, volume =	6
, number =	2
, month =	jun
, year =	1993
, pages =	"141--154"
, update =	"95.01 held"
}

@article{mv-tcfnv-93
, author =	"J. P. Menon and H. B. Voelcker"
, title =	"Toward a Comprehensive Formulation of {NC} Verification as a Mathematical and Computational Problem"
, journal =	"J. Design \& Manufact."
, volume =	3
, year =	1993
, pages =	"263--277"
, update =	"95.01 held"
}

@inproceedings{m-piadt-92
, author =	"M. L. Merriam"
, title =	"Parallel implementation of an algorithm for {Delaunay} triangulation"
, booktitle =	"1st European Comput. Fluid Dynamics Conf."
, month =	sep
, year =	1992
, pages =	"907--912"
, update =	"97.11 bibrelex"
}

@article{m-rcrec-73
, author =	"R. D. Merrill"
, title =	"Representation of contours and regions for efficient computer search"
, journal =	"Commun. ACM"
, volume =	16
, year =	1973
, pages =	"69--82"
}

@article{m-cancp-85
, author =	"A. {Mesa Henriquez}"
, title =	"{CONVY}: an algorithm for the nonoverlapping covering of polygons by convex sets ({Spanish} {English} summary)"
, journal =	"Investigaci{\'o}n Oper."
, volume =	6
, year =	1985
, pages =	"79--94"
}

@article{m-hachc-85
, author =	"A. {Mesa Henriquez}"
, title =	"{HODY}: an algorithm for constructing the hodograph of convex polygons ({Spanish} {English} summary)"
, journal =	"Investigaci{\'o}n Oper."
, volume =	6
, year =	1985
, pages =	"95--110"
}

@inproceedings{mrl-tdugg-91
, author =	"S. Meshkat and J. Ruppert and H. Li"
, title =	"Three-dimensional unstructured grid generation based on {Delaunay} tetrahedralization"
, booktitle =	"Proc. 3 Int. Conf. Numerical Grid Generation"
, month =	jun
, year =	1991
, pages =	"841--851"
, update =	"98.11 bibrelex"
}

@article{ms-vdmcp-87
, author =	"S. N. Meshkat and C. M. Sakkas"
, title =	"Voronoi diagram for multiply-connected polygonal domains {II}: implementation and application"
, journal =	"IBM J. Res. Develop."
, volume =	31
, year =	1987
, pages =	"373--381"
, keywords =	"Voronoi diagram, polygonal domains, resistance networks, two-dimensional VLSI geometry, boundary representation"
}

@techreport{m-alldg-88
, author =	"E. B. Messinger"
, title =	"Automatic Layout of Large Directed Graphs"
, number =	"88-07-08"
, institution =	"Department of Computer Science, University of Washington"
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{mrh-dcaal-91
, author =	"E. B. Messinger and L. A. Rowe and R. H. Henry"
, title =	"A Divide-and-Conquer Algorithm for the Automatic Layout of Large Directed Graphs"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-21"
, number =	1
, year =	1991
, pages =	"1--12"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{mps-anpao-98
, author =	"P. T. Metaxas and G. E. Pantziou and A. Symvonis"
, title =	"A note on parallel algorithms for optimal h-v drawings of binary trees"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, year =	1998
, pages =	"145--158"
, update =	"98.03 smid"
}

@inproceedings{mps-phvdb-94
, author =	"P. T. Metaxas and G. E. Pantziou and A. Symvonis"
, title =	"Parallel h-v Drawings of Binary Trees"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"487--495"
, keywords =	"graph drawing, trees"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell, 95.01 tamassia"
}

@article{mk-oaibr-91
, author =	"N. N. Metel'skii and V. S. Krikun"
, title =	"Optimal arrangement of isothetic blocks with respect to approximation criteria (in Russian)"
, journal =	"Doklady Akad. Nauk SSSR"
, volume =	317
, number =	2
, year =	1991
, pages =	"320--323"
, keywords =	"generalized convexity, visibility, isothetic domain, $S-$convex hull"
, update =	"95.01 korneenko"
, annote =	"The $S$-convex hull for an isothetic
   domain is in fact the minimal externally isothetically visible
   hull. An $O(n\log n+r)$ time  algorithm for computing the
   $S$-convex hull of an $n$-vertex isothetic domain is given, where
   $r$ is the number of vertices of the hull."
}

@article{m-ptlsa-84
, author =	"F. {Meyer auf der Heide}"
, title =	"A Polynomial Time Linear Search Algorithm for the $n$-Dimensional Knapsack Problem"
, journal =	"J. ACM"
, volume =	31
, year =	1984
, pages =	"668--676"
, keywords =	"NP-complete, knapsack, linear search algorithm, nonuniform algorithm"
, update =	"93.09 erickson"
, annote =	"For every fixed $n$, there exists a linear search algorithm which solves the $n$-dimensional knapsack problem in $O(n^4\log n)$ time."
}

@incollection{m-hsssm-93
, author =	"F. {Meyer auf der Heide}"
, title =	"Hashing stratefies for simulating shared memory on distributed memory machines"
, booktitle =	"Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium"
, series =	"Lecture Notes Comput. Sci."
, volume =	678
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	""
, update =	"96.09 orourke"
}

@article{m-mt-94
, author =	"D. Meyers"
, title =	"Multiresolutional Tiling"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	5
, month =	dec
, year =	1994
, pages =	"325--340"
, update =	"96.01 held"
}

@article{mss-sc-92
, author =	"David Meyers and Shelley Skinner and Kenneth Sloan"
, title =	"Surfaces from Contours"
, journal =	"ACM Trans. Graph."
, volume =	11
, number =	3
, month =	jul
, year =	1992
, pages =	"228--258"
, annote =	"Makes triangulated mesh from contour slices. Breaks
		 into four subproblems: correspondence (which contours
		 to connect), tiling (how to connect), branching (what
		 to do with branches), and fitting surface to the mesh.
		 Interesting (to me) bit is branching -- when two
		 contours merge we must triangulate the polygon between
		 them. Uses ear cutting to construct original
		 triangulation and Delaunay flips to improve it. Also
		 considers flips that encourage triangles that connect
		 the contours to be merged."
}

@inproceedings{mss-sccbp-91
, author =	"D. Meyers and S. Skinner and K. Sloan"
, title =	"Surfaces from contours: the correspondence and branching problem"
, booktitle =	"Proc. Graphics Interface '91"
, year =	1991
, pages =	"246--254"
, update =	"98.03 bibrelex"
}

@article{mdr-cssoo-93
, author =	"Scott Meyers and Carolyn K. Duby and Steven P. Reiss"
, title =	"Constraining the structure and style of object-oriented programs"
, journal =	"Proc. First Workshop on Principles and Practice of Constraint Programming"
, volume =	"??"
, month =	apr
, year =	1993
, update =	"97.03 tamassia"
}

@article{mr-esmvs-92
, author =	"Scott Meyers and Steven P. Reiss"
, title =	"An empirical study of multiple-view software development"
, journal =	"Software Engineering Notes"
, volume =	17
, number =	5
, month =	dec
, year =	1992
, pages =	"47--57"
, update =	"97.03 tamassia"
}

% m-thasa-94 quotes this work incompletely.
@article{m--91
, author =	"P. G. Mezey"
, journal =	"J. Math. Chem."
, volume =	8
, year =	1991
, update =	"98.11 bibrelex"
}

@incollection{m-ms-90
, author =	"P. G. Mezey"
, title =	"Molecular surfaces"
, editor =	"K. B. Lipkowitz and D. B. Boyd"
, booktitle =	"Reviews in Computational Chemistry"
, volume =	1
, publisher =	"VCH Publishers"
, year =	1990
, update =	"98.03 agarwal+bibrelex"
}

@book{m-scims-93
, author =	"P. G. Mezey"
, title =	"Shape in Chemistry: An Introduction to Molecular Shape and Topology"
, publisher =	"VCH Publ."
, address =	"New York"
, year =	1993
, update =	"98.11 bibrelex"
}

@inproceedings{m-thasa-94
, author =	"P. G. Mezey"
, title =	"The T-Hull Approach to Shape Analysis"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"231--236"
, cites =	"eks-sspp-83, m--91, m-scims-93"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{d-qnsa-97
, author =	"Dominique Michelucci"
, title =	"A Quadratic Non--Standard Arthmetic"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"123--128"
, update =	"01.07 devillers, 97.11 jones"
}

@inproceedings{m-aigc-96
, author =	"D. Michelucci"
, title =	"Arithmetic isuues in geometric computations"
, booktitle =	"Proc. 2nd Real Numbers and Computer Conf."
, site =	"Marseille, France"
, year =	1996
, pages =	"43--69"
, update =	"97.03 devillers"
}

@phdthesis{m-rfqcd-87
, author =	"D. Michelucci"
, title =	"Les repr{\'e}sentations par les fronti{\'e}res: quelques constructions; difficulte{\'e}s renconctr{\'e}es"
, type =	"Th{\`e}se de Doctorat en Sciences"
, school =	"{\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
, year =	1987
, keywords =	"doctoral thesis"
, update =	"99.03 forrest, 98.11 bibrelex, 97.03 devillers, 93.03 rote"
}

@techreport{mz-lubgj-88
, author =	"S. R. Middila and D. Zhou"
, title =	"Lower and upper bounds for the general junction routing problem"
, type =	"Report"
, number =	"ACT-90"
, institution =	"Coordinated Science Lab."
, address =	"Univ. of IL"
, month =	may
, year =	1988
, update =	"98.07 bibrelex"
}

@article{mz-rgj-89
, author =	"S. R. Middila and D. Zhou"
, title =	"Routing in general junctions"
, journal =	"IEEE Trans. on CAD"
, volume =	8
, number =	11
, month =	nov
, year =	1989
, pages =	"1174--1184"
, update =	"98.07 bibrelex"
}

@techreport{m-snct-73
, author =	"A. E. Middleditch"
, title =	"Survey of Numerical Controller Technology"
, institution =	"Univ. Rochester"
, address =	"Rochester, NY"
, year =	1973
, note =	"Production Automation Project TR-1-D"
, update =	"99.03 forrest, 98.03 bibrelex"
}

@incollection{m-rmcp-88
, author =	"A. E. Middleditch"
, title =	"The representation and manipulation of convex polygons"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"211--252"
, update =	"99.11 bibrelex"
}

@article{ms-bsstv-85a
, author =	"A. E. Middleditch and K. H. Sears"
, title =	"Blend Surfaces for Set Theoretic Volume Modeling Systems"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, year =	1985
, pages =	"161--170"
, note =	"Proc. SIGGRAPH '85"
, update =	"99.03 forrest, 98.03 bibrelex"
}

@article{mst-ialc-89
, author =	"A. E. Middleditch and T. W. Stacey and S. B. Tor"
, title =	"Intersection algorithms for lines and circles"
, journal =	"ACM Trans. Graph."
, volume =	8
, year =	1989
, pages =	"25--40"
}

@phdthesis{m-smdnt-93
, author =	"T. Midtb{\o}"
, title =	"Spatial Modelling by {Delaunay} Networks of Two and Three Dimensions"
, type =	"Ph.{D}. Thesis"
, school =	"Norvegian Institute of Technology"
, address =	"Trondheim"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"98.07 devillers"
}

@book{m-mca-92
, author =	"M. Mignotte"
, title =	"Mathematics for Computer Algebra"
, publisher =	"Springer-Verlag"
, year =	1992
, update =	"98.03 bibrelex"
}

@article{mnr-cochp-94
, author =	"A. Mikheev and M. Nozik and J. Rubinstein"
, title =	"Computation of Offset Curves by the Huygens Principle"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	4
, month =	oct
, year =	1994
, pages =	"249--252"
, update =	"96.01 held"
}

@inproceedings{m-cacau-89
, author =	"V. Milenkovic"
, title =	"Calculating approximate curve arrangements using rounded arithmetic"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"197--207"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, cites =	"acm-aacad-88, acm-cad1b-84, acm-cad2a-84, c-qercf-75, cr-tlcra-88, em-sstcd-87, gy-frcg-86, hhk-tirgc-88, hhk-rsops-87, h-pargc-88, k-rmrs-89, kln-edtur-89, m-vigau-88a, m-vigau-88t, otu-nsga-87, r-paff-80, gss-egbra-89, ss-pmp2g-83, ss-ccsm-85, ss-pponp-88, s-aefsm-87, t-dmeag-51, y-gctsp-88, ZZZ"
, update =	"98.03 bibrelex, 97.03 daniels"
}

@inproceedings{m-dpggt-89
, author =	"V. Milenkovic"
, title =	"Double precision geometry: {A} general technique for calculating line and segment intersections using rounded arithmetic"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"500--505"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, update =	"98.03 agarwal, 97.03 daniels"
}

@inproceedings{m-pbpap-95
, author =	"Victor Milenkovic"
, title =	"Position-Based Physics: Animating and Packing Spheres Inside Polyhedra"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"79--84"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"computer graphics, simulation, physically-based modeling, linear programming, Minkowski sum, configuration space"
, update =	"97.03 daniels, 95.09 jones"
}

@inproceedings{m-pbpsm-96
, author =	"Victor Milenkovic"
, title =	"Position-based physics: simulating the motion of many highly interacting spheres and polyhedra"
, booktitle =	"Computer Graphics"
, year =	1996
, pages =	"129--136"
, note =	"Proc. SIGGRAPH '96"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"computer graphics, animation, physically-based modeling, linear programming, Minkowski sum, configuration space"
, update =	"97.03 daniels"
}

@inproceedings{m-rcvdp-93
, author =	"V. Milenkovic"
, title =	"Robust construction of the {Voronoi} diagram of a polyhedron"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"473--478"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, cites =	"ck-acp-70, b-tends-67, cs-arscg-89, e-acg-87, f-smpst-90, f-savd-87, fm-nsala-91, ghms-apsml-91, hhk-tirgc-88, iss-nriac-92, l-knnvd-82, ld-gvdp-81, lm-cschu-90, m-vigau-88a, m-cacau-89, ms-saps-92, sh-cpp-75, si-cvd10-89, ls-ippvd-87, ls-pptmc-87, m-dpggt-89, ZZZ"
, update =	"98.11 bibrelex, 97.03 daniels, 93.09 milone+mitchell"
}

@article{m-rpm-93
, author =	"V. Milenkovic"
, title =	"Robust polygon modeling"
, journal =	"Comput. Aided Design"
, volume =	25
, number =	9
, year =	1993
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"algorithms, polygons, geometric modeling"
, update =	"98.03 agarwal, 97.03 daniels, 96.05 pascucci"
}

@inproceedings{m-rpom-97
, author =	"V. Milenkovic"
, title =	"Rotational polygon overlap minimization"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"334--343"
, cites =	"aaas-lpmpc-97, aas-mpcpp-92, a-peddf-89, ab-pptr-88, c-pcp-83, d-canpa-95, dm-cbspu-96, dm-mtcp1-97, dd-pp-92, d-tcpp-90, gc-cspum-93, gc-natpc-96, hss-cmpmi-84, l-canpt-94, lm-ccp-93, lm-csanp-95, m-tpcme-96, md-tpcme-95, m-mtcp2-97, m-pbpsm-96, sp-cppca-92, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
}

@inproceedings{m-rfldd-90
, author =	"V. Milenkovic"
, title =	"Rounding face lattices in $d$ dimensions"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"40--45"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation, geometric rounding"
, cites =	"ZZZ"
, update =	"98.07 bibrelex, 97.03 daniels"
}

@inproceedings{m-rflp-89
, author =	"V. Milenkovic"
, title =	"Rounding face lattices in the plane"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	12
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation, geometric rounding"
, update =	"97.03 daniels"
}

@inproceedings{m-tpcme-96
, author =	"V. Milenkovic"
, title =	"Translational polygon containment and minimal enclosure using linear programming based restriction"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, year =	1996
, pages =	"109--118"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"layout, packing, placement, nesting, concave, polygons, Minkowski sum, configuration space"
, update =	"97.03 daniels"
}

@unpublished{m-vigau-86
, author =	"V. Milenkovic"
, title =	"Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic"
, year =	1986
, note =	"Unpublished Manuscript"
, update =	"98.03 bibrelex"
}

@inproceedings{m-vigau-86i
, author =	"V. Milenkovic"
, title =	"Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic"
, booktitle =	"International Workshop on Geometric Reasoning"
, site =	"Oxford, UK"
, month =	jul
, year =	1986
, update =	"98.03 bibrelex"
}

@phdthesis{m-vigau-88p
, author =	"V. Milenkovic"
, title =	"Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
, type =	"PhD Thesis"
, school =	"Carnegie Mellon University"
, year =	1988
, keywords =	"doctoral thesis, robust geometric computation"
, precedes =	"m-vigau-88a"
, update =	"98.07 bibrelex, 97.03 daniels, 95.01 devillers"
}

@incollection{m-vigau-89i
, author =	"V. Milenkovic"
, title =	"Verifiable implementations of geometric algorithms using finite precision arithmetic"
, editor =	"D. Kapur and J. L. Mundy"
, booktitle =	"Geometric Reasoning"
, publisher =	"MIT Press"
, year =	1989
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@techreport{md-tpcme-95
, author =	"V. Milenkovic and K. Daniels"
, title =	"Translational polygon containment and minimal enclosure using geometric algorithms and mathematical programming"
, type =	"Technical {Report}"
, number =	"25-95"
, institution =	"Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
, address =	"Cambridge, MA"
, year =	1995
, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
, keywords =	"packing, layout, nesting, placement, concave, polygons, linear programming, optimization, Minkowski sum, configuration space, overlap, subdivisions"
, update =	"97.03 daniels"
}

@inproceedings{mdl-amm-91
, author =	"V. Milenkovic and K. Daniels and Z. Li"
, title =	"Automatic marker making"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"243--246"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"layout, nesting, placement, optimization"
, update =	"97.03 daniels"
}

@inproceedings{mdl-pcnpc-92
, author =	"V. Milenkovic and K. Daniels and Z. Li"
, title =	"Placement and compaction of nonconvex polygons for clothing manufacture"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"236--243"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"concave, polygons, layout, nesting, packing, optimization, Minkowski sum, configuration space"
, cites =	"dhks-isccd-90, g-ctfsr-86, grs-kfcg-83, kos-cmsrp-91i, ml-sipat-91, mdl-amm-91, s-iamm-82, tw-cmm-73, nh-aplpg-84, s-iamm-88, ZZZ"
, update =	"98.07 bibrelex, 97.03 daniels"
}

@inproceedings{mm-roaom-93
, author =	"V. Milenkovic and V. Milenkovic"
, title =	"Rational orthogonal approximations to orthogonal matrices"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"485--490"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"geometric modeling, quaternion arithmetic, basis reduction, integer programming, exact arithmetic"
, precedes =	"mm-roaom-97"
, cites =	"cdr-rrmrg-92, c-sede-92, crss-igbra-91, e-sap-80, fw-eeacg-92, h-eq-69, kln-edtur-89, mn-fccrp-90a, m-rfldd-90, r-srsrf-77, lll-fprc-82, l-atngc-86, ls-gbra-92, m-rflp-89, s-qrm-78"
, update =	"98.11 bibrelex, 97.03 daniels+devillers, 93.09 milone+mitchell"
}

@inproceedings{mn-fccrp-90i
, author =	"V. Milenkovic and L. R. Nackman"
, title =	"Finding compact coordinate representations for polygons and polyhedra"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"244--252"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, precedes =	"mn-fccrp-90a"
, cites =	"gj-cigtn-79, gps-crotr-89, h-gsm-89, m-rflp-89, mn-fccrp-90a, m-utcpc-89, s-fprgo-89, tt-pgelt-89, ZZZ"
, update =	"97.11 bibrelex, 97.03 daniels"
}

@article{mn-fccrp-90a
, author =	"V. Milenkovic and L. R. Nackman"
, title =	"Finding compact coordinate representations for polygons and polyhedra"
, journal =	"IBM J. Res. Develop."
, volume =	34
, number =	35
, month =	sep
, year =	1990
, pages =	"753--769"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, succeeds =	"mn-fccrp-90i"
, update =	"98.11 bibrelex, 97.03 daniels"
}

@inproceedings{m-dtlpn-00
, author =	"Victor J. Milenkovic"
, title =	"Densest Translational Lattice Packing of Non-Convex Polygons"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"280--289"
, update =	"00.11 jones"
}

@article{m-mtcp2-97
, author =	"Victor J. Milenkovic"
, title =	"Multiple Translational Containment, Part II: Exact Algorithm"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"183--218"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 held"
}

@inproceedings{m-pmsop-95
, author =	"Victor J. Milenkovic"
, title =	"Practical Methods for Set Operations on Polygons using Exact Arithmetic"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"55--60"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation, shortest-path rounding, nonuniform grids, geometric modeling, geometric rounding"
, update =	"97.03 daniels, 95.09 jones"
}

@article{m-rpomc-98
, author =	"Victor J. Milenkovic"
, title =	"Rotational polygon overlap minimization and compaction"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"305--318"
, succeeds =	"m-rpom-97"
, update =	"98.11 devillers"
}

@article{m-spgr-00
, author =	"V. J. Milenkovic"
, title =	"Shortest Path Geometric Rounding"
, journal =	"Algorithmica"
, volume =	27
, number =	1
, year =	2000
, pages =	"57--86"
, update =	"00.11 smid, 00.07 held"
}

@techreport{m-vigau-88t
, author =	"V. J. Milenkovic"
, title =	"Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
, number =	"CMU-CS-88-168"
, institution =	"Department of Computer Science, Carnegie Mellon University"
, address =	"Pittsburgh, PA15213"
, month =	jul
, year =	1988
, precedes =	"m-vigau-88a"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{m-vigau-88a
, author =	"V. J. Milenkovic"
, title =	"Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
, journal =	"Artif. Intell."
, volume =	37
, year =	1988
, pages =	"377--401"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, succeeds =	"m-vigau-88p, m-vigau-88t"
, update =	"98.11 bibrelex, 97.03 daniels, 95.01 devillers"
}

@inproceedings{ml-csche-89
, author =	"V. J. Milenkovic and Z. Li"
, title =	"Constructing strongly convex hulls using exact or rounded arithmetic"
, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
, year =	1989
, update =	"98.11 bibrelex"
}

@article{mm-roaom-97
, author =	"V. J. Milenkovic and V. Milenkovic"
, title =	"Rational orthogonal approximations to orthogonal matrices"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"25--35"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"geometric modeling, quaternion arithmetic, basis reduction, integer programming, exact arithmetic"
, succeeds =	"mm-roaom-93"
, update =	"97.03 daniels"
}

@article{m-spfes-70
, author =	"R. E. Miles"
, title =	"A synopsis of {Poisson} flats in {Euclidean} spaces"
, journal =	"J. Armenian Acad. Sci."
, volume =	"??"
, year =	1970
, pages =	"??"
, update =	"94.05 devillers"
}

@article{m-wcdgp-64
, author =	"R. E. Miles"
, title =	"A wide class of distributions in geometric probability"
, journal =	"Ann. Math. Statist."
, volume =	35
, year =	1964
, pages =	"1407--1415"
}

@article{m-agpp2-68
, author =	"R. E. Miles"
, title =	"Asymptotic global proximity probabilities for $2$ bivariate $n$-sample (abstract)"
, journal =	"Ann. Math. Statist."
, volume =	39
, year =	1968
, pages =	1160
}

@article{m-irs-71
, author =	"R. E. Miles"
, title =	"Isotropic random simplices"
, journal =	"Adv. Appl. Probab."
, volume =	3
, year =	1971
, pages =	"353--382"
, update =	"98.03 bibrelex"
}

@article{m-hpppp-70
, author =	"R. E. Miles"
, title =	"On the homogenous planar {Poisson} point-process"
, journal =	"Math. Biosci."
, volume =	6
, year =	1970
, pages =	"85--127"
}

@article{m-rpsts-71
, author =	"R. E. Miles"
, title =	"Random points, sets and tessellations on the surface of a sphere"
, journal =	"Sankhy{\=a}: The Indian Journal of Statistics: Series A"
, volume =	33
, year =	1971
, pages =	"145--174"
, update =	"94.09 bernal"
}

@article{m-rpdrl-64
, author =	"R. E. Miles"
, title =	"Random polygons determined by random lines in a plane"
, journal =	"Proc. National Academy of Sciences"
, volume =	52
, year =	1964
, pages =	"901--907 and 1157--1160"
}

@phdthesis{m-rpgnd-61
, author =	"R. E. Miles"
, title =	"Random polytopes: the generalization to $n$ dimensions of the intervals of a {Poisson} process"
, type =	"Ph.{D}. Thesis"
, school =	"Cambridge Univ."
, address =	"Cambridge, England"
, year =	1961
, keywords =	"doctoral thesis"
}

@article{m-sp671-69
, author =	"R. E. Miles"
, title =	"Solution to problem 67-15 ({Probability} distribution of a network of triangles)"
, journal =	"SIAM Rev."
, volume =	11
, year =	1969
, pages =	"399--402"
}

@article{m-rds-72
, author =	"R. E. Miles"
, title =	"The random division of space"
, journal =	"Suppl. Adv. Appl. Prob."
, volume =	"??"
, year =	1972
, pages =	"243--266"
, update =	"94.09 bernal"
}

@article{m-srsmr-85
, author =	"D. Miller"
, title =	"A spatial representation system for mobile robots"
, journal =	"Proc. IEEE Internat. Conf. Robot. Autom."
, volume =	"??"
, school =	"Dept. Comput. Sci., Yale Univ."
, address =	"New Haven, CT"
, year =	1985
, pages =	"122--127"
, update =	"93.09 milone+mitchell"
}

@inbook{mawm-ancmr-89
, author =	"D. Miller and D. Atkinson and B. Wilcox and A. Mishkin"
, editor =	"T. Nishimura"
, booktitle =	"Autonomous navigation and control of a {Mars} rover"
, publisher =	"Pergamon Press"
, year =	1989
, pages =	"111--114"
, update =	"97.11 bibrelex"
}

@incollection{m-gdata-91
, author =	"G. Miller"
, title =	"Goal-directed animation of tubular articulated figures or how snakes play golf"
, editor =	"N. A. Badler and B. A. Barsky and D. Zeltzer"
, booktitle =	"Making Them Move: Mechanics, Control, and Animation of Articulated Figures"
, publisher =	"Morgan Kaufmann Publishers"
, address =	"San Mateo, CA"
, year =	1991
, pages =	"233--241"
, update =	"97.11 bibrelex"
}

@inproceedings{m-spgus-84
, author =	"G. Miller"
, title =	"Separating a Planar Graph Using a Simple Cycle"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, site =	"Washington, DC"
, year =	1984
, update =	"97.11 bibrelex"
}

@techreport{m-atgg-82
, author =	"G. L. Miller"
, title =	"An additivity theorem for the genus of a graph"
, type =	"Manuscript"
, institution =	"Dept. Math., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1982
}

@techreport{m-fsscs-85
, author =	"G. L. Miller"
, title =	"Finding small simple cycle separators for $2$-connected planar graphs"
, type =	"Report"
, number =	"85-336"
, institution =	"Dept. Comput. Sci., Univ. Southern California"
, address =	"Los Angeles, CA"
, year =	1985
}

@article{m-fsscs-86
, author =	"G. L. Miller"
, title =	"Finding small simple cycle separators for 2-connected planar graphs"
, journal =	"J. Comput. Syst. Sci."
, volume =	32
, number =	3
, year =	1986
, pages =	"265--279"
, update =	"97.11 bibrelex"
}

@inproceedings{m-itgbg-80
, author =	"G. L. Miller"
, title =	"Isomorphism testing for graphs of bounded genus"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
, year =	1980
, pages =	"225--235"
}

@inproceedings{mr-ptcia-85
, author =	"G. L. Miller and J. H. Reif"
, title =	"Parallel Tree Contraction and its Applications"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"478--489"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{mttw-dbnmt-95
, author =	"G. L. Miller and D. Talmor and S.-H. Teng and N. Walkington"
, title =	"A {Delaunay} based numerical method for three dimensions: generation, formulation, and partition"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, year =	1995
, pages =	"683--692"
, update =	"95.09 smid"
}

@inproceedings{mttww-cvmus-96
, author =	"Gary L. Miller and Dafna Talmor and Shang-Hua Teng and Noel Walkington and Han Wang"
, title =	"Control volume meshes using sphere packing: generation, refinement and coarsening"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"47--61"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@techreport{mt-cppd-90
, author =	"G. L. Miller and S.-H. Teng"
, title =	"Center Points and Point Divisions"
, type =	"Manuscript"
, institution =	"School of Comput. Sci., Carnegie Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1990
, update =	"98.03 bibrelex"
}

@inproceedings{mttv-amp-92
, author =	"G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
, title =	"Automatic Mesh Partitioning"
, booktitle =	"Proc. of the 1992 Workshop on Sparse Matrix Computations: Graph Theory Issues and Algorithms"
, organization =	"Institute for Mathematics and its Applications"
, year =	1992
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@article{mttv-gsfem-95
, author =	"G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
, title =	"Geometric separators for finite element meshes"
, journal =	"SIAM J. Sci. Comput."
, volume =	"??"
, year =	1995
, note =	"Submitted"
, update =	"97.11 bibrelex"
}

@article{mttv-sspnn-97
, author =	"G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
, title =	"Separators for sphere-packings and nearest neighbor graphs"
, journal =	"J. ACM"
, volume =	44
, year =	1997
, pages =	"1--29"
, update =	"97.07 smid"
}

@inproceedings{mtv-ugags-91
, author =	"G. L. Miller and S.-H. Teng and S. A. Vavasis"
, title =	"An unified geometric approach to graph separators"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"538--547"
, update =	"97.11 bibrelex"
}

@inproceedings{mt-sttd-90
, author =	"Gary L. Miller and William Thurston"
, title =	"Separators in Two and Three Dimensions"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"300--309"
, update =	"97.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{mv-dgs-91
, author =	"G. L. Miller and S. A. Vavasis"
, title =	"An unified geometric approach to graph separators"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"331--336"
, update =	"98.03 bibrelex"
}

@techreport{mv-dgs-90
, author =	"G. L. Miller and S. A. Vavasis"
, title =	"Density graphs and separators"
, type =	"Technical {Report}"
, number =	"90-1169"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1990
, update =	"97.11 bibrelex"
}

@article{m-ganqs-87
, author =	"J. R. Miller"
, title =	"Geometric approaches to nonplanar quadric surface intersection curves"
, journal =	"ACM Trans. Graph."
, volume =	6
, year =	1987
, pages =	"274--307"
}

@techreport{ms-eracu-91
, author =	"N. Miller and M. Sharir"
, title =	"Efficient randomized algorithms for constructing the union of fat triangles and of pseudo-disks"
, type =	"Manuscript"
, institution =	"??"
, year =	1991
, update =	"98.03 bibrelex"
}

@unpublished{nm-eracu-
, author =	"N. Miller and Micha Sharir"
, title =	"Efficient randomized algorithms for constructing the union of fat triangles and pseudodiscs"
, note =	"Unpublished manuscript"
, precedes =	"ms-ericu-91"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 schwarzkopf"
}

@techreport{ms-ericu-91
, author =	"N. Miller and M. Sharir"
, title =	"Efficient randomized incremental construction of the union of fat triangles"
, type =	"manuscript"
, year =	1991
, succeeds =	"nm-eracu-"
, update =	"98.11 bibrelex"
}

@phdthesis{m-pca-85
, author =	"R. Miller"
, title =	"Pyramid Computer Algorithms"
, school =	"State Univ. New York"
, address =	"Binghamton"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{ms-cgmcc-84
, author =	"R. Miller and Q. F. Stout"
, title =	"Computational geometry on a mesh connected computer"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1984
, pages =	"66--73"
, update =	"93.05 devillers"
}

@article{ms-ccpip-91
, author =	"R. Miller and Q. F. Stout"
, title =	"Computing convexity properties of images on a pyramid computer"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"658--684"
, succeeds =	"ms-pcadg-85"
}

@inproceedings{ms-capc-84
, author =	"R. Miller and Q. F. Stout"
, title =	"Convexity algorithms for pyramid computers"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1984
, pages =	"177--184"
, update =	"97.11 bibrelex"
}

@misc{ms-dmtpc-
, author =	"R. Miller and Q. F. Stout"
, title =	"Data movement techniques for the pyramid computer"
, howpublished =	"Submitted"
, update =	"97.11 bibrelex"
}

@article{ms-epcha-88
, author =	"R. Miller and Q. F. Stout"
, title =	"Efficient parallel convex hull algorithms"
, journal =	"IEEE Trans. Comput."
, volume =	"C-37"
, number =	12
, year =	1988
, pages =	"1605--1618"
, update =	"93.05 devillers"
}

@article{ms-gadpm-85
, author =	"R. Miller and Q. F. Stout"
, title =	"Geometric algorithms for digitized pictures on a mesh-connected computer"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-7"
, year =	1985
, pages =	"216--228"
, update =	"97.11 bibrelex"
}

@techreport{ms-ipmcc-85
, author =	"R. Miller and Q. F. Stout"
, title =	"Intersection problems on a mesh-connected computer"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., State Univ. New York Buffalo"
, address =	"Buffalo, NY"
, year =	1985
}

@techreport{ms-mcacg-86
, author =	"R. Miller and Q. F. Stout"
, title =	"Mesh computer algorithms for computational geometry"
, type =	"Report"
, number =	"86-18"
, institution =	"Dept. Comput. Sci., State Univ. New York Buffalo"
, address =	"Buffalo, NY"
, year =	1986
}

@article{ms-mcacg-89
, author =	"R. Miller and Q. F. Stout"
, title =	"Mesh Computer Algorithms for Computational Geometry"
, journal =	"IEEE Trans. Comput."
, volume =	38
, number =	3
, month =	mar
, year =	1989
, pages =	"321--340"
, update =	"93.09 held"
}

@inproceedings{ms-pcadg-85
, author =	"R. Miller and Q. F. Stout"
, title =	"Pyramid computer algorithms for determining geometric properties of images"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"263--271"
, precedes =	"ms-ccpip-91"
, cites =	"as-mpabu-84, d-fpacp-80, m-pca-85, ms-capc-84, ms-dmtpc-, ms-cgmcc-84, ms-gadpm-85, ns-fccco-80, pu-mipa-82, r-dsls-74, s-pcpbg-81, s-ppmpe-, s-dslpc-82, s-smsft-83, s-pcscp-85, s-mpcig-85, t-pthpi-82, tk-scvmp-80, tk-smcpc-77, u-lrcnt-72, u-cav-84, vk-mnecd-82, ZZZ"
, update =	"97.11 bibrelex"
}

@incollection{m-casp-94
, author =	"Robert D. Miller"
, title =	"Computing the Area of a Spherical Polygon"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"132--137"
, keywords =	"cartography, Earth"
, update =	"94.09 heckbert"
, annote =	"Gives the formulas needed to find the area of a polygon on
a sphere that is bounded by great circle arcs. This is useful in
cartography. Contains C code."
}

@techreport{mi-epodm-??
, author =	"S. W. Miller and S. S. Iyengar"
, title =	"Efficient polygon overlay for dense map image data sets"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@book{m-sgta-72
, author =	"W. Miller"
, title =	"Symmetry Groups and their Application"
, publisher =	"Academic Press"
, year =	1972
, update =	"97.11 bibrelex"
}

@book{mw-srama-80
, author =	"W. Miller and C. Wrathall"
, title =	"Software for Roundoff Analysis of Matrix Algorithms"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1980
, update =	"98.03 bibrelex"
}

@article{mo-ncmme-85
, author =	"Z. Miller and J. B. Orlin"
, title =	"{NP}-Completeness for Minimizing Maximum Edge Length in Grid Embeddings"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"10--16"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{m-krp3s-94
, author =	"Kenneth C. Millett"
, title =	"Knotting of regular polygons in $3$-space"
, journal =	"J. Knot Theory Ramifications"
, volume =	3
, number =	3
, year =	1994
, pages =	"263--278"
, update =	"02.03 orourke"
}

@inproceedings{m-sdss-73
, author =	"W. Mills"
, title =	"Some {Davenport--Schinzel} sequences"
, editor =	"R. Thomas and H. Williams"
, booktitle =	"Congressus Numer. IX: Proc. 3rd Manitoba Conf. on Numer. Math. and Computing"
, year =	1973
, pages =	"307--313"
, update =	"95.09 agarwal"
}

@article{m-hgf15-82
, author =	"J. W. Milnor"
, title =	"Hyperbolic geometry: the first 150 years"
, journal =	"Bull. Amer. Math. Soc."
, volume =	6
, number =	1
, year =	1982
, pages =	"9--24"
, update =	"98.07 agarwal"
}

@book{m-mt-63
, author =	"John W. Milnor"
, title =	"Morse Theory"
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1963
, update =	"98.03 agarwal+bibrelex"
}

@article{m-bnrav-64
, author =	"J. W. Milnor"
, title =	"On the {Betti} numbers of real algebraic varieties"
, journal =	"Proc. Amer. Math. Soc."
, volume =	15
, year =	1964
, pages =	"275--280"
, update =	"98.07 agarwal, 95.01 matousek"
}

@unpublished{mv-psafs-86
, author =	"L. S. Milor and V. Visvanathan"
, title =	"Preliminary studies on analog fault signature calculation"
, year =	1986
, note =	"Manuscript in preparation"
, update =	"98.03 bibrelex"
}

@article{msvt-cmic-94
, author =	"P. B. Miltersen and S. Sairam and J. S. Vitter and R. Tamassia"
, title =	"Complexity Models for Incremental Computation"
, journal =	"Theoret. Comput. Sci."
, volume =	130
, year =	1994
, pages =	"203--236"
, keywords =	"dynamic computation, complexity theory"
, succeeds =	"svt-ctaic-93"
, update =	"95.01 tamassia, 94.05 tamassia"
}

@inproceedings{mb-ismga-96
, author =	"Lai Mingwu and Steven E. Benzley"
, title =	"An improved sweeping method for generating all hexahedral finite element meshes"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"217--225"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@article{m-aludk-97
, author =	"H. Minkowski"
, title =	"Allgemeine {Lehrs{\"a}tze} {\"u}ber die konvexen {Polyeder}"
, journal =	"Nachr. Ges. Wiss. G{\"o}ttingen"
, volume =	"??"
, year =	1897
, pages =	"198--219"
, update =	"97.11 bibrelex"
}

@article{m-vuo-03
, author =	"H. Minkowski"
, title =	"Volumen und {Oberfl{\"a}chen}"
, journal =	"Math. Ann."
, volume =	57
, year =	1903
, pages =	"447--495"
, update =	"98.03 bibrelex"
}

@book{m-mpta-86
, author =	"M. Minoux"
, title =	"Mathematical programming-theory and algorithms"
, publisher =	"John Wiley \& Sons"
, address =	"Chichester, UK"
, year =	1986
, update =	"99.11 bibrelex, 97.11 bibrelex"
}

@inproceedings{mag-adcma-98
, author =	"Darka Mioc and Fran{\c c}ois Anton and Christopher M. Gold"
, title =	"An Algorithm for the Dynamic Construction and Maintenance of Additively Weighted {Voronoi} Diagrams"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"117--119"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{mw-rsact-82
, author =	"A. Mirante and N. Weingarten"
, title =	"The Radial Sweep Algorithm for Constructing Triangulated Irreguler Networks"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, month =	may
, year =	1982
, pages =	"11--21"
, annote =	"Triangulation of a set of point. Selects an internal
		 point and joins it to all other points and then
		 completes triangulation by proceeding around the
		 boundary. Triangulation is improved by switchings
		 picking the shorter diagonal."
}

@book{mf-dlt-90
, editor =	"P. B. Mirchandani and R. L. Francis"
, booktitle =	"Discrete Location Theory"
, publisher =	"John Wiley \& Sons"
, year =	1990
, pages =	"xvi+555"
, keywords =	"facility location"
, update =	"99.11 bibrelex, 95.09 korneenko"
}

@inproceedings{mht-iaagl-93
, author =	"K. Miriyala and S. W. Hornick and R. Tamassia"
, title =	"An Incremental Approach to Aesthetic Graph Layout"
, booktitle =	"Proc. Internat. Workshop on Computer-Aided Software Engineering"
, nickname =	"CASE '93"
, year =	1993
, update =	"94.01 tamassia"
}

@inproceedings{m-cmga-94
, author =	"C. Mirolo"
, title =	"Convex Minimization on a Grid and Applications"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"314--319"
, cites =	"c-cdfdi-90, c-cdmp-86, cd-icott-87, dk-fdpi-83, dk-dsppu-90, dhks-isccd-90, egs-oplms-86, gf-cdgco-90, gw-dadpi-91, mp-smsra-89, ny-pcmeo-83, sk-ccmpc-92, ssk-cdmpp-93, m-pacdc-94, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@mastersthesis{m-pacdc-94
, author =	"C. Mirolo"
, title =	"Polylogarithmic Algorithms for Collision Detection based on Convex Minimization"
, number =	"UDMI/01/94/RR"
, school =	"Univ. di Udine"
, month =	jan
, year =	1994
, note =	"Dip. di Matematica e Informatica"
, keywords =	"master thesis"
, update =	"98.11 bibrelex"
}

@article{mp-smsra-89
, author =	"C. Mirolo and E. Pagello"
, title =	"A Solid Modeling System for Robot Action Planning"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	9
, number =	1
, year =	1989
, pages =	"55--69"
, update =	"98.11 bibrelex"
}

@article{m-facpm-96
, author =	"B. Mirtich"
, title =	"Fast and Accurate Computation of Polyhedral Mass Properties"
, journal =	"J. Graphics Tools"
, volume =	1
, number =	2
, year =	1996
, pages =	"31--50"
, update =	"97.11 held"
}

@inproceedings{m-hscci-95
, author =	"B. Mirtich"
, title =	"Hybrid Simulation: Combining constraints and impulses"
, booktitle =	"Workshop on Simulation and Interaction in Virtual Environments"
, organization =	"Office of Naval Research"
, month =	jul
, year =	1995
, pages =	"153--158"
, update =	"97.11 bibrelex"
}

@techreport{m-vfrpc-97
, author =	"B. Mirtich"
, title =	"{V-Clip}: {Fast} and Robust Polyhedral Collision Detection"
, number =	"TR97-05"
, institution =	"MERL"
, address =	"201 Broadway, Cambridge, MA 02139, USA"
, month =	jul
, year =	1997
, update =	"98.03 mitchell"
, annote =	"URL: http://www.merl.com/reports/TR97-05/index.html;
                  submitted to ACM ToG"
, abstract =	"
This paper presents the Voronoi-clip, or V-clip, collision detection algorithm
for polyhedral objects specified by a boundary representation.  V-clip tracks
the closest pair of features between convex polyhedra, using an approach
reminiscent of the Lin-Canny closest features algorithm.  V-clip is an
improvement over the latter in several respects. Coding complexity is reduced,
and robustness is significantly improved; the implementation has no numerical
tolerances and does not exhibit cycling problems. The algorithm also handles
penetrating polyhedra, making it useful for nonconvex polyhedral collision
detection. This paper presents the theoretical principles of V-clip, and gives
a pseudocode description of the algorithm. It also documents various tests
that compare V-clip, Lin-Canny, and the Enhanced Gilbert-Johnson-Keerthi
algorithm, a simplex-based algorithm that is widely used for the same
application. The results show V-clip to be a strong contender in this field,
comparing favorably with the other algorithms in most of the tests, in terms
of both performance and robustness.
\par
From the V-Clip Collision Detection WWW page:
\par
V-Clip is a low-level collision detection algorithm. The basic operation
provided to the application is that of performing a collision check between
two objects. The decisions of when to perform the checks between which object
pairs are left to the application. In particular, the V-Clip library does not
include facilities for higher level collision check culling, using bounding
boxes or spheres, for example. If this is required, consider writing one
yourself, or consider using a complete collision detection package such as
I-Collide or V-Collide.
\par
V-Clip is designed for objects that are bounded by closed surfaces, and not
utterly nonconvex. If you need to detect collisions within polygon soup or
between intricately intertwined objects, there are better alternatives:
consider using Rapid."
}

@article{m-vcfrp-98
, author =	"B. Mirtich"
, title =	"V-Clip: Fast and Robust Polyhedral Collision Detection"
, journal =	"ACM Trans. Graph."
, volume =	17
, number =	3
, month =	jul
, year =	1998
, pages =	"177--208"
, succeeds =	"m-vfrpc-97"
, update =	"99.03 held"
}

@incollection{mc-ibds-95
, author =	"B. Mirtich and J. Canny"
, title =	"Impulse-based dynamic simulation"
, editor =	"K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
, booktitle =	"The Algorithmic Foundations of Robotics"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1995
, update =	"99.11 bibrelex, 98.07 agarwal, 97.11 bibrelex"
}

@inproceedings{mc-ibsrb-95
, author =	"B. Mirtich and J. Canny"
, title =	"Impulse-based simulation of rigid bodies"
, booktitle =	"Symposium on Interactive 3D Graphics"
, site =	"New York"
, publisher =	"ACM Press"
, year =	1995
, update =	"97.11 bibrelex"
}

@inproceedings{mc-tcsti-96
, author =	"Brian Mirtich and John Canny"
, title =	"Testing control systems through impulse-based simulation"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V5--V6"
, cites =	"f-crdua-83, g-cbnnn-94, hwbo-aha-95, l-ecdar-93, mz-dsall-90, m-gdata-91, m-hscci-95, mc-ibds-95, mc-ibsrb-95, o-plfs-92, rh-adll-91, r-fhsdb-87, s-evc-94, tt-afplp-94, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@inproceedings{mc-usnpp-92
, author =	"Brian Mirtich and John Canny"
, title =	"Using Skeletons for Nonholonomic Path Planning Among Obstacles"
, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
, year =	1992
, pages =	"2533--2540"
, update =	"98.03 mitchell"
}

@inproceedings{m-cpdls-90
, author =	"A. Mirzaian"
, title =	"Circumscribing polygon of disjoint line segments"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"319--323"
, cites =	"agss-ltacv-89, gt-ltafm-88, g-eadch-72, ms-fmapp-89, r-cscsl-87, rit-cscsl-90, ZZZ"
, update =	"98.07 bibrelex"
}

@article{m-htcpd-92
, author =	"A. Mirzaian"
, title =	"Hamiltonian triangulations and circumscribing polygons of disjoint line segments"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	1
, year =	1992
, pages =	"15--30"
}

@inproceedings{m-mwemw-93
, author =	"Andy Mirzaian"
, title =	"Minimum Weight {Euclidean} Matching and Weighted Relative Neighborhood Graphs"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"506--517"
, update =	"96.05 agarwal, 93.09 smid, 93.05 jones"
}

@techreport{m-tsppt-88
, author =	"A. Mirzaian"
, title =	"Triangulating simple polygons: pseudo-triangulations"
, type =	"Technical {Report}"
, number =	"CS-88-12"
, institution =	"Dept. Comput. Sci., York Univ."
, address =	"Toronto, ON"
, month =	sep
, year =	1988
, annote =	"``We propose the new concept of {\em
		 pseudo-triangulation}, a generalized version of
		 triangulation, in which the member triangles need not
		 all have the same orientation. In this paper we explore
		 some combinatorial and topological properties of
		 pseudo-triangulations.''"
}

@inproceedings{mwx-slst-96
, author =	"A. Mirzaian and C. A. Wang and Y.-F. Xu"
, title =	"On stable line segments in triangulations"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"62--67"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@incollection{m-crag-97
, author =	"B. Mishra"
, title =	"Computational real algebraic geometry"
, chapter =	29
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"537--558"
, update =	"97.11 orourke"
}

@inproceedings{m-wap-91
, author =	"B. Mishra"
, title =	"Workholding: {Analysis} and planning"
, booktitle =	"Proc. IEEE/RSJ Internat. Conf. Intell. Robots Syst."
, month =	jul
, year =	1991
, update =	"98.03 bibrelex"
}

@article{mss-esmpg-87
, author =	"B. Mishra and J. T. Schwartz and Micha Sharir"
, title =	"On the existence and synthesis of multifinger positive grips"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"541--558"
, keywords =	"robot grasping, convex hull"
, update =	"98.03 mitchell"
}

@article{ms-sdsgi-89
, author =	"B. Mishra and N. Silver"
, title =	"Some discussion of static gripping and its stabiliy"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	19
, number =	4
, year =	1989
, update =	"98.07 bibrelex"
}

@techreport{my-ngb-86
, author =	"B. Mishra and C. K. Yap"
, title =	"Notes on {Gr{\"o}bner} bases"
, type =	"Technical {Report}"
, number =	257
, institution =	"Dept. Comput. Sci., New York. Univ."
, address =	"New York, NY"
, month =	sep
, year =	1986
, update =	"98.03 bibrelex"
}

@article{mg-fre-82
, author =	"J. Misra and D. Gries"
, title =	"Finding repeated elements"
, journal =	"Sc. Comp. Prog."
, volume =	2
, year =	1982
, pages =	"143--152"
, update =	"98.07 bibrelex"
}

@article{mels-lamm-95
, author =	"K. Misue and Peter Eades and W. Lai and K. Sugiyama"
, title =	"Layout Adjustment and the Mental Map"
, journal =	"J. Visual Lang. Comput."
, volume =	6
, number =	2
, year =	1995
, pages =	"183--210"
, update =	"98.07 tamassia+vismara"
}

@inproceedings{mha-asspg-95
, author =	"Curtis R. Mitchell and Gary S. Hufford and Mahesh M. Athavale"
, title =	"Automated Semi-Structured Prismatic Grids for Brush Seals Analysis"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"205--217"
, update =	"96.01 samitchell"
}

@article{m-sosdr-91
, author =	"D. P. Mitchell"
, title =	"Spectrally optimal sampling for distribution ray tracing"
, journal =	"Comput. Graph."
, volume =	25
, number =	4
, year =	1991
, pages =	"157--162"
, note =	"Proc. SIGGRAPH '91"
, update =	"98.03 bibrelex"
}

@techreport{m-carte-87
, author =	"F. Mitchell"
, title =	"A comparisom of adaptive refinement techniques for elliptic problems"
, type =	"Report"
, number =	"UIUCDCS-R-87-1375"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana-Champaign, IL"
, year =	1987
, update =	"97.11 bibrelex"
}

@techreport{m-umafe-88
, author =	"F. Mitchell"
, title =	"Unified multilevel adaptive finite element methods for elliptic problems"
, type =	"Report"
, number =	"UIUCDCS-R-88-1446"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana-Champaign, IL"
, year =	1988
, update =	"97.11 bibrelex"
}

@techreport{m-acvpp-90
, author =	"J. Mitchell"
, title =	"Algorithmic Computer Vision"
, type =	"manuscript"
, institution =	"The Probing Paradigm"
, month =	nov
, year =	1990
, note =	"Workshop on Geometric Probing and Computer Vision"
, update =	"98.11 bibrelex"
}

@inproceedings{m-aagop-97
, author =	"Joseph Mitchell"
, title =	"Approximation Algorithms for Geometric Optimization Problems"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"229--232"
, update =	"97.11 jones"
}

@techreport{m-naspo-88
, author =	"Joseph S. B. Mitchell"
, title =	"A new algorithm for shortest paths among obstacles in the plane"
, type =	"Technical {Report}"
, number =	832
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, month =	oct
, year =	1988
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{m-naspo-91
, author =	"Joseph S. B. Mitchell"
, title =	"A new algorithm for shortest paths among obstacles in the plane"
, journal =	"Ann. Math. Artif. Intell."
, volume =	3
, year =	1991
, pages =	"83--106"
, keywords =	"shortest paths, distance, continuous Dijkstra, visibility"
, update =	"98.03 mitchell"
}

@inproceedings{m-aaorp-90
, author =	"Joseph S. B. Mitchell"
, title =	"Algorithmic approaches to optimal route planning"
, booktitle =	"Proc. SPIE Conference on Mobile Robots"
, site =	"Boston, MA"
, month =	nov
, year =	1990
, pages =	"??"
, keywords =	"shortest paths, visibility graphs, weighted regions"
, update =	"00.11 smid, 00.07 icking, 98.03 mitchell"
}

@inproceedings{m-aaspt-86
, author =	"J. S. B. Mitchell"
, title =	"An algorithmic approach to some problems in terrain navigation"
, booktitle =	"International Workshop on Geometric Reasoning"
, site =	"Oxford, UK"
, month =	jun
, year =	1986
, update =	"98.03 bibrelex"
}

@article{m-aaspt-88
, author =	"Joseph S. B. Mitchell"
, title =	"An algorithmic approach to some problems in terrain navigation"
, journal =	"Artif. Intell."
, volume =	37
, year =	1988
, pages =	"171--201"
, keywords =	"path planning, geodesic distance, shortest paths, continuous Dijkstra"
, precedes =	"m-aaspt-89"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@incollection{m-aaspt-89
, author =	"Joseph S. B. Mitchell"
, title =	"An algorithmic approach to some problems in terrain navigation"
, editor =	"D. Kapur and J. Mundy"
, booktitle =	"Geometric Reasoning"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1989
, keywords =	"path planning, geodesic distance, shortest paths, continuous Dijkstra"
, succeeds =	"m-aaspt-88"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@incollection{m-aaspt-91
, author =	"Joseph S. B. Mitchell"
, title =	"An algorithmic approach to some problems in terrain navigation"
, editor =	"S. Sitharama Iyengar and Alberto Elfes"
, booktitle =	"Autonomous Mobile Robots: Perception, Mapping, and Navigation"
, publisher =	"IEEE Computer Society Press"
, address =	"Los Alamitos, CA"
, year =	1991
, pages =	"408--427"
, update =	"98.03 mitchell"
}

@inproceedings{m-avna-84
, author =	"Joseph S. B. Mitchell"
, title =	"An Autonomous Vehicle Navigation Algorithm"
, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
, volume =	485
, year =	1984
, pages =	"153--158"
, update =	"98.03 mitchell"
}

@techreport{m-eamld-89
, author =	"Joseph S. B. Mitchell"
, title =	"An efficient algorithm for minimum link distance paths among obstacles in the plane"
, type =	"Manuscript"
, institution =	"Cornell Univ."
, year =	1989
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{m-oasrp-89
, author =	"Joseph S. B. Mitchell"
, title =	"An optimal algorithm for shortest rectilinear paths among obstacles"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	22
, keywords =	"shortest paths, two-dimensional, distance, $L_{1}$ metric, continuous Dijkstra, plane-sweep, range search"
, update =	"98.03 mitchell"
}

@techreport{m-aagsp-93
, author =	"Joseph S. B. Mitchell"
, title =	"Approximation Algorithms for Geometric Separation Problems"
, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
, month =	jul
, year =	1993
, url =	"http://ams.sunysb.edu/\~{ }jsbm/jsbm.html"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@techreport{m-cgmvr-93
, author =	"J. S. B. Mitchell"
, title =	"Computational geometry methods for virtual reality"
, type =	"Manuscript"
, institution =	"Department of Applied Mathematics, SUNY Stony Brook"
, year =	1993
, update =	"98.03 bibrelex"
}

@techreport{m-esppo-94
, author =	"Joseph S. B. Mitchell"
, title =	"Euclidean shortest paths among polygonal obstacles in the plane"
, type =	"Technical {Report}"
, institution =	"University at Stony Brook"
, year =	1994
, precedes =	"kmm-eaesp-97"
, update =	"98.03 mitchell, 96.05 mitchell"
, annote =	"Gives an $O(n+ h^2\log n)$ algorithm for shortest
                  paths"
}

@incollection{m-gspno-00
, author =	"Joseph S. B. Mitchell"
, title =	"Geometric Shortest Paths and Network Optimization"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"633--701"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell"
, annote =	"Chapter 15 of su-hcg-00"
}

@inproceedings{m-gsaps-96
, author =	"Joseph S. B. Mitchell"
, title =	"Guillotine subdivisions approximate polygonal subdivisions: {A} simple new method for the geometric {$k$-MST} problem"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"402--408"
, keywords =	"k-MST, approximations, rectangular subdivisions, dynamic programming, red-blue separation, minimum spanning tree"
, precedes =	"mbcv-cfaag-98"
, update =	"98.03 mitchell, 96.09 agarwal, 96.01 mitchell"
}

@article{m-gsaps-99
, author =	"Joseph S. B. Mitchell"
, title =	"Guillotine Subdivisions Approximate Polygonal Subdivisions: {A} Simple Polynomial-Time Approximation Scheme for Geometric {TSP}, {$k$-MST}, and Related Problems"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1999
, pages =	"1298--1309"
, url =	"http://ams.sunysb.edu/~jsbm/jsbm.html"
, update =	"99.11 smid, 98.03 mitchell"
}

@techreport{m-gsaps-96t
, author =	"Joseph S. B. Mitchell"
, title =	"Guillotine Subdivisions Approximate Polygonal Subdivisions: {Part II} -- {A} Simple Polynomial-Time Approximation Scheme for Geometric {TSP}, {$k$-MST}, and Related Problems"
, type =	"Manuscript"
, institution =	"University at Stony Brook"
, year =	1996
, url =	"http://ams.sunysb.edu/~jsbm/jsbm.html"
, precedes =	"m-gsaps-98"
, update =	"99.11 smid, 98.03 mitchell"
}

@techreport{m-gsaps-97
, author =	"Joseph S. B. Mitchell"
, title =	"Guillotine Subdivisions Approximate Polygonal Subdivisions: {Part III} -- {Faster} Polynomial-Time Approximation Schemes for Geometric Network Optimization"
, type =	"Manuscript"
, institution =	"University at Stony Brook"
, year =	1997
, url =	"http://ams.sunysb.edu/~jsbm/jsbm.html"
, comments =	"Appears also as part of \cite{m-sacgm-96} in CCCG'97"
, update =	"98.03 mitchell"
}

@article{m-lsppo-92
, author =	"Joseph S. B. Mitchell"
, title =	"{$L_{1}$} shortest paths among polygonal obstacles in the plane"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"55--88"
, keywords =	"shortest paths, distance, {$L_{1}$} metric, continuous Dijkstra, plane-sweep, range search"
, succeeds =	"m-srpo-87"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@techreport{m-csfal-90
, author =	"Joseph S. B. Mitchell"
, title =	"On computing a single face in an arrangement of line segments"
, type =	"Manuscript"
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, month =	jul
, year =	1990
, keywords =	"arrangements, divide-and-conquer"
, update =	"98.03 mitchell"
}

@inproceedings{m-mfpd-88
, author =	"Joseph S. B. Mitchell"
, title =	"On maximum flows in polyhedral domains"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"341--351"
, precedes =	"m-mfpd-90"
, cites =	"aaghi-vpses-85, ckv-rsptp-87, ek-tiaen-72, g-namfp-87, gmmn-pp0wr-88, gt-namfp-86, h-ipnf-69, i-smp-79, is-mfpn-79, k-eccs-79, l-matps-82, m-psp-86, m-aaspt-86, m-spozc-87, m-srpo-87t, mmp-dgp-87, mp-wrp-85, p-spm-86, rs-spesp-85, s-mftd-83, y-oavds-87, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{m-mfpd-90
, author =	"Joseph S. B. Mitchell"
, title =	"On maximum flows in polyhedral domains"
, journal =	"J. Comput. Syst. Sci."
, volume =	40
, year =	1990
, pages =	"88--123"
, succeeds =	"m-mfpd-88"
, update =	"98.03 mitchell"
}

@inproceedings{m-sacgm-96
, author =	"Joseph S. B. Mitchell"
, title =	"On Some Applications of Computational Geometry in Manufacturing and Virtual Environments"
, editor =	"M. C. Lin and D. Manocha"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"37--40"
, update =	"98.11 bibrelex, 98.03 mitchell"
, annote =	"invited lecture"
}

@techreport{m-mcp-
, author =	"J. S. B. Mitchell"
, title =	"On the maximum concealment problem"
, type =	"Technical Report"
, institution =	"Dept. Oper. Res., Cornell Univ."
, address =	"Ithaca, NY"
, year =	"??"
, note =	"In preparation"
, update =	"98.03 bibrelex"
}

@phdthesis{m-psp-86
, author =	"Joseph S. B. Mitchell"
, title =	"Planning shortest paths"
, type =	"Ph.{D}. Thesis"
, school =	"Stanford Univ."
, address =	"Stanford, CA"
, year =	1986
, keywords =	"doctoral thesis, motion planning, path planning, geodesic distance, shortest paths, Voronoi diagrams, plane-sweep, continuous Dijkstra"
, comments =	"UMI AAC87-00791, 143 pp."
, update =	"98.03 mitchell, 93.09 jones"
}

@inproceedings{m-spop-93
, author =	"Joseph S. B. Mitchell"
, title =	"Shortest paths among obstacles in the plane"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"308--317"
, precedes =	"m-spop-96"
, cites =	"a-rsoas-89, aaghi-vdp-86, c-asdii-88, cegghss-rspug-91, csw-qoubs-90, ch-spp-90, cj-sersi-91, gmmn-pp0wr-90, gm-osacv-91, km-eaesp-88, k-eccs-79, l-prp-78, l-prp-78, m-rsehc-92, m-apcad-83, m-lsppo-92, m-oasrp-89, m-mfpd-90, m-naspo-91, mmp-dgp-87, mp-wrpfs-91, ow-nmcvg-88, rs-spesp-85, ss-spps-86, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex+mitchell, 97.03 devillers, 93.09 jones"
}

@article{m-spop-96
, author =	"Joseph S. B. Mitchell"
, title =	"Shortest paths among obstacles in the plane"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"309--332"
, keywords =	"shortest paths, geodesic paths, continuous Dijkstra method"
, succeeds =	"m-spop-93"
, update =	"98.03 mitchell, 97.03 devillers+schwarzkopf, 96.05 mitchell"
}

@techreport{m-spozc-87
, author =	"Joseph S. B. Mitchell"
, title =	"Shortest paths among obstacles, zero-cost regions, and ``roads''"
, type =	"Technical {Report}"
, number =	764
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1987
, keywords =	"path planning, shortest paths, Voronoi diagrams, continuous Dijkstra"
, update =	"98.03 mitchell"
}

@techreport{m-spn-96
, author =	"Joseph S. B. Mitchell"
, title =	"Shortest paths and networks"
, type =	"Technical {Report}"
, institution =	"University at Stony Brook"
, year =	1996
, update =	"98.03 mitchell, 97.07 orourke, 96.05 mitchell"
, annote =	"A survey chapter written for the Handbook of Computational Geometry.
		This version is somewhat expanded, with all references, etc."
}

@incollection{m-spn-97
, author =	"Joseph S. B. Mitchell"
, title =	"Shortest paths and networks"
, chapter =	24
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"445--466"
, update =	"98.03 mitchell, 97.11 orourke"
}

@techreport{m-spppo-84
, author =	"Joseph S. B. Mitchell"
, title =	"Shortest paths in the plane in the presence of obstacles"
, type =	"Manuscript"
, institution =	"Dept. Operations Research, Stanford Univ."
, address =	"Stanford, CA"
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{m-srpo-87
, author =	"Joseph S. B. Mitchell"
, title =	"Shortest rectilinear paths among obstacles"
, booktitle =	"Proc. 1st Internat. Conf. Indust. Applied Math."
, site =	"Paris, France"
, year =	1987
, pages =	"39--84"
, keywords =	"shortest paths, distance, $L_{1}$ metric, continuous Dijkstra, plane-sweep, range search"
, precedes =	"m-lsppo-92"
, update =	"98.03 mitchell, 94.05 smid"
}

@techreport{m-srpo-87t
, author =	"Joseph S. B. Mitchell"
, title =	"Shortest rectilinear paths among obstacles in the plane"
, type =	"Technical {Report}"
, number =	739
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, month =	apr
, year =	1987
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{mbcv-cfaag-98
, author =	"Joseph S. B. Mitchell and A. Blum and P. Chalasani and S. Vempala"
, title =	"A constant-factor approximation algorithm for the geometric {$k$-MST} problem in the plane"
, journal =	"SIAM J. Comput."
, volume =	28
, year =	1998
, pages =	"771--781"
, url =	"http://ams.sunysb.edu/\~{ }jsbm/jsbm.html"
, succeeds =	"m-gsaps-96"
, update =	"99.11 smid, 98.03 mitchell"
}

@techreport{mmp-dgp-85
, author =	"J. S. B. Mitchell and D. M. Mount and C. H. Papadimitriou"
, title =	"The discrete geodesic problem"
, type =	"Technical {Report}"
, institution =	"Dept. of Operations Research, Stanford Univ."
, address =	"Stanford, CA"
, year =	1985
, update =	"98.03 bibrelex"
}

@article{mmp-dgp-87
, author =	"Joseph S. B. Mitchell and D. M. Mount and C. H. Papadimitriou"
, title =	"The discrete geodesic problem"
, journal =	"SIAM J. Comput."
, volume =	16
, year =	1987
, pages =	"647--668"
, keywords =	"path planning, geodesic distance, shortest paths, polyhedra, Voronoi diagrams, continuous Dijkstra"
, update =	"98.03 mitchell"
}

@inproceedings{mms-qsrs-94
, author =	"Joseph S. B. Mitchell and D. M. Mount and Subhash Suri"
, title =	"Query-Sensitive Ray Shooting"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"359--368"
, keywords =	"ray shooting, octrees, quadtress, simple cover complexity"
, precedes =	"mms-qsrs-97"
, cites =	"a-dapal-89, amnsw-oaann-94, b-acpqh-93, beg-pgmg-90, ck-dmdps-92, cegghss-rspug-91, cg-vippg-85, cj-sersi-91, c-racpq-88, hs-parss-93, hb-atdis-87, m-cgmvr-93, mv-qmgtd-92i, m-smga-92, oss-slspt-90, s-dasds-90, v-oaann-89, ZZZ"
, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
}

@article{mms-qsrs-97
, author =	"Joseph S. B. Mitchell and D. M. Mount and Subhash Suri"
, title =	"Query-Sensitive Ray Shooting"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, number =	4
, month =	aug
, year =	1997
, pages =	"317--347"
, keywords =	"ray shooting, octrees, quadtress, simple cover complexity"
, succeeds =	"mms-qsrs-94"
, update =	"98.03 mitchell"
, annote =	"Special issue devoted to SoCG'94"
}

@article{mo-cgc42-01
, author =	"J. S. B. Mitchell and J. O'Rourke"
, title =	"Computational geometry column 42"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"??"
, number =	"??"
, year =	2001
, pages =	"??--??"
, note =	"Also in {\em SIGACT News} 32(3):63-72 (2001), Issue 120"
, update =	"01.07 orourke"
, annote =	"A compendium of thirty previously published open
problems in computational geometry is presented."
}

@inproceedings{mp-psp-85
, author =	"Joseph S. B. Mitchell and C. H. Papadimitriou"
, title =	"Planning shortest paths"
, booktitle =	"SIAM Conf. Geometric Modelling \& Robotics"
, site =	"Albany, NY"
, year =	1985
, pages =	"??"
, keywords =	"motion planning, path planning, geodesic distance, shortest paths, Voronoi diagrams, plane-sweep, continuous Dijkstra"
, update =	"98.03 mitchell"
}

@techreport{mp-wrp-85
, author =	"J. S. B. Mitchell and C. H. Papadimitriou"
, title =	"The weighted region problem"
, type =	"Technical {Report}"
, institution =	"Dept. Oper. Res., Stanford Univ."
, address =	"Stanford, CA"
, year =	1985
, update =	"98.03 bibrelex"
}

@techreport{mp-wrp-86
, author =	"J. S. B. Mitchell and C. H. Papadimitriou"
, title =	"The weighted region problem"
, type =	"Technical {Report}"
, institution =	"Dept. of  Operations Research, Stanford Univ."
, address =	"Stanford, CA"
, year =	1986
, update =	"98.03 bibrelex"
}

@inproceedings{mp-wrp-87
, author =	"Joseph S. B. Mitchell and C. H. Papadimitriou"
, title =	"The weighted region problem"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, site =	"Waterloo, ON"
, year =	1987
, pages =	"30--38"
, keywords =	"path planning, geodesic distance, shortest paths, Voronoi diagrams, continuous Dijkstra"
, precedes =	"mp-wrpfs-91"
, cites =	"d-ntpcg-59, gs-pms-, j-spivt1-80, km-psptv-84, l-prp-78, lp-esppr-84,  m-psp-86, mp-psp-85, mp-wrp-86, mmp-dgp-85, qfp-dsarn-85, rs-spesp-85, ss-spps-86, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{mp-wrpfs-91
, author =	"Joseph S. B. Mitchell and C. H. Papadimitriou"
, title =	"The weighted region problem: finding shortest paths through a weighted planar subdivision"
, journal =	"J. ACM"
, volume =	38
, year =	1991
, pages =	"18--73"
, keywords =	"weighted, path planning, geodesic distance, shortest paths, Voronoi diagrams, continuous Dijkstra"
, succeeds =	"mp-wrp-87"
, update =	"98.03 mitchell"
}

@article{mpk-pravc-87
, author =	"Joseph S. B. Mitchell and D. W. Payton and D. M. Keirsey"
, title =	"Planning and Reasoning for Autonomous Vehicle Control"
, journal =	"Internat. J. Intell. Syst."
, volume =	"II"
, year =	1987
, pages =	"129--198"
, update =	"98.03 mitchell"
}

@inproceedings{mpa-csklp-92
, author =	"Joseph S. B. Mitchell and C. Piatko and Esther M. Arkin"
, title =	"Computing a shortest $k$-link path in a polygon"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"573--582"
, update =	"98.03 mitchell"
}

@article{mrsw-ccppp-95
, author =	"Joseph S. B. Mitchell and G{\"u}nter Rote and Gopalakrishnan Sundaram and G. Woeginger"
, title =	"Counting convex polygons in planar point sets"
, journal =	"Inform. Process. Lett."
, volume =	56
, year =	1995
, pages =	"191--194"
, keywords =	"convexity, combinatorics"
, cites =	"rwzw-cksck-91, rw-cckgp-92, eorw-fmakg-92"
, update =	"98.03 mitchell, 97.11 bibrelex, 97.03 rote"
, abstract =	"Given a set $S$ of $n$ points in the plane, we compute in time
		$O(n^3)$ the total number of convex polygons whose vertices are
		a subset of $S$. We give an $O(m n^3)$ algorithm for computing
		the number of convex $k$-gons with vertices in $S$, for all
		values $k=3,\ldots,m$."
}

@inproceedings{mrw-mlpop-90
, author =	"Joseph S. B. Mitchell and G{\"u}nter Rote and G. Woeginger"
, title =	"Minimum-link paths among obstacles in the plane"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"63--72"
, precedes =	"mrw-mlpop-92"
, cites =	"a-idaac-89, cr-nlbtr-87, ce-oails-88t, eghsssw-irals-88, egs-cmfal-88, gm-osacv-87, hs-ndssg-86, km-eaesp-88, k-ealdp-89, m-eamld-89, mw-dmvg-89, rw-cmlps-89, so-wcoac-86, s-ltaml-86, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 rote"
}

@article{mrw-mlpop-92
, author =	"Joseph S. B. Mitchell and G{\"u}nter Rote and G. Woeginger"
, title =	"Minimum-link paths among obstacles in the plane"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"431--459"
, keywords =	"link distance, arrangements, visibility graphs"
, succeeds =	"mrw-mlpop-90"
, update =	"98.03 mitchell, 93.09 rote"
}

@techreport{ms-scg-
, author =	"J. S. B. Mitchell and S. Suri"
, title =	"A Survey of Computational Geometry"
, type =	"manuscript"
, precedes =	"ms-scg-95"
, update =	"98.11 bibrelex"
}

@incollection{ms-scg-95
, author =	"Joseph S. B. Mitchell and Subhash Suri"
, title =	"A Survey of Computational Geometry"
, editor =	"M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser"
, booktitle =	"Network Models"
, series =	"Handbook of Operations Research/Management Science"
, publisher =	"Elsevier Science"
, address =	"Amsterdam"
, year =	1995
, pages =	"425--479"
, succeeds =	"ms-scg-"
, update =	"98.11 bibrelex, 98.03 mitchell, 95.01 mitchell, 95.01 mitchell"
}

@article{ms-sapo-95
, author =	"Joseph S. B. Mitchell and Subhash Suri"
, title =	"Separation and approximation of polyhedral objects"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"95--114"
, keywords =	"surface approximation, mesh simplification, set cover, greedy algorithms"
, succeeds =	"ms-saps-92"
, update =	"98.03 mitchell, 97.03 agarwal, 96.01 mitchell"
}

@techreport{ms-saps-91
, author =	"Joseph S. B. Mitchell and Subhash Suri"
, title =	"Separation and approximation of polyhedral surfaces"
, type =	"Technical {Report}"
, number =	974
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1991
, precedes =	"ms-saps-92"
, update =	"98.03 mitchell"
}

@inproceedings{ms-saps-92
, author =	"Joseph S. B. Mitchell and Subhash Suri"
, title =	"Separation and approximation of polyhedral surfaces"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"296--306"
, succeeds =	"ms-saps-91"
, precedes =	"ms-sapo-95"
, update =	"98.03 mitchell, 96.01 mitchell, 95.01 mitchell"
}

@techreport{mw-dmvg-89
, author =	"Joseph S. B. Mitchell and Emo Welzl"
, title =	"Dynamic methods for visibility graphs"
, type =	"Manuscript"
, institution =	"Cornell Univ."
, year =	1989
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{mw-dmvgi-90
, author =	"Joseph S. B. Mitchell and Emo Welzl"
, title =	"Dynamically Maintaining a Visibility Graph under Insertions of New Obstacles"
, institution =	"Operations Research, Cornell University"
, year =	1990
, update =	"98.03 mitchell"
}

@techreport{mw-fobpp-90
, author =	"Joseph S. B. Mitchell and E. L. Wynters"
, title =	"Finding optimal bipartitions of points and polygons"
, type =	"Technical {Report}"
, number =	948
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1990
, keywords =	"bipartitioning, separation, visibility, clustering, convex hulls"
, precedes =	"mw-fobpp-91"
, update =	"98.03 mitchell"
}

@inproceedings{mw-fobpp-91
, author =	"Joseph S. B. Mitchell and E. L. Wynters"
, title =	"Finding optimal bipartitions of points and polygons"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"202--213"
, keywords =	"bipartitioning, separation, visibility, clustering, convex hulls"
, succeeds =	"mw-fobpp-90"
, precedes =	"mw-fobpp-95"
, update =	"98.03 mitchell"
}

@techreport{mw-fobpp-95
, author =	"Joseph S. B. Mitchell and E. L. Wynters"
, title =	"Finding Optimal Bipartitions of Points and Polygons"
, type =	"Technical {Report}"
, institution =	"Applied Math, SUNY Stony Brook"
, year =	1995
, keywords =	"bipartitioning, separation, visibility, clustering, convex hulls"
, succeeds =	"mw-fobpp-91"
, update =	"98.03 mitchell"
, annote =	"Full version of \cite{mw-fobpp-91}, which also corrects a
                  misstatement made in the proceedings version."
}

@techreport{mw-omcpo-90t
, author =	"J. S. B. Mitchell and E. L. Wynters"
, title =	"Optimal motion of covisible points among obstacles in the plane"
, type =	"Technical {Report}"
, number =	896
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, month =	mar
, year =	1990
, keywords =	"path planning, visibility, shortest paths, multiple agents"
, precedes =	"mw-omcpo-90i"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{mw-omcpo-90i
, author =	"J. S. B. Mitchell and E. L. Wynters"
, title =	"Optimal motion of covisible points among obstacles in the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"116--119"
, keywords =	"path planning, shortest paths, multiple agents, visibility"
, succeeds =	"mw-omcpo-90t"
, cites =	"aaghi-vdp-86, cr-nlbtr-87, d-ntpcg-59, ft-fhtu-84, gm-osacv-87t, irwy-spls-89, km-eaesp-88, l-prp-78, lp-esppr-84, lw-apcfp-79, m-naspo-88, mw-omcpo-90t, ps-oplmo-86, ss-spps-86, w-cvgnl-85, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{mw-wrmg-91
, author =	"Joseph S. B. Mitchell and E. L. Wynters"
, title =	"Watchman routes for multiple guards"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"126--129"
, keywords =	"watchman routes, shortest paths, multiple agents, art galleries, dynamic programming"
, cites =	"c-tsplt-90t, c-ctpg-75, cn-owr-86, cn-owr-88, cn-wrsp-87, f-spcwt-78, gj-cigtn-79, k-mchco-86, ll-ccagp-86, nw-owrsp-90m, o-agta-87, mow-vv-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{m-cqmsw-95
, author =	"S. Mitchell"
, title =	"A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume"
, booktitle =	"Proc. 5th Workshop Comput. Geom."
, year =	1995
, update =	"97.11 bibrelex"
}

@article{m-amact-97
, author =	"S. Mitchell"
, title =	"Approximating the maxmin angle covering triangulation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"93--111"
, update =	"97.03 devillers"
}

@inproceedings{m-ccrmm-97
, author =	"S. Mitchell"
, title =	"Choosing corners of rectangles for mapped meshing"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"87--93"
, cites =	"bbehlmstwobclpwwt-cmgev-94, mmw-mrbfm-96, ta-femci-93, achkm-ecmcp-89, m-cqmsw-96, t-hdp-93, e-lchmg-96, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{m-fctma-97
, author =	"S. Mitchell"
, title =	"Finding a covering triangulation whose maximum angle is provably small"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"5--20"
, succeeds =	"mp-fctma-93"
, update =	"98.11 bibrelex, 97.07 devillers"
}

@inproceedings{mt-pdrme-95
, author =	"Scott Mitchell and Timothy J. Tautges"
, title =	"Pillowing Doublets: Refining a Mesh to Ensure that Faces Share at Most One Edge"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"231--241"
, update =	"96.01 samitchell"
}

@incollection{m-cqmsw-96
, author =	"Scott A. Mitchell"
, title =	"A Characterization of the Quadrilateral Meshes of a Surface which Admit a Compatible Hexahedral Mesh of the Enclosed Volume"
, booktitle =	"Proc. 13th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1046
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"465--476"
, update =	"96.05 mitchell+samitchell"
}

@inproceedings{m-amact-93
, author =	"Scott A. Mitchell"
, title =	"Approximating the {MaxMin}-Angel Covering Triangulation"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"36--41"
, cites =	"a-vdsfg-91, ba-acfem-76, b-ct-93, bde-tpwla-95, beemt-eiot-92i, be-mgot-92i, beg-pgmg-90, c-gqtm-89, etw-otama-90, f-vddt-92, l-scsi-77, m-mgpqb-93, mp-fctma-93, mv-qmgtd-92i, r-nsaq2-92, s-udzvd-28, ZZZ"
, update =	"98.11 bibrelex"
}

@inproceedings{m-cbtbm-94
, author =	"S. A. Mitchell"
, title =	"Cardinality Bounds for Triangulations with Bounded Minimum Angle"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"326--331"
, cites =	"beg-pgmg-90, e-acg-87, g-dpnet-84, m-adtad-92, m-amact-93, m-mgpqb-93, mv-qmgtd-92i, r-nsaq2-93, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{m-fctwm-94
, author =	"S. A. Mitchell"
, title =	"Finding a covering triangulation whose maximum angle is provably small"
, booktitle =	"Proc. 17th Australian Annu. Comput. Sci. Conf."
, volume =	16
, year =	1994
, pages =	"55--64"
, succeeds =	"mp-fctma-93"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@phdthesis{m-mgpqb-93
, author =	"S. A. Mitchell"
, title =	"Mesh generation with provable quality bounds"
, school =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1993
, note =	"Technical Report CS-TR-92-1327"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{m-rtpsl-93
, author =	"Scott A. Mitchell"
, title =	"Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large Angles"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"583--591"
, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@techreport{mp-fctma-93
, author =	"S. A. Mitchell and J. K. Park"
, title =	"Finding a Covering Triangulation whose Maximum Angle is Provably Small"
, type =	"manuscript"
, institution =	"Sandia National Laboratories"
, year =	1993
, precedes =	"m-fctwm-94, m-fctma-97"
, update =	"98.11 bibrelex"
}

@inproceedings{mv-arbtd-96
, author =	"Scott A. Mitchell and Stephen A. Vavasis"
, title =	"An Aspect Ratio Bound for Triangulating a $d$-Grid Cut by a Hyperplace"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"48--57"
, cites =	"bgr-ntp-88, bcer-dbmgh-95, beg-pgmg-90, bmr-lsntp-94, c-gqtm-89, d-q3d-94, fsg-famg3-94, j-nspde-87, ms-cinap-92, mv-qmgtd-92i, mv-qmghd-95, t-cfpa-76, v-qfemg-95, v-sfepw-93, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@unpublished{mv-qmghd-95
, author =	"S. A. Mitchell and S. A. Vavasis"
, title =	"Quality mesh generation in higher dimensions"
, year =	1995
, update =	"00.11 smid, 97.11 bibrelex"
}

@article{mv-qmghd-00
, author =	"S. A. Mitchell and S. A. Vavasis"
, title =	"Quality mesh generation in higher dimensions"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"1334--1370"
, update =	"00.11 smid"
}

@techreport{mv-qmgtd-92t
, author =	"S. A. Mitchell and S. A. Vavasis"
, title =	"Quality mesh generation in three dimensions"
, type =	"Technical {Report}"
, number =	"TR~92-1267"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	feb
, year =	1992
, precedes =	"mv-qmgtd-92i"
}

@inproceedings{mv-qmgtd-92i
, author =	"S. A. Mitchell and S. A. Vavasis"
, title =	"Quality mesh generation in three dimensions"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"212--221"
, succeeds =	"mv-qmgtd-92t"
, cites =	"ba-acfem-76, bde-tpwla-92, beemt-eiot-92t, beg-pgmg-90, be-mgot-92t, csw-cds2d-88, cp-tncp-89, c-cdt-89, c-gqtm-89, e-acg-87, ht-nggcf-86, mtv-ugags-91, mt-sttd-90, mv-dgs-90, m-carte-87, m-umafe-88, mw-mamg-90, ps-cgi-85, ZZZ"
, update =	"97.11 bibrelex"
}

@article{m-agnq-92
, author =	"Pinaki Mitra"
, title =	"Answering {Gabriel} Neighbour Queries"
, journal =	"Pattern Recogn. Lett."
, volume =	13
, year =	1992
, pages =	"557--560"
, update =	"98.11 patrignani"
}

@inproceedings{mb-easpq-93
, author =	"P. Mitra and B. Bhattacharya"
, title =	"Efficient Approximate Shortest-Path Queries among Isothetic Rectangular Obstacles"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"518--529"
, update =	"96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
}

@incollection{mn-ecrgv-96
, author =	"P. Mitra and S. C. Nandy"
, title =	"Efficient computation of rectilinear geodesic {Voronoi} neighbor in presence of obstacles"
, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1180
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"76--87"
, precedes =	"mn-ecrgv-98"
, update =	"98.11 smid, 97.03 smid"
}

@article{mn-ecrgv-98
, author =	"P. Mitra and S. C. Nandy"
, title =	"Efficient computation of rectilinear geodesic {Voronoi} neighbor in the presence of obstacles"
, journal =	"J. Algorithms"
, volume =	28
, year =	1998
, pages =	"315--338"
, succeeds =	"mn-ecrgv-96"
, update =	"98.11 smid"
}

@book{m-ai-70
, author =	"D. S. Mitrinovic"
, title =	"Analytic inequalities"
, publisher =	"Springer-Verlag"
, year =	1970
, update =	"97.11 bibrelex"
}

@techreport{ms-sabcp-89
, author =	"J. D. Mittleman and D. L. Souvaine"
, title =	"Shortest Area-Bisector of a Convex Polygon"
, type =	"Technical {Report}"
, number =	"LCSR-TR-139"
, institution =	"Rutgers Univ."
, address =	"New Brunswick, NJ"
, month =	nov
, year =	1989
, update =	"97.11 bibrelex"
}

@article{mauy-dflat-98
, author =	"Youzou Miyadera and Koushi Anzai and Hiroshi Unno and Takeo Yaku"
, title =	"Depth-first layout algorithm for trees"
, journal =	"Inform. Process. Lett."
, volume =	66
, year =	1998
, pages =	"187--194"
, keywords =	"tree-structured diagram, tidy drawing problem, tree layout, hichart"
, update =	"99.03 patrignani"
}

@inproceedings{mk-hcabk-78
, author =	"R. Mizoguchi and O. Kakusho"
, title =	"Hierarchical clustering algorithms based on $k$-nearest neighbors"
, booktitle =	"4th International Joint Conference on Pattern Recognition"
, site =	"Kyoto, Japan"
, year =	1978
, pages =	"314--316"
}

@incollection{m-utcpc-89
, author =	"M. E. Mnev"
, title =	"The {Universality} theorems on the classification problem of configuration varieties and convex polytopes varieties"
, editor =	"O. Y. Viro"
, booktitle =	"Topology and Geometry - Rohlin Seminar"
, series =	"Lecture Notes Math."
, volume =	1346
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"527--544"
, update =	"97.11 bibrelex"
}

@incollection{m-utoms-91
, author =	"N. E. Mn{\"e}v"
, title =	"The universality theorem on the oriented matroid stratification of the space of real matrices"
, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	6
, publisher =	"American Mathematical Society, Association for Computing Machinery"
, year =	1991
, pages =	"237--243"
, update =	"99.11 bibrelex, 97.11 orourke"
}

@article{mr-tcomd-93
, author =	"N. E. Mn{\"e}v and J{\"u}rgen Richter-Gebert"
, title =	"Two constructions of oriented matroids with disconnected extention space"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"271--285"
, update =	"96.05 pocchiola"
}

@article{mz-cmfdg-93
, author =	"N. E. Mn{\"e}v and G. M. Ziegler"
, title =	"Combinatorial Models for the finite-dimensional {G}rassmannians"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"241--250"
, update =	"96.05 pocchiola"
}

@inproceedings{m-iutmw-91
, author =	"B. Mobasseri"
, title =	"Impact of uncertain terrain models on the weighted region problem"
, booktitle =	"Proceedings of the SPIE, The International Society for Optical Engineering"
, volume =	1388
, year =	1991
, pages =	"270--277"
, keywords =	"Uncertain terrain models, Weighted region problem, Obstacle avoidance problem, Surface patches, Traversability indices, Probability distribution, Decision basis, Search"
, update =	"93.09 milone+mitchell"
, abstract =	"Outdoor navigation is characterized by motions through
   regions of varied terrain. The weighted region problem, (WRP), is a
   generalization of the obstacle avoidance problem with 1/ infinity
   cost structure. By assigning indices to surface patches proportional
   to their traversability, WRP seeks a path with the shortest length,
   in the weighted sense. This work generalizes the WRP paradigm by
   stating that the traversability indices may only be available through
   a probability distribution. The reported indices, therefore, are not
   an exact description of the terrain, rather, they are an observation
   drawn from their respective distributions. Development of a decision
   basis directing the search is an objective of the paper."
}

@inproceedings{m-daawr-90
, author =	"B. G. Mobasseri"
, title =	"Decision analytic approach to the weighted region problem"
, booktitle =	"Proceedings of the SPIE, The International Society for Optical Engineering"
, volume =	1293
, year =	1990
, pages =	"438--445"
, update =	"93.09 milone+mitchell"
, abstract =	"The weighted region problem is a generalization of the
   obstacle avoidance problem. By defining a multiple-valued index,
   terrain patches can be distinguished on the basis of their
   traversability. The paper generalizes the weighted region problem by
   defining a probability distribution over the traversability indices
   hence reflecting one's uncertainty as to the true terrain condition.
   Path planning under uncertain traversability requires a proper
   framework for decision making. This paper proposes a formal approach
   to this problem using elements of decision analysis and
   states-of-the-world paradigm. The uncertainty over the traversability
   index, path length and planner's preferences defined over the
   consequence space are all encapsulated into a single decision making
   step."
}

@inproceedings{m-ppuda-89
, author =	"B. G. Mobasseri"
, title =	"Path Planning Under Uncertainty from a Decision Analytic Perspective"
, booktitle =	"Proc. IEEE International Symposium on Intelligent Control"
, site =	"Albany, NY"
, month =	sep
, year =	1989
, pages =	"556--560"
}

@article{m-ddt-90
, author =	"S. Moen"
, title =	"Drawing Dynamic Trees"
, journal =	"IEEE Softw."
, volume =	7
, year =	1990
, pages =	"21--28"
, keywords =	"graph drawing"
, update =	"98.07 vismara, 93.09 tamassia"
}

@mastersthesis{m-rsast-93
, author =	"S. Mohaban"
, title =	"Ray shooting amidst spheres in three dimensions"
, type =	"M. {Sc}. Thesis"
, school =	"Tel Aviv University"
, month =	jun
, year =	1993
, keywords =	"master thesis"
, update =	"93.09 milone+mitchell"
}

@techreport{ms-rsast-93
, author =	"S. Mohaban and M. Sharir"
, title =	"Ray shooting amidst spheres in three dimensions"
, type =	"Manuscript"
, institution =	"??"
, year =	1993
, update =	"98.03 bibrelex"
}

@article{ms-rsast-97
, author =	"S. Mohaban and Micha Sharir"
, title =	"Ray shooting amidst spheres in three dimensions and related problems"
, journal =	"SIAM J. Comput."
, volume =	26
, year =	1997
, pages =	"654--674"
, update =	"98.03 mitchell, 97.07 smid"
}

@inproceedings{mr-rplta-01
, author =	"Ali Mohades and Mohammadreza Razzazi"
, title =	"Reaching a Point with a Linkage in Two Attached Squares"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"162--165"
, update =	"01.04 icking"
}

@techreport{m-spcts-83
, author =	"J. Mohan"
, title =	"A Study in Parallel Computation: the Travelling Salesman Problem"
, number =	"CMU-CS-82-136(R)"
, institution =	"Dept. Computer Science, Carnegie-Mellon University"
, address =	"Pittsburgh, USA"
, year =	1983
, update =	"93.09 held"
}

@article{m-ptcpa-93
, author =	"B. Mohar"
, title =	"A Polynomial Time Circle Packing Algorithm"
, journal =	"Discrete Math."
, volume =	117
, year =	1993
, pages =	"257--263"
, update =	"98.07 tamassia+vismara"
}

@article{m-bc-88
, author =	"B. Mohar"
, title =	"Branched coverings"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"339--348"
}

@article{m-ngncb-88
, author =	"B. Mohar"
, title =	"Nonorientable genus of nearly complete bipartite graphs"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"137--146"
}

@inproceedings{mr-faudt-95
, author =	"B. Mohar and P. Rosenstiehl"
, title =	"A Flow Approach to Upward Drawings of Toroidal Maps"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"33--39"
, keywords =	"graph drawing, topological graph theory"
, update =	"95.01 tamassia"
}

@book{mt-gs-01
, author =	"Bojan Mohar and Carsten Thomassen"
, title =	"Graphs on Surfaces"
, publisher =	"Johns Hopkins University Press"
, address =	"Baltimore"
, year =	2001
, update =	"02.03 icking+pocchiola, 01.11 orourke"
}

@incollection{m-ctcos-89
, author =	"R. H. M{\"o}hring"
, title =	"Computationally Tractable Classes of Ordered Sets"
, editor =	"I. Rival"
, booktitle =	"Algorithms and Order"
, year =	1989
, pages =	"105--193"
, update =	"98.07 bibrelex"
}

@inproceedings{mm-cmamr-97
, author =	"Rolf H. M{\"o}hring and Matthias M{\"u}ller-Hannemann"
, title =	"Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals"
, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '97"
, site =	"Singapore"
, series =	"Lecture Notes Comput. Sci."
, volume =	1350
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"263--272"
, update =	"98.07 bibrelex+mitchell, 98.03 mitchell"
}

@techreport{mmw-mrbfm-96
, author =	"R. H. M{\"o}hring and M. M{\"u}ller-Hannemann and K. Weihe"
, title =	"Mesh refinement via bidirected flows: {Modeling}, complexity and computational results"
, type =	"Report"
, number =	520
, institution =	"Dept. Math., Technische Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, year =	1996
, url =	"http://www.math.TU-Berlin.DE/~mhannema/projecteng.html"
, update =	"98.07 bibrelex"
}

@inproceedings{mmw-unfsm-95
, author =	"Rolf H. M{\"o}hring and Matthias M{\"u}ller-Hannemann and Karsten Weihe"
, title =	"Using Network Flows for Surface Modeling"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"350--359"
, keywords =	"mesh generation, CAD, surface refinement"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@book{m-gtd23-77
, author =	"E. Moise"
, title =	"Geometric Topology in Dimensions 2 and 3"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1977
, update =	"98.03 bibrelex"
}

@phdthesis{m-epacb-89
, author =	"D. Moitra"
, title =	"Efficient parallel algorithms for covering binary images"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1989
, note =	"Technical Report TR-89-1013"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@article{m-fmcbi-91
, author =	"D. Moitra"
, title =	"Finding a minimal cover for binary images: an optimal parallel algorithm"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"624--657"
}

@article{mt-fmsrt-97
, author =	"T. M{\"o}ller and B. Trumbore"
, title =	"Fast, Minimum Storage Ray-Triangle Intersection"
, journal =	"J. Graphics Tools"
, volume =	2
, number =	1
, year =	1997
, pages =	"21--28"
, update =	"97.11 held"
}

@article{m-udzts-57
, author =	"J. Moln{\'a}r"
, title =	"{\"U}ber den zweidimensionalen topologischen {Satz} von {Helly}"
, journal =	"Mat. Lapok"
, volume =	8
, year =	1957
, pages =	"108--114"
, note =	"Hungarian with German and Russian Summaries"
, update =	"98.03 bibrelex"
}

@inproceedings{mrs-psaaf-96
, author =	"B. Monien and F. Ramme and H. Salmen"
, title =	"A Parallel Simulated Annealing Algorithm for Generating {3D} Layouts of Undirected Graphs"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"396--408"
, keywords =	"graph drawing, 3D, straight-line"
, update =	"96.09 tamassia, 96.04 garg"
}

@article{m-csmdc-80
, author =	"L. Monier"
, title =	"Combinatorial solutions of multidimensional divide-and-conquer recurrences"
, journal =	"J. Algorithms"
, volume =	1
, year =	1980
, pages =	"60--74"
}

@inproceedings{mpsy-cemst-88
, author =	"C. Monma and M. Paterson and Subhash Suri and F. Yao"
, title =	"Computing {Euclidean} maximum spanning trees"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"241--251"
, precedes =	"mpsy-cemst-90"
, cites =	"abky-cabmm-88, akmsw-gamsa-87, a-dp-86, c-hsh-85, e-ga-79, gbt-srtgp-84, gh-hmstp-85, j-hcs-67, j-nccog-82, l-fnvda-80, ps-cgi-85, s-cg-78, ss-pnt-63, tb-gatuf-81, y-cmstk-82, j-snnms-78, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{mpsy-cemst-90
, author =	"C. Monma and M. Paterson and Subhash Suri and F. Yao"
, title =	"Computing {Euclidean} maximum spanning trees"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"407--419"
, succeeds =	"mpsy-cemst-88"
, update =	"98.03 mitchell"
}

@inproceedings{ms-ppgmm-91
, author =	"C. Monma and Subhash Suri"
, title =	"Partitioning points and graphs to minimize the maximum or the sum of diameters"
, booktitle =	"Graph Theory, Combinatorics and Applications (Proc. 6th Internat. Conf. Theory Appl. Graphs)"
, volume =	2
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1991
, pages =	"899--912"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@techreport{ms-setpc-90
, author =	"C. Monma and Subhash Suri"
, title =	"Some Embedding and topological problems concerning minimum spanning trees"
, month =	dec
, year =	1990
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@techreport{ms-tgmst-91t
, author =	"C. Monma and Subhash Suri"
, title =	"Transitions in geometric minimum spanning trees"
, type =	"Technical {Memorandum}"
, institution =	"Bell Communications Research"
, year =	1991
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{ms-tgmst-91
, author =	"C. Monma and Subhash Suri"
, title =	"Transitions in geometric minimum spanning trees"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"239--249"
, keywords =	"proximity, minimum spanning tree"
, cites =	"abky-cabmm-88, a-sdcgp-85, ccpy-nubns-86, cd-vdbcd-85, c-oarn-85, d-mstia-86, e-acg-87, ggt-fpmfa-89, g-bpstp-79, g-saco-80, g-pccpp-83, gi-psmmc-89, gm-fagpm-89, ms-tgmst-91t, pq-samcn-82, pr-cardf-78, st-dsdt-83, t-dsna-83, y-cmstk-82, z-gtmdg-71, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ms-tgmst-92
, author =	"C. Monma and Subhash Suri"
, title =	"Transitions in geometric minimum spanning trees"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"265--293"
, keywords =	"proximity, minimum spanning tree"
, update =	"98.03 mitchell, 95.09 agarwal"
}

@article{mrt-ttg-88
, author =	"C. T. Monma and B. Reed and W. T. Trotter"
, title =	"Threshold tolerance graphs"
, journal =	"J. Graph Theory"
, volume =	12
, year =	1988
, pages =	"343--362"
, update =	"98.11 bibrelex"
}

@book{m-cacpp-82
, author =	"M. S. Monmonier"
, title =	"Computer Assisted Cartography: Principles and Prospects"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs"
, year =	1982
, update =	"96.09 kreveld"
}

@book{m-hlm-91
, author =	"M. S. Monmonier"
, title =	"How to Lie with Maps"
, publisher =	"The Chicago University Press"
, address =	"Chicago"
, year =	1991
, update =	"96.09 kreveld"
}

@inproceedings{m-pgrth-91
, author =	"Paul-Andr{\'e} Monney"
, title =	"Planar geometric reasoning with the theory of hints"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"141--159"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{mmp-lban2-94
, author =	"J. L. Monta{\~n}a and J. E. Morais and Luis M. Pardo"
, title =	"Lower Bounds for Arithmetic Networks {II}: Sum of {Betti} Numbers"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"45--48"
, update =	"00.11 smid, 00.07 icking"
}

@article{m-mosuq-68
, author =	"U. Montanari"
, title =	"A method for obtaining skeletons using a quasi-{Euclidean} distance"
, journal =	"J. ACM"
, volume =	15
, year =	1968
, pages =	"600--624"
}

@article{m-csdi-69
, author =	"U. Montanari"
, title =	"Continuous skeletons from digitized images"
, journal =	"J. ACM"
, volume =	16
, year =	1969
, pages =	"534--549"
, update =	"93.05 freimer"
}

@article{mss-mluti-94
, author =	"Claudio Montani and Riccardo Scateni and Roberto Scopigno"
, title =	"A modified look--up table for implicit disambiguation of {M}arching {C}ubes"
, journal =	"Visual Comput."
, volume =	10
, year =	1994
, pages =	"353--355"
, update =	"01.07 wenger"
}

@article{mt-cmcag-84
, author =	"Y. Montaudin and W. Tilles"
, title =	"The {Cayley} method in computer aided geometric design"
, journal =	"Comput. Aided Geom. Design"
, volume =	1
, year =	1984
, pages =	"309--326"
, update =	"98.03 bibrelex"
}

@inproceedings{mu-ifp-91
, author =	"L. Montejano and J. Urrutia"
, title =	"Immobilizing figures on the plane"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"46--49"
, cites =	"csu-is-90, mnp-ogp-89, mnp-gg-90, k-dwp-90, o-cgc9-90, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{mr-csrp-94
, author =	"A. Monti and A. Roncato"
, title =	"On the Complexity of Some Reachability Problems"
, booktitle =	"Proc. 2nd Italian Conference on Algorithms and Complexity"
, year =	1994
, update =	"95.01 mitchell"
}

@book{m-oe-79
, author =	"J. Montroll"
, title =	"Origami for the Enthusiast"
, publisher =	"Dover"
, year =	1979
, update =	"97.11 bibrelex"
}

@book{m-po-89
, author =	"J. Montroll"
, title =	"Prehistoric Origami"
, publisher =	"Dover Publications"
, year =	1989
, update =	"97.11 bibrelex"
}

@book{ml-osl-90
, author =	"J. Montroll and R. J. Lang"
, title =	"Origami Sea Life"
, publisher =	"Dover"
, year =	1990
, update =	"97.11 bibrelex"
}

@techreport{mf-lttsp-85
, author =	"D. Montuno and A. Fournier"
, title =	"A linear time triangulation for simple polygons"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Toronto"
, address =	"Toronto, ON"
, year =	1985
}

@techreport{mf-diasp-82
, author =	"D. Montuno and A. Fournier"
, title =	"Detecting intersections among star polygons"
, institution =	"University of Toronto"
, year =	1982
, update =	"97.11 bibrelex"
}

@techreport{mw-mamg-90
, author =	"D. Moore and J. Warren"
, title =	"Multidimensional adaptive mesh generation"
, type =	"Technical {Report}"
, number =	"90-106"
, institution =	"Dept. Comput. Sci., Rice Univ."
, year =	1990
, update =	"97.11 bibrelex"
}

@phdthesis{m-smga-92
, author =	"D. W. Moore"
, title =	"Simplicial mesh generation with applications"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1992
, note =	"Report 92-1322"
, keywords =	"doctoral thesis"
, update =	"95.01 mitchell"
}

@inproceedings{m-sptm-
, author =	"E. Moore"
, title =	"Shortest Path Through a Maze"
, booktitle =	"Proc. of an International Symposium on the Theory of Switching"
, publisher =	"Harvard University Press"
, pages =	"285--292"
, update =	"93.09 milone+mitchell"
}

@article{mw-cdrca-88
, author =	"M. Moore and J. Willhelms"
, title =	"Collision detection and response for computer animation"
, journal =	"Comput. Graph."
, volume =	22
, number =	4
, month =	aug
, year =	1988
, pages =	"289--298"
, note =	"Proc. SIGGRAPH '88"
, update =	"93.09 milone+mitchell"
}

@book{m-ia-66
, author =	"R. E. Moore"
, title =	"Interval Analysis"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1966
, update =	"98.03 bibrelex"
}

@book{m-maia-79
, author =	"R. E. Moore"
, title =	"Methods and Applications of Interval Analysis"
, publisher =	"SIAM"
, year =	1979
, update =	"98.03 bibrelex"
}

@inproceedings{mm-chf-83
, author =	"F. Mora and H. Moller"
, title =	"Computation of the {Hilbert} Function"
, booktitle =	"Proc. European Comput. Algebra Conf."
, series =	"Lecture Notes Comput. Sci."
, volume =	162
, publisher =	"Springer-Verlag"
, year =	1983
, pages =	"157--167"
, update =	"97.11 bibrelex"
}

@inproceedings{mh-vdvso-91
, author =	"B. A. Moran and W. Hansmann"
, title =	"Visual Design Verification of Sculptured Objects"
, booktitle =	"Proceedings of the First International Offshore and Polar Engineering Conference"
, year =	1991
, update =	"95.05 abrams"
}

@article{m-nrsgp-66
, author =	"P. A. P. Moran"
, title =	"A note on recent search in geometrical probability"
, journal =	"J. Appl. Probab."
, volume =	3
, year =	1966
, pages =	"453--463"
}

@article{m-cdopm-83
, author =	"S. Moran"
, title =	"On the complexity of designing optimal partial-match retrieval systems"
, journal =	"ACM Trans. Database Syst."
, volume =	8
, year =	1983
, pages =	"543--551"
}

@article{m-lotcs-84
, author =	"S. Moran"
, title =	"On the length of optimal {TSP} circuits in sets of bounded diameter"
, journal =	"J. Combin. Theory Ser. B"
, volume =	37
, year =	1984
, pages =	"113--141"
, update =	"97.11 bibrelex"
}

@phdthesis{m-rrvn-81
, author =	"H. P. Moravac"
, title =	"Robot Rover Visual Navigation"
, school =	"Stanford University"
, year =	1981
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@techreport{m-oanrw-80
, author =	"H. P. Moravec"
, title =	"Obstacle avoidance and navigation in the real world by a setting robot rover"
, type =	"Report"
, number =	"STAN-CS-80-813"
, institution =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, year =	1980
}

@phdthesis{m-fhrsg-90
, author =	"J.-M. Moreau"
, title =	"Fac{\'e}tisation et hi{\'e}rarchisation de la repr{\'e}sentation par segments d'un graphe planaire dans le cadre d'une arithm{\'e}tique mixte"
, school =	"{\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{m-hdt-94
, author =	"J.-M. Moreau"
, title =	"Hierarchical {Delaunay} Triangulation"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"165--170"
, cites =	"a-vdsfg-91, c-cdt-89, c-ucplg-75, c-llpqb-72, f-savd-87, gs-pmgsc-85, ll-gdtpg-86, ls-tacdt-80, mv-cdtr-93, s-ac-90, hsa-fdsc-93, j-cegt-70, s-cdtvd-88, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{mv-cdtr-93
, author =	"J.-M. Moreau and P. Volino"
, title =	"Constrained {Delaunay} triangulation revisited"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"340--345"
, cites =	"a-vdsfg-91, bt-hrodt-86, c-cdt-87, c-cdt-89, es-cvdpu-90, f-savd-86, f-savd-87, gs-pmgsc-85, k-eccs-79, l-prp-78p, ll-gdtpg-86, ls-tacdt-80, ps-cgi-85, s-cdtvd-88, sh-cpp-75, dmt-fddtl-91t, ws-oacdt-87, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{m-dtd-82
, author =	"B. Moret"
, title =	"Decision trees and diagrams"
, journal =	"ACM Comput. Surv."
, volume =	"??"
, year =	1982
, pages =	"593--623"
, update =	"98.03 bibrelex"
}

@inproceedings{mcsy-irp-97
, author =	"B. M. E. Moret and M. Collins and J. Saia and L. Yu"
, title =	"The Ice Rink Problem"
, booktitle =	"Proc. Workshop on Algorithm Engineering"
, nickname =	"WAE '97"
, site =	"Venice"
, month =	sep
, year =	1997
, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap11.ps.gz"
, update =	"00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell+moret"
}

@inproceedings{ms-eaacm-91
, author =	"B. M. E. Moret and H. D. Shapiro"
, title =	"An empirical analysis of algorithms for constructing a minimum spanning tree"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"400--411"
, update =	"93.05 moret"
}

@inproceedings{ms-hfmst-91
, author =	"B. M. E. Moret and H. D. Shapiro"
, title =	"How to find a minimum spanning tree in practice"
, booktitle =	"Proc. Conf. on New Results and New Trends in Computer Science"
, series =	"Lecture Notes Comput. Sci."
, volume =	555
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"192--203"
, update =	"93.09 erickson, 93.05 moret"
}

@book{m-gmtbg-88
, author =	"F. Morgan"
, title =	"Geometric Measure Theory: a Beginner's Guide"
, publisher =	"Academic Press"
, year =	1988
, update =	"97.11 bibrelex"
}

@inproceedings{m-mscnr-91
, author =	"F. Morgan"
, title =	"Minimal surfaces, crystals, and norms on {$R^{n}$}"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"204--213"
, cites =	"abfhz-csbp-90, achlkkmh-scmfe-90, achlkkmh-sspmn-91, c-sp-67, c-emnr-89, cr-wim-41, h-sprd-66, lm-mcnif-91, l-emnmo-90, m-gmtbg-88, m-rgbg-91, m-sbcsn-91, t-sssbl-76, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{m-rgbg-91
, author =	"F. Morgan"
, title =	"{Riemannian} Geometry: a Beginner's guide"
, type =	"Manuscript"
, institution =	"Williams College"
, year =	1991
, update =	"97.11 bibrelex"
}

@techreport{m-sbcsn-91
, author =	"F. Morgan"
, title =	"Soap-bubble-clusters, shortest networks, and minimal surfaces"
, type =	"Preprint"
, institution =	"Williams College"
, year =	1991
, update =	"97.11 bibrelex"
}

@article{msy-hrord-92
, author =	"S. Mori and C. Suen and K. Yamamoto"
, title =	"Historical review of {OCR} research and development"
, journal =	"Proc. IEEE"
, volume =	80
, year =	1992
, pages =	"1029--1058"
, update =	"98.07 bibrelex"
}

@article{myy-rmrhc-84
, author =	"S. Mori and K. Yamamoto and M. Yasuda"
, title =	"Research on machine recognition of handprinted characters"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-6"
, year =	1984
, pages =	"386--405"
, update =	"98.07 bibrelex"
}

@incollection{mpz-cgmlp-96
, author =	"T. L. Morin and N. Prabhu and Z. Zhang"
, title =	"Complexity of the gravitational method for linear programming"
, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1180
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"212--223"
, update =	"97.03 smid"
}

@phdthesis{m-tphpu-73
, author =	"H. C. Morris"
, title =	"Two pigeon hole principles and unions of convexly disjoint sets"
, school =	"Califonia Inst. Tech."
, address =	"Pasadena, CA"
, year =	1973
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{mn-salfl-80
, author =	"J. G. Morris and J. P. Norback"
, title =	"A simple approach to linear facility location"
, journal =	"Transp. Sci."
, volume =	14
, year =	1980
, pages =	"1--8"
, update =	"98.03 bibrelex"
}

@article{ms-esppc-00
, author =	"W. Morris and V. Soltan"
, title =	"The {Erd{\H{o}}s-Szekeres} problem on points in convex position - a survey"
, journal =	"Bull. Amer. Math. Soc."
, volume =	37
, year =	2000
, pages =	"437--458"
, update =	"02.03 devillers"
}

@book{m-cghgm-90
, author =	"M. E. Mortenson"
, title =	"Computer Graphics Handbook: Geometry and Mathematics"
, publisher =	"Industrial Press"
, year =	1990
, isbn =	"0-8311-1002-3"
, update =	"93.09 held"
, annote =	"a self-contained collection of analytic geometry concepts"
}

@book{m-gm-85
, author =	"M. E. Mortenson"
, title =	"Geometric Modeling"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1985
, update =	"99.11 bibrelex, 93.05 orourke"
}

@techreport{m-cogdb-66
, author =	"G. M. Morton"
, title =	"A computer oriented geodetic data base and a new technique in file sequencing"
, institution =	"IBM Ltd."
, address =	"Ottawa, Canada"
, year =	1966
, update =	"97.07 agarwal"
}

@inproceedings{mf-iicsf-96
, author =	"S. M. Morvan and G. M. Fadel"
, title =	"IVECS, interactive correction of .{STL} files in a virtual environment"
, booktitle =	"Proc. Sympos. on Solid Freeform Fabrication"
, site =	"Austin, TX"
, organization =	"Dept. Mech. Eng., Univ. Texas Austin"
, year =	1996
, update =	"98.07 bibrelex"
}

@inproceedings{myap-vimps-95
, author =	"M. A. Mosaad and X. Ye and S. L. Abrams and N. M. Patrikalakis"
, title =	"Visualization and Information Modeling of Propeller Surface Roughness"
, booktitle =	"Proc. IMAM '95, 7th International Maritime Association of Mediterranean Congress"
, year =	1995
, update =	"95.09 korneenko, 95.05 abrams"
}

@article{m-dddnp-52
, author =	"L. Moser"
, title =	"On the different distances determined by $n$ points"
, journal =	"Amer. Math. Monthly"
, volume =	59
, year =	1952
, pages =	"85--91"
, update =	"98.07 bibrelex"
}

@techreport{m-rpdg-81
, author =	"W. Moser"
, title =	"Research Problems in Discrete Geometry"
, institution =	"Dept. Math., McGill Univ."
, address =	"Montreal, PQ"
, year =	1981
, update =	"97.11 bibrelex"
}

@incollection{mp-rdcg-93
, author =	"W. Moser and J. Pach"
, title =	"Recent Developments in Combinatorial Geometry"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"281--302"
, keywords =	"survey paper, combinatorial geometry, distance distribution, geometric graphs, lines in space"
, update =	"93.09 erickson+rote"
}

% ### others?
@incollection{m-pepfs-85
, author =	"W. O. J. Moser"
, title =	"Problems on extremal properties of a finite set of points"
, editor =	"Goodman and others"
, booktitle =	"??"
, publisher =	"New York Academy of Sciences"
, year =	1985
, pages =	"52--64"
, update =	"97.11 bibrelex"
}

@inproceedings{m-bafva-89
, author =	"G. S. Moss"
, title =	"``{BURST}:'' {Air} {Force} vulnerability analyses from {BRL-CAD} models"
, booktitle =	"Proc. BRL-CAD Symposium `89"
, publisher =	"American Defense Preparadness Assoc."
, address =	"Aberdeen Proving Ground, MD"
, year =	1989
, pages =	"88--109"
, update =	"95.05 agarwal"
}

@article{m-snaga-67
, author =	"W. W. Moss"
, title =	"Some new analytic and graphic approaches to numerical taxonomy, with an example from the dermanyssidae"
, journal =	"Systematic Zoology"
, volume =	16
, year =	1967
, pages =	"177--207"
}

@incollection{mfs-2dcmc-87
, author =	"R. C. Mosteller and A. H. Frey and R. Suaya"
, title =	"$2$-d compaction a {Monte}-{Carlo} method"
, editor =	"P. Lasleber"
, booktitle =	"Advanced Research in VLSI"
, publisher =	"MIT Press"
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{mas-ast-90
, author =	"P. H. Mott and A. S. Argon and U. W. Suter"
, title =	"The atomic strain tensor"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"125--128"
, cites =	"too-natdv-83, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{m-hmcs-96
, author =	"R. Motwani"
, title =	"Hashing Molecules for Common Substructures"
, type =	"Working paper"
, institution =	"??"
, year =	1996
, update =	"98.07 bibrelex"
}

@inproceedings{mnn-pmydp-89
, author =	"R. Motwani and J. Naor and M. Naor"
, title =	"The probabilistic method yields deterministic parallel algorithms"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"8--13"
, keywords =	"random sampling, derandomization"
, comments =	"to appear in J. Comput. Syst. Sci."
}

@inproceedings{mr-ddsqd-86
, author =	"R. Motwani and P. Raghavan"
, title =	"Deferred data structuring: query-driven preprocessing for geometric search problems"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"303--312"
, precedes =	"kmr-dds-88"
, cites =	"b-lbact-83, b-mdc-80, cgl-pgd-83, d-ltatt-84, km-pstoo-85, ks-upcha-82, m-pst-85, m-ltalp-83, sh-cpp-75, sh-gip-76, s-cg-78, ZZZ"
, update =	"98.03 bibrelex"
}

@book{mr-ra-95
, author =	"R. Motwani and P. Raghavan"
, title =	"Randomized Algorithms"
, publisher =	"Cambridge University Press"
, address =	"New York, NY"
, year =	1995
, update =	"97.03 agarwal, 96.05 ramkumar+smid"
}

@inproceedings{mrs-copsp-88
, author =	"R. Motwani and A. Raghunathan and H. Saran"
, title =	"Covering orthogonal polygons with star polygons: the perfect graph approach"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"211--223"
, precedes =	"mrs-copsp-89"
, cites =	"a-agpiv-84, cr-dduap-87, gj-cigtn-79, g-amcmc-72, g-agtpg-80, gls-emicc-81, h-wtg-85, hhm-owtg-87, k-mchco-86, l-pg-83, m-udzts-57, mrs-pgocc-89, o-agta-87, rc-csopm-87, r-cocpt-87, os-snhpd-83, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{mrs-copsp-89
, author =	"R. Motwani and A. Raghunathan and H. Saran"
, title =	"Covering orthogonal polygons with star polygons: the perfect graph approach"
, journal =	"J. Comput. Syst. Sci."
, volume =	40
, year =	1989
, pages =	"19--48"
, keywords =	"perfect graphs, polygon covering"
, succeeds =	"mrs-copsp-88"
}

@article{mrs-pgocc-88
, author =	"R. Motwani and A. Raghunathan and H. Saran"
, title =	"Perfect Graphs and Orthogonally Convex Covers"
, journal =	"4th SIAM Conf. on Discr. Math."
, volume =	"??"
, month =	jun
, year =	1988
, update =	"98.07 bibrelex"
}

@article{mrs-pgocc-89
, author =	"R. Motwani and A. Raghunathan and H. Saran"
, title =	"Perfect graphs and orthogonally convex covers"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	2
, year =	1989
, pages =	"371--392"
, keywords =	"perfect graphs, polygon covering"
}

@article{m-lpcpf-51
, author =	"T. Motzkin"
, title =	"The lines and planes connecting the points of a finite set"
, journal =	"Trans. Amer. Math. Soc."
, volume =	70
, year =	1951
, pages =	"451--464"
, update =	"98.07 devillers"
}

@article{mrtt-ddm-53
, author =	"T. S. Motzkin and H. Raiffa and G. L. Thompson and R. M. Thrall"
, title =	"The Double Desription Method"
, journal =	"Annals of Math. Studies"
, volume =	8
, year =	1953
, update =	"97.11 bibrelex"
}

@inproceedings{m-mospv-90
, author =	"N. Mouawad"
, title =	"Minimal obscuring sets: the parallel view case"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"232--235"
, cites =	"ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{m-nvg-??
, author =	"N. Mouawad"
, title =	"On the nature of visibility graphs"
, institution =	"University of Waterloo"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{m-mcscp-91
, author =	"Naji Mouawad"
, title =	"The minimal cone-segment cover problem"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"100--103"
, cites =	"b-lbact-83, dls-rphs-88, s-mplbc-85, h-tsm-85, hv-splsp-49, ll-ccmp-84, m-dsass-81, o-agta-87, v-msv-53, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{ms-sp-89
, author =	"N. Mouawad and T. Shermer"
, title =	"The {Superman} problem"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	39
, update =	"95.01 smid"
}

@article{ms-sp-94
, author =	"N. Mouawad and T. Shermer"
, title =	"The {Superman} problem"
, journal =	"Visual Comput."
, volume =	10
, year =	1994
, pages =	"459--473"
, update =	"95.01 smid"
}

@incollection{m-gi-97
, author =	"D. Mount"
, title =	"Geometric intersection"
, chapter =	33
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"615--632"
, update =	"97.11 orourke"
}

@inproceedings{m-idssp-92
, author =	"D. M. Mount"
, title =	"Intersection detection and separators for simple polygons"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"303--311"
, cites =	"c-tsplt-90i, cd-icott-87, cegghss-rspug-91, cg-vippg-89, ck-plscc-89, dk-dsppu-90, e-cedbt-85, f-fapct-85, gs-pmgsc-85, km-accvd-91, ls-pptmc-87, ps-cgi-85, s-dasds-90, s-ltaml-86, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{m-fspcp-85
, author =	"D. M. Mount"
, title =	"On Finding Shortest Paths on Convex Polyhedra"
, type =	"Technical {Report}"
, number =	1495
, institution =	"Department of Computer Science, University of Maryland"
, year =	1985
, update =	"95.09 agarwal"
}

@inproceedings{m-ssps-86
, author =	"D. M. Mount"
, title =	"Storing the subdivision of a polyhedral surface"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"150--158"
, precedes =	"m-ssps-87"
, cites =	"dk-fdpi-83, dm-eup-85, egs-oplms-86, gs-pmgsc-85, k-osps-83, lp-lppsi-77, mmp-dgp-87, m-fspcp-85, m-vdsp-85, mp-fitcp-78, p-nappl-81, sh-cpp-75, ss-spps-84, s-icpps-85, ZZZ"
, update =	"97.11 bibrelex"
}

@article{m-ssps-87
, author =	"D. M. Mount"
, title =	"Storing the subdivision of a polyhedral surface"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"153--174"
, succeeds =	"m-ssps-86"
}

@techreport{m-ddlpc-91
, author =	"D. M. Mount"
, title =	"The densest double-lattice packing of a convex polygon"
, type =	"Report"
, number =	2584
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1991
, keywords =	"packing, convex"
, update =	"95.09 agarwal"
}

@incollection{m-ddlpc-91i
, author =	"D. M. Mount"
, title =	"The densest double-lattice packing of a convex polygon"
, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
, booktitle =	"Discrete Comput. Geom."
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1991
, pages =	"245--262"
, update =	"98.03 bibrelex"
}

@techreport{m-nspsp-86
, author =	"D. M. Mount"
, title =	"The number of shortest paths on the surface of a polyhedron"
, type =	"Report"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1986
, update =	"97.11 bibrelex"
}

@article{m-nspsp-90
, author =	"D. M. Mount"
, title =	"The number of shortest paths on the surface of a polyhedron"
, journal =	"SIAM J. Comput."
, volume =	19
, year =	1990
, pages =	"593--611"
}

@techreport{m-vdsp-85
, author =	"D. M. Mount"
, title =	"Voronoi Diagrams on the Surface of a Polyhedron"
, type =	"Technical Report"
, number =	1496
, institution =	"Department of Computer Science, University of Maryland"
, year =	1985
, update =	"93.09 milone+mitchell"
}

@inproceedings{mc-uafet-88
, author =	"D. M. Mount and S. Chandran"
, title =	"A unified approach to finding enclosing and enclosed triangles"
, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
, year =	1988
, update =	"98.07 bibrelex"
}

@inproceedings{mn-earca-93
, author =	"D. M. Mount and N. Netanyahu"
, title =	"Efficient algorithms for robust circular arc estimators"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"79--84"
, succeeds =	"mn-earca-93u"
, cites =	"am-rsss-92, a-afccf-90, c-ocfod-90, ck-ocfwd-93, csss-otass-89, clr-ia-90, dmn-rass-92, hrrs-rsabi-86, m-ept-91, m-roass-91, mmn-erarm-93, mn-earca-93u, rl-rrod-87, s-ercbk-68, s-rrurm-82, sw-rssf-92, to-lseec-89a, t-mlpra1-50, t-mlpra2-50, t-mlpra3-50, tc-saeca-89, ZZZ"
, update =	"98.11 bibrelex, 95.09 agarwal, 93.09 milone+mitchell"
}

@techreport{mn-ceahr-91
, author =	"D. M. Mount and N. S. Netanyahu"
, title =	"Computationally Efficient Algorithms for a Highly Robust Line Estimators"
, type =	"Technical Report"
, number =	"CS-TR-2816"
, institution =	"Center for Automation Research, University of Maryland"
, month =	dec
, year =	1991
, update =	"98.07 bibrelex"
}

@unpublished{mn-ceahd-92u
, author =	"D. M. Mount and N. S. Netanyahu"
, title =	"Computationally efficient algorithms for high-dimensional robust estimators"
, year =	1992
, note =	"Technical Report in preparation, Center for Automation Research, University of Maryland"
, precedes =	"mn-ceahd-92"
, update =	"98.07 bibrelex"
}

@inproceedings{mn-ceahd-92
, author =	"D. M. Mount and N. S. Netanyahu"
, title =	"Computationally efficient algorithms for high-dimensional robust estimators"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"257--263"
, succeeds =	"mn-ceahd-92u"
, cites =	"dmn-rass-92, dh-nbp-83, es-cmsrl-90, gp-ms-83, m-roass-91, r-msr-84, ss-tseal-87, sw-frmrl-92, t-mlpra1-50, csss-otass-89, mmn-erarm-92, mn-ceahr-91, mn-ceahd-92u, n-ceare-91, on-rerc-84, rl-rrod-87, s-ercbk-68, s-rrurm-82, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@unpublished{mn-earca-93u
, author =	"D. M. Mount and N. S. Netanyahu"
, title =	"Efficient algorithms for robust circular arc estimators"
, note =	"technical report in preparation"
, precedes =	"mn-earca-93"
, update =	"98.11 bibrelex"
}

@article{mn-erare-01
, author =	"D. M. Mount and N. S. Netanyahu"
, title =	"Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"1--33"
, update =	"01.07 smid"
}

@article{mnpsw-qarse-00
, author =	"D. M. Mount and N. S. Netanyahu and C. D. Piatko and R. Silverman and A. Y. Wu"
, title =	"Quantile approximation for robust statistical estimation and {$k$}-enclosing problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"593--608"
, update =	"01.04 smid"
}

@inproceedings{mnrsy-paall-97
, author =	"D. M. Mount and N. S. Netanyahu and K. R. Romanik and R. Silverman and A. Y. Yu"
, title =	"A Practical Approximation Algorithm for the LMS Line Estimator"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1997
, pages =	"473--482"
, update =	"97.03 held"
}

@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"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"261--266"
, precedes =	"mnsw-cnnsq-00"
, update =	"01.04 icking, 95.09 jones"
}

@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"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"97--119"
, succeeds =	"mnsw-cnnsq-95"
, update =	"01.04 icking+smid"
}

@inproceedings{ms-getcc-88
, author =	"D. M. Mount and A. Saalfeld"
, title =	"Globally-equiangular triangulations of co-circular points in {$O(n \log n)$} time"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"143--152"
, cites =	"e-p33-87, e-acg-87, or-imtfe-76, ps-cgi-85, ZZZ"
, update =	"98.03 bibrelex"
}

@article{ms-pcptc-90
, author =	"D. M. Mount and R. Silverman"
, title =	"Packing and covering the plane with translates of a convex polygon"
, journal =	"J. Algorithms"
, volume =	11
, year =	1990
, pages =	"564--580"
, keywords =	"packing, decomposition"
, update =	"95.09 agarwal"
}

@article{msw-aotp-93
, author =	"D. M. Mount and R. Silverman and A. Wu"
, title =	"On the area of overlap of translated polygons"
, journal =	"SPIE Vision Geometry II"
, volume =	2060
, year =	1993
, pages =	"254--264"
, update =	"99.11 devillers"
}

% c-stsar-94 quotes this work incompletely.
@phdthesis{m--83
, author =	"J. T. Mowchenko"
, title =	"??"
, school =	"Department of Electrical Engineering, University of Waterloo"
, year =	1983
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@article{m-ccchf-82
, author =	"Y. J. Mu"
, title =	"Computer construction of the convex hull of finite point sets ({Chinese} {English} summary)"
, journal =	"J. Northwest Univ."
, volume =	12
, year =	1982
, pages =	"28--34"
}

@article{m-ritdd-98
, author =	"E. P. M{\"u}cke"
, title =	"A Robust Implementation for Three-Dimensional {Delaunay} Triangulations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, number =	2
, year =	1998
, pages =	"255--276"
, update =	"98.07 held"
}

@mastersthesis{m-emzed-85
, author =	"E. P. M{\"u}cke"
, title =	"Ein {Modell} zur {Elimination} degeneriertter {F{\"a}lle} in geometrischen {Algorithmen}"
, school =	"Inst. Informationsverarb., Techn. Univ. Graz"
, address =	"Graz, Austria"
, year =	1985
, note =	"Graduating thesis"
, keywords =	"master thesis"
, update =	"98.03 bibrelex"
}

@phdthesis{m-sitdg-93
, author =	"E. P. M{\"u}cke"
, title =	"Shapes and Implementations in Three-Dimensional Geometry"
, school =	"Department of Computer Science, University of Illinois"
, address =	"Urbana, IL"
, year =	1993
, note =	"Technical Report UIUCDCS-R-93-1836"
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{msz-frplw-96
, author =	"Ernst P. M{\"u}cke and Isaac Saias and Binhai Zhu"
, title =	"Fast Randomized Point Location Without Preprocessing in Two- and Three-Dimensional {Delaunay} Triangulations"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"274--283"
, cites =	"aeiim-pubtc-85, bp-adtaa-91, bd-irgo-95, bey-eedt-91a, b-cdt-81, b-rgsdd-93, dl-pmtds-89, dl-msp-76, dmz-npldt-98, d-hdvdl-91, gh-dmcpd-92, gs-cdtp-78, gs-pmgsc-85, m-sitdg-93, ps-cgi-85, ZZZ"
, update =	"99.03 bibrelex, 97.11 bibrelex, 96.05 efrat"
}

@article{m-hbins-90
, author =	"D. J. Muder"
, title =	"How Big Is an {N}-Sided {Voronoi} Polygon"
, journal =	"Proceedings Of The London Mathematical Society"
, volume =	61
, month =	jul
, year =	1990
, pages =	"91--108"
, annote =	"If $a_n$ is area of the smallest VP defined by a point
		 set with closest distance 2 then $a_n/n$ tends to
		 $1/\pi$."
}

@article{m-snuls-87
, author =	"H. Mueller"
, title =	"Sorting numbers using limited systolic coprocessors"
, journal =	"IPL"
, volume =	"??"
, year =	1987
, pages =	"351--354"
, update =	"98.03 bibrelex"
}

@techreport{sfh-vchnt-95
, author =	"S. Mukherjee and J. D. Foley and S. E. Hudson"
, title =	"Visualizing Complex Hypermedia Networks Through Multiple Hierarchical Views"
, institution =	"Graphics and Visualization Center, GeorgiaTech"
, year =	1995
, keywords =	"graph drawing"
, update =	"96.09 tamassia, 96.04 garg"
}

@article{mah-olpcg-97
, author =	"A. Mukhopadhyay and A. Agrawal and R. M. Hosabettu"
, title =	"On the ordinary line problem in computational geometry"
, journal =	"Nordic J. Comput."
, volume =	4
, year =	1997
, pages =	"330--341"
, update =	"98.07 smid"
}

@inproceedings{mkb-caocp-93
, author =	"A. Mukhopadhyay and C. Kumar and B. Bhattacharya"
, title =	"Computing an area-optimal convex polygonal stabber of a set of parallel line segments"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"169--174"
, cites =	"ad-ahdsp-90, aw-plts-89, bcetsu-csts-91, emprww-sls-82, gpw-gtt-91, gs-spscp-90, hdk-cgp-64, jmb-oairs-92, o-olafs-81, ol-mcp-81, e-ftssg-85, lmr-mpsil-, sm-ssps-92, ZZZ"
, update =	"98.11 bibrelex, 95.01 smid, 93.09 milone+mitchell"
}

@article{m-eprcg-88
, author =	"C. M{\"u}ller"
, title =	"Equidecomposability of polyhedra with reference to crystallographic groups"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"383--389"
}

@article{mp-fitcp-78
, author =	"D. E. Muller and F. P. Preparata"
, title =	"Finding the intersection of two convex polyhedra"
, journal =	"Theoret. Comput. Sci."
, volume =	7
, year =	1978
, pages =	"217--236"
}

@inproceedings{m-bnpdb-90
, author =	"Heinrich M{\"u}ller"
, title =	"{Bestimmung} von {Nullstellen} von {Polynomgleichungssystemen} durch {Basistransformation}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	"18--19"
, update =	"00.03 bibrelex"
}

@inproceedings{m-ct-92
, author =	"Heinrich M{\"u}ller"
, title =	"Contour Triangulation"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"93--96"
, update =	"00.03 bibrelex"
}

@incollection{m-rpl-85
, author =	"H. M{\"u}ller"
, title =	"Rasterized point location"
, booktitle =	"Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, publisher =	"Trauner Verlag"
, address =	"Linz, Austria"
, year =	1985
, pages =	"281--293"
, update =	"97.03 schwarzkopf"
}

@techreport{m-rcsg-85
, author =	"H. M{\"u}ller"
, title =	"Raytracing complex scenes by grids"
, type =	"Report"
, number =	"??"
, institution =	"Inst. Inform., Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1985
}

@inproceedings{m-srsng-01
, author =	"Heinrich M{\"u}ller"
, title =	"Surface Reconstruction by Spatial Neighborhood Graphs"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"7--10"
, update =	"01.04 icking"
}

@inproceedings{m-tccar-88
, author =	"H. M{\"u}ller"
, title =	"Time coherence in computer animation by ray tracing"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"187--201"
, keywords =	"design of algorithms, computer graphics, rays, interval trees"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@inproceedings{mo-sasbb-91
, author =	"Heinrich M{\"u}ller and Matthias Otte"
, title =	"Solving algebraic systems in {Bernstein}-{B{\'e}zier} representation"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"161--169"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{ms-ib-89
, author =	"H. M{\"u}ller and M. Stark"
, title =	"{Implementierung} eines {Bildinterpolationsverfahrens}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{m-iscsh-00
, author =	"Matthias M{\"u}ller-Hannemann"
, title =	"Improving the Surface Cycle Structure for Hexahedral Mesh Generation"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"19--28"
, update =	"00.11 jones"
}

@inproceedings{mw-mscqc-97
, author =	"M. M{\"u}ller-Hannemann and K. Weihe"
, title =	"Minimum Strictly Convex Quadrangulations of Convex Polygons"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"193--202"
, cites =	"be-mgot-92i, elosu-scqp-92, gj-cigtn-79, h-femgm-88, j-qmgpr-95, l-dprcq-85, mmw-unfsm-95, nc-pgta-88, s-oadrp-82, st-ltadr-81, ta-femci-93, t-qps-95, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{mw-gfemg-93
, author =	"Matthias M{\"u}ller-Hannemann and Karsten Weihe"
, title =	"On the Generation of Finite Element Meshes with Graph Theoretical Methods"
, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
, month =	jun
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{m-pabst-93
, author =	"J.-D. M{\"u}ller"
, title =	"Proven angular bounds and stretched triangulations with the frontal {Delaunay} method"
, booktitle =	"Proc. 11th AIAA Comput. Fluid Dynamics Conf."
, site =	"Orlando"
, year =	1993
, update =	"98.03 bibrelex"
}

@techreport{mz-icha-94
, author =	"M. M{\"u}ller and J. Ziegler"
, title =	"An implementation of a convex hull algorithm"
, type =	"Report"
, number =	"MPI-I-94-105"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"94.05 smid"
}

@article{mkf-arbam-92
, author =	"S. M{\"u}ller and K. Kells and W. Fichtner"
, title =	"Automatic rectangle-based adaptive mesh generation without obtuse angles"
, journal =	"IEEE Trans. Comput.-Aided Design"
, volume =	10
, year =	1992
, pages =	"855--863"
, update =	"98.03 bibrelex"
}

@article{m-ssedh-85
, author =	"J. K. Mullin"
, title =	"Spiral storage: {E}fficient dynamic hashing with constant-performance"
, journal =	"Comput. J."
, volume =	28
, year =	1985
, pages =	"330--334"
, update =	"97.07 agarwal"
}

@article{ms-madss-72
, author =	"R. Mullin and R. Stanton"
, title =	"A map-theoretic approach to {Davenport--Schinzel} sequences"
, journal =	"Pacific J. Math."
, volume =	40
, year =	1972
, pages =	"167--172"
, update =	"95.09 agarwal"
}

@inproceedings{m-rodis-92
, author =	"D. Mullis"
, title =	"Reporting overlaps in a dynamic interval set by filtering search"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"160--169"
, cites =	"bl-oavdr-89, c-fsnaq-86, m-mdscg-84, ps-cgi-85, p-slpab-90, p-slc-89, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{m-fppa1-88
, author =	"K. Mulmuley"
, title =	"A fast planar partition algorithm, {I}"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"580--589"
, comments =	"To appear in J. Symbolic Logic"
, succeeds =	"m-fppap-88"
}

@article{m-fppa-90
, author =	"K. Mulmuley"
, title =	"A Fast Planar Partition Algorithm, {I}"
, journal =	"J. Symbolic Comput."
, volume =	10
, number =	"3-4"
, year =	1990
, pages =	"253--280"
, update =	"97.03 agarwal"
}

@inproceedings{m-fppa2-89
, author =	"K. Mulmuley"
, title =	"A fast planar partition algorithm, {II}"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"33--43"
, precedes =	"m-fppa2-91"
, cites =	"c-crmp-87, ce-oails-88, c-arscg-88, eka-nplai-84, egs-oplms-86, gs-ccrs-87, k-osps-83, lt-apst-77, m-fppa1-88, m-fppa2-91, m-eahsr-89, m-lavd-88, ps-cgi-85, st-pplup-86, sss-cthsa-74, ZZZ"
, update =	"98.03 bibrelex"
}

@article{m-fppa2-91
, author =	"K. Mulmuley"
, title =	"A fast planar partition algorithm, {II}"
, journal =	"J. ACM"
, volume =	38
, year =	1991
, pages =	"74--103"
, succeeds =	"m-fppa2-89"
}

@techreport{m-fppap-88
, author =	"K. Mulmuley"
, title =	"A fast planar partition algorithm: part {I}"
, type =	"Technical {Report}"
, number =	"88-007"
, institution =	"Dept. Comput. Sci., Univ. Chicago"
, address =	"Chicago, IL"
, year =	1988
, precedes =	"m-fppa1-88"
}

@inproceedings{m-gdsrs-91
, author =	"K. Mulmuley"
, title =	"A generalization of {Dehn}-{Sommerville} relations to simple stratified spaces"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"115--120"
, keywords =	"polytopes"
, precedes =	"m-gdsrs-93"
, cites =	"b-lfitm-62, gg-smts-73, gm-smt-87, g-cp-67, l-at-42, ms-cpubc-71, s-nfscp-80, ZZZ"
, update =	"97.11 bibrelex, 95.05 aronov"
}

@article{m-gdsrs-93
, author =	"Ketan Mulmuley"
, title =	"A Generalization of {Dehn}-{Sommerville} Relations to Simple Stratified Spaces"
, journal =	"??"
, volume =	9
, year =	1993
, pages =	"47--55"
, keywords =	"polytopes"
, update =	"95.05 aronov"
}

@article{m-eahsr-89
, author =	"K. Mulmuley"
, title =	"An efficient algorithm for hidden surface removal"
, journal =	"Comput. Graph."
, volume =	23
, number =	3
, month =	1989
, year =	1989
, pages =	"379--388"
, update =	"98.11 bibrelex"
}

@article{m-eahsr-90
, author =	"K. Mulmuley"
, title =	"An efficient algorithm for hidden surface removal, {II}"
, journal =	"J. Algorithms"
, volume =	"??"
, year =	1990
, note =	"To appear in special issue on FOCS 1990"
, update =	"97.11 bibrelex"
}

@book{m-cgitr-93
, author =	"K. Mulmuley"
, title =	"Computational Geometry: An Introduction Through Randomized Algorithms"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1993
, update =	"99.11 bibrelex, 96.05 pascucci, 95.09 schwarzkopf, 93.09 devillers, 93.05 orourke"
, annote =	"Graduate text"
}

@inproceedings{m-dsrub-93
, author =	"K. Mulmuley"
, title =	"Dehn-Sommerville relations, upper bound theorem, and levels in arrangements"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"240--246"
, cites =	"ag-nssfs-86, acegsw-ptphp-91, bfl-nhp-89, cp-hrsaa-86, c-blmat-92, cs-arscg-89, csy-khrp-87, es-vda-86, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-knnvd-82, m-mnfcp-70, mw-glbcs-71, m-osclv-90, m-lavd-91, pss-ubnpk-92, w-mksfs-86, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@inproceedings{m-hsrrm-91
, author =	"K. Mulmuley"
, title =	"Hidden surface removal with respect to a moving point"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"512--522"
, keywords =	"hidden line/surface elimination, probabilistic analysis"
}

@inproceedings{m-gafpc-94
, author =	"Ketan Mulmuley"
, title =	"On a Geometric Approach in Finite-Precision Complexity: a Lower Bound for Linear Programming"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	""
, update =	"94.01 jones"
}

@techreport{m-lavd-88
, author =	"K. Mulmuley"
, title =	"On levels in arrangements and {Voronoi} diagrams"
, number =	"TR 88-21"
, institution =	"University of Chicago"
, month =	dec
, year =	1988
, update =	"98.03 bibrelex"
}

@article{m-lavd-91
, author =	"K. Mulmuley"
, title =	"On levels in arrangements and {Voronoi} diagrams"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"307--338"
, succeeds =	"m-orfv-89"
}

@inproceedings{m-orfv-89
, author =	"K. Mulmuley"
, title =	"On obstructions in relation to a fixed viewpoint"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"592--597"
, precedes =	"m-lavd-91"
}

@inproceedings{m-osclv-90
, author =	"K. Mulmuley"
, title =	"Output sensitive construction of levels and {Voronoi} diagrams in {$\Re^d$} of order 1 to $k$"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"322--330"
}

@incollection{m-racg-00
, author =	"Ketan Mulmuley"
, title =	"Randomized Algorithms in Computational Geometry"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"703--724"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 16 of su-hcg-00"
}

@inproceedings{m-rgapr-92
, author =	"K. Mulmuley"
, title =	"Randomized geometric algorithms and pseudo-random generators"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"90--100"
}

@article{m-rgapg-96
, author =	"K. Mulmuley"
, title =	"Randomized geometric algorithms and pseudorandom generators"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"450--463"
, update =	"97.03 smid"
}

@inproceedings{m-rmstd-91
, author =	"K. Mulmuley"
, title =	"Randomized multidimensional search trees: {D}ynamic sampling"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"121--131"
, keywords =	"random sampling, dynamizing data structures"
, cites =	"agss-ltacv-87, as-rst-89, bt-rcdt-89, c-narsc-87, cs-arscg-89, cj-nrdpl-90, dmt-fddtl-91, fmn-dgds-85, gks-ricdv-89, hw-ensrq-87, m-fppa1-88, m-fppa2-89, m-eahsr-89, m-eahsr-90, m-lavd-91, ms-dplah-91, o-ddds-83, pt-fdplm-89, p-slpab-90, s-mapl-, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex, 96.05 agarwal"
}

@inproceedings{m-rmstf-91
, author =	"K. Mulmuley"
, title =	"Randomized multidimensional search trees: {F}urther results in dynamic sampling"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"216--227"
, update =	"96.05 agarwal"
}

@inproceedings{m-rmstl-91
, author =	"K. Mulmuley"
, title =	"Randomized multidimensional search trees: {L}azy balancing and dynamic shuffling"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"180--196"
, update =	"96.05 agarwal"
}

@incollection{ms-ra-97
, author =	"K. Mulmuley and O. Schwarzkopf"
, title =	"Randomized algorithms"
, chapter =	34
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"633--652"
, update =	"97.11 orourke"
}

@inproceedings{ms-dplah-91
, author =	"K. Mulmuley and S. Sen"
, title =	"Dynamic point location in arrangements of hyperplanes"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"132--141"
, keywords =	"arrangements, hyperplane, point location, dynamizing data structures"
, cites =	"as-rst-89, c-maeth-52, cf-dvrsi-88, c-narsc-87, cs-arscg-89, cj-nrdpl-90, dk-ladsc-85, eos-calha-86, fmn-dgds-85, hw-ensrq-87, m-rmstd-91, o-ddds-83, pt-fdplm-89, p-slpab-90, rs-orpac-87, st-pplup-86, ZZZ"
, update =	"97.11 bibrelex"
}

@article{ms-dplah-92
, author =	"K. Mulmuley and S. Sen"
, title =	"Dynamic point location in arrangements of hyperplanes"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"335--360"
, update =	"98.07 agarwal"
}

@inproceedings{m-prsd-87
, author =	"D. Mumford"
, title =	"The problem of robust shape descriptors"
, booktitle =	"Proc. 1st. Internat. Conf. Comput. Vision"
, year =	1987
, pages =	"602--606"
, update =	"97.11 bibrelex"
}

@book{m-eat-84
, author =	"J. R. Munkers"
, title =	"Elements of algebraic topology"
, publisher =	"Addison-Wesley"
, address =	"Redwood City, California"
, year =	1984
, update =	"98.11 bibrelex, 93.09 matousek"
}

@book{m-tfc-75
, author =	"J. R. Munkres"
, title =	"Topology: {A} first course"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1975
, update =	"98.03 bibrelex"
}

@inproceedings{m-msp-79
, author =	"J. I. Munro"
, title =	"A multikey search problem"
, booktitle =	"Proc. 17th Allerton Conf. Commun. Control Comput."
, year =	1979
, pages =	"241--244"
}

@inproceedings{mow-vv-87
, author =	"J. I. Munro and M. H. Overmars and D. Wood"
, title =	"Variations on visibility"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"291--299"
, precedes =	"ow-rv-88"
, cites =	"afk-sppsb-85, bw-owcar-80, e-ndrs-81, gjs-agcpc-76, k-mchco-86, m-mdscg-84, ps-cgi-85, rw-roc-86, wl-arrcd-85, w-ivcg-85, ZZZ"
, update =	"98.03 bibrelex, 93.09 milone+mitchell"
}

@article{ms-idsfs-80
, author =	"J. I. Munro and H. Suwanda"
, title =	"Implicit data structure for fast search and update"
, journal =	"J. Comput. Syst. Sci."
, volume =	"??"
, year =	1980
, pages =	"236--250"
, update =	"97.11 bibrelex"
}

@techreport{m-ecple-71
, author =	"J. H. Munson"
, title =	"Efficient calculations on points and lines in the {Euclidean} plane"
, month =	oct
, year =	1971
, update =	"93.09 milone+mitchell"
}

@inproceedings{mf-csbra-97
, author =	"T. M. Murali and Thomas A. Funkhouser"
, title =	"Consistent Solid and Boundary Representations from Arbitrary Polygonal Data"
, booktitle =	"Proc. 1997 Sympos. Interactive 3D Graphics"
, year =	1997
, update =	"97.07 agarwal"
}

@article{mbbm-cbmrc-
, author =	"P. Murdoch and S. Benzley and T. D. Blacker and S. A. Mitchell"
, title =	"A connectivity based method for representing and constructing all-hexahedral finite element meshes, {Part} {I}: {The} spatial twist continuum"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	"??"
, year =	"??"
, note =	"Submitted"
, update =	"98.03 bibrelex"
}

@inproceedings{mb-stc-95
, author =	"Pete Murdoch and Steven E. Benzley"
, title =	"The Spatial Twist Continuum"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"243--252"
, update =	"96.01 samitchell"
}

@techreport{m-ppmp-85
, author =	"F. Murgola"
, title =	"Probabilistic point matching in the plane"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Math. Comput. Sci., Univ. California Riverside"
, address =	"Riverside, CA"
, year =	1985
}

@book{m-odes-60
, author =	"G. M. Murphy"
, title =	"Ordinary Differential Equations and Their Solutions"
, publisher =	"D. van Nostrand"
, address =	"Princeton"
, year =	1960
, update =	"98.11 bibrelex"
}

@inproceedings{mmg-ppscd-00
, author =	"Michael Murphy and David M. Mount and Carl W. Gable"
, title =	"A point-placement strategy for conforming {Delaunay} tetrahedralization"
, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA"
, year =	2000
, pages =	"67--74"
, update =	"01.07 devillers"
}

@inproceedings{ms-rtnns-93
, author =	"M. Murphy and Steven S. Skiena"
, title =	"Ranger: {A} tool for nearest neighbor search in high dimensions"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"403--404"
, keywords =	"video review"
, cites =	"b-mbstu-75, b-kdtsp-90, fbf-afbml-77, s-rnns-91, y-dsann-93, ZZZ"
, update =	"98.03 bibrelex+mitchell, 96.05 agarwal, 93.09 jones"
}

@article{ms-fnnvt-90
, author =	"O. J. Murphy and S. M. Selkow"
, title =	"Finding Nearest Neighbors With {Voronoi} Tessellations"
, journal =	"Inform. Process. Lett."
, volume =	34
, number =	1
, month =	feb
, year =	1990
, pages =	"37--41"
, keywords =	"nearest neighbors, Voronoi tessellations, multi key searching"
, annote =	"Use buckets containing a list of points whose VPs
		 intersect the bucket."
, abstract =	"J. L. Bentley et al. have shown that, subject to
		 certain assumptions, nearest neighbors in k-dimensional
		 space can be computed in O(3**k) expected time. This
		 paper presents a new method for finding nearest
		 neighbors in any bounded region. The algorithm employs
		 the Voronoi tessellation to allow nearest neighbor
		 retrievals to be performed in expected constant time
		 which is independent of the dimension. Under the
		 assumption that the points in the file are uniformly
		 distributed, it is shown that as the amount of storage
		 is increased, the expected number of records examined
		 will approach 1. (Author abstract) 7 Refs."
}

@book{mls-mirm-94
, author =	"Richard M. Murray and Zexiang Li and S. Shankar Sastry"
, title =	"A Mathematical Introduction to Robotic Manipulation"
, publisher =	"CRC Press"
, year =	1994
, location =	"Boca Raton"
, update =	"02.03 orourke"
}

@article{m-etcrh-83
, author =	"Murtagh"
, title =	"Expected-time complexity results for hierarchic clustering algorithms which use cluster centers"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, update =	"97.11 bibrelex"
}

@techreport{m-srahc-??
, author =	"F. Murtagh"
, title =	"A survey of recent advances in hierarchical clustering algorithms"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Univ. College Dublin"
, address =	"Dublin, Ireland"
, year =	"??"
}

@article{mks-siodt-94
, author =	"S. K. Murthy and S. Kasif and S. Salzberg"
, title =	"A System for Induction of Oblique Decision Trees"
, journal =	"Journal of Artificial Intelligence Research"
, volume =	2
, year =	1994
, pages =	"1--33"
, update =	"95.05 agarwal"
}

@book{m-lcp-76
, author =	"K. Murty"
, title =	"Linear and Combinatorial Programming"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1976
, update =	"97.03 gaertner+salinger"
}

@article{m-gap-73
, author =	"K. Murty"
, title =	"The graph of an abstract polytope"
, journal =	"Math. Program."
, volume =	4
, year =	1973
, pages =	"336--346"
, update =	"97.03 gaertner+salinger"
}

@article{m-ccplp-80
, author =	"Katta G. Murty"
, title =	"Computational complexity of parametric linear programming"
, journal =	"Math. Program."
, volume =	19
, year =	1980
, pages =	"213--219"
, update =	"97.11 bibrelex"
}

@inproceedings{m-pdt-97
, author =	"O. Musin"
, title =	"Properties of the {Delaunay} Triangulation"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"424--426"
, cites =	"ds-oiti-89, d-otmgc-91, b-kuk-16, j-ctddt-91, l-scsi-77, l-pndt-86, m-dto-93, m-ihdt-95, m-fvtp-97, r-odtr-91, r-mrpdt-90, s-let-78, v-nadpc-08, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@incollection{m-cvdsp-98
, author =	"O. R. Musin"
, title =	"Construction of the {Voronoi} diagram and secondary polytope"
, editor =	"P. Engel and H. Syta"
, booktitle =	"Voronoi's Impact on Modern Science, Book 2"
, publisher =	"Institute of Mathematics of the National Academy of Sciences of Ukraine"
, address =	"Kyiv"
, year =	1998
, pages =	"105--114"
, update =	"00.11 smid"
}

@inproceedings{m-dto-93
, author =	"O. R. Musin"
, title =	"Delaunay triangulation and optimality"
, booktitle =	"ARO Workshop Comp. Geom."
, site =	"Raleigh, NC"
, year =	1993
, pages =	"37--38"
, update =	"98.07 bibrelex"
}

@article{m-eatmp-92
, author =	"O. R. Musin"
, title =	"Efficient algorithms for testing membership of a point in polygons and polyhedra"
, journal =	"Programming and computer software"
, volume =	17
, number =	4
, publisher =	"Plenum Publishing Corporation"
, year =	1992
, pages =	"228--235"
, keywords =	"design of algorithms, detecting, point location, polygons, polyhedra, two-dimensional, three-dimensional"
, comments =	"translation from Russian: Programmirovanie, 1991, No. 4, pp. 72--81"
, update =	"96.09 devillers, 95.01 korneenko"
}

@article{m-fvtp-97
, author =	"O. R. Musin"
, title =	"Four-vertex theorem for polygon"
, journal =	"Kvant"
, volume =	"??"
, year =	1997
, note =	"In Russian"
, update =	"98.07 bibrelex"
}

@article{m-ihdt-95
, author =	"O. R. Musin"
, title =	"Index of harmony and {Delaunay} triangulation"
, journal =	"Symmetry: Culture and Science"
, volume =	6
, number =	3
, year =	1995
, pages =	"389--392"
, update =	"98.07 bibrelex"
}

@incollection{m-spcgt-92
, author =	"O. R. Musin"
, title =	"On some problems of computational geometry and topology"
, booktitle =	"??"
, series =	"Lecture Notes Math."
, volume =	1520
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"58--80"
, keywords =	"computational topology, geometric modelling, partition of unity, manifold embedding, curve fitting, surface fitting, terrain fitting, vector field, piecewise-linear vector field, singular point, separatrix, talweg, watershed, index of vector field, piecewise-linear manifold, distance, distance function, shortest path"
, 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
   rotation for singular point and separatrix search; distance
   functions and shortest paths on metric spaces."
}

@inproceedings{m-amcmh-97
, author =	"Petra Mutzel"
, title =	"An Alternative Method to Crossing Minimization on Hierarchical Graphs"
, editor =	"Stephen North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"318--333"
, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
}

@inproceedings{mw-tlpgd-98
, author =	"P. Mutzel and R. Weiskircher"
, title =	"Two-Layer Planarization in Graph Drawing"
, editor =	"K.-Y. Chwa and O. H. Ibarra"
, booktitle =	"Algorithms and Computation"
, nickname =	"ISAAC '98"
, series =	"Lecture Notes Comput. Sci."
, volume =	1533
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"69--78"
, update =	"00.03 vismara"
}

@article{m-ceicw-86
, author =	"B. Myers"
, title =	"A complete and efficient implementation of covered windows"
, journal =	"Computer"
, volume =	19
, month =	sep
, year =	1986
, pages =	"57--69"
, update =	"98.03 bibrelex"
}

@article{mhc-sdhci-96
, author =	"Brad Myers and Jim Hollan and Isabel Cruz and others"
, title =	"Strategic Directions in Human Computer Interaction"
, journal =	"ACM Comput. Surv."
, volume =	28
, number =	4
, year =	1996
, url =	"http://www.cs.cmu.edu/~bam/nsfworkshop/hcireport.html"
, update =	"97.03 tamassia"
}

@article{m-oetap-85
, author =	"E. W. Myers"
, title =	"An {$O(E \log E+I)$} expected time algorithm for the planar segment intersection problem"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"625--637"
}

@article{mok-fcdbc-95
, author =	"K. Myszkowski and O. G. Okunev and T. L. Kunii"
, title =	"Fast Collision Detection Between Complex Solids Using Rasterizing Graphics Hardware"
, journal =	"Visual Comput."
, volume =	11
, number =	9
, year =	1995
, pages =	"497--511"
, update =	"96.01 held+mitchell"
}

@article{nhl-merp-84
, author =	"A. Naamad and W.-L. Hsu and D. T. Lee"
, title =	"On the maximum empty rectangle problem"
, journal =	"Discrete Appl. Math."
, volume =	8
, year =	1984
, pages =	"267--277"
}

@article{n-crtds-82
, author =	"L. R. Nackman"
, title =	"Curvature relations in three-dimensional symmetric axes"
, journal =	"Comput. Graph. Image Process."
, volume =	20
, year =	1982
, pages =	"43--57"
}

@article{n-tdcpc-84
, author =	"L. R. Nackman"
, title =	"Two-dimensional critical point configuration graphs"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-1"
, year =	1984
, pages =	"442--450"
}

@article{np-tdsdu-85
, author =	"L. R. Nackman and S. M. Pizer"
, title =	"Three-dimensional shape description using the symmetric axis transform {I}: {T}heory"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-7"
, year =	1985
, pages =	"187--202"
, keywords =	"symmetric"
, update =	"96.05 agarwal"
}

@article{ns-blss-91
, author =	"L. R. Nackman and V. Srinivasan"
, title =	"Bisectors of linearly separable sets"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"263--275"
}

@inproceedings{ns-ppdtp-91
, author =	"L. R. Nackman and V. Srinivasan"
, title =	"Point placement for {Delaunay} triangulation of polygonal domains"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"37--40"
, cites =	"beg-pgmg-90, bfl-rsddt-88i, b-srpcs-88, b-ls-79, c-cdt-89, dfp-dbrsd-85, gs-pmgsc-85, ll-gdtpg-86, sp-dtasp-91, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{nk-itpsp-85
, author =	"S. Nagashima and F. Kimura"
, title =	"An inside test for polyhedron by spherical projection and its application"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Graph., College Arts Sci., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1985
}

% ### others?
@inproceedings{no-itpp-88
, author =	"S. Nagashima and others"
, title =	"Inclusion Tests for Polygons and Polyhedra"
, editor =	"S. M. Slaby and H. Stachel"
, booktitle =	"Proc. 3rd Internat. Conf. Engineering Graphics and Descriptive Geometry"
, site =	"TU Wien, Austria"
, month =	jul
, year =	1988
, pages =	"II:60--63"
, update =	"93.09 held"
}

@inproceedings{n-acs-80
, author =	"L. W. Nagel"
, title =	"ADVICE for circuit simulation"
, booktitle =	"Proc. ISCAS"
, site =	"Houston, Texas"
, year =	1980
, update =	"98.03 bibrelex"
}

@inproceedings{nz-dsgrg-79
, author =	"M. Nagl and H. Zischler"
, title =	"A Dialog System for the Graphical Representation of Graphs"
, booktitle =	"Proc. Workshop WG '78 on Graph Theoretic Concepts in Computer Science"
, series =	"Applied Computer Science"
, volume =	13
, year =	1979
, pages =	"325--339"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{sn-sp3763-39
, author =	"B. de Sz. Nagy"
, title =	"Solution to Problem 3763"
, journal =	"Amer. Math. Monthly"
, volume =	46
, year =	1939
, pages =	"176--177"
, comments =	"See e-p3763-35."
, update =	"98.11 orourke"
, annote =	"Flipping polygon pockets."
}

@inproceedings{n-acg-78
, author =	"G. Nagy"
, title =	"Advances in computational geometry"
, booktitle =	"Proc. 21st Midwest Sympos. Circuits Systems"
, site =	"Ames, IA"
, year =	1978
, pages =	"598--603"
}

@article{n-sapr-68
, author =	"G. Nagy"
, title =	"State of the art in pattern recognition"
, journal =	"Proc. IEEE"
, volume =	56
, year =	1968
, pages =	"836--860"
, update =	"98.07 bibrelex"
}

@techreport{n-tv-82
, author =	"G. Nagy"
, title =	"Terrain visibility"
, type =	"Technical {Report}"
, institution =	"Rensselaer Polytech. Inst."
, address =	"Troy, NY"
, year =	1982
, keywords =	"Digital elevation models, geometric visibility, hidden-surface algorithms, topography"
, update =	"93.09 milone+mitchell"
}

@article{ns-fapd-88
, author =	"S. Nahar and Sahni"
, title =	"Fast algorithm for polygon decomposition"
, journal =	"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"
, volume =	"??"
, year =	1988
, pages =	"473--483"
, update =	"98.03 bibrelex"
}

@inproceedings{nm-lledt-90
, author =	"S. N{\"a}her and K. Mehlhorn"
, title =	"{LEDA}: {A} Library of Efficient Data Types and Algorithms"
, booktitle =	"Proc. Internat. Colloq. Automata Lang. Program."
, year =	1990
, pages =	"1--5"
, update =	"98.11 smid, 95.05 agarwal"
}

@manual{nu-lmum-95
, author =	"S. N{\"a}her and C. Uhrig"
, title =	"The {LEDA} Manual User Manual"
, year =	1995
, update =	"97.11 bibrelex"
}

@article{nw-ipseb-97
, author =	"D. Naiman and H. Wynn"
, title =	"On intersecting a point set with {Euclidean} balls"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"237--244"
, update =	"97.07 devillers"
}

@article{nw-iebii-92
, author =	"D. Q. Naiman and H. P. Wynn"
, title =	"Inclusion-exclusion {Bonferroni} identities and inequalities for discrete tubelike problems via {Euler} characteristics"
, journal =	"Ann. Statist."
, volume =	20
, year =	1992
, pages =	"43--76"
, update =	"98.03 bibrelex"
}

@article{n-avsir-87
, author =	"S. Naito"
, title =	"Applications of Visual Sensors to Industrial Robots"
, journal =	"Sensor Technology"
, volume =	7
, year =	1987
, pages =	"90--93"
, update =	"98.03 bibrelex"
}

@phdthesis{n-adccg-78
, author =	"I. Najfeld"
, title =	"Analytic design of compensators and computational geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Brown Univ."
, address =	"Providence, RI"
, year =	1978
, keywords =	"doctoral thesis"
}

@article{nb-o3dhl-95
, author =	"M. A. Najork and M. H. Brown"
, title =	"Obliq-$3${D}: {A} high-level, fast-turnaround $3$d animation system"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	1
, number =	2
, year =	1995
, pages =	"175--192"
, update =	"98.07 bibrelex"
}

@inproceedings{nh-aplpg-84
, author =	"M. Nakajima and K. Hayashi"
, title =	"Automated Parts Layout Planning in Garment Industry By Using Group Technology"
, booktitle =	"Computers in the World of Textiles"
, year =	1984
, pages =	"297--310"
, note =	"Textile Institute Annual World Conference"
, update =	"98.07 bibrelex"
}

@techreport{nost-dgsmw-85
, author =	"N. Nakajima and Y. Ohta and S. Shinotuka and S. Tokumasu"
, title =	"Direct generation of solid model from wire-frame model"
, type =	"Manuscript"
, institution =	"??"
, year =	1985
}

@article{na-dc-84
, author =	"A. Nakamura and K. Aizawa"
, title =	"Digital circles"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	26
, year =	1984
, pages =	"42--255"
, update =	"98.07 bibrelex"
}

@article{na-digp-85
, author =	"A. Nakamura and K. Aizawa"
, title =	"Digital images of geometric pictures"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	30
, year =	1985
, pages =	"107--120"
, update =	"98.07 bibrelex"
}

@article{na-ds-90
, author =	"A. Nakamura and K. Aizawa"
, title =	"Digital squares"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	49
, year =	1990
, pages =	"357--368"
, update =	"98.07 bibrelex"
}

@inproceedings{nfstk-vpecs-86
, author =	"K. Nakamura and H. Fujimoto and T. Suzuki and Y. Tarui and Y. Kiyokane"
, title =	"Visual Programming Environment in Communications Software"
, booktitle =	"Proc. 5th IEEE Global Telecom Conference"
, year =	1986
, pages =	"435--439"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{nm-nppa-89
, author =	"Y. Nakamura and R. Mukherjee"
, title =	"Nonholonomic path planning and automation"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1989
, pages =	"1050--1055"
, update =	"97.11 bibrelex"
}

@inproceedings{n-hsnmt-95
, author =	"Tran Quoc Nam"
, title =	"A Hybrid Symbolic-Numerical Method for Tracing Curves and Surface Intersections"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"79--82"
, update =	"00.03 bibrelex"
}

@unpublished{nf-u3dcp-93
, author =	"M. Namiki and K. Fukuda"
, title =	"Unfolding 3-dimensional convex polytopes: {A} package for {Mathematica} 1.2 or 2.0"
, year =	1993
, note =	"Mathematica Notebook, Univ. of Tokyo"
, update =	"98.11 orourke, 97.11 orourke"
}

@inproceedings{nmb-slp-96
, author =	"S. C. Nandy and K. Mukhopadhyaya and Bhargab B. Bhattacharya"
, title =	"Shooter location problem"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"93--98"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{nwm-dkssp-90
, author =	"P. Nanua and K. J. Waldron and V. Murthy"
, title =	"Direct kinematic solution of a stewart platform"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, number =	4
, year =	1990
, pages =	"438--444"
, update =	"98.07 bibrelex"
}

@inproceedings{ns-cpcps-90
, author =	"N. Naor and M. Sharir"
, title =	"Computing a point in the center of a point set in three dimensions"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"10--13"
, cites =	"aks-osn-83, c-pms-86, c-sdsno-87, csy-khrp-87, eos-calha-86, m-apcad-83, ns-fpcng-, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@techreport{ns-fpcng-
, author =	"N. Naor and M. Sharir"
, title =	"On finding a point in the center of $n$ given points in three dimensional space"
, institution =	"??"
, year =	"??"
, note =	"In preparation"
, update =	"98.07 bibrelex"
}

@inproceedings{n-ohtsp-97
, author =	"G. Narasimhan"
, title =	"On {Hamiltonian} triangulations in simple polygons"
, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
, nickname =	"WADS '97"
, site =	"Halifax, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	1272
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"321--330"
, update =	"99.07 bibrelex, 98.07 smid"
}

@article{n-htsp-99
, author =	"G. Narasimhan"
, title =	"On {Hamiltonian} Triangulations in Simple Polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, number =	3
, month =	jun
, year =	1999
, pages =	"261--275"
, update =	"99.07 held+smid"
}

@techreport{ns-asfeg-99
, author =	"G. Narasimhan and M. Smid"
, title =	"Approximating the stretch factor of {Euclidean} graphs"
, type =	"Report"
, number =	16
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1999
, update =	"99.07 smid"
}

@article{ns-asfeg-00
, author =	"G. Narasimhan and M. Smid"
, title =	"Approximating the stretch factor of {Euclidean} graphs"
, journal =	"SIAM J. Comput."
, volume =	30
, year =	2000
, pages =	"978--989"
, update =	"00.11 smid"
}

@techreport{ns-asfep-99
, author =	"G. Narasimhan and M. Smid"
, title =	"Approximating the stretch factor of {Euclidean} paths, cycles and trees"
, type =	"Report"
, number =	9
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1999
, update =	"99.07 smid"
}

@techreport{ns-aabsf-00
, author =	"G. Narasimhan and M. Smid"
, title =	"Approximation algorithms for the bottleneck stretch factor problem"
, type =	"Report"
, number =	13
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	2000
, update =	"00.11 smid"
}

@inproceedings{ns-aabsf-01
, author =	"G. Narasimhan and M. Smid"
, title =	"Approximation algorithms for the bottleneck stretch factor problem"
, booktitle =	"Proc. 18th Sympos. Theoret. Aspects Comput. Sci."
, nickname =	"STACS '01"
, series =	"Lecture Notes Comput. Sci."
, volume =	2010
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"502--513"
, update =	"01.04 smid"
}

@inproceedings{nzz-ecgms-00
, author =	"G. Narasimhan and J. Zhu and M. Zachariasen"
, title =	"Experiments with computing geometric minimum spanning trees"
, booktitle =	"Proc. 2nd Workshop Algorithm Eng. Exper."
, nickname =	"ALENEX '00"
, year =	2000
, pages =	"183--196"
, update =	"01.11 smid"
}

@phdthesis{n-rpoca-88
, author =	"L. S. Narasimhan"
, title =	"Recognition of Polyhedral Objects: {Concepts} and Algorithms"
, school =	"The University of Texas"
, address =	"Dallas, Texas"
, year =	1988
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{nsv-rpamu-92
, author =	"H. Narayanan and H. Saran and V. V. Vazirani"
, title =	"Randomized parallel algorithms for matroid union and intersection, with applications to arborescences, and edge-disjoint spanning trees"
, booktitle =	"Proc. 3rd ACM Sympos. Discr. Alg."
, year =	1992
, update =	"98.11 bibrelex"
}

@article{n-ppca-96
, author =	"C. Narayanaswami"
, title =	"A Parallel Polygon-Clipping Algorithm"
, journal =	"Visual Comput."
, volume =	12
, number =	3
, year =	1996
, pages =	"147--158"
, update =	"96.09 held"
}

@phdthesis{n-ppga-91
, author =	"Chandrasekhar Narayanaswami"
, title =	"Parallel Processing for Geometric Applications"
, school =	"Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
, year =	1991
, note =	"UMI no. 92-02201"
, keywords =	"doctoral thesis, area, parallel computation, grids"
, update =	"93.09 franklin"
}

@article{nf-dmppc-91a
, author =	"C. Narayanaswami and W. R. Franklin"
, title =	"Determination of mass properties of polygonal {CSG} objects in parallel"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	4
, year =	1991
, pages =	"381--403"
, keywords =	"parallel computation, intersection, constructive solid geometry, area, grids"
, succeeds =	"nf-dmppc-91i"
, update =	"97.11 bibrelex, 93.09 franklin"
}

@inproceedings{nf-bcpp-92
, author =	"Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
, title =	"Boolean Combinations of Polygons in Parallel"
, booktitle =	"Proc. 1992 Internat. Conf. Parallel Process."
, volume =	""
, month =	aug
, year =	1992
, pages =	""
, keywords =	"parallel computation, grids, intersection, CAD"
, update =	"93.09 franklin"
}

@inproceedings{nf-dmppc-91i
, author =	"Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
, title =	"Determination of Mass Properties of Polygonal {CSG} Objects in Parallel"
, editor =	"Joshua Turner"
, booktitle =	"Proc. Symposium on Solid Modeling Foundations and CAD/CAM Applications"
, organization =	"ACM/SIGGRAPH"
, month =	jun
, year =	1991
, pages =	"279--?"
, keywords =	"parallel computation, intersection, grids, constructive solid geometry, area"
, precedes =	"nf-dmppc-91a"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@article{nf-eihc-92
, author =	"Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
, title =	"Edge Intersection on the {Hypercube} Computer"
, journal =	"Inform. Process. Lett."
, volume =	41
, number =	5
, month =	apr
, year =	1992
, pages =	"257--262"
, keywords =	"parallel algorithms, performance evaluation, intersection, grids"
, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
}

@techreport{nt-fapsd-84
, author =	"E. Nardelli and M. Talamo"
, title =	"A Fast Algorithm for Planarization of Sparse Diagrams"
, number =	"R.105"
, institution =	"IASI-CNR, Rome"
, year =	1984
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@incollection{nm-fptbs-95
, author =	"A. Narkhede and D. Manocha"
, title =	"Fast Polygon Triangulation Based on Seidel's Algorithm"
, editor =	"A. W. Paeth"
, booktitle =	"Graphics Gems V"
, publisher =	"Academic Press"
, year =	1995
, pages =	"394--397"
, note =	"ISBN 0-12-543455-3"
, update =	"97.11 held"
}

@book{n-nt-83
, author =	"W. Narkiewicz"
, title =	"Number Theory"
, edition =	"2nd"
, publisher =	"World Scientific"
, year =	1983
, update =	"97.11 bibrelex"
}

@techreport{nddd-padwm-94
, author =	"J. M. Nash and P. M. Dew and M. E. Dyer and J. R. Davy"
, title =	"Parallel Algorithm Design on the {WPRAM} Model"
, type =	"Technical {Report}"
, number =	"94.24"
, institution =	"School of Computer Science, Univeristy of Leeds"
, year =	1994
, update =	"96.09 orourke"
}

@article{n-edstf-61
, author =	"C. St. J. A. {Nash-Williams}"
, title =	"Edge-disjoint spanning trees of finite graphs"
, journal =	"J. London Math. Soc."
, volume =	36
, year =	1961
, pages =	"445--450"
, update =	"98.11 bibrelex"
}

@article{n-psmff-85
, author =	"A. H. Nasri"
, title =	"Polyhedral subdivision methods for free-form surfaces"
, journal =	"ACM Trans. Graph."
, volume =	6
, year =	1985
, pages =	"29--73"
}

@article{ns-dbsc-81
, author =	"D. Nassimi and S. Sahni"
, title =	"Data Broadcasting in SIMD Computers"
, journal =	"IEEE Trans. on Compu."
, volume =	"c-30"
, number =	2
, year =	1981
, pages =	"101--106"
, update =	"98.07 bibrelex"
}

@article{ns-fccco-80
, author =	"D. Nassimi and S. Sahni"
, title =	"Finding connected components and connected ones on a mesh-connected parallel computer"
, journal =	"SIAM J. Comput."
, volume =	9
, year =	1980
, pages =	"744--757"
, update =	"97.11 bibrelex"
}

@article{ns-ppsan-82
, author =	"D. Nassimi and S. Sahni"
, title =	"Parallel permutation and sorting algorithms and a new generalized connection network"
, journal =	"J. ACM"
, volume =	29
, number =	3
, year =	1982
, pages =	"642--667"
, update =	"96.09 orourke"
}

@inproceedings{n-aaadp-86
, author =	"B. K. Natarajan"
, title =	"An Algorithmic Approach to the Automated Design of Parts Orienters"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, publisher =	"IEEE Computer Society"
, year =	1986
, pages =	"132--142"
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@article{n-aa-89
, author =	"B. K. Natarajan"
, title =	"An analysis of assembly"
, journal =	"Visual Comput."
, volume =	5
, number =	5
, month =	oct
, year =	1989
, pages =	"316--323"
, keywords =	"assembly of composite subjects, classes, sequence of motions"
}

@techreport{n-ccpwl-91
, author =	"B. K. Natarajan"
, title =	"On comparing and compressing piece-wise linear curves"
, institution =	"Hewlett Packard"
, year =	1991
}

@inproceedings{n-cibs-90
, author =	"B. K. Natarajan"
, title =	"On computing the intersection of {B}-splines"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"157--167"
, cites =	"bhlh-tsi-88, bfjp-ssi-87, bbb-isucg-87, b-pgs-78, clr-dbsst-80, d-fibsr-85, fmm-saubd-86, ks-gictr-??, lr-bp-81, s-sfbt-81, w-smfib-84, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{n-dopp-87
, author =	"B. K. Natarajan"
, title =	"On detecting the orientation of polygons and polyhedra"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"146--152"
, cites =	"b-dscns-84, cy-sp-83, dey-pcp-86, em-esm-86, n-aaadp-86, ZZZ"
, update =	"98.03 bibrelex"
}

@phdthesis{n-moo-86
, author =	"B. K. Natarajan"
, title =	"On Moving and Orienting Objects"
, type =	"Technical {Report}"
, school =	"Dept. Computer Science, Cornell University"
, year =	1986
, note =	"86-775"
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@techreport{n-pwlac-91
, author =	"B. K. Natarajan"
, title =	"On piece-wise linear approximations to curves"
, type =	"Technical Report"
, number =	"HPL-91-36"
, institution =	"Hewlett Packard Labs"
, address =	"Palo Alto, CA"
, year =	1991
, update =	"00.11 smid, 00.07 smid, 98.07 bibrelex"
}

@inproceedings{n-oplac-91
, author =	"B. K. Natarajan"
, title =	"On piecewise linear approximations to curves"
, booktitle =	"SIAM Conference on Geometric Design"
, year =	1991
, update =	"98.07 bibrelex"
}

@inproceedings{n-pa-88
, author =	"B. K. Natarajan"
, title =	"On planning assemblies"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"299--308"
, cites =	"c-crsdr-85, d-rbwdo-84, gy-tsr-80, hss-cmpmi-84, lw-aapsc-77, o-ar-85, r-ra-85, r-cmpg-79, te-stmpl-84, ts-snrmp-83, ZZZ"
, update =	"98.03 bibrelex"
}

@article{n-spadp-89
, author =	"B. K. Natarajan"
, title =	"Some paradigms for the automated design of parts feeders"
, journal =	"Internat. J. Robot. Res."
, volume =	8
, number =	6
, month =	dec
, year =	1989
, pages =	"98--109"
, update =	"98.07 bibrelex"
}

@inproceedings{nr-sacf-92
, author =	"B. K. Natarajan and J. Ruppert"
, title =	"On sparse approximations of curves and functions"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"250--256"
, cites =	"abgw-acp-90, ag-mrpc-92, ii-oaapl-86a, ii-cgmpa-86, g-nmccd-91, ghms-apsml-91, mo-pca-88, ms-saps-92, t-capcp-85, in-pladc-91, ii-cgmpa-86, ishs-spadc-83, lm-krpbc-87, n-pwlac-91, n-oplac-91, nh-dp-88, n-asf-89, r-iaf-69, r-licab-90, s-ldpsp-88, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{nmb-pacht-81
, author =	"D. Nath and S. N. Maheshwari and P. C. P. Bhatt"
, title =	"Parallel Algorithms for the Convex Hull in Two Dimensions"
, number =	"EE 8005"
, institution =	"Indian Inst. Technology"
, address =	"New Delhi, India"
, year =	1981
, pages =	"358--372"
, update =	"97.11 bibrelex, 93.09 held"
}

@techreport{nmb-pachp-80
, author =	"D. Nath and S. N. Maheshwari and P. C. P. Bhatt"
, title =	"Parallel algorithms for the convex hull problem in two dimensions"
, type =	"Report"
, number =	"EE 8005"
, institution =	"Indian Inst. Tech."
, address =	"New Delhi, India"
, year =	1980
}

@article{n-crp2d-66
, author =	"J. I. Naus"
, title =	"Clustering of random points in $2$ dimensions"
, journal =	"Biometrika"
, volume =	52
, year =	1966
, pages =	"263--267"
}

@inproceedings{n-cgpt-93
, author =	"B. Naylor"
, title =	"Constructing good partitioning trees"
, booktitle =	"Proc. Graphics Interface '93"
, site =	"Toronto, ON"
, year =	1993
, pages =	"181--191"
, update =	"96.05 pascucci"
}

@article{nat-mbtyp-90
, author =	"B. Naylor and J. A. Amanatides and W. Thibault"
, title =	"Merging {BSP} trees yields polyhedral set operations"
, journal =	"Comput. Graph."
, volume =	24
, number =	4
, month =	aug
, year =	1990
, pages =	"115--124"
, note =	"Proc. SIGGRAPH '90"
, update =	"96.05 pascucci, 93.09 milone+mitchell"
}

@techreport{nt-abtrt-86
, author =	"Bruce Naylor and William Thibault"
, title =	"Application of {BSP} Trees to Ray-Tracing and {CSG} Evaluation"
, type =	"Technical Report"
, number =	"GIT-ICS 86/03"
, institution =	"Georgia Institute of Tech., School of Information and Computer Science"
, month =	feb
, year =	1986
, keywords =	"hierarchies"
, update =	"97.07 agarwal"
}

@unpublished{n-cgpt-
, author =	"Bruce F. Naylor"
, title =	"Constructing Good Partitioning Trees"
, institution =	"AT\& T Bell Laboratories"
, year =	"??"
, note =	"Manuscript"
, update =	"95.01 mitchell"
}

@inproceedings{n-isgpt-92
, author =	"Bruce F. Naylor"
, title =	"Interactive solid geometry via partitioning trees"
, booktitle =	"Proc. Graphics Interface '92"
, year =	1992
, pages =	"11--18"
, update =	"97.07 agarwal"
}

@unpublished{n-ptirg-
, author =	"Bruce F. Naylor"
, title =	"Partitioning Tree Image Representation and Generation from 3D Geometric Models"
, institution =	"AT\& T Bell Laboratories"
, year =	"??"
, note =	"Manuscript"
, update =	"95.01 mitchell"
}

@inproceedings{n-sismt-90
, author =	"B. F. Naylor"
, title =	"SCULPT: an interactive solid modeling tool"
, booktitle =	"Proc. Graphics Interface '90"
, year =	1990
, pages =	"138--148"
, update =	"98.07 bibrelex"
}

@inproceedings{n-acpwd-99
, author =	"Manuela Neagu"
, title =	"Arrangements of Curves in the Plane: What Does ``Equivalence'' Mean?"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"181--183"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{nl-ccsac-98
, author =	"Manuela Neagu and Bernard Lacolle"
, title =	"Computing the Combinatorial Structure of Arrangements of Curves Using Polygonal Approximations"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"121--123"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@book{n-bztdp-78
, author =	"W. Nef"
, title =	"Beitr{\"a}ge zur {Theorie} der {Polyeder}"
, publisher =	"Herbert Lang"
, address =	"Bern"
, year =	1978
, update =	"98.07 icking, 97.11 icking, 93.09 devillers"
}

@proceedings{nb-iwcg-84
, title =	"Abstracts 2nd Intern. Workshop Comput. Geom."
, editor =	"W. Nef and H. Bieri"
, nickname =	"CG '84"
, site =	"Bern"
, publisher =	"Universit{\"a}t Bern"
, year =	1984
, update =	"00.03 bibrelex"
}

@article{n-fdbtc-90
, author =	"C. A. Neff"
, title =	"Finding the distance between two circles in three-dimensional space"
, journal =	"IBM J. Res. Develop."
, volume =	34
, year =	1990
, pages =	"770--775"
}

@inproceedings{n-dfts-92
, author =	"S. Negami"
, title =	"Diagonal flips of triangulations on surfaces"
, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
, site =	"Kyoto, Japan"
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@article{n-jcbgs-85
, author =	"G. Nelson"
, title =	"Juno, a constraint-based graphics system"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, year =	1985
, pages =	"235--243"
, note =	"Proc. SIGGRAPH '85"
}

@article{n-taapd-78
, author =	"J. M. Nelson"
, title =	"A triangulation algorithm for arbitrary planar domains"
, journal =	"Appl. Math. Modelling"
, volume =	2
, year =	1978
, pages =	"151--159"
}

@article{ns-chrvd-86
, author =	"R. C. Nelson and H. Samet"
, title =	"A consistent hierarchical representation for vector data"
, journal =	"Comput. Graph."
, volume =	20
, number =	4
, month =	aug
, year =	1986
, pages =	"197--206"
, note =	"Proc. SIGGRAPH '86"
, update =	"96.09 devillers, 96.05 efrat"
}

@inproceedings{ns-pahds-87
, author =	"R. C. Nelson and H. Samet"
, title =	"A population analysis for hierarchical data structures"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, site =	"San Francisco"
, month =	may
, year =	1987
, pages =	"270--277"
, update =	"97.07 agarwal, 96.05 efrat"
}

@techreport{ns-paqvn-86
, author =	"R. C. Nelson and H. Samet"
, title =	"A population analysis of quadtrees with variable node size"
, type =	"Computer Science"
, number =	"TR--1740"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	dec
, year =	1986
, update =	"96.05 efrat"
}

@article{nt-vpspa-75
, author =	"G. L. Nemhauser and L. E. {Trotter, Jr.}"
, title =	"Vertex packing: {structural} properties and algorithms"
, journal =	"Math. Prog."
, volume =	8
, year =	1975
, pages =	"232--248"
, update =	"98.07 bibrelex"
}

@book{ny-pcmeo-83
, author =	"A. S. Nemirovsky and D. B. Yudin"
, title =	"Problem Complexity and Method Efficiency in Optimization"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1983
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@article{nv-rpot-98
, author =	"J. Ne{\v s}et{\v r}il and P. Valtr"
, title =	"A {Ramsey} property of order types"
, journal =	"J. Combin. Theory Ser. A"
, volume =	81
, year =	1998
, pages =	"88--107"
, update =	"02.03 devillers"
}

@article{nv-rttp-94
, author =	"J. Ne{\v s}et{\v r}il and P. Valtr"
, title =	"A {Ramsey}-type theorem in the plane"
, journal =	"Combinatorics, Probability and Computing"
, volume =	3
, year =	1994
, pages =	"127--135"
, update =	"02.03 devillers, 97.03 gaertner+salinger"
}

@inproceedings{nvs-imc-99
, author =	"J. Ne{\v s}et{\v r}il and P. Valtr and J. Solymosi"
, title =	"Induced monochromatic configurations"
, booktitle =	"Contemporary trends in Discrete Math."
, series =	"DIMACS Series 49"
, year =	1999
, pages =	"219--228"
, update =	"02.03 devillers"
}

@phdthesis{n-ceare-91
, author =	"N. S. Netanyahu"
, title =	"Computationally efficient algorithms for robust estimation"
, school =	"Department of Computer Science, University of Maryland"
, year =	1991
, keywords =	"doctoral thesis"
, precedes =	"n-ceare-92"
, update =	"98.07 bibrelex"
}

@techreport{n-ceare-92
, author =	"N. S. Netanyahu"
, title =	"Computationally efficient algorithms for robust estimation"
, number =	"cs-tr-2898"
, institution =	"University of Maryland"
, month =	may
, year =	1992
, succeeds =	"n-ceare-91"
, update =	"98.07 bibrelex, 93.09 milone+mitchell"
}

@book{nh-dp-88
, author =	"A. N. Netravali and B. G. Haskell"
, title =	"Digital Pictures --- Representation and Compression"
, publisher =	"Plenum Press"
, address =	"New York, NY"
, year =	1988
, update =	"98.07 bibrelex"
}

@inproceedings{nd-imgns-96
, author =	"Friedhelm Neugebauer and Ralf Dickmann"
, title =	"Improved mesh generation: not simple but good"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"257--270"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@article{n-tnas-94
, author =	"A. Neumann"
, title =	"The new {ASME Y14.5M} standard"
, journal =	"Manufacturing Review"
, volume =	7
, number =	4
, year =	1994
, pages =	"9--15"
, update =	"98.03 agarwal"
}

@article{nu-crpcp-88
, author =	"C. Neumann-Lara and J. Urrutia"
, title =	"A combinatorial result on points and circles in the plane"
, journal =	"Discrete Math."
, volume =	69
, year =	1988
, pages =	"173--178"
, update =	"98.03 bibrelex"
}

@techreport{ne-nmsta-80
, author =	"O. Nevalainen and J. Ernvall"
, title =	"A note on a minimal spanning tree algorithm for {Euclidean} space"
, type =	"Report"
, number =	25
, institution =	"Dept. Comput. Sci., Univ. Turku"
, address =	"Turku, Finland"
, year =	1980
}

@article{nek-fmste-81
, author =	"O. Nevalainen and J. Ernvall and J. Katajainen"
, title =	"Finding minimal spanning trees in a {Euclidean} coordinate space"
, journal =	"BIT"
, volume =	21
, year =	1981
, pages =	"46--54"
}

@inproceedings{n-idlge-88
, author =	"F. Newbery"
, title =	"An Interface Description Language for Graph Editors"
, booktitle =	"Proc. IEEE Workshop on Visual Languages"
, nickname =	"VL '88"
, year =	1988
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 93.09 tamassia"
}

@inproceedings{n-ecmcd-89
, author =	"F. J. Newbery"
, title =	"Edge Concentration: {A} Method for Clustering Directed Graphs"
, booktitle =	"Proc. 2nd Internat. Workshop on Software Configuration Management"
, year =	1989
, pages =	"76--85"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{nt-eege-90
, author =	"F. {Newbery Paulisch} and W. F. Tichy"
, title =	"{EDGE}: An Extendible Graph Editor"
, journal =	"Softw. -- Pract. Exp."
, volume =	20
, number =	"S1"
, year =	1990
, pages =	"63--88"
, note =	"also as Technical Report 8/88, Fakultat fur
                 Informatik, Univ. of Karlsruhe, 1988"
, keywords =	"graph drawing"
, update =	"99.07 forrest, 98.07 vismara, 93.09 tamassia"
}

@article{nm-ocfhc-80
, author =	"M. Newborn and W. O. J. Moser"
, title =	"Optimal crossing-free {Hamiltonian} circuit drawings of {$K_{n}$}"
, journal =	"J. Combin. Theory Ser. B"
, volume =	29
, year =	1980
, pages =	"13--26"
, update =	"98.07 bibrelex"
}

@inproceedings{nns-nshsp-72
, author =	"M. Newell and R. Newell and T. Sancha"
, title =	"A new solution to the hidden surface problem"
, booktitle =	"Proc. ACM Annu. Conf."
, year =	1972
, pages =	"443--448"
, update =	"98.07 bibrelex"
}

@article{ns-issip-80
, author =	"M. E. Newell and C. H. Sequin"
, title =	"The inside story on self-intersecting polygons"
, journal =	"Lambda"
, volume =	1
, year =	1980
, pages =	"20--21"
, update =	"98.03 bibrelex"
}

@book{n-ps-82
, author =	"D. J. Newman"
, title =	"A problem seminar"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1982
, update =	"97.11 bibrelex"
}

@book{ns-picg-79
, author =	"W. M. Newman and R. F. Sproull"
, title =	"Principles of Interactive Computer Graphics"
, publisher =	"McGraw-Hill"
, address =	"New York, NY"
, year =	1979
}

@inproceedings{nh-eecms-94
, author =	"R. T. Ng and J. Han"
, title =	"Efficient and Effective Clustering Methods for Spatial Data Mining"
, booktitle =	"Proceedings of the Twentieth International Conference on Very Large Databases"
, site =	"Santiago, Chile"
, year =	1994
, pages =	"144--155"
, update =	"98.07 agarwal"
}

@inproceedings{nrw-bcsh-93
, author =	"V. Nguyen and T. Roos and P. Widmayer"
, title =	"Balanced cuts of a set of hyperrectangles"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"121--126"
, cites =	"df-ssh-93, df-obpps-92p, b-mbstu-75, g-rtdis-84, py-bpahs-89, s-dasds-90, nhs-gfasm-84, py-obspo-90, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@techreport{n-fppp-84
, author =	"Van-Duc Nguyen"
, title =	"The Find-Path Problem in the Plane"
, type =	"A.I. Memo"
, number =	760
, institution =	"MIT, AI Laboratory"
, year =	1984
, update =	"93.09 milone+mitchell"
}

@techreport{n-ssfcg-86
, author =	"V.-D. Nguyen"
, title =	"The synthesis of stable force-closure grasps"
, type =	"Technical {Report}"
, number =	"MIT AI-TR-905"
, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1986
, update =	"98.07 bibrelex"
}

@inproceedings{nwr-bcsh-93
, author =	"Viet Hai Nguyen and Peter Widmayer and Thomas Roos"
, title =	"Best cuts of a set of hyperrectangles"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"1--5"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{n-amgte-82
, author =	"V. Ph. Nguyen"
, title =	"Automatic mesh generation with tetrahedron elements"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	18
, year =	1982
, pages =	"273--289"
}

@article{nllw-xchsx-83
, author =	"T. M. Nicholl and D. T. Lee and Y. Z. Liao and C. K. Wong"
, title =	"On the {$X-Y$} convex hull of a set of {$X-Y$} polygons"
, journal =	"BIT"
, volume =	23
, number =	4
, year =	1983
, pages =	"456--471"
, update =	"98.11 bibrelex"
}

@techreport{nprw-gcmlp-97
, author =	"S. Nickel and J. Puerto and A. Rodriguez-Chia and A. Wei{\ss}ler"
, title =	"General Continuous Multicriteria Location Problems"
, type =	"Report in Wirtschaftsmathematik"
, number =	28
, institution =	"University of  Kaiserslautern, Department of Mathematics"
, year =	1997
, update =	"01.04 icking"
}

@inproceedings{npw-gscpo-99
, author =	"Stefan Nickel and Justo Puerto and Ansgar Wei{\ss}ler"
, title =	"Geometric Solution Comcepts for Planar Ordered {Weber} Problems"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"43--46"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@incollection{n-med-71
, author =	"H. Niederreiter"
, title =	"Methods for estimating discrepancy"
, editor =	"S. K. Zaremba"
, booktitle =	"Applications of Number Theory to Numerical Analysis"
, publisher =	"Academic Press"
, year =	1971
, pages =	"203--236"
, update =	"98.03 bibrelex"
}

@techreport{n-sqsfp-79
, author =	"W. P. Niedringhaus"
, title =	"Scheduling with queueing: {T}he space factory problem"
, institution =	"Princeton University"
, year =	1979
, update =	"96.05 agarwal"
}

@phdthesis{n-aga-96
, author =	"F. Nielsen"
, title =	"Algorithmes g{\'e}om{\'e}triques adaptatifs"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"universit\'e de Nice-Sophia Antipolis"
, address =	"France"
, year =	1996
, keywords =	"doctoral thesis"
, update =	"98.07 devillers"
}

@inproceedings{n-capma-99
, author =	"Frank Nielsen"
, title =	"Constrained Approximate Pattern Matching and its Applications"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"191--193"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{n-fsbhd-96
, author =	"F. Nielsen"
, title =	"Fast stabbing of boxes in high dimensions"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"87--92"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{n-fsbhd-96c
, author =	"Franck Nielsen"
, title =	"Fast Stabbing of Boxes in High Dimensions"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	121
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{n-ospcm-96
, author =	"F. Nielsen"
, title =	"Output-sensitive {P}eeling of {C}onvex and {M}aximal {L}ayers"
, journal =	"Inform. Process. Lett."
, volume =	59
, year =	1996
, pages =	"255--259"
, update =	"98.11 devillers"
}

@techreport{ny-oscha-94
, author =	"F. Nielsen and M. Yvinec"
, title =	"Output-Sensitive Convex Hull Algorithms of Planar Convex Objects"
, type =	"Research {Report}"
, number =	2575
, institution =	"INRIA"
, address =	"BP93, 06902 Sophia-Antipolis, France"
, year =	1994
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2575"
, precedes =	"ny-oscha-98"
, update =	"98.07 devillers, 95.09 devillers"
, abstract =	"A set of planar objects is said to be of type $m$ if the
convex hull of any two objects has its size bounded by $2m$.  In this
paper, we  present an algorithm based on the marriage-before-conquest
paradigm to compute the convex hull of a set  of $n$ planar convex objects
of fixed type $m$. The algorithm is \mbox{output-sensitive}, i.e.  its
time complexity depends on the  size $h$ of the computed convex hull.  The
main ingredient of this algorithm is a linear method to find a {\em
bridge}, i.e. a facet of the convex hull intersected by a given line.  We
obtain an $O(n\beta (h,m)\log h)$-time convex hull algorithm for planar
objects.  Here  $\beta (h,2)=O(1)$ and $\beta (h,m)$ is an extremely
slowly growing function.  As a direct consequence, we can compute in
optimal $\Theta (n\log h)$ time the convex hull of disks, convex
homothets, non-overlapping objects. The method described in this paper
also applies to compute lower envelopes of functions.  In particular, we
obtain an optimal $\Theta (n\log h)$-time algorithm to compute the upper
envelope of line segments."
}

@article{ny-oscha-98
, author =	"F. Nielsen and M. Yvinec"
, title =	"Output-Sensitive Convex Hull Algorithms of Planar Convex Objects"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, number =	1
, year =	1998
, pages =	"39--66"
, url =	"http://www.inria.fr/RRRT/RR-2575"
, succeeds =	"ny-oscha-94"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers"
, abstract =	"A set of planar objects is said to be of type $m$ if the
convex hull of any two objects has its size bounded by $2m$.  In this paper,
we present an algorithm based on the marriage-before-conquest paradigm to
compute the convex hull of a set of $n$ planar convex objects of fixed type
$m$. The algorithm is \mbox{output-sensitive}, i.e. its time complexity
depends on the  size $h$ of the computed convex hull.  The main ingredient
of this algorithm is a linear method to find a {\em bridge}, i.e. a facet of
the convex hull intersected by a given line.  We obtain an $O(n\beta
(h,m)\log h)$-time convex hull algorithm for planar objects.  Here $\beta
(h,2)=O(1)$ and $\beta (h,m)$ is an extremely slowly growing function.  As a
direct consequence, we can compute in optimal $\Theta (n\log h)$ time the
convex hull of disks, convex homothets, non-overlapping objects.  The method
described in this paper also applies to compute lower envelopes of
functions.  In particular, we obtain an optimal $\Theta (n\log h)$-time
algorithm to compute the upper envelope of line segments."
}

@incollection{nf-scbut-83
, author =	"G. M. Nielson and R. Franke"
, title =	"Surface Construction Based Upon Triangulations"
, editor =	"R. Barnhill and W. Boehm"
, booktitle =	"Surfaces in Computer-Aided Geometric Design"
, publisher =	"North-Holland"
, year =	1983
, pages =	"163--177"
, annote =	"Two different triangulations considered for surface
		 generation. DT and ``min-max'' triangulation which
		 minimizes maximum triangle angles."
}

@proceedings{n-iwcg-83
, title =	"Abstracts 1st Intern. Workshop Comput. Geom."
, editor =	"J. Nievergelt"
, nickname =	"CG '83"
, site =	"Z{\"u}rich"
, publisher =	"ETH Z{\"u}rich"
, year =	1983
, update =	"00.03 bibrelex"
}

@inproceedings{n-kbgr-89
, author =	"J. Nievergelt"
, title =	"{Konsistenzprobleme} beim geometrischen {Rechner}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@book{nh-adsag-93
, author =	"J. Nievergelt and K. H. Hinrichs"
, title =	"Algorithms and Data Structures: {W}ith Applications to Graphics and Geometry"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1993
, keywords =	"book"
, comments =	"Computing Reviews 9401-0020"
, update =	"97.03 schwarzkopf, 96.05 agarwal, 94.09 jones, 93.09 held"
}

@techreport{nhs-gfasm-81
, author =	"J. Nievergelt and H. Hinterberger and K. C. Sevcik"
, title =	"The grid file: {A}n adaptable, symmetric multi-key file structure"
, type =	"Report"
, number =	46
, institution =	"Inst. Inform., Eidgen{\"o}ssische Tech. Hochschule Z{\"u}rich"
, address =	"Z{\"u}rich, Switzerland"
, year =	1981
, update =	"96.05 agarwal"
}

@article{nhs-gfasm-84
, author =	"J. Nievergelt and H. Hinterberger and K. C. Sevcik"
, title =	"The grid file: {A}n adaptable, symmetric multi-key file structure"
, journal =	"ACM Trans. Database Syst."
, volume =	9
, number =	1
, year =	1984
, pages =	"38--71"
, update =	"98.11 bibrelex, 97.07 agarwal"
}

@article{np-psaig-82
, author =	"J. Nievergelt and F. P. Preparata"
, title =	"Plane-sweep algorithms for intersecting geometric figures"
, journal =	"Commun. ACM"
, volume =	25
, year =	1982
, pages =	"739--747"
, keywords =	"polygons, intersection, two-dimensional"
}

@article{nr-bstbb-73
, author =	"J. Nievergelt and E. M. Reingold"
, title =	"Binary search trees of bounded balance"
, journal =	"SIAM J. Comput."
, volume =	2
, year =	1973
, pages =	"33--43"
, update =	"97.11 bibrelex"
}

@inproceedings{nslab-xpegc-91
, author =	"J{\"u}rg Nievergelt and Peter Schorn and Michele de Lorenzi and Christoph Ammann and Adrian Br{\"u}ngger"
, title =	"{XYZ}: A project in experimental geometric computation"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"171--186"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@techreport{nslab-xsgc-91
, author =	"J. Nievergelt and P. Schorn and M. de Lorenzi and C. Ammann and A. {Br\"ungger}"
, title =	"{XYZ}: Software for geometric computation"
, type =	"Report"
, number =	163
, institution =	"Institut f{\"u}r Theorische Informatik, ETH"
, address =	"Z{\"u}rich, Switzerland"
, month =	jul
, year =	1991
, update =	"93.09 erickson+rote"
}

@article{nw-gfsiq-93
, author =	"J. Nievergelt and P. Widmayer"
, title =	"Guard files: {S}tabbing and intersection queries on fat spatial objects"
, journal =	"Comput. J."
, volume =	36
, year =	1993
, pages =	"107--116"
, update =	"97.07 agarwal"
}

@unpublished{nw-sdscd-96
, author =	"J. Nievergelt and P. Widmayer"
, title =	"Spatial data structures: {C}oncepts and design choices"
, year =	1996
, note =	"unpublished manuscript"
, update =	"97.07 agarwal"
}

@incollection{nw-sdscd-00
, author =	"J{\"u}rg Nievergelt and Peter Widmayer"
, title =	"Spatial Data Structures: {Concepts} and Design Choices"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"725--764"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 17 of su-hcg-00"
}

@article{ny-piids-94
, author =	"Masatoshi Niizeki and Fujio Yamaguchi"
, title =	"Projectively invariant intersection detection for solid modelling"
, journal =	"ACM Trans. Graph."
, volume =	13
, number =	3
, year =	1994
, pages =	"277--299"
, keywords =	"intersection, homogeneous coordinates, solid modeling"
, comments =	"Correction to mst-ialc-89"
, update =	"95.09 korneenko"
}

@book{ns-gg-87
, author =	"V. V. Nikulin and I. R. Shafarevich"
, title =	"Geometrics and Groups"
, publisher =	"Springer-Verlag"
, year =	1987
, update =	"98.07 bibrelex"
}

@phdthesis{n-gagmm-95
, author =	"Bengt J. Nilsson"
, title =	"Guarding Art Galleries --- Methods for Mobile Guards"
, school =	"Lund University"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"98.03 mitchell, 95.09 mitchell"
}

@incollection{nosi-rocg-92
, author =	"Bengt J. Nilsson and Thomas Ottmann and Sven Schuierer and Christian Icking"
, title =	"Restricted Orientation Computational Geometry"
, editor =	"Burkhard Monien and Thomas Ottmann"
, booktitle =	"Data Structures and Efficient Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	594
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"148--185"
, update =	"99.11 bibrelex, 97.03 icking"
}

@inproceedings{ns-oarlc-91
, author =	"Bengt J. Nilsson and S. Schuierer"
, title =	"An optimal algorithm for the rectilinear link center of a rectilinear polygon"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"249--260"
, keywords =	"link distance, link center, orthohedral, visibility, polygon"
, precedes =	"ns-oarlc-96"
, update =	"98.03 mitchell, 96.09 devillers"
}

@article{ns-oarlc-96
, author =	"Bengt J. Nilsson and S. Schuierer"
, title =	"An optimal algorithm for the rectilinear link center of a rectilinear polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"169--194"
, keywords =	"link distance, link center, orthohedral, visibility, polygon"
, succeeds =	"ns-oarlc-91"
, update =	"98.03 mitchell, 96.09 devillers"
}

@inproceedings{ns-crldp-91
, author =	"Bengt J. Nilsson and Sven Schuierer"
, title =	"Computing the rectilinear link diameter of a polygon"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"203--215"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
, abstract =	"The problem of finding the diameter of a simple polygon has
                 been studied extensively in recent years.  $O(n \log n)$
                 time upper bounds have been given for computing the
                 geodesic diameter and the link diameter for a polygon.
                 We consider the rectilinear case of this problem and give
                 a linear time algorithm to compute the rectilinear link
                 diameter of a simple rectilinear polygon.
                 To our knowledge this is the first optimal algorithm for
                 the diameter problem of non-trivial classes of polygons."
}

@misc{nw-owrsp-90m
, author =	"Bengt J. Nilsson and D. Wood"
, title =	"Optimum watchmen routes in spiral polygons"
, month =	aug
, year =	1989
, note =	"Manuscript, University of Waterloo, Ontario, Canada"
, precedes =	"nw-owrsp-90i"
, update =	"98.07 bibrelex"
}

@inproceedings{nw-owrsp-90i
, author =	"B. J. Nilsson and D. Wood"
, title =	"Optimum watchmen routes in spiral polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"269--272"
, succeeds =	"nw-owrsp-90m"
, cites =	"c-ctpg-75, cn-owr-86, cn-wrsp-87, cn-owr-88, f-spcwt-78, o-agta-87, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{n-maaai-69
, author =	"N. Nilsson"
, title =	"A mobile automaton: {A}n application of artificial intelligence techniques"
, booktitle =	"Proc. IJCAI"
, year =	1969
, pages =	"509--520"
, update =	"96.05 agarwal"
}

@inproceedings{n-asmpc-90
, author =	"N. Nishimura"
, title =	"Asynchronous shared memory parallel computation"
, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"76--84"
, update =	"96.09 orourke"
}

@techreport{n-lbcmm-77
, author =	"T. Nishizeki"
, title =	"Lower bounds on cardinality of the maximum matchings of planar graphs"
, type =	"Technical {Report}"
, institution =	"Carnegie-Mellon Univ."
, address =	"Phildelphia, PA"
, year =	1977
, update =	"98.07 bibrelex"
}

@book{nc-pgta-88
, author =	"T. Nishizeki and N. Chiba"
, title =	"Planar Graphs: Theory and Algorithms"
, series =	"Ann. Discrete Math."
, volume =	32
, publisher =	"North-Holland"
, address =	"Amsterdam, The Netherlands"
, year =	1988
, keywords =	"graph drawing"
, update =	"00.03 vismara, 96.09 devillers, 96.05 agarwal, 93.09 tamassia"
}

@article{n-coatd-88
, author =	"H. Noborio"
, title =	"Construction of the octree approximating three-dimensional objects by using multiple views"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	10
, year =	1988
, pages =	"769--782"
, update =	"98.11 bibrelex"
}

@article{nfa-ficmu-89
, author =	"H. Noborio and S. Fukuda and S. Arimoto"
, title =	"Fast interference check method using octree representation"
, journal =	"Advanced robotics"
, volume =	3
, number =	3
, year =	1989
, pages =	"193--212"
, update =	"93.09 milone+mitchell"
}

@inproceedings{nyt-usbna-97
, author =	"Hiroshi Noborio and Takahashi Yoshioka and Shoji Tominaga"
, title =	"An Universal Sensor-Based Navigation Algorithm"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	23
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{ngv-begs-93
, author =	"M. H. Nodine and M. T. Goodrich and J. S. Vitter"
, title =	"Blocking for External Graph Searching"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Principles Database Syst."
, nickname =	"PODS '93"
, year =	1993
, pages =	"222--232"
, update =	"94.09 vitter"
}

@article{ngv-begs-96
, author =	"M. H. Nodine and M. T. Goodrich and J. S. Vitter"
, title =	"Blocking for External Graph Searching"
, journal =	"Algorithmica"
, volume =	16
, number =	2
, month =	aug
, year =	1996
, pages =	"181--214"
, update =	"97.03 murali"
}

@inproceedings{nv-ddssd-93
, author =	"M. H. Nodine and J. S. Vitter"
, title =	"Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors"
, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
, year =	1993
, pages =	"120--129"
, update =	"96.09 orourke+tamassia"
}

@article{nv-gsosa-95
, author =	"M. H. Nodine and J. S. Vitter"
, title =	"Greed Sort: An Optimal Sorting Algorithm for Multiple Disks"
, journal =	"J. ACM"
, volume =	42
, number =	4
, month =	jul
, year =	1995
, pages =	"919--933"
, update =	"97.03 murali"
}

@inproceedings{nv-lsspm-91
, author =	"M. H. Nodine and J. S. Vitter"
, title =	"Large-Scale Sorting in Parallel Memories"
, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
, year =	1991
, pages =	"29--39"
, update =	"96.09 orourke"
}

@inproceedings{n-spetv-94
, author =	"E. G. Noik"
, title =	"A Space of Presentation Emphasis Techniques for Visualizing Graphs"
, booktitle =	"GI '94: Graphics Interface 1994"
, site =	"Banff, Alberta, Canada"
, month =	may
, year =	1994
, url =	"ftp://db.toronto.edu/pub/papers/gi94.ps.Z"
, update =	"94.05 tamassia"
}

@inproceedings{n-epeag-95
, author =	"E. G. Noik"
, title =	"Encoding Presentation Emphasis Algorithms for Graphs"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"428--435"
, keywords =	"graph drawing, fisheye view, system"
, update =	"95.01 tamassia"
}

%, day =	"14--18"
@inproceedings{n-elhfv-93
, author =	"E. G. Noik"
, title =	"Exploring Large Hyperdocuments: {F}isheye Views of Nested Networks"
, booktitle =	"Hypertext '93: ACM Conf. on Hypertext"
, site =	"Seattle, WA"
, month =	nov
, year =	1993
, pages =	"192--205"
, update =	"96.05 agarwal, 94.01 tamassia"
}

@incollection{n-gshvu-93
, author =	"E. G. Noik"
, title =	"Graphite: {A} Suite of Hygraph Visualization Utilities"
, editor =	"A. O. Mendelzon"
, booktitle =	"Declarative database visualization: Recent papers from the Hy+/GraphLog project"
, publisher =	"Technical report CSRI-285, University of Toronto"
, month =	jul
, year =	1993
, update =	"96.05 agarwal, 94.01 tamassia"
, annote =	"Graphite is a set of Unix programs that support
general and directed graphs and hygraphs (a nested graph formalism) and
perform the following functions:  -draw graphs using combinations of 10
basic graph layout algorithms -generate several types of fisheye views
-perform simple graph manipulations including: conversion of arc
(1-to-1) relations to nested (1-to-many) relations and vice versa,
automatic showing and hiding of the contents of selected nodes, link
inheritance, convert graphs between several external formats including
encapsulated PostScript"
}

%, day =	"24--27"
@inproceedings{n-lifvn-93
, author =	"E. G. Noik"
, title =	"Layout-independent Fisheye Views of Nested Graphs"
, booktitle =	"VL '93: IEEE Symposium on Visual Languages"
, site =	"Bergen, Norway"
, month =	aug
, year =	1993
, pages =	"336--341"
, update =	"94.01 tamassia"
}

@inproceedings{n-nemrp-94
, author =	"Hartmut Noltemeier"
, title =	"A New Efficient Method to Represent and Process Proximity and Similarity in Sets of Complex Objects"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	77
, cites =	"ZZZ"
, update =	"00.11 smid, 00.07 icking"
}

@proceedings{n-cgia-88
, title =	"Computational Geometry and its Applications"
, editor =	"H. Noltemeier"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, update =	"00.03 bibrelex, 99.11 bibrelex, 97.11 icking, 93.09 milone+mitchell"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@inproceedings{n-lfmss-91
, author =	"Hartmut Noltemeier"
, title =	"Layout of flexible manufacturing systems: selected problems"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"217--226"
, update =	"00.03 bibrelex, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{n-vta-89
, author =	"H. Noltemeier"
, title =	"Voronoi trees and applications"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"69--74"
, update =	"95.09 mitchell"
}

@inproceedings{nvz-mbtte-92
, author =	"H. Noltemeier and K. Verbarg and C. Zirkelbach"
, title =	"Monotonous Bisector Trees: {A} Tool for Efficient Partitioning of Complex Scenes of Geometric Objects"
, booktitle =	"Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative"
, series =	"Lecture Notes Comput. Sci."
, volume =	594
, publisher =	"Springer-Verlag"
, year =	1992
, succeeds =	"z-mbtcp-90"
, update =	"96.05 agarwal, 94.05 franciosa"
}

@article{n-scpsn-81
, author =	"A. K. Noor"
, title =	"Survey of computer programs for solutions of nonlinear structural and solid mechanics problems"
, journal =	"Comput. Struct."
, volume =	13
, year =	1981
, pages =	"424--465"
}

@article{nr-ccppp-67
, author =	"S. Nordbeck and B. Rystedt"
, title =	"Computer cartography point-in-polygon programs"
, journal =	"BIT"
, volume =	7
, year =	1967
, pages =	"39--64"
}

@incollection{n-cte-83
, author =	"A. C. Norman"
, title =	"Computing in transcendental extensions"
, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
, publisher =	"Springer-Verlag"
, year =	1983
, pages =	"169--172"
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@misc{n-5dg-95
, author =	"S. North"
, title =	"5114 directed graphs"
, year =	1995
, note =	"Manuscript. \url{ftp.research.bell-labs.com/dist/drawdag/}"
, keywords =	"graph drawing, experiments"
, update =	"96.09 tamassia"
}

@inproceedings{n-ild-96
, author =	"S. North"
, title =	"Incremental Layout in {DynaDAG}"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"409--418"
, update =	"98.11 bibrelex, 98.07 vismara"
}

@techreport{nk-agv-95
, author =	"S. North and E. Koutsofios"
, title =	"Applications of Graph Visualization"
, institution =	"AT\&T Bell Laboratories, Murray Hill, NJ."
, year =	1995
, note =	"Available from \url{http://www.research.bell-labs.com/dist/drawdag}"
, keywords =	"graph drawing"
, update =	"96.09 tamassia, 96.04 garg"
}

@proceedings{n-gd-97
, title =	"Graph Drawing (Proc. GD '96)"
, editor =	"S. C. North"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, update =	"99.11 bibrelex, 98.11 bibrelex, 98.07 vismara+tamassia"
}

@inproceedings{npt-usafd-90
, author =	"C. H. Norton and S. A. Plotkin and {\'E}. Tardos"
, title =	"Using separation algorithms in fixed dimension"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"377--387"
, precedes =	"npt-usafd-92"
, update =	"93.09 rote"
}

@article{npt-usafd-92
, author =	"C. H. Norton and S. A. Plotkin and {\'E}. Tardos"
, title =	"Using separation algorithms in fixed dimensions"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"79--98"
, succeeds =	"npt-usafd-90"
, update =	"93.09 rote"
}

@article{npl-wplm-92
, author =	"R. Norwood and G. Poole and M. Laidacker"
, title =	"The worm problem of {Leo} {Moser}"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"153--162"
}

@article{n-edlde-48
, author =	"M. Nosarzewska"
, title =	"Evaluation de la diff{\'e}rence entre l'aire d'une r{\'e}gion plane convexe et le nombre des points aux coordonn{\'e}es enti{\`e}res couverts par elle"
, journal =	"Colloq. Math."
, volume =	1
, year =	1948
, update =	"97.11 bibrelex"
}

@inproceedings{nk-sdprl-89
, author =	"L. V. Nosov and N. M. Korneenko"
, title =	"Special dissection of polygonal regions in {LSI} mask pattern design"
, booktitle =	"GEOBILD'89, Proc. 4th Workshop on Geometrical Problems of Image Processing, Georgenthal, March 13--17, 1989"
, series =	"Math. Res."
, volume =	51
, publisher =	"Akademie-Verlag"
, address =	"Berlin, GDR"
, year =	1989
, pages =	"53--57"
, keywords =	"isothetic domain, dissection, decomposition, {VLSI} layout design"
, update =	"95.01 korneenko"
}

@article{np-ospp-89
, author =	"R. Nowakowski and A. Parker"
, title =	"Ordered sets, pagenumbers and planarity"
, journal =	"Order"
, volume =	6
, year =	1989
, pages =	"209--218"
, update =	"98.07 bibrelex"
}

@inproceedings{nr-bsotc-91
, author =	"R. Nowakowski and I. Rival"
, title =	"Bending and stretching orders into three channels"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"15--18"
, cites =	"bk-btg-79, cm-ecgt-78, d-dtpos-50, f-slrpg-48, f-ioig-85, k-fpos-87, m-ctcos-89, np-ospp-89, nru-lcpop-88, t-eggmn-87, w-bzv-36, ZZZ"
, update =	"98.07 bibrelex"
}

@unpublished{nru-lcpop-88
, author =	"R. Nowakowski and I. Rival and J. Urrutia"
, title =	"Lattices contained in planar orders are planar"
, note =	"University of Ottawa TR-88-12, to appear in Algebra Universalis"
, update =	"98.07 bibrelex"
}

@article{nru-roptp-90
, author =	"R. J. Nowakowski and I. Rival and J. Urrutia"
, title =	"Representing orders on the plane by translating points and lines"
, journal =	"Discrete Appl. Math."
, volume =	"??"
, year =	1990
, pages =	"147--156"
, update =	"98.07 bibrelex"
}

@article{n-gwg-86
, author =	"Simeon Ntafos"
, title =	"On gallery watchmen in grids"
, journal =	"Inform. Process. Lett."
, volume =	23
, number =	2
, month =	aug
, year =	1986
, pages =	"99--102"
, update =	"98.03 mitchell"
}

@techreport{n-rrp-88
, author =	"S. Ntafos"
, title =	"The Robber Route Problem"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Texas"
, address =	"Dallas, TX"
, year =	1988
, keywords =	"visibility"
, precedes =	"n-rrp-90"
, update =	"98.03 mitchell"
}

@article{n-rrp-90
, author =	"Simeon Ntafos"
, title =	"The Robber Route Problem"
, journal =	"Inform. Process. Lett."
, volume =	34
, number =	2
, month =	mar
, year =	1990
, pages =	"59--63"
, keywords =	"watchman route, visibility, concealment, TSP"
, succeeds =	"n-rrp-88"
, update =	"98.03 mitchell"
}

@inproceedings{n-wrlv-90
, author =	"S. Ntafos"
, title =	"Watchman routes under limited visibility"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"89--92"
, precedes =	"n-wrlv-92"
, cites =	"cn-owr-88, cn-wrsp-91, cn-ozr-87, hch-rfomr-86, ips-hpgg-82, j-nccog-82, o-agta-87, p-etspi-77, r-pc-64, ZZZ"
, update =	"98.07 bibrelex"
}

@article{n-wrlv-92
, author =	"S. Ntafos"
, title =	"Watchman routes under limited visibility"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	3
, year =	1992
, pages =	"149--170"
, succeeds =	"n-wrlv-90"
}

@techreport{ng-ewr-89
, author =	"S. Ntafos and L. Gewali"
, title =	"External Watchman Routes"
, type =	"Technical {Report}"
, institution =	"Computer Science, University of Texas at Dallas"
, year =	1989
, update =	"93.09 milone+mitchell"
}

@article{ng-ewr-94
, author =	"S. Ntafos and L. Gewali"
, title =	"External watchman routes"
, journal =	"Visual Comput."
, volume =	10
, year =	1994
, pages =	"474--483"
, update =	"95.01 smid"
}

@unpublished{nt-opg
, author =	"S. Ntafos and M. Tsoukalas"
, title =	"Optimum placement of guards"
, note =	"to appear in Information Science"
, succeeds =	"nt-opg-91"
, update =	"98.11 bibrelex"
}

@inproceedings{nt-opg-91
, author =	"S. Ntafos and M. Tsoukalas"
, title =	"Optimum placement of guards"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"122--125"
, precedes =	"nt-opg"
, cites =	"a-agpiv-84, c-tsplt-90i, ea-lacvp-81, ll-ccagp-86, gj-cigtn-79, o-agta-87, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@phdthesis{n-rtsgp-98
, author =	"St{\'e}phane Nullans"
, title =	"Reconstruction tridimensionnelle de structures g{\'e}ologiques {\`a} partir de donn{\'e}es h{\'e}t{\'e}rog{\`e}nes"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"Universit\'e de Nice-Sophia Antipolis"
, address =	"France"
, year =	1998
, note =	"TU-0606"
, url =	"http://www.inria.fr/RRRT/TU-0606"
, keywords =	"doctoral thesis"
, update =	"00.03 devillers"
}

@inproceedings{nt-scs-90
, author =	"K. Numata and T. Tokuyama"
, title =	"Splitting a configuration in a simplex"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"429--438"
}

@inproceedings{nt-cledv-90
, author =	"J. Nummenmaa and J. Tuomi"
, title =	"Constructing Layouts for {ER}-Diagrams from Visibility Representations"
, booktitle =	"Proc. 9th Internat. Conf. on Entity-Relationship Approach"
, year =	1990
, pages =	"303--317"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{n-flsah-85
, author =	"O. Nurmi"
, title =	"A fast line-sweep algorithm for hidden line elimination"
, journal =	"BIT"
, volume =	25
, year =	1985
, pages =	"466--472"
}

@techreport{n-tsott-84
, author =	"O. Nurmi"
, title =	"On translating a set of objects in two- and three-dimensional spaces"
, type =	"Report"
, number =	"Bericht 141"
, institution =	"Inst. Angew., Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1984
, precedes =	"n-tsott-86"
}

@article{n-tsott-86
, author =	"O. Nurmi"
, title =	"On translating a set of objects in two- and three-dimensional spaces"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	36
, year =	1986
, pages =	"42--52"
, succeeds =	"n-tsott-84"
}

@inproceedings{ns-spots-89
, author =	"O. Nurmi and J.-R. Sack"
, title =	"Separating a polyhedron by one translation from a set of obstacles"
, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '88"
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"202--212"
, keywords =	"separation"
, update =	"98.07 smid"
}

@book{n-asf-89
, author =	"G. Nurnberger"
, title =	"Approximation by sine functions"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1989
, update =	"98.07 bibrelex"
}

@mastersthesis{n-dsttd-88
, author =	"D. Nussbaum"
, title =	"Directional separability in two and three dimensional space"
, type =	"M.{Sc}. Thesis"
, school =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1988
, keywords =	"master thesis, separation"
}

@inproceedings{n-rppp-97
, author =	"D. Nussbaum"
, title =	"Rectilinear $p$-piercing problems"
, booktitle =	"Proceedings of the Annual International Symposium on Symbolic and Algebraic Computation"
, nickname =	"ISSAC '97"
, year =	1997
, pages =	"316--323"
, update =	"98.11 smid, 98.07 agarwal"
}

@inproceedings{ns-dtdcp-89
, author =	"D. Nussbaum and J.-R. Sack"
, title =	"Disassembling two-dimensional composite parts via translations"
, booktitle =	"Proc. Optimal Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	401
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"153--167"
, precedes =	"ns-dtdcp-93"
, update =	"96.09 devillers"
}

@article{ns-dtdcp-93
, author =	"D. Nussbaum and J.-R. Sack"
, title =	"Disassembling two-dimensional composite parts via translations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"71--84"
, keywords =	"computational geometry, translation motion, upper-bounds, lower-bounds"
, succeeds =	"ns-dtdcp-89"
, update =	"96.09 devillers"
}

@inproceedings{ns-tsp-89
, author =	"D. Nussbaum and J.-R. Sack"
, title =	"Translation separability of polyhedra"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	34
}

@techreport{nw-edmbm-90
, author =	"R. Nussinov and H. J. Wolfson"
, title =	"Efficient Detection of Motifs in biological Macromolecules by computer Vision Techniques"
, number =	"166/90"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@book{o-iqgmm-92
, author =	"L. O'Brian"
, title =	"Introducing Quantitative Geography: measurement, methods and generalised linear models"
, publisher =	"Routledge"
, address =	"London"
, year =	1992
, update =	"96.09 kreveld"
}

@article{o-adnnp-75
, author =	"J. F. O'Callaghan"
, title =	"An alternative definition for near-neighbourhood of a point"
, journal =	"IEEE Trans. Comput."
, volume =	"C-24"
, year =	1975
, pages =	"1121--1125"
}

@article{o-cpbdp-74
, author =	"J. F. O'Callaghan"
, title =	"Computing the perceptual boundaries of dot patterns"
, journal =	"Comput. Graph. Image Process."
, volume =	3
, year =	1974
, pages =	"141--162"
}

@article{o-hphdp-74
, author =	"J. F. O'Callaghan"
, title =	"Human perception of homogeneous dot patterns"
, journal =	"Perception"
, volume =	3
, year =	1974
, pages =	"33--45"
}

@article{ohg-riitf-85
, author =	"E. Ochoa and L. Hesselink and J. Goodman"
, title =	"Real-time intensity inversion using two-wave and four-wave mixing in photorefractive {$Bi_{12}SiO_{20}$}"
, journal =	"Applied Optics"
, volume =	24
, number =	12
, year =	1985
, pages =	"1826--1832"
, update =	"98.11 bibrelex"
}

@incollection{oss-picpu-87
, author =	"S. Ocken and J. T. Schwartz and Micha Sharir"
, title =	"Precise implementation of {CAD} primitives using rational parameterization of standard surfaces"
, editor =	"J. Hopcroft and J. Schwartz and Micha Sharir"
, booktitle =	"Planning, Geometry, and Complexity of Robot Motion"
, publisher =	"Ablex Publishing"
, address =	"Norwood, NJ"
, year =	1987
, pages =	"245--266"
, keywords =	"CAD, rational parameterization, quadric surfaces, intersection"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@techreport{og-suvog-86
, author =	"M. A. O'Connor and G. Gentili"
, title =	"Simple unit vectors orthogonal to a given vector"
, type =	"Report"
, number =	"RC 12263"
, institution =	"Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1986
}

@techreport{or-sdimp-89t
, author =	"M. A. O'Connor and J. R. Rossignac"
, title =	"SCG: {A} dimension independent model for pointsets with internal structures and incomplete boundaries"
, type =	"Technical {Report}"
, number =	"RC14340"
, institution =	"IBM"
, year =	1989
, update =	"98.07 bibrelex"
}

@book{or-imtfe-76
, author =	"J. T. Oden and J. N. Reddy"
, title =	"An Introduction to the Mathematical Theory of Finite Elements"
, publisher =	"John Wiley \& Sons"
, year =	1976
, update =	"98.03 bibrelex"
}

% ?  title =	"... $3.6n-3.4$ edges ..."
@techreport{op-eggnv-91
, author =	"P. O'Donnel and M. Perles"
, title =	"Every geometric graph with $n$ vertices and $3.6n + 3.4$ edges contains $3$ pairwise disjoint edges"
, type =	"Manuscript"
, institution =	"Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1991
, update =	"98.03 bibrelex"
}

@article{o-tlbcp-88
, author =	"C. {\'O}'D{\'u}nlaing"
, title =	"A tight lower bound for the complexity of path-planning for a disc"
, journal =	"Inform. Process. Lett."
, volume =	28
, year =	1988
, pages =	"165--170"
}

@techreport{o-mpic-86
, author =	"C. {\'O}'D{\'u}nlaing"
, title =	"Motion Planning with Inertial Constraints"
, number =	"TR 230"
, institution =	"Robotics Lab., New York Univ."
, address =	"New York, NY"
, year =	1986
, update =	"97.11 bibrelex"
}

@article{o-mpic-87
, author =	"C. {\'O}'D{\'u}nlaing"
, title =	"Motion-planning with inertial constraints"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"431--475"
}

@article{osy-gvdl-86
, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
, title =	"Generalized {Voronoi} diagrams for a ladder: {I}. {Topological} analysis"
, journal =	"Commun. Pure Appl. Math."
, volume =	39
, year =	1986
, pages =	"423--483"
, keywords =	"Voronoi diagrams, motion planning"
, update =	"98.03 mitchell, 96.01 aronov"
}

@techreport{osy-gvdl1-84
, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
, title =	"Generalized {Voronoi} diagrams for a ladder: {I}. {Topological} considerations"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Courant Inst."
, address =	"New York, NY"
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{osy-gvdl2-84
, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
, title =	"Generalized {Voronoi} diagrams for a ladder: {II}. {Efficient} construction of the diagram"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Courant Inst."
, address =	"New York, NY"
, month =	oct
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{osy-gvdl-87
, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
, title =	"Generalized {Voronoi} diagrams for a ladder: {II}. {Efficient} construction of the diagram"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"27--59"
, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences, motion planning"
, update =	"98.03 mitchell, 96.01 aronov"
}

@inproceedings{osy-rnamp-83
, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
, title =	"Retraction: {A} new approach to motion-planning"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
, year =	1983
, pages =	"207--220"
, comments =	"Split into three journal papers: \cite{oy-rmpmd-85},
		 \cite{osy-gvdl-87}, and \cite{osy-gvdl-86}"
, precedes =	"oy-rmpmd-85"
, update =	"98.03 mitchell, 96.05 agarwal"
}

@inproceedings{ow-mta-92
, author =	"Colm {\'O}'D{\'u}nlaing and Colum Watt"
, title =	"Miscellaneous Topological Algorithms"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"65--66"
, update =	"00.03 bibrelex"
}

@article{oww-h2ceg-00
, author =	"C. {\'O}'D{\'u}nlaing and C. Watt and D. Wilkins"
, title =	"Homeomorphism of 2-complexes is equivalent to grap isomorphism"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"453--476"
, update =	"01.04 smid"
}

@article{oy-rmpmd-85
, author =	"C. {\'O}'D{\'u}nlaing and C. K. Yap"
, title =	"A ``retraction'' method for planning the motion of a disk"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"104--111"
, succeeds =	"osy-rnamp-83"
}

@techreport{oy-vmmp1-83
, author =	"C. {\'O}'D{\'u}nlaing and C. K. Yap"
, title =	"The {Voronoi} method for motion-planning: {I}. the case of a disc"
, type =	"Report"
, number =	53
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1983
}

@book{o-eig-69
, author =	"C. Stanley Ogilvy"
, title =	"Excursions in Geometry"
, publisher =	"Dover Publications"
, year =	1969
, location =	"New York"
, update =	"02.03 orourke"
}

@article{os-wftcb-85
, author =	"L. O'Gorman and A. C. Sanderson"
, title =	"The wedge filter technique for convex boundary estimation"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-7"
, year =	1985
, pages =	"326--332"
}

@incollection{o-flaed-94
, author =	"Yoshikazu Ohashi"
, title =	"Fast Linear Approximations of {Euclidean} Distance in Higher Dimensions"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"120--124"
, keywords =	"integer arithmetic, square root"
, update =	"94.09 heckbert"
, annote =	"Provides optimized formulas for approximating Euclidean
distance in two or more dimensions without square roots. Contains C code."
}

@techreport{o-otrta-85
, author =	"M. Ohta"
, title =	"An optimal-time ray tracing algorithm based on direction index"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Inform. Sci., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1985
}

@inproceedings{o-mdrp-82
, author =	"T. Ohtsuki"
, title =	"Minimum Dissection of Rectilinear Polygons"
, booktitle =	"Proc. IEEE Symp. on Circuits and Systems"
, year =	1982
, pages =	"1210--1213"
, update =	"98.07 bibrelex"
}

@article{o-mdrr-83
, author =	"T. Ohtsuki"
, title =	"Minimum dissection of rectilinear regions"
, journal =	"Trans. Inform. Processing Soc. Japan"
, volume =	"??"
, year =	1983
, pages =	"1210--1213"
, update =	"98.03 bibrelex"
}

@techreport{osk-cgawr-??
, author =	"T. Ohtsuki and M. Sato and I. Kojima"
, title =	"Computational geometry approach to wire routing design"
, type =	"Manuscript"
, institution =	"School Sci. Engrg., Waseda Univ."
, address =	"Tokyo, Japan"
, year =	"??"
}

@article{ostt-mprr-83
, author =	"T. Ohtsuki and M. Sato and M. Tachibana and S. Torii"
, title =	"Minimum partitioning of rectilinear regions"
, journal =	"Trans. Inform. Processing Soc. Japan"
, volume =	"??"
, year =	1983
, pages =	"??"
}

@inproceedings{o-rfvaa-83
, author =	"T. Ohya"
, title =	"Robustness of the fast {Voronoi} algorithm against nonuniform distribution of points"
, booktitle =	"Proc. Spring Conf. Oper. Res. Soc. Japan"
, volume =	"C-1"
, year =	1983
, pages =	"90--91"
}

@article{oim-fvdaq-84
, author =	"T. Ohya and M. Iri and K. Murota"
, title =	"A fast {Voronoi}-diagram algorithm with quaternary tree bucketing"
, journal =	"Inform. Process. Lett."
, volume =	18
, year =	1984
, pages =	"227--231"
}

@inproceedings{oim-iacvd-82
, author =	"T. Ohya and M. Iri and K. Murota"
, title =	"An improved algorithm for constructing the {Voronoi} diagram"
, booktitle =	"Proc. Fall Conf. Oper. Res. Soc. Japan"
, volume =	"E-8"
, year =	1982
, pages =	"152--153"
}

@article{oim-iimvd-84
, author =	"T. Ohya and M. Iri and K. Murota"
, title =	"Improvements of the Incremental Method for the {Voronoi} Diagram with Computational Comparison of Various Algorithms"
, journal =	"J. Oper. Res. Soc. Japan"
, volume =	27
, number =	4
, year =	1984
, pages =	"306--336"
, update =	"93.09 held"
}

@inproceedings{om-adscv-82
, author =	"T. Ohya and K. Murota"
, title =	"Algorithms and data structures for constructing the {Voronoi} diagram"
, booktitle =	"Proc. Spring Conf. Oper. Res. Soc. Japan"
, volume =	"2C-3"
, year =	1982
, pages =	"185--186"
}

@unpublished{os-nrdca
, author =	"Y. Oishi and K. Sugihara"
, title =	"Numerically Robust Divide-and-Conquer Algorithm for Constructing {Voronoi} Diagrams"
, note =	"in Japanese, Transactions of the Information Processing Society of Japan, to appear"
, update =	"98.07 bibrelex"
}

@article{os-todqa-95
, author =	"Y. Oishi and K. Sugihara"
, title =	"Topology Oriented Divide and Conquer Algorithm for {Voronoi} Diagrams"
, journal =	"Graphical Models and Image Processing"
, volume =	57
, number =	4
, year =	1995
, pages =	"303--314"
, keywords =	"robustness, numerical precision"
, update =	"96.01 tamassia"
}

@techreport{on-rerc-84
, author =	"H. Oja and Niinimaa"
, title =	"On Robust Estimation of Regression Coefficients"
, type =	"Research Report"
, institution =	"Department of Applied Mathematics and Statistics, University of Oulu"
, address =	"Finland"
, year =	1984
, update =	"98.07 bibrelex"
}

% review in Science (21 May 1993), 1170--1173
@book{obs-stcav-92
, author =	"Atsuyuki Okabe and Barry Boots and Kokichi Sugihara"
, title =	"Spatial Tessellations: {C}oncepts and Applications of {Voronoi} Diagrams"
, publisher =	"John Wiley \& Sons"
, address =	"Chichester, UK"
, year =	1992
, isbn =	"0-471-93430-5"
, keywords =	"book, Voronoi diagrams, three-dimensional"
, comments =	"532 pages"
, update =	"97.07 kuehn, 97.03 schwarzkopf, 96.05 agarwal, 93.09 jones, 93.05 jones"
}

@article{os-lopst-97
, author =	"A. Okabe and A. Suzuki"
, title =	"Locational Optimization Problems Solved Through {Voronoi} Diagrams"
, journal =	"European J. Oper. Res."
, volume =	98
, number =	3
, month =	may
, year =	1997
, pages =	"445--456"
, update =	"97.11 held"
}

@article{o-ucp-88
, author =	"Stephan Olariu"
, title =	"On the unimodality of convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	29
, number =	6
, month =	dec
, year =	1988
, pages =	"289--292"
, abstract =	"An open problem proposed by G. T. Toussaint is to find
		 the smallest value of n such that a convex polygon with
		 n vertices is not guaranteed to have any unimodal
		 vertices. Toussaint conjectured that this value is 6.
		 The purpose of this article is to prove Toussaint's
		 conjecture."
}

@inproceedings{osz-tosam-92
, author =	"S. Olariu and J. L. Schwing and J. Zhang"
, title =	"Time-Optimal Sorting and Applications on {$n$}x{$n$} Enhanced Meshes"
, booktitle =	"Proc. 6th Annu. European Comp. Conf."
, month =	may
, year =	1982
, update =	"98.11 bibrelex"
}

@inproceedings{osz-topgc-96
, author =	"S. Olariu and I. Stojmenovic and A. Y. Zomaya"
, title =	"Time-optimal proximity graph computations on enhanced meshes"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"119--124"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{otz-cph-88
, author =	"S. Olariu and S. Toida and M. Zubaer"
, title =	"On a Conjecture by {Plaisted} and {Hong}"
, journal =	"J. Algorithms"
, volume =	9
, number =	4
, year =	1988
, pages =	"597--598"
, annote =	"Shows that~\cite{ph-hta-87} produces
		 triangulations $\Omega(\log n)$ from MLT."
}

@inproceedings{o-es12o-00
, author =	"Vladimir Oliker"
, title =	"Electromagnetic Scattering, {1D/2D} Obstacle Problem, and Discrete Geodesics"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"66--69"
, update =	"00.03 bibrelex"
}

@article{opc-3drcp-96
, author =	"J. M. Oliva and M. Perrin and S. Coquillart"
, title =	"3D Reconstruction of Complex Polyhedral Shapes from Contours Using a Simplified Generalized {Voronoi} Diagram"
, journal =	"Comput. Graph. Forum"
, volume =	15
, number =	3
, year =	1996
, pages =	"397--408"
, update =	"97.11 held"
}

@inproceedings{onm-mfddt-96
, author =	"Antonio Oliveira and Sara do Nascimento and Sonja A. L. Meerbaum"
, title =	"Morphing Fields of Directions Defined on Triangulations to Morph Simple Polygons"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"117--119"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{og-cgvnc-85
, author =	"J. H. Oliver and E. D. Goodman"
, title =	"Color Graphic Verification of {N}/{C} Milling Programs for Sculptured Surfaces"
, booktitle =	"10th Annual Automotive Computer Graphics Conference and Exposition"
, organization =	"Engineering Soceitey of Detroit"
, month =	dec
, year =	1985
, update =	"98.03 bibrelex"
}

@article{ow-oqei-83
, author =	"M. A. Oliver and N. E. Wiseman"
, title =	"Operations on quadtree encoded images"
, journal =	"Comput. J."
, volume =	26
, year =	1983
, pages =	"83--91"
}

@article{ow-oqlri-83
, author =	"M. A. Oliver and N. E. Wiseman"
, title =	"Operations on quadtree leaves and related image areas"
, journal =	"Comput. J."
, volume =	26
, year =	1983
, pages =	"375--380"
}

@article{o-ncbbs-82
, author =	"H. J. Olivie"
, title =	"A new class of balanced binary search trees: half-balanced binary search trees"
, journal =	"RAIRO Informatique Theoretique"
, volume =	16
, year =	1982
, pages =	"51--71"
, update =	"97.11 bibrelex"
}

@article{o-tavc-91
, author =	"A. A. Oloufa"
, title =	"Triangulation applications in volume calculation"
, journal =	"J. Comput. Civil Engrg."
, volume =	5
, year =	1991
, pages =	"103--119"
, update =	"97.11 bibrelex"
}

@article{ot-ppvtd-80
, author =	"E. A. Olszewski and W. J. Thompson"
, title =	"A program for perceptive views of three-dimensional surfaces"
, journal =	"Comput. Phys. Comm."
, volume =	21
, year =	1980
, pages =	"185--191"
}

@techreport{o-fgl-88
, author =	"S. M. Omohundro"
, title =	"Fundamentals of geometric learning"
, type =	"Report"
, number =	"UIUCDCS-R-88-1408"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1988
, keywords =	"geometric learning, robotics, computer vision, intersection"
}

@techreport{o-dtfl-90
, author =	"Stephen M. Omohundro"
, title =	"The {Delaunay} triangulation and function learning"
, type =	"Technical Report"
, number =	"TR-90-001"
, institution =	"International Computer Science Institute"
, address =	"Berkeley, CA"
, year =	1990
, update =	"98.11 bibrelex"
}

@article{o-hcnc-71
, author =	"Patrick E. O'Neil"
, title =	"Hyperplane Cuts of an $n$-cube"
, journal =	"Discrete Math."
, volume =	1
, year =	1971
, pages =	"193--195"
, update =	"94.05 aich"
}

@inproceedings{o-vdddh-96
, author =	"K. Onishi"
, title =	"Voronoi diagram in the $d$-dimensional hyperbolic space"
, booktitle =	"Proc. Internat. Sympos. on Combinatorics and Applications"
, site =	"Tianjin, Japan"
, organization =	"Nankai Univ."
, year =	1996
, pages =	"314--324"
, update =	"98.07 bibrelex"
}

@inproceedings{oi-vdsps-97
, author =	"K. Onishi and H. Imai"
, title =	"Voronoi Diagram in Statistical Parametric Space by Kull\-back-\-Leibler Divergence"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"463--465"
, cites =	"a-dgms-85, cd-vdbcd-85, ct-eit-91, e-acg-87, hk-mic-94, ot-cvduh-96, o-vdddh-96, ps-cgi-85, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{ot-cvduh-96
, author =	"K. Onishi and N. Takayama"
, title =	"Construction of {Voronoi} diagrams on the upper half-plane"
, journal =	"IEICE Trans. Fundamentals"
, volume =	"E79-A"
, number =	4
, year =	1996
, pages =	"533--539"
, update =	"98.07 bibrelex"
}

@article{o-gccrp-91
, author =	"S. Onn"
, title =	"On the geometry and computational complexity of {Radon} partitions in the integer lattice"
, journal =	"SIAM J. Discrete Math."
, volume =	4
, year =	1991
, pages =	"436--447"
, keywords =	"abstract convexity, convexity spaces, geometry of numbers, Radon number, Radon partition, lattice polytopes, integer programming, integer lattice"
, succeeds =	"o-rnil-90"
}

@inproceedings{o-rnil-90
, author =	"S. Onn"
, title =	"On the {Radon} number of the integer lattice"
, editor =	"Ravi Kannan and W. R. Pulleyblank"
, booktitle =	"Integer Programmming and Combinatorial Optimization"
, publisher =	"Univ. Waterloo Press"
, address =	"Waterloo, ON"
, year =	1990
, pages =	"385--396"
, keywords =	"abstract convexity, convexity spaces, geometry of numbers, Radon number, Radon partition, lattice polytopes, integer programming, integer lattice"
, precedes =	"o-gccrp-91"
, update =	"97.03 rote"
}

@article{os-qst-94
, author =	"S. Onn and B. Sturmfels"
, title =	"A quantitative {Steinitz}' theorem"
, journal =	"{Beitr\"age} zur Algebra und Geometrie / Contributions to Algebra and Geometry"
, volume =	35
, year =	1994
, pages =	"125--129"
, keywords =	"graph drawing, 3D, grid, convex"
, update =	"96.09 tamassia"
}

@mastersthesis{o-mcarg-96
, author =	"T. Ono"
, title =	"A {Markov} Chain Approach to Random Generation of Triangulation"
, school =	"Dept. Inform. Sci., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1996
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{o-ewptt-94
, author =	"T. Ono"
, title =	"An Eight-Way Perturbation Technique for the Three-Dimensional Convex Hull"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"159--164"
, cites =	"d-iafch-90, d-i2dch-90, em-sstcd-88, ph-chfsp-77, y-gctsp-88, y-stgd-, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{okmhsniiia-pt-96
, author =	"T. Ono and Y. Kyoda and T. Masada and K. Hayase and T. Shibuya and M. Nakade and M. Inaba and H. Imai and K. Imai and D. Avis"
, title =	"A package for triangulations"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V17--V18"
, cites =	"almp-gsgv-95, af-pachv-92, k-sgmwt-96, mii-ert-96, o-mcarg-96, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@mastersthesis{o-nridc-90
, author =	"Y. Ooishi"
, title =	"Numerically robust implementation of the divide-and-conquer algorithm for constructing {Voronoi} diagrams"
, school =	"Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo"
, address =	"Tokyo, Japan"
, year =	1990
, note =	"Bachelor's Thesis in Japanese"
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@techreport{o-lassm-85
, author =	"B. J. Oommen"
, title =	"A learning automation solution to the stochastic minimum spanning circle problem"
, type =	"Report"
, number =	"SCS-TR-81"
, institution =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1985
}

@techreport{oirk-rnutu-86
, author =	"B. J. Oommen and S. S. Iyengar and S. V. Rao and R. L. Kashyap"
, title =	"Robot Navigation in Unknown Terrains Using Learned Visibility Graphs. Part {I}: {T}he Disjoint Convex Obstacle Case"
, number =	"SCS-TR-86"
, institution =	"School of Computer Science, Carleton University"
, month =	feb
, year =	1986
, update =	"96.05 agarwal"
}

@techreport{or-pteot-85
, author =	"B. J. Oommen and I. Reichstein"
, title =	"On the problem of translating an elliptic object through a workspace of elliptic obstacles"
, type =	"Report"
, number =	"SCS-TR-79"
, institution =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1985
}

@inproceedings{o-rtbmo-94
, author =	"P. van Oosterom"
, title =	"An {R}-Tree Based Map-Overlay Algorithm"
, booktitle =	"Proc. EGIS '94"
, year =	1994
, pages =	"318--327"
, update =	"96.09 kreveld"
}

@article{op-csppa-94
, author =	"K. Opitz and H. Pottmann"
, title =	"Computing shortest paths on polyhedra: applications in geometric modeling and scientific visualization"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"165--178"
, keywords =	"shortest paths, scattered data, interpolation, surface approximation, exponential map"
, update =	"96.09 devillers+orourke"
}

@inproceedings{o-csqpt-90
, author =	"J. Orenstein"
, title =	"A comparison of spatial query processing techniques for native and parameter spaces"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1990
, pages =	"343--352"
, update =	"97.07 agarwal"
}

@inproceedings{om-cdsas-84
, author =	"J. Orenstein and T. H. Merrett"
, title =	"A class of data structures for associative searching"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1984
, pages =	"181--190"
, update =	"97.07 agarwal"
}

@article{o-mtuas-82
, author =	"J. A. Orenstein"
, title =	"Multidimensional tries used for associative searching"
, journal =	"Inform. Process. Lett."
, volume =	13
, year =	1982
, pages =	"150--157"
}

@incollection{o-at-91
, author =	"P. Orlik"
, title =	"Arrangements in topology"
, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
, publisher =	"American Mathematical Society, Association for Computing Machinery"
, address =	"Providence, RI"
, year =	1991
, pages =	"263--272"
, update =	"99.11 bibrelex, 98.07 agarwal"
}

@book{o-ia-89
, author =	"Peter Orlik"
, title =	"Introduction to Arrangements"
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1989
, isbn =	"0-8218-0723-4"
, update =	"96.01 mitchell"
, annote =	"13.00"
}

@article{os-ctch-80
, author =	"Peter Orlik and L. Solomon"
, title =	"Combinatorics and topology of complements of hyperplanes"
, journal =	"Invent. Math."
, volume =	59
, year =	1980
, pages =	"77--94"
, update =	"98.07 agarwal"
}

@book{ot-ah-91
, author =	"Peter Orlik and Hiroaki Terao"
, title =	"Arrangements of Hyperplanes"
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1991
, update =	"98.07 agarwal"
}

@article{o-chaps-85
, author =	"M. Orlowski"
, title =	"A convex hull algorithm for planar simple polygons"
, journal =	"Pattern Recogn."
, volume =	18
, year =	1985
, pages =	"361--366"
}

@article{o-naler-90
, author =	"M. Orlowski"
, title =	"A new algorithm for the largest empty rectangle problem"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"65--73"
, keywords =	"area"
, annote =	"$O(n \log n)$ expected time, $O(n)$ space"
}

@article{o-cssch-83
, author =	"M. Orlowski"
, title =	"On the conditions for success of {Sklansky}'s convex hull algorithm"
, journal =	"Pattern Recogn."
, volume =	16
, year =	1983
, pages =	"579--586"
}

@techreport{o-lbml-85
, author =	"J. O'Rourke"
, title =	"A lower bound on moving a ladder"
, type =	"Report"
, number =	"JHU/EECS-85/20"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1985
, keywords =	"motion planning, lower bounds, ladder"
}

@techreport{o-nftvpl-97
, author =	"J. O'Rourke"
, title =	"A note on fully-turned vertex $\pi$-lights"
, type =	"Technical {Report}"
, number =	056
, institution =	"Dept. Comput. Sci., Smith College"
, month =	oct
, year =	1997
, keywords =	"art gallery theorems, floodlights"
, update =	"97.11 orourke"
}

@techreport{o-nmccp-82
, author =	"J. O'Rourke"
, title =	"A note on minimum convex covers for polygons"
, type =	"Report"
, number =	"JHU-EECS 82-3"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1982
}

@article{o-6369-81
, author =	"Joseph O'Rourke"
, title =	"Advanced Problem 6369"
, journal =	"Amer. Math. Monthly"
, volume =	88
, number =	10
, year =	1981
, pages =	769
, comments =	"The sum of square roots problem"
, update =	"01.11 orourke"
}

@article{o-aprag-83
, author =	"J. O'Rourke"
, title =	"An alternative proof of the rectilinear art gallery theorem"
, journal =	"J. Geom."
, volume =	21
, year =	1983
, pages =	"118--130"
, keywords =	"covering, star-shaped"
}

@inproceedings{o-ecala-01
, author =	"Joseph O'Rourke"
, title =	"An Extension of {Cauchy}'s Arm Lemma with Application to Curve Development"
, booktitle =	"Discrete Comput. Geom."
, series =	"Lecture Notes Comput. Sci."
, volume =	2098
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"280--291"
, note =	"Papers from the Japan Conf. Discrete Comput. Geom., Tokyo, Nov. 2000"
, update =	"01.11 orourke, 01.07 orourke"
}

@article{o-olafs-81
, author =	"J. O'Rourke"
, title =	"An on-line algorithm for fitting straight lines between data ranges"
, journal =	"Commun. ACM"
, volume =	24
, year =	1981
, pages =	"574--578"
, keywords =	"stabbing"
}

@book{o-agta-87
, author =	"J. O'Rourke"
, title =	"Art Gallery Theorems and Algorithms"
, series =	"The International Series of Monographs on Computer Science"
, publisher =	"Oxford University Press"
, address =	"New York, NY"
, year =	1987
, keywords =	"visibility, decomposition, covering, partition, geometric graphs"
, update =	"98.11 bibrelex"
}

@inproceedings{o-avfdd-81
, author =	"J. O'Rourke"
, title =	"Automatic visual focusing via a dynamic data structure"
, booktitle =	"Proc. 1981 Conf. Info. Sciences and Systems"
, month =	mar
, year =	1981
, pages =	"301--106"
, keywords =	"$k$-d trees, computer vision"
}

@article{o-cg-88
, author =	"J. O'Rourke"
, title =	"Computational geometry"
, journal =	"Annu. Rev. Comput. Sci."
, volume =	3
, year =	1988
, pages =	"389--411"
, keywords =	"survey paper, convex hull, Voronoi diagrams, Delaunay triangulations, arrangements, polygons, triangulation, range search, point location, motion planning, Davenport-Schinzel sequences, parallel computation"
}

% 1 through 9 use ~ placeholder to sort before 10
@article{o-cgc1-86
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~1"
, journal =	"SIGACT News"
, volume =	18
, number =	1
, year =	1986
, pages =	"17--19"
, note =	"Also in Computer Graphics 20(1986), 232."
, update =	"93.09 erickson"
, annote =	"Report on the 2nd ACM Sympos. Comput. Geom."
}

@article{o-cgc2-87
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~2"
, journal =	"SIGACT News"
, volume =	18
, number =	2
, year =	1987
, pages =	"10--12"
, note =	"Also in Computer Graphics 21(1987), 155--157."
, annote =	"Old and new problems"
}

@article{o-cgc3-87
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~3"
, journal =	"SIGACT News"
, volume =	18
, number =	4
, year =	1987
, pages =	"13--15"
, note =	"Also in Computer Graphics 21(1987), 314--315."
, annote =	"Old and new problems"
}

@article{o-cgc4-88
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~4"
, journal =	"SIGACT News"
, volume =	19
, number =	2
, year =	1988
, pages =	"22--24"
, note =	"Also in Computer Graphics 22(1988), 111--112."
, keywords =	"hidden line elimination, Delaunay triangulations, link distance, stabbing"
, annote =	"Old and new problems"
}

@article{o-cgc5-88
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~5"
, journal =	"SIGACT News"
, volume =	19
, number =	"3--4"
, year =	1988
, pages =	"21--26"
, annote =	"Open problems from the 4th ACM Sympos. Comput. Geom."
}

@article{o-cgc6-89
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~6"
, journal =	"SIGACT News"
, volume =	20
, number =	2
, year =	1989
, pages =	"10--12"
, annote =	"Old and new problems"
}

@article{o-cgc7-89
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~7"
, journal =	"SIGACT News"
, volume =	20
, number =	3
, year =	1989
, pages =	"25--26"
, annote =	"Open problems from the 5th ACM Sympos. Comput. Geom."
}

@article{o-cgc8-89
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~8"
, journal =	"SIGACT News"
, volume =	20
, number =	4
, year =	1989
, pages =	30
, keywords =	"distance"
, annote =	"Error corrections"
}

@article{o-cgc9-90
, author =	"J. O'Rourke"
, title =	"Computational geometry column ~9"
, journal =	"SIGACT News"
, volume =	21
, number =	1
, year =	1990
, pages =	"18--20"
, keywords =	"hidden surface elimination, visibility, triangulations, robotics, stabbing, shape"
, annote =	"Old and new problems"
}

@article{o-cgc10-90
, author =	"J. O'Rourke"
, title =	"Computational geometry column 10"
, journal =	"SIGACT News"
, volume =	21
, number =	3
, year =	1990
, pages =	"22--25"
, annote =	"Open problems from the 6th ACM Sympos. Comput. Geom."
}

@article{o-cgc11-91
, author =	"J. O'Rourke"
, title =	"Computational geometry column 11"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	1
, year =	1991
, pages =	"93--98"
, note =	"Also in SIGACT News 21:4 (1990), 22--25"
, keywords =	"shape, robotics, motion planning, arrangements, partition"
, annote =	"Problems, old and new"
}

@article{o-cgc12-91
, author =	"J. O'Rourke"
, title =	"Computational geometry column 12"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	2
, year =	1991
, pages =	"197--200"
, note =	"Also in SIGACT News 22:2 (1991), 26--29"
, keywords =	"Voronoi diagrams, arrangements, visibility, Delaunay triangulations, path planning, shortest paths, separation"
, annote =	"Seven open problems from various sources"
}

@article{o-cgc12-91a
, author =	"J. O'Rourke"
, title =	"Computational geometry column 12"
, journal =	"{SIGACT} News"
, volume =	22
, number =	2
, year =	1991
, pages =	"26--29"
, update =	"98.11 bibrelex"
}

@article{o-cgc13-91
, author =	"J. O'Rourke"
, title =	"Computational geometry column 13"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	3
, year =	1991
, pages =	"341--343"
, note =	"Also in SIGACT News 22:3 (1991), 13--15"
, annote =	"Open problems from the 7th ACM Sympos. Comput. Geom."
}

@article{o-cgc14-91
, author =	"J. O'Rourke"
, title =	"Computational geometry column 14"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	4
, year =	1991
, pages =	"517--522"
, note =	"Also in SIGACT News 23:1 (1992), 5--9"
, annote =	"Abstracts of papers from the 3rd Canad. Conf. Comput.
		 Geom."
}

@article{o-cgc15-92
, author =	"J. O'Rourke"
, title =	"Computational geometry column 15"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	2
, year =	1992
, pages =	"215--217"
, note =	"Also in SIGACT News 23:2 (1992)"
, keywords =	"visibility"
, annote =	"Art gallery theorems"
}

@article{o-cgc16-92
, author =	"J. O'Rourke"
, title =	"Computational geometry column 16"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"335--339"
, note =	"Also in SIGACT News 23:3 (1992)"
, annote =	"Summary of 8th ACM Sympos. Comput. Geom."
}

@article{o-cgc17-92
, author =	"J. O'Rourke"
, title =	"Computational geometry column 17"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, year =	1992
, pages =	"443--447"
, note =	"Also in SIGACT News 23:4 (1992), 2--4"
, update =	"93.05 orourke"
, annote =	"Summary of 4th Canad. Conf. Comput. Geom."
}

@article{o-cgc18-93
, author =	"J. O'Rourke"
, title =	"Computational geometry column 18"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, number =	1
, year =	1993
, pages =	"107--113"
, note =	"Also in SIGACT News 24:1 (1993), 20--25"
, update =	"98.11 bibrelex, 93.05 orourke"
, annote =	"Visibility graphs"
}

@article{o-cgc18-93a
, author =	"J. O'Rourke"
, title =	"Computational geometry column 18"
, journal =	"SIGACT News 24"
, volume =	24
, number =	1
, year =	1993
, pages =	"20--25"
, update =	"98.11 bibrelex"
}

@article{o-cgc19-93
, author =	"J. O'Rourke"
, title =	"Computational geometry column 19"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, number =	1
, year =	1993
, pages =	"221--224"
, note =	"Also in SIGACT News 24:2 (1993), 15--17"
, update =	"98.11 bibrelex, 94.01 orourke"
, annote =	"Description of computational geometry bibliography"
}

@article{o-cgc20-93
, author =	"J. O'Rourke"
, title =	"Computational geometry column 20"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"347--349"
, note =	"Also in SIGACT News 24:3 (1993), 21--22"
, update =	"94.01 orourke"
, annote =	"Open problems from the 9th Annu. ACM Sympos. Comput. Geom."
}

@article{o-cgc21-93
, author =	"J. O'Rourke"
, title =	"Computational geometry column 21"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"463--465"
, note =	"Also in SIGACT News 24:4 (1993), 14--15"
, update =	"96.09 devillers, 94.05 devillers+orourke, 94.01 orourke"
, annote =	"Open problems from the 5th Canad. Conf. Comput. Geom."
}

@article{o-cgc22-94
, author =	"J. O'Rourke"
, title =	"Computational geometry column 22"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"119--122"
, note =	"Also in SIGACT News 25:1 (1994), 31--33"
, update =	"94.09 lambert, 94.05 devillers+orourke"
, annote =	"$n^2$-hard problems"
}

@article{o-cgc23-94
, author =	"J. O'Rourke"
, title =	"Computational geometry column 23"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"239--242"
, note =	"Also in SIGACT News 25:3 (1994), 24--27"
, update =	"95.01 orourke"
, annote =	"Open problems on tetrahedralization"
}

@article{o-cgc24-94
, author =	"J. O'Rourke"
, title =	"Computational geometry column 24"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"363--366"
, note =	"Also in SIGACT News 25:4 (1994), 12--14"
, update =	"95.01 orourke"
, annote =	"Open problems from 10th SoCG and 6th CCCG"
}

@article{o-cgc25-95
, author =	"J. O'Rourke"
, title =	"Computational geometry column 25"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"215--218"
, note =	"Also in SIGACT News 26:1 (1995), 14--16"
, update =	"95.05 orourke"
, annote =	"Lower envelope of surfaces: new complexity bounds"
}

@article{o-cgc26-95
, author =	"J. O'Rourke"
, title =	"Computational geometry column 26"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"339--341"
, note =	"Also in SIGACT News 26:2 (1995), 15--17"
, update =	"96.01 orourke, 95.05 orourke"
, annote =	"An advance on Conway's Thrackle conjecture"
}

@article{o-cgc27-96
, author =	"J. O'Rourke"
, title =	"Computational geometry column 27"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"123--125"
, note =	"Also in SIGACT News 26:4 (1995), 19--21"
, update =	"96.05 orourke, 96.01 orourke"
, annote =	"Perfect matching between edges of triangulations"
}

@article{o-cgc28-96
, author =	"J. O'Rourke"
, title =	"Computational geometry column 28"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"243--244"
, note =	"Also in SIGACT News 27:2 (1996) 18--19"
, update =	"97.03 orourke, 96.09 devillers+orourke"
, annote =	"Web directory of Computational Geometry Software"
}

@article{o-cgc29-96
, author =	"J. O'Rourke"
, title =	"Computational geometry column 29"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"507--511"
, note =	"Also in SIGACT News, 27(3):55--59 (1996), Issue 100"
, update =	"97.03 agarwal+orourke, 96.09 orourke"
, annote =	"Past accomplishments of Computational Geometry are reviewed
		and future directions adumbrated."
}

@article{o-cgc30-97
, author =	"J. O'Rourke"
, title =	"Computational geometry column 30"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"165--166"
, note =	"Also in SIGACT News, 28(1):7--8 (1997), Issue 102"
, update =	"97.07 orourke, 97.03 orourke"
, annote =	"Several results from {\em Combinatorial Geometry}
		(J. Pach and P.K. Agarwal) are detailed."
}

@article{o-cgc31-97
, author =	"J. O'Rourke"
, title =	"Computational geometry column 31"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"379--382"
, note =	"Also in SIGACT News, 28(2):20--23 (1997), Issue 103"
, keywords =	"packing, spheres"
, update =	"98.03 orourke, 97.07 orourke"
, annote =	"Sphere packing work of Neil Sloane et al."
}

@article{o-cgc32-97
, author =	"J. O'Rourke"
, title =	"Computational geometry column 32"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"509--513"
, note =	"Also in SIGACT News, 28(3):12--17 (1997), Issue 104"
, keywords =	"k-sets, arrangements"
, update =	"98.03 orourke"
, annote =	"Dey's new $k$-set bound is illustrated."
}

@article{o-cgc33-98
, author =	"J. O'Rourke"
, title =	"Computational geometry column 33"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1999
, pages =	"381--384"
, note =	"Also in SIGACT News, 29(2):12-16 (1998), Issue 107"
, update =	"00.03 orourke"
, annote =	"Two results in ``computational origami'' are illustrated."
}

@article{ao-cgc34-98
, author =	"J. O'Rourke"
, title =	"Computational geometry column 34"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"??"
, year =	1999
, pages =	"??--??"
, note =	"Also in SIGACT News, 29(3):27--32 (1998), Issue 108"
, update =	"00.03 orourke"
, annote =	"Problems presented at the open-problem session of the
		14th Annual ACM Symposium on Computational Geometry are listed."
}

@article{o-cgc35-99
, author =	"J. O'Rourke"
, title =	"Computational geometry column 35"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"??"
, year =	1999
, pages =	"??--??"
, note =	"Also in SIGACT News, 30(2):31-32 (1999), Issue 111"
, keywords =	"shortest paths"
, update =	"00.03 orourke"
, annote =	"The subquadratic algorithm of Kapoor for finding shortest
		paths on a polyhedron is described."
}

@article{o-cgc36-99
, author =	"J. O'Rourke"
, title =	"Computational geometry column 36"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, number =	6
, year =	1999
, pages =	"615--618"
, note =	"Also in SIGACT News, 30(3):35--38 (1999), Issue 112"
, update =	"00.11 smid, 00.07 orourke, 00.03 orourke"
, annote =	"Two results in ``computational origami'' are illustrated."
}

@article{o-cgc38-00
, author =	"J. O'Rourke"
, title =	"Computational geometry column 38"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, number =	2
, year =	2000
, pages =	"221--223"
, note =	"Also in SIGACT News, 31(1):28--30 (2000), Issue 114"
, update =	"00.11 smid, 00.07 orourke"
, annote =	"Recent results on curve reconstruction are described."
}

@article{o-cgc39-00
, author =	"J. O'Rourke"
, title =	"Computational geometry column 39"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, number =	4
, year =	2000
, pages =	"441--444"
, note =	"Also in SIGACT News, 31(3):47--49 (2000), Issue 116"
, update =	"01.04 orourke+pocchiola"
, annote =	"The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane."
}

@article{o-cgc40-00
, author =	"J. O'Rourke"
, title =	"Computational geometry column 40"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, number =	6
, year =	2000
, pages =	"649--651"
, note =	"Also in SIGACT News, 31(4):62--64 (2000), Issue 117"
, update =	"01.07 orourke, 01.04 orourke"
, annote =	"It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a
small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed."
}

@article{o-cgc41-01
, author =	"J. O'Rourke"
, title =	"Computational geometry column 41"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"??"
, number =	"??"
, year =	2001
, pages =	"??--??"
, note =	"Also in SIGACT News,  32(1):53-55 (2001), Issue 118"
, update =	"01.07 orourke"
, annote =	"The recent result that $n$ congruent balls in $R^d$
	have at most 4 distinct geometric permutations is described."
}

@book{o-cgc-94
, author =	"J. O'Rourke"
, title =	"Computational Geometry in {C}"
, edition =	"1st"
, publisher =	"Cambridge University Press"
, year =	1994
, comments =	"ISBN 0-521-44592-2/Pb \$24.95,
		ISBN 0-521-44034-3/Hc \$49.95.
		Cambridge University Press,
		40 West 20th Street,
		New York, NY 10011-4211,
		1-800-872-7423.
		346+xi pages, 228 exercises, 200 figures, 219 references.
		C code and errata available by anonymous ftp from
		grendel.csc.smith.edu (131.229.222.23),
		in the directory /pub/compgeom.
		Third Printing: Dec. 1995.
		Chapter titles:
		1. Polygon triangulation
		2. Polygon partitioning
		3. Convex hulls in two dimensions
		4. Convex hulls in three dimensions
		5. Voronoi diagrams
		6. Arrangements
		7. Search and intersection
		8. Motion planning
		9. Additional topics"
, update =	"99.11 bibrelex, 97.07 orourke, 96.05 efrat, 96.01 orourke, 95.05 orourke, 95.01 orourke, 94.05 orourke, 94.01 orourke, 95.05 orourke"
, annote =	"Textbook"
}

@book{o-cgc-98
, author =	"J. O'Rourke"
, title =	"Computational Geometry in {C}"
, edition =	"2nd"
, publisher =	"Cambridge University Press"
, year =	1998
, url =	"http://cs.smith.edu/~orourke/books/compgeom.html"
, comments =	"Printed 28 Sep 1998"
, update =	"01.11 orourke, 99.11 bibrelex, 98.11 orourke"
, annote =	"Textbook"
}

@article{o-crngl-82
, author =	"J. O'Rourke"
, title =	"Computing the relative neighborhood graph in the {$L_{1}$} and {$L_{\infty}$} metrics"
, journal =	"Pattern Recogn."
, volume =	15
, year =	1982
, pages =	"189--192"
, keywords =	"geometric graphs"
}

@inproceedings{o-chvdt-84
, author =	"J. O'Rourke"
, title =	"Convex hulls, {Voronoi} diagrams, and terrain navigation"
, booktitle =	"Proc. 9th Pecora Sympos. Spatial Inform. Tech."
, year =	1984
, pages =	"358--361"
, keywords =	"shortest paths"
}

@article{o-cmca-85
, author =	"J. O'Rourke"
, title =	"Counterexamples to a minimal circumscription algorithm"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	30
, month =	jun
, year =	1985
, pages =	"364--366"
, keywords =	"triangles, area, approximation"
}

@techreport{o-dqsam-81
, author =	"J. O'Rourke"
, title =	"Dynamically quantized spaces applied to motion analysis"
, type =	"Technical {Report}"
, number =	"JHU-EE 81-1"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	jan
, year =	1981
, keywords =	"$k$-d trees, computer vision"
}

@inproceedings{o-dqsfh-81
, author =	"J. O'Rourke"
, title =	"Dynamically quantized spaces for focusing the {Hough} transform"
, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
, year =	1981
, pages =	"737--739"
, keywords =	"cluster analysis"
}

@article{o-frca-90
, author =	"J. O'Rourke"
, title =	"Feature {Review}: {The} complexity of arrangements"
, journal =	"ACM Comput. Rev."
, volume =	31
, number =	12
, month =	dec
, year =	1990
, pages =	"654--657"
, keywords =	"arrangements, combinatorial complexity, zones"
}

@techreport{o-fslps-87
, author =	"J. O'Rourke"
, title =	"Finding a shortest ladder path: a special case"
, type =	"{IMA} {Preprint} {Series}"
, number =	353
, institution =	"Inst. Math. Appl., Univ. Minnesota"
, address =	"Minneapolis, MN"
, year =	1987
, keywords =	"motion planning, ladder"
}

@techreport{o-fmeb-84
, author =	"J. O'Rourke"
, title =	"Finding Minimal Enclosing Boxes"
, type =	"Technical {Report}"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{o-fmeb-85
, author =	"J. O'Rourke"
, title =	"Finding minimal enclosing boxes"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	14
, month =	jun
, year =	1985
, pages =	"183--199"
, keywords =	"approximation, volume"
}

@article{o-fmeb-86
, author =	"Joseph O'Rourke"
, title =	"Finding Minimal Enclosing Boxes"
, journal =	"Internat. J. Comput. Info. Sci."
, volume =	14
, number =	3
, month =	feb
, year =	1986
, pages =	"183--199"
, update =	"01.04 orourke"
}

@inproceedings{o-fucg-98
, author =	"J. O'Rourke"
, title =	"Folding and Unfolding in Computational Geometry"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
, site =	"Tokyo"
, month =	dec
, year =	1998
, pages =	"142--147"
, note =	"Revised version to appear in LNCS"
, update =	"01.04 orourke, 00.11 smid, 00.07 icking, 00.03 orourke, 99.03 orourke, 98.11 orourke"
}

@inproceedings{o-fucg-00
, author =	"Joseph O'Rourke"
, title =	"Folding and unfolding in computational geometry"
, booktitle =	"Discrete Comput. Geom."
, series =	"Lecture Notes Comput. Sci."
, volume =	1763
, publisher =	"Springer-Verlag"
, year =	2000
, pages =	"258--266"
, note =	"Papers from the Japan Conf. Discrete Comput. Geom., Tokyo, Dec. 1998"
, succeeds =	"o-fucg-98"
, update =	"01.11 orourke, 01.04 icking, 00.11 smid, 00.07 orourke"
}

@article{o-gnfmg-83
, author =	"J. O'Rourke"
, title =	"Galleries need fewer mobile guards: a variation on {Chv{\'a}tal}'s theorem"
, journal =	"Geom. Dedicata"
, volume =	14
, year =	1983
, pages =	"273--283"
, keywords =	"covering, star-shaped"
}

@incollection{o-gcs-94
, author =	"J. O'Rourke"
, title =	"Guarding corpulent stars"
, booktitle =	"Snapshots of Computational and Discrete Geometry"
, volume =	3
, publisher =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, month =	jul
, year =	1994
, pages =	"63--71"
, note =	"Technical Report SOCS-94.50"
, keywords =	"visibility, art gallery theorems"
, comments =	"Also Technical Report 032, Dept. Comput. Sci., Smith College"
, update =	"96.05 orourke, 96.01 orourke, 94.09 orourke"
, annote =	"I've been informed of an error by H. Meijer, but haven't worked on it."
}

@techreport{o-mccps-82
, author =	"J. O'Rourke"
, title =	"Minimum convex cover for polygons: some counterexamples"
, type =	"Report"
, number =	"JHU-EE 82-1"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1982
}

@inproceedings{o-mduht-81
, author =	"J. O'Rourke"
, title =	"Motion detection using {Hough} techniques"
, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
, year =	1981
, pages =	"82--87"
, keywords =	"computer vision, cluster analysis"
}

@techreport{o-dipp-00
, author =	"J. O'Rourke"
, title =	"On the Development of the Intersection of a Plane with a Polytope"
, type =	"Technical {Report}"
, number =	068
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	jun
, year =	2000
, note =	"LANL arXiv cs.CG/0006035 v3,
		\url{http://cs.smith.edu/~orourke/papers.html}"
, url =	"http://cs.smith.edu/~orourke/papers.html"
, archive =	"LANL arXiv cs.CG/0006035 v3"
, keywords =	"polygonal chains, polytopes, polyhedra"
, cites =	"c-cses-89, s-usedkkk-21"
, update =	"01.04 orourke, 00.11 smid, 00.07 orourke"
}

@techreport{o-shrs-93
, author =	"J. O'Rourke"
, title =	"On the scaling heuristic for reconstruction from slices"
, type =	"Technical {Report}"
, number =	029
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	jun
, year =	1993
, keywords =	"triangulations, polyhedra, surface reconstruction"
, update =	"94.01 orourke, 93.09 milone+mitchell"
}

%, number =	3
@article{o-shrs-94
, author =	"J. O'Rourke"
, title =	"On the scaling heuristic for reconstruction from slices"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	56
, month =	sep
, year =	1994
, pages =	"420--423"
, keywords =	"triangulations, polyhedra, surface reconstruction"
, succeeds =	"o-shrs-93"
, update =	"95.01 orourke"
}

@incollection{o-opcvi-99
, author =	"J. O'Rourke"
, title =	"Open problems in the combinatorics of visibility and illumination"
, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
, booktitle =	"Advances in Discrete and Computational Geometry"
, series =	"Contemporary Mathematics"
, volume =	223
, publisher =	"American Mathematical Society"
, address =	"Providence"
, year =	1999
, pages =	"237--243"
, update =	"00.03 smid, 99.07 orourke, 97.11 orourke"
}

@article{o-pdsfm-82
, author =	"J. O'Rourke"
, title =	"Polygon decomposition and switching function minimization"
, journal =	"Comput. Graph. Image Process."
, volume =	18
, year =	1982
, pages =	"382--391"
, keywords =	"decomposition"
}

@inproceedings{o-pma3d-81
, author =	"J. O'Rourke"
, title =	"Polyhedra of minimal area as $3$-d object models"
, editor =	"Patrick J. Hayes"
, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
, publisher =	"William Kaufmann"
, year =	1981
, pages =	"664--666"
, keywords =	"polyhedra, area"
, update =	"97.11 bibrelex"
}

@techreport{o-pom3d-80
, author =	"J. O'Rourke"
, title =	"Polyhedral Object Models from $3$-D Points"
, type =	"Technical {Report}"
, number =	"IFI-HH-M-77/80"
, institution =	"Universit{\"a}t Hamburg"
, address =	"Hamburg, Germany"
, month =	jul
, year =	1980
, update =	"98.03 bibrelex"
}

@techreport{o-ropv-85
, author =	"J. O'Rourke"
, title =	"Reconstruction of orthogonal polygons from vertices"
, type =	"Report"
, number =	"JHU-EECS 85-13"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1985
}

@techreport{o-rcvg-90
, author =	"J. O'Rourke"
, title =	"Recovery of convexity from visibility graphs"
, type =	"Technical {Report}"
, number =	"90.4.6"
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	apr
, year =	1990
, keywords =	"visibility graphs, convexity"
}

@inproceedings{o-ccmcc-82
, author =	"J. O'Rourke"
, title =	"The complexity of computing minimum convex covers for polygons"
, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
, year =	1982
, pages =	"75--84"
, keywords =	"decomposition, covering"
}

@techreport{o-dccp-82
, author =	"J. O'Rourke"
, title =	"The decidability of covering by convex polygons"
, type =	"Report"
, number =	"JHU-EECS 82-4"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1982
}

@techreport{o-ftcgc-90
, author =	"J. O'Rourke"
, title =	"The first ten computational geometry columns"
, type =	"Technical Report"
, number =	4
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, year =	1990
, annote =	"Unedited copies of the first ten columns"
}

@article{o-spc-86
, author =	"J. O'Rourke"
, title =	"The signature of a plane curve"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"34--51"
, keywords =	"length, pattern recognition"
}

@incollection{o-uocd-88
, author =	"J. O'Rourke"
, title =	"Uniqueness of orthogonal connect-the-dots"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"97--104"
, keywords =	"pattern recognition"
}

@techreport{o-uocd-86
, author =	"J. O'Rourke"
, title =	"Uniqueness of orthogonal connected-the-dots"
, institution =	"Johns Hokins Univ."
, address =	"Baltimore, MD"
, year =	1986
, update =	"98.03 bibrelex"
}

@inproceedings{o-vplmm-97
, author =	"Joseph O'Rourke"
, title =	"Vertex $\pi$-Lights for Monotone Mountains"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"1--5"
, keywords =	"art gallery theorems, floodlights, monotone polygons"
, update =	"97.11 orourke, 97.07 orourke"
}

@incollection{o-v-97
, author =	"J. O'Rourke"
, title =	"Visibility"
, chapter =	25
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"467--480"
, update =	"97.11 icking+orourke, 97.07 orourke, 97.03 orourke"
}

@techreport{oamb-oafme-84
, author =	"J. O'Rourke and A. Aggarwal and S. Maddila and M. Baldwin"
, title =	"An optimal algorithm for finding minimal enclosing triangles"
, type =	"Technical {Report}"
, number =	"JHU/EECS-84/08"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{oamb-oafme-86
, author =	"J. O'Rourke and A. Aggarwal and S. Maddila and M. Baldwin"
, title =	"An optimal algorithm for finding minimal enclosing triangles"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"258--269"
, keywords =	"triangles, area, approximation"
}

@article{ob-dtdos-79
, author =	"J. O'Rourke and N. I. Badler"
, title =	"Decomposition of three-dimensional objects into spheres"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-1"
, year =	1979
, pages =	"295--305"
, keywords =	"decomposition, spheres"
}

@article{ob-mbiah-80
, author =	"J. O'Rourke and N. I. Badler"
, title =	"Model-based image analysis of human motion using constraint propagation"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-2"
, year =	1980
, pages =	"522--536"
, keywords =	"computer vision"
}

@article{obw-cdnh-87
, author =	"J. O'Rourke and H. Booth and R. Washington"
, title =	"Connect-the-dots: {A} new heuristic"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	39
, year =	1987
, pages =	"258--266"
, keywords =	"pattern recognition, Delaunay triangulations, Hamiltonian cycles"
, update =	"00.03 orourke"
}

@techreport{obw-cdnh-84
, author =	"J. O'Rourke and H. Booth and R. Washington"
, title =	"Connected-the-Dots: {A} New Heuristic"
, type =	"Technical {Report}"
, number =	"JHU/EECS-84/11"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1984
, update =	"98.03 bibrelex"
}

@article{ocon-nlaic-82
, author =	"J. O'Rourke and C.-B. Chien and T. Olson and D. Naddor"
, title =	"A new linear algorithm for intersecting convex polygons"
, journal =	"Comput. Graph. Image Process."
, volume =	19
, year =	1982
, pages =	"384--391"
, keywords =	"intersection, polygons"
}

@techreport{os-ppnph3d-99
, author =	"J. O'Rourke and {the Smith Problem Solving Group}"
, title =	"{PushPush} is {NP}-hard in {3D}"
, number =	064
, institution =	"Smith College, Northampton, MA"
, month =	nov
, year =	1999
, note =	"LANL XXX archive cs.CG/9911013"
, archive =	"XXX:cs.CG/9911013"
, cites =	"do-mpams-92"
, update =	"00.03 orourke"
}

@article{okm-ccs-86
, author =	"J. O'Rourke and S. R. Kosaraju and N. Megiddo"
, title =	"Computing circular separability"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"105--113"
, keywords =	"circles, separation, design of algorithms, prune-and-search"
}

@inproceedings{op-zps-98
, author =	"J. O'Rourke and I. Pashchenko"
, title =	"Zero-Parity Stabbing Information"
, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
, site =	"Tokyo"
, month =	dec
, year =	1998
, pages =	"93--97"
, note =	"To appear"
, keywords =	"visibility graphs"
, update =	"00.11 smid, 00.07 icking, 99.03 orourke, 98.11 orourke"
}

@inproceedings{opt-nlrm-01
, author =	"Joseph O'Rourke and Irena Pashchenko and Geetika Tewari"
, title =	"Partitioning Orthogonal Polygons into Fat Rectangles"
, booktitle =	"Proc. 13th Canad. Conf. Comput. Geom."
, site =	"Waterloo"
, year =	2001
, pages =	"??--??"
, update =	"02.03 icking, 01.07 orourke"
}

@inproceedings{op-nlrm-01
, author =	"Joseph O'Rourke and Octavia Petrovici"
, title =	"Narrowing Light Rays with Mirrors"
, booktitle =	"Proc. 13th Canad. Conf. Comput. Geom."
, site =	"Waterloo"
, year =	2001
, pages =	"137--140"
, update =	"02.03 icking, 01.11 orourke, 01.07 orourke"
}

@techreport{or-cswvg-91
, author =	"J. O'Rourke and J. Rippel"
, title =	"A class of segments whose visibility graphs are {Hamiltonian}"
, type =	"Technical {Report}"
, number =	12
, institution =	"Dept. Comput. Sci., Smith College"
, year =	1991
, keywords =	"visibility graphs, Hamiltonian cycles"
}

@inproceedings{or-svgsr-92
, author =	"J. O'Rourke and J. Rippel"
, title =	"Segment visibility graphs: several results"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"35--38"
, keywords =	"visibility graphs, Hamiltonian cycles"
, cites =	"aek-rvgsp-91, a-srvg-89, lmw-nvg-87, m-htcpd-92, o-agta-87, or-cswvg-91, tt-uavrp-86, ZZZ"
, update =	"98.07 bibrelex"
}

@article{or-tschv-94
, author =	"J. O'Rourke and J. Rippel"
, title =	"Two segment classes with {Hamiltonian} visibility graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"209--218"
, keywords =	"visibility graphs, Hamiltonian cycles"
, update =	"95.01 orourke"
}

@techreport{os-tdccc-87
, author =	"J. O'Rourke and C. Schevon"
, title =	"A theorem on the development of closed convex curves"
, type =	"Report"
, number =	"JHU-87/16"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1987
, precedes =	"os-odcc3p-89"
, update =	"97.11 orourke"
}

@inproceedings{os-cgd3p-89
, author =	"J. O'Rourke and C. Schevon"
, title =	"Computing the geodesic diameter of a $3$-polytope"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"370--379"
, keywords =	"polytopes, shortest paths, diameter"
, cites =	"afw-fsgvd-88, cs-adpch-88, e-acg-87, egppss-acptc-88, es-vda-86, mmp-dgp-87, mo-al3sd-88, m-fspcp-85, m-nspsp-86, p-gcc-70, s-spacp-87, so-nmesc-88, so-afesp-89, ss-spps-86, s-agfnp-87, ZZZ"
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@article{os-odcc3p-89
, author =	"J. O'Rourke and C. Schevon"
, title =	"On the development of closed convex curves on 3-polytopes"
, journal =	"J. Geom."
, volume =	13
, year =	1989
, pages =	"152--157"
, succeeds =	"os-tdccc-87"
, update =	"97.11 orourke"
}

@techreport{oss-icpvf-95t
, author =	"J. O'Rourke and T. Shermer and I. Streinu"
, title =	"Illuminating convex polygons with vertex floodlights"
, type =	"Technical {Report}"
, number =	039
, institution =	"Dept. Comput. Sci., Smith College"
, month =	apr
, year =	1995
, keywords =	"visibility, floodlights"
, update =	"95.09 jones, 95.05 orourke, 95.05 orourke"
}

@inproceedings{oss-icpvf-95i
, author =	"Joseph O'Rourke and Thomas Shermer and Ileana Streinu"
, title =	"Illuminating Convex Polygons with Vertex Floodlights"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"151--156"
, keywords =	"visibility, floodlights"
, update =	"95.09 jones"
}

@article{os-dqtad-84
, author =	"J. O'Rourke and K. R. {Sloan, Jr.}"
, title =	"Dynamic quantization: two adaptive data structures for multidimensional spaces"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-6"
, number =	3
, month =	may
, year =	1984
, pages =	"266--280"
, keywords =	"cluster analysis"
}

@techreport{os-pvgpp1-96
, author =	"J. O'Rourke and I. Streinu"
, title =	"Pseudo-visibility graphs in pseudo-polygons: {Part I}"
, type =	"Technical {Report}"
, number =	041
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	jan
, year =	1996
, note =	"Slightly revised Apr. 1996"
, update =	"98.07 bibrelex, 96.05 orourke"
}

@techreport{os-pvgpp2-96
, author =	"J. O'Rourke and I. Streinu"
, title =	"Pseudo-visibility graphs in pseudo-polygons: {Part II}"
, type =	"Technical {Report}"
, number =	042
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	apr
, year =	1996
, update =	"98.07 bibrelex, 96.05 orourke"
}

@techreport{os-vevgp-96
, author =	"J. O'Rourke and I. Streinu"
, title =	"The Vertex-Edge Visibility Graph of a Polygon"
, type =	"Technical {Report}"
, number =	047
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	jun
, year =	1996
, note =	"Revised Feb. 1997"
, update =	"97.03 orourke"
}

@article{os-vevgp-97
, author =	"J. O'Rourke and I. Streinu"
, title =	"The vertex-edge visibility graph of a polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"1--17"
, keywords =	"visibility, geometric graphs"
, succeeds =	"os-pvgpp1-96"
, update =	"98.07 bibrelex, 97.07 orourke"
, annote =	"A new polygon visibility graph is introduced.  It is
                 demonstrated that it encodes more geometric
		 information about the polygon than does the vertex
                 visibility graph.  For example, it determines the
                 shortest path tree for each vertex."
}

@article{os-vevgp-98
, author =	"Joseph O'Rourke and Ileana Streinu"
, title =	"The vertex--edge visibility graph of a polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"105--120"
, update =	"98.11 devillers"
}

@inproceedings{os-vepvgcr-97
, author =	"J. O'Rourke and I. Streinu"
, title =	"Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"119--128"
, keywords =	"visibility, geometric graphs, arrangements"
, succeeds =	"os-pvgpp2-96"
, cites =	"ak-vgom-95, blwsz-om-93, e-vgr-90, g-rcvgs-88, g-rcvgs-97, gp-sccca-84, k-ah-92, m-utoms-91, o-cgc18-93, os-pvgpp1-96, os-vevgp-97, s-spinh-91, s-cs-96, s-nspvg-96, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat+orourke"
, annote =	"Vertex-edge visibility graphs of pseudo-polygons
		are characterized combinatorially, showing that the
		decision problem for them is in P.  This also establishes
		that the decision problem for vertex-vertex
		visibility graphs of pseudo-polygons is in NP."
}

@techreport{os-rpps-91
, author =	"J. O'Rourke and V. Subramanian"
, title =	"On reconstructing polyhedra from parallel slices"
, type =	"Technical {Report}"
, number =	008
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, month =	jun
, year =	1991
, keywords =	"triangulations, polyhedra, surface reconstruction"
, update =	"94.01 orourke"
}

@article{os-snhpd-83
, author =	"J. O'Rourke and K. J. Supowit"
, title =	"Some {NP}-hard polygon decomposition problems"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-30"
, year =	1983
, pages =	"181--190"
, keywords =	"decomposition, NP-completeness"
, update =	"94.09 lambert"
}

@techreport{osb-spps-84
, author =	"J. O'Rourke and Subhash Suri and H. Booth"
, title =	"Shortest paths on polyhedral surfaces"
, type =	"Manuscript"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{osb-spps-85
, author =	"J. O'Rourke and Subhash Suri and H. Booth"
, title =	"Shortest paths on polyhedral surfaces"
, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	182
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"243--254"
, keywords =	"shortest paths"
, update =	"98.03 mitchell"
}

@incollection{ot-pr-97
, author =	"J. O'Rourke and G. T. Toussaint"
, title =	"Pattern recognition"
, chapter =	43
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"797--814"
, update =	"97.11 icking+orourke, 97.07 orourke, 97.03 orourke"
}

@techreport{ov-grp-91
, author =	"J. O'Rourke and M. Virmani"
, title =	"Generating random polygons"
, number =	11
, institution =	"Dept. Comput. Sci., Smith College"
, year =	1991
, keywords =	"polygons, randomness"
}

@incollection{ow-css-85
, author =	"J. O'Rourke and R. Washington"
, title =	"Curve similarity via signatures"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"295--317"
, keywords =	"length, pattern recognition"
}

@techreport{ox-spi-96
, author =	"J. O'Rourke and C. Xiao"
, title =	"Some polyhedra are irreducible"
, type =	"Technical {Report}"
, number =	49
, institution =	"Dept. Comput. Sci., Smith College"
, month =	jun
, year =	1996
, keywords =	"morphing"
, update =	"97.11 orourke"
, annote =	"Proves that Guibas-Hershberger polygon morphing
		cannot extend to an analogous morphing of polyhedra"
}

@incollection{ox-ip90v-94
, author =	"J. O'Rourke and D. Xu"
, title =	"Illumination of polygons with $90^\circ$ vertex lights"
, booktitle =	"Snapshots of Computational and Discrete Geometry"
, volume =	3
, publisher =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, month =	jul
, year =	1994
, pages =	"108--117"
, note =	"Technical Report SOCS-94.50"
, keywords =	"visibility, floodlights"
, update =	"94.09 orourke"
, annote =	"Also Technical Report 034, Dept. Comput. Sci., Smith College"
}

@techreport{o-artpc-85
, author =	"D. J. Orser"
, title =	"An algebraic representation for the topology of polytope complexes"
, type =	"Report"
, number =	"??"
, institution =	"Center Manufacturing Engrg., National Bureau Standards"
, year =	1985
}

@inproceedings{o-efo-83
, author =	"R. H. J. Otten"
, title =	"Efficient Floorplan Optimization"
, booktitle =	"IEEE Int. Conf. Computer Design inVLSI in Computers"
, year =	1983
, pages =	"499--522"
, update =	"98.11 bibrelex"
}

@inproceedings{ow-grild-78
, author =	"R. H. J. M. Otten and J. G. van Wijk"
, title =	"Graph Representations in Interactive Layout Design"
, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
, year =	1978
, pages =	"914--918"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@proceedings{o-iwcg-89
, title =	"Abstracts 5th Intern. Workshop Comput. Geom."
, editor =	"Thomas Ottmann"
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@techreport{osh-kaoa-94
, author =	"Thomas Ottmann and Sven Schuierer and Christoph A. Hipke"
, title =	"Kompetitive {Analyse} f{\"u}r {Online-Algorithmen}: {Eine} kommentierte {Bibliographie}"
, number =	61
, institution =	"Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
, address =	"Germany"
, year =	1994
, update =	"00.03 bibrelex"
}

@incollection{oss-eephd-95
, author =	"T. Ottmann and S. Schuierer and S. Soundaralakshmi"
, title =	"Enumerating extreme points in higher dimensions"
, booktitle =	"Proc. 12th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	900
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"562--570"
, update =	"95.05 smid"
}

@techreport{osw-dcrch-83
, author =	"T. Ottmann and E. Soisalon-Soininen and D. Wood"
, title =	"On the definition and computation of rectilinear convex hulls"
, number =	"CS-83-07"
, institution =	"Univ. Waterloo"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{osw-dcrch-85
, author =	"T. Ottmann and E. Soisalon-Soininen and D. Wood"
, title =	"On the definition and computation of rectilinear convex hulls"
, journal =	"Inform. Sci."
, volume =	33
, year =	1985
, pages =	"157--171"
}

@techreport{osw-rchps-83
, author =	"T. Ottmann and E. Soisalon-Soininen and D. Wood"
, title =	"Rectilinear convex hull partitioning of sets of rectilinear polygons"
, type =	"Report"
, number =	"CS-83-19"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1983
}

@inproceedings{otu-nsga-87
, author =	"T. Ottmann and G. Thiemt and C. Ullrich"
, title =	"Numerical stability of geometric algorithms"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"119--125"
, comments =	"parts of the results appeared in: Th. Ottmann, G. Thiemt, C. Ullrich, On Arithmetical Problems of geometric Algorithms in the plane, Computing supplement 6 (1988), 13-136"
, cites =	"a-spapo-85, b-ipsap-84, bo-arcgi-79, bruw-pcmls-86, f-cgset-87, gs-pmgsc-85, km-catp-81, km-nasc-83, lp-cgs-84, -mrm-83, m-mdscg-84, ps-cgi-85, r-cnebf-82, r-snsls-82, rb-lsbea-83, t-dnsga-86, t-cg-85, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
}

@book{ow-ad-90
, author =	"Thomas Ottmann and Peter Widmayer"
, title =	"Algorithmen und {Datenstrukturen}"
, publisher =	"BI-Wissenschaftsverlag"
, address =	"Mannheim"
, year =	1990
, update =	"00.03 bibrelex"
}

@techreport{ow-plsss-82
, author =	"T. Ottmann and P. Widmayer"
, title =	"On the placement of line segments into a skeleton structure"
, type =	"Report"
, number =	117
, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1982
}

@article{ow-tsls-83
, author =	"T. Ottmann and P. Widmayer"
, title =	"On translating a set of line segments"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	24
, year =	1983
, pages =	"382--389"
}

@techreport{ow-remrp-81
, author =	"T. Ottmann and P. Widmayer"
, title =	"Reasonable encodings make rectangle problems hard"
, type =	"Report"
, number =	"??"
, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1981
}

@techreport{ow-svpus-84
, author =	"T. Ottmann and P. Widmayer"
, title =	"Solving visibility problems by using skeleton structures"
, type =	"Report"
, number =	133
, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1984
}

@techreport{oww-fabmo-82
, author =	"T. Ottmann and P. Widmayer and D. Wood"
, title =	"A fast algorithm for {Boolean} mask operations"
, type =	"Report"
, number =	112
, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1982
, precedes =	"oww-fabmo-85"
}

@article{oww-fabmo-85
, author =	"T. Ottmann and P. Widmayer and D. Wood"
, title =	"A fast algorithm for {Boolean} mask operations"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	30
, year =	1985
, pages =	"249--268"
, succeeds =	"oww-fabmo-82"
}

@article{oww-wceah-85
, author =	"T. Ottmann and P. Widmayer and D. Wood"
, title =	"A worst-case efficient algorithm for hidden line elimination"
, journal =	"Internat. J. Comput. Math."
, volume =	18
, year =	1985
, pages =	"93--119"
}

@techreport{ow-dsp-84t
, author =	"T. Ottmann and D. Wood"
, title =	"Dynamical sets of points"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, year =	1984
, update =	"98.07 bibrelex"
}

@article{ow-dsp-84
, author =	"T. Ottmann and D. Wood"
, title =	"Dynamical sets of points"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	27
, year =	1984
, pages =	"157--166"
}

@techreport{ow-sepsa-84
, author =	"T. Ottmann and D. Wood"
, title =	"Space-economical plane-sweep algorithms"
, type =	"Report"
, number =	"CS-84-32"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1984
, precedes =	"ow-sepsa-86"
}

@article{ow-sepsa-86
, author =	"T. Ottmann and D. Wood"
, title =	"Space-economical plane-sweep algorithms"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	34
, year =	1986
, pages =	"35--51"
, succeeds =	"ow-sepsa-84"
}

@techreport{ow-cpp-84
, author =	"T. Ottmann and D. Wood"
, title =	"The contour problem for polygons"
, type =	"Report"
, number =	"CS-84-33"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1984
}

@techreport{o-gpbvd-84
, author =	"T. A. Ottmann"
, title =	"Geometrische {Probleme} beim {VLSI}-{Design}"
, type =	"Report"
, number =	138
, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1984
}

@article{o-schle-85
, author =	"T. A. Ottmann"
, title =	"Special cases of the hidden-line elimination problem"
, journal =	"Bull. EATCS"
, volume =	26
, year =	1985
, pages =	"163--164"
, update =	"96.09 devillers"
}

@article{osw-pssop-87
, author =	"Th. Ottmann and E. Soisalon-Soininen and D. Wood"
, title =	"Partitioning and Separating Sets of Orthogonal Polygons"
, journal =	"Inform. Sci."
, volume =	42
, year =	1987
, pages =	"31--49"
}

@book{ow-ad-93
, author =	"Th. Ottmann and P. Widmayer"
, title =	"Algorithmen und Datenstrukturen"
, series =	"Reihe Informatik"
, volume =	70
, publisher =	"BI Wissenschaftsverlag"
, address =	"Mannheim"
, year =	1993
, update =	"98.11 bibrelex"
}

@techreport{ow-ubtcl-89
, author =	"Th. Ottmann and D. Wood"
, title =	"Updating Binary Trees with Constant Linkage Cost"
, type =	"Research Report"
, number =	"CS-89-45"
, institution =	"Data Structuring Group, University of Waterloo"
, year =	1989
, update =	"98.11 bibrelex"
}

@inproceedings{o-ibgf-85
, author =	"M. Ouksel"
, title =	"The interpolation-based grid file"
, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
, year =	1985
, pages =	"20--27"
, update =	"97.07 agarwal"
}

@article{os-mbtad-81
, author =	"M. Ouksel and P. Scheuermann"
, title =	"Multidimensional {$B$}-trees: analysis of dynamic behavior"
, journal =	"BIT"
, volume =	21
, year =	1981
, pages =	"401--418"
}

@techreport{o-csdst-??
, author =	"J. K. Ousterhout"
, title =	"Corner {Stitching}: a data structuring technique for {VLSI} design tools"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@book{o-ttt-94
, author =	"J. K. Ousterhout"
, title =	"Tcl and the {Tk} toolkit"
, publisher =	"Addison-Wesley"
, year =	1994
, update =	"98.07 bibrelex"
}

@inproceedings{o-cp-88
, author =	"M. Overmars"
, title =	"Connectability problems"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"105--112"
}

@inproceedings{o-fd-96
, author =	"Mark Overmars"
, title =	"Fixture Design"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	49
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{o-tcg-93
, author =	"M. Overmars"
, title =	"Teaching computational geometry"
, type =	"Technical {Report}"
, number =	"RUU-CS-93-34"
, institution =	"Utrecht University"
, address =	"Utrecht, Netherlands"
, year =	1993
, update =	"98.03 bibrelex"
}

@inproceedings{orsw-ipaw-95
, author =	"Mark Overmars and Anil Rao and Otfried Schwarzkopf and Chantal Wentink"
, title =	"Immobilizing Polygons against a Wall"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"29--38"
, keywords =	"grasping, form-closure, clamping, fixtures"
, cites =	"am-rsps-93, ab-kawff-85, by-kmafr-90, b-hjfd-89, bg-casmf-94, ccb-maacm-89, b-rsdoh-93, gt-admff-86, h-mf-87, l-matps-82, mnp-gg-90, m-wap-91, mss-esmpg-87, ps-cgi-85, r-km-76, wc-pmhf-94, zgw-emf-94, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell+schwarzkopf"
}

@article{oss-slspt-90
, author =	"M. Overmars and H. Schipper and Micha Sharir"
, title =	"Storing line segments in partition trees"
, journal =	"BIT"
, volume =	30
, year =	1990
, pages =	"385--403"
, succeeds =	"oss-slspt-89"
, update =	"98.03 mitchell"
}

@inproceedings{os-oshsr-89
, author =	"M. Overmars and Micha Sharir"
, title =	"Output-sensitive hidden surface removal"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"598--603"
, comments =	"To appear as two papers in ACM Trans. Graphics and
		 Algorithmica"
, update =	"98.03 mitchell"
}

@techreport{o-ramp-92
, author =	"M. H. Overmars"
, title =	"A Random Approach to Motion Planning"
, type =	"Report"
, number =	"RUU-CS-92-32"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, month =	oct
, year =	1992
, update =	"95.01 devillers"
}

@incollection{o-cggo-88
, author =	"M. H. Overmars"
, title =	"Computational geometry on a grid: an overview"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"167--184"
, update =	"99.11 bibrelex"
}

@inproceedings{o-dcgal-96
, author =	"Mark H. Overmars"
, title =	"Designing the {C}omputational {G}eometry {A}lgorithms {L}ibrary {CGAL}"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, site =	"Philadelphia, PA, USA"
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, month =	may
, year =	1996
, pages =	"53--58"
, url =	"http://www.cs.uu.nl/CGAL/Papers/panel.ps.gz"
, update =	"00.03 vismara, 99.11 bibrelex, 98.11 bibrelex, 97.11 held"
}

@incollection{o-dzdhg-82
, author =	"M. H. Overmars"
, title =	"Dynamische zoekstructuren die hun geschiedenis onthouden"
, editor =	"P. M. B. Vitanyi and J. van Leeuwen and P. van {Emde Boas}"
, booktitle =	"Colloquium Complexiteit en Algorithmen"
, publisher =	"Mathematisch Centrum, Amsterdam"
, year =	1982
, pages =	"109--136"
, update =	"94.01 smid, 93.09 rote"
}

@article{o-dodsp-81
, author =	"M. H. Overmars"
, title =	"Dynamization of order decomposable set problems"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"245--260"
, note =	"Corrigendum in 4(1983), 301"
}

@techreport{o-edsrs-87
, author =	"M. H. Overmars"
, title =	"Efficient data structures for range searching on a grid"
, type =	"Report"
, number =	"RUU-CS-87-2"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1987
, precedes =	"o-edsrs-88"
, update =	"94.05 schwarzkopf"
}

@article{o-edsrs-88
, author =	"M. H. Overmars"
, title =	"Efficient data structures for range searching on a grid"
, journal =	"J. Algorithms"
, volume =	9
, year =	1988
, pages =	"254--275"
, succeeds =	"o-edsrs-87"
}

@article{o-gmaea-81
, author =	"M. H. Overmars"
, title =	"General methods for ``all elements'' and ``all pairs'' problems"
, journal =	"Inform. Process. Lett."
, volume =	12
, year =	1981
, pages =	"99--102"
}

@techreport{o-gdscg-85t
, author =	"M. H. Overmars"
, title =	"Geometric data structures for computer graphics"
, type =	"Report"
, number =	"RUU-CS-85-13"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1985
, precedes =	"o-gdscg-85i"
, update =	"94.05 schwarzkopf"
}

@incollection{o-gdscg-85i
, author =	"M. H. Overmars"
, title =	"Geometric data structures for computer graphics"
, editor =	"R. A. Earnshaw"
, booktitle =	"Fundamental Algorithms for Computer Graphics"
, series =	"NATO ASI Series~F"
, volume =	17
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"919--931"
, succeeds =	"o-gdscg-85t"
, precedes =	"o-gdscg-88"
, update =	"97.03 schwarzkopf"
}

@incollection{o-gdscg-88
, author =	"M. H. Overmars"
, title =	"Geometric data structures for computer graphics: an overview"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"21--49"
, keywords =	"survey paper, quad trees, range trees, segment trees, dynamizing data structures"
, succeeds =	"o-gdscg-85i"
, update =	"97.03 schwarzkopf"
}

@inproceedings{o-nmhsr-90
, author =	"Mark H. Overmars"
, title =	"New Methods for Hidden Surface Removal"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	20
, update =	"00.03 bibrelex"
}

@techreport{o-plfs-91
, author =	"M. H. Overmars"
, title =	"Point location in fat subdivisions"
, type =	"Technical {Report}"
, number =	"RUU-CS-91-40"
, institution =	"Univ. of Utrecht"
, address =	"Utrecht, Netherlands"
, month =	nov
, year =	1991
, update =	"93.09 milone+mitchell"
}

@article{o-plfs-92
, author =	"M. H. Overmars"
, title =	"Point location in fat subdivisions"
, journal =	"Inform. Process. Lett."
, volume =	44
, year =	1992
, pages =	"261--265"
, succeeds =	"o-plfs-91"
, update =	"94.05 matousek"
}

@inproceedings{o-rssls-85
, author =	"M. H. Overmars"
, title =	"Range searching in a set of line segments"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"177--185"
, cites =	"e-ndrs-81, em-ioo-81, em-sosgr-81, eos-smcga-84a, k-osps-83, l-tarrc-79, m-pst-81, o-ddds-83, ol-wcoid-81, l-gcg-82, w-sbta-79, ZZZ"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@techreport{o-rsg-85t
, author =	"M. H. Overmars"
, title =	"Range searching on a grid"
, type =	"Report"
, number =	"RUU-CS-85-17a"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1985
, precedes =	"o-rsg-85i"
, update =	"94.05 schwarzkopf"
}

@inproceedings{o-rsg-85i
, author =	"M. H. Overmars"
, title =	"Range searching on a grid"
, booktitle =	"Proc. 11th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '85"
, publisher =	"Trauner Verlag"
, address =	"Linz, Austria"
, year =	1985
, pages =	"295--305"
, succeeds =	"o-rsg-85t"
, update =	"98.07 bibrelex, 94.05 smid"
}

@article{o-rciac-81
, author =	"M. H. Overmars"
, title =	"Reporting and counting intersections of arcs on a circle"
, journal =	"Bull. EATCS"
, volume =	14
, year =	1981
, pages =	"7--15"
}

@techreport{o-sp1-81
, author =	"M. H. Overmars"
, title =	"Searching in the past {I}"
, type =	"Report"
, number =	"RUU-CS-81-7"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1981
, update =	"94.05 schwarzkopf"
}

@techreport{o-sp2gt-81
, author =	"M. H. Overmars"
, title =	"Searching in the past {II}: general transforms"
, type =	"Report"
, number =	"RUU-CS-81-9"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1981
, update =	"94.05 schwarzkopf"
}

@book{o-ddds-83
, author =	"M. H. Overmars"
, title =	"The Design of Dynamic Data Structures"
, series =	"Lecture Notes Comput. Sci."
, volume =	156
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, West Germany"
, year =	1983
, keywords =	"book"
, update =	"96.05 agarwal"
}

@inproceedings{o-la-83
, author =	"M. H. Overmars"
, title =	"The locus approach"
, booktitle =	"Proc. 9th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '83"
, publisher =	"Trauner Verlag"
, address =	"Linz, Austria"
, year =	1983
, pages =	"263--273"
, update =	"98.07 bibrelex, 94.05 smid"
}

@inproceedings{o-tsdds-82
, author =	"M. H. Overmars"
, title =	"Transforming semi-dynamic data structures into dynamic structures"
, booktitle =	"Proc. 7th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG '81"
, publisher =	"Carl Hanser Verlag"
, year =	1982
, pages =	"173--182"
, update =	"98.07 bibrelex"
}

@techreport{ok-csdp-89
, author =	"M. H. Overmars and M. J. van Kreveld"
, title =	"Concatenable structures for decomposable problems"
, number =	"RUU-CS-89-16"
, institution =	"Univ. of Utrecht"
, address =	"Utrecht, Netherlands"
, month =	aug
, year =	1989
, update =	"93.09 milone+mitchell"
}

@article{ol-dmdds-82
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Dynamic multi-dimensional data structures based on quad- and $k$-d trees"
, journal =	"Acta Inform."
, volume =	17
, year =	1982
, pages =	"267--285"
, update =	"96.05 smid"
}

@inproceedings{ol-dmcp-80
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Dynamically maintaining configurations in the plane"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
, year =	1980
, pages =	"135--145"
, succeeds =	"ol-nmcp-80"
, precedes =	"ol-mcp-81"
}

@inproceedings{ol-ddspy-81
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Dynamization of decomposable searching problems yielding good worst-case bounds"
, booktitle =	"Proc. 5th GI Conf. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	104
, publisher =	"Springer-Verlag"
, year =	1981
, pages =	"224--233"
, update =	"99.11 bibrelex, 96.05 agarwal"
}

@article{ol-fcbch-80
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Further comments on {Bykat}'s convex hull algorithm"
, journal =	"Inform. Process. Lett."
, volume =	10
, year =	1980
, pages =	"209--212"
}

@article{ol-mcp-81
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Maintenance of configurations in the plane"
, journal =	"J. Comput. Syst. Sci."
, volume =	23
, year =	1981
, pages =	"166--204"
, succeeds =	"ol-dmcp-80"
}

@techreport{ol-nmcp-80
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Notes on maintenance of configurations in the plane"
, type =	"Report"
, number =	"RUU-CS-80-5"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1980
, precedes =	"ol-dmcp-80"
, update =	"94.05 schwarzkopf"
}

@article{ol-spdds-81
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Some principles for dynamizing decomposable searching problems"
, journal =	"Inform. Process. Lett."
, volume =	12
, year =	1981
, pages =	"49--54"
}

@article{ol-tgmdd-81
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Two general methods for dynamizing decomposable searching problems"
, journal =	"Computing"
, volume =	26
, year =	1981
, pages =	"155--166"
}

@article{ol-wcoid-81
, author =	"M. H. Overmars and J. van Leeuwen"
, title =	"Worst-case optimal insertion and deletion methods for decomposable searching problems"
, journal =	"Inform. Process. Lett."
, volume =	12
, year =	1981
, pages =	"168--173"
}

@techreport{oss-slspt-89
, author =	"M. H. Overmars and H. Schipper and Micha Sharir"
, title =	"Storing line segments in partition trees"
, type =	"Report"
, number =	"RUU-CS-89-17"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1989
, precedes =	"oss-slspt-90"
, update =	"98.03 mitchell, 94.05 schwarzkopf"
}

@techreport{osv-swec6-88
, author =	"M. H. Overmars and B. Scholten and I. Vincent"
, title =	"Sets without empty convex $6$-gons"
, type =	"Report"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1988
, update =	"98.03 bibrelex"
}

@article{osv-swec6-89
, author =	"M. H. Overmars and B. Scholten and I. Vincent"
, title =	"Sets without Empty Convex $6$-gons"
, journal =	"Bull. EATCS"
, volume =	37
, year =	1989
, pages =	160
}

@techreport{os-itosh-89
, author =	"M. H. Overmars and Micha Sharir"
, title =	"An improved technique for output-sensitive hidden surface removal"
, number =	"RUU-CS-89-32"
, institution =	"Univ. of Utrecht"
, address =	"Utrecht, Netherlands"
, month =	dec
, year =	1989
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{os-mvm-90
, author =	"M. H. Overmars and Micha Sharir"
, title =	"Merging visibility maps"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"168--176"
, precedes =	"os-mvm-91"
, cites =	"b-hsrr-90, ce-oails-88, d-qbhle-86, egs-ccmfa-90, g-pahle-87i, gao-isost-90, go-nasch-87, ms-rcibt-88, m-eahsr-89, m-wcohs-87, n-flsah-85, os-oshsr-89, py-bpahs-89, rs-eoshs-88i, so-sosah-92, pvy-cavsi-88, s-tsbhl-81, sss-cthsa-74, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{os-mvm-91
, author =	"M. H. Overmars and Micha Sharir"
, title =	"Merging visibility maps"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1991
, pages =	"35--49"
, succeeds =	"os-mvm-90"
, update =	"98.03 mitchell"
}

@article{osbk-mrtsm-90
, author =	"M. H. Overmars and M. H. M. Smid and M. T. de Berg and M. J. van Kreveld"
, title =	"Maintaining range trees in secondary memory, part {I}: {P}artitions"
, journal =	"Acta Inform."
, volume =	27
, year =	1990
, pages =	"423--452"
, update =	"97.07 agarwal"
}

@inproceedings{os-rsplf-94
, author =	"M. H. Overmars and A. F. van der Stappen"
, title =	"Range Searching and Point Location among Fat Objects"
, editor =	"J. van Leeuwen"
, booktitle =	"Algorithms -- ESA'94"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"240--253"
, update =	"99.11 bibrelex, 97.03 schwarzkopf, 96.05 agarwal, 95.01 held"
}

@article{os-rsplf-96
, author =	"M. H. Overmars and A. F. van der Stappen"
, title =	"Range Searching and Point Location among Fat Objects"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"629--656"
, update =	"97.03 agarwal+smid, 96.05 agarwal, 95.01 held"
}

@incollection{os-plamp-94
, author =	"M. H. Overmars and P. {\v S}vestka"
, title =	"A Probabilistic Learning Approach to Motion Planning"
, booktitle =	"Algorithmic Foundations of Robotics"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1995
, keywords =	"probabilistic, motion planning, learning"
, update =	"99.11 bibrelex, 98.07 agarwal, 97.03 schwarzkopf"
}

@article{ow-sms2d-85
, author =	"M. H. Overmars and Emo Welzl"
, title =	"A simple method for solving $2$-dimensional static range searching"
, journal =	"Bull. EATCS"
, volume =	25
, year =	1985
, pages =	"31--33"
, keywords =	"range search"
, update =	"98.03 mitchell"
}

@techreport{ow-csvg-87
, author =	"M. H. Overmars and Emo Welzl"
, title =	"Construction of Sparse Visibility Graphs"
, type =	"Technical {Report}"
, number =	"RUU-CS-87-9"
, institution =	"Department of Computer Science, University of Utrecht"
, year =	1987
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{ow-nmcvg-88
, author =	"M. H. Overmars and Emo Welzl"
, title =	"New methods for computing visibility graphs"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"164--171"
, cites =	"aaghi-vdp-86, eg-tsa-86, gm-osacv-87, hs-ndssg-86, h-fvgsp-87, l-prp-78, lw-apcfp-79, ow-csvg-87, ss-spps-84, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@inproceedings{ow-ccp-85
, author =	"M. H. Overmars and Emo Welzl"
, title =	"The complexity of cutting paper"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"316--321"
, keywords =	"shape, dynamic programming"
, cites =	"ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{ow-rv-88
, author =	"M. H. Overmars and D. Wood"
, title =	"On rectangular visibility"
, journal =	"J. Algorithms"
, volume =	9
, year =	1988
, pages =	"372--390"
, keywords =	"isothetic rectangles"
, succeeds =	"mow-vv-87"
, update =	"93.09 milone+mitchell"
}

@inproceedings{oy-nubkm-88
, author =	"M. H. Overmars and C.-K. Yap"
, title =	"New upper bounds in {Klee}'s measure problem"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"550--556"
, keywords =	"$d$-dimensional"
, comments =	"$O(n^{d/2}\log n)$ time, $O(n)$ space"
, succeeds =	"k-cmbbc-77"
, precedes =	"oy-nubkm-91"
}

@article{oy-nubkm-91
, author =	"M. H. Overmars and C.-K. Yap"
, title =	"New upper bounds in {Klee}'s measure problem"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"1034--1045"
, succeeds =	"oy-nubkm-88"
}

@article{o-csgtt-96
, author =	"J. Owen"
, title =	"Constraint on simple geometry in two and three dimensions"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"421--434"
, update =	"97.03 devillers"
}

@mastersthesis{o-innit-92
, author =	"S. J. Owen"
, title =	"An implementation of natural neighbor interpolation in three dimensions"
, journal =	"Master's thesis"
, school =	"Brigham Young University"
, year =	1992
, keywords =	"master thesis"
, update =	"01.07 devillers, 00.03 devillers"
}

@book{o-ar-85
, author =	"T. Owen"
, title =	"Assembly with Robots"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1985
, update =	"98.03 bibrelex"
}

@article{o-sft-85
, author =	"A. Oxley"
, title =	"Surface Fitting by Triangulation"
, journal =	"Comput. J."
, volume =	28
, number =	3
, year =	1985
, pages =	"335--339"
, annote =	"Almost content-free. Implementation of Lewis-Robinson
		 algorithm. Suggests constraining of non-boundary edges.
		 Suggests ear cutting to construct initial
		 triangulation."
}

@inproceedings{o-ptilc-80
, author =	"T. Ozawa"
, title =	"Planarity Testing for {IC} Layout with Constraints for Pin Order and Congestion Between Pins"
, booktitle =	"IEEE Conf. Record of the 14th Asilomar Conf. on Circuits, Systems and Computers"
, year =	1980
, pages =	"188--192"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@incollection{ot-gpaia-81
, author =	"T. Ozawa and H. Takahashi"
, title =	"A Graph-planarization Algorithm and its Applications to Random Graphs"
, booktitle =	"Graph Theory and Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	108
, publisher =	"Springer-Verlag"
, year =	1981
, pages =	"95--107"
, keywords =	"graph drawing"
, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
}

@article{p-ttrms-98
, author =	"J{\'a}nos Pach"
, title =	"A {Tverberg}-type result on multicolored simplices"
, chapter =	1
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1998
, pages =	"71--76"
, update =	"98.11 devillers, 97.11 orourke"
}

@article{p-cpcp-86
, author =	"J. Pach"
, title =	"Covering the plane with convex polygons"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"73--81"
}

@incollection{p-fpc-97
, author =	"J. Pach"
, title =	"Finite point configurations"
, chapter =	1
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"3--18"
, update =	"97.11 orourke"
}

@book{p-ntdcg-93
, title =	"New Trends in Discrete and Computational Geometry"
, editor =	"J. Pach"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, keywords =	"discrete/computational geometry, book, survey papers"
, comments =	"contains gs-caa-93, s-barga-93, m-encg-93, k-cpvc-93, gp-asotd-93, km-hart-93, gpw-gtt-93, b-hlcpr-93, b-gcabt-93, fk-rrtpc-93, mp-rdcg-93, and k-stces-93"
, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 pocchiola, 93.09 erickson"
}

@incollection{p-nggt-91
, author =	"J{\'a}nos Pach"
, title =	"Notes on geometric graph theory"
, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
, publisher =	"American Mathematical Society, Association for Computing Machinery"
, year =	1991
, pages =	"273--285"
, comments =	"survey paper, geometric graphs"
, update =	"99.11 bibrelex, 97.07 agarwal"
}

@article{p-ip-78
, author =	"J. Pach"
, title =	"On an isoperimetric problem"
, journal =	"Studia Sci. Math. Hungar."
, volume =	13
, year =	1978
, pages =	"43--45"
}

@inproceedings{p-ssp-98
, author =	"J{\'a}nos Pach"
, title =	"Systems of Segments in the Plane"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"5--6"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@book{pa-cg-95
, author =	"Janos Pach and Pankaj K. Agarwal"
, title =	"Combinatorial Geometry"
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1995
, isbn =	"0-471-58890-3"
, update =	"96.05 agarwal+smid, 95.09 mitchell, 95.05 orourke"
}

@inproceedings{ppw-wplls-90
, author =	"J. Pach and R. Pollack and Emo Welzl"
, title =	"Weaving patterns of lines and line segments in space"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"439--446"
, update =	"98.03 mitchell"
}

@article{ppw-wplls-93
, author =	"J. Pach and R. Pollack and Emo Welzl"
, title =	"Weaving Patterns of Lines and Line Segments in Space"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"561--571"
, update =	"98.03 mitchell, 97.03 gaertner+salinger"
}

@article{pr-cpls-98
, author =	"J{\'a}nos Pach and Eduardo Rivera-Campo"
, title =	"On circumscribing polygons for line segments"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"121--124"
, update =	"98.11 devillers"
}

@inproceedings{pss-ucc3d-01
, author =	"Janos Pach and Ido Safruit and Micha Sharir"
, title =	"The union of congruent cubes in three dimensions"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"19--28"
, update =	"01.07 orourke"
}

@inproceedings{pss-acn-94
, author =	"J. Pach and F. Shahrokhi and M. Szegedy"
, title =	"Applications of the Crossing Number"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"198--202"
, cites =	"ddsv-espgt-88, e-sdnp-46, gm-psen-90, gkk-fdsp-, hp-an1-34, k-epcg-79, l-civ-83, lt-stpg-79, m-fsscs-86, op-eggnv-91, p-nggt-91, pt-sgadt-93, s-jttm-87, sw-cplh-94, u-cav-84, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@article{pss-acn-96
, author =	"J. Pach and F. Shahrokhi and M. Szegedy"
, title =	"Applications of the Crossing Number"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"111--117"
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
, keywords =	"graph drawing, straight-line, geometric graph theory"
, succeeds =	"pss-acn-94"
, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@article{ps-bupcs-99
, author =	"J. Pach and M. Sharir"
, title =	"On the Boundary of the Union of Planar Convex Sets"
, journal =	"Discrete Comput. Geom."
, volume =	21
, year =	1999
, pages =	"321--328"
, succeeds =	"ps-rivbu-97"
, update =	"00.03 bibrelex, 98.03 agarwal"
}

@article{ps-nibpc-98
, author =	"J. Pach and M. Sharir"
, title =	"On the number of incidences between points and curves"
, journal =	"Combinatorics, Probability, and Computing"
, volume =	7
, year =	1998
, pages =	"in press"
, update =	"98.03 agarwal"
}

@inproceedings{ps-vvasq-89
, author =	"J. Pach and Micha Sharir"
, title =	"On vertical visibility in arrangements of segments and the queue size in the {Bentley}-{Ottman} line sweeping algorithm"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	48
, precedes =	"ps-vvasq-91"
, update =	"98.03 mitchell"
}

@article{ps-vvasq-91
, author =	"J. Pach and Micha Sharir"
, title =	"On vertical visibility in arrangements of segments and the queue size in the {Bentley}-{Ottmann} line sweeping algorithm"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"460--470"
, succeeds =	"ps-vvasq-89"
, update =	"98.03 mitchell, 97.11 icking"
}

@techreport{ps-rivbu-97
, author =	"Janos Pach and Micha Sharir"
, title =	"Regular and Irregular Vertices on the Boundary of the Union of Planar Convex Sets"
, type =	"Manuscript"
, institution =	"Tel Aviv University"
, year =	1997
, precedes =	"ps-bupcs-99"
, update =	"00.03 bibrelex, 98.03 mitchell"
}

@techreport{ps-raprp-90
, author =	"J. Pach and Micha Sharir"
, title =	"Repeated Angles in the Plane and Related Problems"
, type =	"Technical {Report}"
, number =	"90-10"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@article{ps-raprp-92
, author =	"J. Pach and Micha Sharir"
, title =	"Repeated angles in the plane and related problems"
, journal =	"J. Combin. Theory Ser. A"
, volume =	59
, year =	1992
, pages =	"12--22"
, update =	"98.03 mitchell"
}

@techreport{ps-ueplf-87
, author =	"J. Pach and Micha Sharir"
, title =	"The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis"
, type =	"Report"
, number =	279
, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1987
, precedes =	"ps-ueplf-89"
, update =	"98.03 agarwal+mitchell"
}

@article{ps-ueplf-89
, author =	"J. Pach and Micha Sharir"
, title =	"The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: combinatorial analysis"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"291--309"
, keywords =	"upper envelope"
, succeeds =	"ps-ueplf-87"
, update =	"98.03 mitchell"
}

@article{pst-nbcn-00
, author =	"J. Pach and J. Spencer and G. T\'{o}th"
, title =	"New Bounds on Crossing Numbers"
, journal =	"Discrete Comput. Geom."
, volume =	24
, year =	2000
, pages =	"623--644"
, update =	"01.04 pocchiola"
}

@inproceedings{pss-ubnpk-89
, author =	"J. Pach and W. Steiger and E. Szemer{\'e}di"
, title =	"An upper bound on the number of planar $k$-sets"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"72--79"
, precedes =	"pss-ubnpk-92"
}

@techreport{pss-ubnpk-90
, author =	"J. Pach and W. Steiger and E. Szemeredi"
, title =	"An Upper Bound on the Number of Planar $k$-Sets"
, type =	"Technical {Report}"
, number =	"90-12"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{pss-ubnpk-92
, author =	"J. Pach and W. Steiger and E. Szemer{\'e}di"
, title =	"An upper bound on the number of planar $k$-sets"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"109--123"
, succeeds =	"pss-ubnpk-89"
, update =	"93.05 jones"
, annote =	"bound of $O(n \sqrt{k} / \log^* k)$ for any planar
configuration of size $n$"
}

@inproceedings{pt-cg-00
, author =	"J{\'a}nos Pach and G{\'a}bor Tardos"
, title =	"Cutting Glass"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"360--369"
, update =	"00.11 jones"
}

@inproceedings{ptt-tdgdg-97
, author =	"J{\'a}nos Pach and Torsten Thiele and G{\'e}za T{\'o}th"
, title =	"Three-dimensional Grid Drawings of Graphs"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"47--51"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{pt-sgadt-93
, author =	"J. Pach and J. T{\"o}r{\H o}csik"
, title =	"Some geometric applications of {Dilworth's} theorem"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"264--279"
, cites =	"acns-cfs-82, ae-degg-89, ah-g-66, clr-ia-90, d-dtpos-50, dsw-bvcnh-, e-sdnp-46, es-cpg-35, gkk-fdsp-, grs-rt-90, gl-ccpri-85, hp-an1-34, k-epcg-79, lmpt-rtrpc-94, op-eggnv-91, r-pfl-30, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@techreport{pt-gdfcp-96
, author =	"J. Pach and G. Toth"
, title =	"Graphs drawn with few crossings per edge"
, type =	"Preprint"
, institution =	"??"
, year =	1996
, update =	"98.07 bibrelex"
}

@article{pw-epgfv-01
, author =	"Janos Pach and Rephael Wenger"
, title =	"Embedding planar graphs at fixed vertex locations"
, journal =	"Graphs Combin."
, volume =	17
, year =	2001
, pages =	"717--728"
, update =	"02.03 wenger"
}

@techreport{pw-snben-89
, author =	"J. Pach and G. Woeginger"
, title =	"Some new bounds for epsilon-nets"
, type =	"Report"
, number =	"B-89-08 Serie B"
, institution =	"Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{pw-snben-90
, author =	"J. Pach and G. Woeginger"
, title =	"Some new bounds for epsilon-nets"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"10--15"
, precedes =	"kpw-atben-92"
, cites =	"a-dapal-89, behw-clgcv-89, cf-dvrsi-88, cw-qorss-89, c-narsc-87, cegsw-ccbac-88, e-acg-87, hw-ensrq-87, m-cen-89, msw-hnlls-90, p-cpcp-86, ZZZ"
, update =	"97.11 bibrelex, 93.09 rote"
}

@inproceedings{ph-srr-01
, author =	"Eli Packer and Dan Halperin"
, title =	"Snap Rounding Revisited"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"82--85"
, update =	"01.04 icking"
}

@book{p-gg5-95
, title =	"Graphics Gems V"
, editor =	"Alan W. Paeth"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1995
, isbn =	"0-12-543455-3"
, update =	"98.07 vismara, 95.09 mitchell"
}

@incollection{p-itsh-94
, author =	"Alan W. Paeth"
, title =	"Ideal Tiles for Shading and Halftoning"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"486--492"
, keywords =	"bitblt, dither, stipple"
, update =	"94.09 heckbert"
, annote =	"Discusses heuristics and design techniques for top-quality
dither and stipple patterns."
}

@article{p-mstcm-74
, author =	"Page"
, title =	"A minimum spanning tree clustering method"
, journal =	"Commun. ACM"
, volume =	17
, number =	6
, year =	1974
, update =	"97.11 bibrelex"
}

@incollection{pst-ttso-93
, author =	"B.-U. Pagel and H.-W. Six and H. Toben"
, title =	"The transformation technique for spatial objects revisited"
, booktitle =	"Proc. 3rd Intl. Symp. on Large Spatial Databases"
, series =	"Lecture Notes Comput. Sci."
, volume =	692
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"73--88"
, update =	"97.07 agarwal"
}

@article{pr-cpm-00
, author =	"R. Pajarola and J. Rossignac"
, title =	"Compressed progressive meshes"
, journal =	"IEEE Transactions on Visualization and Computer Graphics"
, volume =	6
, number =	1
, year =	2000
, pages =	"79--93"
, update =	"01.07 devillers"
}

@phdthesis{p-wvrp-90
, author =	"S. P. Pal"
, title =	"Weak Visibility and Related Problems in simple polygons"
, type =	"Ph.{D}. Thesis"
, school =	"Indian Inst. Science"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex, 94.05 ghosh"
}

@inproceedings{pdv-oppt-90
, author =	"S. P. Pal and B. DasGupta and C. E. {Veni Madhavan}"
, title =	"Optimal polygon placement by translation"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"164--171"
, cites =	"ab-scsp-87, bfm-pct-86, c-pcp-83, ce-oails-88, f-fapct-85, gjpt-tsp-78, l-spcsa-83, lw-apcfp-79, pdv-oppt-90t, ps-cgi-85, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{pdv-oppt-90t
, author =	"S. P. Pal and C. E. Dasgupta and C. E. {Veni Madhavan}"
, title =	"Optimal polygon placement by translation"
, type =	"Technical {Report}"
, number =	"IIsc-CSA-90-7"
, institution =	"Department of Computer Science and Automation, Indian Institute of Science"
, address =	"Bangalore, India"
, year =	1990
, update =	"98.07 bibrelex"
}

@article{pr-dhsac-90
, author =	"Oscar Palacios-Velez and Baltasar Cuevas Renaud"
, title =	"Dynamic Hierarchical Subdivision Algorithm For Computing {Delaunay} Triangulations And Other Closest-Point Problems"
, journal =	"ACM Trans. Math. Softw."
, volume =	16
, number =	3
, month =	sep
, year =	1990
, pages =	"275--292"
, keywords =	"search methods, closest point problems, computational geometry, Delaunay triangulation, hierarchical search, mathematical software"
, annote =	"By keeping around all the triangles formed in the
		 incremental algorithm, $O(\log n)$ search time is
		 obtained, at the cost of 3 times as much space. (And
		 worst case space is quadratic.)"
, abstract =	"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 to be inserted, (2) identification of other
		 adjoining triangles whose circumcircle contains the
		 point, (3) formation of the new triangles, and (4)
		 database update. Different search procedures are
		 analyzed. It is shown that the 'oriented walk' search
		 has a better performance than the asymptotically
		 optimal 'hierarchical subdivision' search, when the
		 total number of points is less than 417 or when the
		 points are presorted by distance or coordinates. The
		 algorithm has point-deletion capabilities which are
		 discussed in detail. (Author abstract) 25 Refs."
}

@inproceedings{ps-crrbs-93
, author =	"Larry Palazzi and Jack Snoeyink"
, title =	"Counting and Reporting Red/Blue Segment Intersections"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"530--540"
, update =	"96.05 agarwal, 93.09 smid, 93.05 jones"
}

@article{ps-crrbs-94
, author =	"L. Palazzi and J. Snoeyink"
, title =	"Counting and reporting red/blue segment intersections"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	56
, number =	4
, year =	1994
, pages =	"304--311"
, update =	"98.03 bibrelex"
}

@inproceedings{p-ltaco-01
, author =	"Leonidas Palios"
, title =	"A Linear-Time Algorithm to Compute the Optimal Bridge Connecting Two Disjoint Convex Polygons"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"48--52"
, update =	"01.04 icking"
}

@inproceedings{p-nep-94
, author =	"L. Palios"
, title =	"On the Number of Extrema of a Polyhedron"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"320--325"
, cites =	"bd-cdpr-92, cp-tncp-90, cp-dbnp-92, cs-bst-94, m-mdscg-84, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@techreport{p-ot3dr-94t
, author =	"L. Palios"
, title =	"Optimal Tetrahedralization of the 3d-region 'between' a Convex Polyhedron and a Convex Polygon"
, type =	"Research Report"
, institution =	"The Geometry Center, University of Minnesota"
, year =	1994
, succeeds =	"p-ot3dr-94"
, update =	"98.11 bibrelex"
}

@inproceedings{p-ot3dr-94
, author =	"L. Palios"
, title =	"Optimal Tetrahedralization of the $3$d Region ``Between'' a Convex Polyhedron and a Convex Polygon"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"350--356"
, precedes =	"p-ot3dr-96, p-ot3dr-94t"
, cites =	"b-prcv-75, b-ct-93, be-mgot-92t, cs-bst-94, e-acg-87, gp-cdpb-88, p-ot3dr-94t, mp-fitcp-78, ps-cgi-85, gs-pmgsc-85, ZZZ"
, update =	"98.11 bibrelex, 97.03 devillers+smid, 94.09 jones"
}

@article{p-ot3dr-96
, author =	"L. Palios"
, title =	"Optimal Tetrahedralization of the $3$d Region ``Between'' a Convex Polyhedron and a Convex Polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"263--276"
, succeeds =	"p-ot3dr-94"
, update =	"97.03 devillers+smid"
}

@article{pg-cdaus-95
, author =	"I. J. Palmer and R. L. Grimsdale"
, title =	"Collision Detection for Animation Using Sphere-Trees"
, journal =	"Comput. Graph. Forum"
, volume =	14
, number =	2
, month =	jun
, year =	1995
, pages =	"105--116"
, update =	"96.01 held"
}

@phdthesis{p-ccmsp-87
, author =	"R. S. Palmer"
, title =	"Computational Complexity of Motion and Stablility of Polygons"
, school =	"Cornell Univ."
, address =	"Ithaca, NY"
, month =	jan
, year =	1987
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{pr-epsls-85
, author =	"V. Pan and J. Reif"
, title =	"Efficient parallel solution of linear systems"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"143--152"
, update =	"98.03 bibrelex"
}

@article{p-pcpgs-96
, author =	"V. Y. Pan"
, title =	"Parallel computation of polynomial {GCD} and some related parallel computations over abstract fields"
, journal =	"Theoret. Comput. Sci."
, volume =	162
, number =	2
, year =	1996
, pages =	"173--223"
, update =	"98.07 bibrelex"
}

@article{pys-antcm-97
, author =	"V. Y. Pan and Y. Yu and C. Steward"
, title =	"Algebraic and numerical techniques for the computation of matrix determinants"
, journal =	"Comput. Math. Appl."
, volume =	"??"
, year =	1997
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@inproceedings{pd-nodec-95
, author =	"A. Panconesi and D. Dubhashi"
, title =	"Near optimal distributed edge coloring"
, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	979
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"448--459"
, update =	"97.03 gaertner+salinger"
}

@article{ps-lndci-95
, author =	"A. Panconesi and A. Srinivasan"
, title =	"The local nature of $\Delta$-colorings and its algorithmic applications"
, journal =	"Combinatorica"
, volume =	15
, year =	1995
, pages =	"255--280"
, update =	"97.03 gaertner+salinger"
}

@techreport{p-s3dps-85
, author =	"A. T. Pang"
, title =	"Solid: a $3$-d polygon surface program"
, type =	"Report"
, number =	"??"
, institution =	"MPDI Medical Sci. Center"
, year =	1985
}

@article{pbcf-dimsc-93
, author =	"A. Paoluzzi and F. Bernardini and C. Cattani and V. Ferrucci"
, title =	"Dimension-independent modeling with simplical complexes"
, journal =	"ACM Trans. Graph."
, volume =	12
, number =	1
, month =	jan
, year =	1993
, pages =	"56--102"
, update =	"97.11 bibrelex"
}

@article{pp-dmtvr-90
, author =	"N. Papadakis and A. Perakis"
, title =	"Deterministic Minimal Time Vessel Routing"
, journal =	"Oper. Res."
, volume =	38
, number =	3
, year =	1990
, pages =	"426--438"
}

@article{pp-mtvrt-89
, author =	"N. Papadakis and A. Perakis"
, title =	"Minimal Time Vessel Routing in a Time-Dependent Environment"
, journal =	"Transp. Sci."
, volume =	23
, number =	4
, year =	1989
, pages =	"266--276"
}

@inproceedings{p-dmabq-95
, author =	"C. Papadimitriou"
, title =	"Database Metatheory: Asking the Big Queries"
, booktitle =	"Proc. Principles of Distributed Systems"
, year =	1995
, pages =	"1--10"
, comments =	"addresses relationship between theory and practice in computer science"
, update =	"96.05 ramkumar"
}

@article{pt-ipct-86
, author =	"C. Papadimitriou and J. Tsitsiklis"
, title =	"Intractable Problems in Control Theory"
, journal =	"SIAM J. Control Optimization"
, volume =	24
, number =	4
, year =	1986
, update =	"97.11 bibrelex"
}

@article{p-aspmt-85
, author =	"C. H. Papadimitriou"
, title =	"An algorithm for shortest-path motion in three dimensions"
, journal =	"Inform. Process. Lett."
, volume =	20
, year =	1985
, pages =	"259--263"
, keywords =	"motion planning, path planning, geodesic distance, shortest paths"
}

@book{p-cc-94
, author =	"C. H. Papadimitriou"
, title =	"Computational Complexity"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1994
, keywords =	"complexity theory"
, update =	"97.03 schwarzkopf, 96.09 agarwal"
}

@techreport{p-cpav-91
, author =	"C. H. Papadimitriou"
, title =	"On certain problems in algorithmic vision"
, type =	"Technical {Report}"
, institution =	"UCSD"
, year =	1991
, update =	"98.03 bibrelex"
}

@incollection{p-spm-86
, author =	"C. H. Papadimitriou"
, title =	"Shortest-Path Motion"
, editor =	"G. Goos and J. Hartmanis"
, booktitle =	"Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, month =	dec
, year =	1986
, update =	"93.09 milone+mitchell"
}

@article{p-etspi-77
, author =	"C. H. Papadimitriou"
, title =	"The {Euclidean} traveling salesman problem is {NP}-complete"
, journal =	"Theoret. Comput. Sci."
, volume =	4
, year =	1977
, pages =	"237--244"
, succeeds =	"ps-clsts-77"
}

@article{p-ncbmp-76
, author =	"C. H. Papadimitriou"
, title =	"The {NP}-completeness of the bandwidth minimization problem"
, journal =	"Computing"
, volume =	16
, year =	1976
, pages =	"263--270"
, update =	"97.11 bibrelex"
}

@inproceedings{p-pamh-77
, author =	"C. H. Papadimitriou"
, title =	"The probabilistic analysis of matching heuristics"
, booktitle =	"Proc. 15th Allerton Conf. Commun. Control Comput."
, year =	1977
, pages =	"368--378"
}

@article{p-wcpag-81
, author =	"C. H. Papadimitriou"
, title =	"Worst-case and probabilistic analysis of a geometric location problem"
, journal =	"SIAM J. Comput."
, volume =	10
, year =	1981
, pages =	"542--557"
}

@techreport{pb-wcann-80t
, author =	"C. H. Papadimitriou and J. L. Bentley"
, title =	"A worst-case analysis of nearest neighbor searching by projection"
, type =	"Report"
, number =	"CMU-CS-80-109"
, institution =	"Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1980
, update =	"97.11 bibrelex"
}

@inproceedings{pb-wcann-80
, author =	"C. H. Papadimitriou and J. L. Bentley"
, title =	"A worst-case analysis of nearest neighbor searching by projection"
, booktitle =	"Proc. 7th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	85
, publisher =	"Springer-Verlag"
, year =	1980
, pages =	"470--482"
}

@inproceedings{ps-bwgg-90
, author =	"C. H. Papadimitriou and M. Sideri"
, title =	"The bisection width of grid graphs"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"405--410"
}

@techreport{ps-ffptp-87
, author =	"C. H. Papadimitriou and E. B. Silverberg"
, title =	"Finding feasible paths for a two-point body"
, type =	"Technical {Memo}"
, number =	"45413-870603-01"
, institution =	"Bell Lab."
, address =	"Murray Hill, NJ"
, year =	1987
, keywords =	"motion planning, path planning, geodesic distance, shortest paths"
}

@techreport{ps-oplmo-86
, author =	"C. H. Papadimitriou and E. B. Silverberg"
, title =	"Optimal piecewise linear motion of an object among obstacles"
, type =	"Technical {Report}"
, institution =	"Dept. Oper. Res., Stanford Univ."
, address =	"Stanford, CA"
, year =	1986
, update =	"98.07 bibrelex"
}

@article{ps-oplmo-87
, author =	"C. H. Papadimitriou and E. B. Silverberg"
, title =	"Optimal piecewise linear motion of an object among obstacles"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"523--539"
, keywords =	"motion planning, path planning, shortest paths"
}

@book{ps-coac-82
, author =	"C. H. Papadimitriou and K. Steiglitz"
, title =	"Combinatorial Optimization: Algorithms and Complexity"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1982
}

@inproceedings{ps-scrts-76
, author =	"C. H. Papadimitriou and K. Steiglitz"
, title =	"Some complexity results for the traveling salesman problem"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
, year =	1976
, pages =	"1--9"
, comments =	"Split into two journal papers: \cite{ps-clsts-77} and
		 \cite{p-etspi-77}"
, precedes =	"ps-clsts-77, p-etspi-77"
, update =	"93.09 jones"
}

@article{ps-clsts-77
, author =	"C. H. Papadimitriou and K. Steiglitz"
, title =	"The complexity of local search for the traveling salesman problem"
, journal =	"SIAM J. Comput."
, volume =	6
, year =	1977
, pages =	"76--83"
, succeeds =	"ps-scrts-76"
, precedes =	"p-etspi-77"
}

@article{pv-tgprt-84
, author =	"C. H. Papadimitriou and U. V. Vazirani"
, title =	"On two geometric problems related to the traveling salesman problem"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"231--246"
}

@article{py-crstp-82
, author =	"C. H. Papadimitriou and M. Yanakakis"
, title =	"The complexity of restricted spanning tree problems"
, journal =	"J. ACM"
, volume =	29
, year =	1982
, pages =	"285--309"
, update =	"98.03 bibrelex"
}

@inproceedings{py-spwm-89
, author =	"C. H. Papadimitriou and M. Yannakakis"
, title =	"Shortest paths without a map"
, booktitle =	"Proc. 16th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	372
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"610--620"
, keywords =	"path planning"
, precedes =	"py-spwm-91"
, update =	"98.03 icking"
}

@article{py-spwm-91
, author =	"C. H. Papadimitriou and M. Yannakakis"
, title =	"Shortest Paths Without a Map"
, journal =	"Theoret. Comput. Sci."
, volume =	84
, number =	1
, year =	1991
, pages =	"127--150"
, keywords =	"path planning, competitive ratio, unknown map"
, succeeds =	"py-spwm-89"
, update =	"98.03 bibrelex+icking+mitchell"
}

@inproceedings{py-cfsfc-82
, author =	"C. H. Papadimitriou and M. Yannakakis"
, title =	"The complexity of facets (and some facets of complexity)"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
, year =	1982
, pages =	"255--260"
, precedes =	"py-cfsfc-84"
}

@article{py-cfsfc-84
, author =	"C. H. Papadimitriou and M. Yannakakis"
, title =	"The complexity of facets (and some facets of complexity)"
, journal =	"J. Comput. Syst. Sci."
, volume =	28
, year =	1984
, pages =	"244--259"
, succeeds =	"py-cfsfc-82"
}

@inproceedings{py-cfr-85
, author =	"C. H. Papadimitriou and M. Yannakakis"
, title =	"The complexity of facets resolved"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"74--78"
, precedes =	"py-cfr-88"
}

@article{py-cfr-88
, author =	"C. H. Papadimitriou and M. Yannakakis"
, title =	"The complexity of facets resolved"
, journal =	"J. Comput. Syst. Sci."
, volume =	37
, year =	1988
, pages =	"2--13"
, succeeds =	"py-cfr-85"
}

@incollection{pm-pnnqr-97
, author =	"Apostolos Papadopoulos and Yannis Manolopoulos"
, title =	"Performance of nearest neighbor queries in {R}-trees"
, booktitle =	"Database Theory---ICDT'97, 6th International Conference"
, series =	"Lecture Notes Comput. Sci."
, volume =	1186
, publisher =	"Springer"
, year =	1997
, pages =	"394--408"
, isbn =	"3-540-62222-5"
, update =	"98.03 mitchell, 97.07 agarwal"
}

@inproceedings{pl-ecgvd-95
, author =	"Evanthia Papadopoulou and D. T. Lee"
, title =	"Efficient computation of the geodesic {Voronoi} diagram of points in a simple polygon"
, booktitle =	"Algorithms---ESA~'95, Third Annual European Symposium"
, site =	"Corfu, Greece"
, series =	"Lecture Notes Comput. Sci."
, volume =	979
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"238--251"
, issn =	"3-540-60313-1"
, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{pl-spspp-94
, author =	"E. Papadopoulou and D. T. Lee"
, title =	"Shortest Paths in a Simple Polygon in the Presence of ``Forbidden'' Vertices"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"110--115"
, cites =	"a-gvdps-89, gm-osacv-91, ghlst-ltavs-87, hs-cmlpg-91, lp-esppr-84, m-spop-93, ms-scg-, ps-cgi-85, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{pl-svdlinf-2001
, author  = {Evanthia Papadopoulou and D. T. Lee}
, title   = {The {L}$\infty$ {Voronoi} diagram of segments and {VLSI} applications}
, journal = {International Journal of Computational Geometry and Applications}
, volume  = {11}
, number  = {5}
, year    = {2001}
, pages   = "503--528"
}

@phdthesis{p-ivodg-96
, author =	"A. Papakostas"
, title =	"Information Visualization: Orthogonal Drawings of Graphs"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Computer Science, University of Texas at Dallas"
, month =	dec
, year =	1996
, keywords =	"doctoral thesis, graph drawing, orthogonal, 3D"
, update =	"98.07 patrignani"
}

@inproceedings{p-uptod-95
, author =	"A. Papakostas"
, title =	"Upward Planarity Testing of Outerplanar Dags"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"298--306"
, keywords =	"graph drawing, planar, upward"
, update =	"95.01 tamassia"
}

@inproceedings{pst-etrio-97
, author =	"Achilleas Papakostas and Janet M. Six and Ioannis G. Tollis"
, title =	"Experimental and Theoretical Results in Interactive Graph Drawing"
, editor =	"Stephen North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"371--386"
, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
}

@techreport{pst-iogde-99
, author =	"A. Papakostas and J. M. Six and I. G. Tollis"
, title =	"Interactive Orthogonal Graph Drawing: An Experimental Study"
, type =	"Technical Report"
, number =	"UTDCS-3-99"
, institution =	"Dept. Comput. Sci., Univ. Texas Dallas"
, month =	may
, year =	1999
, update =	"99.07 vismara"
}

@article{pt-aaeod-98
, author =	"Achilleas Papakostas and Ioannis G. Tollis"
, title =	"Algorithms for Area-Efficient Orthogonal Drawings"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, number =	"1--2"
, year =	1998
, pages =	"83--110"
, note =	"Special Issue on Geometric Representations of
                  Graphs, G.~{Di Battista} and R.~Tamassia, editors"
, keywords =	"graph drawing, orthogonal"
, succeeds =	"pt-iabod-95"
, update =	"98.11 patrignani+tamassia+vismara"
}

@techreport{pt-iabod-96
, author =	"A. Papakostas and I. G. Tollis"
, title =	"Improved Algorithms and Bounds for Orthogonal Drawings"
, type =	"Manuscript"
, year =	1995
, keywords =	"graph drawing"
, update =	"98.07 bibrelex, 96.09 tamassia"
}

@inproceedings{pt-iabod-95
, author =	"A. Papakostas and I. G. Tollis"
, title =	"Improved Algorithms and Bounds for Orthogonal Drawings"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"40--51"
, keywords =	"graph drawing, orthogonal"
, update =	"95.01 tamassia"
}

@inproceedings{pt-iogdt-97
, author =	"Achilleas Papakostas and Ioannis G. Tollis"
, title =	"Incremental Orthogonal Graph Drawing in Three Dimensions"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"52--63"
, keywords =	"graph drawing, orthogonal, 3D"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{pt-iogd-98
, author =	"A. Papakostas and I. G. Tollis"
, title =	"Interactive Orthogonal Graph Drawing"
, journal =	"IEEE Trans. Comput."
, volume =	"C-47"
, number =	11
, year =	1998
, pages =	"1297--1309"
, succeeds =	"pt-iiogd-96"
, update =	"99.07 vismara"
}

@inproceedings{pt-iiogd-96
, author =	"A. Papakostas and I. G. Tollis"
, title =	"Issues in Interactive Orthogonal Graph Drawing"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"419--430"
, update =	"98.11 bibrelex, 98.07 vismara"
}

@book{p-mccpi-80
, author =	"S. Papert"
, title =	"Mindstorms: {Children}, Computers and Powerful Ideas"
, publisher =	"Basic Books"
, address =	"New York, NY"
, year =	1980
, update =	"97.11 bibrelex"
}

@article{pm-cmeso-94
, author =	"L. Parida and S. P. Mudur"
, title =	"Computational Methods for Evaluating Swept Object Boundaries"
, journal =	"Visual Comput."
, volume =	10
, number =	5
, year =	1994
, pages =	"266--276"
, update =	"96.01 held"
}

@mastersthesis{p-prr-89
, author =	"P. Paripati"
, title =	"Polyhedra: Representation and Recognition"
, school =	"Dept. Comput. Sci., Virginia Poytechnic Inst. and State Univ."
, address =	"Blacksburg, VA"
, year =	1989
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@incollection{ph-mipa-77
, author =	"J. Paris and L. Harrington"
, title =	"A mathematical incompleteness in {P}eano arithmetic"
, editor =	"J. Barwise"
, booktitle =	"Handbook of Mathematical Logic"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1977
, pages =	"1133--1142"
, update =	"95.09 agarwal"
}

@inproceedings{pg-taitd-92
, author =	"K. Park and Z. Galil"
, title =	"Truly alphabet-independent two-dimensional pattern matching"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"247--256"
}

@inproceedings{plc-ccps1-01
, author =	"Sang-Min Park and Jae-Ha Lee and Kyung-Yong Chwa"
, title =	"A Characterizatin of the Class of Polygons Searchable by a 1-Searcher"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"133--136"
, update =	"01.04 icking"
}

@inproceedings{p-bbcra-96
, author =	"L. E. Parker"
, title =	"Behavior-based cooperative robotics applied to multi-target observation"
, booktitle =	"Proc. Dagstuhl Seminar on Modeling and Planning for Sensor-Based Intelligent Robot Systems"
, site =	"Dagstuhl, Germany"
, month =	sep
, year =	1996
, update =	"98.07 bibrelex"
}

@article{p-culdo-96
, author =	"P. Parodi"
, title =	"The Complexity of Understanding Line Drawings of Origami Scenes"
, journal =	"Internat. J. Comput. Vision"
, volume =	18
, number =	2
, year =	1996
, pages =	"139--170"
, update =	"97.03 held"
}

@techreport{plvt-edecl-96
, author =	"P. Parodi and R. Lancewicki and A. Vijh and J. K. Tsotsos"
, title =	"Empirically-derived Estimates of the Complexity of Labelling Line Drawings of Polyhedral Scenes"
, number =	"RBCV-TR-96-52"
, institution =	"Dept. Comput. Sci., Univ. Toronto"
, address =	"Toronto, ON"
, year =	1996
, update =	"98.03 mitchell, 97.03 held"
}

@article{pp-3dsru-96
, author =	"P. Parodi and G. Piccioli"
, title =	"3D Shape Reconstruction by Using Vanishing Points"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	18
, number =	2
, month =	feb
, year =	1996
, pages =	"211--217"
, update =	"97.03 held"
}

@article{pt-clppp-94
, author =	"P. Parodi and V. Torre"
, title =	"On the Complexity of Labeling Perspective Projections of Polyhedra"
, journal =	"Artif. Intell."
, volume =	70
, number =	1
, year =	1994
, pages =	"1--38"
, update =	"97.03 held"
}

@inproceedings{pt-cocpc-92
, author =	"D. Parson and C. Torras"
, title =	"The combinatorics of overlapping convex polygons in contact"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"83--92"
, cites =	"c-pcp-83, ls-ncfcc-87, pt-ccsbc-91, ss-pmp1c-83, s-pds-74, tt-mtcpc-89, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{pt-ccsbc-91
, author =	"D. Parsons and C. Torras"
, title =	"On the complexity of the contact space between convex polyhedra"
, type =	"Technical {Report}"
, institution =	"Institut de Cibern{\`e}tica, Universitat Polit{\'e}cnica de Catalunia - CSIC"
, address =	"Barcelona, Spain"
, year =	1991
, update =	"98.07 bibrelex"
}

@incollection{p-peg-76
, author =	"T. D. Parsons"
, title =	"Pursuit-evasion in a graph"
, editor =	"Y. Alavi and D. Lick"
, booktitle =	"Theory and Applications of Graphs"
, series =	"Lecture Notes Math."
, volume =	642
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1976
, pages =	"426--441"
, update =	"98.07 bibrelex"
}

@article{pd-padbo-91
, author =	"S. K. Parui and A. Datta"
, title =	"A parallel algorithm for decomposition of binary objects through skeletonization"
, journal =	"Pattern Recogn. Lett."
, volume =	12
, year =	1991
, pages =	"235--240"
, update =	"93.09 milone+mitchell"
}

@phdthesis{p-kpudz-82
, author =	"I. Paschinger"
, title =	"{Konvexe} {Polytope} und {Dirichletsche} {Zellenkomplexe}"
, type =	"Ph.{D}. Thesis"
, school =	"Institut f{\"u}r Mathematik, Universit{\"a}t Salzburg"
, address =	"Salzburg, Austria"
, year =	1982
, keywords =	"doctoral thesis"
}

@inproceedings{pfp-diccb-95
, author =	"V. Pascucci and V. Ferrucci and A. Paoluzzi"
, title =	"Dimension-independent convex-cell based HPC: Representation scheme and implementation issues"
, editor =	"C. Hoffmann and J. Rossignac"
, booktitle =	"Solid Modeling '95"
, publisher =	"ACM Press"
, year =	1995
, pages =	"163--174"
, update =	"97.11 bibrelex"
}

@article{p-isnod-90
, author =	"M. Paterson"
, title =	"Improved sorting networks with $O(\log N)$ depth"
, journal =	"Algorithmica"
, volume =	5
, number =	1
, year =	1990
, pages =	"75--92"
, update =	"96.09 orourke"
}

@inproceedings{py-bpahs-89
, author =	"M. S. Paterson and F. F. Yao"
, title =	"Binary partitions with applications to hidden surface removal and solid modelling"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, site =	"Saarbr{\"u}cken"
, year =	1989
, pages =	"23--32"
, precedes =	"py-ebsph-90"
, cites =	"c-iies-84, cgl-pgd-83, dghs-eafcr-88, e-acg-87, fkn-vsgpt-80, g m-vlbe-59, gy-tsr-83, k-acp-73, p-hresr-84, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{py-ebsph-90
, author =	"M. S. Paterson and F. F. Yao"
, title =	"Efficient binary space partitions for hidden-surface removal and solid modeling"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"485--503"
, succeeds =	"py-bpahs-89"
}

@incollection{py-nng-92
, author =	"M. S. Paterson and F. F. Yao"
, title =	"On Nearest-Neighbor Graphs"
, booktitle =	"Proc. 19th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	623
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"416--426"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@techreport{py-obspo-90t
, author =	"M. S. Paterson and F. F. Yao"
, title =	"Optimal binary space partitions for orthogonal objects"
, type =	"Research {Report}"
, number =	158
, institution =	"Univ. Warwick"
, year =	1990
, succeeds =	"py-obspo-90"
, precedes =	"py-obspo-92"
, update =	"98.07 bibrelex"
}

@inproceedings{py-obspo-90
, author =	"M. S. Paterson and F. F. Yao"
, title =	"Optimal binary space partitions for orthogonal objects"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"100--106"
, precedes =	"py-obspo-92"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@article{py-obspo-92
, author =	"M. S. Paterson and F. F. Yao"
, title =	"Optimal binary space partitions for orthogonal objects"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"99--113"
, succeeds =	"py-obspo-90, py-obspo-90t"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@article{py-prp-86
, author =	"M. S. Paterson and F. F. Yao"
, title =	"Point retrieval for polygons"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"441--447"
}

@book{p-fpr-72
, author =	"E. A. Patrick"
, title =	"Fundamentals of Pattern Recognition"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1972
, update =	"97.03 schwarzkopf"
}

@article{pf-gknnd-70
, author =	"E. A. Patrick and F. P. Fisher"
, title =	"Generalized $k$-nearest neighbor decision rule"
, journal =	"Inform. Control"
, volume =	16
, month =	apr
, year =	1970
, pages =	"128--152"
}

@techreport{p-coc-99
, author =	"Maurizio Patrignani"
, title =	"On the Complexity of Orthogonal Compaction"
, type =	"Technical {Report}"
, number =	"RT-DIA-39-99"
, institution =	"Dipartimento di Informatica e Automazione, Universit{\`a} di Roma Tre"
, address =	"Rome, Italy"
, month =	jan
, year =	1999
, url =	"http://www.dia.uniroma3.it/research/tech-rep/dia-39-99.ps"
, keywords =	"graph drawing, planar, orthogonal, area, edge length, NP-completeness"
, update =	"99.03 patrignani+vismara"
}

@inproceedings{p-coc-99i
, author =	"M. Patrignani"
, title =	"On the Complexity of Orthogonal Compaction"
, editor =	"F. Dehne and A. Gupta and J.-R. Sack and R. Tamassia"
, booktitle =	"Algorithms and Data Structures"
, nickname =	"WADS '99"
, series =	"Lecture Notes Comput. Sci."
, volume =	1663
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"56--61"
, update =	"00.03 vismara"
}

@article{p-coc-01
, author =	"M. Patrignani"
, title =	"On the Complexity of Orthogonal Compaction"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"47--67"
, update =	"01.07 smid"
}

@inproceedings{pv-3dttd-97
, author =	"Maurizio Patrignani and Francesco Vargiu"
, title =	"{3DCube}: A Tool for Three Dimensional Graph Drawing"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"284--290"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{p-acrs-89
, author =	"N. M. Patrikalakis"
, title =	"Approximate Conversion of Rational Splines"
, journal =	"Comput. Aided Geom. Design"
, volume =	6
, number =	2
, year =	1989
, pages =	"155--165"
, update =	"95.05 abrams"
}

@inproceedings{p-gmcas-86
, author =	"N. M. Patrikalakis"
, title =	"Geometric Modeling in Computer Aided Ship Design"
, booktitle =	"Proc. Marine Computers '86"
, year =	1986
, update =	"95.05 abrams"
}

@incollection{p-isi-92
, author =	"N. M. Patrikalakis"
, title =	"Interrogation of Surface Intersections"
, chapter =	8
, editor =	"R. E. Barnhill"
, booktitle =	"Geometry Processing for Design and Manufacturing"
, publisher =	"Society for Industrial and Applied Mathematics"
, address =	"Philadelphia, PA"
, year =	1992
, pages =	"161--185"
, update =	"95.05 abrams"
}

@inproceedings{p-si-88
, author =	"N. M. Patrikalakis"
, title =	"Shape Interrogation"
, editor =	"C. Chryssostomidis"
, booktitle =	"Proc. 16th Annual MIT Sea Grant College Program Lecture and Seminar: Automation in the Design and Manufacture of Large Marine Systems"
, year =	1990
, pages =	"83--104"
, update =	"95.05 abrams"
}

@article{p-ssi-93
, author =	"N. M. Patrikalakis"
, title =	"Surface-to-Surface Intersections"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	13
, number =	1
, year =	1993
, pages =	"89--95"
, update =	"95.05 abrams"
}

@inproceedings{paht-pcagm-90
, author =	"N. M. Patrikalakis and P. G. Alourdas and G. R. Hottel and S. T. Tuohy"
, title =	"Praxiteles: A Computer Aided Geometric Modeling System"
, booktitle =	"Proc. Fifth International Conference on Marine Technology"
, year =	1990
, pages =	"221--227"
, update =	"95.05 abrams"
}

@article{pb-febmp-92
, author =	"N. M. Patrikalakis and L. Bardis"
, title =	"Feature Extraction from {B}-Spline Marine Propeller Representations"
, journal =	"Journal of Ship Research"
, volume =	36
, number =	3
, year =	1992
, pages =	"233--247"
, update =	"95.05 abrams"
}

@article{pb-lrbs-91
, author =	"N. M. Patrikalakis and L. Bardis"
, title =	"Localization of Rational {B}-Spline Surfaces"
, journal =	"Engineering with Computers"
, volume =	7
, number =	4
, year =	1991
, pages =	"237--252"
, update =	"95.05 abrams"
}

@article{pb-ocrbs-89
, author =	"N. M. Patrikalakis and L. Bardis"
, title =	"Offsets of Curves on Rational {B}-Spline Surfaces"
, journal =	"Engineering with Computers"
, volume =	5
, year =	1989
, pages =	"39--46"
, update =	"95.05 abrams"
}

@article{pbk-abgld-90
, author =	"N. M. Patrikalakis and L. Bardis and G. A. Kriezis"
, title =	"Approximation of {B}-Spline Geometries with Lower Degree Representations"
, journal =	"Journal of Offshore Mechanics and Arctic Engineering, ASME Transactions"
, volume =	112
, number =	3
, year =	1990
, pages =	"192--198"
, update =	"95.05 abrams"
}

@inproceedings{pchmsz-trgm1-94
, author =	"N. M. Patrikalakis and W. Cho and C.-Y. Hu and T. Maekawa and E. C. Sherbrooke and J. Zhou"
, title =	"Towards Robust Geometric Modellers, 1994 Progress Report"
, booktitle =	"Proc. 1995 NSF Design and Manufacturing Grantees Conference"
, year =	1995
, pages =	"139--140"
, update =	"95.05 abrams"
}

@inproceedings{pctblbmy-veoev-95
, author =	"N. M. Patrikalakis and C. Chryssostomidis and S. T. Tuohy and J. G. Bellingham and J. J. Leonard and J. W. Bales and B. A. Moran and J. W. Yoon"
, title =	"Virtual Environments for Ocean Exploration and Visualization"
, booktitle =	"Proc. CES '95: Workshop on Computer Technology for the Exploration of the Sea"
, year =	1995
, update =	"95.05 abrams"
}

@inproceedings{pg-simat-90
, author =	"N. M. Patrikalakis and H. N. G{\"u}rsoy"
, title =	"Shape Interrogation by Medial Axis Transform"
, booktitle =	"Proc. 16th ASME Design Automation Conference"
, site =	"Chicago"
, month =	sep
, year =	1990
, pages =	""
, update =	"93.09 held"
}

@inproceedings{phms-trgm-94
, author =	"N. M. Patrikalakis and C.-Y. Hu and T. Maekawa and E. C. Sherbrooke"
, title =	"Towards Robust Geometric Modellers"
, booktitle =	"Proc. 1994 NSF Design and Manufacturing Grantees Conference"
, year =	1994
, pages =	"199--200"
, update =	"95.05 abrams"
}

@inproceedings{pk-pcast-90
, author =	"N. M. Patrikalakis and G. A. Kriezis"
, title =	"Piecewise Continuous Algebraic Surfaces in Terms of {B}-Splines"
, editor =	"M. J. Wozny and J. U. Turner and K. Preiss"
, booktitle =	"Proc. of the 1988 International Federation of Information Processing WG 5.2 / National Science Foundation Working Conference on Geometric Modeling: Geometric Modeling for Product Engineering"
, year =	1990
, pages =	"3--19"
, update =	"95.05 abrams"
}

@article{pk-rpcas-89
, author =	"N. M. Patrikalakis and G. A. Kriezis"
, title =	"Representation of Piecewise Continuous Algebraic Surfaces in Terms of {B}-Splines"
, journal =	"Visual Comput."
, volume =	5
, number =	6
, year =	1989
, pages =	"360--374"
, update =	"95.05 abrams"
}

@inproceedings{pkp-issip-90
, author =	"N. M. Patrikalakis and G. A. Kriezis and P. V. Prakash"
, title =	"Investigation on Surface-to-Surface Intersection Problems"
, booktitle =	"Proc. 16th Annual NSF Grantees Conference on Manufacturing Systems Research"
, year =	1990
, pages =	"169--176"
, update =	"95.05 abrams"
}

@inproceedings{pmsz-csed-92
, author =	"N. M. Patrikalakis and T. Maekawa and E. C. Sherbrooke and J. Zhou"
, title =	"Computation of Singularities for Engineering Design"
, editor =	"L. Kunii and Y. Shinagawa"
, booktitle =	"Proc. International Workshop on Modern Geometric Computing for Visualization"
, year =	1992
, pages =	"167--191"
, update =	"95.05 abrams"
}

@article{pp-ffpmu-88
, author =	"N. M. Patrikalakis and P. V. Prakash"
, title =	"Free-Form Plate Modeling Using Offset Surfaces"
, journal =	"Journal of Offshore Mechanics and Arctic Engineering, ASME Transactions"
, volume =	110
, number =	3
, year =	1988
, pages =	"287--294"
, update =	"95.05 abrams"
}

@inproceedings{pp-itsp-89
, author =	"N. M. Patrikalakis and P. V. Prakash"
, title =	"Intersections for Trimmed Surface Patches"
, booktitle =	"Proc. 8th International Symposium on Offshore Mechanics and Arctic Engineering"
, year =	1989
, pages =	"211--222"
, update =	"95.05 abrams"
}

@article{pp-sigm-90
, author =	"N. M. Patrikalakis and P. V. Prakash"
, title =	"Surface Intersections for Geometric Modeling"
, journal =	"Journal of Mechanical Design, ASME Transactions"
, volume =	112
, number =	1
, year =	1990
, pages =	"100--107"
, update =	"95.05 abrams"
}

@incollection{ppgk-rtsi-91
, author =	"N. M. Patrikalakis and P. V. Prakash and H. N. G{\"u}rsoy and G. A. Kriezis"
, title =	"Research Topics in Shape Interrogation"
, chapter =	2
, editor =	"N. Magnenat-Thalmann and D. Thalmann"
, booktitle =	"New Trends in Animation and Visualization"
, publisher =	"John Wiley \& Sons"
, address =	"London, UK"
, year =	1991
, pages =	"13--41"
, update =	"99.11 bibrelex, 95.05 abrams"
}

@article{p-dmdci-35
, author =	"A. L. Patterson"
, title =	"A direct method for the determination of the components of interatomic distances in crystals"
, journal =	"Zeitschrift Krist."
, volume =	90
, year =	1935
, pages =	"517--542"
, update =	"97.11 bibrelex"
}

@article{p-axrac-44
, author =	"A. L. Patterson"
, title =	"Amibguities in the {X}-ray analysis of crystal structures"
, journal =	"Physical Review"
, volume =	65
, year =	1944
, pages =	"195--201"
, update =	"97.11 bibrelex"
}

@book{p-rmmpc-81
, author =	"R. P. Paul"
, title =	"Robot Manipulators, Mathematics, Programming and Control"
, publisher =	"MIT Press"
, year =	1981
, update =	"97.11 bibrelex"
}

@book{ps-dtram-80
, author =	"W. Paul and J. Simon"
, title =	"Decision trees and random access machines"
, series =	"Logic and Algorithmic Monographs"
, volume =	30
, publisher =	"Enseignement Mathematique"
, year =	1980
, update =	"97.11 bibrelex"
}

@inproceedings{pvw-pd23t-83
, author =	"W. Paul and U. Vishkin and H. Wagener"
, title =	"Parallel Dictionaries on 2-3 Trees"
, booktitle =	"Proceedings of the Tenth ICALP"
, year =	1983
, pages =	"597--609"
, update =	"96.09 orourke"
}

@inproceedings{phkv-vboos-93
, author =	"W. De Pauw and R. Helm and D. Kimelman and J. Vlissides"
, title =	"Visualizing the Behavior of Object-Oriented Systems"
, booktitle =	"Proc. 8th Annu. ACM Conf. Object-Oriented Program. Syst. Lang. Appl."
, series =	"SIGPLAN Notices"
, volume =	28
, year =	1993
, pages =	"326--337"
, keywords =	"graph drawing"
, update =	"96.09 tamassia, 96.04 garg"
}

@book{p-agip-82
, author =	"T. Pavlidis"
, title =	"Algorithms for Graphics and Image Processing"
, publisher =	"Computer Science Press"
, address =	"Berlin, West Germany"
, year =	1982
}

@article{p-asp-68
, author =	"T. Pavlidis"
, title =	"Analysis of set patterns"
, journal =	"Pattern Recogn."
, volume =	1
, year =	1968
, pages =	"165--178"
}

@book{p-cg-78
, author =	"T. Pavlidis"
, title =	"Computer Graphics"
, publisher =	"Computer Science Press"
, address =	"Potomac, MD"
, year =	1978
, update =	"98.11 bibrelex"
}

@article{p-farg-79
, author =	"T. Pavlidis"
, title =	"Filling algorithms for raster graphics"
, journal =	"Comput. Graph. Image Process."
, volume =	10
, year =	1979
, pages =	"126--141"
, update =	"98.07 bibrelex"
}

@article{p-rflg-72
, author =	"T. Pavlidis"
, title =	"Representation of figures by labelled graphs"
, journal =	"Pattern Recogn."
, volume =	4
, year =	1972
, pages =	"5--17"
}

@article{pv-abdi-85
, author =	"T. Pavlidis and C. J. {Van Wyk}"
, title =	"An Automatic Beautifier for Drawings and Illustrations"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, year =	1985
, pages =	"225--234"
, note =	"Proc. SIGGRAPH '85"
, update =	"94.09 lambert, 93.09 milone+mitchell"
}

@article{p-mttss-67
, author =	"A. Paz"
, title =	"Minimization theorems and techniques for sequential stochastic machines"
, journal =	"Inform. Control"
, volume =	11
, year =	1967
, pages =	"155--166"
, update =	"93.09 milone+mitchell"
}

@book{p-hissc-84
, author =	"J. Pearl"
, title =	"Heuristics: Intelligent Search Strategies for Computer Problem Solving"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1984
, keywords =	"book"
}

@article{p-icnt-86
, author =	"J. Pecht"
, title =	"On the index of concavity of neighborhood templates"
, journal =	"Acta Cybern."
, volume =	7
, year =	1986
, pages =	"373--376"
}

@article{p-oksp-85
, author =	"G. W. Peck"
, title =	"On $k$-sets in the plane"
, journal =	"Discrete Math."
, volume =	56
, year =	1985
, pages =	"73--74"
, update =	"98.03 agarwal"
}

@techreport{p-crz-91
, author =	"P. Pedersen"
, title =	"Counting real zeros"
, type =	"Technical {Report}"
, number =	"545-R243"
, institution =	"New York Univ."
, address =	"New York, NY"
, year =	1991
, update =	"98.03 bibrelex"
}

@book{p-gcc-70
, author =	"D. Pedoe"
, title =	"Geometry, a comprehensive course"
, publisher =	"Dover Publications"
, address =	"New York"
, year =	1970
}

@inproceedings{pw-spcgs-89
, author =	"J. Pegna and F.-E. Wolter"
, title =	"A Simple Practical Criterion to Guarantee Second Order Smoothness of Blend Surfaces"
, editor =	"B. Ravani"
, booktitle =	"Proc. 15th ASME Design Automation Conference: Advances in Design Automation"
, volume =	1
, year =	1989
, pages =	"93--105"
, update =	"95.05 abrams"
}

@inproceedings{pw-dmtcs-90
, author =	"J. Pegna and F.-E. Wolter"
, title =	"Designing and Mapping Trimming Curves on Surfaces Using Orthogonal Projection"
, editor =	"B. Ravani"
, booktitle =	"Proc. of the 16th ASME Design Automation Conference: Advances in Design Automation, Computer Aided and Computational Design"
, volume =	"I"
, year =	1990
, pages =	"235--245"
, update =	"95.05 abrams"
}

@article{pw-dmtcs-94
, author =	"J. Pegna and F.-E. Wolter"
, title =	"Designing and Mapping Trimming Curves on Surfaces Using Orthogonal Projection"
, journal =	"Journal of Mechanical Design, ASME Transactions"
, volume =	"??"
, year =	1994
, note =	"To appear"
, update =	"95.05 abrams"
}

@article{pw-gcgcc-92
, author =	"J. Pegna and F.-E. Wolter"
, title =	"Geometrical Criteria to Guarantee Curvature Continuity of Blend Surfaces"
, journal =	"Journal of Mechanical Design, ASME Transactions"
, volume =	114
, number =	1
, year =	1992
, pages =	"201--210"
, update =	"95.05 abrams"
}

@inproceedings{pw-frrp-97
, author =	"Naixun Pei and Sue Whitesides"
, title =	"On Folding Rulers in Regular Polygons"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"11--16"
, update =	"97.11 jones"
}

@inproceedings{pw-rrc-96
, author =	"N. Pei and S. Whitesides"
, title =	"On the reachable regions of chains"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"161--166"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{p-rcbt-94
, author =	"Roberto Peirone"
, title =	"Reflections can be trapped"
, journal =	"Amer. Math. Monthly"
, volume =	101
, year =	1994
, pages =	"259--260"
, update =	"01.04 orourke"
}

@techreport{pr-old-87
, author =	"A. Pelc and I. Rival"
, title =	"Orders with Level Diagrams"
, number =	"TR-87-11"
, institution =	"Department of Computer Science, University of Ottawa"
, month =	mar
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ps-gs-89
, author =	"D. Peleg and A. Sch{\"a}ffer"
, title =	"Graph spanners"
, journal =	"J. Graph Theory"
, volume =	13
, year =	1989
, pages =	"99--116"
, update =	"97.11 bibrelex"
}

@inproceedings{pu-osh-87
, author =	"D. Peleg and J. Ullman"
, title =	"An optimal synchonizer for the hypercube"
, booktitle =	"Proc. 6th ACM Symp. on Princ. Distr. Comp."
, year =	1987
, pages =	"77--85"
, precedes =	"pu-osh-89"
, update =	"98.07 bibrelex"
}

@article{pu-osh-89
, author =	"D. Peleg and J. Ullman"
, title =	"An optimal synchonizer for the hypercube"
, journal =	"SIAM J. Comput."
, volume =	18
, year =	1989
, pages =	"740--747"
, succeeds =	"pu-osh-87"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@inproceedings{pu-tbser-88
, author =	"D. Peleg and E. Upfal"
, title =	"A tradeoff between space and efficiency for routing tables"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"43--52"
, update =	"97.11 bibrelex"
}

@techreport{p-bcspi-93
, author =	"M. Pellegrini"
, title =	"Building convex space partitions induced by pairwise interior-disjoint simplices"
, type =	"Technical {Report}"
, number =	"ICSI TR-93-039"
, institution =	"ICSI"
, month =	aug
, year =	1993
, update =	"98.03 bibrelex"
}

@phdthesis{p-caasv-91
, author =	"M. Pellegrini"
, title =	"Combinatorical and algorithmic analysis of stabbing and visibility problems in $3$-dimensional space"
, school =	"Courant Inst. Math. Sci., New York University"
, address =	"New York, NY"
, month =	feb
, year =	1991
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{p-efwst-96
, author =	"Marco Pellegrini"
, title =	"Electrostatic fields without singularities: {Theory} and algorithms"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"184--191"
, keywords =	"electrostatic force between simplices, Monte Carlo method, integral geometry, approximation, charge densities"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@inproceedings{p-innpl-92
, author =	"M. Pellegrini"
, title =	"Incidence and nearest-neighbor problems for lines in $3$-space"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"130--137"
, cites =	"aass-sdp-90, am-rsps-92, as-tsbac-90, as-anps-91, as-cscas-, as-zsha-91, cegpsss-ccclr-90, cegs-lscaa-89, cegs-sessr-89, cegs-dwclp-92, ck-plscc-89, c-sdsno-87, cs-agpli-88, csw-qoubs-90, bhosk-ershs-91, egs-ccmfa-90, fhs-cmsp-89, gss-gmppt-88, h-cscca-91, ho-empls-89, ks-ampsc-88, ls-esmpa-87, ls-pptmc-87, m-ept-91, m-apcad-83, p-srs3d-90, p-rsicl-91, ps-fsl3s-92, ss-smprg-89, t-epcp-91, ZZZ"
, update =	"97.11 bibrelex"
}

@article{p-lbsl3-93
, author =	"M. Pellegrini"
, title =	"Lower bounds on stabbing lines in 3-space"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"53--58"
, update =	"97.11 aronov"
}

@inproceedings{p-mcaff-95
, author =	"Marco Pellegrini"
, title =	"{Monte Carlo} Approximation of Form Factors with Error Bounded a Priori"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"287--296"
, keywords =	""
, cites =	"a-ijpop-94, bgsss-mcm-66, bo-arcgi-79, cg-hrsce-85, dr-mni-75, ejla-csmcd-91, f-iptia-68, hsa-rhra-91, jvv-rgcsu-86, kkkll-mcaep-90, lsg-beer-94, m-sosdr-91, m-hsrrm-91, ps-cgi-85, pt-dpplo-90, s-igbmf-93, s-iggp-76, sh-trht-92, sp-gtpmi-89, s-tlpm-87, weh-rtapr-89, wrc-rtsdi-88, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@techreport{p-nrrsi-91
, author =	"M. Pellegrini"
, title =	"New results on ray-shooting and isotopy classes of lines in $3$-dimensional space"
, year =	1991
, update =	"97.11 bibrelex"
}

@article{p-cfpsc-94
, author =	"M. Pellegrini"
, title =	"On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space"
, journal =	"SIAM J. Comput."
, volume =	23
, number =	1
, year =	1994
, pages =	"133--153"
, update =	"97.03 agarwal"
}

@inproceedings{p-lmps3-93
, author =	"M. Pellegrini"
, title =	"On lines missing polyhedral sets in $3$-space"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"19--28"
, cites =	"am-rsps-92, as-anps-91, as-tsbac-90, as-car-92, c-oaitd-89, cegs-lscaa-89, cegs-ablsp-89, cegs-dwclp-92, cosw-cds-84, c-narsc-87, bhosk-ershs-91, bhok-sanvp-92, e-acg-87, egs-ccmfa-90, gy-tsr-80, m-cen-89, m-cha-90i, m-rph-91, n-pa-88, n-tsott-86, ns-spots-89, ns-tsp-89, p-srs3d-90, p-rst3s-93, p-innpl-92, ps-fsl3s-92, pss-stsps-88, ps-cgi-85, pt-espl-89, rs-eoshs-88i, ss-smprg-89, t-mss-85, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
}

@article{p-lmps3-94
, author =	"M. Pellegrini"
, title =	"On lines missing polyhedral sets in $3$-space"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"203--221"
, update =	"97.03 agarwal"
}

@inproceedings{p-plmps-94
, author =	"Marco Pellegrini"
, title =	"On Point Location and Motion Planning among Simplices"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"95--104"
, precedes =	"p-plmps-96"
, update =	"97.03 smid, 96.09 orourke, 94.01 jones"
}

@article{p-plmps-96
, author =	"Marco Pellegrini"
, title =	"On Point Location and Motion Planning among Simplices"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"1061--1081"
, succeeds =	"p-plmps-94"
, update =	"97.03 smid"
}

@inproceedings{p-zcdps-91
, author =	"M. Pellegrini"
, title =	"On the zone of a co-dimension $p$ surface in a hyperplane arrangement"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"233--238"
, precedes =	"aps-zsha-93"
, cites =	"ams-sscch-91, as-zsha-91, c-narsc-87, e-acg-87, g-cp-67, ZZZ"
, update =	"98.07 bibrelex, 95.09 aronov"
}

@inproceedings{p-rsicl-91
, author =	"M. Pellegrini"
, title =	"Ray-shooting and isotopy classes of lines in $3$-dimensional space"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"20--31"
, keywords =	"ray tracing, random sampling"
}

@incollection{p-rsls-97
, author =	"M. Pellegrini"
, title =	"Ray shooting and lines in space"
, chapter =	32
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"599--614"
, update =	"97.11 orourke"
}

@article{p-rst3s-93
, author =	"M. Pellegrini"
, title =	"Ray shooting on triangles in $3$-space"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"471--494"
, update =	"94.05 matousek"
}

@article{p-rhsrp-96
, author =	"M. Pellegrini"
, title =	"Repetitive hidden surface removal for polyhedra"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"80--101"
, update =	"96.09 smid"
}

@inproceedings{p-rhsrp-93
, author =	"Marco Pellegrini"
, title =	"Repetitive Hidden Surface Removal for Polyhedral Scenes"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"541--552"
, update =	"96.05 agarwal, 93.09 smid, 93.05 jones"
}

@inproceedings{p-srs3d-90
, author =	"M. Pellegrini"
, title =	"Stabbing and ray shooting in $3$-dimensional space"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"177--186"
, cites =	"a-dapal-89, a-rsoas-89, ak-frtrc-87, aw-alts-87, bdeg-vmpv-90, cegs-lscaa-89, c-narsc-87, cs-vppt-86, e-acg-87, egs-cmfal-88, emprww-sls-82, eos-calha-86, g-irt-89, gos-rsipl-89, hp-mag-52, hs-ndssg-86, jk-spals-88, m-ai-70, mo-al3sd-88, os-oshsr-89, s-chdch-86, sml-rtatp-88, s-agtd-34, s-pcg-88, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
}

@inproceedings{ps-fsl3d-91
, author =	"M. Pellegrini and P. Shor"
, title =	"Finding stabbing lines in $3$-dimensional space"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"24--31"
}

@article{ps-fsl3s-92
, author =	"M. Pellegrini and P. Shor"
, title =	"Finding stabbing lines in $3$-space"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"191--208"
, update =	"94.01 matousek"
}

@article{p-afilb-84
, author =	"Q. S. Peng"
, title =	"An Algorithm for Finding Intersection Lines between Two {B}-Spline Surfaces"
, journal =	"CAD"
, volume =	16
, number =	4
, month =	jul
, year =	1984
, update =	"97.11 bibrelex"
}

@inproceedings{p-emmls-73
, author =	"K. R. Penrose"
, title =	"Extremal Motion of a Moved Line Segment"
, booktitle =	"Proc. of the Montana Acad. of Sciences"
, year =	1973
, pages =	"46--51"
, update =	"93.09 milone+mitchell"
}

@article{p-p-78
, author =	"R. Penrose"
, title =	"Pentaplexity"
, journal =	"Eureka"
, volume =	39
, year =	1978
, update =	"97.11 bibrelex"
}

@inproceedings{pmp-ufemg-89
, author =	"J. Peraire and K. Morgan and J. Peiro"
, title =	"Unstructured finite element mesh generation and adaptive procedures for cfd."
, booktitle =	"{AGARD FDP}: Specialists's Meeting"
, month =	may
, year =	1989
, update =	"98.11 bibrelex"
}

@book{psu-mnp-88
, author =	"A. L. Peressini and F. E. Sullivan and J. J. Uhl"
, title =	"The Mathematics of Nonlinear Programming"
, series =	"Undergraduate Texts in Mathematics"
, publisher =	"Springer-Verlag"
, year =	1988
, update =	"97.03 gaertner+salinger"
}

@article{ps-cncsr-90
, author =	"M. Perles and S. Shelah"
, title =	"A closed $(n+1)$-convex set in {$R^{2}$} is a union of $n^{6}$ convex sets"
, journal =	"Israel J. Math."
, volume =	70
, year =	1990
, pages =	"305--312"
, update =	"98.03 bibrelex"
}

@article{p--92
, author =	"G. Perrot"
, title =	"??"
, journal =	"J. Comp. Chem."
, volume =	13
, number =	1
, year =	1992
, pages =	"1--11"
, update =	"98.03 bibrelex"
}

@article{p-nmasp-78
, author =	"H. Persson"
, title =	"{NC} Machining of Arbitrarily Shaped Pockets"
, journal =	"Comput. Aided Design"
, volume =	10
, number =	3
, month =	may
, year =	1978
, pages =	"169--174"
, update =	"93.09 held"
, annote =	"makes use of `bisector' net"
}

@incollection{p-gsa-89
, author =	"J. Pertin-Troccaz"
, title =	"Grasping: {A} state of the art"
, editor =	"O. Khatib and J. J. Craig and T. Lozano-Perez"
, booktitle =	"The Robotics Review"
, volume =	1
, publisher =	"MIT Press"
, year =	1989
, pages =	"71--98"
, update =	"98.03 bibrelex"
}

@article{ps-prmsw-88
, author =	"M. A. Peshkin and A. C. Sanderson"
, title =	"Planning robotic manipulation strategies for workpieces that slide"
, journal =	"Internat. J. Robot. Autom."
, volume =	4
, number =	5
, year =	1988
, pages =	"524--531"
, update =	"98.07 bibrelex"
}

@techreport{ps-rgpcr-85
, author =	"M. A. Peshkin and A. C. Sanderson"
, title =	"Reachable grasps on a polygon: {The} convex rope algorithm"
, type =	"Technical {Report}"
, number =	"CMU-RI-TR-85-6"
, institution =	"Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1985
, update =	"97.11 bibrelex"
}

@article{ps-rgpcr-86
, author =	"M. A. Peshkin and A. C. Sanderson"
, title =	"Reachable Grasps on a Polygon: {The} Convex Rope Algorithm"
, journal =	"Internat. J. Robot. Autom."
, volume =	"RA-2"
, year =	1986
, pages =	"53--58"
, update =	"93.09 milone+mitchell"
}

@article{ps-mpsw-88
, author =	"M. A. Peshkin and A. C. Sanderson"
, title =	"The motion of a pushed sliding workpiece"
, journal =	"Internat. J. Robot. Res."
, volume =	4
, number =	6
, year =	1988
, pages =	"569--598"
, update =	"98.07 bibrelex"
}

@inproceedings{p-srdss-73
, author =	"C. Peterkin"
, title =	"Some results on {Davenport--Schinzel} sequences"
, editor =	"R. Thomas and H. Williams"
, booktitle =	"Congressus Numer. IX: Proc. 3rd Manitoba Conf. on Numer. Math. and Computing"
, year =	1973
, pages =	"337--344"
, update =	"95.09 agarwal"
}

@techreport{p-lssic-
, author =	"J. Peters"
, title =	"Local smooth surface interpolation: {A} classification"
, type =	"Preprint"
, institution =	"Univ. Wisconsin"
, year =	"??"
, update =	"98.07 bibrelex"
}

@inproceedings{psff-atsde-97
, author =	"T. Peters and N. Stewart and P. Fussel and D. Ferguson"
, title =	"Algorithmic tolerances and semantics in data exchange"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"403--405"
, cites =	"ds-rnmgc-, hpy-rismp1-96, hpy-rismp2-96, -nwp-91, -sp-, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{p-bcsgm-??
, author =	"D. P. Peterson"
, title =	"Boundary to constructive solid geometry mappings: a focus on $2$-d issues"
, type =	"Report"
, number =	"??"
, institution =	"CAD Tech. Div., Sandia National Lab."
, address =	"Albuquerque, NM"
, year =	"??"
}

@techreport{p-hresr-84
, author =	"D. P. Peterson"
, title =	"Halfspace representation of extrusions, solids of revolution, and pyramids"
, type =	"Report"
, number =	"SAND84-0572"
, institution =	"Sandia National Lab."
, address =	"Albuquerque, NM"
, year =	1984
}

@incollection{p-tns-94
, author =	"John W. Peterson"
, title =	"Tessellation of {NURB} Surfaces"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"286--320"
, keywords =	"surface subdivision, NURB, Bezier surface, B-spline surface, polygonization"
, update =	"94.09 heckbert"
, annote =	"Gives code for polygonizing a very general class of
parametric surfaces: NURBs. Polygonization of parametric surfaces is useful
both for rendering and for modeling. Contains C code."
}

@article{p-cgavh-98
, author =	"S. Petitjean"
, title =	"A Computational Geometric Approach to Visual Hulls"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"407--436"
, update =	"98.11 devillers"
}

@article{pb-rnrps-01
, author =	"S. Petitjean and E. Boyer"
, title =	"Regular and non-regular point sets: {Properties} and reconstruction"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"101--126"
, update =	"01.11 smid"
}

@article{po-tras-49
, author =	"I. G. Petrovski{\u{\i}} and O. A. Ole{\u{\i}}nik"
, title =	"On the topology of real algebraic surfaces"
, journal =	"Isvestia Akad. Nauk SSSR. Ser. Mat."
, volume =	13
, year =	1949
, pages =	"389--402"
, note =	"In Russian."
, update =	"98.07 agarwal"
}

@article{pc-cds-75
, author =	"T. Peucker and N. Chrisman"
, title =	"Cartographic data structures"
, journal =	"Amer. Cartogr."
, volume =	2
, year =	1975
, pages =	"55--69"
, update =	"98.11 bibrelex"
}

@inproceedings{pflm-tin-78
, author =	"T. K. Peucker and R. J. Fowler and J. J. Little and D. M. Mark"
, title =	"The triangulated irregular network"
, booktitle =	"Amer. Soc. Photogrammetry Proc. Digital Terrain Models Symposium"
, year =	1978
, pages =	"516--532"
, update =	"98.07 bibrelex"
}

@incollection{pm-aiecg-90
, title =	"{ARC}/{INFO}: an example of contemporary geograhic information system"
, editor =	"D. J. Peuquet and D. F. Marble"
, booktitle =	"Introductory Readings in Geographic Information Systems"
, publisher =	"Taylor \& Francis"
, address =	"London"
, year =	1990
, pages =	"90--99"
, update =	"97.11 bibrelex"
}

@book{pm-irgis-90
, title =	"Introductory Readings in Geographic Information Systems"
, editor =	"D. J. Peuquet and D. F. Marble"
, publisher =	"Taylor \& Francis"
, address =	"London"
, year =	1990
, update =	"96.09 kreveld"
}

@incollection{pm-tdds-90
, title =	"Technical description of the {DIME} system"
, editor =	"D. J. Peuquet and D. F. Marble"
, booktitle =	"Introductory Readings in Geographic Information Systems"
, publisher =	"Taylor \& Francis"
, address =	"London"
, year =	1990
, pages =	"100--111"
, update =	"97.11 bibrelex"
}

@article{p-ccdmd-83
, author =	"J. L. Pfaltz"
, title =	"Convex clusters in a discrete $m$-dimensional space"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"734--750"
}

@article{pbc-pmrui-80
, author =	"J. L. Pfaltz and W. J. Berman and E. M. Cagley"
, title =	"Partial-match retrieval using indexed descriptor files"
, journal =	"Commun. ACM"
, volume =	23
, year =	1980
, pages =	"522--528"
}

@article{prw-sgcp-94
, author =	"U. Pferschy and R. Rudolf and G. J. Woeginger"
, title =	"Some geometric clustering problems"
, journal =	"Nordic J. Comput."
, volume =	1
, year =	1994
, pages =	"246--263"
, update =	"95.01 smid"
}

@inproceedings{pk-c4sar-96
, author =	"H. Pfister and A. E. Kaufman"
, title =	"Cube-4 -- {A} Scalable Architecture for Real-Time Volume Rendering"
, booktitle =	"IEEE Visualization '96 Proceedings"
, publisher =	"ACM/SIGGRAPH Press"
, address =	"San Francisco, CA"
, month =	oct
, year =	1996
, pages =	"47--54"
, update =	"98.03 mitchell"
}

@article{p-rpsts-95
, author =	"G. Ch. Pflug"
, title =	"Random planar shapes and their statistical recognition"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"267--280"
, keywords =	"matching, shape recognition, vision"
, update =	"98.07 bibrelex, 95.09 mitchell"
}

@inproceedings{pkgh-rcsmc-97
, author =	"M. Pharr and C. Kolb and R. Gershbein and P. Hanrahan"
, title =	"Rendering complex scenes with memory-coherent ray tracing"
, booktitle =	"Proc. SIGGRAPH '97"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"Addison-Wesley"
, year =	1997
, pages =	"101--108"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@book{p-mh-85
, author =	"C. G. Phillips"
, title =	"Movements of the hand"
, publisher =	"Liverpool University Press"
, year =	1985
, update =	"98.07 bibrelex"
}

@techreport{p-amasg-90
, author =	"J. Phillips"
, title =	"On approximate matching against sets of geometric models"
, type =	"Technical {Report}"
, institution =	"RUTCOR, Ruters University"
, address =	"New Brunswick, New Jersey"
, month =	jul
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{pg-aldit-84
, author =	"M. B. Phillips and M. O. Garret"
, title =	"An algorithm for locating and displaying the intersection of two arbitary surfaces"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, year =	1984
, update =	"98.03 bibrelex"
}

@techreport{pbc-muccm-93
, author =	"S. D. Phillips and B. Borchardt and G. Caskey"
, title =	"Measurement uncertainty considerations for coordinate measuring machines"
, type =	"Technical {Report}"
, number =	"NISTIR 5170"
, institution =	"Precision Engineering Division, National Institute of Standards and Technology"
, address =	"Gaithersburg, MD"
, month =	apr
, year =	1993
, update =	"98.07 bibrelex"
}

@unpublished{prs-crtcs-94
, author =	"B. Piazza and R. Ringeisen and S. Stueckle"
, title =	"On {Conway}'s reduction of the thrackle conjecture and some associated drawings"
, year =	1994
, note =	"To appear"
, update =	"99.03 forrest, 98.03 bibrelex"
}

@incollection{prs-pnmcs-91
, author =	"B. Piazza and R. Ringeisen and S. Stueckle"
, title =	"Properties of non-minimum crossings for some classes of graphs"
, editor =	"Y. Alavi"
, booktitle =	"Graph Theory, Combinatorics and Applications"
, volume =	2
, publisher =	"John Wiley \& Sons"
, address =	"New York, NY"
, year =	1991
, update =	"99.11 bibrelex, 98.03 bibrelex"
}

@article{pq-samcn-82
, author =	"J. C. Picard and M. Queyranne"
, title =	"Selected applications of minimum cuts in a network"
, journal =	"INFOR- Canad. J. Oper. Res. Inform. Process."
, volume =	20
, year =	1982
, pages =	"394--422"
, update =	"97.11 bibrelex"
}

@article{pr-cardf-78
, author =	"J. C. Picard and H. Ratliff"
, title =	"A cut approach to the rectilinear distance facility location problem"
, journal =	"Oper. Res."
, volume =	"??"
, year =	1978
, pages =	"422--433"
, update =	"97.11 bibrelex"
}

@article{p-sledd-39
, author =	"S. Piccard"
, title =	"Sur les ensembles de Distances des Ensembles de points d'un Espace {Euclidean}"
, journal =	"Mem. Univ. Neuchatel"
, volume =	13
, year =	1939
, update =	"97.11 bibrelex"
}

@article{p-gzz-99
, author =	"G. Pick"
, title =	"Geometrisches zur {Zahlenlehre}"
, journal =	"Naturwissenschaftliche Zeitschrift Lotus (Prag)"
, volume =	"??"
, year =	1899
, pages =	"311--319"
, update =	"98.03 bibrelex"
}

@article{p-rngpg-95
, author =	"C. A. Pickover"
, title =	"Random Number Generators: Pretty Good Ones Are Easy to Find"
, journal =	"Visual Comput."
, volume =	11
, number =	7
, year =	1995
, pages =	"369--377"
, update =	"96.01 held"
}

@book{p-ota-86
, author =	"D. Pierre"
, title =	"Optimization theory with applications"
, publisher =	"Dover"
, address =	"New York, NY"
, year =	1986
, update =	"98.07 bibrelex"
}

@inproceedings{pp-pcsds-93
, author =	"A. Pietracaprina and F. P. Preparata"
, title =	"A Practical Constructive Scheme for Deterministic Shared-Memory Access"
, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
, year =	1993
, pages =	"101--109"
, update =	"96.09 orourke"
}

@article{p-orrc-81
, author =	"P. Y. Pinter"
, title =	"Optimal routing in rectilinear channels"
, journal =	"VLSI Systems and computations"
, volume =	"??"
, year =	1981
, pages =	"160--177"
, update =	"98.07 bibrelex"
}

@phdthesis{p-gacg-99
, author =	"Sylvain Pion"
, title =	"De la g\'eom\'etrie algorithmique au calcul g\'eom\'etrique"
, type =	"Th\`{e}se de doctorat en sciences"
, school =	"Universit\'e de Nice-Sophia Antipolis"
, address =	"France"
, year =	1999
, note =	"TU-0619"
, url =	"http://www.inria.fr/rrrt/tu-0619.html"
, keywords =	"doctoral thesis"
, update =	"02.03 devillers, 00.03 devillers"
}

@inproceedings{p-iaeia-99
, author =	"Sylvain Pion"
, title =	"Interval Arithmetic: An efficient implementation and an application to computational geometry"
, booktitle =	"Workshop on Applications of Interval Analysis to systems and Control"
, year =	1999
, pages =	"99--110"
, url =	"http://www-sop.inria.fr/prisme/biblio/search.html"
, update =	"01.07 devillers, 00.03 devillers, 99.07 devillers"
}

@inproceedings{pw-caa3d-95
, author =	"C. Pisupati and L. Wolff"
, title =	"A Central Axis Algorithm for 3D Bronchial Tree Structures"
, booktitle =	"IEEE Internat. Sympos. Comput. Vision"
, year =	1995
, pages =	"259--264"
, update =	"97.11 bibrelex"
}

@techreport{pw-cltv-96
, author =	"C. Pisupati and L. Wolff"
, title =	"Corresponding Lung Tree Volumes"
, number =	"1996.03"
, institution =	"Johns Hopkins University"
, month =	mar
, year =	1996
, update =	"97.11 bibrelex"
}

@inproceedings{pwmz-gtma3-96
, author =	"Chandrasekhar Pisupati and Lawrence Wolff and Wayne Mitzner and Elias Zerhouni"
, title =	"Geometric Tree Matching with Applications to 3D Lung Structures"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C19--C20"
, cites =	"gmo-pmagp-94, pw-caa3d-95, pw-cltv-96, w-igt-95, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@techreport{pr-ptscc-87
, author =	"L. Pitt and R. E. Reinke"
, title =	"Polynomial-time solvability of clustering and conceptual clustering problems: the agglomerative-hierarchical algorithm"
, type =	"Report"
, number =	"R-87-1371"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1987
}

@inproceedings{p-cgrae-73
, author =	"N. L. K. Pitteway"
, title =	"Computer graphics research in an academic environment"
, booktitle =	"Proc. Datafair '73 Conf."
, year =	1973
, pages =	"471--478"
}

@article{p-hmgst-84
, author =	"D. A. Plaisted"
, title =	"Heuristic matching for graphs satisfying the triangle inequality"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"163--179"
}

@article{ph-hta-87
, author =	"D. A. Plaisted and J. Hong"
, title =	"A heuristic triangulation algorithm"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"405--437"
, abstract =	"We propose a heuristic triangulation algorithm. The
		 algorithm runs in polynomial time and produces a
		 triangulation within a ratio of O(log n) to the cost of
		 an optimal triangulation of a set of n points in the
		 Euclidean plane"
}

@inproceedings{p-afwvf-92
, author =	"H. Plantinga"
, title =	"An algorithm for finding the weakly visible faces from a polygon in $3$-d"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"45--51"
, cites =	"arb-tiriu-90, bdeg-vmpv-90, fdfh-cgpp-90, fst-mladi-92, kd-irssr-79, m-wcohs-87, m-eahsr-89, m-hsrrm-91, o-agta-87, pd-voag-90, pds-rthle-90, p-cvpew-92, ps-cgi-85, ss-oadwv-90, sss-cthsa-74, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{p-cvpew-92
, author =	"H. Plantinga"
, title =	"Conservative visibility preprocessing for efficient walkthroughs of $3${D} Scenes"
, type =	"Technical {Report}"
, number =	"92-4"
, institution =	"Dept. Comput. Sci., Univ. Pittsburgh"
, address =	"Pittsburgh, PA"
, year =	1992
, update =	"98.07 bibrelex"
}

@article{pd-voag-90
, author =	"H. Plantinga and C. R. Dyer"
, title =	"Visibility, occlusion, and the aspect graph"
, journal =	"Internat. J. Comput. Vision"
, volume =	5
, number =	2
, year =	1990
, pages =	"137--160"
, update =	"93.09 rote"
}

@inproceedings{pds-rthle-90
, author =	"H. Plantinga and C. R. Dyer and W. B. Seals"
, title =	"Real-time hidden-line elimination for a rotating polyhedral scene using the aspect representation"
, booktitle =	"Proc. Graphics Interface '90"
, year =	1990
, pages =	"9--16"
, update =	"98.07 bibrelex"
}

@inproceedings{pd-acag-86
, author =	"W. Platinga and C. Dyer"
, title =	"An algorithm for constructing the aspect graph"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"123--131"
, update =	"98.11 bibrelex"
}

@article{p-plpg-76
, author =	"C. Platt"
, title =	"Planar Lattices and Planar Graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	21
, year =	1976
, pages =	"30--39"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{pb-cmfm-88
, author =	"J. C. Platt and A. H. Barr"
, title =	"Constraint methods for flexible models"
, journal =	"Comput. Graph."
, volume =	22
, number =	4
, year =	1988
, pages =	"279--287"
, note =	"Proc. SIGGRAPH '88"
, update =	"98.03 bibrelex"
}

@article{pb-scpts-89
, author =	"L. K. Platzman and J. J. {Bartholdi, III}"
, title =	"Spacefilling Curves and the Planar Travelling Salesman Problem"
, journal =	"J. ACM"
, volume =	36
, number =	4
, month =	oct
, year =	1989
, pages =	"719--737"
, keywords =	"graph theory, optimization, traveling salesman tours, two-dimensional, $L_{2}$ metric, heuristics, fractal geometry, empirical analysis"
, update =	"93.09 held+jones"
}

@inproceedings{pc-alrtg-96
, author =	"A. Plaza and G. F. Carey"
, title =	"About local refinement of tetrahedral grids based on bisection"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"123--136"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@article{p-hppg-87
, author =	"J. Plesnik"
, title =	"A Heuristic for the $p$-Center Problem in Graphs"
, journal =	"Discrete Appl. Math."
, volume =	17
, year =	1987
, pages =	"263--268"
, update =	"98.07 agarwal"
}

@article{p-nchcp-79
, author =	"J. Ples{\'n}ik"
, title =	"The {NP}-completeness of the {Hamiltonian} cycle problem in planar digraphs with degree bound two"
, journal =	"Inform. Process. Lett."
, volume =	8
, year =	1979
, pages =	"199--201"
, update =	"98.03 bibrelex"
}

@inproceedings{pt-idns-90
, author =	"S. A. Plotkin and {\'E}. Tardos"
, title =	"Improved dual network simplex"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"367--376"
, update =	"93.09 rote"
}

@article{ple-togip-71
, author =	"A. Pnueli and A. Lempel and S. Even"
, title =	"Transitive orientation of graphs and identification of permutation graphs"
, journal =	"Cand. J. Math."
, volume =	23
, year =	1971
, pages =	"160--175"
, update =	"98.11 bibrelex"
}

@article{p-afhbs-85
, author =	"P. V. Poblete"
, title =	"The analysis of a fringe heuristic for binary search trees"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"336--350"
}

@inproceedings{p-gfr-90
, author =	"M. Pocchiola"
, title =	"Graphics in {Flatland} revisited"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"85--96"
}

@inproceedings{p-htvpt-97
, author =	"Michel Pocchiola"
, title =	"Horizon Trees versus Pseudo-Triangulations"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	12
, cites =	"agt-wat-94, eg-tsa-89, pv-tsvcpt-96, r-cve2d-97, ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{p-vc-92
, author =	"M. Pocchiola"
, title =	"The visibility complex"
, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
, site =	"Kyoto, Japan"
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{p-vc-92c
, author =	"Michel Pocchiola"
, title =	"The Visibility Complex"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"67--68"
, update =	"00.03 bibrelex"
}

@inproceedings{pv-cvgpt-95
, author =	"M. Pocchiola and G. Vegter"
, title =	"Computing the Visibility Graph via Pseudo-Triangulations"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"248--257"
, keywords =	"topological sweep, visibility complex"
, cites =	"ce-oails-92, eg-tsa-89, gt-ltasc-85, gm-osacv-91, hmrt-sjslt-86, ow-nmcvg-88, pv-vc-93, s-ec-86, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex, 96.05 pocchiola, 95.09 mitchell"
}

@inproceedings{pv-mtvg-94
, author =	"M. Pocchiola and G. Vegter"
, title =	"Minimal Tangent Visibility Graphs"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"24--29"
, cites =	"aaghi-vdp-86, ch-mvg-91, eg-tsa-89, gm-osacv-91, gs-rwnpc-90, gh-cvgnl-85, lw-apcfp-79, o-cgc18-93, ow-nmcvg-88, pv-vc-93, pv-otvtc-94, pv-savgc-94, r-sppcp-86, r-tseas-88, sh-nmvg-93, sr-facsv-90, km-eaesp-88, se-tlbsv-87, w-cvgnl-85, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{pv-mtvg-96
, author =	"M. Pocchiola and G. Vegter"
, title =	"Minimal Tangent Visibility Graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"303--314"
, keywords =	"visibility graphs, triangulations"
, succeeds =	"pv-mtvg-94"
, update =	"97.03 devillers+pocchiola+smid, 96.05 pocchiola"
}

@techreport{pv-pc-96
, author =	"M. Pocchiola and G. Vegter"
, title =	"On polygonal covers"
, number =	"96-16"
, institution =	"Labo. Inf. Ens"
, address =	"45 rue d'Ulm 75230 Paris, France"
, month =	jul
, year =	1996
, note =	""
, keywords =	"illumination, covering, separation"
, comments =	""
, succeeds =	"pv-ptta-96"
, update =	"97.03 pocchiola"
}

@incollection{pv-pc-99
, author =	"M. Pocchiola and G. Vegter"
, title =	"On polygonal covers"
, editor =	"B. Chazelle and J. Goodman and R. Pollack"
, booktitle =	"Advances in Discrete and Computational Geometry"
, series =	"Contemporary Mathematics"
, volume =	223
, publisher =	"AMS, Providence"
, year =	1999
, pages =	"257--268"
, update =	"01.04 pocchiola"
}

@techreport{pv-otvtc-94
, author =	"M. Pocchiola and G. Vegter"
, title =	"Order types and visibility types of configurations of disjoint convex plane sets (Extended abstract)"
, number =	"94-4"
, institution =	"Labo. Inf. Ens"
, month =	jan
, year =	1994
, keywords =	"arrangements, visibility complexes"
, comments =	""
, update =	"96.05 pocchiola"
}

@inproceedings{pv-ptta-96
, author =	"Michel Pocchiola and Gert Vegter"
, title =	"Pseudo-Triangulations: Theory and Applications"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"291--300"
, cites =	"pv-vc-96, pv-cvgpt-95, b-rsdoh-93, c-cgr-95, f-icd-77, ers-ccsno-90, blwsz-om-93, rz-rspu-95, pa-cg-95, gp-ms-83, bcm-anlcg-90"
, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 efrat+pocchiola"
}

@techreport{pv-savgc-93
, author =	"M. Pocchiola and G. Vegter"
, title =	"Sweep algorithm for visibility graphs of curved obstacles"
, type =	"Manuscript"
, institution =	"??"
, year =	1993
, precedes =	"pv-savgc-94"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@techreport{pv-savgc-94
, author =	"M. Pocchiola and G. Vegter"
, title =	"Sweep algorithms for visibility graphs of curved obstacles"
, type =	"Technical Report"
, institution =	"??"
, address =	"Liens"
, year =	1994
, note =	"in preparation"
, update =	"98.11 bibrelex"
}

@inproceedings{pv-vc-93
, author =	"M. Pocchiola and G. Vegter"
, title =	"The visibility complex"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"328--337"
, precedes =	"pv-vc-96"
, cites =	"cg-vippg-89, gm-osacv-91, hm-oacvp-91, p-gfr-90, v-vddsv-90, v-dmvg-91, w-cvgnl-85, ZZZ"
, update =	"98.03 bibrelex, 97.03 devillers, 93.09 jones"
}

@article{pv-vc-96
, author =	"M. Pocchiola and G. Vegter"
, title =	"The visibility complex"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, number =	3
, year =	1996
, pages =	"279--308"
, keywords =	"visibility graphs, visibility complexes, triangulations"
, succeeds =	"pv-vc-93"
, update =	"97.11 bibrelex+orourke, 97.03 devillers+orourke+pocchiola+schwarzkopf"
}

@article{pv-tsvcpt-96
, author =	"M. Pocchiola and G. Vegter"
, title =	"Topologically sweeping visibility complexes via pseudo-triangulations"
, journal =	"Discrete Comput. Geom."
, volume =	16
, month =	dec
, year =	1996
, pages =	"419--453"
, keywords =	"topological sweep, visibility complex, visibility graph, triangulation, pseudo-triangulation"
, succeeds =	"pv-cvgpt-95"
, update =	"97.03 pocchiola, 96.05 pocchiola"
}

@inproceedings{pv-iplft-96
, author =	"Michel Pochiola and Gert Vegter"
, title =	"The Illumination Problem of L. Fejes T{\'o}th Revisited"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"29--30"
, update =	"01.11 devillers, 00.03 bibrelex, 99.03 bibrelex"
}

@article{p-smfsp-80
, author =	"A. N. Podkorytov"
, title =	"Summation of multiple {Fourier} series over polyhedra"
, journal =	"Mat.,  Mekh., Astronom."
, volume =	"N 1"
, year =	1980
, pages =	"51--58"
, update =	"97.11 bibrelex"
}

@book{p-egcs-73
, author =	"A. V. Pogorelov"
, title =	"Extrinsic Geometry of Convex Surfaces"
, series =	"Translations of Mathematical Monographs"
, volume =	35
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1973
, update =	"94.09 orourke"
}

@book{p-lfg-66
, author =	"A. V. Pogorelov"
, title =	"Lectures on the Foundations of Geometry"
, publisher =	"Noordhoff"
, year =	1966
, update =	"98.03 bibrelex"
}

@article{p-qglcs-49
, author =	"A. V. Pogorelov"
, title =	"Quasi-geodesic lines on a convex surface"
, journal =	"Mat. Sb."
, volume =	25
, number =	62
, year =	1949
, pages =	"275--306"
, note =	"English transl., {\em Amer. Math. Soc. Transl.} 74, 1952."
, update =	"94.09 orourke"
}

@book{p-mmp-78
, author =	"A. V. Pogorelov"
, title =	"The {Minkowski} Multidimensional Problem"
, publisher =	"Winston"
, address =	"New York, NY"
, year =	1978
, update =	"98.03 bibrelex"
}

@techreport{ph-bmni-85
, author =	"G. Politis and D. Herbison-Evans"
, title =	"A {Benesh} movement notation interpreter"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Sydney"
, address =	"Sydney, Australia"
, year =	1985
}

@article{pr-rn-92
, author =	"S. Poljak and J. Rohn"
, title =	"Radius of nonsingularity"
, journal =	"Mathematics of Systems, Signals and Control"
, volume =	"??"
, year =	1992
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@article{pr-ncdsp-93
, author =	"R. Pollack and M. F. Roy"
, title =	"On the number of cells defined by a set of polynomials"
, journal =	"C. R. Acad. Sci. Paris"
, volume =	316
, year =	1993
, pages =	"573--577"
, update =	"98.03 agarwal+bibrelex"
}

@techreport{ps-cgcsp-86
, author =	"R. Pollack and Micha Sharir"
, title =	"Computing the Geodesic Center of a Simple Polygon"
, type =	"Technical Report"
, number =	231
, institution =	"Dept. of Computer Science, Courant Institute of Mathematical Sciences"
, year =	1986
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@article{psr-cgcsp-89
, author =	"R. Pollack and Micha Sharir and G{\"u}nter Rote"
, title =	"Computing of the geodesic center of a simple polygon"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"611--626"
, keywords =	"polygons, simple, shortest paths"
, update =	"98.03 mitchell"
}

@techreport{pss-stsps-86
, author =	"R. Pollack and M. Sharir and S. Sifrony"
, title =	"Separating two simple polygons by a sequence of translations"
, type =	"Technical {Report}"
, number =	215
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{pss-stsps-88
, author =	"R. Pollack and Micha Sharir and S. Sifrony"
, title =	"Separating two simple polygons by a sequence of translations"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"123--136"
, keywords =	"polygons, simple, Davenport-Schinzel sequences, motion planning, rays"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{pw-nscht-89
, author =	"R. Pollack and R. Wenger"
, title =	"Necessary and sufficient conditions for hyperplane transversals"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"152--155"
, precedes =	"pw-nscht-90"
, cites =	"dgk-htir-63, e-rt-79, gp-ms-83, gp-htthd-88, g-ts-55, hdk-cgp-64, h-uegt-57, hk-crp-71, h-umkkm-23, k-tsct-80, k-ta-03, m-eat-84, s-tsppe-40, w-ghtti-90, ZZZ"
, update =	"98.03 bibrelex"
}

@article{pw-nscht-90
, author =	"R. Pollack and R. Wenger"
, title =	"Necessary and sufficient conditions for hyperplane transversals"
, journal =	"Combinatorica"
, volume =	10
, year =	1990
, pages =	"307--311"
, succeeds =	"pw-nscht-89"
}

@article{p-kafgg-37
, author =	"G. Polya"
, title =	"Kombinatorische {Anzahlbestimmungen} f{\"u}r {Gruppen}, {Graphen} und chemische {Verbindungen}"
, journal =	"Acta Math."
, volume =	68
, year =	1937
, pages =	"145--254"
, update =	"97.11 bibrelex"
}

@phdthesis{p-sdsdp-92
, author =	"G. H. Polychronopoulos"
, title =	"Stochastic and dynamic shortest distance problems"
, type =	"Ph.{D}. Thesis"
, school =	"Operations Research Center, Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1992
, note =	"Report 199"
, keywords =	"weighted regions, dynamic shortest paths"
, update =	"93.05 jones"
}

@inproceedings{plm-icdpm-95
, author =	"Madhav K. Ponamgi and Ming C. Lin and Dinesh Manocha"
, title =	"Incremental Collision Detection for Polygonal Models"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"V7--V8"
, keywords =	"video review"
, cites =	"cd-icott-87, c-oaitd-89, clmp-ecdie-94, clmp-iciec-95, pml-iacdb-95, lc-eaidc-91, mp-fitcp-78, ZZZ"
, update =	"99.03 forrest, 98.03 bibrelex, 95.09 mitchell"
}

@techreport{pml-iacdb-94
, author =	"M. K. Ponamgi and D. Manocha and M. C. Lin"
, title =	"Incremental Algorithms for Collision Detection Between General Solid Models"
, type =	"Technical {Report}"
, number =	"TR94-061"
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, year =	1994
, precedes =	"pml-iacdb-95"
, update =	"96.05 klosowski"
}

@inproceedings{pml-iacdb-95
, author =	"M. K. Ponamgi and D. Manocha and M. C. Lin"
, title =	"Incremental Algorithms for Collision Detection between General Solid Models"
, booktitle =	"Proc. ACM Siggraph Sympos. Solid Modeling"
, year =	1995
, pages =	"293--304"
, succeeds =	"pml-iacdb-94"
, update =	"96.05 klosowski, 96.01 held"
}

@phdthesis{p-remdt-83
, author =	"J. Ponce"
, title =	"Representation et manipulation d'objets tridimensionnels"
, school =	"Universite d'Orsay"
, address =	"Orsay, France"
, year =	1983
, note =	"These de troisueme cycle"
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@article{pf-ctffc-95
, author =	"Jean Ponce and Bernard Faverjon"
, title =	"On computing three-finger force-closure grasps of polygonal objects"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	11
, number =	6
, year =	1995
, update =	"97.11 bibrelex"
}

@article{pssbm-cffef-96
, author =	"Jean Ponce and Steve Sullivan and Attawith Sudsang and Jean-Daniel Boissonnat and Jean-Pierre Merlet"
, title =	"On computing four-finger equilibrium and force-closure grasps of polyhedral objects"
, journal =	"Internat. J. Robot. Res."
, volume =	"??"
, year =	1996
, update =	"97.11 bibrelex"
}

@inproceedings{p-sagsp-91
, author =	"C. Ponder"
, title =	"A search approach to general stabbing problems"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"195--202"
, cites =	"ad-ahdsp-87, cgppsw-ccht-90, dgk-htir-63, e-ftssg-85, gl-mc-83, jk-spals-88, mkb-ma-79, pr-rn-92, pw-nscht-89, p-allpm-90, p-pcaam, r-lie-89, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{p-allpm-90
, author =	"C. Ponder"
, title =	"An Analytical Look at Linear Performance Models"
, type =	"Technical Report"
, number =	"UCRL-JC-106105"
, institution =	"Lawrence Livermore National Laboratory"
, month =	sep
, year =	1990
, update =	"98.07 bibrelex"
}

@unpublished{p-pcaam
, author =	"C. Ponder"
, title =	"Principle Component Analysis Under Alternative Error-Metrics"
, note =	"in preparation"
, update =	"98.07 bibrelex"
}

@inproceedings{psv-srusb-97
, author =	"Serge Pontier and Behzad Shariat and Denis Vandorpe"
, title =	"Shape Reconstruction Using Skeleton--Based Implicit Surface"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"205--210"
, update =	"97.11 jones"
}

@book{pbgm-mtop-62
, author =	"L. S. Pontryagin and V. G. Boltyanskii and R. V. Gamkrelidze and E. F. Mishchenko"
, title =	"The mathematical theory of optimal processes"
, publisher =	"Interscience Publishers"
, year =	1962
}

@inproceedings{pzc-ptslr-97
, author =	"C. Poon and B. Zhu and F. Chin"
, title =	"A Polynomial Time Solution for Labeling a Rectilinear Map"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"451--453"
, precedes =	"pzc-ptslr-98"
, cites =	"bc-ap1sq-94, cms-aclp-93, df-rbsdm-92, dmmmz-mlig-97, eis-ctmfp-76, fw-ppalm-91, i-pnm-75, j-cnpp-89, kr-pcr-92, ps-cgi-85, w-amlon-94, ww-mlhpg-95, y-laml-72, ZZZ"
, update =	"99.03 patrignani, 98.07 bibrelex, 97.07 efrat"
}

@article{pzc-ptslr-98
, author =	"Chung Keung Poon and Binhai Zhu and Francis Chin"
, title =	"A Polynomial Time Solution for Labeling a Rectilinear Map"
, journal =	"Inform. Process. Lett."
, volume =	65
, number =	4
, pages =	"201--207"
, succeeds =	"pzc-ptslr-97"
, update =	"99.03 patrignani, 98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{pssw-lpw-01
, author =	"Sheung-Hung Poon and Chan-Su Shin and Tycho Strijk and Alexander Wolff"
, title =	"Labeling Points with Weights"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"97--100"
, update =	"01.04 icking"
}

% also claimed, pages = "251--258"
@inproceedings{ph-psc-97
, author =	"Jovan Popovi{\'c} and Hugues Hoppe"
, title =	"Progressive Simplicial Complexes"
, booktitle =	"Proc. SIGGRAPH '97"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"ACM Press"
, year =	1997
, pages =	"217 -- 224"
, update =	"98.07 agarwal, 98.03 agarwal+mitchell"
}

% ### others?
@inproceedings{po-saims-91
, author =	"M. Popovic and others"
, title =	"Several Approaches to Implement the Merging Step of the Split and Merge Region Segmentation"
, editor =	"F. H. Post and W. Barth"
, booktitle =	"Proc. Eurographics '91"
, publisher =	"Elsevier Science"
, address =	"Vienna, Austria"
, month =	sep
, year =	1991
, pages =	"399--412"
, update =	"93.09 held"
}

@techreport{p-smtsr-79
, author =	"R. J. Popplestone"
, title =	"Specifying Manipulation in Terms of Spatial Relationships"
, type =	"Research {Report}"
, number =	117
, institution =	"Dept. Artif. Intell., Univ. Edinburgh"
, address =	"Edinburgh, Scotland"
, year =	1979
, update =	"97.11 bibrelex"
}

@inproceedings{p-ahart-93
, author =	"Mary-Anne K. Posenau"
, title =	"Approaches to High Aspect Ratio Triangulations"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"30--35"
, cites =	"pm-dtcfd-92, b-nacvh-91, lp-gtdug-88, pmp-ufemg-89, m-amgvf-90, cd-vdbcd-85, e-acg-87, ZZZ"
, update =	"98.11 bibrelex"
}

@inproceedings{pm-dtcfd-92
, author =	"M.-A. K. Posenau and D. M. Mount"
, title =	"Delaunay triangulations and computational fluid dynamics meshes"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"316--321"
, cites =	"bgr-ntp-88, b-amgct-89, ps-cgi-85, rs-metep-90, beg-pgmg-90, ahet-nggcf-91, twm-ngg-85, w-ngg-90, c-cdt-89, c-gqtm-89, b-nacvh-91, m-amgvf-90, w-msuma-90, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{p-msea-81
, author =	"M. J. Post"
, title =	"A minimum spanning ellipse algorithm"
, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1981
, pages =	"115--122"
}

@techreport{p-cmse-82
, author =	"M. J. Post"
, title =	"Computing minimum spanning ellipses"
, type =	"Technical {Report}"
, number =	"CS-82-16"
, institution =	"Dept. Comput. Sci., Brown Univ."
, address =	"Providence, RI"
, year =	1982
, update =	"98.07 bibrelex"
}

@inproceedings{p-mse-84
, author =	"M. J. Post"
, title =	"Minimum spanning ellipsoids"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"108--116"
, annote =	"$O(n^{2})$ time"
}

@book{p-lat-83
, author =	"M. M. Postinov"
, title =	"Lectures in Algebraic Topology"
, publisher =	"Nauka"
, address =	"Moscow"
, year =	1983
, update =	"98.07 bibrelex"
}

@article{p-gom3o-87
, author =	"M. Potemesil"
, title =	"Generating octree models of {3D} objects from their silhouettes in a sequence of images"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	40
, year =	1987
, pages =	"1--29"
, update =	"98.11 bibrelex"
}

@article{pf-ithla-80
, author =	"M. Potmesil and H. Freeman"
, title =	"Implementation of two hidden-line algorithms"
, journal =	"Computers and Graphics"
, volume =	5
, year =	1980
, pages =	"31--40"
}

@book{pr-cap-88
, author =	"M. B. {Pour-El} and J. I. Richards"
, title =	"Computability in Analysis and Physics"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Heidelberg"
, year =	1988
, update =	"98.11 bibrelex"
}

@article{p-mrpdt-92
, author =	"P. L. Powar"
, title =	"Minimal roughness property of the {Delaunay} triangulation: a shorter approach"
, journal =	"Comput. Aided Geom. Design"
, volume =	9
, year =	1992
, pages =	"491--494"
, update =	"98.11 bibrelex"
}

@article{ps-pqat-77
, author =	"M. J. D. Powell and M. A. Sabin"
, title =	"Piecewise quadratic approximations on triangles"
, journal =	"ACM Trans. Math. Softw."
, volume =	3
, year =	1977
, pages =	"316--325"
}

@techreport{p-hsp-90
, author =	"N. Prabhu"
, title =	"Hamiltonian Simple Polytopes"
, type =	"Technical {Report}"
, number =	"90-17"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"93.09 milone+mitchell"
}

@phdthesis{p-ssigm-88
, author =	"P. V. Prakash"
, title =	"Surface-to-Surface Intersections for Geometric Modeling"
, type =	"Ph.{D}. Thesis"
, school =	"Massachusetts Institute of Technology"
, address =	"Cambridge, Massachusetts"
, year =	1988
, keywords =	"doctoral thesis"
, update =	"95.05 abrams"
}

@article{ppd-vmdr-98
, author =	"D. Chithra Prasad and Sudebkumar P. Pal and Tamal K. Dey"
, title =	"Visibility with multiple diffuse reflections"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"187--196"
, update =	"98.11 devillers"
}

@article{pr-apmb-87
, author =	"V. K. Prasanna and C. S. Raghavendra"
, title =	"Array Processor with Multiple Broadcasting"
, journal =	"Journal of Parallel and Distributed Processing"
, volume =	4
, year =	1987
, pages =	"173--190"
, update =	"98.11 bibrelex"
}

@inproceedings{pr-popp-92
, author =	"V. K. Prasanna and A. S. Rao"
, title =	"Parallel orientation of polygonal parts"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1992
, update =	"98.07 bibrelex"
}

@article{ph-ddocs-92
, author =	"J. P. Pratt and V. P. Heuring"
, title =	"Designing digital optical computing systems: power and and crosstalk"
, journal =	"Appl. Optics"
, volume =	31
, number =	23
, year =	1992
, pages =	"4657--4661"
, update =	"98.03 bibrelex"
}

@inproceedings{p-dlsfas-87
, author =	"V. Pratt"
, title =	"Direct least squares fitting of algebraic surfaces"
, booktitle =	"Proc. Siggraph '87"
, year =	1987
, update =	"98.03 bibrelex"
}

@article{p-tcs-85
, author =	"V. Pratt"
, title =	"Techniques for conic splines"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, year =	1985
, pages =	"151--159"
, note =	"Proc. SIGGRAPH '85"
}

@book{pl-pdavs-88
, author =	"B. T. Preas and M. J. Lorenzetti"
, title =	"Physical design automation of {VLSI} systems"
, publisher =	"Benjamin Cummings"
, address =	"Menlo Park, CA"
, year =	1988
, update =	"98.03 bibrelex"
}

@inproceedings{p-ptnp-92
, author =	"Waldemar Preilowski"
, title =	"Parallel triangulation of nonconvex polytopes"
, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{p-ptnp-92c
, author =	"W. Preilowski"
, title =	"Parallel Triangulation of Nonconvex Polytopes"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"97--99"
, update =	"00.03 bibrelex"
}

@inproceedings{p-psdpr-93
, author =	"Waldemar Preilowski"
, title =	"The Pathtree: a Suitable Datastructure for Parallel Rayshooting"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"14--16"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
}

@inproceedings{pm-toacv-89
, author =	"W. Preilowski and W. Mumbeck"
, title =	"A Time-Optimal Algorithm for the computing of {Voronoi} Diagrams"
, booktitle =	"Graph-Theoretic Concepts in Computer Science. Proceedings."
, year =	1989
, pages =	"424--433"
}

@inproceedings{pdw-npach-92
, author =	"W. Preilowsky and E. Dahlhaus and G. Wechsung"
, title =	"New parallel algorithms for convex hull and triangulation in $3$-dimensional space"
, booktitle =	"Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	629
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"442--450"
, update =	"98.03 bibrelex"
}

@article{p-nappl-81
, author =	"F. P. Preparata"
, title =	"A new approach to planar point location"
, journal =	"SIAM J. Comput."
, volume =	10
, number =	3
, year =	1981
, pages =	"473--482"
, update =	"98.07 tamassia"
}

@article{p-nlspp-79
, author =	"F. P. Preparata"
, title =	"A note on locating a set of points in a planar subdivision"
, journal =	"SIAM J. Comput."
, volume =	8
, year =	1979
, pages =	"542--545"
}

@article{p-ortap-79
, author =	"F. P. Preparata"
, title =	"An optimal real-time algorithm for planar convex hulls"
, journal =	"Commun. ACM"
, volume =	22
, year =	1979
, pages =	"402--405"
}

@book{p-cg-83
, title =	"Computational Geometry"
, editor =	"Franco P. Preparata"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, update =	"01.04 icking"
, annote =	"Contains the following items:
		 c-pcp-83, eow-gfcs-83, gy-tsr-83, d-gatcl-83, l-mcprg-83, be-ewcst-83,
		 bow-cmhds-83, ab-acddv-83, ddg-fsp-83, s-ghsgc-83, g-dpcp-83, mz-pmhfa-83"
}

@techreport{p-msc-77
, author =	"F. P. Preparata"
, title =	"Minimum spanning circle"
, institution =	"Univ. Illinois"
, address =	"Urbana, IL"
, year =	1977
, note =	"in 'Steps into Computational Geometry'"
, update =	"01.11 devillers, 98.03 bibrelex"
}

@article{p-otdvl-83
, author =	"F. P. Preparata"
, title =	"Optimal Three-Dimensional {VLSI} Layouts"
, journal =	"Math. Syst. Theory"
, volume =	16
, year =	1983
, pages =	"1--8"
, update =	"98.07 patrignani"
}

@book{p-pdc-87
, title =	"Parallel and Distributed Computing"
, editor =	"Franco P. Preparata"
, series =	"Adv. Comput. Res."
, volume =	4
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1987
, update =	"01.04 icking"
}

@article{p-pplr-90
, author =	"F. P. Preparata"
, title =	"Planar point location revisited"
, journal =	"Internat. J. Found. Comput. Sci."
, volume =	1
, number =	1
, year =	1990
, pages =	"71--86"
, update =	"98.07 tamassia"
}

@inproceedings{p-rga-96
, author =	"F. P. Preparata"
, title =	"Robustness in Geometric Algorithms"
, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
, site =	"Philadelphia, PA, USA"
, month =	may
, year =	1996
, pages =	"29--30"
, update =	"97.11 held"
}

@techreport{p-scg-77
, author =	"F. P. Preparata"
, title =	"Steps into computational geometry"
, type =	"Report"
, number =	"R-760"
, institution =	"Coordinated Sci. Lab., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1977
}

@techreport{p-scgn2-77
, author =	"F. P. Preparata"
, title =	"Steps into computational geometry: {Notebook} {II}"
, type =	"Report"
, number =	"R-792"
, institution =	"Coordinated Sci. Lab., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1977
}

@inproceedings{p-masp-77
, author =	"F. P. Preparata"
, title =	"The medial axis of a simple polygon"
, booktitle =	"Proc. 6th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	53
, publisher =	"Springer-Verlag"
, year =	1977
, pages =	"443--450"
}

@book{p-vt-84
, title =	"{VLSI} Theory"
, editor =	"Franco P. Preparata"
, series =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1984
, update =	"01.04 icking"
}

@article{ph-chfsp-77
, author =	"F. P. Preparata and S. J. Hong"
, title =	"Convex hulls of finite sets of points in two and three dimensions"
, journal =	"Commun. ACM"
, volume =	20
, year =	1977
, pages =	"87--93"
, keywords =	"divide-and-conquer, worst-case analysis"
, annote =	"Claims $O(n \log n)$ time, but actually takes $O(n^2)$
		 time in special cases [d-iafch-90]"
}

@article{pl-otlcr-84
, author =	"F. P. Preparata and W. {Lipski, Jr.}"
, title =	"Optimal three-layer channel routing"
, journal =	"IEEE Trans. Comput."
, volume =	"C-33"
, year =	1984
, pages =	"427--437"
, succeeds =	"pl-tlae-82"
}

@inproceedings{pl-tlae-82
, author =	"F. P. Preparata and W. {Lipski, Jr.}"
, title =	"Three layers are enough"
, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1982
, pages =	"350--357"
, precedes =	"pl-otlcr-84"
}

@article{pm-finhs-79
, author =	"F. P. Preparata and D. E. Muller"
, title =	"Finding the intersection of $n$ half-spaces in time {$O(n \log n)$}"
, journal =	"Theoret. Comput. Sci."
, volume =	8
, year =	1979
, pages =	"45--55"
}

@book{ps-cgi-85
, author =	"F. P. Preparata and M. I. Shamos"
, title =	"Computational Geometry: An Introduction"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1985
, comments =	"corrected and expanded second printing, 1988"
, precedes =	"ps-cgi-90"
, update =	"98.11 bibrelex, 95.09 agarwal"
}

@book{ps-cgi-90
, author =	"F. P. Preparata and M. I. Shamos"
, title =	"Computational Geometry: An Introduction"
, edition =	"3rd"
, publisher =	"Springer-Verlag"
, month =	oct
, year =	1990
, isbn =	"3-540-96131-3"
, succeeds =	"ps-cgi-85"
, update =	"98.11 bibrelex"
}

@article{ps-tspm-81
, author =	"F. P. Preparata and K. J. Supowit"
, title =	"Testing a simple polygon for monotonicity"
, journal =	"Inform. Process. Lett."
, volume =	12
, number =	4
, year =	1981
, pages =	"161--164"
, keywords =	"polygons, design of algorithms"
, update =	"98.07 bibrelex"
}

@techreport{pt-fdppl-87
, author =	"F. P. Preparata and R. Tamassia"
, title =	"A fully dynamic planar point location technique"
, type =	"Report"
, number =	"UILU-ENG-87-2266"
, institution =	"Coordinated Sci. Lab., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1987
, keywords =	"point location, data structuring, on-line"
, precedes =	"pt-dpplo-89"
}

@inproceedings{pt-dpplo-89
, author =	"F. P. Preparata and R. Tamassia"
, title =	"Dynamic planar point location with optimal query time"
, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	349
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"84--95"
, keywords =	"subdivisions, point location, on-line, two-dimensional"
, succeeds =	"pt-fdppl-87"
, precedes =	"pt-dpplo-90"
}

@article{pt-dpplo-90
, author =	"F. P. Preparata and R. Tamassia"
, title =	"Dynamic planar point location with optimal query time"
, journal =	"Theoret. Comput. Sci."
, volume =	74
, year =	1990
, pages =	"95--114"
, succeeds =	"pt-dpplo-89"
}

@article{pt-eplcs-92
, author =	"F. P. Preparata and R. Tamassia"
, title =	"Efficient point location in a convex spatial cell-complex"
, journal =	"SIAM J. Comput."
, volume =	21
, year =	1992
, pages =	"267--280"
, succeeds =	"pt-espl-89"
}

@inproceedings{pt-espl-89
, author =	"F. P. Preparata and R. Tamassia"
, title =	"Efficient spatial point location"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"3--11"
, precedes =	"pt-eplcs-92"
}

@article{pt-fdplm-89
, author =	"F. P. Preparata and R. Tamassia"
, title =	"Fully dynamic point location in a monotone subdivision"
, journal =	"SIAM J. Comput."
, volume =	18
, number =	4
, year =	1989
, pages =	"811--830"
, update =	"98.11 bibrelex"
}

@inproceedings{pt-fdtpl-88
, author =	"F. P. Preparata and R. Tamassia"
, title =	"Fully dynamic techniques for point location and transitive closure in planar structures"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"558--567"
, comments =	"In two journal papers: \cite{tp-dmpda-90},
		 \cite{pt-fdplm-89}"
}

@inproceedings{pv-sthle-92
, author =	"F. P. Preparata and J. S. Vitter"
, title =	"A simplified technique for hidden-line elimination in terrains"
, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	577
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"135--146"
, precedes =	"pv-sthle-93"
, update =	"94.09 vitter"
}

@article{pv-sthle-93
, author =	"F. P. Preparata and J. S. Vitter"
, title =	"A Simplified Technique for Hidden-Line Elimination in Terrains"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"167--181"
, succeeds =	"pv-sthle-92"
, update =	"94.09 vitter"
}

@techreport{pvy-cavsi-88
, author =	"F. P. Preparata and J. S. Vitter and M. Yvinec"
, title =	"Computation of the axial view of a set of isothetic parallelepipeds"
, type =	"Report"
, number =	"LIENS-88-1"
, institution =	"Lab. d'Informatique, Dept. Math. d'Informatique, Ecole Normale Sup{\'e}rieure"
, address =	"Paris, France"
, year =	1988
, precedes =	"pvy-cavsi-90"
}

@article{pvy-cavsi-90
, author =	"F. P. Preparata and J. S. Vitter and M. Yvinec"
, title =	"Computation of the axial view of a set of isothetic parallelepipeds"
, journal =	"ACM Trans. Graph."
, volume =	9
, year =	1990
, pages =	"278--300"
, succeeds =	"pvy-cavsi-88"
}

@inproceedings{pvy-osgpv-90
, author =	"F. P. Preparata and J. S. Vitter and M. Yvinec"
, title =	"Output-sensitive generation of the perspective view of isothetic parallelepipeds"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"71--84"
}

@article{pvy-osgpv-92
, author =	"F. P. Preparata and J. S. Vitter and M. Yvinec"
, title =	"Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"257--283"
, keywords =	"geometric probing, polyhedral scenes"
}

@book{ptvf-nrc-88
, author =	"W. Press and S. Teukolsky and W. Vetterling and B. Flannery"
, title =	"Numerical Recipes in {C}"
, edition =	"1st"
, publisher =	"Cambridge University Press"
, year =	1988
, succeeds =	"pftv-nr-86"
, update =	"98.11 bibrelex, 97.11 bibrelex"
}

@book{pftv-nr-86
, author =	"W. H. Press and B. P. Flannery and S. A. Teukolsky and W. T. Vetterling"
, title =	"Numerical Recipes"
, publisher =	"Cambridge University Press"
, year =	1986
, precedes =	"ptvf-nrc-88"
, update =	"97.11 bibrelex"
}

@book{pftv-nrc-93
, author =	"William H. Press and Brian P. Flannery and Saul A. Teukolsky and William T. Vetterling"
, title =	"Numerical Recipes in~{C}"
, edition =	"2nd"
, publisher =	"Cambridge University Press"
, address =	"Cambridge, England"
, year =	1993
, update =	"98.07 tamassia+vismara, 97.11 bibrelex"
}

@book{pu-mipa-82
, author =	"K. Preston and L. Uhr"
, title =	"Multicomputers and Image Processing Algorithms"
, publisher =	"Academic Press"
, year =	1982
, update =	"97.11 bibrelex"
}

@incollection{p-mrisf-87
, author =	"W. I. Pribble"
, title =	"Molds for reaction injection, structural foam and expandable styrene molding"
, editor =	"J. H. DuBois and W. I. Pribble"
, booktitle =	"Plastics mold engineering handbook"
, publisher =	"Van Nostrand Reinhold Company Inc."
, address =	"New York, NY"
, year =	1987
, update =	"98.03 bibrelex"
}

@book{p-lb-71
, author =	"K. H. Pribram"
, title =	"Languages of the brain"
, publisher =	"Prentice-Hall inc."
, address =	"Englewood cliffs, New Jersey"
, year =	1971
, update =	"98.11 bibrelex"
}

@inproceedings{psb-motmo-95
, author =	"Mark Price and Clive Stops and Geoffrey Butlin"
, title =	"A Medial Object Toolkit for Meshing and Other Applications"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"219--230"
, update =	"96.01 samitchell"
}

@inproceedings{p-aapfp-91
, author =	"D. Priest"
, title =	"Algorithms for arbitrary precision floating point arithmetic"
, booktitle =	"Proc. 10th Symp. on coputer arithmetic"
, year =	1991
, pages =	"132--143"
, update =	"96.05 devillers"
}

@phdthesis{p-pfpan-92
, author =	"D. Priest"
, title =	"On properties of floating point arithmetics: numerical stability and the cost of accurate computations"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. of mathematics"
, address =	"Univ. of California at Berkeley"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"96.05 devillers"
}

@article{p-aicad-86
, author =	"D. Prill"
, title =	"On approximations and incidence in cylindrical algebraic decompositions"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"972--993"
, update =	"98.03 bibrelex"
}

@article{p-scnsg-57
, author =	"R. C. Prim"
, title =	"Shortest connection networks and some generalizations"
, journal =	"Bell Syst. Tech. J."
, volume =	36
, year =	1957
, pages =	"1389--1401"
}

@article{psts-tagsd-91
, author =	"L. B. Protsko and P. G. Sorenson and J. P. Tremblay and D. A. Schaefer"
, title =	"Towards the Automatic Generation of Software Diagrams"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-17"
, number =	1
, year =	1991
, pages =	"10--21"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{p-cstp-88
, author =	"J. S. Provan"
, title =	"Convexity and the {Steiner} Tree Problem"
, journal =	"Networks"
, volume =	18
, year =	1988
, pages =	"57--72"
, update =	"98.11 bibrelex"
}

@article{p-tncfs-92
, author =	"J. S. Provan"
, title =	"Two new criteria for finding {Steiner} hulls in {Steiner} tree problems"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"289--302"
, update =	"98.11 bibrelex"
}

@techreport{p-sccps-84
, author =	"P. Prusinkiewicz"
, title =	"Space complexity of the contour problem for a set of iso-rectangles"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Univ. Regina"
, address =	"Regina, SK"
, month =	dec
, year =	1984
, keywords =	"isothetic rectangles, construction, plane-sweep, segment trees, worst-case analysis, output-sensitive"
, annote =	"$O(n \log n + k)$ time, $O(n)$ space"
}

@techreport{pr-ssoca-83
, author =	"P. Prusinkiewicz and V. V. Raghavan"
, title =	"A simple space-optimal contour algorithm for a set of iso-rectangles"
, type =	"Report"
, number =	"CS-83-03"
, institution =	"Dept. Comput. Sci., Univ. Regina"
, address =	"Regina, SK"
, year =	1983
, keywords =	"isothetic rectangles, construction, plane-sweep, linked lists, worst-case analysis"
, annote =	"$O(n^{2})$ time, $O(n)$ space"
}

@techreport{py-anfaq-84
, author =	"C. Puech and H. Yahia"
, title =	"Analysis of a neighbour finding algorithm in quadtrees"
, type =	"Report"
, number =	"??"
, institution =	"Lab. Recherche Inform., Univ. Paris Sud"
, address =	"Orsay, France"
, year =	1984
}

@inproceedings{py-qohua-85
, author =	"C. Puech and H. Yahia"
, title =	"Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"272--280"
, cites =	"achllstu-mairp-81, an-bp-72, beh-gms-79, b-gmcv-74, b-ame-74, dt-dtoeo-81, drs-rrbcq-80, e-rsp-70, fp-ochr3-84, f-addmd-79, fs-ppmta-83, ftyk-oasm-83, ftyk-eotds-83, g-ewrq-82, gd-tdsgi-81, h-ecdsg-78, hs-oiuqt-79, i-lgto-81, j-cmtdo-79, jt-otur3-82, kd-epurd-76, m-oe-80, m-gmuqe-82, mm-anrt-78, p-remdt-83, py-anfaq-84, rr-rtdo-78, r-rrstm-80, rv-smcsr-83, s-rrqba-80, s-dtdqt-80, s-rrqbc-80, s-cpirq-81, s-ccluq-81, s-acrq-81, s-nftir-82, s-qmat-83, s-qrhds-84, sw-ebq-84, s-rtddi-81, s-lfdle-81, ykf-ordsa-84, yk-lsdso-83, ys-hdsmd-83, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{p-slc-89
, author =	"W. Pugh"
, title =	"Skip List Cookbook"
, type =	"Technical {Report}"
, number =	"CS-TR-2286"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, month =	jul
, year =	1989
, update =	"98.07 bibrelex"
}

@article{p-slpab-90
, author =	"W. Pugh"
, title =	"Skip lists: a probabilistic alternative to balanced trees"
, journal =	"Commun. ACM"
, volume =	33
, number =	6
, year =	1990
, pages =	"668--676"
, keywords =	"data structuring, randomized algorithms"
, update =	"97.11 bibrelex, 93.05 jones"
}

@inproceedings{p-csarg-90
, author =	"D. Pullar"
, title =	"Comparative study of algorithms for reporting geometrical intersections"
, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
, year =	1990
, pages =	"66--76"
, update =	"98.03 bibrelex"
}

@incollection{p-pc-89
, author =	"W. R. Pulleyblank"
, title =	"Polyhedral combinatorics"
, editor =	"G. L. Nemhauser and A. H. G. {Rinnooy Kan} and M. J. Todd"
, booktitle =	"Optimization"
, series =	"Handbooks in Operations Research and Management Science"
, volume =	1
, publisher =	"North-Holland"
, year =	1989
, pages =	"371--446"
, update =	"97.11 bibrelex"
}

@inproceedings{p-vrts-96
, author =	"E. Puppo"
, title =	"Variable resolution terrain surfaces"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"202--210"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{p-wageh-97
, author =	"Helen Purchase"
, title =	"Which Aesthetic has the Greatest Effect on Human Understanding?"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"248--261"
, keywords =	"graph drawing"
, update =	"99.11 bibrelex, 98.07 patrignani+tamassia+vismara"
}

@article{p-eivsg-00
, author =	"Helen C. Purchase"
, title =	"Effective Information Visualisation: A Study of Graph Drawing Aesthetics and Algorithms"
, journal =	"Interact. Comput."
, volume =	13
, number =	2
, year =	2000
, pages =	"147--162"
, succeeds =	"p-wageh-97"
, update =	"01.04 vismara"
}

@article{p-placc-98
, author =	"Helen C. Purchase"
, title =	"Performance of Layout Algorithms: Comprehension, not Computation"
, journal =	"J. Visual Lang. Comput."
, volume =	9
, number =	6
, year =	1998
, pages =	"647--657"
, update =	"01.04 vismara"
}

@inproceedings{pcj-vgda-96
, author =	"H. C. Purchase and R. F. Cohen and M. James"
, title =	"Validating Graph Drawing Aesthetics"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"435--446"
, keywords =	"graph drawing, aesthetics, human-computer interaction"
, update =	"98.07 vismara, 96.09 tamassia, 96.04 garg"
}

@article{pcj-esbgd-97
, author =	"H. C. Purchase and R. F. Cohen and M. I. James"
, title =	"An Experimental Study of the Basis for Graph Drawing Algorithms"
, journal =	"ACM J. Experim. Algorithmics"
, volume =	2
, number =	4
, year =	1997
, url =	"http://www.jea.acm.org/1997/PurchaseDrawing/"
, succeeds =	"pcj-vgda-96"
, update =	"99.07 vismara"
}

@article{p-rae-88
, author =	"G. Purdy"
, title =	"Repeated angles in {$E_4$}"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"73--75"
}

@article{p-mnet-82
, author =	"G. B. Purdy"
, title =	"The minimum number of empty triangles"
, journal =	"AMS Abstracts"
, volume =	3
, year =	1982
, pages =	318
, update =	"02.03 devillers"
}

@techreport{qam-spinp-91
, author =	"K. Qiu and S. G. Akl and H. Meijer"
, title =	"The Star and Pancake Interconnection Networks: Properties and Algorithms"
, type =	"Technical Report"
, number =	"91-297"
, institution =	"Dept. Computing and Information Sci, Queen's University"
, address =	"Canada"
, month =	mar
, year =	1991
, update =	"98.07 bibrelex"
}

@inproceedings{qma-dsgdc-90
, author =	"K. Qiu and H. Meijer and S. Akl"
, title =	"Decomposing a star graph into disjoint cycles"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"70--73"
, cites =	"ak-gtmsi-86, ahk-sgaan-87, ak-ftsg-87, a-dapa-89, qma-dsgdc-90t, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{qma-dsgdc-90t
, author =	"K. Qiu and H. Meijer and S. G. Akl"
, title =	"Decomposing a star graph into disjoint cycles"
, type =	"Technical {Report}"
, number =	"90-278"
, institution =	"Dept. Comput. Inform. Sci., Queen's Univ."
, address =	"Kingston, Canada"
, month =	may
, year =	1990
, update =	"98.07 bibrelex"
}

@unpublished{qma-prspn-91
, author =	"K. Qiu and H. Meijer and S. G. Akl"
, title =	"Parallel Routing and Sorting on the Pancake Network"
, month =	may
, year =	1991
, note =	"Proc. International Conf. on Computing and Information, Ottawa, to appear-91"
, update =	"98.07 bibrelex"
}

@article{qs-csfdd-90
, author =	"E. Quak and L. Schumaker"
, title =	"Cubic spline fitting using data dependent triangulations"
, journal =	"Comput. Aided Geom. Design"
, volume =	7
, year =	1990
, pages =	"293--302"
, update =	"97.03 schwarzkopf"
}

@inproceedings{qfp-dsarn-85
, author =	"F. K. H. Quek and R. F. Franklin and F. Pont"
, title =	"A Decision System for Autonomous Robot Navigation Over Rough Terrain"
, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
, volume =	"??"
, year =	1985
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@article{q-abtps-89
, author =	"M. J. Quinn"
, title =	"Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge"
, journal =	"BIT"
, volume =	29
, number =	2
, year =	1989
, pages =	"239--250"
, update =	"96.09 orourke"
}

@incollection{r-fcdmc-94
, author =	"Rich Rabbitz"
, title =	"Fast Collision Detection of Moving Convex Polyhedra"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"83--109"
, keywords =	"animation, collision detection, computational geometry, polyhedron"
, update =	"94.09 heckbert"
, annote =	"A turn-key piece of software that solves a difficult but
basic problem in physically based animation and interactive modeling.
Contains C code."
}

@incollection{r-pa-76
, author =	"M. O. Rabin"
, title =	"Probabilistic algorithms"
, editor =	"J. F. Traub"
, booktitle =	"Algorithms and Complexity: New Directions and Recent Results"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1976
, pages =	"21--39"
, update =	"98.11 bibrelex"
}

@article{r-paff-80
, author =	"M. O. Rabin"
, title =	"Probabilistic algorithms in finite fields"
, journal =	"SIAM J. Comput."
, volume =	9
, number =	2
, year =	1980
, pages =	"273--280"
, update =	"98.03 bibrelex"
}

@article{r-psplf-72
, author =	"M. O. Rabin"
, title =	"Proving simultaneous positivity of linear forms"
, journal =	"J. Comput. Syst. Sci."
, volume =	6
, year =	1972
, pages =	"639--650"
}

@techreport{rb-nbeaj-??
, author =	"G. Radack and N. Badler"
, title =	"A new boundary encoding with applications to jigsaw puzzles"
, type =	"Manuscript"
, institution =	"Dept. Comput. Inform. Sci., Univ. Pennsylvania"
, address =	"Philadelphia, PA"
, year =	"??"
}

@book{r-lent-64
, author =	"H. Rademacher"
, title =	"Lectures on Elementary Number Theory"
, publisher =	"Blaisdell"
, address =	"New York, NY"
, year =	1964
, update =	"97.11 bibrelex"
}

@book{rt-em-57
, author =	"H. Rademacher and O. Toeplitz"
, title =	"The Enjoyment of Mathematics"
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1957
, update =	"98.03 bibrelex"
}

@incollection{rt-scfsp-57
, author =	"H. Rademacher and O. Toeplitz"
, title =	"The spanning circle of a finite set of points"
, chapter =	16
, booktitle =	"The Enjoyment of Mathematics"
, publisher =	"Princeton University Press"
, year =	1957
, update =	"98.07 bibrelex"
}

@incollection{r-ssp-88
, author =	"J. D. Radke"
, title =	"On the shape of a set of points"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"105--136"
}

@incollection{r-mpg-78
, author =	"R. Rado"
, title =	"Monochromatic paths in graphs"
, editor =	"B. Bollob{\'a}s"
, booktitle =	"Advances in Graph Theory"
, series =	"Ann. Discrete Math."
, volume =	3
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	1978
, pages =	"191--194"
, update =	"97.11 bibrelex"
}

@article{r-mkkde-21
, author =	"J. Radon"
, title =	"Mengen konvexer {K{\"o}rper}, die einen gemeinsamen {Punkt} enthalten"
, journal =	"Math. Ann."
, volume =	83
, year =	1921
, pages =	"113--115"
, update =	"97.11 bibrelex"
}

@article{r-bfigm-17
, author =	"J. Radon"
, title =	"{\"Uber} die Bestimmung von Funktionen duch ihre Integralwerte {l\"angs} gewisser Mannigfaltigkeiten"
, journal =	"Ber. Verb. {S\"achs.} Wiss., Leipzig, Math. Phys. Kl."
, volume =	69
, year =	1917
, pages =	"262--277"
, update =	"98.11 bibrelex"
}

@inproceedings{r-pscc-90
, author =	"P. Ragde"
, title =	"The Parallel Simplicity of Compaction and Chaining"
, booktitle =	"Proc. 17th International Colloquium on Automata, Languages and Programming, LNCS 443"
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"744--751"
, update =	"97.11 bibrelex, 96.09 orourke"
}

@inproceedings{r-cgipb-96
, author =	"P. Raghavan"
, title =	"Computational geometry impact potential: {A} business and industrial perspective"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"276--276"
, update =	"97.03 agarwal, 96.09 mitchell"
, annote =	"Invited Lecture by P. Raghavan"
}

@inproceedings{r-iras
, author =	"P. Raghavan"
, title =	"Information Retrieval Algorithms: {A} Survey"
, booktitle =	"Proc. 18th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1997
, pages =	"11--18"
, update =	"98.07 agarwal"
}

@techreport{r-lnra-90
, author =	"P. Raghavan"
, title =	"Lecture notes on randomized algorithms"
, type =	"Research {Report}"
, number =	"RC15340"
, institution =	"IBM"
, year =	1990
, update =	"97.11 bibrelex"
}

@inproceedings{rcs-mw-81
, author =	"V. V. Raghavan and J. Cohon and S. Sahni"
, title =	"Manhattan wiring"
, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
, year =	1981
, pages =	"1--10"
}

@article{ry-nmsp-77
, author =	"V. V. Raghavan and C. T. Yu"
, title =	"A note on a multidimensional searching problem"
, journal =	"Inform. Process. Lett."
, volume =	6
, year =	1977
, pages =	"133--135"
}

@inproceedings{rs-ncbrv-97
, author =	"S. Raghotama and V. Shapiro"
, title =	"Necessary conditions for boundary representation variance"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"77--86"
, cites =	"a-at-76, adps-pptpt-95, a-bt-79, bfhcp-gcs-93, cch-gngcb-96, ch-efbd-96, hy-t-61, hr-rmsm-96, h-gsm-89, h-sggr-93, hd-pvd-94, k-ts-93, k-mpnte-95, lm-sgch-95, m-eat-84, or-sdimp-89t, p-lat-83, r-dsmbr-96, r-mmrso-79, r-rrstm-80, r-rtsmi-84, r-cfitf-96, s-mgrsd-97, sv-wipfs-95, rs-brvps-97, s-scctf-92, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{rs-brvps-97
, author =	"S. Raghothama and V. Shapiro"
, title =	"Boundary representation variance in parametric solid modeling"
, type =	"Technical {Report}"
, number =	"SAL 1997-1"
, institution =	"Univ. Wisconsin"
, address =	"Madison, WI"
, month =	jan
, year =	1997
, update =	"98.07 bibrelex"
}

@phdthesis{r-edt-93
, author =	"Ingemar Ragnemalm"
, title =	"The {Euclidean} Distance Transform"
, type =	"Link{\"o}ping Studies in Science and Technology, Ph.{D}. Dissertation"
, school =	"Department of Electrical Engineering, Link{\"o}ping University"
, address =	"Sweden"
, year =	1993
, note =	304
, keywords =	"doctoral thesis"
, update =	"98.03 mitchell"
}

@article{rnn-rgdpg-98
, author =	"Md. Saidur Rahman and Shin-ichi Nakano and Takao Nishizeki"
, title =	"Rectangular Grid Drawings of Plane Graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, number =	3
, year =	1998
, pages =	"203--220"
, update =	"98.11 devillers+vismara"
}

@inproceedings{rnn-laood-97
, author =	"Md. Saidur Rahman and {Shin-ichi} Nakano and Takao Nishizeki"
, title =	"A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"99--110"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{rh-adll-91
, author =	"M. H. Raibert and J. K. Hodgins"
, title =	"Animation of dynamic legged locomotion"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1991
, pages =	"349--358"
, note =	"Proc. SIGGRAPH '91"
, update =	"97.11 bibrelex"
}

@inproceedings{r-mttp-85
, author =	"V. T. Rajan"
, title =	"Minimum Time Trajectory Planning"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, month =	mar
, year =	1985
, pages =	"759--764"
, update =	"93.09 milone+mitchell"
}

@inproceedings{r-odtr-91
, author =	"V. T. Rajan"
, title =	"Optimality of the {Delaunay} triangulation in {$R^{d}$}"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"357--363"
, keywords =	"Delaunay triangulation"
, precedes =	"r-odtr-94"
, cites =	"a-vds-88, b-vdch-79, e-acg-87, es-vda-86, e-atccd-89, f-savd-87, gs-pmgsc-85, l-gtgac-72, ps-cgi-85, sh-cpp-75, s-cg-78, sntm-amgus-90, ZZZ"
, update =	"00.03 bibrelex, 97.11 bibrelex"
}

@article{r-odtr-94
, author =	"V. T. Rajan"
, title =	"Optimality of the {Delaunay} triangulation in {$R^d$}"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"189--202"
, succeeds =	"r-odtr-91"
, update =	"00.03 bibrelex"
}

@inproceedings{rr-oprav-94
, author =	"S. Rajasekaran and S. Ramaswami"
, title =	"Optimal Parallel Randomized Algorithms for the {Voronoi} Diagram of Line Segments in the Plane and Related Problems"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"57--66"
, cites =	"acgoy-pcg-88, ap-np3dc-93, acg-cdctd-89, ag-epsgp-85, c-pagp-80, cs-arscg-89, c-pms-88, cg-opapp-92, dk-ppess-87, f-savd-86, gmv-ttnct-92, g-gpmee-93, goy-cvdsl-89, hw-ensrq-87, k-eccs-79, k-osps-83, ld-gvdp-81, m-fppa1-88, oy-rmpmd-85, rs-pnrst-89, rs-oprat-92, rs-orpac-92, y-oavds-87, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@article{rr-ostrp-89
, author =	"S. Rajasekaran and J. H. Reif"
, title =	"Optimal and sublogarithmic time randomized parallel sorting algorithms"
, journal =	"SIAM J. Comput."
, volume =	"??"
, year =	1989
, pages =	"594--607"
, update =	"97.11 bibrelex"
}

@incollection{rs-rstpa-93
, author =	"S. Rajasekaran and S. Sen"
, title =	"Random Sampling Techniques and Parallel Algorithms Design"
, editor =	"J. H. Reif"
, booktitle =	"Synthesis of Parallel Algorithms"
, publisher =	"Morgan Kaufmann Publishers"
, year =	1993
, pages =	"411--452"
, update =	"96.09 orourke"
}

@techreport{rr-ptp-90
, author =	"V. Ramachandran and J. Reif"
, title =	"Planarity Testing in Parallel"
, number =	"TR-90-15"
, institution =	"Department of Computer Science, University of Texas at Austin"
, year =	1990
, keywords =	"graph drawing"
, update =	"98.07 patrignani, 93.09 tamassia"
}

@inproceedings{rr-opagp-89
, author =	"V. Ramachandran and J. H. Reif"
, title =	"An Optimal Parallel Algorithm for Graph Planarity"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"282--293"
, keywords =	"graph drawing"
, comments =	"Submitted to J. Comput. System Sci."
, update =	"93.09 tamassia"
}

@article{rlt-pmruh-83
, author =	"K. Ramamohanarao and J. W. Lloyd and J. A. Thom"
, title =	"Partial-match retrieval using hashing and descriptors"
, journal =	"ACM Trans. Database Syst."
, volume =	8
, year =	1983
, pages =	"552--576"
}

@article{ri-pafqp-83
, author =	"V. Raman and S. S. Iyengar"
, title =	"Properties and applications of forests of quadtrees for pictorial data representation"
, journal =	"BIT"
, volume =	23
, year =	1983
, pages =	"472--486"
}

@inproceedings{r-nlbti-91
, author =	"P. Ramanan"
, title =	"A new lower bound technique and its application: tight lower bound for a polygon triangulation problem"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"281--290"
, annote =	"$\Omega(n \log n)$ for minimum-weight triangulation of
		 simple polygon with weighted vertices"
}

@inproceedings{ra-amprc-85
, author =	"G. Ramanathan and V. S. Alagar"
, title =	"Algorithmic motion planning in robotics: {Coordinated} motion of several discs amidst polygonal barriers"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1985
, pages =	"514--522"
, update =	"98.03 bibrelex"
}

@article{rn-isbmn-87
, author =	"R. Ramaraj and G. M. Nielson"
, title =	"Interpolation Over a Sphere Based on a Minimum Norm Network"
, journal =	"Comput. Aided Geom. Design"
, volume =	4
, year =	1987
, pages =	"41--57"
, annote =	"Sphere triangulation. Switching based on max-min angle
		 test. (Is this the same as taking the convex hull?)"
}

@article{rp-fkdta-92
, author =	"V. Ramasubramanian and K. K. Paliwal"
, title =	"Fast $k$-dimensional tree algorithms for nearest neighbor search with applications to vector quantization encoding"
, journal =	"IEEE Trans. Signal Processing"
, volume =	40
, year =	1992
, pages =	"518--531"
, update =	"97.07 agarwal"
}

@inproceedings{ryp-spsff-97
, author =	"K. Ramaswami and Y. Yamaguchi and F. B. Prinz"
, title =	"Spatial Partitioning of Solids for Freeform Fabrication"
, booktitle =	"Proc. 4th Sympos. Solid Modeling Found. Applications"
, site =	"Atlanta, GA, USA"
, month =	may
, year =	1997
, pages =	"346--353"
, update =	"97.07 held"
}

@inproceedings{rrt-ctq-95
, author =	"Suneeta Ramaswami and Pedro Ramos and Godfried Toussaint"
, title =	"Converting Triangulations to Quadrangulations"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"297--302"
, precedes =	"rrt-ctq-98"
, update =	"98.03 mitchell, 95.09 jones"
}

@article{rrt-ctq-98
, author =	"Suneeta Ramaswami and Pedro Ramos and Godfried Toussaint"
, title =	"Converting Triangulations to Quadrangulations"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, number =	4
, year =	1998
, pages =	"257--276"
, succeeds =	"rrt-ctq-95"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{rs-pctoe-94
, author =	"S. Ramaswamy and S. Subramanian"
, title =	"Path caching: A technique for optimal external searching"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Principles Database Syst."
, year =	1994
, pages =	"25--35"
, update =	"96.05 agarwal"
}

@article{r-ippap-
, author =	"Urs Ramer"
, title =	"An iterative procedure for the polygonal approximation of plane curves"
, journal =	"Comput. Graph. Image Process."
, volume =	1
, pages =	"244--256"
, update =	"93.09 milone+mitchell"
}

@inproceedings{r-acmso-96
, author =	"G. D. Ramkumar"
, title =	"An Algorithm to Compute the {Minkowski} Sum Outer-Face of Two Simple Polygons"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"234--241"
, cites =	"bgrr-pttc-, cegghss-rspug-91, cegss-cfals-93, gt-drssp-93, grs-kfcg-83, gs-ccrs-87, hcahs-csfms-95, kos-cmsrp-91i, l-spcsa-83, ZZZ"
, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
}

@inproceedings{r-c1dle-97
, author =	"E. Ramos"
, title =	"Construction of $1$-d lower envelopes and applications"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"57--66"
, cites =	"a-gpia-91i, am-rsss-94, agr-cfssa-95, agr-pahdc-94, ar-cvddp-96, a-sdcgp-85, c-osrch-95, csy-oscpf-95, c-chdc-93, cegs-dwclp-93, cm-dosch-92, cm-ltdao-93, cs-arscg-89, c-sdsno-87, cgo-mftpe-90, dk-fdpi-83, e-acg-87, es-otatd-91, em-sstcd-90, gg-ptpch-91, gz-odapp-95, g-uaadp-91, g-gpmee-93, g-fdplp-96, goy-cvdsl-93, gr-bidgp-97, gs-fospc-96, hr-wmhtb-92, h-bevv-56, ks-upcha-86, k-cavd-89, m-aogdc-91, m-cha-91, m-ept-92, ms-datdd-96, ms-ufetp-91, m-apcad-83, m-cgitr-93, p-plmps-94, ps-cgi-85, rr-oprav-94, r-aierb-94, rs-oprat-92, sa-dsstg-95, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{r-iubdp-96
, author =	"E. Ramos"
, title =	"Intersection of unit-balls and diameter of a point set in {$R^3$}"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"in press"
, update =	"98.07 agarwal, 97.03 agarwal, 96.05 agarwal, 95.09 agarwal"
}

@article{r-iubdp-97
, author =	"E. Ramos"
, title =	"Intersection of unit-balls and diameter of a point set in {$R^3$}"
, journal =	"Computat. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"57--65"
, update =	"98.03 agarwal"
}

@techreport{r-n3sfp-93
, author =	"E. Ramos"
, title =	"The number of $3$-sets of a finite point set in the plane"
, type =	"Technical {Report}"
, number =	"UIUCDCS-R-93-1843"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana-Champaign , IL"
, year =	1993
, update =	"98.03 bibrelex"
}

@techreport{r-aierb-94
, author =	"E. A. Ramos"
, title =	"An algorithm for intersecting equal radius balls ${R^3}$"
, type =	"Technical {Report}"
, number =	"UIUCDCS-R-94-1851"
, institution =	"Dept. of Computer Science, University of Illinois at Urbana-Champaign"
, year =	1994
, update =	"97.03 agarwal, 96.09 orourke"
}

@article{r-odacd-01
, author =	"E. A. Ramos"
, title =	"An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set"
, journal =	"Discrete Comput. Geom."
, volume =	26
, year =	2001
, pages =	"233--244"
, update =	"01.11 smid"
}

@inproceedings{r-dadsl-00
, author =	"Edgar A. Ramos"
, title =	"Deterministic Algorithms for {3-D} Diameter and some {2-D} Lower Envelopes"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"290--299"
, update =	"00.11 smid, 00.07 agarwal"
}

@inproceedings{r-lpqr-00
, author =	"Edgar A. Ramos"
, title =	"Linear Programming Queries Revisited"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"176--181"
, update =	"00.11 smid, 00.07 agarwal"
}

@phdthesis{r-tegc
, author =	"P. Ramos"
, title =	"Tolerancia de Estructuras Geom{\'e}trias y Combinatorias"
, school =	"??"
, note =	"in spanish, in preparation"
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{r-crp-98
, author =	"Pedro A. Ramos"
, title =	"Computing Roundness in Practice"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"125--126"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{r-cresa-99
, author =	"Pedro A. Ramos"
, title =	"Computing Roundness is Easy if the Set is Almost Round"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
, year =	1999
, pages =	"307--315"
, update =	"99.07 devillers"
}

@article{r-pfl-30
, author =	"F. P. Ramsey"
, title =	"On a problem of formal logic"
, journal =	"Proc. London Math. Soc."
, volume =	30
, year =	1930
, pages =	"264--286"
, update =	"98.03 bibrelex"
}

@techreport{r-bcdas-87
, author =	"L. Ramshaw"
, title =	"Blossoming: {A} connected-the-dots approach to splines"
, type =	"Technical {Report}"
, number =	19
, institution =	"Digital Systems Research Center"
, address =	"Palo Alto, CA"
, year =	1987
, update =	"98.07 bibrelex"
}

@unpublished{r-cnebf-82
, author =	"L. Ramshaw"
, title =	"{CSL} notebook entry: {The} braiding of floating point lines"
, year =	1982
, note =	"Unpublished note"
, update =	"98.03 bibrelex"
}

@inproceedings{rs-dgtsv-00
, author =	"Adee Ran and Nir Sochen"
, title =	"Differential Geometry Techniques in Stereo Vision"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"98--103"
, update =	"00.03 bibrelex"
}

@article{r-hesm-91
, author =	"A. G. Ranade"
, title =	"How to emulate shared memory"
, journal =	"J. Comput. Syst. Sci."
, volume =	42
, year =	1991
, pages =	"307--326"
, update =	"96.09 orourke"
}

@techreport{rrp-uqis-80
, author =	"S. Ranade and A. Rosenfeld and J. M. S. Prewitt"
, title =	"Use of quadtrees for image segmentation"
, type =	"Report"
, number =	"TR-878"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1980
}

@techreport{rrs-sauq-79
, author =	"S. Ranade and A. Rosenfeld and H. Samet"
, title =	"Shape approximation using quadtrees"
, type =	"Report"
, number =	"TR-847"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1979
}

@article{rrs-sauq-82
, author =	"S. Ranade and A. Rosenfeld and H. Samet"
, title =	"Shape approximation using quadtrees"
, journal =	"Pattern Recogn."
, volume =	15
, number =	1
, year =	1982
, pages =	"31--40"
, update =	"96.05 efrat"
}

@article{rs-uqsi-81
, author =	"S. Ranade and M. Shneier"
, title =	"Using quadtrees for smooth images"
, journal =	"Pattern Recogn."
, volume =	15
, year =	1981
, pages =	"31--40"
}

@book{r-cag-61
, author =	"J. F. Randolph"
, title =	"Calculus and Analytic Geometry"
, publisher =	"Wadsworth"
, year =	1961
, update =	"98.03 bibrelex"
}

@inproceedings{rsb-ocd-88
, author =	"K. Rangarajan and M. Shah and D. V. Brackle"
, title =	"Optimal corner detector"
, booktitle =	"Proc. 2nd Int. Conf. Comput. Visison"
, year =	1988
, pages =	"90--94"
, update =	"98.11 bibrelex"
}

@article{rf-cusmm-96
, author =	"V. Ranjan and A. Fournier"
, title =	"Creating Union of Spheres Models from Multiple Views"
, journal =	"J. Graphics Tools"
, volume =	1
, number =	4
, year =	1996
, pages =	"21--39"
, update =	"97.11 held"
}

@inproceedings{rf-usumv-95
, author =	"Vishwa Ranjan and Alain Fournier"
, title =	"Union of Spheres (UoS) Model for Volumetric Data"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C2--C3"
, keywords =	""
, cites =	"a-pdpaa-87, e-ubids-93, em-tdas-94, rf-vmvd-94, w-sedbe-91, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{rf-vmvd-94
, author =	"V. Ranjan and A. Fournier"
, title =	"Volume models for volumetric data"
, journal =	"IEEE Computer"
, volume =	27
, number =	7
, month =	jul
, year =	1994
, pages =	"28--36"
, update =	"98.03 bibrelex"
}

@article{r-cpscn-55
, author =	"R. A. Rankin"
, title =	"The closest packing of spherical caps in $n$ dimensions"
, journal =	"Proc. Glasgow Math. Assoc."
, volume =	2
, year =	1955
, pages =	"139--144"
, update =	"97.11 bibrelex"
}

@article{rg-prm-94
, author =	"Anil Rao and Ken Goldberg"
, title =	"Placing Registration Marks"
, journal =	"IEEE Transactions on Industrial Electronics"
, volume =	41
, month =	feb
, year =	1994
, update =	"98.03 agarwal"
}

@techreport{rg-rspid-91
, author =	"A. Rao and K. Y. Goldberg"
, title =	"Recovering the shape of a polygon from its diameter"
, type =	"Technical {Report}"
, institution =	"Inst. Robot. Intell. Syst., Univ. Southern California"
, year =	1991
, update =	"98.07 bibrelex"
}

@techreport{rkg-carpp-94
, author =	"A. Rao and D. Kriegman and K. Goldberg"
, title =	"Complete algorithms for reorienting polyhedral parts using a pivoting gripper"
, type =	"Technical {Report}"
, number =	"UU-CS-1994-49"
, institution =	"Utrecht university"
, address =	"Utrecht, Netherlands"
, year =	1994
, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-49.ps.gz"
, update =	"98.03 bibrelex"
}

@inproceedings{rkg-carpp-95
, author =	"Anil Rao and David Kriegman and Ken Goldberg"
, title =	"Complete Algorithms for Reorienting Polyhedral Parts Using a Pivoting Gripper"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C22--C23"
, keywords =	""
, cites =	"cgrw-pgfip-94, h-fuenl-89, k-cspps-92, rkg-carpp-94, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{rg-cgf-96
, author =	"A. S. Rao and K. Y. Goldberg"
, title =	"Computing grasp functions"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"145--168"
, update =	"96.09 devillers"
}

@article{rg-mapp-95
, author =	"A. S. Rao and K. Y. Goldberg"
, title =	"Manipulating Algebraic Parts in the Plane"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	11
, number =	4
, month =	aug
, year =	1995
, pages =	"598--602"
, update =	"96.01 held"
}

@inproceedings{rg-rpsid-92
, author =	"A. S. Rao and K. Y. Goldberg"
, title =	"On the recovery of a polygon's shapes from its diameter function"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"210--215"
, cites =	"cy-sp-87, d-argon-92, g-sprm-90, g-oppws-93, ic-copop-91, j-atag-85, kg-srrg-92, k-oeupj-88, l-rpp-88, pr-popp-92, ps-cgi-85, rg-sdrpp-94, rg-sdrps-91, rg-ogp-92, r-cscsl-87, s-pgp-89, yb-cf-61, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{rg-ogp-92
, author =	"A. S. Rao and K. Y. Goldberg"
, title =	"Orienting generalized polygons"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Nice, France"
, month =	may
, year =	1992
, update =	"98.07 bibrelex"
}

@techreport{rg-sdrps-91
, author =	"A. S. Rao and K. Y. Goldberg"
, title =	"Shape from diameter: on the recovery of a polygon's shape from its diameter function"
, type =	"Technical {Report}"
, number =	270
, institution =	"Inst. Robot. Intell. Syst., Univ. Southern California"
, address =	"Los Angeles, CA"
, month =	aug
, year =	1991
, update =	"98.07 bibrelex"
}

@article{rg-sdrpp-94
, author =	"A. S. Rao and K. Y. Goldberg"
, title =	"Shape from Diameter: Recognizing Polygonal Parts with a Parallel-Jaw Gripper"
, journal =	"IRob"
, volume =	13
, number =	1
, year =	1994
, pages =	"16--37"
, update =	"95.01 held"
}

@book{r-pta-84
, author =	"M. M. Rao"
, title =	"Probability Theory with Applications"
, publisher =	"Academic Press"
, address =	"Orlando, FL"
, year =	1984
, update =	"98.03 bibrelex"
}

@article{r-aflrv-89
, author =	"N. S. V. Rao"
, title =	"Algorithmic Framework for Learned Robot Navigation in Unknown Terrain"
, journal =	"IEEE Computer"
, volume =	22
, year =	1989
, pages =	"37--43"
, keywords =	"on-line motion planning"
, update =	"98.03 mitchell"
}

@techreport{rijw-cgaar-85
, author =	"N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
, title =	"Computational geometry approach to autonomous robot navigation in an unexplored terrain"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Louisiana State Univ. Baton Rouge"
, address =	"Baton Rouge, LA"
, year =	1985
}

@inproceedings{rijw-tafsm-87
, author =	"N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
, title =	"On Terrain Acquisition by a Finite-Sized Mobile Robot in Plane"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Raleigh, NC"
, year =	1987
, pages =	"1314--1319"
, update =	"93.09 milone+mitchell"
}

@article{rijw-rnut-86
, author =	"N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
, title =	"Robot Navigation in an Unexplored Terrain"
, journal =	"Journal of Robotic Systems"
, volume =	3
, number =	4
, year =	1986
, pages =	"389--407"
}

@article{riok-tmapr-88
, author =	"N. S. V. Rao and S. S. Iyengar and B. J. Oommen and R. L. Kashyap"
, title =	"On Terrain Model Acquisition by a Point Robot Amidst Polyhedral Obstacles"
, journal =	"Internat. J. Robot. Autom."
, volume =	4
, number =	4
, year =	1988
, pages =	"450--455"
}

@techreport{rksi-rnut-93
, author =	"N. S. V. Rao and S. Kareti and W. Shi and S. S. Iyengar"
, title =	"Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms"
, number =	"ORNL/TM-12410"
, institution =	"Oak Ridge National Laboratory"
, year =	1993
, update =	"98.03 icking"
}

@techreport{rsi-rmlnu-88
, author =	"N. S. V. Rao and N. Stoltzfus and S. S. Iyengar"
, title =	"A ``Retraction'' Method for Learned Navigation in Unknown Terrains for a Circular Robot"
, type =	"Technical {Report}"
, institution =	"Computer Science, Old dominion Univ."
, year =	1988
, update =	"93.09 milone+mitchell"
}

@article{rvi-dds-88
, author =	"N. S. V. Rao and V. K. Vaishnavi and S. S. Iyengar"
, title =	"On the dynamization of data structures"
, journal =	"BIT"
, volume =	28
, year =	1988
, pages =	"37--53"
}

@inproceedings{rs-aggsb-98
, author =	"Satish B. Rao and Warren D. Smith"
, title =	"Approximating geometrical graphs via ``spanners'' and ``banyans''"
, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
, year =	1998
, pages =	"540--550"
, keywords =	"Polynomial time approximation schemes, optimal algorithms, derandomization, Traveling salesman tour, Steiner minimum tree, Minimum spanning tree, Minimum matchings, 2-matchings, Edge cover, Rectilinear Steiner minimum tree, quadtrees, spanners, banyans."
, update =	"00.11 smid, 00.07 smid, 98.03 mitchell"
, abstract =	"
We give deterministic and randomized algorithms to find a Euclidean
traveling salesman tour (TST) of length within $(1+1/s)$ times
optimal. They run in $O(N \log N)$ time and $O(N)$ space for constant
dimension and $s$.  These time and space bounds are optimal in an
algebraic computation tree model.  We can also find a $(1+1/s)$ times
optimal length 2-matching (M2M), edge cover (EC), minimum spanning
tree (MST), Steiner minimal tree (SMT), rectilinear ditto (RSMT), and
related graphs in the same time bound.
\par
This improves recent algorithms of Arora, which had used $N (\log
N)^{O(s^{d-1})}$ time in fixed dimension $d$ to produce a $(1+1/s)$
times optimal TST (or SMT, RSMT) with success probability $1/2$.  To
verify success, however, Arora could only use a deterministic version
of his algorithm that took a factor of $N^d$ more time.  The increase
in running time for our deterministic version depends only on $s$.
\par
Arora's approach can also be extended to produce other
$(1+\epsilon)$-approximate geometrical graphs besides TSTs, e.g.  the
minimum matching (MM) and subgraph versions of the MST and TST
problems. Our methods (at least at the moment) don't apply to those
problems, but we can produce a $1.001 \exp ( 8 \cdot 2^{1-1/(d-1)}
\sqrt{d} )$-approximate MM in $O(N \log N)$ Monte Carlo time.
\par
Our algorithms are based on using low-weight Euclidean {\em spanner
graphs} (and generalizations of them) in conjunction with the
hierarchical structure theorems that serve as the basis of Arora's
work.
\par
A ``$t$-spanner'' is a graph on $N$ sites such that shortest path
distance between two spanner vertices approximates the Euclidean
distance to within a factor of $t$.  By making work by Arya, Das, et
al. more explicit, we show that a $(1+1/s)$-spanner of $N$ sites in
$d$-space is computable in $(sd)^{O(d)} N \log N$ time and
$(sd)^{O(d)} N$ space, has maximum valence $(sd)^{O(d)}$, and is
$(sd)^{O(d)}$ times longer than the MST.  We show that spanners can in
principle be made orders of magnitude shorter and simpler by allowing
``Steiner points.''
\par
We introduce a remarkable generalization of the notion of
``$t$-spanner,'' the ``$t$-banyan,'' that $t$-approximates
interconnection costs for site subsets of {\it any} cardinality, not
just 2. If $d \ge 1$ and $\epsilon > 0$ are fixed, we show a
$(1+\epsilon)$-banyan of $N$ sites in $d$-space exists, has $O(N)$
vertices and $O(N)$ edges, is only a constant factor longer than the
MST, and is computable in $O(N \log N)$ time."
}

@inproceedings{rm-eacbs-97
, author =	"S. V. Rao and A. Mukhopadhyay"
, title =	"An Efficient Algorithm for Computing $\beta$-Skeleton and its Generalization"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"7--9"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{r-dsmbr-96
, author =	"A. Rappaport"
, title =	"Displayable-selectable models and boundary representations in geometric operation graphs"
, booktitle =	"Theory and Practice of Geometric Modeling"
, site =	"T{\"u}bingen, Germany"
, month =	oct
, year =	1996
, update =	"98.07 bibrelex"
}

@article{r-chada-92
, author =	"D. Rappaport"
, title =	"A convex hull algorithm for discs, and applications"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	3
, year =	1992
, pages =	"171--181"
, keywords =	"disc, convex hull, Voronoi diagram, transversals, minimum spanning circle"
}

@article{r-laehl-86
, author =	"D. Rappaport"
, title =	"A linear algorithm for eliminating hidden lines from a polygonal cylinder"
, journal =	"Visual Comput."
, volume =	2
, year =	1986
, pages =	"44--53"
, keywords =	"design of algorithms, computer graphics, visibility, hidden line/surface elimination, worst-case analysis, three-dimensional"
}

@techreport{r-cscsl-86
, author =	"D. Rappaport"
, title =	"Computing simple circuits from a set of line segments is {NP}-complete"
, number =	"SOCS-86.6"
, institution =	"McGill University"
, year =	1986
, update =	"97.11 bibrelex"
}

@inproceedings{r-cscsl-87
, author =	"D. Rappaport"
, title =	"Computing simple circuits from a set of line segments is {NP}-complete"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"322--330"
, keywords =	"complexity theory, visibility, NP-completeness, polygons, polygonal chains, geometric graphs, traveling salesman tours, line segments"
, cites =	"gjt-phcpn-76, ips-hpgg-82, llrs-tsp-85, m-vcihr-82, o-uocd-86, obw-cdnh-84, r-ccops-86, r-ccscp-86, rit-cscsl-86, rt-rplbo-86, t-prgc-80, t-cgm-86, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{r-cfsvd-89
, author =	"D. Rappaport"
, title =	"Computing the furthest-site {Voronoi} diagram for a set of discs"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"57--66"
}

@techreport{r-mptls-92
, author =	"D. Rappaport"
, title =	"Minimum Polygon Transversals of Line segments"
, number =	"CISC-92-333"
, institution =	"Queen's University"
, year =	1992
, precedes =	"r-mptls-95"
, update =	"98.11 bibrelex"
}

@article{r-mptls-95
, author =	"D. Rappaport"
, title =	"Minimum polygon transversals of line segments"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	5
, year =	1995
, pages =	"243--256"
, keywords =	"computational geometry, transversal, simple polygon, convex hull"
, succeeds =	"r-mptls-92"
, update =	"98.11 bibrelex, 96.09 devillers"
}

@techreport{r-ccops-86
, author =	"D. Rappaport"
, title =	"On the complexity of computing orthogonal polygons from a set of points"
, type =	"Technical {Report}"
, number =	"TR-SOCS-86.9"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1986
, update =	"98.03 bibrelex"
}

@proceedings{r-p9ccc-97
, title =	"Proc. 9th Canad. Conf. Comput. Geom."
, editor =	"David Rappaport"
, publisher =	"Dept. Comput. Info. Sci., Queen's Univ."
, address =	"Kingston, ON"
, month =	aug
, year =	1997
, url =	"http://www.qucis.queensu.ca/cccg97"
, comments =	"electronic proceedings online; paper copies C\$20 plus postage, order form on website"
, update =	"97.11 jones"
}

@phdthesis{r-ccscp-86
, author =	"D. Rappaport"
, title =	"The complexity of computing simple circuits in the plane"
, type =	"Ph.{D}. Thesis"
, school =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1986
, keywords =	"complexity theory, design of algorithms, operations research, worst-case analysis, NP-completeness, points, line segments, polygons, polygonal chains, doctoral thesis"
}

@article{rit-cscsl-90
, author =	"D. Rappaport and H. Imai and G. T. Toussaint"
, title =	"Computing simple circuits from a set of line segments"
, journal =	"Discrete Comput. Geom."
, volume =	5
, number =	3
, year =	1990
, pages =	"289--304"
, succeeds =	"rit-cscsl-86"
, update =	"98.11 bibrelex"
}

@inproceedings{rit-cscsl-86
, author =	"D. Rappaport and H. Imai and G. T. Toussaint"
, title =	"On computing simple circuits on a set of line segments"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"52--60"
, precedes =	"rit-cscsl-90"
, cites =	"bo-arcgi-79, g-eadch-72, hk-nammb-73, r-cscsl-86, sh-gip-76, t-hnchf-85, ZZZ"
, update =	"97.11 bibrelex"
}

@article{rr-mcp-94
, author =	"D. Rappaport and A. Rosenbloom"
, title =	"Moldable and castable polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"219--233"
, succeeds =	"rr-mcp-92"
, update =	"96.09 devillers"
}

@techreport{rt-slhla-83
, author =	"D. Rappaport and G. T. Toussaint"
, title =	"A Simple Linear Hidden-Line Algorithm for Star-Shaped Polygones"
, type =	"Technical {Report}"
, number =	"SOCS-83.23"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{rt-slhla-85
, author =	"D. Rappaport and G. T. Toussaint"
, title =	"A simple linear hidden-line algorithm for star-shaped polygons"
, journal =	"Pattern Recogn. Lett."
, volume =	3
, year =	1985
, pages =	"35--39"
, keywords =	"design of algorithms, visibility, star-shaped"
}

@article{r-eaccd-92
, author =	"A. Rappoport"
, title =	"An Efficient Algorithm for Constructing the Convex Differences Tree of a Simple Polygon"
, journal =	"Comput. Graph. Forum"
, volume =	11
, number =	4
, month =	oct
, year =	1992
, pages =	"235--240"
, update =	"93.09 held"
}

@article{r-ealpc-91
, author =	"A. Rappoport"
, title =	"An Efficient Algorithm for Line and Polygon Clipping"
, journal =	"Visual Comput."
, volume =	7
, number =	1
, month =	jan
, year =	1991
, pages =	"19--28"
, update =	"93.09 held"
}

@article{r-ecdte-91
, author =	"A. Rappoport"
, title =	"The extended convex difference tree ({ECDT}) representation for {$N$}-dimensional polyhedra"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	3
, year =	1991
, pages =	"227--241"
, keywords =	"$n$-dimensional polyhedra, constructive solid geometry, CSG, convexity, boolean operations, geometric data structures, convex difference tree, CDT"
}

@inproceedings{r-ucdhr-90
, author =	"Ari Rappoport"
, title =	"Using Convex Differences for Hierarchical Representations of Polygonal Maps"
, booktitle =	"Proc. Graphics Interface'90"
, site =	"Halifax, Canada"
, month =	may
, year =	1990
, pages =	"183--189"
, update =	"98.03 mitchell"
}

@incollection{rfnw-3ddpm-93
, author =	"Norel Raquel and Daniel Fischer and Ruth Nussinov and Haim J. Wolfson"
, title =	"3-D Docking of Protein Molecules"
, booktitle =	"Combinatorial Pattern Matching"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, institution =	"Tel Aviv University"
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@techreport{r-gapzc-??
, author =	"R. Rasala"
, title =	"Geometric aspects of the polaroid {Zip} {Code} based mapping system"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@phdthesis{r-aiv-94
, author =	"R. Rasch"
, title =	"Abstrakte inverse {Voronoidiagramme}"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"95.01 smid"
}

@book{r-ra-85
, author =	"?? Rathmill"
, title =	"Robotics Assembly"
, publisher =	"Springer-Verlag"
, year =	1985
, update =	"98.03 bibrelex"
}

@unpublished{rr-dess-95
, author =	"H. Ratschek and J. Rokne"
, title =	"Determination of the exact sign of a sum"
, address =	"Dept. of Computer Science, Univ. of Calgary, Canada"
, year =	1995
, note =	"Unpublished manuscript"
, update =	"00.11 smid, 00.07 smid, 96.05 devillers"
}

@article{rr-eochd-00
, author =	"H. Ratschek and J. Rokne"
, title =	"Exact and optimal convex hulls in 2{D}"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	10
, year =	2000
, pages =	"109--129"
, update =	"00.11 smid, 00.07 smid"
}

@article{rpib-cppcs1-80
, author =	"V. G. Rau and L. G. Parkomov and V. V. Ilyukhin and N. V. Belov"
, title =	"On the calculation of possible {Patterson} cyclotomic sets, I"
, journal =	"Doklady Akad. Nauk SSSR"
, volume =	255
, number =	4
, year =	1980
, pages =	"858--861"
, precedes =	"rpib-cppcs2-80"
, update =	"97.11 bibrelex"
}

@article{rpib-cppcs2-80
, author =	"V. G. Rau and L. G. Parkomov and V. V. Ilyukhin and N. V. Belov"
, title =	"On the calculation of possible {Patterson} cyclotomic sets, II"
, journal =	"Doklady Akad. Nauk SSSR"
, volume =	255
, number =	5
, year =	1980
, pages =	"1110--1113"
, succeeds =	"rpib-cppcs1-80"
, update =	"97.11 bibrelex"
}

@inproceedings{r-fdbg-92
, author =	"M. Rauch"
, title =	"Fully Dynamic Biconnectivity in Graphs"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"50--59"
, update =	"00.03 vismara, 99.07 vismara, 94.01 tamassia"
}

@inproceedings{r-idsfd-94
, author =	"M. Rauch"
, title =	"Improved Data Structures for Fully Dynamic Biconnectivity"
, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"686--695"
, update =	"95.05 tamassia"
}

@techreport{rws-cmcs-96
, author =	"Thomas Rausch and Franz-Erich Wolter and Oliver Sniehotta"
, title =	"Computation of Medial Curves on Surfaces"
, number =	1
, institution =	"Welfen Laboratory, Universit{\"a}t Hannover"
, month =	aug
, year =	1996
, url =	"http://www-c.informatik.uni-hannover.de"
, keywords =	"CAD, geometric modeling, equidistantial set, medial curve, cut locus, focal curves, geodesics on surfaces, medial axis, offsets"
, update =	"98.03 mitchell"
, annote =	"To appear, IMA Conference Proceedings Series of the 7th
                  IMA Conference on The Mathematics of Surfaces"
}

@inproceedings{rsmrr-stss-94
, author =	"R. Ravi and R. Sundaram and M. V. Marathe and D. J. Rosenkrantz and S. S. Ravi"
, title =	"Spanning trees short and small"
, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1994
, pages =	"546--555"
, update =	"96.09 agarwal, 95.09 mitchell"
}

@inproceedings{rrt-fdphs-91
, author =	"S. S. Ravi and D. J. Rosenkrantz and G. K. Tayi"
, title =	"Facility Dispersion Problems: {Heuristics} and Special Cases"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"355--366"
, update =	"93.09 milone+mitchell"
}

@techreport{rw-rocs-89
, author =	"G. Rawlings and D. Wood"
, title =	"Restricted-oriented convex sets"
, type =	"Technical {Report}"
, number =	"CS-89-01"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, year =	1989
, update =	"98.07 bibrelex"
}

@phdthesis{r-erog-87
, author =	"G. J. E. Rawlins"
, title =	"Explorations in restricted-orientation geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1987
, keywords =	"doctoral thesis"
}

@inproceedings{rbc-su-88
, author =	"G. J. E. Rawlins and R. Baeza-Yates and J. C. Culberson"
, title =	"Searching with uncertainty"
, editor =	"R. Karlsson and A. Lingas"
, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	318
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"176--189"
}

@techreport{ro-cldph-88
, author =	"G. J. E. Rawlins and M. Overmars"
, title =	"Computing the link diameter of a polygon with holes"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1988
, comments =	"Neither author has any recollection (as of May 1998) of
                  this paper ever existing or what it was about.  We
                  can probably remove it from the bib file. (Comment
                  added by Joe Mitchell, after conferring with both
                  authors by email.)"
, update =	"98.07 mitchell, 94.05 devillers+schwarzkopf"
}

@article{rww-hprp-88
, author =	"G. J. E. Rawlins and P. Widmayer and D. Wood"
, title =	"Hole problems for rectangles in the plane"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	1
, year =	1988
, pages =	"86--97"
}

@article{rw-dtcs-89
, author =	"G. J. E. Rawlins and D. Wood"
, title =	"A decomposition theorem for convexity spaces"
, journal =	"J. Geom."
, volume =	36
, year =	1989
, pages =	"143--159"
}

@inproceedings{rw-cgro-88
, author =	"G. J. E. Rawlins and D. Wood"
, title =	"Computational geometry with restricted orientations"
, booktitle =	"Proc. 13th IFIP Conf. System Modelling and Optimization"
, series =	"Lecture Notes in Control and Information Science"
, volume =	113
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"375--384"
}

@techreport{rw-gmsnv-88
, author =	"G. J. E. Rawlins and D. Wood"
, title =	"Guards with monotone sight: a new version of the art gallery theorem"
, type =	"Report"
, number =	"??"
, institution =	"Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1988
}

@article{rw-ocfoc-87
, author =	"G. J. E. Rawlins and D. Wood"
, title =	"Optimal computation of finitely oriented convex hulls"
, journal =	"Inform. Comput."
, volume =	72
, year =	1987
, pages =	"150--166"
}

@incollection{rw-ocig-88
, author =	"G. J. E. Rawlins and D. Wood"
, title =	"Ortho-convexity and its generalizations"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"137--152"
}

@techreport{rw-roc-86
, author =	"G. J. E. Rawlins and D. Wood"
, title =	"Restricted-orientation convexity"
, type =	"Technical {Report}"
, number =	"86-36"
, institution =	"Univ. Waterloo"
, address =	"Waterloo, ON"
, year =	1986
}

@article{rw-rocs-91
, author =	"G. J. E. Rawlins and D. Wood"
, title =	"Restricted-Oriented Convex Sets"
, journal =	"Inform. Sci."
, volume =	54
, year =	1991
, pages =	"263--281"
}

@article{rr-napa-91
, author =	"B. Ray and K. Ray"
, title =	"A new approach to polygonal approximation"
, journal =	"Pattern Recogn. Lett."
, volume =	12
, year =	1991
, pages =	"229--234"
, update =	"93.09 milone+mitchell"
}

@article{r-slcdn-70
, author =	"H. Raynaud"
, title =	"Sur l'enveloppe convex des nuages de points aleatoires dans {$R^{n}$}"
, journal =	"J. Appl. Probab."
, volume =	7
, year =	1970
, pages =	"35--48"
}

@article{rc-fsv-86
, author =	"V. J. Rayward-Smith and A. Clare"
, title =	"On finding {Steiner} vertices"
, journal =	"Networks"
, volume =	16
, year =	1986
, pages =	"283--294"
}

@techreport{r-mcdmg-86
, author =	"R. Read"
, title =	"Methods for Computer Display and Manipulation of Graphs and the Corresponding Algorithms"
, number =	"86-12"
, institution =	"Faculty of Mathematics, Univ. of Waterloo"
, month =	jul
, year =	1986
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{r-nmdpg-87
, author =	"R. Read"
, title =	"New Methods for Drawing a Planar Graph Given the Cyclic Order of the Edges at Each Vertex"
, journal =	"Congr. Numer."
, volume =	56
, year =	1987
, pages =	"31--44"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@phdthesis{r-??-60
, author =	"D. F. Rearick"
, title =	"??"
, school =	"California Inst. Tech."
, year =	1960
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@article{r-ert-68
, author =	"J. Reay"
, title =	"An extension of Radon's theorem"
, journal =	"Illinois J. Math."
, volume =	12
, year =	1968
, pages =	"184--189"
, update =	"98.03 bibrelex"
}

@inproceedings{r-hrpcc-97
, author =	"Fran{\c c}ois Rebufat"
, title =	"Handling Rotations in the Placement of Curved Convex Polygons"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"87--92"
, update =	"00.03 bibrelex, 97.11 jones"
}

@techreport{r-cocpt-87
, author =	"R. Reckhow"
, title =	"Covering Orthogonally Convex Polygons with Three Orientations of Dents"
, type =	"Technical {Report}"
, number =	"87-17"
, institution =	"Dept. Comput. Sci., Univ. Alberta"
, address =	"Edmonton, Alberta, Canada"
, month =	aug
, year =	1987
, update =	"98.03 bibrelex"
}

@inproceedings{rc-csopm-87
, author =	"R. A. Reckhow and J. Culberson"
, title =	"Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"268--277"
, precedes =	"cr-occop-89a"
, cites =	"a-agpiv-84, fk-acrri-84, k-mchco-86, m-snpcs-79, os-snhpd-83, rw-roc-86, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 bibrelex"
}

@techreport{rr-rtdo-78
, author =	"D. R. Reddy and S. M. Rubin"
, title =	"Representation of three-dimensional objects"
, type =	"Report"
, number =	"CMU-CS-78-113"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1978
}

@article{rt-c3dsu-95
, author =	"Jayachandra Reddy and George Turkiyyah"
, title =	"Computation of {3D} Skeletons Using a Generalized {Delaunay} Triangulation Technique"
, journal =	"Comput. Aided Design"
, volume =	27
, number =	9
, year =	1995
, pages =	"677--694"
, update =	"98.07 mitchell"
}

@article{r-pdpr-96
, author =	"M. Reddy"
, title =	"Perceptually-Driven Polygon Reduction"
, journal =	"Comput. Graph. Forum"
, volume =	15
, number =	4
, month =	oct
, year =	1996
, pages =	"191--203"
, update =	"97.03 held"
}

@article{r-slpsd-46
, author =	"G. Reeb"
, title =	"Sur les points singuliers d'une forme de pfaff complement integrable ou d'une fonction numerique"
, journal =	"Comptes Rendus Acad. Sciences Paris"
, volume =	222
, year =	1946
, pages =	"847--849"
, update =	"98.07 bibrelex"
}

@article{rs-opctg-90
, author =	"J. A. Reeds and L. A. Shepp"
, title =	"Optimal paths for a car that goes both forwards and backwards"
, journal =	"Pacific Journal of Mathematics"
, volume =	145
, number =	2
, year =	1990
}

@article{rsfl-sudp-91
, author =	"J. A. Reeds and L. A. Shepp and P. C. Fishburn and J. C. Lagarias"
, title =	"Sets uniquely determined by projections"
, journal =	"Discrete Math."
, volume =	91
, year =	1991
, update =	"98.11 bibrelex"
}

@book{r-ng-83
, author =	"E. G. Rees"
, title =	"Notes on Geometry"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1983
, update =	"97.11 bibrelex"
}

@techreport{ram-tm-84
, author =	"J. A. Rees and N. I. Adams and J. R. Meehan"
, title =	"The {T} manual"
, institution =	"Dept. Comput. Sci., Yale Univ."
, address =	"New Haven, CT"
, year =	1984
, update =	"98.03 bibrelex"
}

@article{r-pstmc-83
, author =	"W. T. Reeves"
, title =	"Particle systems - a technique for modeling a class of fuzzy objects"
, journal =	"ACM Trans. Graph."
, volume =	2
, number =	2
, month =	apr
, year =	1983
, pages =	"91--108"
, update =	"98.07 bibrelex"
}

@techreport{r-cpagt-95t
, author =	"A. Rege"
, title =	"A complete and practical algorithm for geometric theorem proving"
, type =	"Technical {Report}"
, institution =	"Univ. California"
, address =	"Berkeley, CA"
, year =	1995
, update =	"98.03 bibrelex"
}

@inproceedings{r-cpagt-95
, author =	"Ashutosh Rege"
, title =	"A Complete and Practical Algorithm for Geometric Theorem Proving"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"277--286"
, keywords =	""
, cites =	"c-crsas-91, c-isda-91, c-pegtu-84, c-mgtp-88, clo-iva-92, gm-eabwr-91, g-rgtpm-63, k-gtpuh-86, k-ragtp-89, ks-abaag-86, r-cpagt-95t, rc-slprf-95, rc-tag-95, r-ccgfo-89, r-deas-32, r-da-50, w-dpmtp-78, w-sramt-84, z-epc-93, ZZZ"
, update =	"99.11 bibrelex, 98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{rc-tag-95
, author =	"A. Rege and J. Canny"
, title =	"A toolkit for algebra and geometry"
, booktitle =	"Proc. ACM Sympos. Symbolic and Algebraic Computation"
, site =	"Montreal"
, year =	1995
, note =	"Submitted"
, update =	"98.03 bibrelex"
}

@article{rc-slprf-95
, author =	"A. Rege and J. Canny"
, title =	"Straight-line programs for real field extensions and perturbations"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"??"
, year =	1995
, note =	"Submitted"
, update =	"98.03 bibrelex"
}

@article{rm-pmrh-88
, author =	"M. G. Reggiani and F. E. Marchetti"
, title =	"A Proposed Method for Representing Hierarchies"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	18
, number =	1
, year =	1988
, pages =	"2--8"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{rw-bspvo-89
, author =	"Gabriele Reich and Peter Widmayer"
, title =	"Beyond {Steiner's} problem: {A} {VLSI} oriented generalization"
, booktitle =	"Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	411
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"196--210"
, update =	"99.11 bibrelex, 98.11 smid, 98.03 mitchell, 95.01 mitchell"
}

@article{r-dcikc-88a
, author =	"M. Reichling"
, title =	"On the detection of a common intersection of $k$ convex objects in the plane"
, journal =	"Inform. Process. Lett."
, volume =	29
, year =	1988
, pages =	"25--29"
, update =	"98.07 bibrelex, 96.05 agarwal"
}

@inproceedings{r-dcikc-88i
, author =	"M. Reichling"
, title =	"On the detection of a common intersection of $k$ convex polyhedra"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"180--186"
, update =	"00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@article{r-pfcrp-
, author =	"M. Reid"
, title =	"Potential field computation for robotic path planning using a microchannel SLM"
, journal =	"??"
, institution =	"NASA AMES Research Center"
, pages =	"188--191"
, update =	"93.09 milone+mitchell"
}

@incollection{rmm-lrptc-93
, author =	"M. Reid-Miller and G. L. Miller and F. Modugno"
, title =	"List Ranking and Parallel Tree Contraction"
, editor =	"J. H. Reif"
, booktitle =	"Synthesis of Parallel Algorithms"
, publisher =	"Morgan Kaufmann Publishers, Inc."
, address =	"San Mateo, CA"
, year =	1993
, pages =	"115--194"
, update =	"96.09 orourke"
}

@techreport{rs-mppmo-85t
, author =	"J. Reif and M. Sharir"
, title =	"Motion planning in the presence of moving obstacles"
, type =	"Manuscript"
, institution =	"??"
, year =	1985
, update =	"98.07 bibrelex"
}

@article{rs-mppmo-94
, author =	"John Reif and Micha Sharir"
, title =	"Motion Planning in the Presence of Moving Obstacles"
, journal =	"J. ACM"
, volume =	41
, number =	4
, month =	jul
, year =	1994
, pages =	"764--790"
, succeeds =	"rs-mppmo-85"
, update =	"98.03 mitchell"
}

@techreport{rs-mtdmi-85
, author =	"J. Reif and J. Storer"
, title =	"Minimizing turns for discrete movement in the interior of a polygon"
, type =	"Technical {Report}"
, institution =	"Harvard Univ.,"
, address =	"Cambridge, MA"
, month =	dec
, year =	1985
, update =	"98.03 bibrelex"
}

@techreport{rt-akpul-89
, author =	"J. Reif and S. Tate"
, title =	"Approximate kinodynamic planning using ${L}_{2}$ norm dynamic bounds"
, type =	"Technical {Report}"
, institution =	"Duke Univ."
, address =	"Durham, NC"
, year =	1989
, precedes =	"rt-akpul-94"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@incollection{rt-epaoc-90
, author =	"J. Reif and A. Tyagi"
, title =	"Efficient parallel algorithms for optical computing with the {DFT} primitive"
, booktitle =	"Proc. 10th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	472
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"149--160"
, update =	"97.11 bibrelex"
}

@article{rty-ccrt-94
, author =	"J. Reif and J. Tygar and A. Yoshida"
, title =	"Computability and complexity of ray tracing"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"265--288"
, succeeds =	"rty-ccobt-90"
, update =	"97.11 bibrelex, 95.01 matousek"
}

@inproceedings{rw-nudkm-96
, author =	"John Reif and Hongyan Wang"
, title =	"Non-Uniform Discretization for Kinodynamic Motion Planning and its Applications"
, editor =	"Jean-Paul Laumond and Mark Overmars"
, booktitle =	"Algorithms for Robotic Motion and Manipulation"
, nickname =	"WAFR '96"
, publisher =	"A.K. Peters"
, address =	"Wellesley, MA"
, year =	1997
, pages =	"97--112"
, note =	"Proc. 1996 Workshop on the Algorithmic Foundations of
                  Robotics, Toulouse, France, July 1996"
, update =	"98.07 agarwal, 98.03 mitchell"
}

@inproceedings{rw-ctdcc-98
, author =	"John Reif and Hongyan Wang"
, title =	"The Complexity of the Two Dimensional Curvature-Constrained Shortest-Path Problem"
, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
, nickname =	"WAFR '98"
, year =	1998
, pages =	"to appear"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@article{r-tadgc-87
, author =	"J. H. Reif"
, title =	"A Topological Approach to Dynamic Graph Connectivity"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"65--70"
, update =	"94.01 tamassia"
}

@inproceedings{r-opais-85
, author =	"J. H. Reif"
, title =	"An optimal parallel algorithm for integer sorting"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"496--504"
}

@incollection{r-cgmp-87
, author =	"J. H. Reif"
, title =	"Complexity of the generalized movers problem"
, editor =	"J. Hopcroft and J. Schwartz and Micha Sharir"
, booktitle =	"Planning, Geometry and Complexity of Robot Motion"
, publisher =	"Ablex Publishing"
, address =	"Norwood, NJ"
, year =	1987
, pages =	"267--281"
, succeeds =	"r-cmpg-79"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{r-cmpg-79
, author =	"J. H. Reif"
, title =	"Complexity of the mover's problem and generalizations"
, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1979
, pages =	"421--427"
, precedes =	"r-cgmp-87"
}

@book{r-spa-93
, author =	"J. H. Reif"
, title =	"Synthesis of Parallel Algorithms"
, publisher =	"Morgan Kaufmann Publishers, Inc."
, address =	"San Mateo, CA"
, year =	1993
, update =	"96.09 orourke"
}

@techreport{rs-eoshs-88t
, author =	"J. H. Reif and S. Sen"
, title =	"An Efficient Output-Sensitive Hidden-Surface Removal Algorithm and Its Parallelization"
, number =	""
, institution =	"CS Dept., Duke U."
, address =	"Durham, NC 27706, USA"
, year =	1988
, update =	"93.09 held"
}

@inproceedings{rs-eoshs-88i
, author =	"J. H. Reif and S. Sen"
, title =	"An efficient output-sensitive hidden-surface removal algorithms and its parallelization"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"193--200"
, cites =	"cg-vippg-85, mn-dfc-86, cs-vppt-86, m-ss-84, m-mdscg-84, ps-cgi-85, c-tpca-82, m-wcohs-86, w-tsshl-83, lp-lppsi-77, p-ortap-79, cd-icott-87, m-awcdt-81, n-flsah-85, s-tsbhl-81, g-pahle-87, acg-cdctd-87, sss-cthsa-74, ZZZ"
, update =	"98.03 bibrelex"
}

@techreport{rs-opacg-88
, author =	"J. H. Reif and S. Sen"
, title =	"Optimal parallel algorithms for computational geometry"
, type =	"Report"
, number =	"CS-1988-1"
, institution =	"Dept. Comput. Sci., Duke Univ."
, address =	"Durham, NC"
, year =	1988
}

@article{rs-oprat-92
, author =	"J. H. Reif and S. Sen"
, title =	"Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems"
, journal =	"SIAM J. Comput."
, volume =	21
, year =	1992
, pages =	"466--485"
, update =	"96.09 orourke"
}

@inproceedings{rs-orpac-87
, author =	"John H. Reif and Sandeep Sen"
, title =	"Optimal Randomized Parallel Algorithms For Computational Geometry"
, booktitle =	"Proc. 1987 Internat. Conf. Parallel Process."
, publisher =	"Pennsylvania State Univ Press"
, address =	"University Park, PA"
, year =	1987
, pages =	"270--277"
, keywords =	"randomized parallel algorithms, computational geometry, concurrent-read exclusive write, parallel random-access machines"
, annote =	"Including polygon triangulation."
, abstract =	"The authors present parallel algorithms for some
		 fundamental problems in computational geometry which
		 have optimal running time with very high probability
		 (approaching 1 as n yields infinity). These include
		 planar point location, triangulation, trapezoidal
		 decomposition, 3-D maxima, two- set dominance counting,
		 and range-counting, among others. Most of these
		 algorithms run on the CREW PRAM model with O(n)
		 processors and execute in O(log n) time. Most of these
		 algorithms use a novel data structure called the nested
		 plane sweep tree. Random splitting is used very
		 effectively to divide and conquer on the plane, raising
		 the possibility of extending this technique to higher
		 dimensions. 20 refs."
}

@article{rs-orpac-92
, author =	"John H. Reif and Sandeep Sen"
, title =	"Optimal Randomized Parallel Algorithms For Computational Geometry"
, journal =	"Algorithmica"
, volume =	7
, number =	1
, year =	1992
, pages =	"91--117"
, keywords =	"randomized algorithms, parallel algorithms, crew pram, computational geometry"
, update =	"93.09 rote"
, abstract =	"We present parallel algorithms for some fundamental
		 problems in computational geometry which have a running
		 time of O(log n) using n processors, with very high
		 probability (approaching 1 as n yields infinity ).
		 These include planar-point location, triangulation, and
		 trapezoidal decomposition. We also present optimal
		 algorithms for three-dimensional maxima and two-set
		 dominance counting by an application of integer
		 sorting. Most of these algorithms run on a CREW PRAM
		 model and have optimal processor-time product which
		 improve on the previously best-known algorithms of
		 Atallah and Goodrich [5] for these problems. The crux
		 of these algorithms is a useful data structure which
		 emulates the plane- sweeping paradigm used for
		 sequential algorithms. We extend some of the techniques
		 used by Reischuk [26] and Reif and Valiant [25] for
		 flashsort algorithm to perform divide and conquer in a
		 plane very efficiently leading to the improved
		 performance by our approach. (Author abstract) 28
		 Refs."
}

@incollection{rs-pcgau-00
, author =	"John H. Reif and Sandeep Sen"
, title =	"Parallel Computational Geometry: {An} Approach Using Randomization"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"765--828"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 18 of su-hcg-00"
}

@inproceedings{rs-pnrst-89
, author =	"J. H. Reif and S. Sen"
, title =	"Polling: a new randomized sampling technique for computational geometry"
, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
, year =	1989
, pages =	"394--404"
, comments =	"To appear in SIAM J. Comput. as Optimal parallel
		 algorithms for {3D} convex hulls and related problems"
, update =	"94.01 smid"
}

@inproceedings{rs-rabsl-90
, author =	"J. H. Reif and S. Sen"
, title =	"Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications"
, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"327--337"
, update =	"96.09 orourke"
}

@article{rs-rabsl-94
, author =	"J. H. Reif and S. Sen"
, title =	"Randomized algorithms for binary search and Load Balancing on fixed connection networks with Geometric Applications"
, journal =	"SIAM J. Comput."
, volume =	23
, number =	3
, year =	1994
, pages =	"633--651"
, update =	"97.11 bibrelex"
}

@inproceedings{rs-mppmo-85
, author =	"J. H. Reif and Micha Sharir"
, title =	"Motion planning in the presence of moving obstacles"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"144--154"
, keywords =	"motion planning, lower bounds, algebraic geometry"
, precedes =	"rs-mppmo-94"
, update =	"98.03 mitchell"
}

@inproceedings{rs-dsppp-88
, author =	"J. H. Reif and J. A. Storer"
, title =	"3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles"
, booktitle =	"Proc. 13th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	"3:24"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"85--92"
, succeeds =	"rs-spesp-85"
, update =	"95.01 mitchell"
}

@techreport{rs-seubf-??
, author =	"J. H. Reif and J. A. Storer"
, title =	"A single-exponential upper bound for finding shortest paths in three dimensions"
, type =	"Technical {Report}"
, year =	"??"
, comments =	"To appear, JACM. The original report was broken into two papers."
, succeeds =	"rs-spesp-85"
, update =	"93.09 milone+mitchell"
}

@article{rs-seubf-94
, author =	"J. H. Reif and J. A. Storer"
, title =	"A single-exponential upper bound for finding shortest paths in three dimensions"
, journal =	"J. ACM"
, volume =	41
, number =	5
, year =	1994
, pages =	"1013--1019"
, succeeds =	"rs-spesp-85"
, update =	"95.05 mitchell"
}

@article{rs-mtdmi-87
, author =	"J. H. Reif and J. A. Storer"
, title =	"Minimizing turns for discrete movement in the interior of a polygon"
, journal =	"Internat. J. Robot. Autom."
, volume =	"??"
, year =	1987
, pages =	"182--193"
}

@techreport{rs-spesp-85
, author =	"J. H. Reif and J. A. Storer"
, title =	"Shortest paths in {Euclidean} spaces with polyhedral obstacles"
, type =	"Report"
, number =	"CS-85-121"
, institution =	"Dept. Comput. Sci., Brandeis Univ."
, address =	"Waltham, MA"
, year =	1985
, precedes =	"rs-dsppp-88"
, update =	"95.01 mitchell"
}

@article{rt-akpul-94
, author =	"John H. Reif and Stephen R. Tate"
, title =	"Approximate Kinodynamic Planning Using {$L_2$}-Norm Dynamic Bounds"
, journal =	"Comput. Math. Appl."
, volume =	27
, number =	5
, year =	1994
, pages =	"29--44"
, succeeds =	"rt-akpul-89"
, update =	"98.03 mitchell"
}

@inproceedings{rty-ccobt-90
, author =	"J. H. Reif and J. D. Tyger and A. Yoshida"
, title =	"The computability and complexity of optical beam tracing"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"106--115"
, keywords =	"ray tracing, complexity theory"
}

@article{rv-ltsls-87
, author =	"J. H. Reif and L. G. Valiant"
, title =	"A logarithmic time sort for linear size networks"
, journal =	"J. ACM"
, volume =	34
, number =	1
, year =	1987
, pages =	"60--76"
, update =	"98.03 bibrelex"
}

@techreport{rw-olntr-93
, author =	"J. H. Reif and H. Wang"
, title =	"On-Line Navigation Through Weighted Regions"
, type =	"Technical Report"
, institution =	"Dept. Computer Science, Duke University"
, year =	1993
, comments =	"Presented at the fall workshop, October 1993.
Previous title:  On-Line Navigation Through Regions of Variable
                  Densities"
, update =	"98.03 mitchell"
}

@article{r-fhlgt-92
, author =	"G. Reinelt"
, title =	"Fast heuristics for large geometric traveling salesman problems"
, journal =	"ORSA J. Comput."
, volume =	4
, year =	1992
, pages =	"206--217"
, update =	"94.09 bernal"
}

@inproceedings{rbbcfklr-ddewp-84
, author =	"D. Reiner and M. Brodie and G. Brown and M. Chilenskas and M. Friedell and D. Kramlich and J. Lehman and A. Rosenthal"
, title =	"A Database Design and Evaluation Workbench: Preliminary Report"
, booktitle =	"Proc. Internat. Conf. on Systems Development and Requirements Specification"
, year =	1984
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@misc{rb-hlded-85
, author =	"D. Reiner and G. Brown"
, title =	"Heuristic Layout for {DDEW} {ER}+ Diagrams"
, institution =	"Computer Corporation of America"
, year =	1985
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{rbflmrr-ddw-87
, author =	"D. Reiner and G. Brown and M. Friedell and J. Lehman and R. McKee and P. Rheingans and A. Rosenthal"
, title =	"A Database Designer's Workbench"
, editor =	"S. Spaccapietra"
, booktitle =	"Entity-Relationship Approach: Proc. 5th Internat. Conf. on Entity-Relationship Approach (Dijon France 1987)"
, publisher =	"North-Holland"
, address =	"New York, NY"
, year =	1987
, pages =	"347--360"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{rt-tdt-81
, author =	"E. Reingold and J. Tilford"
, title =	"Tidier Drawing of Trees"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-7"
, number =	2
, year =	1981
, pages =	"223--228"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{r-ossa-72
, author =	"E. M. Reingold"
, title =	"On the optimality of some set algorithms"
, journal =	"J. ACM"
, volume =	19
, year =	1972
, pages =	"649--659"
}

@book{rnd-catp-77
, author =	"E. M. Reingold and J. Nievergelt and N. Deo"
, title =	"Combinatorial Algorithms: Theory and Practice"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1977
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{rs-padch-83
, author =	"E. M. Reingold and K. J. Supowit"
, title =	"Probabilistic analysis of divide-and-conquer heuristics for minimum weighted {Euclidean} matching"
, journal =	"Networks"
, volume =	13
, year =	1983
, pages =	"49--66"
, keywords =	"matchings, average-case analysis, divide-and-conquer"
}

@article{rt-ghcm-81
, author =	"E. M. Reingold and R. E. Tarjan"
, title =	"On a greedy heuristic for complete matching"
, journal =	"SIAM J. Comput."
, volume =	10
, year =	1981
, pages =	"676--681"
}

@article{r-ppass-85
, author =	"R. Reischuk"
, title =	"Probabilistic parallel algorithms for sorting and selection"
, journal =	"SIAM J. Comput."
, volume =	14
, number =	2
, month =	may
, year =	1985
, pages =	"396--409"
, update =	"98.11 bibrelex"
}

@inproceedings{r-3dvpi-95
, author =	"S. P. Reiss"
, title =	"{3-D} Visualization of Program Information"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"12--24"
, keywords =	"graph drawing, 3D"
, update =	"95.01 tamassia"
}

@inproceedings{r-cpe-87
, author =	"Steven P. Reiss"
, title =	"A Conceptual Programming Environment"
, booktitle =	"Proc. 9th Intl. Conf. on Software Engineering"
, year =	1987
, update =	"97.03 tamassia"
}

@inproceedings{r-fa3v-93
, author =	"S. P. Reiss"
, title =	"A Framework for Abstract 3D Visualization"
, booktitle =	"Proc. IEEE Sympos. on Visual Languages"
, nickname =	"VL '93"
, year =	1993
, keywords =	"graph drawing"
, update =	"95.09 agarwal, 95.01 tamassia"
}

@unpublished{r-rvfpe-94
, author =	"Steven P. Reiss"
, title =	"A retrospective view of the {FIELD} programming environment"
, year =	1994
, note =	"Brown {University}, submitted for publication"
, update =	"97.03 tamassia"
}

@article{r-e3vpi-95
, author =	"S. P. Reiss"
, title =	"An Engine for the {3D} Visualization of Program Information"
, journal =	"J. Visual Lang. Comput."
, volume =	6
, number =	3
, year =	1995
, pages =	"299--323"
, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
, keywords =	"graph drawing, 3D, system, software visualization"
, succeeds =	"r-3dvpi-95"
, update =	"98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
}

@book{r-ffiel-94
, author =	"Steven P. Reiss"
, title =	"{FIELD}: A Friendly Integrated Environment for Learning and Development"
, publisher =	"Kluwer"
, year =	1994
, update =	"97.03 tamassia"
}

@unpublished{r-fmlcd-95
, author =	"Steven P. Reiss"
, title =	"Fragments: {A} mechanism for low cost data integration"
, month =	may
, year =	1995
, note =	"Brown {U}. {Computer} {Science} {Tech} {Report}"
, update =	"97.03 tamassia"
}

@inproceedings{r-gtsgp-86
, author =	"Steven P. Reiss"
, title =	"{GARDEN} tools: support for graphical programming"
, booktitle =	"Proc. Workshop on Advanced Software Development Environments"
, year =	1986
, update =	"97.03 tamassia"
}

@techreport{r-imfe-88
, author =	"S. P. Reiss"
, title =	"Integration Mechanisms in the {FIELD} Environment"
, number =	"CS-88-18"
, institution =	"Department of Computer Science, Brown University"
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{r-pes3g-93
, author =	"Steven P. Reiss"
, title =	"Presentation and editing of structured 3-{D} graphics"
, journal =	"Proc. HCI '93"
, volume =	"??"
, month =	aug
, year =	1993
, update =	"97.03 tamassia"
}

@inproceedings{r-sdidd-96
, author =	"Steven P. Reiss"
, title =	"Simplifying data integration: the design of the {Desert} software development environment"
, booktitle =	"Proc. 18th Intl Conf on Software Engineering"
, year =	1996
, pages =	"398--407"
, update =	"97.03 tamassia"
}

@inproceedings{r-vlgs-86
, author =	"Steven P. Reiss"
, title =	"Visual Languages and the {GARDEN} system"
, booktitle =	"Proc. Intl. Workshop on Visual Aids To Programming"
, year =	1986
, update =	"97.03 tamassia"
}

@article{r-wgecp-87
, author =	"Steven P. Reiss"
, title =	"Working in the {GARDEN} Garden environment for conceptual programming"
, journal =	"IEEE Softw."
, volume =	4
, number =	6
, year =	1987
, pages =	"16--27"
, update =	"97.03 tamassia"
}

@article{rc-psv-94
, author =	"Steven P. Reiss and Isabel F. Cruz"
, title =	"Practical software visualization"
, journal =	"Proc. CHI Workshop on Program Visualization"
, volume =	"??"
, month =	apr
, year =	1994
, update =	"97.03 tamassia"
}

@inproceedings{rgr-pvlgs-86
, author =	"Steven P. Reiss and Eric J. Golin and Robert V. Rubin"
, title =	"Prototyping visual languages with the {GARDEN} system"
, booktitle =	"Proc. IEEE Symp. on Visual Languages"
, year =	1986
, update =	"97.03 tamassia"
}

@inproceedings{rmd-ugvss-89
, author =	"S. P. Reiss and S. Meyers and C. Duby"
, title =	"Using {GELO} to Visualize Software Systems"
, booktitle =	"Proc. UIST"
, year =	1989
, pages =	"149--157"
, keywords =	"graph drawing"
, update =	"95.05 tamassia"
}

@inproceedings{rp-dpds-87
, author =	"S. P. Reiss and J. N. Pato"
, title =	"Displaying Program and Data Structures"
, booktitle =	"Proc. 20th Hawaii Internat. Conf. on System Sciences"
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@unpublished{rs-gpauo-92
, author =	"Steven P. Reiss and Manojit Sarkar"
, title =	"Generating program abstractions using an object-oriented database"
, year =	1992
, note =	"Brown {University} {Department} of {Computer} {Science}"
, update =	"97.03 tamassia"
}

@article{rp-totmr-94
, author =	"D. B. Reister and F. G. Pin"
, title =	"Time-Optimal Trajectories for Mobile Robots with Two Independently Driven Wheels"
, journal =	"Internat. J. Robot. Res."
, volume =	13
, year =	1994
, pages =	"38--54"
, update =	"98.03 mitchell"
, annote =	"related to \cite{ci-totrp-97}, but uses methods of optimal
                  control"
}

@article{rrs-eges-89
, author =	"R. Reiterman and V. R{\"o}del and E. {\v S}i{\v n}ajov{\'a}"
, title =	"Embeddings of graphs in {Euclidean} spaces"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"349--364"
}

@article{r-eap-88
, author =	"F. Rendl"
, title =	"On the {Euclidean} assignment problem"
, journal =	"J. Comput. Appl. Math."
, volume =	23
, year =	1988
, pages =	"257--265"
, keywords =	"optimization, expected-case analysis"
, comments =	"replaces the techreport r-eap-87"
, update =	"93.09 rote"
, annote =	"linear-time heuristic for the MAXIMUM bipartite matching
		 between two sets of $n$ points in the unit square with
		 an abolute error of $O(n^{5/6})$. For uniformly distributed
		 points, the $z$ of the value of the maximum matching
		 satisfies $\lim_{n\to\infty} = (\sqrt{3}+\log(1+\sqrt{2}))/3$
		 almost surely."
}

@techreport{rw-rsols-90
, author =	"F. Rendl and G. Woeginger"
, title =	"Reconstructing sets of orthogonal line segments in the plane"
, institution =	"Tecnische Univ. Graz"
, address =	"Graz, Austria"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{r-fpade-88
, author =	"J. Renegar"
, title =	"A faster {PSPACE} algorithm for deciding the existential theory of the reals"
, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1988
, pages =	"291--295"
, update =	"97.11 bibrelex"
}

@techreport{r-ccgfo-89
, author =	"J. Renegar"
, title =	"On the computational complexity and geometry of the first order theory of the reals"
, type =	"Technical {Report}"
, number =	853
, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
, address =	"Ithaca, NY"
, month =	jul
, year =	1989
, update =	"97.11 bibrelex"
}

@article{r-ccgfo-92
, author =	"J. Renegar"
, title =	"On the computational complexity and geometry of the first order theory of the reals"
, journal =	"J. Symbolic Comput."
, volume =	13
, number =	3
, year =	1992
, pages =	"255--352"
, update =	"93.09 matousek"
}

@article{r-a623i-84
, author =	"R. J. Renka"
, title =	"Algorithm 623: {Interpolation} on the surface of a sphere"
, journal =	"ACM Trans. Math. Softw."
, volume =	10
, number =	4
, year =	1984
, pages =	"437--439"
, succeeds =	"r-idss-84"
}

@article{r-a624t-84
, author =	"R. J. Renka"
, title =	"Algorithm 624: {Triangulation} and interpolation of arbitrary distributed points in the plane"
, journal =	"ACM Trans. Math. Softw."
, volume =	10
, year =	1984
, pages =	"440--442"
}

@article{r-idss-84
, author =	"R. J. Renka"
, title =	"Interpolation of data on the surface of a sphere"
, journal =	"ACM Trans. Math. Softw."
, volume =	10
, number =	4
, year =	1984
, pages =	"417--436"
, precedes =	"r-a623i-84"
, annote =	"constructs Delaunay triangulation on sphere surface
		 using iterative (flip) algorithm; used to fit $C^{1}$
		 surface; $O(n^{2})$ time"
}

@article{rc-tbcim-84
, author =	"R. L. Renka and A. K. Cline"
, title =	"A triangle-based {$C^{1}$} interpolation method"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"223--238"
}

@article{rd-ublds-75
, author =	"B. Rennie and A. Dobson"
, title =	"Upper bounds for the lengths of {Davenport--Schinzel} sequences"
, journal =	"Utilitas Math."
, volume =	8
, year =	1975
, pages =	"181--185"
, update =	"95.09 agarwal"
}

@article{rs-udkhv-63
, author =	"A. R{\'e}nyi and R. Sulanke"
, title =	"{\"U}ber die konvexe {H{\"u}lle} von $n$ zuf{\"a}llig gerw{\"a}hten {Punkten} {I}"
, journal =	"Z. Wahrsch. Verw. Gebiete"
, volume =	2
, year =	1963
, pages =	"75--84"
}

@article{rs-zkper-68
, author =	"A. R{\'e}nyi and R. Sulanke"
, title =	"Zuf{\"a}llige konvexe {Polygone} in einem {Ringgebiet}"
, journal =	"Z. Wahrsch. Verw. Gebiete"
, volume =	9
, year =	1968
, pages =	"146--157"
, update =	"93.09 rote"
}

@article{ro-gud-96
, author =	"Kevin J. Renze and James H. Oliver"
, title =	"Generalized unstructured decimation"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	16
, number =	6
, month =	nov
, year =	1996
, pages =	"24--32"
, keywords =	"surface simplification, volume decimation, irregular grids"
, update =	"98.03 mitchell"
}

@book{r-glbe-84
, author =	"T. W. Reps"
, title =	"Generating Language-Based Environments"
, publisher =	"MIT Press"
, year =	1984
, update =	"96.01 tamassia"
}

@book{rt-sg-89
, author =	"T. W. Reps and T. Teitelbaum"
, title =	"The Synthesizer Generator"
, publisher =	"Springer-Verlag"
, year =	1989
, update =	"96.01 tamassia"
}

@incollection{r-rrso-80
, author =	"A. Requicha"
, title =	"Representations of Rigid Solid Objects"
, booktitle =	"Comput. Aided Design"
, series =	"Lecture Notes Comput. Sci."
, volume =	89
, publisher =	"Springer-Verlag"
, year =	1980
, pages =	"2--78"
, update =	"98.03 bibrelex"
}

@article{rv-smhsc-82
, author =	"A. A. Requicha and H. B. Voelcker"
, title =	"Solid Modeling: {A} Historical Summary and Contemporary Assessment"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	2
, number =	2
, month =	mar
, year =	1982
, pages =	"9--24"
, update =	"98.03 bibrelex"
}

@inproceedings{r-mmcrt-93
, author =	"A. A. G. Requicha"
, title =	"Mathematical Meaning and Computational Representation of Tolerance Specifications"
, booktitle =	"Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
, year =	1993
, pages =	"61--68"
, update =	"96.09 orourke"
}

@techreport{r-mmrso-79
, author =	"A. A. G. Requicha"
, title =	"Mathematical models of rigid solid objects"
, type =	"Report"
, number =	"TM-28"
, institution =	"College Engrg. Appl. Sci., Univ. Rochester"
, address =	"Rochester, NY"
, year =	1979
}

@incollection{r-rtsmi-84
, author =	"A. A. G. Requicha"
, title =	"Representation of tolerances in solid modeling: {Issues} and alternative approaches"
, editor =	"M. S. Pickett and J. W. Boyse"
, booktitle =	"Solid Modeling by Computers"
, publisher =	"Plenum Publishers Corp."
, year =	1984
, update =	"98.07 bibrelex"
}

@article{r-rrstm-80
, author =	"A. A. G. Requicha"
, title =	"Representations of rigid solids: theory, methods, and systems"
, journal =	"ACM Comput. Surv."
, volume =	12
, year =	1980
, pages =	"437--464"
}

@techreport{rt-mfcsg-78
, author =	"A. A. G. Requicha and R. B. Tilove"
, title =	"Mathematical foundations of constructive solid geometry: general topology of closed regular sets"
, type =	"Report"
, number =	"TM-27"
, institution =	"College Engrg. Appl. Sci., Univ. Rochester"
, address =	"Rochester, NY"
, year =	1978
}

@techreport{rv-bosmb-84
, author =	"A. A. G. Requicha and H. B. Voelcker"
, title =	"Boolean operations in solid modelling: boundary evaluation and merging algorithms"
, type =	"Report"
, number =	"??"
, institution =	"College Engrg. Appl. Sci., Univ. Rochester"
, address =	"Rochester, NY"
, year =	1984
}

@article{rv-bosmb-85
, author =	"A. A. G. Requicha and H. B. Voelcker"
, title =	"Boolean operations in solid modelling: boundary evaluation and merging algorithms"
, journal =	"Proc. IEEE"
, volume =	73
, number =	1
, year =	1985
, update =	"93.09 goodrich"
}

@techreport{rv-csg-80
, author =	"A. A. G. Requicha and H. B. Voelcker"
, title =	"Constructive solid geometry"
, type =	"Report"
, number =	"TM-25"
, institution =	"Production Automat. Project, Univ. Rochester"
, address =	"Rochester, NY"
, year =	1980
}

@article{rv-smcsr-83
, author =	"A. A. G. Requicha and H. B. Voelcker"
, title =	"Solid Modeling: {Current} status and research directions"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	3
, month =	oct
, year =	1983
, pages =	"25--37"
, update =	"97.11 bibrelex"
}

@book{r-km-76
, author =	"F. Reuleaux"
, title =	"The Kinematics of Machinery"
, publisher =	"Macmilly and Company"
, year =	1876
, note =	"Republished by Dover in 1963"
, update =	"98.03 bibrelex"
}

@inproceedings{r-mfdg-93
, author =	"Jean-Pierre Reveilles"
, title =	"Mathematical foundations of Discrete Geometry"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"27--30"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@article{rw-dolml-87
, author =	"C. Rey and R. Ward"
, title =	"On determining the on-line minimax linear fit to a discrete point set in the plane"
, journal =	"Inform. Process. Lett."
, volume =	24
, year =	1987
, pages =	"97--101"
}

@article{r-fhsdb-87
, author =	"C. W. Reynolds"
, title =	"Flocks, herds, and schools: A distributed behavioral model"
, journal =	"Comput. Graph."
, volume =	21
, number =	4
, year =	1987
, pages =	"25--34"
, note =	"Proc. SIGGRAPH '87"
, keywords =	"bird, fish, aggregate motion, particle system, actor, flight, behavioral animation, constraints, path, planning"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@article{r-msa3d-96
, author =	"M. Rezayat"
, title =	"Mid-Surface Abstraction from 3D Solid Models: General Theory and Applications"
, journal =	"Comput. Aided Design"
, volume =	28
, number =	11
, month =	nov
, year =	1996
, pages =	"905--915"
, update =	"97.03 held"
}

@inproceedings{rj-gedac-93
, author =	"P. de Rezende and W. Jacometti"
, title =	"GeoLab: {An} environment for development of algorithms in computational geometry"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"175--180"
, cites =	"ra-aeaa-, b-aa-87, b-zsaam-92, rj-agaug-93, ey-dlge-88, j-guapd-92, mn-lledt-89a, s-ooweg-90, kmmns-cgw-90, s-tfsaa-90, rj-agaug-93, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@misc{ra-aeaa-
, author =	"P. J. de Rezende and R. V. Amorim"
, title =	"AnimA - {An} Environment for Algorithm Animation"
, year =	"??"
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@inproceedings{rj-agaug-93
, author =	"P. J. de Rezende and W. R. Jacometti"
, title =	"Animation of Geometric Algorithms using {GeoLab}"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"401--402"
, keywords =	"video review"
, cites =	"b-aa-87, b-zsaam-92, ra-aeaa-, ey-dlge-88, j-guapd-92, k-iacgw-90, mn-lledt-89, s-ooweg-90, s-tfsaa-90, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{rl-pspmd-95
, author =	"P. J. de Rezende and D. T. Lee"
, title =	"Point set pattern matching in $d$-dimensions"
, journal =	"Algorithmica"
, volume =	13
, year =	1995
, pages =	"387--404"
, update =	"98.07 bibrelex"
}

@article{rlw-rsppr-89
, author =	"P. J. de Rezende and D. T. Lee and Y. F. Wu"
, title =	"Rectilinear shortest paths in the presence of rectangular barriers"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"41--53"
, succeeds =	"rlw-rsprb-85"
}

@inproceedings{rlw-rsprb-85
, author =	"P. J. de Rezende and D. T. Lee and Y. F. Wu"
, title =	"Rectilinear shortest paths with rectangular barriers"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"204--213"
, precedes =	"rlw-rsppr-89"
, cites =	"ahu-daca-74, b-lbact-83, d-ntpcg-59, egs-oplms-86, k-osps-83, ll-fmrdp-81, l-prp-78, lp-esppr-84, lw-apcfp-79, s-cg-78, ss-spps-84, v-atmtd-74, wpw-mtpr-74, ZZZ"
, update =	"97.11 bibrelex"
}

@techreport{r-drmrc-88
, author =	"G. Rhee"
, title =	"{DNA} restriction mapping from random-clone data"
, type =	"Technical {Report}"
, number =	"WUCS-88-18"
, institution =	"Dept. Comput. Sci., Washington Univ."
, address =	"St. Louis, MO"
, year =	1988
, update =	"97.11 bibrelex"
}

@article{r-asoi-53
, author =	"J. E. Rhodes"
, title =	"Analysis and synthesis of optical images"
, journal =	"Amer. J. Phys."
, volume =	21
, month =	may
, year =	1953
, pages =	"337--343"
, update =	"97.11 bibrelex"
}

@inproceedings{r-ospft-86
, author =	"W. T. Rhodes"
, title =	"Optical signal processing: Fourier Transform and Convolution/Correlation"
, booktitle =	"Proc. of SPIE"
, volume =	634
, year =	1986
, pages =	"57--63"
, update =	"98.07 bibrelex"
}

@article{r-adtp-73
, author =	"D. Rhynsburger"
, title =	"Analytic delineation of {Thiessen} polygons"
, journal =	"Geogr. Anal."
, volume =	5
, year =	1973
, pages =	"133--144"
}

@article{r-cgcg-72
, author =	"A. Ricci"
, title =	"A constructive geometry for computer graphics"
, journal =	"Comput. J."
, volume =	"??"
, year =	1972
, update =	"98.03 bibrelex"
}

@article{r-arhl3-71
, author =	"A. Ricci"
, title =	"An algorithm for the removal of hidden lines in $3$-d scenes"
, journal =	"Comput. J."
, volume =	14
, year =	1971
, pages =	"375--377"
}

@book{r-ms3-77
, author =	"J. Rice"
, title =	"Mathematical Software {III}"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1977
}

@book{rb-sepue-85
, author =	"J. R. Rice and R. F. Boisvert"
, title =	"Solving Elliptical Problems Using {ELLPACK}"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1985
, update =	"95.05 agarwal"
}

@article{r-fhars-89
, author =	"D. Richards"
, title =	"Fast heuristic algorithms for rectilinear {Steiner} trees"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"191--207"
}

@techreport{rl-dcps-90
, author =	"D. Richards and A. L. Liestman"
, title =	"Degree-Constrained Pyramid Spanners"
, type =	"Technical Report"
, number =	"TR-90-16"
, institution =	"University of Virginia"
, year =	1990
, update =	"98.07 bibrelex"
}

@article{rs-msttp-99
, author =	"D. Richards and J. S. Salowe"
, title =	"Mixed Spanning Trees in Theory and Practice"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, number =	3
, month =	jun
, year =	1999
, pages =	"277--292"
, update =	"99.07 held+smid"
}

@article{rs-ltacr-92
, author =	"D. S. Richards and J. S. Salowe"
, title =	"A linear-time algorithm to construct a rectilinear {Steiner} minimal tree for $k$-extremal point sets"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"247--276"
, update =	"94.09 smid"
}

@inproceedings{rs-rsmta-90
, author =	"D. S. Richards and J. S. Salowe"
, title =	"A rectilinear {Steiner} minimal tree algorithm for convex point sets"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"201--212"
}

@article{rs-sphtr-91
, author =	"D. S. Richards and J. S. Salowe"
, title =	"A simple proof of {Hwang's} theorem for rectilinear {Steiner} minimal tree"
, journal =	"Ann. Oper. Res."
, volume =	33
, year =	1991
, pages =	"549--556"
, update =	"98.11 bibrelex"
}

@article{rs-sqdos-92
, author =	"D. S. Richards and J. S. Salowe"
, title =	"Stacks, queues, and deques with order-statistic operations"
, journal =	"Acta Inform."
, volume =	29
, year =	1992
, pages =	"395--414"
, update =	"94.09 smid"
}

@article{r-avpps-77
, author =	"F. M. Richards"
, title =	"Areas, volumes, packing, and protein structure"
, journal =	"Annu. Rev. Biophys. Bioeng."
, volume =	6
, year =	1977
, pages =	"151--176"
, update =	"98.03 agarwal+bibrelex"
}

@article{r-ipstv-74
, author =	"F. M. Richards"
, title =	"The Interpretation of Protein Structures: Total Volume, Group Volume Distributions and Packing Density"
, journal =	"Journal of Molecular Biology"
, volume =	82
, year =	1974
, pages =	"1--14"
, annote =	"Voronoi polyhedron models volume of an atom. VP
		 calculated with $O(N^3)$ iterative algorithm."
}

@phdthesis{r-scsrp-87
, author =	"R. F. Richbourg"
, title =	"Solving a Class of Spatial Reasoning Problems: {Minimal}-Cost Path Planning in the Cartesian Plane"
, school =	"Naval Postgraduate School"
, address =	"Monterey, CA"
, year =	1987
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@techreport{rrz-eccsg-86
, author =	"R. F. Richbourg and N. C. Rowe and M. J. Zyda"
, title =	"Exploiting Capability Constraints To Solve Global, Two-Dimensional Path Planning Problems"
, type =	"Technical {Report}"
, number =	"NPS-86-006"
, institution =	"Department of Computer Science, Naval Postgraduate School"
, year =	1986
, update =	"93.09 milone+mitchell"
}

@inproceedings{rrzm-sgtdr-87
, author =	"R. F. Richbourg and N. C. Rowe and M. J. Zyda and R. McGhee"
, title =	"Solving Global Two-Dimensional Routing Problems Using {Snell's} law"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Raleigh, NC"
, year =	1987
, pages =	"1631--1636"
, update =	"93.09 milone+mitchell"
}

@article{rrn-arpld-80
, author =	"M. Richetin and G. Rives and M. Naranjo"
, title =	"Algorithm rapide pour la determination des $k$ plus proches voisins"
, journal =	"RAIRO Inform. Theor."
, volume =	14
, year =	1980
, pages =	"369--378"
}

@article{r-colwd-93
, author =	"J. Richter-Gebert"
, title =	"Combinatorial obstructions to the lifting of weaving diagrams"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"287--312"
, update =	"96.05 pocchiola"
}

@article{r-omfm-93
, author =	"J. Richter-Gebert"
, title =	"Oriented matroids with few mutations"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"251--269"
, update =	"96.05 pocchiola"
}

@incollection{rgz-om-97
, author =	"J. Richter-Gebert and G. M. Ziegler"
, title =	"Oriented matroids"
, chapter =	6
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"111--132"
, update =	"97.11 orourke"
}

@article{rz-rspu-95
, author =	"J. Richter-Gebert and G. M. Ziegler"
, title =	"Realization spaces of $4$-polytopes are universal"
, journal =	"Bull. Amer. Math. Soc."
, volume =	32
, number =	4
, month =	oct
, year =	1995
, update =	"96.05 pocchiola"
}

@article{rohg-nrgdv-88
, author =	"R. Riedinger and P. Oelhafen and M. Habar and H. J. Guntherodt"
, title =	"A New Realization of the Global {Delaunay}-{Voronoi} Tesselation in Arbitrary Dimension"
, journal =	"Zeitschrift Fur Physikalische Chemie Neue Folge"
, volume =	157
, number =	"P1"
, year =	1988
, pages =	"47--51"
, annote =	"Insertion algorithm?"
}

@article{rohg-advt-88
, author =	"R. Riedinger and P. Oelhafen and M. Habar and H. J. Guntherodt"
, title =	"About the {Delaunay}-{Voronoi} Tesselation"
, journal =	"J. Comput. Phys."
, volume =	74
, number =	1
, year =	1988
, pages =	"61--72"
, annote =	"Circumsphere (selection) algorithm."
}

@techreport{r-absag-73
, author =	"R. Riesenfeld"
, title =	"Applications of {B}-spline approximation to geometric problems of computer-aided design"
, type =	"Technical {Report}"
, number =	"UTEC-CS-73-126"
, institution =	"Dept. Comput. Sci., Univ. Utah"
, address =	"Salt Lake City, UT"
, year =	1973
}

@article{r-hcppc-81
, author =	"R. F. Riesenfeld"
, title =	"Homogeneous Coordinates and Projective Planes in Computer Graphics"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	1
, year =	1981
, pages =	"50--55"
, update =	"99.03 forrest, 98.11 ghali"
}

@article{rsp-sbmc-91
, author =	"R. Ringeisen and S. Stueckle and B. Piazza"
, title =	"Subgraphs and bounds on maximum crossings"
, journal =	"Bulletin of the Institute for Combinatorics and its Applications"
, volume =	2
, year =	1991
, pages =	"33--46"
, update =	"98.03 bibrelex"
}

@book{r-mct-74
, author =	"G. Ringel"
, title =	"Map-color theorem"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1974
, update =	"98.07 bibrelex"
}

@article{r-msp-72
, author =	"B. D. Ripley"
, title =	"Modelling spatial patterns"
, journal =	"J. Roy. Statist. Soc. Ser. B"
, volume =	39
, year =	1972
, pages =	"172--192"
}

@article{r-lttcb-92
, author =	"Samuel Rippa"
, title =	"Long And Thin Triangles Can Be Good For Linear Interpolation"
, journal =	"SIAM J. Numer. Anal."
, volume =	29
, number =	1
, month =	feb
, year =	1992
, pages =	"257--270"
, keywords =	"piecewise linear interpolation surface (plis), triangulations"
, abstract =	"Given a set of data points in R**2 and corresponding
		 data values, it is clear that the quality of a
		 Piecewise Linear Interpolation Surface (PLIS) over
		 triangles depends on the specific triangulation of the
		 data points. In this paper, the question of what are
		 good triangles (and triangulations) for linear
		 interpolation is studied further. First, the model
		 problem of constructing optimal triangulations for
		 interpolating quadratic functions by PLIS is
		 considered. Next, a new interpretation of existing
		 error bounds for interpolating general smooth functions
		 by PLIS is studied. The conclusion is that triangles
		 should be long in directions where the magnitude of the
		 second directional derivative of F is small and thin in
		 directions where the magnitude of the second
		 directional derivative of F is large. (Author abstract)
		 17 Refs."
}

@article{r-mrpdt-90
, author =	"Samuel Rippa"
, title =	"Minimal Roughness Property of the {Delaunay} Triangulation"
, journal =	"Comput. Aided Geom. Design"
, volume =	7
, year =	1990
, pages =	"489--497"
, annote =	"If we use a triangulation to define a surface, the
		 roughness measure is the $l_2$ norm squared of the
		 surface. Proves that DT minimizes roughness,
		 irrespective of height. Key point: is that if we call
		 the distances between each vertex and the intersection
		 of the diagonals a,b,c,d then quad is cyclic iff ac =
		 bd"
}

@article{rs-metep-90
, author =	"S. Rippa and B. Schiff"
, title =	"Minimum Energy Triangulations for Elliptic Problems"
, journal =	"Computer Methods in Applied Mechanics and Engineering"
, volume =	84
, year =	1990
, pages =	"257--274"
, annote =	"MET is triangulation that minimizes some energy
		 function $J$. Shows that DT minimizes Laplace
		 functional. Switchings to improve triangulation."
, abstract =	"We consider the family of finite element spaces of
		 fixed dimension, defined over all triangulations of a
		 given polygonal domain in $R^2$, based on a common set
		 of nodes (vertices). A minimum energy triangulation,
		 relative to a given elliptic problem, is a
		 triangulation for which the finite element solution has
		 the minimal energy. The minimum energy triangulation
		 can be considered optimal, as it minimizes the solution
		 error in the natural norm associated with the problem.
		 It is shown in this paper that the well-known Delaunay
		 triangulation of a set of points in $R^2$ is a minimum
		 energy triangulation for the energy functional
		 associated with the nonhomogeneous Laplace equation.
		 Minimum energy triangulations may be very expensive to
		 compute. In this paper, therefore, we present
		 algorithms for constructing locally minimal energy
		 triangulations and outline efficient schemes for
		 computing suboptimal triangulations. In both cases the
		 basic idea is to improve an initial triangulation by
		 using local operations on the edges of the
		 triangulation. It is shown for several model problems
		 that such sub- minimal energy triangulations can
		 significantly improve the quality of the approximate
		 solution. (Author abstract) 13 Refs."
}

@techreport{r-nhvg-91
, author =	"J. Rippel"
, title =	"A non-{Hamiltonian} visibility graph"
, number =	009
, institution =	"Smith College"
, year =	1991
, update =	"93.09 milone+mitchell"
}

@techreport{r-pcp-91
, author =	"J. Risler"
, title =	"Placement of Curved Polygons"
, type =	"Report"
, number =	"LMENS-91 -2"
, institution =	"Laboratoire de Math{\'e}matiques, Ecole Normale Sup{\'e}rieure"
, address =	"UA 762 du CNRS"
, year =	1991
, update =	"96.05 ramkumar"
}

@article{r-trcad-89
, author =	"T. Risse"
, title =	"Hough Transform for Line Recognition: Complexity of Evidence Accumulation and Cluster Detection"
, journal =	"Computer Vision"
, volume =	46
, year =	1989
, pages =	"327--345"
, update =	"98.07 bibrelex"
}

@inproceedings{rs-rtsaf-93
, author =	"T. Risset and S. W. Song"
, title =	"A real-time systolic algorithm for on-the-fly hidden surface removal"
, booktitle =	"Proc. 1993 Internat. Conf. Application-Specific Array Processors, Venice, Italy"
, nickname =	"ASAP"
, month =	oct
, year =	1993
, pages =	"??"
, keywords =	"parallel computation"
, comments =	"to appear"
, update =	"93.09 rote"
}

@book{r-da-50
, author =	"J. F. Ritt"
, title =	"Differential Algebra"
, series =	"Colloquium Publications"
, volume =	33
, publisher =	"American Mathematical Society"
, address =	"New York, NY"
, year =	1950
, update =	"98.03 bibrelex"
}

@book{r-deas-32
, author =	"J. F. Ritt"
, title =	"Differential Equations from the Algebraic Standpoint"
, series =	"Colloquium Publications"
, volume =	14
, publisher =	"American Mathematical Society"
, address =	"New York, NY"
, year =	1932
, update =	"98.03 bibrelex"
}

@article{rwli-asnnd-75
, author =	"G. L. Ritter and H. B. Woodruff and S. R. Lowry and T. L. Isenhour"
, title =	"An algorithm for the selective nearest neighbor decision rule"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-21"
, year =	1975
, pages =	"665--669"
}

@incollection{r-gdsos-89
, author =	"I. Rival"
, title =	"Graphical Data Structures for Ordered Sets"
, editor =	"I. Rival"
, booktitle =	"Algorithms and Order"
, publisher =	"Kluwer Academic Publishers"
, year =	1989
, pages =	"3--31"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@incollection{r-rdo-93
, author =	"I. Rival"
, title =	"Reading, Drawing, and Order"
, editor =	"I. G. Rosenberg and G. Sabidussi"
, booktitle =	"Algebras and Orders"
, publisher =	"Kluwer Academic Publishers"
, year =	1993
, pages =	"359--404"
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@incollection{r-d-85
, author =	"I. Rival"
, title =	"The Diagram"
, editor =	"I. Rival"
, booktitle =	"Graphs and Orders"
, publisher =	"Reidel Publishing"
, year =	1985
, pages =	"103--133"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{ru-ommts-89
, author =	"I. Rival and J. Urrutia"
, title =	"Order models for motion in three-space"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	33
, keywords =	"motion planning"
}

@article{ru-roptc-88
, author =	"I. Rival and J. Urrutia"
, title =	"Representing Orders on the Plane by Translating Convex Figures"
, journal =	"Order"
, volume =	4
, year =	1988
, pages =	"319--339"
, update =	"97.11 bibrelex"
}

@article{rw-lfgpo-79
, author =	"I. Rival and R. Wille"
, title =	"Lattices Freely Generated by Partially Ordered Sets: Which can be Drawn?"
, journal =	"J. Reine Angew. Math."
, volume =	310
, year =	1979
, pages =	"56--80"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{r-dtrp-93
, author =	"Maria-Cecilia Rivara"
, title =	"A Discussion on the Triangulation Refinement Problem"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"42--47"
, cites =	"bde-tpwla-92, bc-mgrfc-92, ps-cgi-85, r-ddsfa-84, r-artgs-84, r-srdas-89, r-lmmam-91, rs-lbatc-75, ir-scstp-92, r-ggb4t-87, rl-3rasa-92, s-fcbmt-80, ZZZ"
, update =	"98.11 bibrelex"
}

@article{r-ggb4t-87
, author =	"M. C. Rivara"
, title =	"A Grid Generator Based on 4-Triangles Conforming Mesh-Refinement Algorithms"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	24
, number =	7
, year =	1987
, pages =	"1343--1354"
, annote =	"Works by subdividing triangles."
}

@article{r-artgs-84
, author =	"M. C. Rivara"
, title =	"Algorithms for refining triangular grids suitable for adaptive and multigrid techniques"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	20
, year =	1984
, pages =	"745--756"
, update =	"94.05 orourke"
, annote =	"Repeatedly bisects longest side of triangle"
}

@article{r-ddsfa-84
, author =	"M. C. Rivara"
, title =	"Design and data structure of fully adaptive multigrid, finite-element software"
, journal =	"ACM Trans. Math. Softw."
, volume =	10
, year =	1984
, pages =	"242--264"
, update =	"98.11 bibrelex"
}

@article{r-lmmam-91
, author =	"M. C. Rivara"
, title =	"Local modification of meshes for adaptive and/or multigrid finite element methods"
, journal =	"J. Comp. Appl. Math."
, volume =	36
, year =	1991
, pages =	"79--89"
, update =	"98.11 bibrelex"
}

@inproceedings{r-nmttr-96
, author =	"Maria-Cecilia Rivara"
, title =	"New mathematical tool and techniques for the refinement and/or improvement of unstructured triangulations"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"77--86"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{r-np3le-99
, author =	"Mar{\'\i}a-Cecilia Rivara"
, title =	"Nondegeneracy Properties of {3D} Longest-Edge Algorithms for the Quality Refinement of Triangulations"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"73--75"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{r-ngnsg-87
, author =	"Mar{\'\i}a-Cecilia Rivara"
, title =	"Numerical Generation of Nested Series of General Triangular Grids"
, editor =	"C. K. Chui and L. L. Schumaker and F. I. Utreras"
, booktitle =	"Topics in Multivariate Approximation"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1987
, pages =	"193--206"
, annote =	"Basic idea is to split a triangle with an edge to the
		 centre of its longest side. This can then trigger
		 further splits to remove non conforming points.
		 Resulting should be as good as the original one."
}

@article{r-srdas-89
, author =	"M. C. Rivara"
, title =	"Selctive refinement/derefinement algorithms for sequences of nested triangulations"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	"??"
, year =	1989
, pages =	"2289--2906"
, update =	"98.11 bibrelex"
}

@article{rl-3rasa-92
, author =	"M. C. Rivara and C. Levin"
, title =	"A 3-{D} refinement algorithm suitable for adaptive and multigrid techniques"
, journal =	"Comm. Applied Numer. Meth."
, volume =	8
, year =	1992
, pages =	"281--290"
, update =	"98.11 bibrelex"
}

@inproceedings{ri-dmlsm-95
, author =	"Mari'a-Cecilia Rivara and Patricio Inostroza"
, title =	"A Discussion on Mixed (Longest-Side Midpoint Insertion) {Delaunay} Techniques for the Triangulation Refinement Problem"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"335--346"
, update =	"96.01 samitchell"
}

@inproceedings{r-nspcs-90
, author =	"E. Rivera-Campo"
, title =	"A note on separation of plane convex sets"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"78--80"
, cites =	"t-sppcs-79, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{ru-ntgsp-97
, author =	"Eduardo Rivera-Campo and Virginia Urrutia-Galicia"
, title =	"A Note on the Tree Graph of a Set of Points in the Plane"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"46--49"
, update =	"97.11 jones"
}

@article{ru-hcpgs-01
, author =	"E. Rivera-Campo and V. Urrutia-Galicia"
, title =	"Hamilton cycles in the path graph of a set of points in convex position"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"65--72"
, update =	"01.07 smid"
}

@inproceedings{ru-pcp-91
, author =	"E. Rivera-Campo and J. Urrutia"
, title =	"A property of convex polygons"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"203--206"
, cites =	"ers-ccsno-90, f-icd-77, hk-spcs-90, r-nspcs-90, t-sppcs-79, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{ri-eaade-84
, author =	"J. Rivero and A. Inselberg"
, title =	"Extensi{\'o}n al an{\'a}sis del espacio de fase de sistemas dina{\'a}micos por las coordenadas paralelas"
, type =	"Report"
, number =	"??"
, institution =	"IBM Los Angeles Sci. Center"
, address =	"Los Angeles, CA"
, year =	1984
}

@techreport{r-aara-74
, author =	"R. L. Rivest"
, title =	"Analysis of associative retrieval algorithms"
, type =	"Report"
, number =	"STAN-CS-74-415"
, institution =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, year =	1974
}

@inproceedings{r-hcapm-74
, author =	"R. L. Rivest"
, title =	"On hash-coding algorithms for partial-match retrieval"
, booktitle =	"Proc. 15th Annu. IEEE Sympos. Switching Automata Theory"
, year =	1974
, pages =	"95--103"
, precedes =	"r-pmra-76"
}

@incollection{r-oeapb-74
, author =	"R. L. Rivest"
, title =	"On the optimality of {Elias}'s algorithm for performing best-match searches"
, booktitle =	"Information Processing"
, publisher =	"North-Holland"
, year =	1974
, pages =	"678--681"
, update =	"98.03 bibrelex"
}

@article{r-pmra-76
, author =	"R. L. Rivest"
, title =	"Partial-match retrieval algorithms"
, journal =	"SIAM J. Comput."
, volume =	5
, year =	1976
, pages =	"19--50"
, succeeds =	"r-hcapm-74"
}

@inproceedings{r-ppis-82
, author =	"R. L. Rivest"
, title =	"The ``{PI}'' (placement and interconnect) system"
, booktitle =	"Proc. 19th ACM-IEEE Design Automation Conf."
, year =	1982
, pages =	"475--481"
}

@phdthesis{r-cve2d-97
, author =	"S. Rivi{\`e}re"
, title =	"Calculs de Visibilit{\'e} dans un Environnement 2D"
, school =	"Universit{\'e} Joseph Fourier"
, address =	"Grenoble, France"
, year =	1997
, keywords =	"doctoral thesis"
, update =	"01.11 pocchiola, 98.07 bibrelex"
}

@techreport{r-cddcd-93
, author =	"S. Rivi{\`e}re"
, title =	"Comparison d'algorithmes de calcul de graphes de visibilit{\'e}"
, type =	"Rapport du stage"
, institution =	"DEA IMA"
, year =	1993
, update =	"98.03 bibrelex"
}

@inproceedings{r-ddnic-96
, author =	"St{\'e}phane Rivi{\`e}re"
, title =	"Dealing with Degeneracies and Numerical Imprecisions when Computing Visibility Graphs"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"35--38"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{r-dvpsv-97
, author =	"S. Rivi{\`e}re"
, title =	"Dynamic visibility in polygonal scenes with the visibility complex"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"421--423"
, cites =	"dy-rchyd-93, gs-iuvms-96, ol-mcp-81, pv-vc-96, r-vc2dp-97, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{r-ectac-93
, author =	"S. Rivi{\`e}re"
, title =	"Experimental comparison of two algorithms for computing visibility graphs"
, type =	"Manuscript"
, institution =	"??"
, year =	1993
, update =	"98.03 bibrelex"
}

@inproceedings{r-tsvcp-95
, author =	"St{\'e}phane Rivi{\`e}re"
, title =	"Topologically Sweeping the Visibility Complex of Polygonal Scenes"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C36--C37"
, keywords =	"visibility graph optimal algorithm, experimental"
, cites =	"eg-tsa-86, gm-osacv-87, ow-nmcvg-88, pv-savgc-93, pv-vc-93, pv-cvgpt-95, r-ectac-93, ZZZ"
, update =	"98.07 icking, 98.03 bibrelex, 95.09 mitchell"
}

@phdthesis{r-vc2dp-97
, author =	"S. Rivi{\`e}re"
, title =	"Visibility computations in $2${D} polygonal scenes"
, school =	"Universit{\'e} Joseph Fourier"
, address =	"Grenoble, France"
, year =	1997
, keywords =	"doctoral thesis"
, update =	"01.11 pocchiola, 98.07 bibrelex"
}

@inproceedings{r-wvcav-97
, author =	"St{\'e}phane Rivi{\`e}re"
, title =	"Walking in the Visibility Complex with Applications to Visibility Polygons and Dynamic Visibility"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"147--152"
, update =	"98.07 icking, 97.11 jones"
}

@inproceedings{rodp-uvcrc-96
, author =	"S. Rivi{\`e}re and R. Orti and F. Durand and C. Puech"
, title =	"Using the visibility complex for radiosity computation"
, booktitle =	"ACM Workshop Appl. Comput. Geom."
, month =	may
, year =	1996
, update =	"97.11 bibrelex"
}

@techreport{r-ciph3-92
, author =	"I. Rivin"
, title =	"A characterization of ideal polyhedra in hyperbolic $3$-space"
, type =	"Preprint"
, institution =	"??"
, year =	1992
, update =	"97.11 bibrelex"
}

@article{r-esssh-94
, author =	"Igor Rivin"
, title =	"Euclidean Structures on Simplicial Surfaces and Hyperbolic Volume"
, journal =	"Ann. Math."
, volume =	139
, number =	3
, year =	1994
, pages =	"553--580"
, update =	"98.07 tamassia+vismara"
}

@phdthesis{r-gcph3-86
, author =	"I. Rivin"
, title =	"On geometry of convex polyhedra in hyperbolic $3$-space"
, type =	"Ph.{D}. Thesis"
, school =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	1986
, keywords =	"doctoral thesis"
}

@article{r-giph3-
, author =	"I. Rivin"
, title =	"On the geometry of ideal polyhedra in hyperbolic $3$-space"
, journal =	"Topology"
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"97.11 bibrelex"
}

@misc{r-ahvfl-92
, author =	"I. Rivin"
, title =	"Some applications of the hyperbolic volume formula of {Lobachevskii} and {Milnor}"
, howpublished =	"preprint"
, year =	1992
, update =	"98.11 bibrelex"
}

@techreport{rs-iphdd-91
, author =	"I. Rivin and W. D. Smith"
, title =	"Ideal polyhedra in $H^3$ are determined by their dihedral angles"
, type =	"manuscript"
, institution =	"NEC Research Institute"
, year =	1991
, update =	"98.11 bibrelex"
}

@techreport{rs-ig-91
, author =	"I. Rivin and W. D. Smith"
, title =	"Inscribable graphs"
, type =	"Manuscript"
, institution =	"NEC Research Institute"
, address =	"Princeton, NJ"
, year =	1991
, update =	"97.11 bibrelex"
}

@book{r-iaf-69
, author =	"T. Rivlin"
, title =	"An Introduction to the Approcimation of Functions"
, publisher =	"Dover"
, address =	"New York"
, year =	1969
, update =	"98.07 bibrelex"
}

@article{r-ac-79
, author =	"T. J. Rivlin"
, title =	"Approximating by circles"
, journal =	"Computing"
, volume =	21
, year =	1979
, pages =	"93--104"
, update =	"98.07 bibrelex"
}

@article{rpw-csbsd-87
, author =	"J. W. Roach and P. Paripati and J. Wright"
, title =	"A {CAD} system based on spherical dual representation"
, journal =	"IEEE Comput."
, volume =	20
, number =	8
, year =	1987
, pages =	"37--44"
, update =	"98.07 bibrelex"
}

@inproceedings{rwr-sdi3d-86
, author =	"J. W. Roach and J. Wright and V. Ramesh"
, title =	"Spherical dual images: {A} $3$-{D} representation method that combines dual space and {Gaussian} spheres"
, booktitle =	"Proceedings of Workshop on Computer Vision: Representation and Control"
, year =	1986
, pages =	"236--241"
, update =	"98.07 bibrelex"
}

@article{r-tgs-86
, author =	"L. Robbiano"
, title =	"On the theory of graded structures"
, journal =	"J. Symbolic Comput."
, volume =	2
, year =	1986
, pages =	"139--170"
, update =	"98.03 bibrelex"
}

@inproceedings{r-topr-85
, author =	"L. Robbiano"
, title =	"Term orderings on the polynomial ring"
, booktitle =	"European Conference on Computer Algebra"
, nickname =	"EUROCAL '85"
, series =	"Lecture Notes Comput. Sci."
, volume =	20
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"513--517"
, update =	"98.03 bibrelex"
}

@article{rt-cvssm-91
, author =	"M. O. Robbins and P. A. Thompson"
, title =	"Critical Velocity of Stick-Slip Motion"
, journal =	"Science"
, volume =	253
, year =	1991
, pages =	"916--925"
, update =	"96.09 orourke"
}

@techreport{rt-cgfl-90
, author =	"J. Robert and G. Toussaint"
, title =	"Computational geometry and facility location"
, type =	"Technical {Report}"
, number =	"SOCS 90.20"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{r-gohtt-93
, author =	"J.-M. Robert"
, title =	"Geometric orderings and {Helly}-type theorem for intersecting translates in the plane"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"61--66"
, precedes =	"r-goita-97"
, cites =	"ab-eact-87, es-mnwsn-90, ew-spdtl-89, gpw-gtt-93, h-uegt-57, k-cgct-86, kll-gpct-86, kll-gpdt-87, kll-gpdt-87, t-pgcct-89, w-ghtti-90, w-gpcc-90, ZZZ"
, update =	"98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
}

@article{r-goita-97
, author =	"J.-M. Robert"
, title =	"Geometric orderings of intersecting translates and their applications"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"59--72"
, succeeds =	"r-gohtt-93"
, update =	"97.03 devillers"
}

@inproceedings{rt-laso-92
, author =	"J.-M. Robert and G. Toussaint"
, title =	"Linear approximation of simple objects"
, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	577
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"233--244"
, precedes =	"rt-laso-94"
, update =	"96.09 devillers"
}

@article{rt-laso-94
, author =	"J.-M. Robert and G. Toussaint"
, title =	"Linear approximation of simple objects"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"27--52"
, succeeds =	"rt-laso-92"
, update =	"96.09 devillers"
}

@article{r-gtaps-78
, author =	"Fred S. Roberts"
, title =	"Graph Theory and Its Applications to Problems of Society"
, journal =	"SIAM, CBMS-NSF REgional Conf. Series in Applied Mathematics, Philadelphia"
, volume =	"??"
, year =	1978
, update =	"98.07 bibrelex"
}

@incollection{r-ig-69
, author =	"F. S. Roberts"
, title =	"Indifference Graphs"
, editor =	"F. Harary"
, booktitle =	"Proof Techniques in Graph Theory"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1969
, pages =	"139--146"
, update =	"98.11 bibrelex"
}

@article{r-ffiss-88
, author =	"S. Roberts"
, title =	"On the figures formed by the intercepts of a system of straight lines in a plane, and an analogous relations in space of three dimensions"
, journal =	"Proc. London Math. Soc."
, volume =	19
, year =	1888
, pages =	"405--422"
}

@inproceedings{rmc-cta3v-91
, author =	"G. G. Robertson and J. D. Mackinlay and S. K. Card"
, title =	"Cone Trees: Animated {3D} Visualizations of Hierarchical Information"
, booktitle =	"Proc. ACM Conf. on Human Factors in Computing Systems"
, nickname =	"CHI"
, year =	1991
, pages =	"189--193"
, keywords =	"graph drawing"
, update =	"97.03 tamassia, 96.09 tamassia, 95.01 tamassia"
}

@article{r-cal-70
, author =	"H. G. Robertson"
, title =	"Curvature and arc length"
, journal =	"SIAM J. Appl. Math."
, volume =	19
, year =	1970
, pages =	"697--699"
, update =	"94.05 devillers"
}

@inproceedings{rsst-efcpg-96
, author =	"N. Robertson and D. P. Sanders and P. Seymour and R. Thomas"
, title =	"Efficiently four-coloring planar graphs"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, year =	1996
, pages =	"571--575"
, update =	"98.07 bibrelex"
}

@article{rs-gm2aa-86
, author =	"N. Robertson and P. D. Seymour"
, title =	"Graph minors {II}. {Algorithmic} aspects of tree width"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"309--322"
, update =	"97.11 bibrelex"
}

@techreport{r-igptd-87
, author =	"G. Robins"
, title =	"The {ISI} Grapher: {A} Portable Tool for Displaying Graphs Pictorially"
, number =	"ISI/RS-87-196"
, institution =	"Information Sciences Inst., University of Southern California"
, year =	1987
, note =	"also in Proc. Symboliikka '87 Helsinki Finland August
                 1987"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{rs-ldmst-95
, author =	"G. Robins and J. S. Salowe"
, title =	"Low-degree minimum spanning trees"
, journal =	"Discrete Comput. Geom."
, volume =	14
, year =	1995
, pages =	"151--165"
, update =	"02.03 smid"
}

@inproceedings{rs-mdmst-94
, author =	"G. Robins and J. S. Salowe"
, title =	"On the Maximum Degree of Minimum Spanning Trees"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"250--258"
, cites =	"bgmrz-tsees-93, bgrz-ngnos-93, clr-ia-90, cfg-upg-90, de-eaahc-84, gj-cigtn-79, gp-1stp-87, gh-hmstp-85, gs-canen-83, h-tdicl-91, hvw-narst-90, kl-bpss-78, kr-ncist-92, k-sssgt-56, pv-tgprt-84, pl-pdavs-88, p-scnsg-57, sw-ersta-93, t-nrtpc-83, w-cbdd-65, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@techreport{r-kdbts-81t
, author =	"J. T. Robinson"
, title =	"The $k$-d-{B}-tree: {A} search structure for large multidimensional dynamic indexes"
, type =	"Report"
, number =	"CMU-CS-81-106"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1981
, precedes =	"r-kdbts-81i"
, update =	"97.07 agarwal, 94.05 franciosa"
}

@inproceedings{r-kdbts-81i
, author =	"J. T. Robinson"
, title =	"The $k$-d-b-tree: a search structure for large multidimensional dynamic indexes"
, booktitle =	"Proc. ACM SIGACT-SIGMOD Conf. Principles Database Systems"
, year =	1981
, pages =	"10--18"
, succeeds =	"r-kdbts-81t"
, update =	"94.05 franciosa"
}

@article{r-untp-71
, author =	"R. M. Robinson"
, title =	"Undecidability and nonperiodicity of tilings of the plane"
, journal =	"Invent. Math."
, volume =	12
, year =	1971
, pages =	"177--909"
, update =	"97.11 bibrelex"
}

@article{rwp-3dimp-88
, author =	"Michel Roch and Jacques Weber and Christian Pellegrini"
, title =	"3{D} images of molecular properties by triangulation of contour lines"
, journal =	"Comput. Graph. Forum"
, volume =	7
, number =	3
, month =	sep
, year =	1988
, pages =	"195--202"
, annote =	"I can't understand their algorithm."
}

@inproceedings{r-pdsrr-99
, author =	"Jairo Rocha"
, title =	"Polygonal Decomposition into Singular and Regular Regions"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"185--190"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@book{r-ca-70
, author =	"R. T. Rockafellar"
, title =	"Convex Analysis"
, publisher =	"Princeton University Press"
, year =	1970
, update =	"98.03 bibrelex"
}

@inproceedings{rhd-rtrts-89
, author =	"A. Rockwood and K. Heaton and T. Davis"
, title =	"Real-time rendering of trimmed surfaces"
, booktitle =	"Proc. SIGGRAPH '89"
, year =	1989
, pages =	"107--117"
, update =	"97.11 bibrelex"
}

@inproceedings{ro-bssgm-85
, author =	"A. Rockwood and J. Owen"
, title =	"Blending Surfaces in Solid Geometric Modeling"
, booktitle =	"SIAM Conf. on Geometric Modeling and Robotics"
, site =	"Albany, NY"
, year =	1985
, update =	"98.03 bibrelex"
}

@techreport{rnp-falp-97
, author =	"A. Rodriguez-Chia and S. Nickel and J. Puerto"
, title =	"A flexible Approach to Location Problems"
, type =	"Report in Wirtschaftsmathematik"
, number =	26
, institution =	"University of  Kaiserslautern, Department of Mathematics"
, year =	1997
, update =	"01.04 icking"
}

@article{r-css-63
, author =	"C. A. Rogers"
, title =	"Covering a sphere with spheres"
, journal =	"Mathematika"
, volume =	10
, year =	1963
, pages =	"157--164"
, update =	"98.03 smid, 97.11 bibrelex"
}

@book{r-pc-64
, author =	"C. A. Rogers"
, title =	"Packing and Covering"
, publisher =	"Cambridge University Press"
, address =	"Cambridge, England"
, year =	1964
, keywords =	"book"
, update =	"98.03 smid"
}

@book{ra-mecg-76
, author =	"D. F. Rogers and J. A. Adams"
, title =	"Mathematical Elements for Computer Graphics"
, edition =	"1st"
, publisher =	"McGraw-Hill"
, year =	1976
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@book{ra-mecg-90
, author =	"D. F. Rogers and J. A. Adams"
, title =	"Mathematical Elements for Computer Graphics"
, edition =	"2nd"
, publisher =	"McGraw-Hill"
, address =	"New York"
, year =	1990
, update =	"98.11 bibrelex, 98.07 orourke"
}

@book{r-trfec-67
, author =	"H. Rogers"
, title =	"Theory of Recursive Functions and Effective Computability"
, publisher =	"McGraw-Hill"
, address =	"New York"
, year =	1967
, update =	"95.09 agarwal"
}

@mastersthesis{r-phsgt-97
, author =	"Andr{\'e} Rohe"
, title =	"{Parallele} {Heuristiken} f{\"u}r sehr gro{\ss}e {Traveling} {Saleman} {Probleme}"
, type =	"Diplomarbeit"
, school =	"Universit{\"a}t Bonn, Institut f{\"u}r Diskrete Mathematik"
, year =	1997
, url =	"http://www.or.uni-bonn.de/home/rohe/diplom.ps.gz"
, keywords =	"master thesis"
, update =	"00.03 bibrelex"
}

@article{r-pmsta-78
, author =	"F. J. Rohlf"
, title =	"A probabilistic minimum spanning tree algorithm"
, journal =	"Inform. Process. Lett."
, volume =	7
, year =	1978
, pages =	"44--48"
}

@techreport{r-ceaca-77
, author =	"F. J. Rohlf"
, title =	"Computational efficiency of agglomerative clustering algorithms"
, type =	"Report"
, number =	"RC 6831 (\#29312)"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1977
}

@article{r-hcums-73
, author =	"F. J. Rohlf"
, title =	"Hierarchical clustering using the minimum spanning tree"
, journal =	"Comput. J."
, volume =	16
, year =	1973
, pages =	"93--95"
}

@article{r-lie-89
, author =	"J. Rohn"
, title =	"Linear interval equations"
, journal =	"Linear Algebra and its applications"
, volume =	126
, year =	1989
, pages =	"39--78"
, update =	"98.03 bibrelex"
}

@inproceedings{r-daplc-85
, author =	"H. Rohnert"
, title =	"A Dynamization of the All-Pairs Least Cost Problem"
, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	182
, publisher =	"Springer-Verlag"
, year =	1985
, pages =	"279--286"
, update =	"94.01 tamassia"
}

@techreport{r-naspa-86
, author =	"H. Rohnert"
, title =	"A new algorithm for shortest paths avoiding convex polygonal obstacles"
, type =	"Report"
, number =	"A86/02"
, institution =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1986
}

@inproceedings{r-mdbp-87
, author =	"H. Rohnert"
, title =	"Moving a disc between polygons"
, booktitle =	"Proc. 1st Internat. Conf. Indust. Applied Math."
, site =	"Paris, France"
, year =	1987
, pages =	"85--98"
, precedes =	"r-mdbp-91"
}

@article{r-mdbp-91
, author =	"H. Rohnert"
, title =	"Moving a disc between polygons"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"182--191"
, succeeds =	"r-mdbp-87"
}

@article{r-sppcp-86
, author =	"H. Rohnert"
, title =	"Shortest paths in the plane with convex polygonal obstacles"
, journal =	"Inform. Process. Lett."
, volume =	23
, year =	1986
, pages =	"71--76"
}

@article{r-tseas-88
, author =	"H. Rohnert"
, title =	"Time and space efficient algorithms for shortest paths between convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	27
, year =	1988
, pages =	"175--179"
, update =	"98.11 bibrelex"
}

@phdthesis{r-svcvc-89
, author =	"A. S. Rojer"
, title =	"Space-variant computer vision with a complex-logarithmic sensor geometry"
, school =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1989
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@inproceedings{rs-dcsvv-90
, author =	"A. S. Rojer and E. L. Schwartz"
, title =	"Design considerations for a space-variant visual sensor with a complex-logarithmic sensor geometry"
, booktitle =	"Proc. 10th IEEE Internat. Conf. Pattern Recogn."
, volume =	2
, year =	1990
, pages =	"278--285"
, update =	"98.07 bibrelex"
}

@inproceedings{rww-obps-92
, author =	"J. Rokne and S. Wang and X. Wu"
, title =	"Optimal bipartitions of point sets"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"11--16"
, cites =	"aiks-fkpmd-91, abky-cabmm-88, a-dp-86, bh-cpcoe-89, c-acdl-83, dn-cgacp-85, eg-tsa-89, eos-calha-86, crw-gc-91, cgl-pgd-85, hs-ftp-91, mw-fobpp-91, ol-mcp-81, p-ortap-79, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{rw-oasdp-92
, author =	"J. Rokne and S. Z. Wang"
, title =	"An optimal algorithm for the set diameter problem in three dimensions"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Univ. Calgary"
, address =	"Calgary, AB"
, month =	jun
, year =	1992
, keywords =	"diameter, antipodal pair, polyhedra, three-dimensional, geometric transformations, reciprocal search"
}

@techreport{rww-lvirt-92
, author =	"J. Rokne and S. Z. Wang and X. Wu"
, title =	"The largest-volume inscribed rooted tetrahedron in a convex polyhedron"
, type =	"Research {Report}"
, number =	"92/471/09"
, institution =	"Dept. Comput. Sci., Univ. Calgary"
, address =	"Calgary, AB"
, month =	mar
, year =	1992
, keywords =	"design of algorithms, three-dimensional, tetrahedra, polyhedra, geometric transformations"
, abstract =	"Given a polyhedron with $n$ vertices, we present an
		 algorithm for finding the maximum tetrahedron rooted on
		 a face of the polyhedron in $O(n \log n)$ time. For the
		 result we need to discuss a class of reciprocal search
		 problems."
}

@article{rww-flsc-90
, author =	"J. G. Rokne and B. Wyvill and X. Wu"
, title =	"Fast line scan-conversion"
, journal =	"ACM Trans. Graph."
, volume =	9
, year =	1990
, pages =	"376--388"
, keywords =	"digital geometry, computer graphics, design of algorithms, approximation, incrementation, lines, two-dimensional, empirical analysis"
, update =	"94.05 smid"
, annote =	"``an overall gain in speed of about 4 over the
		 original Bresenham algorithm''"
}

@book{r-kl-76
, author =	"D. Rolfsen"
, title =	"Knots and Links"
, publisher =	"Publish or Perish"
, address =	"Berkeley, CA"
, year =	1976
, update =	"97.11 bibrelex"
}

@phdthesis{r-att-92
, author =	"Kathleen Romanik"
, title =	"Approximate Testing Theory"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Maryland at College Park"
, address =	"College Park, MD"
, month =	aug
, year =	1992
, note =	"Technical Report CS-TR-2947/UMIACS-TR-92-89"
, keywords =	"doctoral thesis, probing, point probes, approximate testing"
, update =	"96.09 romanik"
}

@inproceedings{r-drvgh-95
, author =	"Kathleen Romanik"
, title =	"Directed Rectangle-Visibility Graphs have Unbounded Dimension"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"163--167"
, keywords =	"graph drawing, visibility, order"
, comments =	"To appear in Discrete Appl. Math."
, update =	"96.09 romanik, 95.09 jones"
}

@inproceedings{r-dvrgh-95
, author =	"K. Romanik"
, title =	"Directed VR-Representable Graphs have Unbounded Dimension"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"177--181"
, keywords =	"graph drawing, visibility, order"
, update =	"95.01 tamassia"
}

@techreport{r-gpts-95t
, author =	"Kathleen Romanik"
, title =	"Geometric Probing and Testing - A Survey"
, type =	"Technical {Report}"
, number =	"95-42"
, institution =	"DIMACS, Rutgers Univ."
, month =	sep
, year =	1995
, keywords =	"probing, testing"
, succeeds =	"r-gpts-95i"
, update =	"96.09 romanik"
}

@inproceedings{r-gpts-95i
, author =	"Kathleen Romanik"
, title =	"Geometric Probing and Testing - A Survey"
, booktitle =	"Proc. VI Congreso Espa{\~{n}}ol de Geometria Computacional"
, site =	"Barcelona, Spain"
, month =	jul
, year =	1995
, pages =	""
, keywords =	"probing, testing"
, precedes =	"r-gpts-95t"
, update =	"96.09 romanik"
}

@inproceedings{rs-tos-92
, author =	"K. Romanik and S. Salzberg"
, title =	"Testing orthogonal shapes"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"216--222"
, keywords =	"probing, point probes, testing, orthogonal"
, precedes =	"rs-tos-95"
, update =	"96.09 devillers+romanik"
}

@article{rs-tos-95
, author =	"Kathleen Romanik and Steven Salzberg"
, title =	"Testing Orthogonal Shapes"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"33--49"
, keywords =	"probing, point probes, testing, orthogonal"
, succeeds =	"rs-tos-92"
, update =	"96.09 devillers+romanik"
}

@inproceedings{rs-orlt-96
, author =	"Kathleen Romanik and Sven Schuierer"
, title =	"Optimal Robot Localization in Trees"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"264--273"
, keywords =	"localization, on-line"
, cites =	"bcr-sp-93, bbfy-olnr-94, brs-plue-93, brs-nugt-91, bc-olaip-93, drw-lrmt-95, gmr-rlptd-92, kp-caasu-93, k-lpmr-94, mawm-ancmr-89, py-spwm-89, sn-anpld-89, st-aelup-85, tpbhss-mbldo-90, yd-cgalr-88, ZZZ"
, update =	"97.11 bibrelex, 96.09 romanik, 96.05 efrat"
}

@inproceedings{rs-orlt-96c
, author =	"Kathleen Romanik and Sven Schuierer"
, title =	"Optimal Robot Localization in Trees"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"91--93"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{rs-tgo-90t
, author =	"K. Romanik and C. Smith"
, title =	"Testing Geometric Objects"
, type =	"Technical {Report}"
, number =	"UMIACS-TR-90-69"
, institution =	"University of Maryland, Institute for Advanced Computer Studies"
, month =	may
, year =	1990
, keywords =	"probing, point probes, testing"
, precedes =	"rs-tgo-90i"
, update =	"96.09 romanik, 93.09 milone+mitchell"
}

@inproceedings{rs-tgo-90i
, author =	"K. Romanik and C. Smith"
, title =	"Testing geometric objects"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"14--19"
, keywords =	"probing, point probes, testing"
, precedes =	"rs-tgo-94"
, cites =	"bbehw-clgcv-86, b-dscns-86, cy-sp-87, hw-ensrq-87, s-gp-88, v-tl-84, vc-ucrfe-71, ZZZ"
, update =	"98.07 bibrelex, 96.09 devillers+romanik, 94.05 smid"
}

@article{rs-tgo-94
, author =	"Kathleen Romanik and Carl Smith"
, title =	"Testing geometric objects"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"157--176"
, keywords =	"probing, point probes, testing"
, succeeds =	"rs-tgo-90i"
, update =	"96.09 devillers+romanik"
}

@inproceedings{rv-uclta-93
, author =	"K. Romanik and J. S. Vitter"
, title =	"Using Computational Learning Theory to Analyze the Testing Complexity of Program Segments"
, booktitle =	"Proceedings of the 17th Annual IEEE International Computer Software and Applications Conference"
, nickname =	"COMPSAC '93"
, month =	nov
, year =	1993
, pages =	"367--373"
, keywords =	"random testing, software complexity, Vapnik-Chervonenkis dimension, pseudo dimension"
, comments =	"To appear in Inform. Comput."
, update =	"96.09 romanik, 94.09 vitter"
}

@techreport{rggr-esaac-94
, author =	"B. Romney and C. Godard and M. Goldwasser and G. Ramkumar"
, title =	"An efficient system for analyzing assembly complexity"
, type =	"Manuscript"
, institution =	"Stanford Univ."
, address =	"Stanford, CA"
, year =	1994
, update =	"98.03 bibrelex"
}

@phdthesis{r-tclir-90
, author =	"J. T. Rompel"
, title =	"Techniques for Computing with Low-Independence Randomness"
, type =	"Ph.{D}. Thesis"
, school =	"Dept.\ of EECS, M.I.T."
, year =	1990
, keywords =	"doctoral thesis"
, update =	"96.09 orourke"
}

%, address =	"Oslo, Norway"
%, month =	sep
@article{rr-tmcps-94
, author =	"R. Ronfard and J. R. Rossignac"
, title =	"Triangulating multiply-connected polygons: A simple yet efficient algorithm"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	3
, year =	1994
, pages =	"C281--292"
, note =	"Proc. Eurographics '94"
, update =	"95.05 orourke"
}

@article{r-bdcc-89
, author =	"C. Ronse"
, title =	"A bibliography on digital and computational convexity"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	11
, year =	1989
, pages =	"181--190"
, keywords =	"bibliography"
, abstract =	"This bibliography collects over 350 references of
		 books, papers in serial journals, and conference
		 papers, on convexity in relation to computer science.
		 The subject is subdivided into five topics: convexity
		 and straightness in digital images; convex hull
		 algorithms and their complexity; other computational
		 problems related to convexity; miscellaneous
		 applications; general mathematical sources. These
		 references range in time from 1961 to September 1988."
}

@article{r-srsrf-77
, author =	"J. Rooney"
, title =	"A Survey of Representations of Spatial Rotation about a Fixed Point"
, journal =	"Environment and Planning B"
, volume =	4
, year =	1977
, pages =	"185--210"
, update =	"98.11 bibrelex"
}

@phdthesis{r-dvd-91
, author =	"T. Roos"
, title =	"Dynamic {Voronoi} diagrams"
, type =	"Ph.{D}. Thesis"
, school =	"Bayerische Julius-Maximilians-Univ."
, address =	"W{\"u}rzburg, Germany"
, month =	sep
, year =	1991
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{r-knnvd-89
, author =	"T. Roos"
, title =	"$k$-Nearest-Neighbor {Voronoi} Diagrams for Sets of Convex Polygons, Line Segments and Points"
, booktitle =	"Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	411
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"330--340"
, update =	"99.11 bibrelex, 98.11 smid, 94.05 smid, 93.09 milone+mitchell"
}

@inproceedings{r-knnvd-89c
, author =	"T. Roos"
, title =	"{$k$}-Nearest-Neighbor {Voronoi} Diagrams for Sets of Convex Polygons, Line Segments, and Points"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{r-tbvdm-93
, author =	"T. Roos"
, title =	"Tighter bounds on {Voronoi} diagrams of moving points"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"358--363"
, cites =	"ar-vdmph-92, e-acg-87, fl-vdmpp-91, gs-pmgsc-85, gmr-vdmpp-92, hd-kgde-60, ii-vdmp-90, k-cddvd-80, o-cgc12-91a, r-vdds-90, r-dvd-91, r-vdds-93, ra-mphds-92, a-tddvd-91, s-cvdhd-82, ZZZ"
, update =	"99.11 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
}

@mastersthesis{r-vd-88
, author =	"T. Roos"
, title =	"Voronoi {Diagramme}"
, school =	"Universit{\"a}t W{\"u}rzburg"
, address =	"W{\"u}rzburg, West Germany"
, year =	1988
, note =	"Diploma Thesis"
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@inproceedings{r-vdds-90
, author =	"T. Roos"
, title =	"Voronoi diagrams over dynamic scenes"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"209--213"
, cites =	"agss-ltacv-87, ce-iacko-87, dl-gvdp-78, e-esaa-86, e-acg-87, f-savd-86, gkln-dvd-83, gs-pmgsc-85, hd-kgde-60, l-knnvd-82, n-cgia-88, ps-cgi-85, r-vd-88, r-knnvd-89, sh-cpp-75, y-oavds-87, ZZZ"
, update =	"98.07 bibrelex"
}

@article{r-vdds-93
, author =	"T. Roos"
, title =	"Voronoi diagrams over dynamic scenes"
, journal =	"Discrete Appl. Math."
, volume =	43
, year =	1993
, pages =	"243--259"
, succeeds =	"r-vdds-90"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@inproceedings{ra-mphds-92
, author =	"T. Roos and G. Albers"
, title =	"Maintaining Proximity in Higher Dimensional Spaces"
, booktitle =	"Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
, site =	"Prague, Czechoslovakia"
, series =	"Lecture Notes Comput. Sci."
, volume =	629
, month =	aug
, year =	1992
, pages =	"483--493"
, update =	"98.11 bibrelex"
}

@inproceedings{rn-dvdmp-91
, author =	"Thomas Roos and Hartmut Noltemeier"
, title =	"Dynamic {Voronoi} diagrams in motion planning"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"227--236"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@incollection{rn-dvdmp-92
, author =	"T. Roos and H. Noltemeier"
, title =	"Dynamic {Voronoi} diagrams in motion planning"
, booktitle =	"Proc. 15th IFIP Conf."
, series =	"Lecture Notes in Control and Information Science"
, volume =	180
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"102--111"
, update =	"94.01 rote"
}

@techreport{rw-cmkla-92
, author =	"T. Roos and P. Widmayer"
, title =	"Computing the minimum of the $k$-level of an arrangement with applications"
, type =	"Report"
, number =	185
, institution =	"Inst. Inform., Eidgen{\"o}ssische Tech. Hochschule Z{\"u}rich"
, address =	"Z{\"u}rich, Switzerland"
, year =	1992
, update =	"93.05 smid"
}

@article{rw-cmkla-94
, author =	"T. Roos and P. Widmayer"
, title =	"$k$-violation linear programming"
, journal =	"Inform. Process. Lett."
, volume =	52
, year =	1994
, pages =	"109--114"
, update =	"98.07 agarwal"
}

@inproceedings{rm-vvdgv-94
, author =	"Waldir L. Roque and Clovis Maliska Jr."
, title =	"Visualization of {Vorononi} Diagrams Generated by {VORONOI2}"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"8--11"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{rt-adsrc-98
, author =	"Llu{\'\i}s Ros and Frederico Thomas"
, title =	"Applying Delta/Star Reductions for Checking the Spatial Realizability of Line Drawings"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"127--129"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{r-aadss-74
, author =	"D. Roselle"
, title =	"An algorithmic approach to {Davenport--Schinzel} sequences"
, journal =	"Utilitas Math."
, volume =	6
, year =	1974
, pages =	"91--93"
, update =	"95.09 agarwal"
}

% ### others?
@inproceedings{rs-rdss-70
, author =	"D. Roselle and R. Stanton"
, title =	"Results on {Davenport--Schinzel} sequences"
, editor =	"R. Mullin and others"
, booktitle =	"Congressus Numer. I, Proc. Louisiana Conf. on Combinatorics, Graph Theory, and Computing"
, year =	1970
, pages =	"249--267"
, update =	"95.09 agarwal"
}

@article{rs-spdss-71
, author =	"D. Roselle and R. Stanton"
, title =	"Some properties of {Davenport--Schinzel} sequences"
, journal =	"Acta Arithmetica"
, volume =	17
, year =	1971
, pages =	"355--362"
, update =	"95.09 agarwal"
}

@article{r-tdvcs-83
, author =	"A. L. Rosenberg"
, title =	"Three-Dimensional {VLSI}: a case study"
, journal =	"J. ACM"
, volume =	30
, number =	3
, year =	1983
, pages =	"397--416"
, keywords =	"graph drawing, 3D, orthogonal"
, update =	"96.09 tamassia"
}

@article{rl-cvp-73
, author =	"B. Rosenberg and D. J. Landridge"
, title =	"A computational view of perception"
, journal =	"Perception"
, volume =	2
, year =	1973
, pages =	"415--424"
}

@mastersthesis{r-licab-90
, author =	"C. Rosenberg"
, title =	"A lossy image compression algorithm based on nonuniform sampling and interpolation of image intensity surfaces"
, school =	"Electrical Engineering and Computer Science, Mass. Inst. of Tech."
, year =	1990
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@article{rs-lbatc-75
, author =	"I. G. Rosenberg and F. Stenger"
, title =	"A lower bound on the angles of triangles constructed by bisecting the longes side"
, journal =	"Math. Comput."
, volume =	29
, year =	1975
, pages =	"390--395"
, update =	"98.11 bibrelex"
}

@mastersthesis{r-okvds-88
, author =	"H. Rosenberger"
, title =	"Order $k$ {Voronoi} diagrams of sites with additive weights in the plane"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1988
, note =	"Report UIUCDCS-R-88-1431"
, keywords =	"discrete and computational geometry, Voronoi diagrams, order-$k$, additive weight, combinatorial complexity, plane-sweep"
, precedes =	"r-okvds-91"
, update =	"93.05 jones"
}

@article{r-okvds-91
, author =	"H. Rosenberger"
, title =	"Order $k$ {Voronoi} diagrams of sites with additive weights in the plane"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"153--181"
, succeeds =	"r-okvds-88"
}

@techreport{r-tvgps-85
, author =	"H. Rosenberger"
, title =	"Topological versus geometrical plane-sweep"
, type =	"Manuscript"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1985
}

@article{rs-shs-82
, author =	"J. Rosenblatt and P. Seymour"
, title =	"The structure of homometric sets"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	3
, number =	3
, year =	1982
, pages =	"343--350"
, update =	"97.11 bibrelex"
}

@inproceedings{rr-mcp-92
, author =	"A. Rosenbloom and D. Rappaport"
, title =	"Moldable and castable polygons"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"322--327"
, precedes =	"rr-mcp-94"
, cites =	"cd-icott-87, hs-ompc-91, ll-ccmp-84, ps-cgi-85, ps-tspm-81, crs-mpc-90, ZZZ"
, update =	"98.07 bibrelex, 96.09 devillers"
}

@article{r-cdp-70
, author =	"A. Rosenfeld"
, title =	"Connectivity in digital pictures"
, journal =	"J. ACM"
, volume =	17
, year =	1970
, pages =	"146--160"
}

@inproceedings{r-dg-92
, author =	"A. Rosenfeld"
, title =	"Digital geometry"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	73
, cites =	"ZZZ"
, update =	"97.11 bibrelex"
}

@article{r-dsls-74
, author =	"A. Rosenfeld"
, title =	"Digital straight line segments"
, journal =	"IEEE Trans. Comput."
, volume =	"C-23"
, year =	1974
, pages =	"1264--1269"
, update =	"97.11 bibrelex"
}

@article{rd-hcaat-83
, author =	"A. Rosenfeld and P. {De La Torre}"
, title =	"Histogram concavity analysis as an aid in threshold selection"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-13"
, year =	1983
, pages =	"231--235"
}

@book{rk-dpp-82
, author =	"A. Rosenfeld and A. C. Kak"
, title =	"Digital picture processing"
, volume =	"1--2"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1982
, update =	"98.07 bibrelex"
}

@article{rp-sodpp-66
, author =	"A. Rosenfeld and J. L. Pfaltz"
, title =	"Sequential operations in digital picture processing"
, journal =	"J. ACM"
, volume =	13
, year =	1966
, pages =	"471--494"
}

@techreport{rssw-ahdsg-82
, author =	"A. Rosenfeld and H. Samet and C. Shaffer and R. E. Webber"
, title =	"Application of hierarchical data structures to geographical information systems"
, type =	"Computer Science"
, number =	"TR--1197"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	jun
, year =	1982
, update =	"96.05 efrat"
}

@techreport{rssw-ahdsg-83
, author =	"A. Rosenfeld and H. Samet and C. Shaffer and R. E. Webber"
, title =	"Application of hierarchical data structures to geographical information systems: phase II"
, type =	"Computer Science Department"
, number =	"TR--1327"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	sep
, year =	1983
, update =	"96.05 efrat"
}

@book{rs-sp-77
, author =	"B. A. Rosenfeld and N. D. Sergeeva"
, title =	"Stereographic Projection"
, publisher =	"Mir Publishers"
, address =	"Moscow"
, year =	1977
, update =	"98.03 bibrelex"
}

@article{rsl-ashts-77
, author =	"D. J. Rosenkrantz and R. E. Stearns and P. M. Lewis"
, title =	"An analysis of several heuristics for the traveling salesman problem"
, journal =	"SIAM J. Comput."
, volume =	6
, year =	1977
, pages =	"563--581"
, succeeds =	"rsl-aatsp-74"
}

@inproceedings{rsl-aatsp-74
, author =	"D. J. Rosenkrantz and R. E. Stearns and P. M. Lewis"
, title =	"Approximate algorithms for the traveling salesperson problem"
, booktitle =	"Proc. 15th Annu. IEEE Sympos. Switching Automata Theory"
, year =	1974
, pages =	"33--42"
, precedes =	"rsl-ashts-77"
}

@incollection{r-ppdti-84
, author =	"P. Rosenstiehl"
, title =	"Planar permutations defined by two intersecting {Jordan} Curves"
, booktitle =	"Graph Theory and Combinatorics"
, publisher =	"Academic Press"
, address =	"London, UK"
, year =	1984
, pages =	"259--271"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{rt-gcphg-84
, author =	"P. Rosenstiehl and R. E. Tarjan"
, title =	"Gauss codes, planar {Hamiltonian} graphs, and stack-sortable permutations"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"375--390"
, update =	"98.03 bibrelex"
}

@article{rt-rplbo-86
, author =	"P. Rosenstiehl and R. E. Tarjan"
, title =	"Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs"
, journal =	"Discrete Comput. Geom."
, volume =	1
, number =	4
, year =	1986
, pages =	"343--353"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@phdthesis{r-bosm-85
, author =	"J. Rossignac"
, title =	"Blending and Offsetting Solid Models"
, school =	"Dept. Elect. Engrg., Univ. Rochester"
, address =	"Rochester, NY"
, month =	jul
, year =	1985
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@incollection{ro-sdimp-89i
, author =	"J. Rossignac and M. O'Connor"
, title =	"SGC: {A} dimension-independent model for pointsets with internal structures and incomplete boundaries"
, editor =	"M. Wozny and J. Turner and K. Preiss"
, booktitle =	"Geometric Modeling for Product Engineering"
, publisher =	"North-Holland"
, year =	1989
, precedes =	"or-sdimp-89t"
, update =	"98.07 bibrelex"
}

@article{rr-crbsm-84
, author =	"J. Rossignac and A. Requicha"
, title =	"Constant Radius Blending in Solid Modeling"
, journal =	"Computers in Mechanical Engineering"
, volume =	2
, year =	1984
, pages =	"655--673"
, update =	"98.03 bibrelex"
}

@article{rr-oosm-86
, author =	"J. Rossignac and A. Requicha"
, title =	"Offsetting operations in solid modeling"
, journal =	"Comput. Aided Geom. Design"
, volume =	3
, year =	1986
, pages =	"129--148"
, update =	"98.07 bibrelex"
}

@inproceedings{r-cirfd-89
, author =	"J. R. Rossignac"
, title =	"Considerations on the interactive rendering of four-dimensional volumes"
, booktitle =	"CH Volume Visualization Workshop"
, year =	1989
, pages =	"67--76"
, update =	"98.07 bibrelex"
}

@inproceedings{r-cfitf-96
, author =	"J. R. Rossignac"
, title =	"CSG formulations for identifying and for trimming faces of {CSG} models"
, booktitle =	"CSG'96"
, site =	"Winchester, UK"
, publisher =	"Information Geometers"
, month =	apr
, year =	1996
, update =	"98.07 bibrelex"
}

@techreport{rb-mr3da-92
, author =	"J. R. Rossignac and P. Borrel"
, title =	"Multi-Resolution {3D} Approximations for Rendering Complex Scenes"
, type =	"Technical {Report}"
, number =	"RC 17697 (\#77951)"
, institution =	"IBM Research Division, T. J. Watson Research Center"
, address =	"Yorktown Heights, NY 10958"
, year =	1992
, update =	"95.01 mitchell"
}

@article{rr-pccgm-87
, author =	"J. R. Rossignac and A. A. G. Requicha"
, title =	"Piecewise-circular curves for geometric modeling"
, journal =	"IBM J. Res. Develop."
, volume =	31
, year =	1987
, pages =	"296--313"
}

@techreport{rv-azcsg-86
, author =	"J. R. Rossignac and H. B. Voelcker"
, title =	"Active zones in constructive solid geometry for redundancy and interference detection"
, type =	"Report"
, number =	"RC 11991 (\#53914)"
, institution =	"Auto. Res. Sci., IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1986
, keywords =	"computer graphics"
}

@techreport{rv-azcab-88
, author =	"J. R. Rossignac and H. B. Voelcker"
, title =	"Active Zones in {CSG} for Accelerating Boundary Evaluation, Redundancy Evaluation, Interference Detection, and Shading Algorithms"
, number =	"RC-13490"
, institution =	"IBM Thomas J. Watson Research Center"
, address =	"Yorktown Heights, NY 10598, USA"
, month =	feb
, year =	1988
, comments =	"appears in ACM Trans. on Graphics, Jan '89"
, update =	"93.09 held"
}

@inproceedings{r-cfecp-92
, author =	"V. Rosta"
, title =	"Combinatorial face enumeration in convex polytopes"
, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
, site =	"Kyoto, Japan"
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{r-nmbph-92
, author =	"G{\"u}nter Rote"
, title =	"A new metric between polygons, and how to compute it"
, booktitle =	"Proc. 19th Internat. Colloq. Automata Lang. Program."
, series =	"Lecture Notes Comput. Sci."
, volume =	623
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"404--415"
, keywords =	"bounded Lipschitz distance, Kantorovich Rubinshtein metric, transportation metric"
, update =	"98.03 mitchell, 97.03 rote, 96.05 agarwal, 93.09 milone+mitchell+rote"
, abstract =	"The bounded Lipschitz distance can be used as a distance
		measure between polygons or between functions. It has several
		properties which make it attractive to use from the viewpoint of
		applications like pattern matching or quality control of woven
		fabrics. There are several alternative definitions of the metric,
		some of which are interesting in their own right. The bounded
		Lipschitz distance is related to the Monge-Kantorovich mass
		transfer problem, whose history goes back to 18th century work
		of G. Monge and to L. Kantorovitch.
		We also give an algorithm for computing the metric, and we
		discuss possible implementations."
}

@article{r-cmhdb-91
, author =	"G{\"u}nter Rote"
, title =	"Computing the minimum {Hausdorff} distance between two point sets on a line under translation"
, journal =	"Inform. Process. Lett."
, volume =	38
, number =	3
, month =	may
, year =	1991
, pages =	"123--127"
, keywords =	"pattern recognition, pattern matching"
, cites =	"hk-cmhdp-90"
, update =	"98.11 bibrelex, 98.03 mitchell, 94.01 rote, 93.09 rote"
, abstract =	"Given two sets of points on a line, we want to translate
		 one of them so that their Hausdorff distance (the maximum
		 of the distances from a point in any of the sets to the
		 nearest point in the other set) is as small as possible.
		 We present an optimal $O(n \log n)$ algorithm for this
		 problem."
}

@article{r-cic-94
, author =	"G{\"u}nther Rote"
, title =	"Curves with increasing chords"
, journal =	"Math. Proc. Camb. Phil. Soc."
, volume =	115
, year =	1994
, pages =	"1--12"
, update =	"99.03 bibrelex, 97.03 icking"
}

@inproceedings{r-dchhd-92
, author =	"G{\"u}nter Rote"
, title =	"Degenerate convex hulls in high dimensions without extra storage"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"26--32"
, cites =	"af-pachv-91, bcn-drg-89, ck-acp-70, chj-ololv-91, cjr-cdtsp-90, mr-scmfa-80, p-pc-89, s-lpchm-90, sw-cblpr-92, s-fchff-85, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 rote"
}

@inproceedings{r-qcsaa-90
, author =	"G. Rote"
, title =	"Quadratic convergence of the sandwich algorithms for approximating convex functions and convex figures in the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, site =	"Ottawa, ON"
, year =	1990
, pages =	"120--124"
, update =	"98.03 bibrelex"
}

@inproceedings{r-crsaa-90
, author =	"G. Rote"
, title =	"The convergence rate of the {Sandwich} algorithm for approximating convex figures in the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"287--290"
, precedes =	"r-crsaa-92"
, cites =	"bhr-saucf-91, c-ocfpl-71, cy-sp-87, e-acg-87, fmrwy-sioas-90, fmrwy-sioas-92, fbr-accab-89, g-acb-83, ii-oaapl-86a, m-jtlfe-62, mv-papcb-75, s-sooau-84, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 rote"
}

@article{r-crsaa-92
, author =	"G{\"u}nter Rote"
, title =	"The convergence rate of the {Sandwich} algorithm for approximating convex functions"
, journal =	"Computing"
, volume =	48
, year =	1992
, pages =	"337--361"
, succeeds =	"r-crsaa-90"
, cites =	"bhr-saucf-91"
, update =	"98.03 mitchell, 97.03 rote"
, abstract =	"The Sandwich algorithm approximates a convex function of
		one variable over an interval by evaluating the function and its
		derivative at a sequence of points. The connection of the
		obtained points is a piecewise linear upper approximation, and
		the tangents yield a piecewise linear lower approximation.
		Similarly, a PLANAR CONVEX FIGURE can be approximated by
		convex polygons.
		Different versions of the Sandwich algorithm use different rules
		for selecting the next evaluation point. We consider four natural
		rules (interval bisection, slope bisection, maximum error rule,
		and chord rule) and show that the global approximation error
		with $n$ evaluation points decreases by the order of $O(1/n^2)$,
		which is optimal."
}

@article{r-nltsp-92
, author =	"G{\"u}nter Rote"
, title =	"The {$N$}-line traveling salesman problem"
, journal =	"Networks"
, volume =	22
, year =	1992
, pages =	"91--108"
, keywords =	"optimization"
, comments =	"replaces the techreport r-nltsp-88"
, update =	"98.03 mitchell, 96.05 efrat, 93.09 rote"
, annote =	"For the 3-line TSP, see ddl-chlts-92"
, abstract =	"The special case of the Euclidean traveling salesman problem,
		 where the $n$ given points lie on a small number ($N$)
		 of parallel lines in the plane, is solved by a dynamic
		 programming approach in $O(n^N)$ time, for fixed $N$, ..."
}

@inproceedings{rss-mawsp-93
, author =	"G{\"u}nter Rote and C. Schwarz and J. Snoeyink"
, title =	"Maintaining the approximate width of a set of points in the plane"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"258--263"
, succeeds =	"s-sdmwp-92"
, cites =	"hs-asdch-90, ht-cws-85, ht-cws-88, j-mwdpp-91, ks-tpscv-93, ks-ccssb-93, m-dea-86, mn-dfc-90, ol-mcp-81, p-ortap-79, s-sdmwp-92, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 rote, 94.01 rote+smid, 93.09 rote"
, abstract =	"We maintain the set of points under insertions and deletions of
		points and we are able to report an approximation of the width
		of this dynamic point set. Our data structure takes linear space
		and allows for reporting the approximation with relative
		accuracy $\epsilon$ in $O(sqrt(1/\epsilon)log n)$ time; and the
		update time is $O(\log^2 n)$. The method uses the tentative
		prune-and-search strategy of Kirkpatrick and Snoeyink."
}

@article{rt-sdapa-95
, author =	"G{\"u}nter Rote and Robert Franz Tichy"
, title =	"Spherical Dispersion with an Application to Polygonal Approximation of Curves"
, journal =	"Anz. {\"O}sterreich. Akad. Wiss., Math.-natur. Kl., Abt. II"
, volume =	132
, year =	1995
, pages =	"3--10"
, update =	"97.03 rote"
, abstract =	"We describe and analyze a procedure for the polygonal
		approximation of spatial curves using well-distributed
		points on the sphere. Here the dispersion of the point set
		with respect to spherical slices (intersections of two
		half-spheres) plays a role."
}

@techreport{rw-cmlps-89
, author =	"G{\"u}nter Rote and G. Woeginger"
, title =	"Computing a minimum link path among a set of obstacles in the plane"
, type =	"Manusript"
, institution =	"Tech. Univ. Graz"
, year =	1989
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{rw-cckgp-92
, author =	"G{\"u}nter Rote and G. Woeginger"
, title =	"Counting Convex $k$-gons in Planar Point Sets"
, journal =	"Inform. Process. Lett."
, volume =	41
, year =	1992
, pages =	"191--194"
, keywords =	"convexity, combinatorics"
, cites =	"rwzw-cksck-91"
, update =	"98.03 mitchell, 97.11 bibrelex, 97.03 rote, 94.01 rote"
, annote =	"complexity was improved by the techniques
		 of eorw-fmakg-92, see mrsw-ccppp-95"
}

@techreport{rw-gc-89
, author =	"G. Rote and G. Woeginger"
, title =	"Geometric clusterings"
, type =	"Technical Report"
, number =	"B-89-04"
, institution =	"Freie Universit{\"a}t Berlin"
, month =	apr
, year =	1989
, note =	"Serie B-Informatik"
, precedes =	"crw-gc-90, crw-gc-91"
, update =	"98.07 bibrelex"
}

@article{rwzw-cksck-91
, author =	"G{\"u}nter Rote and G. Woeginger and Binhai Zhu and Zhengyan Wang"
, title =	"Counting $k$-subsets and convex $k$-gons in the plane"
, journal =	"Inform. Process. Lett."
, volume =	38
, year =	1991
, pages =	"149--151"
, update =	"98.03 mitchell, 97.03 rote, 94.01 rote"
, annote =	"improved by rw-cckgp-92, further improved by the
		 techniques of eorw-fmakg-92, see mrsw-ccppp-95"
}

@article{r-id-54
, author =	"K. F. Roth"
, title =	"On irregularities of distribution"
, journal =	"Mathematica"
, volume =	1
, year =	1954
, pages =	"73--79"
, update =	"98.03 bibrelex"
}

@article{r-rcms-82
, author =	"S. D. Roth"
, title =	"Ray Casting for Modeling Solids"
, journal =	"Comput. Graph. Image Process."
, volume =	18
, year =	1982
, pages =	"109--144"
, update =	"93.09 goodrich"
}

@inproceedings{r-aohr-90
, author =	"Christoph Rothe"
, title =	"{Algorithmen} in einem optimierten hierarchischen {Raumraster}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	21
, update =	"00.03 bibrelex"
}

@article{rs-tchnp-85
, author =	"B. L. Rothschild and E. G. Straus"
, title =	"On triangulations of the convex hull of $n$ points"
, journal =	"Combinatorica"
, volume =	5
, year =	1985
, pages =	"167--179"
}

@book{r-iat-88
, author =	"J. J. Rotman"
, title =	"An Introduction to Algebraic Topology"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1988
, update =	"98.03 bibrelex"
}

@article{r-almnt-88
, author =	"J.-P. Roudneff"
, title =	"Arrangements of lines with a minimum number of triangles are simple"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"97--102"
}

@book{rs-iplt-72
, author =	"C. P. Rourke and B. J. Sanderson"
, title =	"Introduction to Piecewise-Linear Topology"
, publisher =	"Springer-Verlag"
, year =	1972
, update =	"97.11 bibrelex"
}

@article{r-msr-84
, author =	"P. J. Rousseeuw"
, title =	"Least median of squares regression"
, journal =	"J. Amer. Statist. Assoc."
, volume =	79
, number =	388
, month =	dec
, year =	1984
, pages =	"871--880"
, update =	"98.07 bibrelex"
}

@techreport{rh-dah-98
, author =	"Peter J. Rousseeuw and Mia Hubert"
, title =	"Depth in an Arrangement of Hyperplanes"
, type =	"Manuscript"
, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
, month =	may
, year =	1998
, comments =	"To appear, Discrete Comput. Geom."
, update =	"98.07 mitchell"
, abstract =	"A collection of n hyperplanes in Rp forms a hyperplane
arrangement. The depth of any point $\theta$ in Rp is the smallest
number of hyperplanes intersected by any halfline emanating from
$\theta$. For p=2 we prove that there always exists a point $\theta$
with depth at least n/3. For higher dimensions we conjecture that the
maximal depth is at least n/(p+1). For arrangements in general
position, also an upper bound on the maximal depth is
established. Finally, we discuss algorithms to compute points with
maximal depth."
}

@techreport{rh-rd-96
, author =	"Peter J. Rousseeuw and Mia Hubert"
, title =	"Regression Depth"
, type =	"Manuscript"
, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
, year =	1996
, keywords =	"breakdown value, deepest fit, depth envelopes, halfspace depth, robust regression, simplicial depth"
, comments =	"to appear, journal ??"
, update =	"98.07 mitchell"
, abstract =	"
In this paper we introduce a notion of depth in the regression
setting. It provides the `rank' of any line (plane), rather than ranks
of observations or residuals. In simple regression we can compute the
depth of any line by a fast algorithm. For any bivariate data set Zn
of size n there exists a line with depth at least n/3. The largest
depth in Zn can be used as a measure of linearity versus convexity. In
both simple and multiple regression we introduce the deepest fit,
which generalizes the univariate median and is equivariant for
monotone transformations of the response.  Throughout, the errors may
be skewed and heteroskedastic. We also consider depth-based regression
quantiles. They estimate the quantiles of y given x, as do the
Koenker-Bassett regression quantiles, but with the advantage of being
robust to leverage points. We explore the analogies between depth in
regression and in location, where Tukey's halfspace depth is a special
case of our general definition. Also Liu's simplicial depth can be
extended to the regression framework."
}

@book{rl-rrod-87
, author =	"P. J. Rousseeuw and A. M. Leroy"
, title =	"Robust Regression and Outlier Detection"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1987
, update =	"99.11 bibrelex, 98.07 bibrelex"
}

@incollection{rnm-nscrr-93
, author =	"P. J. Rousseeuw and N. S. Netanyahu and D. M. Mount"
, title =	"New statistical and computational results on the repeated median line"
, editor =	"S. Morgenthaler and E. Ronchetti and W. Stahel"
, booktitle =	"New Directions in Data Analysis and Robustness"
, publisher =	"Birkh{\"a}user-Verlag"
, address =	"Basel, Switzerland"
, year =	1993
, pages =	"177--194"
, update =	"98.07 mitchell, 93.09 milone+mitchell"
}

@techreport{rh-dah-97
, author =	"Peter J. Rousseeuw and Ida Ruts"
, title =	"Constructing the Bivariate {Tukey} Median"
, type =	"Manuscript"
, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
, year =	1997
, keywords =	"halfplane depth, robustness, Tukey depth"
, comments =	"Statistica Sinica, to appear"
, update =	"98.07 mitchell"
, abstract =	"The halfplane location depth of a point $\theta$ in R2
relative to a bivariate data set $X=\{x_1, x_2, ..., x_n\}$ is the
minimal number of observations in any closed halfplane that contains
$\theta$ (Tukey 1975). The halfplane median or Tukey median is the
$\theta$ with maximal depth k* (Donoho and Gasko 1992). If this
$\theta$ is not unique, the Tukey median is defined as the center of
gravity of the set of points with depth k*. In this paper we construct
two algorithms for computing the Tukey median. The first one is
relatively straightforward but quite slow, whereas the second (called
HALFMED) is much faster. A small simulation study is performed, and
some examples are given."
}

@techreport{rs-cldrd-98
, author =	"Peter J. Rousseeuw and Anja Struyf"
, title =	"Computing Location Depth and Regression Depth in Higher Dimensions"
, type =	"Manuscript"
, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
, year =	1998
, keywords =	"coordinate-free, multivariate ranks, robustness"
, comments =	"to appear, Statistics and Computing"
, update =	"98.07 mitchell"
, abstract =	"
The location depth (Tukey 1975) of a point $\theta$ relative to a
p-dimensional data set Z of size n is defined as the smallest number
of data points in a closed halfspace with boundary through
$\theta$;. For bivariate data, it can be computed in O(n log n) time
(Rousseeuw and Ruts 1996). In this paper we construct an exact
algorithm to compute the location depth in three dimensions in O(n2
log n) time. We also give an approximate algorithm to compute the
location depth in p dimensions in O(m p3 + m p n) time, where m is the
number of p-subsets used.
\par
Recently, Rousseeuw and Hubert (1996) defined the depth of a
regression fit. The depth of a hyperplane with coefficients
($\theta_1$,...,$\theta_p$) is the smallest number of residuals that
need to change sign to make ($\theta_1$,...,$\theta_p$) a nonfit. For
bivariate data (p=2) this depth can be computed in O(n log n) time as
well. We construct an algorithm to compute the regression depth of a
plane relative to a three-dimensional data set in $O(n^2 \log n)$
time, and another that deals with p=4 in $O(n^3 \log n)$ time. For
data sets with large n and/or p we propose an approximate algorithm
that computes the depth of a regression fit in $O(m p^3 + m p n + m n
\log n)$ time. For all of these algorithms, actual implementations are
made available."
}

@unpublished{rbd-srfcw-
, author =	"M. Roussille and V. Bruyere and P. Dufour"
, title =	"Search of repeated factors"
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@inproceedings{rbd-sdpc-90
, author =	"M. Roussille and V. Bruy{\`e}re and P. Dufour"
, title =	"Structure detection for polygon composition"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"152--155"
, cites =	"at-iacps-78, as-cvp-86, fw-utpf-81, gjpt-tsp-78, h-oafsp-86, k-dpsc-85, l-cw-83, rbd-srfcw-, t-mdsp-81, ZZZ"
, update =	"98.07 bibrelex"
}

@article{rd-gcpia-87
, author =	"M. Roussille and P. Dufour"
, title =	"Generation of convex polygons with individual angular constraint"
, journal =	"Inform. Process. Lett."
, volume =	24
, year =	1987
, pages =	"159--164"
}

@inproceedings{rkv-nnq-95
, author =	"N. Roussopoulos and S. Kelley and F. Vincent"
, title =	"Nearest Neighbor Queries"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1995
, pages =	"71--79"
, update =	"97.07 agarwal"
}

@inproceedings{rkr-cobiu-97
, author =	"N. Roussopoulos and Y. Kotidis and M. Roussopoulos"
, title =	"Cubetree: {O}rganization of and bulk incremental updates on the data cube"
, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
, year =	1997
, pages =	"89--99"
, update =	"97.07 agarwal"
}

@inproceedings{r-cr-94
, author =	"Jean-Christophe Roux"
, title =	"Curve reconstruction"
, editor =	"Pierre-Jean Laurent and A. {Le M{\'e}hant{\'e}} and L. L. Schumaker"
, booktitle =	"Curves and Surfaces in Geometric Design"
, publisher =	"A. K. Peters"
, address =	"Wellesley, MA"
, year =	1994
, pages =	"401--408"
, comments =	"curve reconstruction from scattered data points in the plane;
		locally uses best approximating circles;
		deals with cusps and self-intersections.
		best circles are formulated in such a way that the solution leads
		to an eigenvalue problem of a $4\times4$-matrix.
		see also the author's 1994 dissertation from Univ. Grenoble."
, update =	"98.07 rote"
}

@article{rdmmst-bdg-87
, author =	"L. A. Rowe and M. Davis and E. Messinger and C. Meyer and C. Spirakis and A. Tuan"
, title =	"A Browser for Directed Graphs"
, journal =	"Softw. -- Pract. Exp."
, volume =	17
, number =	1
, year =	1987
, pages =	"61--76"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{r-oomrp-97
, author =	"Neil C. Rowe"
, title =	"Obtaining Optimal Mobile-Robot Paths with Non-Smooth Anisotropic Cost Functions Using Qualitative-State Reasoning"
, journal =	"Internat. J. Robot. Res."
, volume =	16
, number =	3
, month =	jun
, year =	1997
, pages =	"375--399"
, keywords =	"optimal paths, anisotropism, minimum-energy, friction, gravity, qualitative physics, cylinder"
, update =	"98.03 mitchell, 97.03 rowe"
}

@article{r-rroot-90
, author =	"N. C. Rowe"
, title =	"Roads, rivers, and obstacles: optimal two-dimensional path planning around linear features for a mobile agent"
, journal =	"Internat. J. Robot. Res."
, volume =	9
, year =	1990
, pages =	"67--73"
, keywords =	"shortest paths"
}

@article{rk-nmep-94
, author =	"N. C. Rowe and Y. Kanayama"
, title =	"Near-minimum energy paths on a vertical-axis cone with anisotropic friction and gravity effects"
, journal =	"Internat. J. Robot. Res."
, volume =	13
, year =	1994
, pages =	"408--432"
, keywords =	"optimal paths, minimum-energy, friction, gravity, qualitative physics, cone"
, update =	"97.03 rowe"
}

@inproceedings{rl-vppuo-89
, author =	"N. C. Rowe and D. H. Lewis"
, title =	"Vehicle path-planning using optics analogs for optimizing visibility and energy cost"
, booktitle =	"NASA Conference on Space Telerobotics"
, year =	1989
, pages =	"IV: 217--226"
, keywords =	"weighted regions, optimal paths, three dimensions, minimum-energy, visibility, aircraft"
, update =	"97.03 rowe"
}

@techreport{rr-nmopp-87
, author =	"N. C. Rowe and R. F. Richbourg"
, title =	"A new method for optimal path planning through nonhomogeneous free space"
, type =	"Technical {Report}"
, number =	"NPS52-87-003"
, institution =	"Comput. Sci. Dept., Naval Postgraduate School"
, address =	"Monterey, CA"
, year =	1987
, keywords =	"shortest paths, weights"
}

@article{rr-eslmo-90
, author =	"N. C. Rowe and R. F. Richbourg"
, title =	"An efficient {Snell}'s law method for optimal-path planning across multiple two-dimensional, irregular, homogeneous-cost regions"
, journal =	"Internat. J. Robot. Res."
, volume =	9
, year =	1990
, pages =	"48--66"
, keywords =	"shortest paths, weights"
}

@article{rr-ogfpp-90
, author =	"N. C. Rowe and R. Ross"
, title =	"Optimal grid-free path planning across arbitrarily-contoured terrain with anisotropic friction and gravity effects"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, year =	1990
, pages =	"540--553"
, keywords =	"optimal paths, anisotropism, minimum-energy, friction, gravity, qualitative physics, polyhedra"
, update =	"97.03 rowe"
}

@inproceedings{rs-gcumr-97
, author =	"Tom Roxborough and Arunabha Sen"
, title =	"Graph Clustering Using Multiway Ratio Cut"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"291--296"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{rlw-rdtrp-91
, author =	"U. Roy and C. R. Liu and T. C. Woo"
, title =	"Review of dimensioning and tolerancing: representation and processing"
, journal =	"Comput. Aided Design"
, volume =	23
, number =	7
, year =	1991
, pages =	"466--483"
, update =	"98.07 bibrelex"
}

@article{rz-epccm-92
, author =	"U. Roy and X. Zhang"
, title =	"Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error"
, journal =	"Comput. Aided Design"
, volume =	24
, number =	3
, year =	1992
, pages =	"161--168"
, update =	"97.03 agarwal"
}

@inproceedings{rb-fnipg-90
, author =	"V. P. Roychowdhury and J. Bruck"
, title =	"On finding non-intersecting paths in grids and its application in reconfiguring {VLSI}/{WSI} arrays"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"454--464"
}

@article{rbk-earvw-90
, author =	"V. P. Roychowdhury and J. Bruck and T. Kailath"
, title =	"Efficient algorithms for reconfiguration in {VLSI}/{WSI} arrays"
, journal =	"IEEE Trans. Comput."
, volume =	"??"
, year =	1990
, pages =	"480--489"
, update =	"98.07 bibrelex"
}

@book{r-ra-68
, author =	"H. Royden"
, title =	"Real Analysis"
, publisher =	"Macmillan"
, address =	"New York, NY"
, year =	1968
, update =	"97.11 bibrelex"
}

% ### number??
@inproceedings{rs-saapm-96
, author =	"D. Roytenberg and J.-R. Sack"
, title =	"A Simulator for the Alex-AVX Parallel Multi-Computer"
, booktitle =	"Proc. HPCS '96 Conference"
, site =	"Ottawa"
, number =	48
, year =	1996
, update =	"97.11 sack"
}

@techreport{r-ciarb-92t
, author =	"C. R{\"u}b"
, title =	"Computing intersections and arrangements for red-blue curve segments in parallel"
, type =	"Technical {Report}"
, number =	"MPI-I-92-108"
, institution =	"Max Planck Institut f{\"u}r Informatik"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
, precedes =	"r-ciarb-92"
, update =	"98.07 bibrelex"
}

@inproceedings{r-ciarb-92
, author =	"C. R{\"u}b"
, title =	"Computing intersections and arrangements for red-blue curve segments in parallel"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"115--120"
, succeeds =	"r-ciarb-92t"
, cites =	"abb-paa-90, acg-cdctd-89, am-dplr-91, ce-oails-88, cct-rpatd-91, g-ilspo-89, g-caop-91, gsg-pmvsp-90, hjw-epcah-90, ms-rcibt-88, r-pazbd-90, r-lsirp-92, r-ciarb-92t, ZZZ"
, update =	"98.07 bibrelex"
}

@article{r-lsirp-92
, author =	"C. R{\"u}b"
, title =	"Line-Segment Intersection Reporting in Parallel"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"119--144"
, update =	"96.09 orourke"
}

@techreport{r-plsir-89
, author =	"C. R{\"u}b"
, title =	"Parallel Line Segment Intersection Reporting"
, type =	"Manuscript"
, institution =	"??"
, year =	1989
, update =	"97.11 bibrelex"
}

@phdthesis{r-pazbd-90
, author =	"C. R{\"u}b"
, title =	"Parallele {Algorithmen} zum {Berechnen} der {Schnittpunkte} von {Liniensegmenten}"
, school =	"Univ. Saarbr{\"u}cken"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@article{rw-3drfr-80
, author =	"S. M. Rubin and T. Whitted"
, title =	"A $3$-dimensional representation for fast rendering of complex scenes"
, journal =	"Comput. Graph."
, volume =	14
, number =	3
, year =	1980
, pages =	"110--116"
, note =	"Proc. SIGGRAPH '80"
}

@unpublished{r-dcptr-94
, author =	"R. Rubinfeld"
, title =	"Designing Checkers for Programs that Run in Parallel"
, year =	1994
, note =	"Manuscript"
, update =	"97.11 bibrelex"
}

@article{rt-srccp-92
, author =	"J. H. Rubinstein and D. A. Thomas"
, title =	"The {Steiner} ratio conjecture for cocircular points"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"77--86"
}

@inproceedings{r-lbchd-93
, author =	"W. Rucklidge"
, title =	"Lower bounds for the complexity of the {Hausdorff} distance"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"145--150"
, cites =	"ast-apsgo-92, abb-amps-91, cghkkk-gpmem-93, hks-uevsi-91, ck-igpmp-92, hhk-tirgc-88, r-cmhdb-91, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@incollection{rzz-vvagf-
, author =	"A. Rudich and D. Zernik and G. Zodik"
, title =	"Visage --- Visualization of Attribute Graphs: A foundation for a Parallel Programming Environment"
, editor =	"J. J. Dongarra and B. Tourancheau"
, booktitle =	"Environments and Tools for Parallel Scientific Computing"
, publisher =	"North-Holland"
, pages =	"171--192"
, keywords =	"graph drawing"
, update =	"95.01 tamassia"
}

@article{r-utt-58
, author =	"M. E. Rudin"
, title =	"An Unshellable Triangulation of a Tetrahedron"
, journal =	"Bull. Amer. Math. Soc."
, volume =	64
, year =	1958
, pages =	"90--91"
, keywords =	"triangulation, three-dimensional, shellability"
, update =	"95.09 korneenko"
, annote =	"An example of a 3D triangulation with 14 points and 41
		 tetrahedra that cannot be built by sequentially adding
		 tetrahedrons."
}

@book{r-pma-76
, author =	"W. Rudin"
, title =	"Principles of Mathematical Analysis"
, edition =	"3rd"
, publisher =	"McGraw-Hill"
, address =	"New York, NY"
, year =	1976
, update =	"98.03 bibrelex"
}

@article{r-snsls-82
, author =	"S. M. Rump"
, title =	"Solving nonlinear systems with least significant bit accuracy"
, journal =	"Computing"
, volume =	29
, year =	1982
, pages =	"183--200"
, update =	"98.03 bibrelex"
}

@article{rb-lsbea-83
, author =	"S. M. Rump and H. B{\"o}hm"
, title =	"Least significant bit evaluation of arithmetic expressions in single-precision"
, journal =	"Computing"
, volume =	30
, number =	3
, year =	1983
, pages =	"189--199"
, update =	"98.03 bibrelex"
}

@article{r-svp-66
, author =	"H. {Rumsey, Jr.}"
, title =	"Sets of visible points"
, journal =	"Duke Math. J."
, volume =	33
, year =	1966
, pages =	"263--274"
, update =	"97.11 bibrelex"
}

@article{r-draq2d-95
, author =	"J. Ruppert"
, title =	"A {Delaunay} Refinement Algorithm for Quality 2-Dimensional Mesh Generation"
, journal =	"J. Algorithms"
, volume =	18
, year =	1995
, pages =	"548--585"
, update =	"01.07 devillers, 00.03 devillers"
}

@techreport{r-nsaq2-92
, author =	"J. Ruppert"
, title =	"A new and simple algorithm for quality $2$-dimensional mesh generation"
, type =	"Report"
, number =	"UCB/CSD 92/694"
, institution =	"Univ. California"
, address =	"Berkeley, CA"
, year =	1992
, update =	"98.03 bibrelex"
}

@inproceedings{r-nsaq2-93
, author =	"J. Ruppert"
, title =	"A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"83--92"
, update =	"93.05 smid"
}

@inproceedings{rs-addce-91
, author =	"J. Ruppert and R. Seidel"
, title =	"Approximating the $d$-dimensional complete {Euclidean} graph"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"207--210"
, cites =	"c-tipga-86, dfs-dgaag-90, t-nrtpc-83, k-aceg-88, kg-dtcac-89, m-dsa-84, ps-gs-89, r-css-63, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{rs-dt3dn-89
, author =	"J. Ruppert and R. Seidel"
, title =	"On the difficulty of tetrahedralizing $3$-dimensional non-convex polyhedra"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"380--392"
, precedes =	"rs-dttdn-92"
, cites =	"ae-tpss-87, bd-cdsp-89, c-cgc-79, cp-tncp-89, ctv-flvat-88i, cr-cpih-88, epw-tpstd-86, gj-cigtn-79, o-agta-87, os-snhpd-83, ps-cgi-85, s-udzvd-28, tv-otats-88, h-fssp-81, ZZZ"
, update =	"98.03 bibrelex"
}

@article{rs-dttdn-92
, author =	"J. Ruppert and R. Seidel"
, title =	"On the difficulty of triangulating three-dimensional non-convex polyhedra"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"227--253"
, succeeds =	"rs-dt3dn-89"
}

@article{r-cmop-97
, author =	"D. Rus"
, title =	"Coordinated Manipulation of Objects in a Plane"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"129--147"
, update =	"97.07 held"
}

@inproceedings{r-drp-90
, author =	"D. Rus"
, title =	"Dexterous rotations of polygons"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"147--151"
, precedes =	"r-drp-91"
, cites =	"b-sgtfp-88, b-igs-85, b-edrhu-87, c-rgfm-85, e-mpu-84, kkmy-qstam-89, m-mgpo-82, ms-rhmm-85, mss-esmpg-87, ms-sdsgi-89, n-ssfcg-86, p-mh-85, y-gt-68, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{r-drp-91
, author =	"D. Rus"
, title =	"On dexterous rotations of polygons"
, type =	"Technical {Report}"
, number =	"TR~91-1258"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	dec
, year =	1991
, succeeds =	"r-drp-90"
}

@incollection{r-spct-97
, author =	"J. A. Rush"
, title =	"Sphere packing and coding theory"
, chapter =	50
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"917--932"
, update =	"97.11 orourke"
}

@article{r-algcc-75
, author =	"D. Rutovitz"
, title =	"An algorithm for in-line generation of a convex cover"
, journal =	"Comput. Graph. Image Process."
, volume =	4
, year =	1975
, pages =	"74--78"
}

@article{rr-cdcbp-96
, author =	"Ida Ruts and Peter J. Rousseeuw"
, title =	"Computing Depth Contours of Bivariate Point Clouds"
, journal =	"Computational Statistics and Data Analysis"
, volume =	23
, year =	1996
, pages =	"153--168"
, keywords =	"k-sets, classification, graphical display, ranks, robustness"
, update =	"98.07 mitchell"
, abstract =	"In this paper we construct an exact algorithm for
computing depth contours of a bivariate data set.  For this we use the
halfspace depth introduced by Tukey. The depth contours form a nested
collection of convex sets. The deeper the contour, the more robust it
is with respect to outliers in the point cloud. The proposed algorithm
has been implemented in a program called ISODEPTH, which needs little
computation time and is illustrated on some real data
examples. Finally, it is shown how depth contours can be used to
construct robustified versions of classification techniques based on
convex hulls."
}

@inproceedings{rms-isdg-97
, author =	"K. Ryall and J. Marks and S. Shieber"
, title =	"An Interactive System for Drawing Graphs"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1190
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"387--393"
, keywords =	"graph drawing, constraints, interactive"
, update =	"98.07 tamassia+vismara"
}

@book{ahet-nggcf-91
, title =	"Numerical Grid Generation in Computational Fluid Dynamics and Related Fields"
, editor =	"A. S.-Arcilla and J. Hauser and P. R. Eiseman and J. F. Thompson"
, publisher =	"North-Holland"
, address =	"New York, New York"
, year =	1991
, update =	"98.11 bibrelex"
}

@inproceedings{s-ccops-90
, author =	"A. Saalfeld"
, title =	"Canonical cyclic orderings for point sets in the plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"32--35"
, cites =	"ahu-dsa-83, e-acg-87, gj-cigtn-79, k-ss-65, ps-cgi-85, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{s-der-91
, author =	"A. Saalfeld"
, title =	"Delaunay edge refinements"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"33--36"
, cites =	"c-cdt-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{s-dceat-89
, author =	"A. Saalfeld"
, title =	"Divide-and-conquer in early algebraic topology: the {Mayer}-{Vietoris} exact homology sequence revisited"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	11
}

@inproceedings{s-jttm-87
, author =	"A. Saalfeld"
, title =	"Joint triangulations and triangulation maps"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"195--204"
, cites =	"c-tpc-79, gp-ms-83, ghlst-ltavs-86, l-aat-75, ps-cgi-85, wg-plrsm-85, w-tachm-83, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{s-mggdp-95
, author =	"A. Saalfeld"
, title =	"Map Generalization as a Graph Drawing Problem"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"444--451"
, keywords =	"graph drawing, cartography, planar"
, update =	"95.01 tamassia"
}

@article{s-gm-60
, author =	"G. Sabidussi"
, title =	"Graph Multiplication"
, journal =	"Math. Z."
, volume =	72
, year =	1960
, pages =	"446--457"
, update =	"97.11 bibrelex"
}

@article{s-ggggg-57
, author =	"G. Sabidussi"
, title =	"Graphs with a Given Group and Given Graph Theoretical Properties"
, journal =	"Canad. J. Math."
, volume =	9
, year =	1957
, pages =	"515--525"
, update =	"97.11 bibrelex"
}

@article{s-mogga-59
, author =	"G. Sabidussi"
, title =	"On the Minimum Order of Graphs with a Given Automorphism Group"
, journal =	"Monatsh. Math."
, volume =	63
, year =	1959
, pages =	"124--127"
, update =	"97.11 bibrelex"
}

@article{s-cg-59
, author =	"G. Sabidussi"
, title =	"The Composition of Graphs"
, journal =	"Duke Math. J."
, volume =	26
, year =	1959
, pages =	"693--696"
, update =	"97.11 bibrelex"
}

@incollection{s-crmsd-80
, author =	"M. A. Sabin"
, title =	"Contouring---{A} Review of Methods for Scattered Data"
, editor =	"K. W. Brodlie"
, booktitle =	"Mathematical Methods in Computer Graphics and Design"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1980
, pages =	"105--121"
, annote =	"Suggests best method is Delaunay triangulation with
		 linear or $C^1$ interpolation on triangles."
}

@inproceedings{s-nrsps-83
, author =	"M. A. Sabin"
, title =	"Non-rectangular surface patches suitable for inclusion in a B-spline surface"
, booktitle =	"Eurographics"
, year =	1983
, update =	"98.03 bibrelex"
}

@inproceedings{s-shlar-83
, author =	"J.-R. Sack"
, title =	"A simple hidden-line algorithm for rectilinear polygons"
, booktitle =	"Proc. 21st Allerton Conf. Commun. Control Comput."
, year =	1983
, pages =	"437--446"
, keywords =	"computer graphics, visibility, convex hull, hidden line/surface elimination, polygons, two-dimensional"
}

@inproceedings{s-oadrp-82
, author =	"J.-R. Sack"
, title =	"An {$O(n \log n)$} algorithm for decomposing rectilinear polygons into convex quadrilaterals"
, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
, year =	1982
, pages =	"64--75"
, keywords =	"decomposition, partition, visibility, shape, polygons, two-dimensional, convex"
}

@phdthesis{s-rcg-84
, author =	"J.-R. Sack"
, title =	"Rectilinear computational geometry"
, type =	"Ph.{D}. Thesis"
, school =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1984
, note =	"Report SCS-TR-54"
, keywords =	"computer graphics, decomposition, partition, visibility, shape, convex hull, hidden line/surface elimination, polygons, two-dimensional, convex, doctoral thesis"
, update =	"93.05 jones"
}

@article{s-r3scg-87
, author =	"J.-R. Sack"
, title =	"Report on 3rd {Symposium} on {Computational} {Geometry}, 1987"
, journal =	"Bull. EATCS"
, volume =	33
, year =	1987
, pages =	"165--170"
, update =	"97.11 icking, 95.05 korneenko"
}

@article{ssu-cego-84
, author =	"J.-R. Sack and N. Santoro and J. Urrutia"
, title =	"Containment of elementary geometric objects"
, journal =	"Congr. Numer."
, volume =	45
, year =	1984
, pages =	"139--146"
, keywords =	"polygons, triangles, rectangles, two-dimensional, domination"
}

@article{ss-chia-90
, author =	"J.-R. Sack and Th. Strothotte"
, title =	"A Characterization of Heaps and Its Applications"
, journal =	"Inform. Comput."
, volume =	86
, number =	1
, year =	1990
, pages =	"69--86"
, update =	"97.11 sack"
}

@techreport{ss-oadwv-86
, author =	"J.-R. Sack and Subhash Suri"
, title =	"An optimal algorithm for detecting weak visibility of a polygon"
, type =	"Report"
, number =	"SCS-TR-114"
, institution =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1986
, keywords =	"computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
, update =	"98.03 mitchell"
}

@inproceedings{ss-oadwv-88
, author =	"J.-R. Sack and Subhash Suri"
, title =	"An Optimal Algorithm for Detecting Weak Visibility of a Polygon"
, editor =	"R. Cori and M. Wirsing"
, booktitle =	"Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
, site =	"Bordeaux, France"
, series =	"Lecture Notes Comput. Sci."
, volume =	294
, year =	1988
, pages =	"312--321"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.11 sack"
}

@article{ss-oadwv-90
, author =	"J.-R. Sack and Subhash Suri"
, title =	"An optimal algorithm for detecting weak visibility of a polygon"
, journal =	"IEEE Trans. Comput."
, volume =	39
, number =	10
, year =	1990
, pages =	"1213--1219"
, keywords =	"computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
, succeeds =	"ss-oadwv-86"
, update =	"98.03 mitchell, 95.01 mitchell"
}

@inproceedings{st-ltadr-81
, author =	"J.-R. Sack and G. T. Toussaint"
, title =	"A linear-time algorithm for decomposing rectilinear polygons into convex quadrilaterals"
, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
, year =	1981
, pages =	"21--30"
, keywords =	"decomposition, partition, visibility, shape, polygons, two-dimensional, convex"
}

@incollection{st-gprp-88
, author =	"J.-R. Sack and G. T. Toussaint"
, title =	"Guard placement in rectilinear polygons"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"153--175"
, keywords =	"decomposition, covering, partition, visibility, shape, polygons, two-dimensional, convex"
}

@article{st-sppts-87
, author =	"J.-R. Sack and G. T. Toussaint"
, title =	"Separability of pairs of polygons through single translations"
, journal =	"Robotica"
, volume =	5
, year =	1987
, pages =	"55--63"
, keywords =	"robotics, motion planning, decomposition, partition, separation, path planning, polygons, two-dimensional"
}

@book{su-hcg-00
, title =	"Handbook of Computational Geometry"
, editor =	"J.-R. Sack and J. Urrutia"
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	2000
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 97.03 tamassia"
, annote =	"A collection of 22 survey articles: as-dssga-00, as-aa-00,ag-dgsmi-00, ac-dpcg-00,
		 ak-vd-00, bp-mg-00, dmp-acggi-00, hd-mgvia-00, e-sts-00, gr-gds-00, k-pd-00, msd-ldp-00,
		 m-dcg-00, s-rpigc-00, m-gspno-00, m-racg-00, nw-sdscd-00, rs-pcgau-00, ags-vp-00,
		 s-cppcg-00, t-gd-00, u-agip-00"
}

@article{sj-amksm-93
, author =	"E. Sacks and L. Joskowicz"
, title =	"Automated modeling and kinematic simulation of mechanisms"
, journal =	"Comput. Aided Design"
, volume =	25
, number =	2
, year =	1993
, update =	"98.03 bibrelex"
}

@article{sj-ckahp-95
, author =	"E. Sacks and L. Joskowicz"
, title =	"Computational Kinematic Analysis of Higher Pairs with Multiple Contacts"
, journal =	"ASME J. Mech. Design"
, volume =	"??"
, year =	1995
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@inproceedings{sj-cscmd-94
, author =	"E. Sacks and L. Joskowicz"
, title =	"Configuration space computation for mechanism design"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1994
, update =	"98.03 bibrelex"
}

@article{s-sagtf-80
, author =	"E. A. Sadek"
, title =	"A Scheme for the Automatic Generation of Triangular Finite Elements"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	15
, year =	1980
, pages =	"1813--1822"
, annote =	"Triangulation of a region, no internal points
		 specified. Builds triangles around corners and then
		 proceeds along edges to cut off a layer and then
		 repeats. when subdividing a quadrilateral suggests that
		 with larger value of $R = \frac ab+
		 \frac{b_1/b_2}{a_1/a_2}$ ($a$ and $b$ are lengths of
		 diagonals which cut each other into $a_1\ge a_2$ and
		 $b_1\ge b_2$)"
}

@techreport{spd-e2dso-88
, author =	"S. E. O. Saeed and A. de Pennington and J. R. Dodsworth"
, title =	"An Efficient $2{D}$ Solid Offsetting Algorithm"
, institution =	"Dept. of Mechanical Engineering, U. of Leeds"
, address =	"Leeds, UK"
, year =	1988
, update =	"93.09 held"
}

@article{spd-ogm-88
, author =	"S. E. O. Saeed and A. de Pennington and J. R. Dodsworth"
, title =	"Offsetting in Geometric Modeling"
, journal =	"Comput. Aided Design"
, volume =	20
, number =	2
, month =	mar
, year =	1988
, pages =	"67--74"
, update =	"93.09 held"
}

@article{sl-sdtcm-91
, author =	"S. Safavian and D. Landgrebe"
, title =	"A survey of decision tree classifier methodology"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	21
, number =	3
, year =	1991
, pages =	"660--674"
, update =	"98.07 bibrelex"
}

@book{s-sfc-94
, author =	"H. Sagan"
, title =	"Space-filling curves"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1994
, update =	"97.07 agarwal"
}

@inproceedings{s-ansiu-87
, author =	"J. Sage"
, title =	"Artificial neural system implementations using {CCD} and {NMOS} technologies"
, booktitle =	"Proc. Workshop on Artificial Neural Systems"
, organization =	"Jet Propulsion Laboratory"
, year =	1987
, pages =	"72--84"
, update =	"98.07 bibrelex"
}

@inproceedings{stw-annic-86
, author =	"J. Sage and K. Thompson and R. Withers"
, title =	"An artificial neural network integrated circuit based on {NMOS}/{CCD} principles"
, editor =	"J. Denker"
, booktitle =	"Proc. AIP Conference: Neural Networks for Computing"
, site =	"New York, NY"
, volume =	151
, organization =	"American Institute of Physics"
, year =	1986
, pages =	"381--385"
, update =	"98.07 bibrelex"
}

@inproceedings{sh-pmttr-85
, author =	"G. Sahar and J. Hollerbach"
, title =	"Planning of Minimum-Time Trajectories for Robot Arms"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"St. Louis"
, year =	1985
, update =	"97.11 bibrelex"
}

@techreport{sh-pmttr-84
, author =	"G. Sahar and J. M. Hollerbach"
, title =	"Planning of minimum-time trajectories for robot arms"
, type =	"Technical {Report}"
, number =	"A. I. Memo No. 804"
, institution =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, month =	nov
, year =	1984
, update =	"97.11 bibrelex"
}

@inproceedings{stv-dcasp-92
, author =	"S. Sairam and R. Tamassia and J. S. Vitter"
, title =	"A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs"
, booktitle =	"Proc. 4th IEEE Symposium on Parallel and Distributed Processing"
, year =	1992
, pages =	"176--183"
, precedes =	"stv-dcasp-"
, update =	"94.09 vitter, 94.05 tamassia"
}

@article{stv-dcasp-
, author =	"S. Sairam and R. Tamassia and J. S. Vitter"
, title =	"A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs"
, journal =	"Algorithmica"
, volume =	"??"
, year =	"to appear"
, note =	"Preprint: Technical Report CS-92-15, Dept. of Computer Science, Brown Univ. (1992)"
, succeeds =	"stv-dcasp-92"
, update =	"94.05 tamassia"
}

@inproceedings{svt-ctaic-93
, author =	"S. Sairam and J. S. Vitter and R. Tamassia"
, title =	"A Complexity Theoretic Approach to Incremental Computation"
, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	665
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"640--649"
, keywords =	"dynamic computation, complexity theory"
, precedes =	"msvt-cmic-94"
, update =	"97.11 bibrelex, 94.05 tamassia"
}

@article{st-pwvt-88
, author =	"M. Sakamoto and M. Takagi"
, title =	"Patterns of weighted {Voronoi} tesselations"
, journal =	"Science and Form"
, volume =	3
, year =	1988
, pages =	"103--111"
, update =	"00.03 bibrelex"
}

@techreport{s-pcpbg-81
, author =	"B. Sakoda"
, title =	"Parallel construction of polygonal boundaries from given vertices on a raster"
, type =	"Technical {Report}"
, number =	"CS81 1-21"
, institution =	"Dept. Comput. Sci., Pennsylvania State Univ."
, year =	1981
, update =	"97.11 bibrelex"
}

@incollection{s-sh-93
, author =	"Michael E. Saks"
, title =	"Slicing the Hypercube"
, editor =	"K. Walker"
, booktitle =	"Surveys in Combinatorics"
, series =	"London Mathematical Society Lecture Notes Series"
, volume =	187
, publisher =	"Cambridge University Press"
, year =	1993
, pages =	"211--256"
, update =	"94.05 aich"
}

@incollection{s-oiphv-82
, author =	"B. E. A. Saleh"
, title =	"Optical information processing and the human visual system"
, booktitle =	"Applications of Optical Fourier Transforms"
, year =	1982
, pages =	"431--463"
, update =	"98.11 bibrelex"
}

@mastersthesis{s-sbevc-96
, author =	"S. Salinger"
, title =	"Struktureigenschaften von {Bereichsr{\"a}umen} endlicher {VC}-{Dimension}"
, type =	"Masters Thesis"
, school =	"Fachbereich Mathematik, Freie Univ. Berlin"
, address =	"Berlin, Germany"
, year =	1996
, keywords =	"masters thesis"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{s-dcah-84
, author =	"J. Salisbury"
, title =	"Design and control of an articulated hand"
, booktitle =	"Proc. 1st Intl. Sympos. Design and Synthesis"
, site =	"Tokyo, Japan"
, year =	1984
, update =	"98.11 bibrelex"
}

@article{s-irp-87
, author =	"G. T. Sallee"
, title =	"Invertible relations on polytopes"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"395--399"
}

@article{s-scsp-73
, author =	"G. T. Sallee"
, title =	"Stretching chords of space curves"
, journal =	"Geom. Dedicata"
, volume =	2
, year =	1973
, pages =	"311--315"
, update =	"02.03 orourke"
}

@book{s-limha-85
, author =	"G. Salmon"
, title =	"Lessons Introductory to the Modern Higher Algebra"
, publisher =	"Chelsea Publishing Company"
, address =	"New York, NY"
, year =	1985
, update =	"97.11 bibrelex"
}

@article{s-eppa-78
, author =	"K. B. Salomon"
, title =	"An efficient point-in-polygon algorithm"
, journal =	"Comput. Geosci."
, volume =	4
, year =	1978
, pages =	"173--178"
}

@article{s-lisps-89
, author =	"J. Salowe"
, title =	"{$L_{\infty}$} interdistance selection by parametric search"
, journal =	"Inform. Process. Lett."
, volume =	30
, year =	1989
, pages =	"9--14"
}

@incollection{s-ps-97
, author =	"J. Salowe"
, title =	"Parametric search"
, chapter =	37
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"683--698"
, update =	"97.11 orourke"
}

@phdthesis{s-spcg-87
, author =	"J. Salowe"
, title =	"Selection problems in computational geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1987
, keywords =	"doctoral thesis"
}

@article{s-cmsg-91
, author =	"J. S. Salowe"
, title =	"Constructing multidimensional spanner graphs"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	2
, year =	1991
, pages =	"99--107"
, keywords =	"distance, minimum spanning tree, spanning graph, sparse"
}

@inproceedings{s-cmsga-91
, author =	"J. S. Salowe"
, title =	"Construction of multidimensional spanner graphs, with applications to minimum spanning trees"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"256--261"
, keywords =	"proximity, minimum spanning tree"
, cites =	"aesw-emstb-90, addj-gsswg-90, c-tipga-86, c-fetaa-84, dj-wtacg-89, dfs-dgaag-90, gbt-srtgp-84, ggst-eamst-86, k-aceg-88, kg-dtcac-89, ll-tapga-89, sh-cpp-75, v-mstkd-88, v-oaann-89, y-cmstk-82, ZZZ"
, update =	"97.11 bibrelex"
}

@article{s-eis-92
, author =	"J. S. Salowe"
, title =	"Enumerating interdistances in space"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, year =	1992
, pages =	"49--59"
, keywords =	"distance, fixed-radius near neighbors, parametric search, selection"
}

@article{s-esgdf-94
, author =	"J. S. Salowe"
, title =	"Euclidean spanner graphs with degree four"
, journal =	"Discrete Appl. Math."
, volume =	54
, year =	1994
, pages =	"55--66"
, update =	"95.01 smid"
}

@inproceedings{s-esgsd-92
, author =	"J. S. Salowe"
, title =	"On {Euclidean} spanner graphs with small degree"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"186--191"
, cites =	"de-eaahc-84, dfs-dgaag-90, sv-hsiub-89, v-sgagc-91, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{s-sklac-89
, author =	"J. S. Salowe"
, title =	"Selecting the $k$th largest-area convex polygon"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"243--250"
}

@inproceedings{s-sisie-91
, author =	"J. S. Salowe"
, title =	"Shallow interdistance selection and interdistance enumeration"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"117--128"
, keywords =	"proximity, distance"
}

@inproceedings{sw-ersta-93
, author =	"J. S. Salowe and D. M. Warme"
, title =	"An exact rectilinear {Steiner} tree algorithm"
, booktitle =	"Proc. IEEE Inernat. Conf. Comput. Design"
, site =	"Cambridge, MA"
, month =	oct
, year =	1993
, pages =	"472--475"
, update =	"98.03 bibrelex"
}

@article{sw-tfprs-95
, author =	"J. S. Salowe and D. M. Warme"
, title =	"Thirty-five point rectilinear {Steiner} minimal trees in a day"
, journal =	"Networks"
, volume =	25
, year =	1995
, pages =	"69--87"
, update =	"98.07 bibrelex"
}

@book{s-atp-89
, author =	"G. Salton"
, title =	"Automatic Text Processing"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1989
, update =	"97.07 agarwal"
}

@techreport{sdhk-lht-90
, author =	"S. Salzberg and A. Delcher and D. Heath and S. Kasif"
, title =	"Learning with a helpful teacher"
, institution =	"Dept. of Comp. Sci., Johns Hopkins Univ"
, address =	"Baltimore, MD"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{sdhk-lht-91
, author =	"S. Salzberg and A. Delcher and S. Heath and S. Kasif"
, title =	"Learning with a helpful teacher"
, booktitle =	"Proc. 12th Internat. Joint Conf. Artif. Intell."
, site =	"Sydney, Australia"
, year =	1991
, note =	"To appear"
, update =	"97.11 bibrelex"
}

@techreport{skw-gpsp-89
, author =	"K. Sambandan and K. Kedem and K. Wang"
, title =	"Generalized planar sweeping of polygons"
, type =	"Technical {Report}"
, number =	"TR~89-1062"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	dec
, year =	1989
, update =	"93.09 milone+mitchell"
}

@article{sbm-gpiid-95
, author =	"M. Sambridge and J. Braun and H. McQueen"
, title =	"Geophysical parameterization and interpolation of irregular data using natural neighbours"
, journal =	"Geophys. J. Int."
, volume =	122
, year =	1995
, pages =	"837--857"
, keywords =	"natural neighbour interpolation, irregular parameterization"
, update =	"95.09 sambridge"
, annote =	"Presents details of algorithms for nn-interpolation of
irregular data, including first derivatives. Tutorial style intended to
introduce concepts and applications of natural neighbours to
geophysicists."
}

@article{s-qmat-83
, author =	"H. Samet"
, title =	"A quadtree medial axis transform"
, journal =	"Commun. ACM"
, volume =	26
, year =	1983
, pages =	"680--693"
, update =	"97.11 bibrelex"
}

@inproceedings{s-rhrss-92
, author =	"H. Samet"
, title =	"A Review of Hierarchical Representations of Shape and Some Applications"
, editor =	"C. Arcelli and L. P. Cordella and G. Sanniti di Baja"
, booktitle =	"Visual Form Analysis and Recognition"
, publisher =	"Plenum Press"
, address =	"New York"
, year =	1992
, pages =	"451--467"
, update =	"96.05 efrat"
}

@article{s-tdqta-85
, author =	"H. Samet"
, title =	"A top--down quadtree traversal algorithm"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	7
, number =	1
, month =	jan
, year =	1985
, pages =	"94--98"
, update =	"96.05 efrat"
}

@article{s-acqr-84
, author =	"H. Samet"
, title =	"Algorithms for the conversion of quadtrees to rasters"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	26
, number =	1
, month =	apr
, year =	1984
, pages =	"1--16"
, update =	"96.05 efrat"
}

@article{s-acrq-81
, author =	"H. Samet"
, title =	"An algorithm for converting rasters to quadtrees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-3"
, year =	1981
, pages =	"93--95"
}

@incollection{s-oqorh-88
, author =	"H. Samet"
, title =	"An overview of quadtrees, octrees, and related hierarchical data structures"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"51--68"
, keywords =	"data structuring, quad trees, oct trees, survey paper"
, update =	"97.03 schwarzkopf"
}

@book{s-asdsc-90
, author =	"H. Samet"
, title =	"Applications of Spatial Data Structures: Computer Graphics, Image Processing, and {GIS}"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1990
, isbn =	"0-201-50300-X"
, keywords =	"octrees"
, update =	"97.03 schwarzkopf, 93.09 held"
}

@article{s-cpirq-81
, author =	"H. Samet"
, title =	"Computing perimeters of images represented by quadtrees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-3"
, year =	1981
, pages =	"686--687"
}

@article{s-ccluq-81
, author =	"H. Samet"
, title =	"Connected component labeling using quad trees"
, journal =	"J. ACM"
, volume =	28
, year =	1981
, pages =	"487--501"
}

@article{s-dsqac-84
, author =	"H. Samet"
, title =	"Data structures for quadtree approximation and compression"
, journal =	"Commun. ACM"
, volume =	27
, year =	1984
, pages =	"973--993"
}

@article{s-dtdqt-80
, author =	"H. Samet"
, title =	"Deletion in two-dimensional quad trees"
, journal =	"Commun. ACM"
, volume =	23
, year =	1980
, pages =	"703--710"
}

@article{s-dtirq-82
, author =	"H. Samet"
, title =	"Distance transform for images represented by quadtrees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-4"
, year =	1982
, pages =	"298--303"
}

@inproceedings{s-hdssr-90
, author =	"H. Samet"
, title =	"Hierarchical Data Structures for Spatial Reasoning"
, editor =	"L. F. Pau"
, booktitle =	"Mapping and Spatial Modelling for Navigation"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1990
, pages =	"41--58"
, update =	"96.09 agarwal, 96.05 efrat"
}

@incollection{s-hdstd-92
, author =	"H. Samet"
, title =	"Hierarchical Data Structures for Three-Dimensional Data"
, editor =	"R. Vinken"
, booktitle =	"From Geoscientific Map Series to Geo-Information Systems"
, series =	"Geologisches Jahrbuch A"
, volume =	122
, publisher =	"??"
, address =	"Hannover, Germany"
, year =	1992
, pages =	"45--58"
, update =	"96.05 efrat"
}

@article{s-hrcsr-88
, author =	"H. Samet"
, title =	"Hierarchical representations of collections of small rectangles"
, journal =	"ACM Comput. Surv."
, volume =	20
, number =	4
, month =	dec
, year =	1988
, pages =	"271--309"
, update =	"96.05 efrat"
}

@inproceedings{s-hsds-89
, author =	"H. Samet"
, title =	"Hierarchical spatial data structures"
, editor =	"A. Buchmann and O. G{\"u}nther and T. R. Smith and Y. F. Wang"
, booktitle =	"Design and Implementation of Large Spatial Databases: First Symposium"
, site =	"Santa Barbara, California"
, month =	jul
, year =	1989
, pages =	"193--212"
, update =	"96.05 efrat"
}

@article{s-irton-89
, author =	"H. Samet"
, title =	"Implementing ray tracing with octrees and neighbor finding"
, journal =	"Computers \& Graphics"
, volume =	13
, number =	4
, year =	1989
, pages =	"445--460"
, note =	"(also University of Maryland Computer
                   Science TR--2204)"
, update =	"96.05 efrat"
}

@article{s-nfiro-89
, author =	"H. Samet"
, title =	"Neighbor finding in images represented by octrees"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	46
, number =	3
, month =	jun
, year =	1989
, pages =	"367--386"
, update =	"96.05 efrat"
}

@article{s-nftir-82
, author =	"H. Samet"
, title =	"Neighbor finding techniques for images represented by quadtrees"
, journal =	"Comput. Graph. Image Process."
, volume =	18
, year =	1982
, pages =	"37--57"
, update =	"97.11 bibrelex, 96.05 efrat"
, annote =	"also Proceedings of Pattern Recognition and
		 Image Processing 81, Dallas, August 1981, 68--74"
}

@article{s-rqqma-85
, author =	"H. Samet"
, title =	"Reconstruction of quadtrees from quadtree medial axis transforms"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	29
, number =	3
, month =	mar
, year =	1985
, pages =	"311--328"
, update =	"96.05 efrat"
}

@techreport{s-rrqrc-79
, author =	"H. Samet"
, title =	"Region representation: quadtree-to-raster conversion"
, type =	"Report"
, number =	"TR-768"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1979
}

@article{s-rrqba-80
, author =	"H. Samet"
, title =	"Region representation: quadtrees from binary arrays"
, journal =	"Comput. Graph. Image Process."
, volume =	13
, year =	1980
, pages =	"88--93"
}

@article{s-rrqbc-80
, author =	"H. Samet"
, title =	"Region representation: quadtrees from boundary codes"
, journal =	"Commun. ACM"
, volume =	23
, year =	1980
, pages =	"163--170"
}

@techreport{s-rrrqc-79
, author =	"H. Samet"
, title =	"Region representation: raster-to-quadtree conversion"
, type =	"Report"
, number =	"TR-766"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1979
}

@article{s-remqt-94
, author =	"H. Samet"
, title =	"Representaciones Especiales Mediante Quadtrees (translated by J. A. Cebrian)"
, journal =	"Boleti\*'n del Asociacio\*'n Espan\*~ola de Sistemas de Informacio\*'n Geogra\*'fica"
, volume =	6
, month =	may
, year =	1994
, pages =	"10--12"
, update =	"96.05 efrat"
}

@incollection{s-sds-95
, author =	"H. Samet"
, title =	"Spatial data structures"
, editor =	"W. Kim"
, booktitle =	"Modern Database Systems, The Object Model, Interoperability and Beyond"
, publisher =	"{ACM} Press and Addison-Wesley"
, year =	1995
, pages =	"361--385"
, update =	"96.05 efrat"
}

@book{s-sdsqo-89
, author =	"H. Samet"
, title =	"Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1989
, update =	"97.11 bibrelex, 95.09 tamassia, 93.09 held"
}

@book{s-dasds-90
, author =	"H. Samet"
, title =	"The Design and Analysis of Spatial Data Structures"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1990
, isbn =	"0-201-50255-0"
, keywords =	"octrees"
, update =	"93.09 held"
}

@article{s-qrhds-84
, author =	"H. Samet"
, title =	"The quadtree and related hierarchical data structures"
, journal =	"ACM Comput. Surv."
, volume =	16
, number =	2
, month =	jun
, year =	1984
}

@incollection{sa-sdmqp-95
, author =	"H. Samet and W. G. Aref"
, title =	"Spatial data models and query processing"
, editor =	"W. Kim"
, booktitle =	"Modern Database Systems, The Object Model, Interoperability and Beyond"
, publisher =	"{ACM} Press and Addison-Wesley"
, year =	1995
, pages =	"338--360"
, update =	"96.05 efrat"
}

@inproceedings{sr-qrbi-80
, author =	"H. Samet and A. Rosenfeld"
, title =	"Quadtree representations of binary images"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
, site =	"Miami Beach"
, month =	dec
, year =	1980
, pages =	"815--818"
, update =	"96.05 efrat"
}

@inproceedings{sw-qrrce-83
, author =	"H. Samet and A. Rosenfeld and C. Shaffer and R. E. Webber"
, title =	"Quadtree Region Representation in Cartography: Experimental Results"
, booktitle =	"Proceedings of the CVPR83 Conference"
, site =	"Washington DC"
, month =	jun
, year =	1983
, pages =	"176--177"
, update =	"96.05 efrat"
}

@inproceedings{srs-uhdsg-84
, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer"
, title =	"Use of hierarchical data structures in geographical information systems"
, booktitle =	"ssdh84"
, site =	"Zurich, Switzerland"
, month =	aug
, year =	1984
, pages =	"392--411"
, update =	"96.05 efrat"
}

@techreport{srsnh-ahdsg-84
, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer and R. C. Nelson and Y. G. Huang"
, title =	"Application of hierarchical data structures to geographic information systems: phase III"
, type =	"Computer Science Department"
, number =	"TR--1457"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	nov
, year =	1984
, update =	"96.05 efrat"
}

@techreport{srsnhf-ahdsg-85
, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer and R. C. Nelson and Y. G. Huang and K. Fujimura"
, title =	"Application of hierarchical data structures to geographic information systems: phase IV"
, type =	"Computer Science Department"
, number =	"TR--1578"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	dec
, year =	1985
, update =	"96.05 efrat"
}

@article{srsw-gisuq-84
, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer and R. E. Webber"
, title =	"A geographic information system using quadtrees"
, journal =	"Pattern Recogn."
, volume =	17
, number =	6
, month =	"November/December"
, year =	1984
, pages =	"647--656"
, update =	"96.05 efrat"
}

@article{srsw-qrrce-83
, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer and R. E. Webber"
, title =	"Quadtree region representation in cartography: experimental results"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	13
, number =	6
, month =	"November/December"
, year =	1983
, pages =	"1148--1154"
, update =	"96.05 efrat"
}

@techreport{ssw-dpcnu-85
, author =	"H. Samet and C. Shaffer and R. E. Webber"
, title =	"Digitizing the plane with cells of non-uniform size"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"Baltimore, MD"
, year =	1985
}

@article{ss-manfp-85
, author =	"H. Samet and C. A. Shaffer"
, title =	"A model for the analysis of neighbor finding in pointer--based quadtrees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	7
, number =	6
, month =	nov
, year =	1985
, pages =	"717--720"
, update =	"96.05 efrat"
}

@inproceedings{ssnhfr-rdqbg-86
, author =	"H. Samet and C. A. Shaffer and R. C. Nelson and Y. Huang and K. Fujimura and A. Rosenfeld"
, title =	"Recent developments in quadtree-based geographic information systems"
, booktitle =	"ssdh86"
, site =	"Seattle, WA"
, month =	jul
, year =	1986
, pages =	"15--32"
, update =	"96.05 efrat"
}

@article{ssnhfr-rdlqb-87
, author =	"H. Samet and C. A. Shaffer and R. C. Nelson and Y. G. Huang and K. Fujimura and A. Rosenfeld"
, title =	"Recent developments in linear quadtree--based geographic information systems"
, journal =	"Image Vision Comput."
, volume =	5
, number =	3
, month =	aug
, year =	1987
, pages =	"187--197"
, update =	"96.05 efrat"
}

@incollection{ssw-sqlqb-86
, author =	"H. Samet and C. A. Shaffer and R. E. Webber"
, title =	"The segment quadtree: a linear quadtree--based representation for linear features"
, editor =	"F. J. Peters and L. R. A. Kessener and M. L. P. van Lierop"
, booktitle =	"Data Structures for Raster Graphics"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1986
, pages =	"91--123"
, update =	"96.09 agarwal, 96.05 efrat"
, annote =	"also Proceedings of Computer Vision and
                   Pattern Recognition 85, San Francisco, June 1985,
                   385--389"
}

@techreport{st-gaccl-86
, author =	"H. Samet and M. Tamminen"
, title =	"A general approach to connected component labeling of images"
, type =	"Computer Science Department"
, number =	"TR--1649"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	aug
, year =	1986
, update =	"96.05 efrat"
, annote =	"also Proceedings of Computer Vision and
                   Pattern Recognition 86, Miami Beach, June 1986,
                   312--318"
}

@inproceedings{st-iaccl-86
, author =	"H. Samet and M. Tamminen"
, title =	"An Improved Approach to Connected Component Labeling of Images"
, booktitle =	"Proceedings of the CVPR86 Conference"
, site =	"Miami Beach"
, month =	jun
, year =	1986
, pages =	"312--318"
, update =	"96.05 efrat"
}

@article{st-actmo-90
, author =	"H. Samet and M. Tamminen"
, title =	"Approximating {CSG} trees of moving objects"
, journal =	"Visual Comput."
, volume =	6
, number =	4
, month =	aug
, year =	1990
, pages =	"182--209"
, note =	"(also University of Maryland Computer Science TR--1472)"
, update =	"96.05 efrat"
}

@article{st-bctt-85
, author =	"H. Samet and M. Tamminen"
, title =	"Bintrees, {CSG} trees, and time"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, month =	jul
, year =	1985
, pages =	"121--130"
, note =	"Proc. SIGGRAPH '85"
, update =	"96.09 devillers, 96.05 efrat"
}

@article{st-cgpir-85
, author =	"H. Samet and M. Tamminen"
, title =	"Computing geometric properties of images represented by linear quadtrees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	7
, number =	2
, month =	mar
, year =	1985
, pages =	"229--24"
, note =	"(also University of Maryland Computer
                    Science TR--1359)"
, update =	"96.05 efrat"
}

@article{st-eclia-88
, author =	"H. Samet and M. Tamminen"
, title =	"Efficient component labeling of images of arbitrary dimension represented by linear bintrees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	10
, number =	4
, month =	jul
, year =	1988
, pages =	"579--586"
, update =	"96.05 efrat"
}

@inproceedings{st-enica-84
, author =	"H. Samet and M. Tamminen"
, title =	"Experiences with new image component algorithms"
, editor =	"K. Bo and H. A. Tucker"
, booktitle =	"Proceedings of the EUROGRAPHICS'84 Conference"
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	1984
, pages =	"239--249"
, update =	"96.05 efrat"
}

@article{sw-csrmd-89
, author =	"Hanan Samet and Robert E. Webber"
, title =	"A comparison of the space requirements of multi-dimensional quadtree-based file structures"
, journal =	"Visual Comput."
, volume =	5
, number =	6
, month =	dec
, year =	1989
, pages =	"349--359"
, keywords =	"image databases, quadtrees, octrees, image compression"
}

@article{sw-dssbb-91
, author =	"H. Samet and R. E. Webber"
, title =	"Data structures to support {B{\'e}zier}-based modeling"
, journal =	"Comput. Aided Design"
, volume =	23
, number =	3
, month =	apr
, year =	1991
, pages =	"162--176"
, update =	"96.05 efrat"
}

@inproceedings{sw-hds-86
, author =	"H. Samet and R. E. Webber"
, title =	"Hierarchical Data Structure"
, booktitle =	"Proceedings of the Second International Electronic Image Week"
, site =	"Nice, France"
, month =	apr
, year =	1986
, pages =	"577--584"
, update =	"96.05 efrat"
}

@article{sw-hdsac1-88
, author =	"H. Samet and R. E. Webber"
, title =	"Hierarchical data structures and algorithms for computer graphics, Part {I}: fundamentals"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	8
, number =	5
, month =	may
, year =	1988
, pages =	"48--68"
, precedes =	"sw-hdsac2-88"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{sw-hdsac2-88
, author =	"H. Samet and R. E. Webber"
, title =	"Hierarchical data structures and algorithms for computer graphics, Part {II}: applications"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	8
, number =	4
, month =	jul
, year =	1988
, pages =	"59--75"
, keywords =	"computer graphics --- Imaging Techniques; computer programming --- Algorithms; CSG; data processing; Data Structures; hidden-surface algorithms; octree; parallel and perspective projection methods; quadtree; ray tracing; surfaces --- Computer Simulation"
, succeeds =	"sw-hdsac1-88"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@techreport{sw-ebq-82
, author =	"H. Samet and R. E. Webber"
, title =	"On encoding boundaries with quadtrees"
, type =	"Computer Science"
, number =	"TR--1162"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	feb
, year =	1982
, update =	"96.05 efrat"
}

@article{sw-ebq-84
, author =	"H. Samet and R. E. Webber"
, title =	"On encoding boundaries with quadtrees"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	6
, number =	3
, month =	may
, year =	1984
, pages =	"365--369"
, update =	"97.11 bibrelex, 96.05 efrat"
, abstract =	"efficient algorithms for boundary and superimposing
		 two maps encoded as line quadtrees"
}

@article{sw-scpuq-85
, author =	"H. Samet and R. E. Webber"
, title =	"Storing a Collection of Polygons Using Quadtrees"
, journal =	"ACM Trans. Graph."
, volume =	4
, number =	3
, month =	jul
, year =	1985
, pages =	"182--222"
, update =	"93.09 held"
}

@inproceedings{sw-vr-91
, author =	"H. Samet and R. E. Webber"
, title =	"Volume Representation"
, editor =	"A. Kaufman"
, booktitle =	"Volume Visualization"
, publisher =	"IEEE Computer Society Press"
, address =	"Washington, DC"
, year =	1991
, pages =	"19--22"
, update =	"96.05 efrat"
}

@book{s-pg-88
, author =	"Pierre Samuel"
, title =	"Projective Geometry"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1988
, update =	"00.11 smid, 00.07 icking, 99.07 orourke"
}

@inproceedings{sk-ccmpc-92
, author =	"N. K. Sancheti and S. S. Keerthi"
, title =	"Computation of Certain Measures of Proximity between Convex Polytopes : A Complexity Viewpoint"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Nice, France"
, year =	1992
, pages =	"2508--2513"
, update =	"98.11 bibrelex"
}

@inproceedings{s-fhhml-96
, author =	"G. Sander"
, title =	"A Fast Heuristic for Hierarchical {Manhattan} Layout"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"447--458"
, keywords =	"graph drawing, system"
, update =	"98.11 bibrelex, 98.07 tamassia+vismara, 96.09 tamassia"
}

@techreport{s-gdtrw-96
, author =	"G. Sander"
, title =	"Graph Drawing Tools and Related Work"
, type =	"manuscript"
, institution =	"Universit{\"a}t des Saarlandes, Saarbr{\"u}ken, Germany"
, year =	1996
, url =	"http://www.cs.uni-sb.de/RW/users/sander/html/gstools.html"
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@inproceedings{s-gltvt-95
, author =	"G. Sander"
, title =	"Graph Layout through the {VCG} Tool"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"194--205"
, keywords =	"graph drawing, system, layered"
, update =	"95.01 tamassia"
}

@mastersthesis{s-drpga-90
, author =	"L. Sander"
, title =	"The design of robust primitives for geometric algorithms: with applications to line segment intersection and planar convex hull algorithms"
, school =	"Dept. Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, keywords =	"master thesis"
, update =	"99.11 bibrelex, 98.07 bibrelex"
}

@incollection{s-mv-93
, author =	"J. R. Sangwine-Yager"
, title =	"Mixed volumes"
, booktitle =	"Handbook of Convex Geometry"
, volume =	"A"
, publisher =	"North-Holland"
, year =	1993
, pages =	"43--71"
, update =	"99.11 bibrelex, 97.11 bibrelex, 95.09 wenger, 95.01 matousek"
}

@article{sr-lvsta-75
, author =	"D. Sankoff and P. Rousseau"
, title =	"Locating the vertices of a {Steiner} tree in an arbitrary metric space"
, journal =	"Math. Program."
, volume =	9
, year =	1975
, pages =	"240--246"
, update =	"97.11 bibrelex"
}

@phdthesis{s--92
, author =	"M. F. Sanner"
, title =	"??"
, school =	"UHA"
, address =	"France"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{sos-frcms-95
, author =	"Michel F. Sanner and Arthur J. Olson and Jean-Claude Spehner"
, title =	"Fast and Robust Computation of Molecular Surfaces"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C6--C7"
, keywords =	"molecules, biology, visualization"
, cites =	"lr-ipses-71, r-avpps-77, c-amsc-83, b--94, p--92, ea--93, c--93, s--90, v-hga-94, c--85, s--92, ho-smhsr-94, em-tdas-94, bh-hofca-86, do--93, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{s-vanpt-96
, author =	"C. Sansoni"
, title =	"Visual Analysis: {A} New Probabilistic Technique to Obtain Landscape Visibility"
, journal =	"Comput. Aided Design"
, volume =	28
, number =	4
, month =	apr
, year =	1996
, pages =	"289--299"
, update =	"98.03 mitchell, 97.03 held"
}

@book{s-ipgp-79
, author =	"L. Santal{\'o}"
, title =	"Integral Probability and Geometric Probability"
, series =	"Encyclopedia of Mathematics and its Applications"
, volume =	1
, publisher =	"Addison-Wesley"
, year =	1979
, update =	"98.07 bibrelex"
}

@article{s-tsppe-40
, author =	"L. A. Santal{\'o}"
, title =	"A theorem on sets of parallelepipeds with parallel edges"
, journal =	"Publ. Inst. Mat. Univ. Nac. Litoral"
, volume =	2
, year =	1940
, pages =	"49--60"
, update =	"98.03 bibrelex"
}

@inbook{s-ig4km-36
, author =	"L. A. Santal{\'o}"
, title =	"Integral geometry 4: on the kinematic measure in the plane"
, series =	"Abh. Math. Senn."
, volume =	11
, publisher =	"Hamburg Univ."
, year =	1936
, pages =	"222--236"
, update =	"98.07 bibrelex"
}

@book{s-ig5km-36
, author =	"L. A. Santal{\'o}"
, title =	"Integral geometry 5: on the kinematic measure in space"
, series =	"Actualit{\'e}s scientifiques et industrielles"
, volume =	357
, publisher =	"Hermann"
, address =	"Paris, France"
, year =	1936
}

@book{s-iggp-76
, author =	"L. A. Santal{\'o}"
, title =	"Integral Geometry and Geometric Probability"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1976
}

@book{s-iig-53
, author =	"L. A. Santal{\'o}"
, title =	"Introduction to integral geometry"
, series =	"Actualit{\'e}s scientifiques et industrielles"
, volume =	1198
, publisher =	"Hermann"
, address =	"Paris, France"
, year =	1953
}

@article{sssu-gcpo-89
, author =	"N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
, title =	"Geometric containment and partial orders"
, journal =	"SIAM J. Discrete Math."
, volume =	2
, number =	2
, year =	1989
, pages =	"245--254"
, update =	"94.05 franciosa"
}

@article{sssu-gcvd-87
, author =	"N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
, title =	"Geometric containment and vector dominance"
, journal =	"Theoret. Comput. Sci."
, volume =	53
, year =	1987
, pages =	"345--352"
, succeeds =	"sssu-gcinr-84"
}

@techreport{sssu-gcinr-84
, author =	"N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
, title =	"Geometric containment is not reducible to pareto dominance"
, type =	"Report"
, number =	"SCS-TR-37"
, institution =	"School Comput. Sci., Carleton Univ."
, address =	"Ottawa, ON"
, year =	1984
, precedes =	"sssu-gcvd-87"
}

@article{s-pcstd-00
, author =	"Francisco Santos"
, title =	"A point configuration whose space of triangulations is disconnected"
, journal =	"J. Amer. Math. Soc."
, volume =	13
, number =	3
, year =	2000
, pages =	"611--637"
, comments =	"Example in $R^6$ is not in general position"
, update =	"02.03 orourke"
}

@inproceedings{s-acttp-01
, author =	"Francisco Santos"
, title =	"Applications of the {Cayley} Trick to Triangulations of Polytopes"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"150--153"
, update =	"01.04 icking"
}

@inproceedings{s-bftpc-98
, author =	"Francisco Santos"
, title =	"Bistellar Flips in Triangulations of Point Configurations"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"131--133"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{s-ctges-95
, author =	"F. Santos"
, title =	"Codifying the Topology of Graph Embeddings on a Surface"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"57--59"
, update =	"00.03 bibrelex"
}

@unpublished{s-nromd-
, author =	"F. Santos"
, title =	"Non-realizable oriented matroids coming from {Delaunay} triangulations for strictly convex matrics"
, note =	"in preparation"
, update =	"98.11 bibrelex"
}

@inproceedings{s-dom-94
, author =	"F. Santos"
, title =	"On {Delaunay} Oriented Matroids"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"195--200"
, keywords =	"convex distance"
, cites =	"bv-om-78, b-vdch-79, cd-vdbcd-85, cmrs-tspvd-93, iklm-cdf3s-93, k-cavd-89, m-dmpcg-90, m-ddvec-92, s-nromd-, sh-cpp-75, blwsz-om-93, cl-hcdc-88, ZZZ"
, update =	"00.03 bibrelex, 98.11 bibrelex, 94.09 jones"
}

@inproceedings{s-domcd-94
, author =	"Francisco Santos"
, title =	"On {Delaunay} Oriented Matroids for Convex Distance Functions"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"20--24"
, update =	"00.11 smid, 00.07 icking"
}

@article{s-tvfgb-00
, author =	"Francisco Santos"
, title =	"Triangulations with very few geometric bistellar neighbors"
, journal =	"Discrete Comput. Geom."
, volume =	23
, number =	1
, year =	2000
, pages =	"15--33"
, update =	"02.03 orourke"
}

@article{snb-vods3-99
, author =	"C. Saona-V{\'a}zquez and I. Navazo and P. Brunet"
, title =	"The Visibility Octree: A Data structure for 3D Navigation"
, journal =	"Comput. \& Graphics"
, volume =	23
, number =	5
, month =	oct
, year =	1999
, pages =	"635--643"
, update =	"00.03 held"
}

@article{sp-dtasp-91
, author =	"Nickolas Sapidis and Renato Perucchio"
, title =	"Delaunay Triangulation Of Arbitrarily Shaped Planar Domains"
, journal =	"Comput. Aided Geom. Design"
, volume =	8
, number =	6
, month =	dec
, year =	1991
, pages =	"421--437"
, keywords =	"Delaunay triangulation, planar domains, computer aided geometric design, computational geometry"
, abstract =	"An algorithm is presented for constructing a Domain
		 Delaunay triangulation (DDT) of an arbitrarily shaped,
		 multiply-connected (manifold or nonmanifold), planar
		 domain. DDT preserves the boundary of the given region
		 and has properties identical to those of the standard
		 Delaunay triangulation. Construction of this
		 triangulation involves operations (node refinement,
		 triangulation extraction) that are based solely on
		 properties of the standard Delaunay diagram. Examples
		 are included that demonstrate the validity of the
		 algorithm. (Author abstract) 22 Refs."
}

@phdthesis{s-dtcpd-92
, author =	"N. S. Sapidis"
, title =	"Domain Tetrahedrization of Curved Polyhedra Defined in a Solid Modeling System"
, school =	"Dept. of Mech. Engg., University of Rochester, Rochester, NY 14627, USA"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"95.01 held"
}

@article{sp-ddtsm-91
, author =	"N. S. Sapidis and R. Perucchio"
, title =	"Domain {Delaunay} tetrahedrization of solid models"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	3
, year =	1991
, pages =	"299--325"
, keywords =	"tetrahedrization, Delaunay triangulation, solid modeling, topological validity"
}

@article{sp-sscor-92
, author =	"N. S. Sapidis and R. Perucchio"
, title =	"Solid/Solid Classification Operations for Recursive Spatial Decomposition and Domain Triangulation of Solid Models"
, journal =	"Comput. Aided Design"
, volume =	24
, number =	10
, month =	oct
, year =	1992
, pages =	"517--529"
, update =	"96.09 devillers, 95.01 held"
}

@techreport{skskb-icsmc-93
, author =	"G. Sapiro and R. Kimmel and D. Shaked and B. B. Kimia and A. M. Bruckstein"
, title =	"Implementing continuous-scale morphology via curve evolution"
, number =	"CIS 9302"
, institution =	"Technion IIT"
, address =	"Haifa, Israel"
, month =	jan
, year =	1993
, update =	"93.09 milone+mitchell"
}

@inproceedings{sk-arngv-92
, author =	"V. Sarin and S. Kapoor"
, title =	"Algorithms for relative neighbourhood graphs and {Voronoi} diagrams in simple polygons"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"292--298"
, cites =	"c-cdt-87, et-crnds-88, ghlst-ltavs-86, km-eaesp-88, ps-cgi-85, s-rngam-83, t-rngfp-80, ws-oacdt-87, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@article{sb-gfv-94
, author =	"M. Sarkar and M. H. Brown"
, title =	"Graphical Fisheye Views"
, journal =	"Commun. ACM"
, volume =	37
, number =	12
, year =	1994
, pages =	"73--84"
, keywords =	"graph drawing, fisheye view, system"
, update =	"95.05 tamassia"
}

@techreport{sb-gfvg-91
, author =	"M. Sarkar and Marc H. Brown"
, title =	"Graphical Fisheye Views of Graphs"
, number =	"CS-91-61"
, institution =	"Department of Computer Science, Brown University"
, year =	1991
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{sstr-srsmv-93
, author =	"Manojit Sarkar and Scott S. Snibbe and Oren J. Tversky and Steven P. Reiss"
, title =	"Stretching the rubber sheet: a metaphor for viewing large layouts on small screens"
, journal =	"Proc. ACM UIST"
, volume =	"??"
, month =	nov
, year =	1993
, pages =	"81--91"
, update =	"97.03 tamassia"
}

@article{s-gvkft-91
, author =	"K. Sarkaria"
, title =	"A generalized {van Kampen}-{Flores} theorem"
, journal =	"Proc. Amer. Math. Soc."
, volume =	11
, year =	1991
, pages =	"559--565"
, update =	"95.01 matousek"
}

@techreport{s-sesc-92
, author =	"K. Sarkaria"
, title =	"Shifting and embeddability of simplicial complexes"
, number =	"91/51"
, institution =	"Max-Planck Institut f{\"u}r Mathematik, Bonn"
, year =	1992
, comments =	"Proves that a simplicial comples on $n$ vertices
topologically embeddable in $d$-space has $O(n^{\lceil{d/2}\rceil})$
simplices. Vast generalization of Upper Bound Theorem etc."
, update =	"95.01 matousek"
}

@article{s-cfazz-99
, author =	"S. E. Sarma"
, title =	"The crossing function and its application to zig-zag tool paths"
, journal =	"Comput. Aided Design"
, volume =	31
, year =	1999
, pages =	"881--890"
, update =	"00.03 smid"
}

@article{st-pplup-86
, author =	"N. Sarnak and R. E. Tarjan"
, title =	"Planar point location using persistent search trees"
, journal =	"Commun. ACM"
, volume =	29
, number =	7
, month =	jul
, year =	1986
, pages =	"669--679"
, update =	"98.11 bibrelex"
}

@article{sl-rtaa-94
, author =	"M. Sarrafzadeh and D. T. Lee"
, title =	"Restricted track assignment with applications"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"53--68"
, keywords =	"track assignment, circular arc model, NP-hardness, approximation algorithm"
, update =	"96.09 devillers"
}

@inproceedings{swww-wkklg-92
, author =	"M. Sarrafzadeh and D. Wagner and F. Wagner and K. Weihe"
, title =	"Wiring Knock-Knee Layouts: A Global Approach"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"388--399"
, update =	"94.09 smid, 93.09 milone+mitchell"
}

@article{swww-wkklg-94
, author =	"M. Sarrafzadeh and D. Wagner and F. Wagner and K. Weihe"
, title =	"Wiring Knock-Knee Layouts: A Global Approach"
, journal =	"IEEE Trans. Comput."
, volume =	43
, year =	1994
, pages =	"581--589"
, update =	"97.03 gaertner+salinger"
}

@unpublished{sw-hstcu-
, author =	"M. Sarrafzadeh and C. K. Wong"
, title =	"Hierarchical {Steiner} tree construction in uniform orientations"
, note =	"Unpublished manuscript"
, update =	"98.03 bibrelex"
}

@article{s-igubc-87
, author =	"R. Sarraga"
, title =	"$G^1$ Interpolation of generally unrestrictedcubic bezier curves"
, journal =	"Comput. Aided Geom. Design"
, volume =	"??"
, number =	4
, year =	1987
, pages =	"23--39"
, update =	"98.03 bibrelex"
}

@article{s-dfs-72
, author =	"N. Sauer"
, title =	"On the density of families of sets"
, journal =	"J. Combin. Theory Ser. A"
, volume =	13
, year =	1972
, pages =	"145--147"
, update =	"94.05 matousek"
}

@article{s-rdclt-93
, author =	"P. Sauer"
, title =	"On the Recognition of Digital Circles in Linear Time"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	5
, month =	mar
, year =	1993
, pages =	"287--302"
, update =	"93.09 held"
}

@inproceedings{s-hlge-83
, author =	"J. E. Savage"
, title =	"Heuristics for Level Graph Embeddings"
, booktitle =	"Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, publisher =	"Trauner Verlag"
, address =	"Linz, Austria"
, year =	1983
, pages =	"307--318"
, keywords =	"graph drawing"
, update =	"94.05 smid, 93.09 tamassia"
}

@article{s-rbndt-70
, author =	"W. J. Savitch"
, title =	"Relationships between nondeterministic and deterministic tape complexities"
, journal =	"J. Comput. Syst. Sci."
, volume =	4
, number =	2
, year =	1970
, pages =	"177--192"
, update =	"98.07 bibrelex"
}

@article{ssk-cpsd-87
, author =	"D. G. Sawker and G. R. Shevare and S. P. Koruthu"
, title =	"Contour Plotting for Scattered Data"
, journal =	"Computers and Graphics"
, volume =	11
, number =	2
, year =	1987
, pages =	"101--104"
, annote =	"Usual triangulation, optimization, linear
		 interpolation. Wrinkles: data is shelled, successive
		 convex hulls are formed. Switching DT between hulls
		 only. A (pointless?) subdivision stage is added."
}

@phdthesis{s-dspco-85
, author =	"J. B. Saxe"
, title =	"Decomposable searching problems and circuit optimization by retiming: two studies in general transformations of computational structures"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1985
, note =	"Report CMU-CS-85-162"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@inproceedings{s-ewgks-79
, author =	"J. B. Saxe"
, title =	"Embeddability of weighted graphs in $k$-space is strongly {NP}-hard"
, booktitle =	"Proc. 17th Allerton Conf. Commun. Control Comput."
, year =	1979
, pages =	"480--489"
}

@article{s-nrqks-79
, author =	"J. B. Saxe"
, title =	"On the number of range queries in $k$-space"
, journal =	"Discrete Appl. Math."
, volume =	1
, year =	1979
, pages =	"217--225"
}

@techreport{s-tpgep-80
, author =	"J. B. Saxe"
, title =	"Two papers on graph embedding problems"
, type =	"Technical {Report}"
, number =	"CMU-CS-80-102"
, institution =	"Dept. Comput. Sci., Carnegie Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1980
, update =	"97.11 bibrelex"
}

@inproceedings{sb-tsdsd-79
, author =	"J. B. Saxe and J. L. Bentley"
, title =	"Transforming static data structures to dynamic structures"
, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1979
, pages =	"148--168"
, precedes =	"bs-dsp1s-80"
}

@article{sbp-evpad-90
, author =	"Sanjeev Saxena and P. C. P. Bhatt and V. C. Prasad"
, title =	"Efficient {VLSI} Parallel Algorithm For {Delaunay} Triangulation On Orthogonal Tree Network In Two And Three Dimensions"
, journal =	"IEEE Trans. Comput."
, volume =	39
, number =	3
, month =	mar
, year =	1990
, pages =	"400--404"
, keywords =	"computational geometry, parallel algorithms, triangulation, VLSI complexity"
, annote =	"See correction in 40:1 (1991) p122. Uses circumcircle
		 algorithm in parallel starting with edge to nearest
		 neighbour. Circumcircle test is
		 $|a^2+b^2-c^2|/4a^2b^2$."
, abstract =	"An algorithm with worst case time complexity
		 O(log**2N) in two dimensions and O(m**1**/**2log N) in
		 three dimensions with N input points and m as the
		 number of tetrahedra in triangulation is given. Its
		 AT**2 VLSI complexity on Thompson's logarithmic delay
		 model is O(N**2log**6N) in two dimensions and
		 O(m**2Nlog**4 N) in three dimensions. 19 Refs."
}

@inproceedings{sams-gdtoc-97
, author =	"G. Sazaklis and E. M. Arkin and J. S. B. Mitchell and S. S. Skiena"
, title =	"Geometric decision trees for optical character recognition"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"394--396"
, cites =	"agmmps-ppdtg-93, ammrs-dtgm-93, bfos-crt-84, c-opcrt-91, -eera-57, fkmprs-lofp-94, msy-hrord-92, myy-rmrhc-84, n-sapr-68, rs-tgo-94, sl-sdtcm-91, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
}

@inproceedings{sams-pttcr-98
, author =	"G. Sazaklis and Esther M. Arkin and Joseph S. B. Mitchell and Steven S. Skiena"
, title =	"Probe Trees for Touching Character Recognition"
, booktitle =	"Proc. 1998 International Conference on Imaging Science, Systems and Technology"
, nickname =	"CISST'98"
, site =	"Las Vegas, NV"
, month =	jul
, year =	1998
, pages =	"282--289"
, keywords =	"geometric decision trees, optical character recognition, text processing"
, update =	"98.07 mitchell"
}

@inproceedings{s-igbmf-93
, author =	"M. Sbert"
, title =	"An integral geometry based method for fast form-factor computation"
, editor =	"R. J. Hubbold and R. Joan"
, booktitle =	"Proc. Eurographics '93"
, year =	1993
, pages =	"409--420"
, update =	"98.03 bibrelex"
}

@techreport{s-srla-??
, author =	"H. E. Scarf"
, title =	"Some remarks on {Lenstra}'s algorithm"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@phdthesis{s-sdrrv-93
, author =	"L. Scarlatos"
, title =	"Spatial data representations for rapid visualization and analysis"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Computer Science, State University of New York at Stony Brook"
, address =	"Stony Brook, NY 11794-4400"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"95.09 mitchell"
}

@inproceedings{sp-aht-91
, author =	"Lori Scarlatos and Theo Pavlidis"
, title =	"Adaptive Hierarchical Triangulation"
, booktitle =	"Proc. 10th Internat. Sympos. Comput.-Assist. Cartog."
, series =	"Technical Papers 1991 ACSM-ASPRS Annual Convention"
, volume =	6
, year =	1991
, pages =	"234--246"
, update =	"93.05 freimer"
, annote =	"Hierarchical triangulation to represent surface at
		 different levels of detail. Triangles are split in one
		 of different ways, depending on how it deviates from
		 underlying surface. This tends to avoid skinny
		 triangles, are require a less deep hierarchy."
}

@article{sp-htucc-92
, author =	"Lori Scarlatos and Theo Pavlidis"
, title =	"Hierarchical Triangulation Using Cartographics Coherence"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	54
, number =	2
, month =	mar
, year =	1992
, pages =	"147--161"
, annote =	"Triangles where there are large deviations from the
		 surface are split (preferably along an edge) into 2 3
		 or 4 triangles each. Uses average ``sliveriness''
		 ($P^2/A$) to measure mesh quality."
}

@inproceedings{sp-htutf-90
, author =	"Lori Scarlatos and Theo Pavlidis"
, title =	"Hierarchical Triangulation Using Terrain Features"
, booktitle =	"Proceedings of the 1st 1990 IEEE Conference on Visualization, Visualization '90"
, publisher =	"IEEE"
, address =	"IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 90CH2914-0)"
, year =	1990
, pages =	"168--175"
, keywords =	"hierarchical triangulation, terrain features, digital elevation models, visualization"
, abstract =	"A hierarchical triangulation built from a digital
		 elevation model in grid form is described. The authors
		 present an algorithm that produces a hierarchy of
		 triangulations in which each level of the hierarchy
		 corresponds to a guaranteed level of accuracy. The
		 number of very thin triangles (slivers) is
		 significantly reduced. Such triangles produced
		 undesirable effects in animation. In addition the
		 number of levels of the triangulated irregular network
		 (TIN) tree is reduced. This speeds up searching within
		 the data structure. Tests on data with digital
		 elevation input have confirmed the theoretical
		 expectations. On eight such sets the average
		 sliveriness with the method was between 1/5 and 1/10 of
		 old triangulations and number of levels was about one
		 third. There was an increase in the number of
		 descendants at each level, but the total number of
		 triangles was also lower. 20 Refs."
}

@inproceedings{sp-otce-92
, author =	"L. Scarlatos and T. Pavlidis"
, title =	"Optimizing triangulation by curvature equalization"
, booktitle =	"Proceedings of the 3rd 1992 IEEE Conference on Visualization, Visualization '92"
, publisher =	"IEEE"
, year =	1992
, pages =	"333--339"
, keywords =	"hierarchical triangulation, terrain features, digital elevation models, visualization"
, update =	"95.09 mitchell"
}

@article{s-dpcs-78
, author =	"B. Schachter"
, title =	"Decomposition of Polygons into Convex Sets"
, journal =	"IEEE Trans. Comput."
, volume =	"C-27"
, number =	11
, year =	1978
, pages =	"1078--1082"
, annote =	"Cuts polygon along Delaunay edges at reflex angles.
		 $O(n)$ process to find De's at a given reflex vertex -
		 picks one or two to eliminate reflex. $O(mn)$"
}

@article{srd-rmmt-78
, author =	"B. Schachter and A. Rosenfeld and L. S. David"
, title =	"Random mosaic models for textures"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	8
, number =	9
, year =	1978
, pages =	"694--702"
}

@misc{s-ppmpe-
, author =	"D. H. Schaefer"
, title =	"The {PMMP} - a pyramid of {MPP} processing elements"
, note =	"To appear"
, update =	"97.11 bibrelex"
}

@article{s-obbtr-87
, author =	"H. M. Schaettler"
, title =	"On the Optimality of bang-bang trajectories in ${R}^{3}$"
, journal =	"Bull. Amer. Math. Soc."
, volume =	18
, number =	1
, year =	1987
, pages =	"113--116"
, update =	"97.11 bibrelex"
}

@mastersthesis{s-tmsp-83
, author =	"A. A. Sch{\"a}ffer"
, title =	"Trees for multidimensional search problems"
, type =	"M.{S}. Thesis"
, school =	"Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1983
, keywords =	"master thesis"
}

@article{sv-chpsj-87
, author =	"A. A. Sch{\"a}ffer and C. J. {Van Wyk}"
, title =	"Convex Hulls of Piecewise-Smooth {Jordan} Curves"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"66--94"
, update =	"93.09 held"
}

@article{s-dgrg-95
, author =	"M. Sch{\"a}ffter"
, title =	"Drawing graphs on rectangular grids"
, journal =	"Discrete Appl. Math."
, volume =	63
, year =	1995
, pages =	"75--89"
, keywords =	"graph drawing, orthogonal, grid"
, update =	"96.01 tamassia"
}

@techreport{s-ocf-91b
, author =	"P. Schapira"
, title =	"Operations on Constructible Functions"
, type =	"Report"
, number =	"88-2"
, institution =	"Departement de mathematique et informatique, Universite Paris-Nord"
, address =	"93430 Villetaneuse, France"
, year =	1988
, comments =	"Presents an equivalent of kinetic framework, grs-kfcg-83, in 2 and higher dimensions"
, update =	"96.05 ramkumar"
}

@incollection{ss-t-97
, author =	"D. Schattschneider and M. Senechal"
, title =	"Tilings"
, chapter =	3
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"43--62"
, update =	"97.11 orourke"
}

@phdthesis{s-mwcgv-91
, author =	"B. F. Schaudt"
, title =	"Multiplicative Weighted Crystal Growth {Voronoi} Diagrams"
, school =	"Dartmouth College"
, year =	1991
, url =	"In preparation"
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{sd-hdvdc-92
, author =	"B. F. Schaudt and R. L. Drysdale"
, title =	"Higher-dimensional {Voronoi} diagrams for convex distance functions"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"274--279"
, cites =	"a-vdsfg-91, cd-vdbcd-85, c-ochan-91, d-pacdt-90, e-acg-87, gs-pmgsc-85, l-tdvdl-80, lw-vdllm-80, ph-chfsp-77, rs-tchnp-85, sdt-opsal-91, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{sd-mwcgv-91
, author =	"B. F. Schaudt and R. L. Drysdale"
, title =	"Multiplicatively weighted crystal growth {Voronoi} diagrams"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"214--223"
, keywords =	"Voronoi diagrams"
, cites =	"ae-oacwv-84, a-pdpaa-87, a-vds-88, bsh-sgfgt-84, cd-vdbcd-85, f-savd-87, ft-dmtf-87, ft-csmet-88, gb-msp-78, g-nivpo-71, ghj-gpma-67, gs-cdtp-78, g-dg-63, g-ims-72, hj-gifdg-68, hl-ius-79, l-cspc-72, mhm-cacjm-80, pftv-nr-86, ps-cgi-85, sb-ina-80, s-mwcgv-91, th-gmt1m-80, wt-fcwvd-90, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{ss-gmldp-95
, author =	"G. Schaufler and W. Stuerzlinger"
, title =	"Generating multiple levels of detail for polygonal geometry models"
, booktitle =	"Virtual Environments"
, site =	"Monte Carlo, MC"
, month =	jan
, year =	1995
, pages =	"53--62"
, keywords =	"surface simplification"
, update =	"96.01 mitchell"
}

@article{s-psvtd-87
, author =	"C. F. Scheepers"
, title =	"Polygon Shading on Vector Type Devices"
, journal =	"Quaestiones Informaticae"
, volume =	5
, number =	2
, month =	oct
, year =	1987
, pages =	"46--55"
, update =	"95.01 held"
}

@article{sg-xws-86
, author =	"Robert W. Scheifler and Jim Gettys"
, title =	"The {X} Window System"
, journal =	"ACM Trans. Graph."
, volume =	5
, number =	2
, year =	1986
, pages =	"79--109"
, keywords =	"virtual terminals, window managers"
, update =	"96.01 tamassia"
}

@techreport{s-csg-85
, author =	"W. Schempp"
, title =	"Computational signal geometry"
, type =	"Report"
, number =	"??"
, institution =	"Lehrstuhl Math. I, Univ. Siegen"
, address =	"Siegen, West Germany"
, year =	1985
}

@article{sc-dstcr-87
, author =	"I. D. Scherson and E. Caspary"
, title =	"Data structures and the time complexity of ray tracing"
, journal =	"Visual Comput."
, volume =	3
, year =	1987
, pages =	"201--213"
}

@techreport{so-mbtas-80
, author =	"P. Scheuermann and M. Ouksel"
, title =	"Multidimensional $b$-trees for associative searching in database systems"
, type =	"Report"
, number =	"80-12-DBM-05"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
, address =	"Evanston, IL"
, year =	1980
}

@phdthesis{s-agp-89
, author =	"C. Schevon"
, title =	"Algorithms for geodesics on polytopes"
, school =	"Johns Hopkins University"
, year =	1989
, keywords =	"polytopes, shortest paths, diameter"
, update =	"93.05 orourke"
}

@techreport{so-cru-87
, author =	"C. Schevon and J. O'Rourke"
, title =	"A conjecture on random unfoldings"
, type =	"Technical {Report}"
, number =	"JHU-87/20"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	jul
, year =	1987
, keywords =	"polytopes, unfoldings"
}

@techreport{so-afesp-89
, author =	"C. Schevon and J. O'Rourke"
, title =	"An algorithm for finding edge sequences on a polytope"
, type =	"Technical {Report}"
, number =	"JHU-89/03"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	feb
, year =	1989
, keywords =	"polytopes, shortest paths, edge sequences"
}

@inproceedings{so-nmesc-88
, author =	"C. Schevon and J. O'Rourke"
, title =	"The number of maximal edge sequences on a convex polytope"
, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
, site =	"University of Illinois at Urbana-Champaign"
, month =	oct
, year =	1988
, pages =	"49--57"
, keywords =	"shortest paths, polytopes"
, update =	"93.05 orourke"
}

@article{sv-parud-88
, author =	"C. A. Schevon and J. S. Vitter"
, title =	"A Parallel Algorithm for Recognizing Unordered Depth-First Search"
, journal =	"Inform. Process. Lett."
, volume =	"??"
, year =	"June 24, 1988"
, pages =	"105--110"
, update =	"97.03 murali"
}

@inproceedings{s-cmwkl-95
, author =	"Baruch Schieber"
, title =	"Computing a Minimum-weight {$k$}-link Path in Graphs with the Concave {Monge} Property"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"405--411"
, keywords =	"largest inscribed k-gon, smallest k-gon from set of n halfplanes, polygon containment, matrix searching"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@inproceedings{sv-flcas-88
, author =	"B. Schieber and U. Vishkin"
, title =	"On finding lowest common ancestors: {Simplification} and parallelization"
, booktitle =	"Proc. 3rd Aegean Workshop Computing"
, series =	"Lecture Notes Comput. Sci."
, volume =	319
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"111--123"
, update =	"97.11 bibrelex"
}

@book{s-frac-90
, author =	"R. J. Schilling"
, title =	"Fundamentals of Robotics, Analysis and Control"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1990
, update =	"97.03 schwarzkopf"
}

@inproceedings{shk-amc3d-95
, author =	"P. H. Schimpf and D. R. Haynor and Y. Kim"
, title =	"Automated meshing of complex 3-D domains from classified images"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"193--204"
, update =	"96.01 samitchell"
}

@article{s-emnas-94
, author =	"W. Schindler"
, title =	"Equivariant mappings: a new approach in stochastic simulations"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"327--343"
, update =	"96.09 devillers"
}

@inproceedings{s-dcc-92c
, author =	"Haijo Schipper"
, title =	"Determining Contractability of Curves"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	31
, update =	"00.03 bibrelex"
}

@inproceedings{s-dcc-92
, author =	"H. Schipper"
, title =	"Determining contractibility of curves"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"358--367"
, cites =	"d-uudg-12, d-tdkaz-12, h-cit-79, hs-aacsl-91, hs-cmlpg-91, my-chthu-88, s-tacg-90, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
, update =	"00.03 bibrelex, 97.11 bibrelex"
}

@techreport{s-gt2m-90
, author =	"H. Schipper"
, title =	"Generating triangulations of $2$-manifolds"
, type =	"Report"
, number =	"CS-9008"
, institution =	"Dept. Comput. Sci., Univ. Groningen"
, address =	"Groningen, Netherlands"
, year =	1990
}

@inproceedings{s-gt2m-91
, author =	"Haijo Schipper"
, title =	"Generating triangulations of $2$-manifolds"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"237--248"
, keywords =	"topology"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
, abstract =	"In this paper we will show how for a given triangulation
                 {$T$} of a $2$-manifold {$M$} a minimal triangulation
                 {$T_{\min}$} of {$M$} and a sequence {$S$} of
                 vertex-splittings can be calculated such that performing
                 {$S$} on {$T_{\min}$} gives {$T$}.  Our method will work
                 in either {$O(n \log n)$} time and linear space or in
                 linear time if {$O(n^2)$} space is available, where $n$ is
                 the number of vertices of {$T$}."
}

@inproceedings{s-wpga-92
, author =	"H. Schipper"
, title =	"The word problem: a geometric approach"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"59--65"
, cites =	"d-uudg-12, d-tdkaz-12, g-dawp-60, h-cit-79, hs-aacsl-91, hs-cmlpg-91, my-chthu-88, s-tacg-90, s-dcc-92, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{so-dpt-89
, author =	"H. Schipper and M. H. Overmars"
, title =	"Dynamic partition trees"
, type =	"Report"
, number =	"RUU-CS-89-25"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1989
, precedes =	"so-dpt-90"
, update =	"94.05 schwarzkopf"
}

@inproceedings{so-dpt-90
, author =	"H. Schipper and M. H. Overmars"
, title =	"Dynamic partition trees"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"404--417"
, succeeds =	"so-dpt-89"
}

@article{so-dpt-91
, author =	"H. Schipper and M. H. Overmars"
, title =	"Dynamic partition trees"
, journal =	"BIT"
, volume =	31
, year =	1991
, pages =	"421--436"
, succeeds =	"so-dpt-90"
, update =	"94.05 matousek"
}

@inproceedings{s-cscgc-99
, author =	"S. Schirra"
, title =	"A Case Study on the Cost of Geometric Computing"
, editor =	"M. T. Goodrich and C. C. McGeoch"
, booktitle =	"Algorithm Engineering and Experimentation (Proc. ALENEX~'99)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1619
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"156--176"
, update =	"00.11 smid, 00.07 vismara"
}

@techreport{s-aaac-90
, author =	"S. Schirra"
, title =	"Approximate algorithms for approximate congruence"
, type =	"Report"
, number =	"A-21/90"
, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1990
}

@article{s-adaac-92
, author =	"S. Schirra"
, title =	"Approximate decision algorithms for approximate congruence"
, journal =	"Inform. Process. Lett."
, volume =	43
, year =	1992
, pages =	"29--34"
}

@phdthesis{s-ab-92
, author =	"S. Schirra"
, title =	"Approximative {Bewegungsplanungsverfahren}"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
, keywords =	"doctoral thesis"
}

@inproceedings{s-mdbp-93
, author =	"S. Schirra"
, title =	"Moving a disc between polygons"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"395--396"
, keywords =	"video review"
, cites =	"egs-oplms-86, ht-fafnc-84, nm-lledt-90, oy-rmpmd-85, r-mdbp-91, y-oavds-87, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@incollection{s-rpigc-00
, author =	"Stefan Schirra"
, title =	"Robustness and Precision Issues in Geometric Computation"
, chapter =	14
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"597--632"
, update =	"00.03 bibrelex+smid+vismara, 99.03 bibrelex, 98.07 mitchell"
, annote =	"Chapter 14 of su-hcg-00"
}

@mastersthesis{s-udbde-88
, author =	"S. Schirra"
, title =	"{\"U}ber die {Bitkomplexit{\"a}t} der $\epsilon$-{Kongruenz}"
, school =	"Fachbereich Informatik, Universit{\"a}t des Saarlandes"
, year =	1988
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@manual{svy-crm-99
, title =	"The {CGAL} Reference Manual"
, editor =	"Stefan Schirra and Remco Veltkamp and Mariette Yvinec"
, year =	1999
, note =	"Release 2.0"
, url =	"http://www.cs.uu.nl/CGAL/"
, update =	"99.11 devillers, 99.07 devillers"
, key =	"CGAL2.0"
}

@incollection{s-feeri-94
, author =	"John Schlag"
, title =	"Fast Embossing Effects on Raster Image Data"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"433--437"
, keywords =	"bump mapping, texture, image filter, paint program, shading"
, update =	"94.09 heckbert"
, annote =	"Presents a simple, fast technique that interprets an image
as a height field or bump map, and then shades it, yielding an embossing
effect. Contains C code."
}

@incollection{slmlw-vpvlc-84
, author =	"M. Schlag and F. Luccio and P. Maestrini and D. T. Lee and C. K. Wong"
, title =	"A visibility problem in {VLSI} layout compaction"
, editor =	"Franco P. Preparata"
, booktitle =	"VLSI Theory"
, series =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1984
, pages =	"259--282"
, keywords =	"graph drawing"
, update =	"01.04 icking, 97.11 bibrelex"
}

@incollection{s-fapsm-94
, author =	"Christophe Schlick"
, title =	"A Fast Alternative to {Phong}'s Specular Model"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"385--387"
, keywords =	"Phong illumination, specular reflection, exponentiation"
, update =	"94.09 heckbert"
, annote =	"Describes a simple approximation to Phong's specular
reflection formula that does not require exponentiation or table lookup."
}

@incollection{s-fapbg-94
, author =	"Christophe Schlick"
, title =	"Fast Alternatives to {Perlin}'s Bias and Gain Functions"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"401--403"
, keywords =	"hypertexture, texture synthesis"
, update =	"94.09 heckbert"
, annote =	"Gives a simple approximation to some formulas that are
commonly used in procedural texture synthesis and volume synthesis."
}

@incollection{s-hdrp-94
, author =	"Christophe Schlick"
, title =	"High Dynamic Range Pixels"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"422--429"
, keywords =	"quantization, dynamic range"
, update =	"94.09 heckbert"
, annote =	"Proposes a pixel encoding technique that allows color
images with high dynamic range to be stored using only 24 bits per pixel.
Contains C code."
}

@article{st-fpact-99
, author =	"D. Schmalstieg and R. F. Tobler"
, title =	"Fast Projected Area Computation for Three-Dimensional Bounding Boxes"
, journal =	"J. Graphics Tools"
, volume =	4
, number =	2
, year =	1999
, pages =	"37--43"
, update =	"00.03 held"
}

@inproceedings{s-sltep-89
, author =	"F. Schmid"
, title =	"{Symbolische} {L{\"o}sungen} und {Term}-{Ersetzungssysteme} in der projektiven und affinen {Geometrie}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{sss-chbal-93
, author =	"J. P. Schmidt and A. Siegel and A. Srinivasan"
, title =	"{Chernoff}-{Hoeffding} Bounds for Applications with Limited Idependence"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"331--340"
, update =	"01.07 devillers, 98.03 bibrelex"
}

@article{s-cgcsf-92
, author =	"P.-M. Schmidt"
, title =	"Counting and generating circular sequences of finite planar point sets"
, journal =	"Algorithms Rev."
, volume =	2
, number =	3
, year =	1992
, pages =	"139--151"
}

@inproceedings{s-nppsg-94
, author =	"Peter-Michael Schmidt"
, title =	"On the Number of Permutations of Point Sets Generated by Plane Sweeps and Sphere Sweeps"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"41--44"
, update =	"00.11 smid, 00.07 icking"
}

@article{s-ipcs-85
, author =	"W. M. Schmidt"
, title =	"Integer points on curves and surfaces"
, journal =	"Monatsh. Math."
, volume =	99
, year =	1985
, pages =	"45--72"
, update =	"97.11 bibrelex"
}

@article{s-id7-72
, author =	"W. M. Schmidt"
, title =	"Irregularities of distribution VII"
, journal =	"Acta Arithmetica"
, volume =	21
, year =	1972
, pages =	"45--50"
, update =	"98.03 bibrelex"
}

@techreport{s-tscce-81
, author =	"A. Schmitt"
, title =	"On the time and space complexity of certain exact hidden line algorithms"
, type =	"Report"
, number =	"24/81"
, institution =	"Fakult{\"a}t Inform., Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1981
}

@techreport{s-rgiah-81
, author =	"A. Schmitt"
, title =	"Reporting geometric inclusions with an application to the hidden line problem"
, type =	"Report"
, number =	"18/81"
, institution =	"Univ. Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1981
}

@inproceedings{s-tsbhl-81
, author =	"A. Schmitt"
, title =	"Time and space bounds for hidden line and hidden surface algorithms"
, booktitle =	"Proc. Eurographics 81"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1981
, pages =	"43--56"
, update =	"97.11 bibrelex, 93.05 smid"
}

@book{sdk-egga-96
, author =	"A. Schmitt and O. Deussen and M. Kreeb"
, title =	"Einf{\"u}hrung in graphisch-geometrische {Algorithmen}"
, publisher =	"B. G. Teubner"
, address =	"Stuttgart"
, year =	1996
, keywords =	"textbook, in German"
, update =	"99.11 bibrelex, 97.03 smid"
}

@proceedings{sm-iwcg-85
, title =	"Abstracts 3rd Intern. Workshop Comput. Geom."
, editor =	"A. Schmitt and H. M{\"u}ller"
, nickname =	"CG '85"
, site =	"Karlsruhe"
, publisher =	"Universit{\"a}t Karlsruhe"
, year =	1985
, update =	"00.03 bibrelex"
}

@incollection{sml-rtatp-88
, author =	"A. Schmitt and H. M{\"u}ller and W. Leister"
, title =	"Ray tracing algorithms: theory and practice"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"997--1030"
, keywords =	"ray tracing, implementing algorithms, survey paper"
, update =	"99.11 bibrelex"
}

@inproceedings{ss-dvdok-91
, author =	"D. Schmitt and J.-C. Spehner"
, title =	"On {Delaunay} and {Voronoi} diagrams of order $k$ in the plane"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"29--32"
, cites =	"agss-ltacv-89, a-ndrcv-90, bt-hrodt-86, bdt-dchov-90, ce-iacko-87, e-esaa-86, eos-calha-86, es-cvdpu-90, l-knnvd-82, sh-cpp-75, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{ss-edded-93
, author =	"D. Schmitt and J.-C. Spehner"
, title =	"On equiangularity of {Delaunay} diagrams in every dimension"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"346--351"
, cites =	"a-vdsfg-91, e-acg-87, ms-getcc-88, ps-cgi-85, r-odtr-91, s-let-78, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{sg-apads-85
, author =	"F. Schmitt and B. Gholizadeh"
, title =	"Adaptive Polyhedral Approximation of Digitized Surfaces"
, booktitle =	"Proc. SPIE Conf. on Comput. Vision ind Robots"
, site =	"Bellingham, Walsh"
, volume =	595
, year =	1985
, pages =	"167--171"
, update =	"98.11 bibrelex"
}

@article{sbd-asmsf-86
, author =	"F. J. Schmitt and B. A. Barsky and W. Du"
, title =	"An Adaptive Subdivision Method for Surface-fitting from Sampled Data"
, journal =	"Comput. Graph."
, volume =	20
, number =	4
, year =	1986
, pages =	"179--188"
, note =	"Proc. SIGGRAPH '86"
, update =	"96.09 devillers, 95.01 mitchell"
}

@inproceedings{s-seaac-89
, author =	"Michel Schmitt"
, title =	"Some examples of Algorithms Analysis in Computational Geometry by Means of Mathematical Morphological Techniques"
, editor =	"J.-D. Boissonnat and J.-P. Laumond"
, booktitle =	"Proc. of the Workshop on Geometry and Robotics"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, publisher =	"Springer-Verlag"
, year =	1989
, update =	"00.03 devillers"
}

@article{s-dspdp-91
, author =	"P. Schmitt"
, title =	"Disks with special properties of densest packings"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"181--190"
}

@article{s-smsp-87
, author =	"P. Schmitt"
, title =	"$\sigma$-morphic sets of prototiles"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"271--295"
}

@book{sb-mla-89
, author =	"H. Schneider and G. P. Barker"
, title =	"Matrices and Linear Algebra"
, publisher =	"Dover Publ."
, year =	1989
, update =	"98.11 bibrelex"
}

@book{s-cbbmt-93
, author =	"R. Schneider"
, title =	"Convex bodies: {The} {Brunn}-{Minkowski} theory"
, series =	"Encyclopedia of Mathematics and its Applications"
, volume =	44
, publisher =	"Cambridge University Press"
, year =	1993
, update =	"98.03 bibrelex"
}

@incollection{s-dasg-97
, author =	"R. Schneider"
, title =	"Discrete aspects of stochastic geometry"
, chapter =	9
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"167--184"
, update =	"97.11 orourke"
}

@article{s-kkk-72
, author =	"R. Schneider"
, title =	"Kr{\"u}mmungsschwerpunkte konvexer {K{\"o}rper}"
, journal =	"Abh. Math. Sem. Hamburg"
, volume =	37
, year =	1972
, pages =	"112--132"
, update =	"98.03 bibrelex"
}

@article{s-racs-88
, author =	"R. Schneider"
, title =	"Random approximation of convex sets"
, journal =	"Microscopy"
, volume =	151
, year =	1988
, pages =	"211--227"
, update =	"97.11 bibrelex"
}

@article{s-tgh-87
, author =	"R. Schneider"
, title =	"Tessellations generated by hyperplanes"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"223--232"
}

@inproceedings{sk-ttnrp-91
, author =	"Ralf Schneider and Hans-Peter Kriegel"
, title =	"The {TR*}-tree: A new representation of polygonal objects supporting spatial queries and operations"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"249--263"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{s-aghfe-95
, author =	"Robert Schneiders"
, title =	"Automatic Generation of Hexahedral Finite Element Meshes"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"103--114"
, update =	"96.01 samitchell"
}

@misc{s-op-
, author =	"R. Schneiders"
, title =	"Open problem"
, url =	"http://www-users.informatik.rwth-aachen.de/~roberts/open.html"
, update =	"97.11 bibrelex"
}

@inproceedings{ssw-obghe-96
, author =	"R. Schneiders and R. Schindler and F. Weiler"
, title =	"Octree-based generation of hexahedral element meshes"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"205--215"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@inproceedings{s-epgg-90
, author =	"W. Schnyder"
, title =	"Embedding Planar Graphs on the Grid"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"138--148"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{s-pgpd-89
, author =	"W. Schnyder"
, title =	"Planar Graphs and Poset Dimension"
, journal =	"Order"
, volume =	5
, year =	1989
, pages =	"323--343"
, keywords =	"graph drawing, convex polytope, order dimension"
, update =	"95.05 tamassia"
}

@article{st-ce3cp-92
, author =	"W. Schnyder and W. T. Trotter"
, title =	"Convex Embeddings of 3-Connected Plane Graphs"
, journal =	"Abstracts of the AMS"
, volume =	13
, number =	5
, year =	1992
, pages =	502
, keywords =	"graph drawing, planar, convex, straight-line"
, update =	"98.07 tamassia+vismara, 96.09 tamassia"
}

@article{s-npscf-91
, author =	"T. Sch{\"o}bel"
, title =	"A new parsing strategy for context free grammars"
, journal =	"Algorithms Rev."
, volume =	2
, number =	2
, year =	1991
, pages =	"63--76"
}

@inproceedings{s-dcamv-86
, author =	"A. H. Schoen"
, title =	"A defect-correction algorithm for minimizing the volume of a simple polyhedron which circumscribes a sphere"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"159--168"
, cites =	"bh-vpius-70, bs-dcmta-84, g-ipp-35, gp-taafp-86, g-cp-67, k-vmafs-72, l-rmctf-82, mks-eapuc-77, m-aludk-97, s-pur-22, s-uipkp-27, wwv-oasdt-85, ZZZ"
, update =	"97.11 bibrelex"
}

@article{sz-clccp-67
, author =	"I. J. Schoenberg and S. K. Zaremba"
, title =	"On {Cauchy}'s lemma concerning convex polygons"
, journal =	"Canad. J. Math."
, volume =	19
, year =	1967
, pages =	"1062--1077"
, update =	"00.11 smid, 00.07 orourke"
}

@book{ss-gisur-90
, title =	"Geographical Information Systems for Urban and Regional Planning"
, editor =	"H. J. Scholten and J. C. H. Stillwell"
, publisher =	"Kluwer Academic Publishers"
, address =	"the Netherlands"
, year =	1990
, update =	"96.09 kreveld"
}

@article{so-gmarr-89
, author =	"H. W. Scholten and M. H. Overmars"
, title =	"General methods for adding range restrictions to decomposable searching problems"
, journal =	"J. Symbolic Comput."
, volume =	7
, year =	1989
, pages =	"1--10"
}

@phdthesis{s-immk-94
, author =	"E. Sch{\"o}mer"
, title =	"Interaktive {Montagesimulation} mit {Kollisionserkennung}"
, school =	"Universit{\"a}t des Saarlandes"
, address =	"Saarbr{\"u}cken, Germanyy"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{ssty-easec-96
, author =	"E. Sch{\"o}mer and J. Sellen and M. Teichmann and C. Yap"
, title =	"Efficient algorithms for the smallest enclosing cylinder problem"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"264--269"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@techreport{ssty-sec-96t
, author =	"Elmar Sch{\"o}mer and Jurgen Sellen and Marek Teichmann and Chee Yap"
, title =	"Smallest Enclosing Cylinders"
, type =	"Technical {Report}"
, institution =	"Courant Institute, New York University"
, year =	1996
, url =	"http://www.cs.nyu.edu"
, update =	"97.11 bibrelex"
}

@inproceedings{ssty-sec-96
, author =	"Elmar Sch{\"o}mer and Jurgen Sellen and Marek Teichmann and Chee Yap"
, title =	"Smallest Enclosing Cylinders"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"C13--C14"
, cites =	"agr-pahdc-94, am-rsss-94, m-apcad-83, ptvf-nrc-88, ssty-sec-96t, y-ecgtm-95, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{ssty-sec-00
, author =	"E. Sch{\"o}mer and J. Sellen and M. Teichmann and C. K. Yap"
, title =	"Smallest Enclosing Cylinders"
, journal =	"Algorithmica"
, volume =	27
, number =	2
, year =	2000
, pages =	"170--186"
, update =	"00.11 smid, 00.07 held"
}

@inproceedings{ssw-egcd-95
, author =	"Elmar Sch{\"o}mer and J{\"u}rgen Sellen and Markus Welsch"
, title =	"Exact Geometric Collision Detection"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"211--216"
, update =	"95.09 jones"
}

@techreport{st-ecdmp-94
, author =	"E. Sch{\"o}mer and C. Thiel"
, title =	"Efficient collision detection for moving polyhedra"
, type =	"Report"
, number =	"MPI-I-94-147"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"95.01 smid"
}

@inproceedings{st-ecdmp-95
, author =	"Elmar Sch{\"o}mer and Christian Thiel"
, title =	"Efficient Collision Detection for Moving Polyhedra"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"51--60"
, keywords =	"intersection detection, linearization, range queries, parametric search, Plucker coordinates"
, cites =	"am-rsss-92, am-rsps-92, aps-zsha-93, b-idss-79, dk-ladsc-85, c-dcbp-84, dk-dsppu-90, dhks-isccd-90, k-nrdsc-92, m-rsehc-91, m-apcad-83, n-flsah-85, p-crz-91, p-innpl-92, p-rst3s-93, ps-cgi-85, s-immk-94, us-hmsss-92, yy-gaddg-85, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{st-sagcd-96
, author =	"Elmar Sch{\"o}mer and Christian Thiel"
, title =	"Subquadratic Algorithms for the General Collision Detection Problem"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"95--101"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@techreport{s-ftatc-82
, author =	"A. Sch{\"o}nhage"
, title =	"The fundamental theorem of algebra in terms of computational complexity"
, institution =	"Univ. T{\"u}bingen"
, year =	1982
, update =	"98.03 bibrelex"
}

@article{spp-fm-76
, author =	"A. Sch{\"o}nhage and M. Paterson and N. Pipinger"
, title =	"Finding the median"
, journal =	"J. Comput. Syst. Sci."
, volume =	13
, year =	1976
, pages =	"184--199"
, update =	"97.11 bibrelex"
}

@article{s-udzvd-28
, author =	"E. Sch{\"o}nhardt"
, title =	"{\"U}ber die {Zerlegung} von {Dreieckspolyedern} in {Tetraeder}"
, journal =	"Math. Ann."
, volume =	98
, year =	1928
, pages =	"309--312"
, update =	"97.11 bibrelex"
}

@mastersthesis{s-bkeup-94
, author =	"S. Sch{\"o}nherr"
, title =	"Berechnung kleinster {Ellipsoide} um {Punktmengen}"
, school =	"Free University Berlin"
, address =	"Berlin, Germany"
, year =	1994
, note =	"Diploma Thesis"
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@techreport{sl-tssp-80
, author =	"Anneke A. Schoone and J. van Leeuwen"
, title =	"Triangulating a star-shaped polygon"
, type =	"Report"
, number =	"RUU-CS-80-3"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1980
, update =	"94.05 schwarzkopf, 93.09 rote+smid"
}

@inproceedings{s-adgc-90
, author =	"Peter Schorn"
, title =	"Accuracy and Degeneracy in Geometric Computation"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	22
, update =	"00.03 bibrelex"
}

@inproceedings{s-aeapp-90
, author =	"P. Schorn"
, title =	"Accurate and efficient algorithms for proximity problems"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"24--27"
, cites =	"gy-frcg-86, h-pargc-89, hns-psscp-88, hns-arsa2-92, m-vigau-88t, m-dpggt-89, gss-egbra-89, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{s-ooweg-90
, author =	"P. Schorn"
, title =	"An object-oriented workbench for experimental geometric computation"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"172--175"
, cites =	"f-savd-87, g-pacpa-88, hns-psscp-88, mn-lledt-89, ps-cgi-85, r-pa-76, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{s-ixgpe-91
, author =	"Peter Schorn"
, title =	"Implementing the {XYZ} {GeoBench}: A programming environment for geometric algorithms"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"187--202"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@phdthesis{s-raplg-91t
, author =	"P. Schorn"
, title =	"Robust algorithms in a program library for geometric computation"
, type =	"Ph.{D}. Thesis"
, school =	"ETH Z{\"u}rich, Switzerland"
, year =	1991
, note =	"Report 9519"
, keywords =	"doctoral thesis"
, precedes =	"s-raplg-91"
, update =	"98.11 bibrelex"
}

@book{s-raplg-91
, author =	"P. Schorn"
, title =	"Robust Algorithms in a Program Library for Geometric Computation"
, series =	"Informatik-Dissertationen ETH Z{\"u}rich"
, volume =	32
, publisher =	"Verlag der Fachvereine"
, address =	"Z{\"u}rich"
, year =	1991
, succeeds =	"s-raplg-91t"
, update =	"98.11 bibrelex, 97.03 icking"
}

@incollection{sf-tcp-94
, author =	"Peter Schorn and Frederick Fisher"
, title =	"Testing the Convexity of a Polygon"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"7--15"
, keywords =	"computational geometry, concave polygon"
, update =	"94.09 heckbert"
, annote =	"Gives an algorithm and code to determine if a polygon is
convex, non-convex (concave but not convex), or non-simple
(self-intersecting). For many polygon operations, faster algorithms can be
used if the polygon is known to be convex. This is true when scan converting
a polygon and when determining if a point is inside a polygon, for instance.
Contains C code."
}

@article{s-acspt-83
, author =	"Schrader"
, title =	"Approximations of clustering and subgraph problems on trees"
, journal =	"Discrete Appl. Math."
, volume =	6
, year =	1983
, update =	"97.11 bibrelex"
}

@techreport{s-hce-90
, author =	"O. Schramm"
, title =	"How to Cage an Egg"
, type =	"Technical {Report}"
, institution =	"Univ. of California, San Diego"
, year =	1990
, keywords =	"circumscribe, inscribe, packing, circle packing, convex, Cauchy Lemma, rigidity"
, update =	"93.09 milone+mitchell"
}

@techreport{s-ptdbp-??
, author =	"O. Schramm"
, title =	"Packing two-dimensional bodies with prescribed combinatorics and applications to the construction of conformal and Quasiconformal mappings"
, type =	"Technical {Report}"
, institution =	"Univ. of California, San Diego"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{s-vdbak-91
, author =	"Thomas Schreiber"
, title =	"A {Voronoi} diagram based adaptive $k$-means-type clustering algorithm for multidimensional weighted data"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"265--275"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{s-pa3do-97
, author =	"Thomas Schreiber"
, title =	"Polyhedral Approximation of 3D Objects from Scattered Boundary Points"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"43--44"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{s-dhptp-91
, author =	"A. Schrijver"
, title =	"Disjoint homotopic paths and trees in a planar graph"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"527--574"
}

@techreport{s-pccfc-??
, author =	"A. Schrijver"
, title =	"Packing and covering of crossing families of cuts"
, institution =	"Instituut voor Actuariaat en Econometrie"
, address =	"Amsterdam, Holland"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@book{s-tlip-86
, author =	"A. Schrijver"
, title =	"Theory of Linear and Integer Programming"
, publisher =	"Wiley-Interscience"
, address =	"New York, NY"
, year =	1986
, update =	"97.03 schwarzkopf, 93.09 milone+mitchell"
}

@article{sh-ffbtp-93
, author =	"P. Schr{\"o}der and P. Hanrahan"
, title =	"On the form factor between two polygons"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1993
, pages =	"163--164"
, note =	"Proc. SIGGRAPH '93"
, update =	"98.03 bibrelex"
}

@article{ss-codmf-90
, author =	"W. J. Schroeder and M. S. Shephard"
, title =	"A Combined Octree {Delaunay} Method for Fully-Automatic 3-{D} Mesh Generation"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	29
, number =	1
, year =	1990
, pages =	"37--55"
, annote =	"Basically octree is used to generate nodes and
		 Delaunay triangulation of these nodes is created."
}

@article{ss-gbfam-88
, author =	"W. J. Schroeder and M. S. Shephard"
, title =	"Geometry-Based Fully-Automatic Mesh Generation and the {Delaunay} Triangulation"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	26
, number =	11
, year =	1988
, pages =	"2503--2515"
, annote =	"Adds extra points to satisfy constrained edges."
}

@article{ss-oaagg-89
, author =	"W. J. Schroeder and M. S. Shephard"
, title =	"${O}({N})$ Algorithm To Automatically Generate Geometric Triangulations Satisfying The {Delaunay} Circumsphere Criteria"
, journal =	"Eng. Comput. (USA)"
, volume =	5
, number =	"3--4"
, year =	1989
, pages =	"177--193"
, keywords =	"geometric triangulations, Delaunay circumsphere criteria"
, update =	"00.11 smid, 00.07 icking, 96.09 devillers"
, annote =	"Generates points in an octree."
, abstract =	"This paper presents an algorithm for the generation of
		 Delaunay triangulations for general nonmanifold
		 geometric models. Octree concepts are used for point
		 placement and providing the linear, with respect to the
		 number of elements, growth rate of the algorithm.
		 Compatibility and classification procedures are used in
		 conjunction with point injection procedures to ensure
		 that the final Delaunay triangulation is a geometric
		 triangulation of the domain of interest. (Author
		 abstract) 23 Refs."
}

@article{szl-dtm-92
, author =	"W. J. Schroeder and J. A. Zarge and W. E. Lorensen"
, title =	"Decimation of Triangle Meshes"
, journal =	"Comput. Graph."
, volume =	26
, number =	2
, year =	1992
, pages =	"65--70"
, note =	"Proc. SIGGRAPH '92"
, keywords =	"geometric modeling, medical imaging, terrain modeling, volume modeling"
, update =	"93.09 milone+mitchell"
}

@article{sb-hismd-94
, author =	"P. Schroeter and J. Big{\"u}n"
, title =	"Hierarchical Image Segmentation by Multi-Dimensional Clustering and Orientation-Adaptive Boundary Refinement"
, journal =	"Pattern Recogn."
, volume =	28
, number =	5
, year =	1995
, pages =	"695--709"
, keywords =	"hierarchical image segmentation, multi-dimensional clustering"
, update =	"98.07 agarwal"
}

@article{s-bdpvv-61
, author =	"H. Schubert"
, title =	"{Bestimmung} der {Primfaktorzerlegung} von {Verkettungen}"
, journal =	"Mathematische Zeitschrift"
, volume =	76
, year =	1961
, pages =	"116--148"
, update =	"97.11 bibrelex"
}

@inproceedings{s-agtv-90
, author =	"Sven Schuierer"
, title =	"A General Theory of Visibility"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	23
, update =	"00.03 bibrelex"
}

@article{s-otack-94
, author =	"S. Schuierer"
, title =	"An $O(\log \log n)$ Time Algorithm to Compute the Kernel of a Polygon"
, journal =	"Nordic J. Comput."
, volume =	1
, year =	1994
, pages =	"458--474"
, update =	"95.05 smid"
}

@article{s-odssr-96
, author =	"S. Schuierer"
, title =	"An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"205--226"
, succeeds =	"s-rpqsr-93"
, update =	"96.09 devillers"
}

@inproceedings{s-cglds-94
, author =	"Sven Schuierer"
, title =	"Computing the Geodesic {$L_1$}-Diameter of a Simple Rectilinear Polygon in Parallel"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	72
, cites =	"hs-msspm-93, psr-cgcsp-89, ZZZ"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{s-cldcs-92
, author =	"Sven Schuierer"
, title =	"Computing the {$L_1$}-Diameter and Center of a Simple Polygon"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"73--76"
, update =	"00.03 bibrelex"
}

@inproceedings{s-ersls-97
, author =	"Sven Schuierer"
, title =	"Efficient Robot Self-Localization in Simple Polygons"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"20--22"
, cites =	"drw-lrmt-95, gmr-rlptd-92 , ZZZ"
, update =	"99.07 bibrelex, 98.07 bibrelex"
}

@incollection{s-lbogs-97
, author =	"S. Schuierer"
, title =	"Lower Bounds in On-line Geometric Searching"
, booktitle =	"11th International Symposium on Fundamentals of Computation Theory"
, nickname =	"FCT '97"
, site =	"Krakow, Poland"
, series =	"Lecture Notes Comput. Sci."
, volume =	1279
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"429--440"
, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@article{s-lbogs-01
, author =	"S. Schuierer"
, title =	"Lower Bounds in On-line Geometric Searching"
, journal =	"Comput. Geom. Theory Appl."
, volume =	18
, year =	2001
, pages =	"37--53"
, update =	"01.04 smid"
}

@phdthesis{s-gv-91
, author =	"S. Schuierer"
, title =	"On Generalized Visibility"
, school =	"Universit{\"a}t Freiburg"
, year =	1991
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{s-olsgt-97
, author =	"Sven Schuierer"
, title =	"On--Line Searching in Geometric Trees"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"135--140"
, update =	"97.11 jones"
}

@inproceedings{s-rpqsr-93
, author =	"S. Schuierer"
, title =	"Rectilinear path queries in a simple rectilinear polygon"
, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	665
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"282--293"
, precedes =	"s-odssr-96"
, update =	"96.09 devillers, 93.05 smid"
}

@techreport{s-smbr-98
, author =	"Sven Schuierer"
, title =	"Searching on $m$ Bounded Rays Optimally"
, number =	112
, institution =	"Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
, address =	"Germany"
, year =	1998
, update =	"00.03 bibrelex"
}

@techreport{srw-gtv-89
, author =	"S. Schuierer and G. Rawlings and D. Wood"
, title =	"A general theory of visibility"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Univ. Waterloo"
, year =	1989
, note =	"In preparation"
, update =	"98.07 bibrelex"
}

@inproceedings{srw-gsv-91
, author =	"Sven Schuierer and Gregory J. E. Rawlins and Derick Wood"
, title =	"A generalization of staircase visibility"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"277--287"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{srw-gsv-cccg-91
, author =	"S. Schuierer and G. J. E. Rawlins and D. Wood"
, title =	"A generalization of staircase visibility"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"96--99"
, cites =	"cg-opapp-88, cr-uaopc-89, lp-oafkp-79, mrs-copsp-88, rw-cgro-88, rw-ocfoc-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{srw-tgtv-90
, author =	"S. Schuierer and G. J. E. Rawlins and D. Wood"
, title =	"Towards a general theory of visibility"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"354--357"
, cites =	"b-cvdks-82, cr-cpih-88, ghlst-ltavs-87, h-etdf-63, j-pacca-82, k-mchco-86, l-htac-51, lp-fatsd-81, r-erog-87, s-ecsas-85, sw-oaccs-84, t-cvor-88, t-ghtt-88, v-lcls-65, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{ss-ossus-99
, author =	"Sven Schuierer and Ines Semrau"
, title =	"An Optimal Strategy for Searching in Unknown Streets"
, booktitle =	"Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
, nickname =	"STACS '99"
, site =	"Trier"
, series =	"Lecture Notes Comput. Sci."
, volume =	1563
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"121--131"
, succeeds =	"ss-oss-98"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@techreport{ss-oss-98
, author =	"Sven Schuierer and Ines Semrau"
, title =	"Eine optimale {Suchstrategie} f{\"u}r {Stra{\ss}en}"
, number =	97
, institution =	"Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
, address =	"Germany"
, year =	1998
, url =	"http://www.informatik.uni-freiburg.de/tr/1998/Report97/"
, precedes =	"ss-ossus-99"
, update =	"00.03 bibrelex"
}

@inproceedings{sw-gkph-93
, author =	"S. Schuierer and D. Wood"
, title =	"Generalized kernels of polygons with holes"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"222--227"
, cites =	"be-nlcha-84, cg-opapp-88, cr-uaopc-89, gn-mcgop-90, gy-fchsp-83, k-mchco-86, l-fchsp-83, lp-oafkp-79, ma-lafch-79, mrs-copsp-88, mrs-pgocc-88, ow-rv-88, rw-cgro-88, r-erog-87, rw-ocig-88, rc-csopm-87, s-gv-91, srw-gsv-cccg-91, ce-oails-88, mow-vv-87, nllw-xchsx-83, rw-ocfoc-87, wy-ocsp-88, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{sw-svck-95
, author =	"S. Schuierer and D. Wood"
, title =	"Staircase visibility and computation of kernels"
, journal =	"Algorithmica"
, volume =	14
, year =	1995
, pages =	"1--26"
, update =	"95.09 smid"
}

@article{s-eps-93
, author =	"L. J. Schulman"
, title =	"An equipartition of planar sets"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"257--266"
, update =	"94.05 matousek"
}

@incollection{s-spp-97
, author =	"E. Schulte"
, title =	"Symmetry of polytopes and polyhedra"
, chapter =	16
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"311--330"
, update =	"97.11 orourke"
}

@incollection{s-t-93
, author =	"E. Schulte"
, title =	"Tilings"
, editor =	"P. M. Gruber and J. M. Wills"
, booktitle =	"Handbook of convex geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1993
, update =	"98.03 bibrelex"
}

@article{sw-grdrm-86
, author =	"E. Schulte and J. M. Wills"
, title =	"Geometric realizations for {Dyck}'s regular map on a surface of genus 3"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"141--153"
}

@techreport{sbgs-sacgi-69
, author =	"R. A. Schumacker and R. Brand and M. Gilliland and W. Sharp"
, title =	"Study for Applying Computer-Generated Images to Visual Simulation"
, number =	"AFHRL--TR--69--14"
, institution =	"U.S. Air Force Human Resources Laboratory"
, year =	1969
, update =	"97.07 agarwal"
}

@book{s-sfbt-81
, author =	"L. Schumaker"
, title =	"Spline functions, basic theory"
, publisher =	"Wiley-Interscience"
, address =	"New York, NY"
, year =	1981
, update =	"97.11 bibrelex"
}

@article{s-bdsmp-84
, author =	"L. L. Schumaker"
, title =	"Bounds on the dimension of spaces of multivariate piecewise polynomials"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"251--264"
}

@article{s-cotus-93
, author =	"L. L. Schumaker"
, title =	"Computing Optimal Triangulations Using Simulated Annealing"
, journal =	"Comput. Aided Geom. Design"
, volume =	10
, number =	"3--4"
, month =	aug
, year =	1993
, pages =	"329--345"
, update =	"95.05 held"
}

@incollection{s-fssd-76
, author =	"L. L. Schumaker"
, title =	"Fitting surfaces to scattered data"
, editor =	"G. G. Lorentz and C. K. Chui and L. L. Schumaker"
, booktitle =	"Approximation Theory II"
, publisher =	"Academic Press"
, year =	1976
, pages =	"203--268"
, update =	"97.11 bibrelex"
}

@incollection{s-r3doc-89
, author =	"L. L. Schumaker"
, title =	"Reconstructing $3$-d objects from cross-sections"
, editor =	"W. Dahmen and M. Gasca and C. A. Micchelli"
, booktitle =	"Computation of curves and surfaces"
, publisher =	"Kluwer Academic Publishers"
, year =	1989
, pages =	"275--309"
, update =	"98.03 bibrelex"
}

@incollection{s-tm-87
, author =	"L. L. Schumaker"
, title =	"Triangulation methods"
, editor =	"C. K. Chui and L. L. Schumaker and F. I. Utreras"
, booktitle =	"Topics in Multivariate Approximation"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1987
, pages =	"219--232"
, update =	"98.11 bibrelex"
}

@article{s-tc-93
, author =	"L. L. Schumaker"
, title =	"Triangulations in CAGD"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, month =	jan
, year =	1993
, pages =	"47--552"
, update =	"97.11 bibrelex"
}

@article{s-usedkkk-21
, author =	"A. Schur"
, title =	"{\"U}ber die {S}chwarzche {E}xtremaleigenschaft des {K}reises unter den {K}urven konstantes {K}r{\"u}mmung"
, journal =	"Math. Ann."
, volume =	83
, year =	1921
, pages =	"143--148"
, update =	"00.11 smid, 00.07 orourke"
}

@phdthesis{s-uekvm-01
, author =	"I. Schur"
, title =	"{\"U}ber eine {Klasse} von {Matrizen}, die sich einer gegebenen {Matrix} zuordnen lassen"
, school =	"??"
, address =	"Berlin"
, year =	1901
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@book{s-tt-79
, author =	"A. W. Schurle"
, title =	"Topics in topology"
, publisher =	"North-Holland"
, address =	"New York, NY"
, year =	1979
, update =	"98.07 bibrelex"
}

@inproceedings{ss-astae-87
, author =	"A. Schwartz and C. Stanton"
, title =	"Analyzing surfaces: the truth about elimination theory"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"348--353"
, cites =	"b-iha-07, gsa-vetii-84, g-cvrtp-81, hm-im-77, hp-mag-52, hh-qbs-86, k-eag-77, m-ssr-79, mt-cmcag-84, s-limha-85, sg-agcag-86, s-bag-77, s-agtd-34, w-rfeb-, w-ma-53, w-ac-62, ZZZ"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{s-smpsp-77
, author =	"E. L. Schwartz"
, title =	"Spatial Mapping in primate sensory projection; analytic structure and relevance in perception"
, journal =	"Biological Cybernetics"
, volume =	25
, year =	1977
, pages =	"181--194"
, update =	"98.07 bibrelex"
}

@article{s-dsvpm-77
, author =	"E. L. Schwartz"
, title =	"The development of specific visual projections in the monkey and the goldfish: outline of a geometric theory of receptotopic structure"
, journal =	"J. Theoret. Biol."
, volume =	69
, year =	1977
, pages =	"655--685"
, update =	"98.07 bibrelex"
}

@article{sgb-svavd-95
, author =	"E. L. Schwartz and D. N. Grece and G. Bonmassar"
, title =	"Space-variant active vision: {Definition}, overview and examples"
, journal =	"Neural Networks"
, volume =	8
, number =	"7-8"
, year =	1995
, pages =	"1297--1308"
, update =	"98.07 bibrelex"
}

@techreport{ssw-nsgmm-87
, author =	"E. L. Schwartz and A. Shaw and E. Wolfson"
, title =	"A Numerical Solution to the Generalized Map-Maker's Problem: {Flattening} Non-Convex Poleyderal Surfaces"
, type =	"Technical Report"
, institution =	"Dept. of Computer Science, Courant Institute of Mathematical Sciences"
, year =	1987
, precedes =	"ssw-nsgmm-89"
, update =	"95.01 mitchell, 93.09 milone+mitchell"
}

@article{ssw-nsgmm-89
, author =	"E. L. Schwartz and A. Shaw and E. Wolfson"
, title =	"A Numerical Solution to the Generalized Map-Maker's Problem: {Flattening} Nonconvex Poleyderal Surfaces"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	11
, number =	9
, year =	1989
, pages =	"1005--1008"
, succeeds =	"ssw-nsgmm-87"
, update =	"95.01 mitchell, 95.01 mitchell"
}

@techreport{sw-mmpco-85
, author =	"E. L. Schwartz and E. Wolfson"
, title =	"On the map makers problem: computing an optimal quasi-isometry from an arbitrary polyhedron to the plane"
, type =	"Report"
, number =	"??"
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1985
}

@article{s-fpavp-80
, author =	"J. Schwartz"
, title =	"Fast Probabilistic Algorithms for Verification of Polynomial Identities"
, journal =	"J. ACM"
, volume =	4
, year =	1980
, pages =	"701--717"
, update =	"97.11 bibrelex"
}

@techreport{ss-pmp2g-82
, author =	"J. Schwartz and C. Yap"
, title =	"On the ``piano movers'' problem {II}: general techniques for computing topological properties of real algebraic manifolds"
, number =	41
, institution =	"Dept. Comput. Sci., New York Univ."
, year =	1982
, update =	"98.03 bibrelex"
}

@misc{s-atdgi-85
, author =	"J. T. Schwartz"
, title =	"Algebraic techniques for dealing with the geometry of intersecting surfaces in $n$ dimensions"
, year =	1985
, note =	"Invited talk at 1st Annu. ACM Sympos. Comput. Geom."
}

@article{s-fmdbt-81
, author =	"J. T. Schwartz"
, title =	"Finding the minimum distance between two convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	13
, year =	1981
, pages =	"168--170"
}

@book{s-nfa-69
, author =	"J. T. Schwartz"
, title =	"Nonlinear Functional Analysis"
, publisher =	"Gordon and Breach Science Publishers"
, address =	"New York"
, year =	1969
, update =	"98.11 bibrelex"
}

@article{ss-smprg-88
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"A survey of motion planning and related geometric algorithms"
, journal =	"Artif. Intell."
, volume =	37
, year =	1988
, pages =	"157--169"
, keywords =	"motion planning, robotics, survey paper"
, succeeds =	"ss-mprga-86"
, precedes =	"ss-smprg-89"
, update =	"98.03 mitchell"
}

@incollection{ss-smprg-89
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"A survey of motion planning and related geometric algorithms"
, editor =	"D. Kapur and J. Mundy"
, booktitle =	"Geometric Reasoning"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1989
, pages =	"157--169"
, keywords =	"motion planning, robotics, survey paper"
, succeeds =	"ss-smprg-88"
, update =	"98.03 mitchell, 94.05 devillers+sharir"
}

@incollection{ss-ampr-90
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Algorithmic motion planning in robotics"
, editor =	"J. van Leeuwen"
, booktitle =	"Algorithms and Complexity"
, series =	"Handbook of Theoretical Computer Science"
, volume =	"A"
, publisher =	"Elsevier"
, address =	"Amsterdam"
, year =	1990
, pages =	"391--430"
, keywords =	"motion planning, robotics, survey paper"
, succeeds =	"s-ampr-89"
, update =	"98.03 mitchell"
}

@techreport{ss-empae-85
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Efficient motion planning algorithms in environments of bounded local complexity"
, type =	"Report"
, number =	164
, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1985
, update =	"98.03 mitchell"
}

@inproceedings{ss-feftt-87
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Finding effective ``force targets'' for two-dimensional multifinger frictional grips"
, booktitle =	"Proc. 25th Allerton Conf. Commun. Control Comput."
, year =	1987
, pages =	"843--848"
, update =	"98.03 mitchell, 94.05 sharir"
}

@article{ss-feftt-92
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Finding effective ``force targets'' for two-dimensional multifinger frictional grips"
, journal =	"Algorithmica"
, volume =	8
, year =	1992
, pages =	"1--20"
, succeeds =	"ss-feftt-87"
, update =	"98.03 mitchell, 94.05 sharir"
}

@article{ss-ipoot-87
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Identification of partially obscured objects in two dimensions by matching of noisy ``characteristic curves''"
, journal =	"Internat. J. Robot. Res."
, volume =	6
, number =	2
, year =	1987
, pages =	"29--44"
, keywords =	"computer vision, curves, matchings, two-dimensional"
, update =	"98.03 mitchell"
}

@article{ss-mptr-83
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Mathematical problems and training in robotics"
, journal =	"Notices Amer. Math. Soc."
, volume =	30
, year =	1983
, pages =	"478--481"
, keywords =	"survey paper, robotics"
, update =	"98.03 mitchell"
}

@inproceedings{ss-mprga-86
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Motion planning and related geometric algorithms in robotics"
, booktitle =	"Proc. Internat. Congress Math."
, site =	"Berkeley, CA"
, volume =	2
, year =	1986
, pages =	"1594--1611"
, keywords =	"motion planning, robotics, survey paper"
, precedes =	"ss-smprg-88"
, update =	"98.03 mitchell"
}

@inproceedings{ss-bfmpi-87
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"On the bivariate function minimization problem and its applications to motion planning"
, booktitle =	"Proc. 14th Int. Colloq. Aut. Lang. Prog."
, year =	1987
, pages =	"357--363"
, update =	"98.03 mitchell, 94.05 sharir"
}

@article{ss-pmp1c-83
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"On the ``piano movers'' problem {I}: {T}he case of a two-dimensional rigid polygonal body moving amidst polygonal barriers"
, journal =	"Commun. Pure Appl. Math."
, volume =	36
, year =	1983
, pages =	"345--398"
, keywords =	"motion planning"
, update =	"98.07 agarwal, 98.03 mitchell"
}

@article{ss-pmp2g-83
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"On the ``piano movers'' problem {II}: {G}eneral techniques for computing topological properties of real algebraic manifolds"
, journal =	"Adv. Appl. Math."
, volume =	4
, year =	1983
, pages =	"298--351"
, keywords =	"motion planning, algebraic geometry"
, update =	"98.07 agarwal, 98.03 mitchell"
}

@techreport{ss-pmp3c-82
, author =	"J. T. Schwartz and M. Sharir"
, title =	"On the ``piano movers'' problem {III}: coordinating the motion of several independent bodies: the special case of circular bodies amidst polygonal barriers"
, type =	"Technical {Report}"
, number =	52
, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1982
, update =	"98.03 bibrelex"
}

@article{ss-pmp3c-83
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"On the ``piano movers'' problem {III}: coordinating the motion of several independent bodies: the special case of circular bodies moving amidst polygonal barriers"
, journal =	"Internat. J. Robot. Res."
, volume =	2
, number =	3
, year =	1983
, pages =	"46--75"
, keywords =	"motion planning"
, update =	"98.03 mitchell"
}

@article{ss-pmp5c-84
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"On the ``piano movers'' problem {V}: the case of a rod moving in three-dimensional space amidst polyhedral obstacles"
, journal =	"Commun. Pure Appl. Math."
, volume =	37
, year =	1984
, pages =	"815--848"
, keywords =	"motion planning, three-dimensional"
, update =	"98.03 mitchell"
}

@article{ss-tddsp-90
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"On the two-dimensional {Davenport}-{Schinzel} problem"
, journal =	"J. Symbolic Comput."
, volume =	10
, year =	1990
, pages =	"371--393"
, keywords =	"Davenport-Schinzel sequences, upper/lower envelope"
, succeeds =	"s-tddsp-85"
, update =	"98.03 mitchell"
}

@techreport{ss-srrv-84
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Some remarks on robot vision"
, type =	"Report"
, number =	"TR119"
, institution =	"Comput. Sci. Div., New York Univ."
, address =	"New York, NY"
, year =	1984
, keywords =	"computer vision"
, update =	"98.03 mitchell"
}

@inproceedings{ss-srrv-85
, author =	"J. T. Schwartz and Micha Sharir"
, title =	"Some remarks on robot vision"
, booktitle =	"Trans. 3rd Army Conf. Applied Math. and Computing"
, site =	"Atlanta, GA"
, year =	1985
, pages =	"1--36"
, keywords =	"computer vision"
, succeeds =	"ss-srrv-84"
, update =	"98.03 mitchell, 94.05 sharir"
}

@techreport{sss-eafcc-85
, author =	"J. T. Schwartz and Micha Sharir and A. Siegel"
, title =	"An efficient algorithm for finding connected components in a binary image"
, type =	"Report"
, number =	"TR 154"
, institution =	"Comput. Sci. Div., New York Univ."
, address =	"New York, NY"
, year =	1985
, keywords =	"image processing"
, update =	"98.03 mitchell"
}

@book{sy-agar-87
, title =	"Algorithmic and Geometric Aspects of Robotics"
, editor =	"Jacob T. Schwartz and Chee-Keng Yap"
, series =	"Advances in Robotics"
, volume =	1
, publisher =	"Lawrence Erlbaum Associates"
, address =	"Hillsdale, New Jersey"
, year =	1987
, update =	"97.03 icking"
}

@phdthesis{s-dsadc-93
, author =	"C. Schwarz"
, title =	"Data structures and algorithms for the dynamic closest pair problem"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"94.01 smid"
}

@techreport{s-sdmwp-92
, author =	"C. Schwarz"
, title =	"Semi-dynamic maintenance of the width of a planar point set"
, type =	"Report"
, number =	"MPI-I-92-153"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, month =	dec
, year =	1992
, precedes =	"rss-mawsp-93,s-sdmwp-93"
, update =	"98.11 bibrelex, 97.11 icking, 93.09 rote"
}

@inproceedings{s-sdmwp-93
, author =	"Christian Schwarz"
, title =	"Semi-dynamic Maintenance of the Width of a Planar Point Set"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"6--9"
, succeeds =	"s-sdmwp-92"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
}

@techreport{ss-oaolc-91
, author =	"C. Schwarz and M. Smid"
, title =	"An {$O(n \log n \log\log n)$} algorithm for the on-line closest pair problem"
, type =	"Report"
, number =	"MPI-I-91-107"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1991
, precedes =	"ss-oaolc-92"
}

@inproceedings{ss-oaolc-92
, author =	"C. Schwarz and M. Smid"
, title =	"An {$O(n \log n \log\log n)$} algorithm for the on-line closest pair problem"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"280--285"
, succeeds =	"ss-oaolc-91"
}

@techreport{sss-oaolc-91
, author =	"C. Schwarz and M. Smid and J. Snoeyink"
, title =	"An optimal algorithm for the on-line closest pair problem"
, type =	"Report"
, number =	"MPI-I-91-123"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1991
, precedes =	"sss-oaolc-92"
, update =	"98.07 bibrelex"
}

@inproceedings{sss-oaolc-92
, author =	"C. Schwarz and M. Smid and J. Snoeyink"
, title =	"An optimal algorithm for the on-line closest-pair problem"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"330--336"
, succeeds =	"sss-oaolc-91"
, cites =	"bs-dcms-76, c-tpca-82, dd-ekdnp-91, ghlst-ltavs-87, o-ddds-83, ps-cgi-85, s-sisie-91, ss-oaolc-92, sh-cpp-75, s-mmdpsl-91a, s-drpla-91, s-mmdpsp-91t, s-ntsdc-90, v-oaann-89, ZZZ"
, update =	"97.11 bibrelex"
}

@article{sss-oaolc-94
, author =	"C. Schwarz and M. Smid and J. Snoeyink"
, title =	"An optimal algorithm for the on-line closest-pair problem"
, journal =	"Algorithmica"
, volume =	12
, year =	1994
, pages =	"18--29"
, update =	"94.09 smid"
}

@inproceedings{stvwe-mepa-95
, author =	"Christian Schwarz and J{\"u}rgen Teich and Alek Vainshtein and Emo Welzl and Brian L. Evans"
, title =	"Minimal Enclosing Parallelogram with Application"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C34--C35"
, keywords =	""
, cites =	"acy-macp-85, da-frkec-84, ets-adtdr-94, fs-dmaer-75, oamb-oafme-86, stwe-fmep-94, v-fmep-90, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@techreport{stwe-fmep-94
, author =	"C. Schwarz and J. Teich and Emo Welzl and B. Evans"
, title =	"On finding a minimal enclosing parallelogram"
, type =	"Report"
, number =	"TR-94-036"
, institution =	"International Computer Science Institute"
, address =	"Berkeley"
, year =	1994
, update =	"98.03 mitchell, 94.09 smid"
}

@book{s-naci-89
, author =	"H. R. Schwarz"
, title =	"Numerical Analysis: A Comprehensive Introduction"
, publisher =	"B. G. Teubner"
, address =	"Stuttgart"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{s-ccmls-93
, author =	"Otfried Schwarzkopf"
, title =	"Computing Convolutions On Mesh-Like Structures"
, booktitle =	"??"
, publisher =	"IEEE Computer Society"
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@phdthesis{s-dmcpr-92
, author =	"O. Schwarzkopf"
, title =	"Dynamic Maintenance of Convex Polytopes and Related Structures"
, type =	"Ph.{D}. Thesis"
, school =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, month =	jun
, year =	1992
, keywords =	"doctoral thesis"
, succeeds =	"s-dmgsm-91, s-rscp-92"
}

@inproceedings{s-dmgsm-91
, author =	"O. Schwarzkopf"
, title =	"Dynamic maintenance of geometric structures made easy"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"197--206"
, precedes =	"s-dmcpr-92"
, update =	"93.05 schwarzkopf"
}

@techreport{s-pop-91
, author =	"O. Schwarzkopf"
, title =	"On the post office problem"
, type =	"Manuscript"
, institution =	"??"
, year =	1991
, update =	"97.11 bibrelex"
}

@inproceedings{s-pcdvd-89
, author =	"O. Schwarzkopf"
, title =	"Parallel computation of discrete {Voronoi} diagrams"
, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	349
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"193--204"
, precedes =	"s-pcdt-91"
}

@article{s-pcdt-91
, author =	"O. Schwarzkopf"
, title =	"Parallel computation of distance transforms"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"685--697"
}

@techreport{s-riads-91
, author =	"O. Schwarzkopf"
, title =	"Randomized Incremental Algorithms in a Dynamic Setting"
, type =	"Technical {Report}"
, institution =	"Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, year =	1991
, note =	"To appear"
, update =	"97.11 bibrelex"
}

@inproceedings{s-rscp-92
, author =	"O. Schwarzkopf"
, title =	"Ray shooting in convex polytopes"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"286--295"
, precedes =	"s-dmcpr-92"
, cites =	"aesw-emstb-90, am-dhsrr-91, am-rsps-92, bc-hhihr-92, bdsty-arsol-92, bdt-riach-, cegs-sessr-89, cf-plhur-94, c-hsh-85, c-narsc-87, c-racpq-88, cms-frric-92i, cs-arscg-89, dmt-fddtl-92, e-acg-87, gks-ricdv-92, m-ept-91, m-rph-91, m-fppa1-88, m-rmstd-91, m-rmstf-91, m-rmstl-91, s-dmgsm-91, s-sdlpc-91, s-sfira-91, ZZZ"
, update =	"97.11 bibrelex, 93.05 schwarzkopf"
}

@inproceedings{s-edei-95
, author =	"Otfried Schwarzkopf"
, title =	"The Extendible Drawing Editor {Ipe}"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C10--C11"
, keywords =	"Latex, figure drawing, xfig, idraw"
, cites =	"ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@inproceedings{sfrw-acfpr-90
, author =	"O. Schwarzkopf and U. Fuchs and G{\"u}nter Rote and Emo Welzl"
, title =	"Approximation of convex figures by pairs of rectangles"
, booktitle =	"Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	415
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"240--249"
, precedes =	"sfrw-acfpr-98"
, update =	"98.07 bibrelex+rote, 98.03 mitchell, 97.11 bibrelex, 97.03 rote, 93.09 rote, 93.05 schwarzkopf"
}

@article{sfrw-acfpr-98
, author =	"O. Schwarzkopf and U. Fuchs and G{\"u}nter Rote and Emo Welzl"
, title =	"Approximation of convex figures by pairs of rectangles"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"77--87"
, succeeds =	"sfrw-acfpr-90"
, cites =	"ks-tpscf-95"
, update =	"98.07 bibrelex+rote, 98.03 mitchell, 97.03 rote"
, abstract =	"We consider the problem of approximating a convex figure
		in the plane by a pair $(r,R)$ of homothetic (i. e., similar and
		parallel) rectangles with $r$ contained in $C$ and $R$
		containing $C$. We show the existence of such pairs where the
		sides of the outer rectangle have length at most double the
		length of the inner rectangle, thereby solving a problem posed
		by P\'{o}lya and Szeg\H{o}.
		If the $n$ vertices of a convex polygon $C$ are given as a
		sorted array, such an approximating pair of rectangles can be
		computed in time $O(log^2 n)$."
}

@inproceedings{ss-vdsct-96
, author =	"Otfried Schwarzkopf and Micha Sharir"
, title =	"Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"20--29"
, cites =	"ass-oleia-96, ass-sulbl-89, as-tsbac-90, as-car-94, as-tmp3s-94, bds-lric-95, cegs-sessr-89, cegsw-ccbac-90, cs-arscg-89, hs-nblet-94, hs-atubs-95, hs-nqbmp-93, hs-atarr-95, hs-ndssg-86, s-ksacs-91, s-atubl-94, sa-dsstg-95, t-ntasa-95, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{ss-vdsct-97
, author =	"Otfried Schwarzkopf and Micha Sharir"
, title =	"Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"269--288"
, update =	"98.03 agarwal"
}

@inproceedings{sv-rslde-96c
, author =	"Otfried Schwarzkopf and Jules Vleugels"
, title =	"Range Searching in Low-Density Environments"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	3
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{sv-rslde-96
, author =	"Otfried Schwarzkopf and Jules Vleugels"
, title =	"Range Searching in Low-Density Environments"
, journal =	"Inform. Process. Lett."
, volume =	60
, year =	1996
, pages =	"121--127"
, update =	"99.03 bibrelex, 96.09 agarwal, 98.07 bibrelex"
}

@mastersthesis{s-ddbpi-96
, author =	"J. Schwerdt"
, title =	"Das {Diameterproblem} einer bewegten {Punktemenge}: eine {Implementierung} mit {Hilfe} von parametric search"
, type =	"Master's Thesis"
, school =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1996
, keywords =	"masters thesis"
, update =	"97.03 smid"
}

@phdthesis{s-eogpb-01
, author =	"J. Schwerdt"
, title =	"Entwurf von {Optimierungsalgorithmen} f{\"u}r geometrische {Probleme} im {Bereich} {Rapid} {Prototyping} und {Manufacturing}"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	2001
, keywords =	"doctoral thesis"
, update =	"01.11 smid"
}

@techreport{ss-cwtdp-99
, author =	"J. Schwerdt and M. Smid"
, title =	"Computing the width of a three-dimensional point set: documentation"
, type =	"Report"
, number =	4
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1999
, update =	"99.07 smid"
}

@techreport{sshj-cohdl-01
, author =	"J. Schwerdt and M. Smid and M. C. Hong and R. Janardan"
, title =	"Computing an optimal hatching direction in layered manufacturing"
, type =	"Report"
, number =	3
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	2001
, update =	"01.04 smid"
}

@techreport{ssjj-pcflm-00t
, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson"
, title =	"Protecting critical facets in layered manufacturing: implementation and experimental results"
, type =	"Report"
, number =	6
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	2000
, update =	"00.11 smid, 00.07 smid"
}

@inproceedings{ssjj-pcflm-00i
, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson"
, title =	"Protecting critical facets in layered manufacturing: implementation and experimental results"
, booktitle =	"Proc. 2nd Workshop on Algorithm Engineering and Experiments"
, year =	2000
, pages =	"43--57"
, update =	"00.11 smid, 00.07 smid, 00.03 smid"
}

@article{ssjjm-pcflm-00
, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
, title =	"Protecting critical facets in layered manufacturing"
, journal =	"Comput. Geom. Theory Appl."
, volume =	16
, year =	2000
, pages =	"187--210"
, update =	"00.11 smid, 00.07 smid"
}

@techreport{ssjjm-pflm-99t
, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
, title =	"Protecting facets in layered manufacturing"
, type =	"Report"
, number =	10
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1999
, update =	"00.03 smid, 99.07 smid"
}

@inproceedings{ssjjm-pflm-99i
, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
, title =	"Protecting facets in layered manufacturing"
, booktitle =	"Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1738
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"281--292"
, update =	"00.03 smid"
}

@techreport{ssmj-cwtdp-98t
, author =	"J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
, title =	"Computing the width of a three-dimensional point set: an experimental study"
, type =	"Report"
, number =	18
, institution =	"Department of Computer Science, University of Magdeburg"
, address =	"Magdeburg, Germany"
, year =	1998
, succeeds =	"ssmj-cwtdp-98i"
, update =	"99.07 smid"
}

@inproceedings{ssmj-cwtdp-98i
, author =	"J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
, title =	"Computing the width of a three-dimensional point set: an experimental study"
, booktitle =	"Proc. 2nd Workshop on Algorithm Engineering"
, nickname =	"WAE '98"
, site =	"Saarbr{\"u}cken"
, month =	aug
, year =	1998
, pages =	"62--73"
, update =	"01.04 icking, 00.11 smid, 00.07 icking, 99.07 smid, 98.11 smid"
}

@article{ssmj-cwtdp-99
, author =	"J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
, title =	"Computing the width of a three-dimensional point set: an experimental study"
, journal =	"ACM Journal of Experimental Algorithmics"
, volume =	4
, year =	1999
, note =	"Article 8"
, update =	"00.11 smid, 00.07 smid"
}

@inproceedings{sss-cmdmp-97
, author =	"J. Schwerdt and M. Smid and S. Schirra"
, title =	"Computing the minimum diameter for moving points: an exact implementation using parametric search"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"466--468"
, cites =	"ast-apsgo-94, bfms-secsb-97, bkmnsu-egcl-95, bms-lcrn-96, fgkss-ckbgc-96, gjs-facpp-96, m-apcad-83, nu-lmum-95, mn-lpcgc-95, ps-cgi-85, s-ddbpi-96, ZZZ"
, update =	"98.07 bibrelex, 97.11 smid"
}

@article{si-ttids-86
, author =	"D. Scott and S. Iyenger"
, title =	"TID - {Translation} invariant data structure of storing images"
, journal =	"Commun. ACM"
, volume =	29
, year =	1986
, pages =	"418--428"
, update =	"98.07 bibrelex"
}

@article{srm-alid-81
, author =	"T. J. Sebok and L. E. Roemer and G. S. Malindzak"
, title =	"An algorithm for line intersection detection"
, journal =	"Pattern Recogn."
, volume =	13
, year =	1981
, pages =	"159--166"
}

@article{sg-vpra-82
, author =	"S. Sechrest and D. P. Greenberg"
, title =	"A visible polygon reconstruction algorithm"
, journal =	"ACM Trans. Graph."
, volume =	1
, year =	1982
, pages =	"25--42"
}

@article{s-pasp-85
, author =	"T. Sederberg"
, title =	"Piecewise algebraic surface patches"
, journal =	"Comput. Aided Geom. Design"
, volume =	2
, year =	1985
, pages =	"53--59"
, update =	"98.03 bibrelex"
}

@article{sgwm-2dsbi-93
, author =	"T. Sederberg and P. Gao and G. Wang and H. Mu"
, title =	"$2$-d shape blending: an intrinsic solution to the vertex path problem"
, journal =	"Comput Graph."
, volume =	27
, year =	1993
, pages =	"15--18"
, note =	"Proc. SIGGRAPH '93"
, update =	"98.03 bibrelex"
}

@article{sg-agcag-86
, author =	"T. Sederberg and R. Goldman"
, title =	"Algebraic geometry for computer-aided geometric design"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, month =	jun
, year =	1986
, pages =	"52--59"
, update =	"98.03 bibrelex"
}

@article{sg-pba2d-92
, author =	"T. Sederberg and E. Greenwood"
, title =	"A physically based approach to $2$-d shape blending"
, journal =	"Comput. Graph."
, volume =	26
, year =	1992
, pages =	"25--34"
, note =	"Proc. SIGGRAPH '92"
, update =	"98.03 bibrelex"
}

@incollection{ss-pcas-87
, author =	"T. Sederberg and J. Snively"
, title =	"Parameterization of Cubic Algebraic Surfaces"
, editor =	"R. Martin"
, booktitle =	"The Mathematics of Surfaces II"
, publisher =	"Oxford University Press"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{sa-irpcs-84
, author =	"T. W. Sederberg and D. C. Anderson"
, title =	"Implicit representation of parametric curves and surfaces"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	"??"
, year =	1984
, update =	"98.03 bibrelex"
}

@book{s-a-83
, author =	"R. Sedgewick"
, title =	"Algorithms"
, edition =	"1st"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1983
, keywords =	"book, convex hull"
, update =	"98.03 bibrelex"
, annote =	"Chapter 25 treats convex hull"
}

@book{s-a-88
, author =	"R. Sedgewick"
, title =	"Algorithms"
, edition =	"2nd"
, publisher =	"Addison-Wesley"
, address =	"Reading, Mass."
, year =	1988
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@book{s-ac-90
, author =	"R. Sedgewick"
, title =	"Algorithms in {C}"
, publisher =	"Addison-Wesley"
, address =	"Reading, Mass."
, year =	1988
, update =	"98.11 bibrelex"
}

@book{s-ac-92
, author =	"R. Sedgewick"
, title =	"Algorithms in {C}++"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1992
, update =	"97.03 schwarzkopf"
}

@inproceedings{sv-speg-84
, author =	"R. Sedgewick and J. S. Vitter"
, title =	"Shortest paths in {Euclidean} graphs"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"417--424"
, precedes =	"sv-speg-86"
}

@article{sv-speg-86
, author =	"R. Sedgewick and J. S. Vitter"
, title =	"Shortest paths in {Euclidean} graphs"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"31--48"
, succeeds =	"sv-speg-84"
}

@inproceedings{sk-btera-90
, author =	"B. Seeger and H.-P. Kriegel"
, title =	"The buddy-tree: {A}n efficient and robust access method for spatial data base systems"
, booktitle =	"Proc. 16th VLDB Conference"
, year =	1990
, pages =	"590--601"
, update =	"97.07 agarwal"
}

@inproceedings{s-esadu-97
, author =	"Jochen Seemann"
, title =	"Extending the Sugiyama Algorithm for Drawing {UML} Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"415--424"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@techreport{s-plga-85
, author =	"M. Segal"
, title =	"A programming language for geometry applications"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Univ. California Berkeley"
, address =	"Berkeley, CA"
, year =	1985
}

@unpublished{s-pipni-
, author =	"M. Segal"
, title =	"Partitioning Intersecting Polyhedra into Non-Intersecting Parts"
, note =	"In Preparation"
, update =	"97.11 bibrelex"
}

@article{s-utgvp-90
, author =	"M. Segal"
, title =	"Using tolerances to guarantee valid polyhedral modeling results"
, journal =	"Comput. Graph."
, volume =	24
, number =	4
, month =	aug
, year =	1990
, pages =	"105--114"
, precedes =	"ss-ccsm-85, ss-mtgdn-89"
, update =	"93.09 milone+mitchell"
}

@inproceedings{sk-ekpsa-96
, author =	"M. Segal and K. Kedem"
, title =	"Enclosing {$k$} points in the smallest axis parallel rectangle"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"20--25"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@article{sk-ekpsa-98
, author =	"M. Segal and K. Kedem"
, title =	"Enclosing {$k$} points in the smallest axis parallel rectangle"
, journal =	"Inform. Process. Lett."
, volume =	65
, year =	1998
, pages =	"95--99"
, update =	"99.11 smid"
}

@article{ss-pponp-88
, author =	"M. Segal and C. H. Sequin"
, title =	"Partitioning Polyhedral Objects into Nonintersecting Parts"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	8
, number =	1
, month =	jan
, year =	1988
, pages =	"53--67"
, update =	"93.09 held"
}

@inproceedings{ss-ccsm-85
, author =	"M. G. Segal and C. H. Sequin"
, title =	"Consistent calculations for solids modelling"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"29--38"
, precedes =	"ss-mtgdn-89"
, cites =	"beh-gms-79, t-smcua-80, r-rrstm-80, gl-mc-83, ns-picg-79, w-at-42, hg-rshsa-77, sw-vfror-85, s-pipni-, ZZZ"
, update =	"97.11 bibrelex, 93.09 milone+mitchell"
}

@techreport{ss-mtgdn-89
, author =	"M. G. Segal and C. H. Sequin"
, title =	"Maintaining topology in geometric descriptions with numerical uncertainty"
, type =	"Technical {Report}"
, number =	"89/450"
, institution =	"Comput. Sci. Div., Univ. California"
, address =	"Berkeley, CA"
, year =	1989
, succeeds =	"ss-ccsm-85"
, precedes =	"s-utgvp-90"
, update =	"95.09 korneenko, 93.09 milone+mitchell"
}

@incollection{s-pftbs-92
, author =	"H.-P. Seidel"
, title =	"Polar forms and triangular {B}-spline surfaces"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"235--286"
, keywords =	"survey paper, polar forms, triangular Bezier/B-spline surface patches"
, precedes =	"s-pftbs-95"
, update =	"98.07 icking, 93.09 erickson"
}

@incollection{s-pftbs-95
, author =	"Hans-Peter Seidel"
, title =	"Polar Forms and Triangular {B}-Spline Surfaces"
, editor =	"Ding-Zhu Du and Frank Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"299--350"
, keywords =	"survey paper, polar forms, triangular Bezier/B-spline surface patches"
, succeeds =	"s-pftbs-92"
, update =	"98.07 icking"
}

@mastersthesis{s-chaop-81
, author =	"R. Seidel"
, title =	"A convex hull algorithm optimal for point sets in even dimensions"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Comput. Sci., Univ. British Columbia"
, address =	"Vancouver, BC"
, year =	1981
, note =	"Report 81/14"
, keywords =	"convex hull, $d$-dimensional, incrementation, incidence graph, polyhedra"
, update =	"93.05 jones"
}

@techreport{s-mplbc-84
, author =	"R. Seidel"
, title =	"A Method for Proving Lower Bounds for Certain Geometric Problems"
, type =	"Technical {Report}"
, number =	"84-592"
, institution =	"??"
, month =	feb
, year =	1984
, update =	"97.11 bibrelex"
}

@incollection{s-mplbc-85
, author =	"R. Seidel"
, title =	"A method for proving lower bounds for certain geometric problems"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"319--334"
, keywords =	"point location, triangulation, convex hull, geometric transformations, lower bounds"
}

@techreport{s-sfira-90
, author =	"R. Seidel"
, title =	"A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons"
, type =	"Technical {Report}"
, number =	"B 90-07"
, institution =	"Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, month =	oct
, year =	1990
, update =	"97.11 bibrelex"
}

@article{s-sfira-91
, author =	"R. Seidel"
, title =	"A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	1
, year =	1991
, pages =	"51--64"
, update =	"98.07 bibrelex"
}

@techreport{s-barga-91
, author =	"R. Seidel"
, title =	"Backwards Analysis of Randomized Geometric Algorithms"
, type =	"Manuscript"
, institution =	"ALCOM Summerschool on efficient algorithms design"
, address =	"{\AA}rhus, Denmark"
, year =	1991
, precedes =	"s-barga-93, s-barg-92"
, update =	"98.11 bibrelex, 93.09 erickson"
}

@techreport{s-barg-92
, author =	"R. Seidel"
, title =	"Backwards analysis of randomized geometric algorithms"
, type =	"Report"
, number =	"TR-92-014"
, institution =	"Computer Science Division, University of California"
, address =	"Berkeley"
, month =	feb
, year =	1992
, succeeds =	"s-barga-91"
, precedes =	"s-barga-93"
, update =	"98.11 bibrelex"
}

@incollection{s-barga-93
, author =	"R. Seidel"
, title =	"Backwards Analysis of Randomized Geometric Algorithms"
, editor =	"J. Pach"
, booktitle =	"New Trends in Discrete and Computational Geometry"
, series =	"Algorithms and Combinatorics"
, volume =	10
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"37--68"
, keywords =	"survey paper, randomized algorithms, backwards analysis, Delaunay triangulation, segment intersection, convex hull, quicksort, linear programming"
, succeeds =	"s-barg-92, s-barga-91"
, update =	"98.11 bibrelex, 93.09 erickson+matousek"
}

@techreport{s-cdtvd-88
, author =	"R. Seidel"
, title =	"Constrained {Delaunay} triangulations and {Voronoi} diagrams with obstacles"
, type =	"Technical Report"
, number =	260
, institution =	"IIG-TU Graz"
, address =	"Austria"
, year =	1988
, precedes =	"s-cdtvd-89"
, update =	"99.03 forrest, 98.11 bibrelex"
, annote =	"Plane sweep algorithm"
}

@article{s-cdtvd-89
, author =	"R. Seidel"
, title =	"Constrained {Delaunay} Triangulations and {Voronoi} Diagrams with Obstacles"
, journal =	"Computer Science Division"
, volume =	"??"
, month =	jun
, year =	1989
, note =	"UC Berkeley"
, succeeds =	"s-cdtvd-88"
, update =	"99.03 forrest, 98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{s-chdch-86
, author =	"R. Seidel"
, title =	"Constructing higher-dimensional convex hulls at logarithmic cost per face"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"404--413"
, keywords =	"convex hull, incidence graph, polyhedra, linear programming, $d$-dimensional, output dependent"
}

@incollection{s-chc-97
, author =	"R. Seidel"
, title =	"Convex hull computations"
, chapter =	19
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"361--376"
, update =	"97.11 orourke"
}

@incollection{s-eubnf-91
, author =	"R. Seidel"
, title =	"Exact upper bounds for the number of faces in $d$-dimensional {V}oronoi diagrams"
, editor =	"P. Gritzman and B. Sturmfels"
, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	4
, publisher =	"AMS Press"
, address =	"Providence, RI"
, year =	1991
, pages =	"517--530"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@inproceedings{s-lpchm-90
, author =	"R. Seidel"
, title =	"Linear programming and convex hulls made easy"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"211--215"
, precedes =	"s-sdlpc-91"
, cites =	"ck-acp-70, c-lpot-86, c-lvali-89, cs-arscg-89, d-ltatt-84, df-rafdl-87, e-acg-87, g-eadch-72, k-chahd-81, m-ltalp-83, m-lpltw-84, ph-chfsp-77, s-chaop-81, s-chdch-86, s-fchff-85, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{s-apspp-92
, author =	"R. Seidel"
, title =	"On the all-pairs-shortest-path problem"
, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
, year =	1992
, pages =	"745--749"
}

@inproceedings{s-eqcpp-98
, author =	"Raimund Seidel"
, title =	"On the Exact Query Complexity of Planar Point Location"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"7--8"
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{s-nfhdv-87
, author =	"R. Seidel"
, title =	"On the number of faces in higher-dimensional {Voronoi} diagrams"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"181--185"
, keywords =	"$d$-dimensional, Voronoi diagrams, combinatorial geometry, polyhedra"
, cites =	"bl-psmcf-81, b-vdch-79, ms-cpubc-71, p-kpudz-82, s-cvdhd-82, ZZZ"
, update =	"98.03 bibrelex"
}

@techreport{s-scpvd-82
, author =	"R. Seidel"
, title =	"On the size of closest-point {Voronoi} diagrams"
, type =	"Report"
, number =	"F94"
, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
, address =	"Graz, Austria"
, year =	1982
, keywords =	"Voronoi diagrams, lower bounds, polyhedra"
, precedes =	"s-cvdhd-82"
}

@phdthesis{s-ossac-86
, author =	"R. Seidel"
, title =	"Output-size sensitive algorithms for constructive problems in computational geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1986
, note =	"Technical Report TR 86-784"
, keywords =	"doctoral thesis, convex hull, incidence graph, divide-and-conquer, plane-sweep, domination, intersection, $d$-dimensional, output dependent"
, comments =	"UMI AAC87-08959, 148 pp."
, update =	"93.09 jones, 93.05 jones"
}

@article{s-sdlpc-91
, author =	"R. Seidel"
, title =	"Small-dimensional linear programming and convex hulls made easy"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"423--434"
, succeeds =	"s-lpchm-90"
}

@inproceedings{s-tcg-93
, author =	"Raimund Seidel"
, title =	"Teaching Computational Geometry"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	272
, update =	"93.09 milone+mitchell"
}

@inproceedings{s-cvdhd-82
, author =	"R. Seidel"
, title =	"The complexity of {Voronoi} diagrams in higher dimensions"
, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
, year =	1982
, pages =	"94--95"
, keywords =	"Voronoi diagrams, lower bounds, polyhedra"
, succeeds =	"s-scpvd-82"
}

@techreport{s-nmpgc-94t
, author =	"R. Seidel"
, title =	"The nature and meaning of perturbations in geometric computing"
, type =	"Manuscript"
, institution =	"??"
, year =	1994
, update =	"98.03 bibrelex"
}

@inproceedings{s-nmpgc-94
, author =	"R. Seidel"
, title =	"The Nature and Meaning of Perturbations in Geometric Computing"
, booktitle =	"Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
, nickname =	"STACS '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	775
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"3--17"
, update =	"98.11 bibrelex, 96.09 devillers"
}

@article{s-nmpgc-98
, author =	"R. Seidel"
, title =	"The Nature and Meaning of Perturbations in Geometric Computing"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"1--17"
, update =	"98.03 agarwal"
}

@article{s-ubtpe-95
, author =	"R. Seidel"
, title =	"The upper bound theorem for polytopes: an easy proof of its asymptotic version"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"115--116"
, update =	"96.09 devillers"
}

@article{sa-rst-96
, author =	"R. Seidel and C. R. Aragon"
, title =	"Randomized search trees"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"464--497"
, update =	"97.03 smid"
}

@article{s-ndmea-54
, author =	"A. Seidenberg"
, title =	"A new decision method for elementary algebra"
, journal =	"Annals Math."
, volume =	60
, year =	1954
, pages =	"365--374"
, update =	"98.03 bibrelex"
}

@book{st-ldt-47
, author =	"H. Seifert and W. Threlfall"
, title =	"Lehrbuch der {Topologie}"
, publisher =	"Chelsea Publishing Company"
, year =	1947
, update =	"98.03 bibrelex"
}

@book{st-vig-38
, author =	"H. Seifert and W. Threlfall"
, title =	"Variationsrechnung im {Grossen}"
, publisher =	"B. G. Teubner"
, address =	"Berlin"
, year =	1938
, update =	"99.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{sd-sgslw-81
, author =	"A. Seigel and D. Dolev"
, title =	"The separation for general single-layer wiring barriers"
, booktitle =	"Proc. of the CMU Conference on VLSI"
, year =	1981
, pages =	"143--152"
, update =	"98.03 bibrelex"
}

@article{sy-rafmn-93
, author =	"K. Sekitani and Y. Yamamoto"
, title =	"A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes"
, journal =	"Math. Program. Ser. A"
, volume =	61
, number =	2
, year =	1993
, pages =	"233--249"
, update =	"97.03 gaertner+salinger"
}

@article{si-kmtag-84
, author =	"S. Z. Selim and M. A. Ismail"
, title =	"$K$-Means-Type Algorithm: A Generalized Convergence Theorem and Characterization"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"??"
, year =	1984
, pages =	"81--87"
, update =	"97.11 bibrelex"
}

@inproceedings{s-adacc-98
, author =	"J{\"u}rgen Sellen"
, title =	"Approximation and Decision Algorithms for Curvature-Constrained Path Planning: {A} State-Space Approach"
, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
, nickname =	"WAFR '98"
, year =	1998
, pages =	"to appear"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{s-dwspp-95
, author =	"J. Sellen"
, title =	"Direction weighted shortest path planning"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Nagoya"
, year =	1995
, pages =	"1970--1975"
, update =	"96.05 mitchell"
}

@article{s-lbgpp-96
, author =	"J. Sellen"
, title =	"Lower bounds for geometrical and physical problems"
, journal =	"SIAM J. Comput."
, volume =	25
, year =	1996
, pages =	"1231--1253"
, update =	"97.03 smid"
}

@inproceedings{s-ppmc-95
, author =	"J. Sellen"
, title =	"Planning paths of minimal curvature"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Nagoya"
, year =	1995
, pages =	"1976--1982"
, comments =	"also contains an interesting algorithm for the Fortune-Wilfong
		problem, to find a minimal-length curvature-constrained
		path in a polygonal environment."
, update =	"96.05 mitchell"
}

@article{scy-psesp-00
, author =	"J. Sellen and J. Choi and C.-K. Yap"
, title =	"Precision-Sensitive {Euclidean} Shortest Path in 3-Space"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"1577--1595"
, update =	"00.11 smid"
}

@inproceedings{srf-rtdim-87
, author =	"T. Sellis and N. Roussopoulos and C. Faloutsos"
, title =	"The {$\rm R^+$}-tree: {A} dynamic index for multi-dimensional objects"
, booktitle =	"Proc. 13th VLDB Conference"
, year =	1987
, pages =	"507--517"
, update =	"97.07 agarwal"
}

@book{sr-iag-49
, author =	"J. Semple and L. Roth"
, title =	"Introduction to Algebraic Geometry"
, publisher =	"Clarendon Press"
, year =	1949
, update =	"97.11 bibrelex"
}

@mastersthesis{s-aeusf-96
, author =	"I. Semrau"
, title =	"Analyse und experimentelle {Untersuchung} von {Strategien} zum {Finden} eines {Ziels} in {Stra{\ss}enpolygonen}"
, type =	"Diploma thesis"
, school =	"FernUniversit{\"a}t Hagen"
, year =	1996
, keywords =	"master thesis"
, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@article{s-ercbk-68
, author =	"P. K. Sen"
, title =	"Estimates of the Regression Coefficient Based on Kendall's Tau"
, journal =	"J. Amer. Statist. Assoc."
, volume =	63
, year =	1968
, pages =	"1379--1389"
, update =	"98.07 bibrelex"
}

@techreport{s-dplto-95
, author =	"S. Sen"
, title =	"A deterministic {poly($\log\log n$)} time optimal {CRCW} {PRAM} algorithm for linear programming in fixed dimension"
, type =	"Technical {Report}"
, number =	"95-08"
, institution =	"Dept. of Computer Science, University of Newcastle"
, year =	1995
, update =	"96.09 orourke"
}

@inproceedings{s-fcs-92
, author =	"S. Sen"
, title =	"Fractional cascading simplified"
, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"212--220"
}

@inproceedings{s-lbadt-94
, author =	"S. Sen"
, title =	"Lower bounds for algebraic decision trees, complexity of convex hulls and related problems"
, booktitle =	"Proc. 14th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, site =	"Madras,  India"
, year =	1994
, update =	"97.11 bibrelex"
}

@techreport{s-mapl-
, author =	"S. Sen"
, title =	"Maintaining arrangements for point location"
, type =	"Technical {Memo}"
, institution =	"Bell Lab."
, update =	"97.11 bibrelex"
}

@inproceedings{s-pmsua-96
, author =	"S. Sen"
, title =	"Parallel multidimensional search using approximation algorithms: with applications to linear-programming and related problems"
, booktitle =	"Proc. 8th ACM Sympos. Paral. Algorithms and Architectures"
, year =	1996
, pages =	"251--260"
, keywords =	"parallel computations, linear programming"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@unpublished{s-sosl-
, author =	"S. Sen"
, title =	"Some observations on skip lists"
, note =	"??"
, update =	"98.03 bibrelex"
}

@techreport{s-tbspc-93
, author =	"S. Sen"
, title =	"Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range"
, type =	"Report"
, number =	"MPI-I-93-129"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, update =	"93.09 smid"
}

@incollection{s-cq-97
, author =	"M. Senechal"
, title =	"Crystals and quasicrystals"
, chapter =	51
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"933--950"
, update =	"97.11 orourke"
}

@techreport{s-ods-88
, author =	"M. Senechal"
, title =	"Orderly dispositions in space"
, type =	"{IMA} {Preprint} {Series}"
, number =	406
, institution =	"Inst. Math. Appl., Univ. Minnesota"
, address =	"Minneapolis, MN"
, year =	1988
}

@article{s-ttosf-88
, author =	"M. Senechal"
, title =	"Tiling the torus and other space forms"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"55--72"
}

@article{sw-vfror-85
, author =	"C. H. S{\'e}quin and P. R. Wensley"
, title =	"Visible Feature Return at Object Resolution"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	"??"
, year =	1985
, note =	"To be published"
, update =	"97.11 bibrelex"
}

@techreport{svh-bpepa-89
, author =	"B. Serpette and J. Vuillemin and J. C. Herv{`e}"
, title =	"{BigNum}: a portable and efficient package for arbitrary-precision arithmetic"
, institution =	"INRIA"
, month =	may
, year =	1989
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@book{s-iamm-82
, author =	"J. Serra"
, title =	"Image Analysis and Mathematical Morphology"
, publisher =	"Academic Press"
, address =	"London, UK"
, year =	1982
, update =	"98.07 bibrelex"
}

@book{s-iamm-88
, title =	"Image Analysis and Mathematical Morphology, volume 2: {Theoretical} Advances"
, editor =	"J. Serra"
, publisher =	"Academic Press"
, address =	"New York"
, year =	1988
, update =	"98.07 bibrelex"
}

@article{s-harst-81
, author =	"M. Servit"
, title =	"Heuristic algorithms for rectlinear {Steiner} trees"
, journal =	"Digital Processes"
, volume =	7
, year =	1981
, pages =	"21--32"
, update =	"98.07 bibrelex"
}

@book{s-lsm-96
, author =	"J. A. Sethian"
, title =	"Level Set Methods"
, publisher =	"Cambridge University Press"
, year =	1996
, update =	"00.03 devillers"
}

@book{s-lsmfm-01
, author =	"J. A. Sethian"
, title =	"Level set methods and fast marching methods"
, publisher =	"Cambridge"
, year =	1999
, note =	""
, update =	"02.03 pocchiola"
}

@inproceedings{sk-ftmsd-96
, author =	"K. Sevcik and N. Koudas"
, title =	"Filter trees for managing spatial data over a range of size granularities"
, booktitle =	"Proc. 22nd VLDB Conference"
, year =	1996
, pages =	"16--27"
, update =	"97.07 agarwal"
}

@article{s-dptds-86
, author =	"Michael Sever"
, title =	"{Delaunay} Partitioning In Three Dimensions And Semiconductor Models"
, journal =	"COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering"
, volume =	5
, number =	2
, month =	jun
, year =	1986
, pages =	"75--93"
, keywords =	"Delaunay partitioning, semiconductor models, scharfetter-gummel discretization, Voronoi cross-sections"
, annote =	"Incremental algorithm in 3D. First take a surrounding
		 tetra. Connect new point to all points of tetra whose
		 c-sphere it lies in. Delete edges that are only in bad
		 tetrahedra. Yet another proof."
, abstract =	"An algorithm for Delaunay partitioning in three
		 dimensions is given, and its use in numerical
		 semiconductor models is examined. In particular,
		 tetrahedral elements are found to be compatible with
		 the Scharfetter-Gummel discretization of the stationary
		 continuity equations associated with such models, using
		 the Voronoi cross-sections for each edge in the
		 obtained network. For tetrahedral elements, however,
		 the Voronoi cross-sections do not coincide with those
		 previously shown to be compatible with the
		 Scharfetter-Gummel method. (Author abstract) 16 refs."
}

@inproceedings{slsds-hicaw-96
, author =	"Jonathan Shade and Dani Lischinski and David Salesin and Tony {DeRose} and John Snyder"
, title =	"Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments"
, booktitle =	"Proc. SIGGRAPH '96"
, series =	"In {\em Comput. Graph.\/} Proceedings, Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"Addison-Wesley"
, year =	1996
, pages =	"75--82"
, update =	"98.03 agarwal"
}

@book{s-bag-77
, author =	"I. R. Shafarevich"
, title =	"Basic Algebraic Geometry"
, edition =	2
, publisher =	"Springer"
, address =	"Berlin"
, year =	1977
, isbn =	"3-540-08264-6"
, update =	"97.11 bibrelex"
, annote =	"Part I. Algebraic varieties in a projective space I.
                 Fundamental concepts II. Local properties III. Divisors
                 and differential forms IV. Intersection indices Part
                 II. Schemes and varieties V. Schemes VI. Varieties Part
                 III. Algebraic varieties over the field of complex
                 numbers and complex analytic manifolds VII. Topology of
                 algebraic varieties VIII. Complex analytic manifolds
                 IX. Uniformization Bibliography Historical sketch"
}

@inproceedings{sa-sprint-96
, author =	"J. Shafer and R. Agrawal and M. Mehta"
, title =	"SPRINT: A Scalable Parallel Classifier for Data Mining."
, booktitle =	"Proceedings of the International Conference on Very Large Databases"
, publisher =	"Morgan Kauffman"
, year =	1996
, pages =	"544--555"
, update =	"98.07 agarwal"
}

@inproceedings{ss-roga-93
, author =	"L. Shafer and W. Steiger"
, title =	"Randomizing optimal geometric algorithms"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"133--138"
, precedes =	"ss-roga-95"
, cites =	"b-chfsp-78, csss-otass-89, e-nchap-77, e-acg-87, fr-etbs-75, ks-upcha-86, ls-otahs-90, lms-hscr-92, lms-ahsc-94, m-roass-91, mt-uchap-85, mt-uchap-85, fr-aasfs-75, gs-cchsp-79, ol-fcbch-80, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@techreport{ss-roga-95
, author =	"L. Shafer and W. Steiger"
, title =	"Randomizing optimal geometric algorithms"
, type =	"Technical {Report}"
, number =	"94-22"
, institution =	"DIMACS"
, year =	1995
, succeeds =	"ss-roga-93"
, update =	"98.11 bibrelex, 96.09 orourke"
}

@article{ss-aerrl-88
, author =	"C. A. Shaffer and H. Samet"
, title =	"An algorithm to expand regions represented by linear quadtrees"
, journal =	"Image Vision Comput."
, volume =	6
, number =	3
, month =	aug
, year =	1988
, pages =	"162--168"
, update =	"96.05 efrat"
}

@techreport{ss-chdso-87
, author =	"C. A. Shaffer and H. Samet"
, title =	"An in--core hierarchical data structure organization for a geographic database"
, type =	"Computer Science Department"
, number =	"TR 1886"
, institution =	"University of Maryland"
, address =	"College Park, MD"
, month =	jul
, year =	1987
, update =	"96.05 efrat"
}

@article{ss-oqca-87
, author =	"C. A. Shaffer and H. Samet"
, title =	"Optimal quadtree construction algorithms"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	37
, number =	3
, month =	mar
, year =	1987
, pages =	"402--419"
, update =	"96.05 efrat"
}

@article{ss-soulq-90
, author =	"C. A. Shaffer and H. Samet"
, title =	"Set operations for unaligned linear quadtrees"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	50
, number =	1
, month =	apr
, year =	1990
, pages =	"29--4"
, note =	"(also Virginia Polytechnic Institute and State University Computer Science TR 88--31)"
, update =	"96.05 efrat"
}

@article{ssn-qgisb-90
, author =	"C. A. Shaffer and H. Samet and R. C. Nelson"
, title =	"{QUILT}: a geographic information system based on quadtrees"
, journal =	"Internat. J. Geogr. Inform. Syst."
, volume =	4
, number =	2
, month =	apr
, year =	1990
, pages =	"103--131"
, update =	"00.11 smid, 00.07 icking, 96.09 devillers, 96.05 efrat"
, annote =	"also University of Maryland Computer Science TR-1885.1"
}

@inproceedings{s-hmr-95
, author =	"Nimish R. Shah"
, title =	"Homeomorphic Meshes in {$\Re^3$}"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"25--30"
, update =	"95.09 jones"
}

@article{smr-ddssa-88
, author =	"Hamid Shahnasser and Ward Morgan and A. Raghuram"
, title =	"Dynamic Date Structure Suitable For Adaptive Mesh Refinement In Finite Element Method"
, journal =	"Finite Elements in Analysis and Design"
, volume =	4
, number =	3
, month =	nov
, year =	1988
, pages =	"237--247"
, keywords =	"dynamic data structure, mesh refinement"
, annote =	"Claims that minimizing sum of the minimum angles is
		 equal to the DT. (Not true). Claims that sum of
		 opposite angles is cheapest way to implement DT test.
		 Lists Pascal code. Data structure is list of triangles,
		 with pointers to adjacent triangles. Inside flip
		 insertion."
, abstract =	"This paper describes a dynamic data structure and its
		 implementation, used for an optimum mesh generator. The
		 implementation of this mesh generator was a part of a
		 software package implemented to solve electromagnetic
		 field problems using the finite element method. This
		 mesh generator takes advantage of the Delaunay
		 algorithm, which maximizes the summation of the
		 smallest angles in all triangles and thus creates a
		 mesh that is proved to be an optimum mesh for use in
		 the finite element method. The dynamic data structure
		 is explained and the source code is reviewed. The
		 programs have been written in Pascal programming
		 language. (Author abstract) 8 Refs."
}

@inproceedings{sssv-bcnmh-97
, author =	"Farhad Shahrokhi and Ondrej S{\'y}kora and L{\'a}szl{\'o} A. Sz{\'e}kely and Imrich {Vrt'o}"
, title =	"Bipartite Crossing Numbers of Meshes and Hypercubes"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"37--46"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{sssv-dgsfc-96
, author =	"F. Shahrokhi and L. A. {Sz\'ekely} and O. {S\'ykora} and I. {Vrt'o}"
, title =	"Drawings of Graphs on Surfaces with Few Crossings"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"118--131"
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
, keywords =	"graph drawing, 3D, topological graph theory"
, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@inproceedings{ssv-cnglb-95
, author =	"F. Shahrokhi and L. A. Sz{\'e}kely and I. Vrt'o"
, title =	"Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: a Survey"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"131--142"
, keywords =	"graph drawing, planarization, crossing number, survey"
, update =	"95.01 tamassia"
}

@article{s-scpe-80
, author =	"A. V. Shaidenko"
, title =	"Some Characteristic Properties of the Ellipsoid"
, journal =	"Sibirsk Mat. Z."
, volume =	21
, year =	1980
, pages =	"232--234, 240"
, note =	"In Russian."
, update =	"99.11 bibrelex"
}

@article{s-palp-93
, author =	"R. Shamir"
, title =	"Probabilistic analysis in linear programming"
, journal =	"Statistical Science"
, volume =	8
, year =	1993
, pages =	"57--64"
, update =	"94.05 matousek"
}

@article{s-esms-87
, author =	"R. Shamir"
, title =	"The efficiency of the simplex method: a survey"
, journal =	"Manage. Sci."
, volume =	33
, year =	1987
, pages =	"301--334"
, keywords =	"linear programming, Monte Carlo"
}

@inproceedings{sd-cagst-90
, author =	"R. Shamir and B. Dietrich"
, title =	"Characterization and algorithms for greedily solvable transportation problems"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"358--366"
}

@incollection{sffr-hpgis-78
, author =	"M. Shamos and H. Freeman and R. Franklin and A. Rosenfeld"
, title =	"??"
, editor =	"G. Dutton"
, booktitle =	"Harvard Papers on Geographical Information Systems"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1978
, pages =	"??"
, keywords =	"complexity theory, design of algorithms, data structuring, cartography, searching, probing, divide-and-conquer, dynamizing data structures, triangulation, polygonal chains"
}

@phdthesis{s-cg-78
, author =	"M. I. Shamos"
, title =	"Computational Geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Yale Univ."
, address =	"New Haven, CT"
, year =	1978
, keywords =	"doctoral thesis"
, comments =	"UMI 78-19047"
, succeeds =	"s-pcg-77"
, update =	"93.09 jones"
}

@inproceedings{s-gc-75
, author =	"M. I. Shamos"
, title =	"Geometric complexity"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Theory Comput."
, year =	1975
, pages =	"224--233"
}

@incollection{s-gspi-76
, author =	"M. I. Shamos"
, title =	"Geometry and statistics: problems at the interface"
, editor =	"J. F. Traub"
, booktitle =	"Algorithms and Complexity: New Directions and Recent Results"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1976
, pages =	"251--280"
}

@techreport{s-pcg-77
, author =	"M. I. Shamos"
, title =	"Problems in computational geometry"
, type =	"Report"
, number =	""
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1977
, comments =	"An early version of his thesis?"
, precedes =	"s-cg-78"
, update =	"94.05 devillers"
}

@incollection{s-eycgp-99
, author =	"M. I. Shamos"
, title =	"The early years of computational geometry---a personal memoir"
, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
, booktitle =	"Advances in Discrete and Computational Geometry"
, series =	"Contemporary Mathematics"
, volume =	223
, publisher =	"American Mathematical Society"
, address =	"Providence"
, year =	1999
, pages =	"313--333"
, update =	"00.03 smid"
}

@inproceedings{sb-oasgd-77
, author =	"M. I. Shamos and J. L. Bentley"
, title =	"Optimal algorithms for structuring geographic data"
, booktitle =	"Proc. Sympos. Topological Data Structures for Geographic Inform. Systems"
, publisher =	"Harvard Univ."
, year =	1977
, pages =	"43--51"
}

@inproceedings{sh-cpp-75
, author =	"M. I. Shamos and D. Hoey"
, title =	"Closest-Point Problems"
, booktitle =	"Proc. 16th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1975
, pages =	"151--162"
, annote =	"Uses Voronoi tessellation to get $O(N\log N)$
		 algorithms for: all closest points; Euclidean MST;
		 Triangulation; Convex Hull; Largest empty circle;
		 smallest enclosing circle. Divide and Conquer algorithm
		 for VD."
}

@inproceedings{sh-gip-76
, author =	"M. I. Shamos and D. Hoey"
, title =	"Geometric intersection problems"
, booktitle =	"Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1976
, pages =	"208--215"
}

@inproceedings{sy-lbcft-76
, author =	"M. I. Shamos and G. Yuval"
, title =	"Lower bounds from complex function theory"
, booktitle =	"Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1976
, pages =	"268--273"
}

@inproceedings{sbv-hslim-90
, author =	"Mark Shand and Patrice Bertin and Jean Vuillemin"
, title =	"Hardware speedups in long integer multiplication"
, booktitle =	"2nd ACM Sympos. Parallel Algorithms Arch."
, year =	1990
, update =	"98.11 bibrelex"
}

@article{s-frbri-80
, author =	"U. Shani"
, title =	"Filling regions in binary raster images: a graph-theoretical appoach"
, journal =	"Computer graphics"
, volume =	14
, year =	1980
, pages =	"321--327"
, update =	"98.07 bibrelex"
}

@article{sp-viosd-91
, author =	"K. Shanmukh and A. K. Pujari"
, title =	"Volume intersection with optimal set of directions"
, journal =	"P. Reco. Letters"
, volume =	"??"
, year =	1991
, pages =	"165--170"
, update =	"98.11 bibrelex"
}

@article{s-sdbcd-81
, author =	"M. Shantz"
, title =	"Surface definition for branching contour-defined objects"
, journal =	"Comput. Graph."
, volume =	15
, year =	1981
, pages =	"242--270"
, update =	"98.03 bibrelex"
}

@article{sf-copva-79
, author =	"R. Shapira and H. Freeman"
, title =	"The cyclic order property of vertices as an aid in scene analysis"
, journal =	"Commun. ACM"
, volume =	22
, year =	1979
, pages =	"3--9"
}

@book{s-daela-91
, author =	"R. E. Shapire"
, title =	"The Design and Analysis of Efficient Learning Algorithms"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1991
}

@article{s-tleup-78
, author =	"H. D. Shapiro"
, title =	"Theoretical limitations on the efficient use of parallel memories"
, journal =	"IEEE Trans. Comput."
, volume =	"??"
, year =	1978
, update =	"97.11 bibrelex"
}

@article{s-nlsad-81
, author =	"M. Shapiro"
, title =	"A Note on {Lee} and {Schachter's} Algorithm for {Delaunay} Triangulation"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	10
, number =	6
, year =	1981
, pages =	"413--418"
, annote =	"Modification of Lee and Schachter's second algorithm
		 such that points outside the convex hull can be added.
		 $O(n^2)$ worst case, claims $O(n^{4/3})$ in practice."
}

@article{s-mgrsd-97
, author =	"V. Shapiro"
, title =	"Maintenance of geometric representations through space decompositions"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"21--56"
, update =	"97.07 devillers"
}

@techreport{s-rsasf-91
, author =	"V. Shapiro"
, title =	"Representations of Semi-Algebraic Sets in Finite Algebras Generated by Space Decompositions"
, type =	"Technical {Report}"
, number =	"CPA 91-1"
, institution =	"Cornell Univ."
, address =	"Ithaca, New York"
, month =	feb
, year =	1991
, update =	"93.09 milone+mitchell"
}

@article{sh-dtdsg-79
, author =	"V. Shapiro and R. M. Haralick"
, title =	"Decomposition of Two-Dimensinal Shapes by Graph Theoretic Clusters"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-1"
, number =	1
, year =	1979
, pages =	"10--20"
, update =	"93.09 milone+mitchell"
}

@techreport{sv-brrcc1-90
, author =	"V. Shapiro and D. Vossler"
, title =	"{B}-rep $\rightarrow$ {CSG} conversion {I}: construction and optimization of {CSG} representations"
, type =	"Technical {Report}"
, number =	"CPA89-3a"
, institution =	"Cornell Programmable Automation"
, address =	"Ithaca, NY"
, month =	sep
, year =	1990
}

@techreport{sv-brrcc2-90
, author =	"V. Shapiro and D. Vossler"
, title =	"{B}-rep $\rightarrow$ {CSG} conversion {II}: efficient {CSG} representations of planar solids"
, type =	"Technical {Report}"
, number =	"CPA89-4a"
, institution =	"Cornell Programmable Automation"
, address =	"Ithaca, NY"
, month =	may
, year =	1990
}

@techreport{sv-ecrps-89
, author =	"V. Shapiro and D. Vossler"
, title =	"Efficient {CSG} representations of planar solids"
, type =	"Technical {Report}"
, institution =	"Sibley School of M\&AE, Cornell Univ."
, address =	"Ithaca, NY"
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{sv-wipfs-95
, author =	"V. Shapiro and D. L. Vossler"
, title =	"What is a parametric family of solids?"
, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
, site =	"Salt Lake City, UT"
, month =	may
, year =	1995
, update =	"98.07 bibrelex"
}

@inproceedings{s-nlap2-96
, author =	"Micha Sharir"
, title =	"A Near-Linear Algorithm for the Planar $2$-Center Problem"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"106--112"
, cites =	"as-pglp-94, d-ptctm-84, e-dtdlp-92, e-fcptc-96, e-samcp-93, h-fatcd-93, hlc-sdase-93, hs-ftp-91, jk-eaetc-94, ks-ebago-93, m-apcad-83, m-ltalp-83, ms-cscgl-84, ol-mcp-81, s-mpafo-94, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@article{s-nlap2-97
, author =	"Micha Sharir"
, title =	"A Near-Linear Algorithm for the Planar $2$-Center Problem"
, journal =	"Discrete Comput. Geom."
, volume =	18
, year =	1997
, pages =	"125--134"
, update =	"98.03 agarwal"
}

@techreport{s-npsap-89t
, author =	"Micha Sharir"
, title =	"A note on the {Papadimitriou}-{Silverberg} algorithm for planning optimal piecewise-linear motion of a ladder"
, number =	"NYU Robotics Report 188"
, institution =	"Courant Institute, New York University"
, year =	1989
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{s-npsap-89
, author =	"Micha Sharir"
, title =	"A note on the {Papadimitriou}-{Silverberg} algorithm for planning optimal piecewise linear motion of a ladder"
, journal =	"Inform. Process. Lett."
, volume =	32
, year =	1989
, pages =	"187--190"
, keywords =	"motion planning"
, update =	"98.03 mitchell"
}

@incollection{s-amp-97
, author =	"Micha Sharir"
, title =	"Algorithmic motion planning"
, chapter =	40
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"733--754"
, update =	"98.03 mitchell, 97.11 orourke"
}

@techreport{s-ampr-88
, author =	"Micha Sharir"
, title =	"Algorithmic motion planning in robotics"
, type =	"Report"
, number =	392
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1988
, keywords =	"motion planning, robotics, survey paper"
, precedes =	"s-ampr-89"
, update =	"98.03 mitchell"
}

@article{s-ampr-89
, author =	"Micha Sharir"
, title =	"Algorithmic motion planning in robotics"
, journal =	"Computer"
, volume =	22
, year =	1989
, pages =	"9--20"
, keywords =	"motion planning, robotics, survey paper"
, succeeds =	"s-ampr-88"
, precedes =	"ss-ampr-90"
, update =	"98.03 mitchell"
}

@article{s-alubl-87
, author =	"Micha Sharir"
, title =	"Almost linear upper bounds for the length of general {Davenport}-{Schinzel} sequences"
, journal =	"Combinatorica"
, volume =	7
, year =	1987
, pages =	"131--143"
, keywords =	"Davenport-Schinzel sequences"
, update =	"98.03 mitchell"
}

@techreport{s-atubl-93t
, author =	"Micha Sharir"
, title =	"Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
, type =	"manuscript"
, year =	1993
, precedes =	"s-atubl-93, s-atubl-94"
, update =	"98.11 bibrelex"
}

@inproceedings{s-atubl-93
, author =	"Micha Sharir"
, title =	"Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '93"
, year =	1993
, pages =	"498--507"
, succeeds =	"s-atubl-93t"
, update =	"98.11 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

%, number =      3
@article{s-atubl-94
, author =	"Micha Sharir"
, title =	"Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"327--345"
, succeeds =	"s-atubl-93, s-atubl-93t"
, update =	"98.11 bibrelex, 98.03 mitchell, 95.01 orourke+smid"
}

@inproceedings{s-ahdvd-95
, author =	"Micha Sharir"
, title =	"Arrangements in Higher Dimensions: {Voronoi} Diagrams, Motion Planning, and Other Applications"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"109--121"
, update =	"00.03 bibrelex"
}

@incollection{s-ashd-99
, author =	"Micha Sharir"
, title =	"Arrangements of Surfaces in Higher Dimensions"
, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
, booktitle =	"Advances in Discrete and Computational Geometry"
, series =	"Contemporary Mathematics"
, volume =	223
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1999
, pages =	"335--353"
, update =	"00.03 smid"
}

@inproceedings{s-ashde-93
, author =	"Micha Sharir"
, title =	"Arrangements of Surfaces in Higher Dimensions: {Envelopes}, Single Cells, and Other Recent Developments"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"181--186"
, cites =	"ass-sulbl-89, aps-zsha-93, as-tsbac-90, as-car-92, bhok-sanvp-91, bdsty-arsol-92, bd-olrcu-93, cegs-dwclp-93, cegss-lsca-96, cs-arscg-89, e-acg-87, es-vda-86, fl-vdmpp-91, gks-ricdv-92, gmr-vdmpp-91t, gss-gmppt-89, h-ampac-92, hs-nblet-93, hs-nqbmp-93t, hs-cscas, hs-ndssg-86, ms-eracu-91, ps-ueplf-89, p-lmps3-93, pr-ncdsp-93, ss-tddsp-90, s-ksacs-91, s-atubl-93t, cegss-cfals-93, as-dssga-00, ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
}

@incollection{s-dsstg-88
, author =	"Micha Sharir"
, title =	"Davenport-{Schinzel} sequences and their geometric applications"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"253--278"
, keywords =	"Davenport-Schinzel sequences, survey paper"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@inproceedings{s-eappt-87
, author =	"Micha Sharir"
, title =	"Efficient algorithms for planning purely translational collision-free motion in two and three dimensions"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1987
, pages =	"1326--1331"
, update =	"98.03 mitchell"
}

@article{s-ilbld-88
, author =	"Micha Sharir"
, title =	"Improved lower bounds on the length of {Davenport}-{Schinzel} sequences"
, journal =	"Combinatorica"
, volume =	8
, year =	1988
, pages =	"117--124"
, keywords =	"Davenport-Schinzel sequences"
, update =	"98.03 mitchell"
}

@inproceedings{s-ipca-96
, author =	"Micha Sharir"
, title =	"Improved $p$-Center Algorithms"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	85
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{s-icpps-85
, author =	"Micha Sharir"
, title =	"Intersection and closest-pair problems for a set of planar discs"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"448--468"
, keywords =	"Voronoi diagrams"
, update =	"98.03 mitchell"
}

@article{s-ksrh-93
, author =	"Micha Sharir"
, title =	"$k$-sets and random hulls"
, journal =	"Combinatorica"
, volume =	13
, year =	1993
, pages =	"483--495"
, update =	"98.03 mitchell, 94.05 sharir"
}

@article{s-ksacs-91
, author =	"Micha Sharir"
, title =	"On $k$-sets in arrangements of curves and surfaces"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"593--613"
, update =	"98.03 mitchell"
}

@techreport{s-spacp-85
, author =	"Micha Sharir"
, title =	"On shortest paths amdist convex polyhedra"
, number =	181
, institution =	"Computer Science Division, Courant Institute of Mathematical Sciences"
, year =	1985
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{s-spacp-87
, author =	"Micha Sharir"
, title =	"On shortest paths amidst convex polyhedra"
, journal =	"SIAM J. Comput."
, volume =	16
, year =	1987
, pages =	"561--572"
, keywords =	"shortest paths, polyhedra, convex, Davenport-Schinzel sequences, Voronoi diagrams"
, succeeds =	"sb-spacp-86"
, update =	"98.03 mitchell"
}

@techreport{s-tddsp-85
, author =	"Micha Sharir"
, title =	"On the two-dimensional {Davenport}-{Schinzel} problem"
, type =	"Report"
, number =	193
, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1985
, keywords =	"Davenport-Schinzel sequences, upper/lower envelope"
, precedes =	"ss-tddsp-90"
, update =	"98.03 mitchell"
}

@inproceedings{s-rdtas-99
, author =	"M. Sharir"
, title =	"Recent developments in the theory of arrangements of surfaces"
, booktitle =	"Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	1738
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"1--20"
, update =	"00.03 smid"
}

@inproceedings{s-cstre-01
, author =	"Micha Sharir"
, title =	"The Clarkson-Shor Technique Revisited and Extended"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"252--256"
, update =	"01.11 pocchiola"
}

@article{s-swrpp-88
, author =	"Micha Sharir"
, title =	"The shortest watchtower and related problems for polyhedral terrains"
, journal =	"Inform. Process. Lett."
, volume =	29
, number =	5
, year =	1988
, pages =	"265--270"
, keywords =	"visibility, polyhedral terrain"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@book{sa-dsstg-95
, author =	"Micha Sharir and P. K. Agarwal"
, title =	"{Davenport}-{Schinzel} Sequences and Their Geometric Applications"
, publisher =	"Cambridge University Press"
, address =	"New York"
, year =	1995
, update =	"98.03 mitchell, 95.09 agarwal, 94.05 matousek"
}

@article{sa-pmp4v-84
, author =	"Micha Sharir and E. Ariel-Sheffi"
, title =	"On the ``piano movers'' problem {IV}: various decomposable two-dimensional motion planning problems"
, journal =	"Commun. Pure Appl. Math."
, volume =	37
, year =	1984
, pages =	"479--493"
, keywords =	"motion planning"
, update =	"98.03 mitchell"
}

@inproceedings{sb-spacp-86
, author =	"Micha Sharir and A. Baltsan"
, title =	"On shortest paths amidst convex polyhedra"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"193--206"
, precedes =	"s-spacp-87"
, cites =	"sb-spbtc-85, hs-ndssg-84, m-fspcp-85, rs-spesp-85, s-alubl-87, s-spacp-85, ss-spps-86, s-pds-74, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@techreport{sb-spbtc-85
, author =	"Micha Sharir and A. Baltsan"
, title =	"On shortest paths between two convex polyhedra"
, type =	"Report"
, number =	180
, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1985
, precedes =	"bs-spbtc-88"
, update =	"98.03 mitchell"
}

@inproceedings{scklps-gadss-86
, author =	"Micha Sharir and R. Cole and K. Kedem and D. Leven and R. Pollack and S. Sifrony"
, title =	"Geometric applications of {Davenport}-{Schinzel} sequences"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"77--86"
, keywords =	"Davenport-Schinzel sequences, motion planning, visibility"
, comments =	"In five journal papers: \cite{ls-ncfcc-87},
		 \cite{pss-stsps-88}, \cite{ks-empac-90},
		 \cite{cs-vppt-89}, \cite{ws-prnds-88}"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{sl-mfipc-85
, author =	"Micha Sharir and R. Livne"
, title =	"On minima of functions, intersection patterns of curves and {Davenport}-{Schinzel} sequences"
, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1985
, pages =	"312--320"
, update =	"98.03 mitchell, 94.05 sharir"
}

@article{so-sosah-92
, author =	"Micha Sharir and M. Overmars"
, title =	"A simple output-sensitive algorithm for hidden-surface removal"
, journal =	"ACM Trans. Graph."
, volume =	11
, year =	1992
, pages =	"1--11"
, update =	"98.03 mitchell"
}

@inproceedings{ss-spps-84
, author =	"Micha Sharir and A. Schorr"
, title =	"On shortest paths in polyhedral spaces"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"144--153"
, precedes =	"ss-spps-86"
, update =	"98.03 mitchell"
}

@article{ss-spps-86
, author =	"Micha Sharir and A. Schorr"
, title =	"On shortest paths in polyhedral spaces"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"193--215"
, keywords =	"shortest paths, three-dimensional, polyhedra"
, succeeds =	"ss-spps-84"
, update =	"98.03 mitchell"
}

@inproceedings{ss-cmpti-88
, author =	"Micha Sharir and S. Sifrony"
, title =	"Coordinated motion planning for two independent robots"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"319--328"
, keywords =	"motion planning, configuration space"
, precedes =	"ss-cmpti-91"
, cites =	"ass-sulbl-87, as-tsbac-88, c-crmp-87, fwy-cmtra-86, gss-gmppt-88, hs-ndssg-86, hw-dt-48, klps-ujrcf-86, ko-mltdu-87, ks-empac-90, l-bc-61, ls-esmpa-87, oy-rmpmd-85, osy-gvdl-86, osy-gvdl-87, pss-stsps-88, ra-amprc-85, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, ss-empae-85, ss-nempa-87, y-cmsd-84, y-oavds-87, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{ss-cmpti-91
, author =	"Micha Sharir and S. Sifrony"
, title =	"Coordinated motion planning for two independent robots"
, journal =	"Ann. Math. Artif. Intell."
, volume =	3
, year =	1991
, pages =	"107--130"
, keywords =	"motion planning, configuration space"
, succeeds =	"ss-cmpti-88"
, update =	"98.03 mitchell"
}

@article{ss-tbpli-91
, author =	"Micha Sharir and Steven S. Skiena"
, title =	"Tight bounds on a problem of lines and intersections"
, journal =	"Discrete Math."
, volume =	89
, year =	1991
, pages =	"313--314"
, update =	"98.03 mitchell"
}

@inproceedings{sst-ibkst-00a
, author =	"Micha Sharir and Shakhar Smorodinsky and G{\'a}bor Tardos"
, title =	"An Improved Bound for $k$-Sets in Three Dimensions"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"43--49"
, update =	"00.11 jones"
}

@inproceedings{sst-ibkst-00e
, author =	"Micha Sharir and Shakhar Smorodinsky and G{\'a}bor Tardos"
, title =	"An Improved Bound for {$k$}-Sets in Three Dimensions"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"132--135"
, update =	"00.03 bibrelex"
}

@techreport{st-epcp-91
, author =	"M. Sharir and S. Toledo"
, title =	"Extremal polygon containment problems"
, type =	"Technical {Report}"
, number =	"228/91"
, institution =	"Dept. Comput. Sci., Tel Aviv Univ."
, address =	"Tel Aviv, Israel"
, year =	1991
, succeeds =	"st-epcp-91t"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@techreport{st-epcp-91t
, author =	"M. Sharir and S. Toledo"
, title =	"Extremal polygon containment problems"
, type =	"manuscript"
, year =	1991
, precedes =	"st-epcp-91, t-epcpo-91, st-epcp-94, t-epcp-91"
, update =	"98.11 bibrelex"
}

@article{st-epcp-94
, author =	"Micha Sharir and S. Toledo"
, title =	"Extremal polygon containment problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"99--118"
, succeeds =	"st-epcp-91t"
, update =	"98.11 bibrelex, 98.03 mitchell, 95.09 agarwal"
}

@inproceedings{sw-cblpr-92
, author =	"Micha Sharir and Emo Welzl"
, title =	"A combinatorial bound for linear programming and related problems"
, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	577
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"569--579"
, update =	"98.03 mitchell"
}

@inproceedings{sw-rpppp-96
, author =	"Micha Sharir and Emo Welzl"
, title =	"Rectilinear and Polygonal $p$-Piercing and $p$-Center Problems"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"122--132"
, cites =	"as-atgo-95, ast-apsgo-94, a-httgl-94, a-bbhdn-94, cm-ltdao-93, dg-ipbr-82, d-pcpho-84, d-rpcp-87, e-hrctt-93, eh-gssml-72, fw-fll-74, f-oatp-91, fj-csrxm-82, fj-fkppc-83, fj-gsrsm-84, gt-ltasc-85, gks-sgsop-95, g-agtpg-80, kh-aanlp-79, kn-cdg-96, kn-pso-96, kc-ltawt-92, kl-wrccp-91, klc-rmcp-87, klc-oaarm-90, msw-sblp-96, m-ltalp-83, m-we1cp-83, m-apcad-83, mt-nrcpc-83, ms-cscgl-84, ol-mcp-81, s-nlap2-96, sw-cblpr-92, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@techreport{sy-ricdd-90
, author =	"Micha Sharir and E. Yaniv"
, title =	"Randomized incremental construction of {Delaunay} diagrams: {Theory} and Practice"
, institution =	"Tel Aviv Univ, Israel"
, month =	jul
, year =	1990
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@inproceedings{sw-tttpv-95
, author =	"A. Shashua and M. Werman"
, title =	"On the Trilinear Tensor of Three Perspective Views and its Underlying Geometry"
, booktitle =	"Proc. International Conference on Computer Vision"
, year =	1995
, update =	"96.01 werman"
}

@inproceedings{sz-aqrld-96
, author =	"H. Shatkay and S. Zdonik"
, title =	"Approximate queries and representations for large data sequences"
, booktitle =	"ICDE'96"
, year =	1996
, update =	"00.11 smid, 00.07 smid, 98.07 bibrelex"
}

@article{sp-msfmn-78
, author =	"R. D. Shaw and R. G. Pitchen"
, title =	"Modifications to the Suhara-Fukuda Method of Network Generation"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	12
, year =	1978
, pages =	"96--99"
, annote =	"Modified S-F algorithm. Generates interior nodes on
		 equilateral triangle grid and then triangulates
		 resulting set. Builds triangle on each ``open'' edge in
		 turn."
}

@article{sar-sdmsc-96
, author =	"D. J. Sheehy and C. G. Armstrong and D. J. Robinson"
, title =	"Shape Description by Medial Surface Construction"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	2
, number =	1
, month =	mar
, year =	1996
, pages =	"62--72"
, update =	"96.09 held"
}

@inproceedings{sfyc-obdmcs-96
, author =	"Raj Shekhar and Elias Fayyad and Roni Yagel and J. Fredrick Cornhill"
, title =	"Octree-Based Decimation of Marching Cubes Surfaces"
, editor =	"Roni Yagel and Gregory M. Nielson"
, booktitle =	"Proceedings of the Conference on Visualization"
, publisher =	"IEEE"
, address =	"Los Alamitos"
, year =	1996
, pages =	"335--344"
, isbn =	"0-7803-3673-9"
, update =	"01.07 wenger"
}

@inproceedings{sn-anpld-89
, author =	"C. Shen and G. Nagy"
, title =	"Autonomous navigation to provide long-distance surface traverses for {Mars} rover sample return missions"
, booktitle =	"Proc. IEEE Internat. Sympos. Intelligent Control"
, year =	1989
, pages =	"362--367"
, update =	"97.11 bibrelex"
}

@techreport{se-tlbsv-86
, author =	"X. Shen and H. Edelsbrunner"
, title =	"A tight lower bound on the size of visibility graphs"
, number =	"UIUCDCS-R-86-1299"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1986
, precedes =	"se-tlbsv-87"
, update =	"98.11 bibrelex"
}

@article{se-tlbsv-87
, author =	"X. Shen and H. Edelsbrunner"
, title =	"A tight lower bound on the size of visibility graphs"
, journal =	"Inform. Process. Lett."
, volume =	26
, year =	1987
, pages =	"61--64"
, succeeds =	"se-tlbsv-86"
, update =	"98.11 bibrelex"
}

@article{sh-nmvg-93
, author =	"X. Shen and Q. Hu"
, title =	"A note on minimal visibility graphs"
, journal =	"Inform. Process. Lett."
, volume =	46
, year =	1993
, pages =	101
, update =	"98.11 bibrelex"
}

@incollection{s-cilc-94
, author =	"Ching-Kuang Shene"
, title =	"Computing the Intersection of a Line and a Cylinder"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"353--355"
, keywords =	"quadric surface, ray tracing, cone"
, update =	"94.09 heckbert"
, annote =	"Geometric method for intersecting a ray with a cylinder."
}

@incollection{s-ecc-94
, author =	"Ching-Kuang Shene"
, title =	"Equations of Cylinders and Cones"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"321--323"
, keywords =	"quadric surface"
, update =	"94.09 heckbert"
, annote =	"Derives the implicit equations of cylinders and cones."
}

@techreport{sj-lditn-91
, author =	"C.-K. Shene and J. K. Johnstone"
, title =	"On the lower degree intersections of two natural quadrics, part {I}: algorithms"
, type =	"Technical {Report}"
, number =	"JHU-91-15"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	sep
, year =	1991
, succeeds =	"sj-pinq-91"
}

@inproceedings{sj-pinq-91
, author =	"C.-K. Shene and J. K. Johnstone"
, title =	"On the planar intersection of natural quadrics"
, booktitle =	"Proc. ACM Sympos. Solid Modeling Found. CAD/CAM Appl."
, year =	1991
, pages =	"233--242"
, precedes =	"sj-lditn-91"
}

@article{sh-ttsps-92
, author =	"X. Sheng and B. E. Hirsch"
, title =	"Triangulation of trimmed surfaces in parametric space"
, journal =	"Comput. Aided Design"
, volume =	24
, year =	1992
, pages =	"437--444"
, update =	"98.07 bibrelex"
}

@inproceedings{st-tsms-91
, author =	"X. Sheng and U. Tucholke"
, title =	"On triangulating suface models for {SLA}"
, booktitle =	"Proc. 2nd Internat. Conf. on Rapid Prototyping"
, site =	"Dayton, OH"
, year =	1991
, pages =	"236--239"
, update =	"98.07 bibrelex"
}

@article{sc-mesaa-86
, author =	"D. N. Shenton and Z. J. Cendes"
, title =	"{MAX}---An Expert System for automatic adaptive magnetics modelling"
, journal =	"IEEE Trans. Magn."
, volume =	"MAG-22"
, year =	1986
, pages =	"805--807"
, annote =	"DT mesh refined by adding points at circumcentre
		 instead of centroid."
}

@article{sc-tdfem-85
, author =	"D. N. Shenton and Z. J. Cendes"
, title =	"Three-Dimensional Finite Element Mesh Generation Using {Delaunay} Tesselation"
, journal =	"IEEE Trans. Magn."
, volume =	"MAG-21"
, number =	6
, year =	1985
, pages =	"2535--2538"
, annote =	"Switching extended to 3D basic incremental
		 algorithm."
}

@inproceedings{s-tdifi-68
, author =	"D. Shepard"
, title =	"A two-dimensional interpolation function for irregularly spaced data"
, booktitle =	"Proc. 23rd Nat. Conf. ACM"
, year =	1968
, pages =	"517--524"
}

@article{s-spcp-66
, author =	"G. C. Shepard"
, title =	"The {Steiner} point of a convex polytope"
, journal =	"Canad. J. Math."
, volume =	18
, year =	1966
, pages =	"1294--1300"
, update =	"98.03 bibrelex"
}

@article{s-cpcn-75
, author =	"G. C. Shephard"
, title =	"Convex Polytopes with Convex Nets"
, journal =	"Math. Proc. Camb. Phil. Soc."
, volume =	78
, year =	1975
, pages =	"389--403"
, update =	"94.09 orourke"
}

@article{s-aagcf-88
, author =	"M. S. Shephard"
, title =	"Approaches to the automatic generation and control of finite element meshes"
, journal =	"Appl. Mech. Rev."
, volume =	41
, year =	1988
, pages =	"169--185"
, update =	"97.11 bibrelex"
}

@article{s-aamg-85
, author =	"M. S. Shephard"
, title =	"Automatic and adaptive mesh generation"
, journal =	"IEEE Trans. Magn."
, volume =	"MAG-21"
, year =	1985
, pages =	"2484--2489"
}

@article{sl-agctd-91
, author =	"M. S. Shephard and J. A. Lo"
, title =	"Automatic Generation of coarse three-dimensional meshes using the functionality of a geometric modeler"
, journal =	"Advances in Engineering Software and Workstations"
, volume =	13
, number =	"5--6"
, month =	sep
, year =	1991
, pages =	"273--286"
, annote =	"Subdivides by chopping of tetrahedra. Tetra quality
		 measure is $\mbox{Volume}^2/\mbox{Area}^3$."
}

@article{syb-amgae-85
, author =	"M. S. Shephard and M. A. Yerry and P. O. Baehmann"
, title =	"Automatic mesh generation allowing for efficient a priori and posteriori mesh refinement"
, journal =	"Comput. Methods Appl. Mech. Engrg."
, volume =	55
, year =	1985
, pages =	"161--180"
}

@article{sk-ctnmx-78
, author =	"L. A. Shepp and J. B. Kruskal"
, title =	"Computerized tomography: the new medical {X}-ray technology"
, journal =	"Amer. Math. Monthly"
, volume =	85
, year =	1978
, pages =	"420--439"
, update =	"97.11 bibrelex"
}

@techreport{s-qrm-78
, author =	"S. W. Sheppard"
, title =	"Quaternion from Rotation Matrix"
, type =	"NASA Contract"
, number =	"NAS 9-13809"
, institution =	"The Charles Stark Draper Laboratory, Inc."
, address =	"Cambridge, MA"
, year =	1978
, update =	"98.11 bibrelex"
}

@phdthesis{s-3dsi-95
, author =	"E. C. Sherbrooke"
, title =	"3-{D} Shape Interrogation by Medial Axis Transform"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Ocean Engineering, Massachusetts Institute of Technology"
, address =	"Cambridge, Massachusetts"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"95.05 abrams+held"
}

@inproceedings{sp-cmat3-95
, author =	"E. C. Sherbrooke and N. M. Patrikalakis"
, title =	"Computation of Medial Axis Transforms of 3D Polyhedra"
, editor =	"J. R. Rossignac and C. M. Hoffmann"
, booktitle =	"Proc. Third ACM Solid Modeling Conference"
, year =	1995
, update =	"95.05 abrams"
}

@article{sp-csnps-93
, author =	"E. C. Sherbrooke and N. M. Patrikalakis"
, title =	"Computation of the Solutions of Nonlinear Polynomial Systems"
, journal =	"Comput. Aided Geom. Design"
, volume =	10
, number =	5
, year =	1993
, pages =	"379--405"
, update =	"95.05 abrams"
}

@article{spb-amat3-96
, author =	"E. C. Sherbrooke and N. M. Patrikalakis and E. Brisson"
, title =	"An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	2
, number =	1
, month =	mar
, year =	1996
, pages =	"45--61"
, update =	"96.09 held"
}

@article{sp-simc-90
, author =	"D. Sherman and S. Peleg"
, title =	"Stereo by incremental matching of contours"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	12
, number =	11
, year =	1990
, pages =	"1102--1106"
, update =	"97.11 bibrelex"
}

@inproceedings{s-tbceg-94
, author =	"T. Shermer"
, title =	"A tight bound on the combinatorial edge guarding problem"
, booktitle =	"Snapshots of Computational and Discrete Geometry"
, volume =	3
, publisher =	"School Comput. Sci., McGill Univ."
, month =	aug
, year =	1994
, pages =	"191--223"
, update =	"97.11 orourke"
}

@inproceedings{s-cbtt-89
, author =	"T. Shermer"
, title =	"Computing bushy and thin triangulations"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	49
, precedes =	"s-cbtt-91"
}

@article{s-cbtt-91
, author =	"T. Shermer"
, title =	"Computing bushy and thin triangulations"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1991
, pages =	"115--125"
, succeeds =	"s-cbtt-89"
}

@techreport{s-cgopl-91
, author =	"T. Shermer"
, title =	"Convering and Guarding Orthogonal Polygons with $l_k$-Sets"
, type =	"manuscript"
, institution =	"Simon Fraser University"
, year =	1991
, update =	"98.11 bibrelex"
}

@article{s-cgpul-91
, author =	"T. Shermer"
, title =	"Convering and Guarding Polygons Using $L_k$-Sets"
, journal =	"Geom. Dedicata"
, volume =	37
, year =	1991
, pages =	"183--203"
, update =	"98.11 bibrelex"
}

@techreport{s-hpp-87
, author =	"T. Shermer"
, title =	"Hiding people in polygons"
, type =	"Technical {Report}"
, number =	"SOCS-87.18"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1987
, precedes =	"s-hpp-89"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@article{s-hpp-89
, author =	"T. Shermer"
, title =	"Hiding People in Polygons"
, journal =	"Computing"
, volume =	42
, year =	1989
, pages =	"109--131"
, succeeds =	"s-hpp-87"
, update =	"98.11 bibrelex"
}

@techreport{s-rvg3e-96
, author =	"T. Shermer"
, title =	"On rectangle visibility graphs {III}: {External} visibility and complexity"
, institution =	"DIMACS and Simon Fraser University"
, month =	apr
, year =	1996
, keywords =	"visibility graphs"
, update =	"96.09 orourke"
}

@techreport{s-rrag-90
, author =	"T. Shermer"
, title =	"Recent results in art galleries"
, type =	"Technical {Report}"
, institution =	"Simon Fraser Univ."
, address =	"Burnaby, BC"
, month =	oct
, year =	1990
, precedes =	"s-rrag-92"
, update =	"98.07 bibrelex"
}

@inproceedings{s-cgavp-93
, author =	"Thomas Shermer"
, title =	"The continuous-graph approach to visibility problems"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	321
, update =	"93.09 milone+mitchell"
}

@techreport{s-tgtre-84
, author =	"T. Shermer"
, title =	"Triangulation graphs that require extra guards"
, type =	"Technical {Memo}"
, number =	13
, institution =	"3-D Animation Syst. Group, Comput. Graph. Lab., New York Inst. Tech."
, address =	"New York, NY"
, year =	1984
}

@phdthesis{s-vpp-89
, author =	"T. Shermer"
, title =	"Visibility properties of polygons"
, school =	"McGill Univ."
, year =	1989
, keywords =	"doctoral thesis"
, update =	"94.05 devillers"
}

@techreport{st-ccssp-88
, author =	"T. Shermer and G. T. Toussaint"
, title =	"Characterizations of convex and star-shaped polygons"
, number =	"SOCS-88.11"
, institution =	"School of Computer Science, McGill University"
, month =	jun
, year =	1988
, update =	"98.03 bibrelex"
}

@article{s-labp-92
, author =	"T. C. Shermer"
, title =	"A linear algorithm for bisecting a polygon"
, journal =	"Inform. Process. Lett."
, volume =	41
, year =	1992
, pages =	"135--140"
}

@article{s-rutcp-93
, author =	"T. C. Shermer"
, title =	"On recognizing unions of two convex polygons and related problems"
, journal =	"Pattern Recogn. Lett."
, volume =	14
, year =	1993
, update =	"98.07 bibrelex"
}

@inproceedings{s-rvgie-96
, author =	"T. C. Shermer"
, title =	"On rectangle visibility graphs, {III}: {External} visibility and complexity"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"234--239"
, update =	"97.11 orourke, 97.03 agarwal, 96.09 mitchell"
}

@article{s-rrag-92
, author =	"T. C. Shermer"
, title =	"Recent Results in Art Galleries"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1384--1399"
, succeeds =	"s-rrag-90"
, update =	"98.07 bibrelex, 93.09 held"
}

@inproceedings{sy-pncrr-95
, author =	"T. C. Shermer and C. K. Yap"
, title =	"Probing for near centers and relative roundness"
, booktitle =	"Proc. ASME Workshop on Tolerancing and Metrology"
, year =	1995
, update =	"97.03 agarwal"
}

@techreport{s-apfpa-96
, author =	"J. Shewchuk"
, title =	"Adaptive precision floating point arithmetic and fast robust geometric predicates"
, number =	"CMU-CS-96-140"
, institution =	"Carnegie Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1996
, update =	"98.07 bibrelex"
}

@inproceedings{s-cgehd-98
, author =	"Jonathan R. Shewchuk"
, title =	"A Condition Guaranteeing the Existence of Higher-Dimensional Constrained {Delaunay} Triangulations"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"76--85"
, update =	"00.11 smid, 00.07 devillers"
}

@article{s-apfpa-97
, author =	"Jonathan Richard Shewchuk"
, title =	"Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates"
, journal =	"Discrete Comput. Geom."
, volume =	18
, number =	3
, year =	1997
, pages =	"305--363"
, succeeds =	"s-apfpa-96,s-rafpg-96"
, update =	"00.03 vismara"
}

@inproceedings{s-mgdsa-00
, author =	"Jonathan R. Shewchuk"
, title =	"Mesh Generation for Domains with Small Angles"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"1--10"
, update =	"00.11 jones"
}

@inproceedings{s-rafpg-96
, author =	"Jonathan R. Shewchuk"
, title =	"Robust Adaptive Floating-Point Geometric Predicates"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"141--150"
, cites =	"abdpy-esdus-97, b-phpmp-93,  c-sede-92, d-fptea-71, fv-eeacg-93, fv-sayee-96, g-wecss-91, gs-pmgsc-85, kln-edtur-91, k-sa-81, ls-tacdt-80, p-aapfp-91, p-pfpan-92, s-te2dq-96, w-cnddt-81, ZZZ"
, update =	"98.07 bibrelex, 97.11 bibrelex, 96.09 devillers+orourke, 96.05 efrat"
}

@inproceedings{s-sachd-00
, author =	"Jonathan Richard Shewchuk"
, title =	"Sweep Algorithms for Constructing Higher-Dimensional Constrained {Delaunay} Triangulations"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"350--359"
, update =	"00.11 jones"
}

@inproceedings{s-tmgdr-98
, author =	"Jonathan R. Shewchuk"
, title =	"Tetrahedral mesh generation by {Delaunay} refinement"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year =	1998
, pages =	"86--95"
, update =	"02.03 devillers, ???"
}

@inproceedings{s-te2dq-96
, author =	"J. R. Shewchuk"
, title =	"Triangle: Engineering a $2$d quality mesh generator and {Delaunay} triangulator"
, booktitle =	"First Workshop on Applied Computational Geometry"
, organization =	"Association for Computing Machinery"
, month =	may
, year =	1996
, update =	"01.07 devillers, 97.11 bibrelex"
}

@inproceedings{s-swa-92
, author =	"J. S. Shieh"
, title =	"Shortsighted watchman arrangement"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"192--197"
, cites =	"os-snhpd-83, k-dpsc-83, ags-ccrpd-88, o-agta-87, ws-oacdt-87, c-cdt-87, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{ss-ahmgs-96
, author =	"Bih-Yaw Shih and Hiroshi Sakurai"
, title =	"Automated hexahedral mesh generation by swept volume decomposition and recomposition"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"273--280"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@article{scl-saeap-87
, author =	"Z. C. Shih and G. H. Chen and R. C. T. Lee"
, title =	"Systolic algorithms to examine all pairs of elements"
, journal =	"CACM"
, volume =	"??"
, month =	feb
, year =	1987
, pages =	"161--167"
, update =	"98.03 bibrelex"
}

@inproceedings{sd-gtomr-88
, author =	"Z. Shiller and S. Dubowsky"
, title =	"Global Time-Optimal Motions of Robotic Manipulators in the Presence of Obstacles"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Philadelphia"
, year =	1988
, update =	"97.11 bibrelex"
}

@phdthesis{s-apgpl-76
, author =	"Y. Shiloach"
, title =	"Arrangements of Planar Graphs on the Planar Lattice"
, school =	"Weizmann Institute of Science"
, year =	1976
, keywords =	"doctoral thesis, graph drawing"
, update =	"93.09 tamassia"
}

@article{sv-fmmsp-81
, author =	"Y. Shiloach and U. Vishkin"
, title =	"Finding the maximum, merging and sorting in a parallel computation model"
, journal =	"J. Algorithms"
, volume =	2
, year =	1981
, pages =	"88--102"
, update =	"97.11 bibrelex"
}

@inproceedings{ssa-hdsj-97
, author =	"K. Shim and R. Srikant and R. Agrawarl"
, title =	"High-dimensional similarity joins"
, booktitle =	"Proc. 13th IEEE Internat. Conf. Data Eng."
, year =	1997
, pages =	"301--311"
, update =	"97.07 agarwal"
}

@inproceedings{sg-cmpbf-92
, author =	"K. Shimada and D. C. Gossard"
, title =	"Computational methods for physically-based {FE} mesh generation"
, booktitle =	"Proc. IFIP/TC5/WG5.3 8th Internat. Conf. PROLAMAT"
, site =	"Tokyo, Japan"
, year =	1992
, update =	"98.03 bibrelex"
}

@article{s-a112p-62
, author =	"M. Shimrat"
, title =	"Algorithm 112: position of point relative to polygon"
, journal =	"Commun. ACM"
, volume =	5
, year =	1962
, pages =	434
}

@article{skc-aeasl-00
, author =	"C.-S. Shin and S. K. Kim and K.-Y. Chwa"
, title =	"Area-efficient algorithms for straight-line tree drawings"
, journal =	"Comput. Geom. Theory Appl."
, volume =	15
, year =	2000
, pages =	"175--202"
, succeeds =	"skc-aeaus-96"
, update =	"00.03 smid"
}

@inproceedings{skc-aeaus-96
, author =	"C.-S. Shin and S. K. Kim and K.-Y. Chwa"
, title =	"Area-Efficient Algorithms for Upward Straight-Line Tree Drawings"
, booktitle =	"Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '96"
, site =	"Hong Kong"
, series =	"Lecture Notes Comput. Sci."
, volume =	1090
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"106--116"
, keywords =	"graph drawing, tree drawing, straight line drawing"
, precedes =	"skc-aeasl-00"
, update =	"00.03 smid, 99.11 bibrelex, 97.11 shin"
, abstract =	"The presented algorithm produces an upward, straight-line
                 tree drawing whose area is $O(n\log \log n)$.
                 Several related tree drawing problems are considered."
}

@inproceedings{sss-tdczr-86
, author =	"H. Shin and A. L. Sangiovanni-Vincentelli and C. H. S{\'e}quin"
, title =	"Two dimensional compaction by 'zone refining'"
, booktitle =	"Proc. 23rd Design Autom. Conf."
, year =	1986
, pages =	"115--122"
, update =	"98.03 bibrelex"
}

@article{sm-mtcrm-85
, author =	"K. G. Shin and N. D. McKay"
, title =	"Minimum-time control of robotic manipulators with geometric path constraints"
, journal =	"IEEE Trans. Autom. Control"
, volume =	"AC-30"
, month =	jun
, year =	1985
, pages =	"531--541"
, update =	"97.11 bibrelex"
}

@article{s-paipp-93
, author =	"S. Y. Shin"
, title =	"A predictive algorithm for intersecting parametric polynomial surfaces"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"203--219"
, keywords =	"computer graphics, parametric surfaces, ray-patch intersection algorithms"
, update =	"96.09 devillers"
}

@article{sw-fchsp-86
, author =	"S. Y. Shin and T. C. Woo"
, title =	"Finding the convex hull of a simple polygon in linear time"
, journal =	"Pattern Recogn."
, volume =	19
, year =	1986
, pages =	"453--458"
}

@article{sk-crgac-91
, author =	"Y. Shinagawa and T. L. Kunii"
, title =	"Constructing a {Reeb} graph automatically from cross sections"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	11
, month =	nov
, year =	1991
, pages =	"44--51"
, update =	"98.07 bibrelex"
}

@article{skk-scbmt-91
, author =	"Y. Shinagawa and T. L. Kunii and Y. L. Kergosien"
, title =	"Surface coding based on morse theory"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	11
, month =	sep
, year =	1991
, pages =	"66--78"
, update =	"98.07 bibrelex"
}

@article{sf-loogp-95
, author =	"M. Shinya and M.-C. Forgue"
, title =	"Laying Out Objects with Geometric and Physical Constraints"
, journal =	"Visual Comput."
, volume =	11
, number =	4
, year =	1995
, pages =	"188--201"
, update =	"96.01 held"
}

@inproceedings{s-dqmsd-91
, author =	"P. Shirley"
, title =	"Discrepancy as a Quality Measure for Sample Distributions"
, editor =	"F. H. Post and W. Barth"
, booktitle =	"Proc. Eurographics '91"
, publisher =	"Elsevier Science"
, address =	"Vienna, Austria"
, month =	sep
, year =	1991
, pages =	"183--194"
, update =	"93.09 held"
}

@inproceedings{st-padsc-90
, author =	"P. Shirley and A. Tuchman"
, title =	"A Polygonal Approximation to Direct Scalar Volume Rendering"
, booktitle =	"San Diego Workshop on Volume Visualization"
, series =	"Comput. Gr"
, volume =	24
, month =	dec
, year =	1990
, pages =	"63--70"
, update =	"98.07 bibrelex"
}

@inproceedings{sta-aaflp-97
, author =	"D. Shmoys and E. Tardos and K. Aardel"
, title =	"Approximation algorithms for facility location problems"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, year =	1997
, pages =	"265--274"
, update =	"98.07 agarwal"
}

@inproceedings{st-gigaa-97
, author =	"M. Shneerson and A. Tal"
, title =	"GASP-II: A geometric algorithm animation system for an electronic classroom"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"379--381"
, cites =	"bclt-aawww-96, b-aa-87, b-zsaam-92a, bn-catwb-96, bs-taa-85, ekkmns-wcg-94, mn-lledt-89, s-raplg-91, s-tfsaa-90, td-vga-95, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@article{s-rciem-77
, author =	"B. Shneiderman"
, title =	"Reduced combined indexes for efficient multiple attribute retrieval"
, journal =	"Inform. Syst."
, volume =	2
, year =	1977
, pages =	"149--154"
}

@article{s-cgpuq-81
, author =	"M. Shneier"
, title =	"Calculations of geometric properties using quadtrees"
, journal =	"Comput. Graph. Image Process."
, volume =	16
, year =	1981
, pages =	"296--302"
}

@article{s-pldtq-81
, author =	"M. Shneier"
, title =	"Path length distance transform for quadtrees"
, journal =	"Inform. Sci."
, volume =	23
, year =	1981
, pages =	"45--67"
}

@article{s-thlfr-81
, author =	"M. Shneier"
, title =	"Two hierarchical linear feature representations: edge pyramids and edge quadtrees"
, journal =	"Comput. Graph. Image Process."
, volume =	17
, year =	1981
, pages =	"211--224"
}

@inproceedings{s-updlt-79
, author =	"M. Shneier"
, title =	"Using pyramids to define local thresholds for blob detection"
, booktitle =	"Proc. DARPA Image Understanding Workshop"
, year =	1979
, pages =	"31--35"
}

@incollection{s-arc-94
, author =	"Ken Shoemake"
, title =	"Arcball Rotation Control"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"175--192"
, keywords =	"interaction, quaternion"
, update =	"94.09 heckbert"
, annote =	"Asks the question: how does one control the three degrees
of freedom of rotation in 3D, using a 2D input device such as a mouse?
Shoemake's answer: use a pair of points to designate a relative rotation,
and use quaternions to make the rotation axis specification intuitive and
consistent. Contains C code."
}

@incollection{s-eac-94
, author =	"Ken Shoemake"
, title =	"Euler Angle Conversion"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"222--229"
, keywords =	"quaternion, rotation"
, update =	"94.09 heckbert"
, annote =	"Gives code to convert a rotation expressed by one triple
of axes into another triple. Rotations in 3D are often described in terms of
Euler angles: rotations about x, y, and z in some order. The order of
rotations is significant, but not standardized. These routines are useful
for doing such conversions. Contains C code."
}

@incollection{s-fbtr-94
, author =	"Ken Shoemake"
, title =	"Fiber Bundle Twist Reduction"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"230--236"
, keywords =	"animation, camera control, quaternion, topology, rotation"
, update =	"94.09 heckbert"
, annote =	"Applies some advanced concepts from topology to the
problem of minimizing twist (rotation about the z axis of screen space) in
animation."
}

@incollection{s-pmd-94
, author =	"Ken Shoemake"
, title =	"Polar Matrix Decomposition"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"207--221"
, keywords =	"quaternion, spectral decomposition, singular value decomposition"
, update =	"94.09 heckbert"
, annote =	"Describes a method for decomposing an affine 3D
transformation into translation, scaling, and rotation transformations in a
physically meaningful way. This can be useful for keyframe animation.
Contains C code."
}

@incollection{s-urr-92
, author =	"K. Shoemake"
, title =	"Uniform random rotations"
, editor =	"D. Kirk"
, booktitle =	"Graphics Gems III"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1992
, pages =	"124--132"
, update =	"97.07 orourke"
}

@article{sbk-mdusd-92
, author =	"B. K. Shoichet and D. L. Bodian and I. D. Kuntz"
, title =	"Molecular docking using shape descriptors"
, journal =	"J. Computational Chemistry"
, volume =	13
, year =	1992
, pages =	"380--397"
, update =	"97.07 agarwal"
}

@unpublished{s-grsds-90
, author =	"P. Shor"
, title =	"Geometric realization of superlinear {Davenport--Schinzel} sequences: I. {L}ine segments"
, year =	1990
, note =	"Unpublished manuscript"
, update =	"95.09 agarwal"
}

@phdthesis{s-rpmbp-85
, author =	"P. W. Shor"
, title =	"Random planar matching and bin packing"
, school =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@incollection{s-spinh-91
, author =	"P. W. Shor"
, title =	"Stretchability of Pseudolines is {NP}-Hard"
, editor =	"P. Gritzman and B. Sturmfels"
, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
, volume =	4
, publisher =	"AMS Press"
, year =	1991
, pages =	"531--554"
, keywords =	"pseudolines, stretchability, NP-hard, isotopy conjecture"
, comments =	"includes description of Mn{\"e}v's proof that any semialgebraic set is homotopy-equivalent to the realization space of some configuration of pseudolines"
, update =	"98.07 agarwal, 93.09 erickson"
}

@article{ss-fopgm-97
, author =	"P. W. Shor and N. J. A. Sloane"
, title =	"A family of optimal packings in {Grassmannian} manifolds"
, journal =	"J. Algebraic Combin."
, volume =	"??"
, year =	1997
, note =	"To appear."
, update =	"97.07 orourke"
}

@inproceedings{sv-ddsoc-89
, author =	"P. W. Shor and C. J. {Van Wyk}"
, title =	"Detecting and decomposing self-overlapping curves"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"44--50"
, precedes =	"sv-ddsoc-92"
, cites =	"a-ca-66, ce-oails-88, fpp-sssfe-88, ll-gdtpg-86, ns-issip-80, rt-rplbo-86, w-rccp-37, ZZZ"
, update =	"98.03 bibrelex"
}

@article{sv-ddsoc-92
, author =	"P. W. Shor and C. J. {Van Wyk}"
, title =	"Detecting and decomposing self-overlapping curves"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	1
, year =	1992
, pages =	"31--50"
, keywords =	"computational topology, constrained Delaunay triangulation, dynamic programming, immersions"
, succeeds =	"sv-ddsoc-89"
}

@inproceedings{s-osdsd-97
, author =	"A. Shoshani"
, title =	"{OLAP} and Statistical databases: {S}imilarities and differences"
, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
, year =	1997
, pages =	"185--196"
, update =	"97.07 agarwal"
}

@article{sl-qcia-87
, author =	"L. Shu-Xiang and M. H. Loew"
, title =	"The quad-codes and its applications"
, journal =	"Commun. ACM"
, volume =	30
, year =	1987
, pages =	"621--625"
, update =	"98.07 bibrelex"
}

@inproceedings{s-rgrsm-90
, author =	"G. M. Shute"
, title =	"A reduced grid for rectilinear {Steiner} minimal trees"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"309--314"
, precedes =	"s-rgrsm-91"
, cites =	"b-tprrs-86, ce-lsdst-86, gj-rstpi-77, h-sprd-66, h-smtrd-76, tds-crsmt-87, w-ndsor-85, yw-ossaw-72, ZZZ"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@techreport{s-rgrsm-91
, author =	"G. M. Shute"
, title =	"A reduced grid for rectilinear {Steiner} minimal trees"
, type =	"Technical Report"
, institution =	"Comput. Sci. Dept., Univ. of Minnesota"
, year =	1991
, succeeds =	"s-rgrsm-90"
, update =	"98.11 bibrelex"
}

@article{sdt-opsal-91
, author =	"G. M. Shute and L. L. Deneen and C. D. Thomborson"
, title =	"An {$O(n \log n)$} plane-sweep algorithm for {$L_{1}$} and {$L_{\infty}$} {Delaunay} triangulations"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"207--221"
}

@incollection{s-bdnni-81
, author =	"R. Sibson"
, title =	"A Brief Description of Natural Neighbour Interpolation"
, editor =	"Vic Barnet"
, booktitle =	"Interpreting Multivariate Data"
, publisher =	"John Wiley \& Sons"
, address =	"Chichester"
, year =	1981
, pages =	"21--36"
, update =	"99.11 bibrelex"
, annote =	"Weights for an interpolant at a point $p$ can be found
		 by considering what fraction of the area of $VP(p)$ is
		 taken from the $VP$ for $p_1,p_2,\dots,p_n$."
}

@article{s-vidt-80
, author =	"R. Sibson"
, title =	"A vector identity for the {Dirichlet} tesselation"
, journal =	"Math. Proc. Camb. Phil. Soc."
, volume =	87
, year =	1980
, pages =	"151--155"
, update =	"98.07 rote"
, abstract =	"Take away a site $p$ from a Voronoi diagram, and for every
                 other site $q$, let $w_q$ be the fraction of $p$'s cell that
                 is taken by the cell of $q$. Then $p$ is the weighted average
                 (centroid) of the other sites $q$ with weights $w_q$.
                 This property is used in~\cite{s-bdnni-81}.
                 It holds in any dimension, and also for power diagrams
                 (defined in the paper as intersections of higher-dimensional
                 Voronoi diagrams with subspaces)."
}

@article{s-let-78
, author =	"R. Sibson"
, title =	"Locally equiangular triangulations"
, journal =	"Comput. J."
, volume =	21
, number =	3
, year =	1978
, pages =	"243--245"
, keywords =	"point-set triangulation"
, update =	"98.11 bibrelex"
, annote =	"``Lawson has given a criterion of local equiangularity
		 of the convex hull of a finite set of distinct points
		 in the plane. In this note it is shown that (with
		 suitable modifications to deal with degeneracy) there
		 is only one such triangulation, and that it is the
		 Delaunay triangulation.''"
}

@article{s-dtada-80
, author =	"R. Sibson"
, title =	"The {Dirichlet} tesselation as an aid in data analysis"
, journal =	"Scand. J. Statist."
, volume =	7
, year =	1980
, pages =	"14--20"
}

@article{sd-sggrr-88
, author =	"A. Siegel and D. Dolev"
, title =	"Some geometry for general river routing"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"583--605"
}

@article{s-rrurm-82
, author =	"A. F. Siegel"
, title =	"Robust Regression Using Repeated Medians"
, journal =	"Biometrika"
, volume =	69
, year =	1982
, pages =	"242--244"
, update =	"98.07 bibrelex"
}

@book{sh-trht-92
, author =	"R. Siegel and J. R. Howell"
, title =	"Thermal Radiation Heat Transfer"
, edition =	"3rd"
, publisher =	"Hemisphere Pu. Co."
, address =	"Washington"
, year =	1992
, update =	"98.03 bibrelex"
}

@article{s-ecsas-85
, author =	"G. Sierksma"
, title =	"Extending a convexity space to an aligned space"
, journal =	"Indagationes Mathematicae"
, volume =	46
, year =	1985
, pages =	"429--435"
, update =	"98.07 bibrelex"
}

@inproceedings{ss-nempa-86
, author =	"S. Sifrony and Micha Sharir"
, title =	"A new efficient motion-planning algorithm for a rod in polygonal space"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"178--186"
, precedes =	"ss-nempa-87"
, cites =	"bo-arcgi-79, cd-vdbcd-85, f-fapct-85, ks-empac-90, ls-esmpa-85, ls-pptmc-87, ls-ncfcc-87, m-gtd23-77, o-lbml-85, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, r-cmpg-79, ss-pmp2g-83, ss-pmp3c-83, ss-empae-85, ss-pmp5c-84, sa-pmp4v-84, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@article{ss-nempa-87
, author =	"S. Sifrony and Micha Sharir"
, title =	"A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"367--402"
, keywords =	"motion planning"
, succeeds =	"ss-nempa-86"
, update =	"98.03 mitchell"
}

@manual{s-iipg-92
, author =	"SiliconGraphics"
, title =	"Iris Inventor Programming Guide"
, year =	1992
, update =	"98.11 bibrelex"
}

@article{s-escae-79
, author =	"C. B. {Silio, Jr.}"
, title =	"An efficient simplex coverability algorithm in {$E^{2}$} with applications to stochastic sequential machines"
, journal =	"IEEE Trans. Comput."
, volume =	"C-28"
, year =	1979
, pages =	"109--120"
}

@article{s--90
, author =	"E. Silla"
, title =	"??"
, journal =	"J. Mol. Graphics"
, volume =	8
, month =	sep
, year =	1990
, pages =	"168--172"
, update =	"98.03 bibrelex"
}

@article{sp-gtpmi-89
, author =	"F. Sillion and C. Puech"
, title =	"A general two-pass method integrating specular and diffuse reflection"
, journal =	"Comput. Graph."
, volume =	23
, number =	3
, year =	1989
, pages =	"335--344"
, note =	"Proc. SIGGRAPH '89"
, update =	"98.03 bibrelex"
}

@book{sp-rgi-94
, author =	"F. Sillion and C. Puech"
, title =	"Radiosity Global Illumination"
, publisher =	"Morgan Kauffmann"
, year =	1994
, update =	"96.05 pocchiola"
}

@article{sgg-rrde-90
, author =	"F. X. Sillion and D. D. George and D. P. Greenberg"
, title =	"Radiosity redistribution for dynamic environments"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	10
, number =	4
, month =	jul
, year =	1990
, pages =	"26--34"
, update =	"97.11 bibrelex"
}

@article{sd-fbcve-95
, author =	"S. X. Sillion and G. Drettakis"
, title =	"Feature-based control of visibility error: {A} multi-resolution clustering algorithm for global illumination"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1995
, note =	"Proc. SIGGRAPH '95"
, update =	"98.07 bibrelex"
}

@inproceedings{smk-agtin-95
, author =	"C. Silva and Joseph S. B. Mitchell and A. E. Kaufman"
, title =	"Automatic generation of triangular irregular networks using greedy cuts"
, booktitle =	"Visualization 95"
, publisher =	"IEEE Computer Society Press"
, address =	"San Jose CA"
, year =	1995
, pages =	"201--208"
, update =	"98.03 mitchell, 96.01 mitchell"
}

@techreport{s-adfbr-81
, author =	"C. E. Silva"
, title =	"Alternative definitions of faces in boundary representations of solid objects"
, type =	"Report"
, number =	"TM-36"
, institution =	"College Engrg. Appl. Sci., Univ. Rochester"
, address =	"Rochester, NY"
, year =	1981
}

@inproceedings{sm-gcaft-98
, author =	"Cl\'{a}udio T. Silva and Joseph S. B. Mitchell"
, title =	"Greedy Cuts: {An} Advancing Front Terrain Triangulation Algorithm"
, booktitle =	"Proc. 6th ACM Workshop on Advances in GIS"
, year =	1998
, pages =	"to appear"
, update =	"98.07 mitchell"
}

@article{sm-lsrca-97
, author =	"C. T. Silva and Joseph S. B. Mitchell"
, title =	"The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	3
, number =	2
, month =	apr
, year =	1997
, pages =	"142--157"
, keywords =	"plane sweep, space sweep, ray shooting, volume visualization, graphics"
, succeeds =	"smk-frig-96"
, update =	"98.03 mitchell, 97.07 held"
, annote =	"special issue devoted to selected papers from Volume Visualization'96"
}

@inproceedings{smk-frig-96
, author =	"C. T. Silva and Joseph S. B. Mitchell and A. E. Kaufman"
, title =	"Fast Rendering of Irregular Grids"
, booktitle =	"Proc. 1996 Symposium on Volume Visualization"
, publisher =	"ACM SIGGRAPH"
, address =	"San Francisco"
, month =	oct
, year =	1996
, pages =	"15--22; 97 (color plate)"
, keywords =	"plane sweep, space sweep, ray shooting, volume visualization, graphics"
, precedes =	"sm-lsrca-97"
, update =	"00.11 smid, 00.07 icking, 98.03 mitchell"
}

@article{s-acars-79
, author =	"Y. V. {Silva Filho}"
, title =	"Average case analysis of region search in balanced $k$-d trees"
, journal =	"Inform. Process. Lett."
, volume =	8
, year =	1979
, pages =	"219--223"
}

@techreport{s-mstif-78
, author =	"Y. V. {Silva Filho}"
, title =	"Multidimensional search trees as indices of files"
, type =	"Report"
, number =	"??"
, institution =	"Univ. Kent"
, address =	"Canterbury, England"
, year =	1978
}

@article{s-ocdbk-81
, author =	"Y. V. {Silva Filho}"
, title =	"Optimal choice of discriminators in a balanced $k$-d binary search tree"
, journal =	"Inform. Process. Lett."
, volume =	13
, year =	1981
, pages =	"67--70"
}

@phdthesis{s-ggna-88
, author =	"D. Silver"
, title =	"Geometry, Graphics \& Numerical Analysis"
, school =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	1988
, note =	"In preparation"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@phdthesis{s-mpspp-86
, author =	"E. B. Silverberg"
, title =	"Motion planning and shortest paths in the plane"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Oper. Res., Stanford Univ."
, address =	"Stanford, CA"
, year =	1986
, keywords =	"motion planning, path planning, geodesic distance, shortest paths"
}

@techreport{s-sppbt-85
, author =	"E. B. Silverberg"
, title =	"Shortest Paths for Polygonal Bodies in Two Dimensions"
, type =	"Manuscript"
, institution =	"Dept. of Operations Research, Stanford University"
, year =	1985
, update =	"93.09 milone+mitchell"
}

@article{st-mce-80
, author =	"B. W. Silverman and D. M. Titterington"
, title =	"Minimum covering ellipses"
, journal =	"SIAM J. Sci. Statist. Comput."
, volume =	1
, year =	1980
, pages =	"401--409"
}

@book{s-ansfp-90
, author =	"P. K. Simpson"
, title =	"Artificial Neural Systems: Foundations, Paradigms, Applications, and Implementations"
, publisher =	"Pergamon Press"
, year =	1990
, update =	"98.07 bibrelex"
}

@incollection{s-cmspg-70
, author =	"C. Sims"
, title =	"Computational Methods in the Study of Permutation Groups"
, editor =	"J. Leech"
, booktitle =	"Computational Problems in Abstract Algebra"
, publisher =	"Pergamon Press"
, year =	1970
, update =	"97.11 bibrelex"
}

@article{s-evc-94
, author =	"K. Sims"
, title =	"Evolving virtual creatures"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1994
, pages =	"15--22"
, note =	"Proc. SIGGRAPH '94"
, update =	"97.11 bibrelex"
}

@article{s-parud-90
, author =	"K. Sims"
, title =	"Particle animation and rendering using data parallel computation"
, journal =	"Comput. Graph."
, volume =	24
, number =	4
, year =	1990
, pages =	"405--413"
, update =	"98.07 bibrelex"
}

@book{s-gpf-97
, author =	"David Singer"
, title =	"Geometry: Plane and Fancy"
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1997
, comments =	"Describes Zaremba's proof, sz-clccp-67"
, update =	"00.11 smid, 00.07 orourke"
}

@article{s-tfpgs-38
, author =	"J. Singer"
, title =	"A theorem in finite projective geometry and some applications to number theory"
, journal =	"Trans. Amer. Math. Soc."
, volume =	43
, year =	1938
, note =	"377--385"
, update =	"98.03 bibrelex"
}

@techreport{s-dpg-91
, author =	"S. Singh"
, title =	"Documentation for {Paren-to-GDS}"
, type =	"Manuscript"
, institution =	"Dept. of Comp. Sci., Brown University"
, year =	1991
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@inproceedings{skw-etgps-85
, author =	"P. Sinha and E. Klassen and K. K. Wang"
, title =	"Exploiting topological and geometric properties for selective subdivision"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"39--45"
, cites =	"b-cbs-72, clr-dbsst-80, lr-tdcgd-80, mk-impgo-84, p-afilb-84, gp-dt-74, l-padps-76, v-ssidq-, -rpmv4-82, -t1-78, gl-mc-83, k-smrra-, c-sacdc-74, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{sc-aipta-86
, author =	"J. K. Sircar and J. A. Cerbrian"
, title =	"Application of image processing techniques to the automated labelling of raster digitized contours"
, booktitle =	"Proc. 2nd Internat. Sympos. Spatial Data Handling"
, year =	1986
, pages =	"171--184"
, update =	"98.07 bibrelex"
}

@article{sc-rss-91
, author =	"A. Sirjani and G. Cross"
, title =	"On representation of a shape's skeleton"
, journal =	"Pattern Recogn. Lett."
, volume =	12
, year =	1991
, pages =	"149--154"
, update =	"93.09 milone+mitchell"
}

@inproceedings{sw-tcica-95
, author =	"A. Prasad Sistla and Ouri Wolfson"
, title =	"Temporal Conditions and Integrity Constraints in Active Database Systems"
, booktitle =	"Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data"
, year =	1995
, pages =	"269--280"
, update =	"00.03 agarwal"
}

@inproceedings{swcd-mqmo-97
, author =	"A. P. Sistla and O. Wolfson and S. Chamberlain and S. Dao"
, title =	"Modeling and querying moving objects"
, booktitle =	"Proc. Intl Conf. Data Engineering"
, year =	1997
, pages =	"422--432"
, update =	"00.03 agarwal"
}

@misc{sr-pps-97
, author =	"Valeriu Sitaru and Tony Ruso"
, title =	"Polygonizations of Point Sets"
, howpublished =	"McGill University, School of Computer Science, http://www.CS.McGill.CA/$\sim$ktulu/507/"
, year =	1997
, url =	"http://www.CS.McGill.CA/~ktulu/507/"
, update =	"00.03 bibrelex"
}

@inproceedings{ss-acqsm-92
, author =	"R. Sivan and H. Samet"
, title =	"Algorithms for constructing quadtree surface maps"
, booktitle =	"Proceedings of the fifth international symposium on spatial data handling"
, site =	"Charleston, South Carolina"
, volume =	1
, month =	aug
, year =	1992
, pages =	"361--370"
, update =	"96.05 efrat"
}

@inproceedings{sem-vainn-86
, author =	"M. Sivilotti and M. Emerling and C. Mead"
, title =	"VLSI architectures for implementation of neural networks"
, editor =	"J. Denker"
, booktitle =	"Proc. AIP Conference: Neural Networks for Computing"
, site =	"New York, NY"
, volume =	151
, organization =	"American Institute of Physics"
, year =	1986
, pages =	"408--413"
, update =	"98.07 bibrelex"
}

@inproceedings{s-dg-89
, author =	"H.-W. Six"
, title =	"{Durchschnittsanalyse} von {Gitterdatenstrukturen}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@article{sw-cridr-82
, author =	"H.-W. Six and D. Wood"
, title =	"Counting and reporting intersections of {$D$}-ranges"
, journal =	"IEEE Trans. Comput."
, volume =	"C-31"
, year =	1982
, pages =	"181--187"
}

@article{sw-ripr-80
, author =	"H.-W. Six and D. Wood"
, title =	"The rectangle intersection problem revisited"
, journal =	"BIT"
, volume =	20
, year =	1980
, pages =	"426--433"
}

@inproceedings{skt-rogd-98
, author =	"J. M. Six and K. G. Kakoulis and I. G. Tollis"
, title =	"Refinement of Orthogonal Graph Drawings"
, editor =	"S. H. Whitesides"
, booktitle =	"Graph Drawing (Proc. GD~'98)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1547
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"302--315"
, update =	"99.07 vismara, 99.03 vismara"
}

@article{s-ealcc-96
, author =	"V. Skala"
, title =	"An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in $E^3$"
, journal =	"Comput. Graph. Forum"
, volume =	15
, number =	1
, month =	mar
, year =	1996
, pages =	"61--68"
, update =	"96.05 held"
}

@inproceedings{s-olcae-94
, author =	"Vaclav Skala"
, title =	"$O(\log n)$ line clipping algorithm in $E^2$"
, booktitle =	"Winter School of Computer Graphics and CAD Systems 94"
, publisher =	"University of West Bohemia"
, address =	"Pilsel, Czech Republic"
, month =	jan
, year =	1994
, pages =	"174--191"
, comments =	"line in convex polygon clipping"
, update =	"95.05 korneenko"
}

@article{s-ckpps-90
, author =	"S. Skiena"
, title =	"Counting {$k$}-projections of a point set"
, journal =	"J. Combin. Theory Ser. A"
, volume =	55
, year =	1990
, pages =	"153--160"
, update =	"98.11 bibrelex"
}

@phdthesis{s-gp-88
, author =	"Steven S. Skiena"
, title =	"Geometric probing"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1988
, keywords =	"probing, doctoral thesis"
, update =	"98.03 mitchell"
}

@incollection{s-grp-97
, author =	"Steven S. Skiena"
, title =	"Geometric reconstruction problems"
, chapter =	26
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"481--490"
, update =	"98.03 mitchell, 97.11 orourke"
}

@article{s-irgp-92
, author =	"Steven S. Skiena"
, title =	"Interactive Reconstruction via Geometric Probing"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1364--1383"
, update =	"98.03 mitchell, 93.09 held"
}

@article{s-pcphp-91
, author =	"Steven S. Skiena"
, title =	"Probing convex polygons with half-planes"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"359--374"
, update =	"98.03 mitchell"
}

@article{s-pgp-89
, author =	"Steven S. Skiena"
, title =	"Problems in geometric probing"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"599--605"
, keywords =	"survey paper, problem collection"
, update =	"98.03 mitchell"
}

@article{s-rgcss-89
, author =	"Steven S. Skiena"
, title =	"Reconstructing graphs from cut-set sizes"
, journal =	"Inform. Process. Lett."
, volume =	32
, number =	3
, year =	1989
, pages =	"123--7"
, update =	"98.03 mitchell"
}

@book{s-adm-98
, author =	"S. S. Skiena"
, title =	"The Algorithm Design Manual"
, publisher =	"Telos/Springer-Verlag"
, address =	"New York"
, year =	1998
, update =	"98.07 orourke"
}

@inproceedings{ssl-rsid-90
, author =	"Steven S. Skiena and W. D. Smith and P. Lemke"
, title =	"Reconstructing sets from interpoint distances"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"332--339"
, cites =	"b-nccp-49, b-ctp-77, b-hs1-61, b-hs2-64, dk-ebsrs-88, e-sdnp-46, gj-cigtn-79, gs-tde-74, l-fpq-87, lw-ciaff-88, lll-fprc-82, m-ltn-76, p-ncbmp-76, p-dmdci-35, p-axrac-44, p-sledd-39, rpib-cppcs1-80, rpib-cppcs2-80, r-drmrc-88, rs-shs-82, s-ewgks-79, s-pcg-77, s-pcouc-71, s-adwag-49, s-idssd-78, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{s-fchsp-82
, author =	"J. Sklansky"
, title =	"Finding the convex hull of a simple polygon"
, journal =	"Pattern Recogn. Lett."
, volume =	1
, year =	1982
, pages =	"79--83"
}

@article{s-mcrm-72
, author =	"J. Sklansky"
, title =	"Measuring concavity on rectangular mosaic"
, journal =	"IEEE Trans. Comput."
, volume =	"C-21"
, year =	1972
, pages =	"1355--1364"
}

@article{s-fcc-75
, author =	"J. Sklansky"
, title =	"On filling cellular concavities"
, journal =	"Comput. Graph. Image Process."
, volume =	4
, year =	1975
, pages =	"236--247"
}

@article{s-rcb-70
, author =	"J. Sklansky"
, title =	"Recognition of convex blobs"
, journal =	"Pattern Recogn."
, volume =	2
, year =	1970
, pages =	"3--10"
}

@article{sch-mppds-72
, author =	"J. Sklansky and R. L. Chazin and B. J. Hansen"
, title =	"Minimum perimeter polygons of digitized silhouettes"
, journal =	"IEEE Trans. Comput."
, volume =	"C-21"
, year =	1972
, pages =	"260--268"
}

@article{scl-pdccb-76
, author =	"J. Sklansky and L. P. Cordella and S. Levialdi"
, title =	"Parallel detection of concavities in cellular blobs"
, journal =	"IEEE Trans. Comput."
, volume =	"C-25"
, year =	1976
, pages =	"187--196"
}

@article{sg-fpadc-80
, author =	"J. Sklansky and V. Gonzalez"
, title =	"Fast polygonal approximation of digitized curves"
, journal =	"Pattern Recogn."
, volume =	12
, year =	1980
, pages =	"327--331"
}

@article{s-sacse-91
, author =	"S. Skyum"
, title =	"A simple algorithm for computing the smallest enclosing circle"
, journal =	"Inform. Process. Lett."
, volume =	37
, year =	1991
, pages =	"121--125"
, keywords =	"computational geometry, Voronoi diagrams, convex polygons"
, abstract =	"Presented is a simple $O(n \log n)$ algorithm for
		 computing the smallest enclosing circle of a convex
		 polygon. It can be easily extended to algorithms that
		 compute the farthest- and the closest-point Voronoi
		 diagram of a convex polygon within the same time bound.
		 (Author abstract) 4 Refs."
}

@techreport{s-sagdt-91
, author =	"S. Skyum"
, title =	"A sweepline algorithm for generalized {Delaunay} triangulations"
, number =	"DAIMI PB-373"
, institution =	"CS Dept., Aarhus University"
, year =	1991
, update =	"00.03 bibrelex"
}

@inproceedings{s-sagdt-92
, author =	"Sven Skyum"
, title =	"A Sweepline Algorithm for Generalized {Delaunay} Triangulations and a Simple Method for Nearest-Neighbour Search"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"41--43"
, update =	"00.03 bibrelex"
}

@inproceedings{sd-udfft-80
, author =	"J. R. Slagle and J. K. Dixon"
, title =	"Using descriptions to find figures that approximate the given points"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
, year =	1980
, pages =	"1049--1054"
}

@article{sb-2dlpc-94
, author =	"M. Slater and B. A. Barsky"
, title =	"2D Line and Polygon Clipping Based on Space Subdivision"
, journal =	"Visual Comput."
, volume =	10
, number =	7
, year =	1994
, pages =	"407--422"
, update =	"96.01 held"
}

@article{s-2toap-80
, author =	"D. D. Sleator"
, title =	"A $2.5$ times optimal algorithm for packing in two dimensions"
, journal =	"Inform. Process. Lett."
, volume =	10
, year =	1980
, pages =	"37--40"
}

@phdthesis{s-oamnf-80
, author =	"D. D. Sleator"
, title =	"An {$0(nm\log n)$} algorithm for maximum network flow"
, school =	"Stanford University"
, year =	1980
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@article{st-dsdt-83
, author =	"D. D. Sleator and R. E. Tarjan"
, title =	"A Data Structure for Dynamic Trees"
, journal =	"J. Comput. Syst. Sci."
, volume =	26
, number =	3
, year =	1983
, pages =	"362--381"
, keywords =	"data structure, tree"
, update =	"95.09 tamassia"
}

@article{st-aelup-85
, author =	"D. D. Sleator and R. E. Tarjan"
, title =	"Amortized efficiency of list update and paging rules"
, journal =	"Commun. ACM"
, volume =	28
, year =	1985
, pages =	"202--208"
, update =	"97.03 icking"
}

@article{st-sabst-85
, author =	"D. D. Sleator and R. E. Tarjan"
, title =	"Self-Adjusting Binary Search Trees"
, journal =	"J. ACM"
, volume =	32
, number =	3
, year =	1985
, pages =	"652--686"
, keywords =	"data structure, search tree"
, update =	"95.09 tamassia"
}

@article{st-sah-86
, author =	"D. D. Sleator and R. E. Tarjan"
, title =	"Self-adjusting heaps"
, journal =	"SIAM J. Comput."
, volume =	15
, number =	1
, month =	feb
, year =	1986
, pages =	"52--69"
, update =	"98.07 bibrelex"
}

@inproceedings{stt-rdthg-86
, author =	"D. D. Sleator and R. E. Tarjan and W. P. Thurston"
, title =	"Rotation distance, triangulations, and hyperbolic geometry"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"122--135"
, precedes =	"stt-rdthg-88"
}

@article{stt-rdthg-88
, author =	"D. D. Sleator and R. E. Tarjan and W. P. Thurston"
, title =	"Rotation distance, triangulations, and hyperbolic geometry"
, journal =	"J. Amer. Math. Soc."
, volume =	1
, year =	1988
, pages =	"647--682"
, succeeds =	"stt-rdthg-86"
}

@inproceedings{sh-srsd-81
, author =	"K. R. Sloan and L. M. Hrechanyk"
, title =	"Surface reconstruction from sparse data"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
, year =	1981
, pages =	"45--48"
, update =	"98.03 bibrelex"
}

@inproceedings{sp-cstir-87
, author =	"K. R. Sloan and J. Painter"
, title =	"From contours to surfaces: testbed and initial results"
, booktitle =	"Proc. Graphics Interface '87"
, year =	1987
, pages =	"115--120"
, update =	"98.03 bibrelex"
}

@article{sp-pgmbo-88
, author =	"K. R. Sloan and J. Painter"
, title =	"Pessimal guess may be optimal: {A} counterintuitive search result"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	10
, year =	1988
, pages =	"949--955"
, update =	"98.03 bibrelex"
}

@article{s-facdt-87
, author =	"S. W. Sloan"
, title =	"A fast algorithm for constructing {Delaunay} triangulations in the plane"
, journal =	"Adv. Eng. Softw."
, volume =	9
, number =	1
, month =	jan
, year =	1987
, pages =	"34--55"
, annote =	"Your basic incremental switching algorithm. Points are
		 sorted into bins to increase speed of point location
		 (which walks the triangulation, starting at the
		 previous triangle.)"
, abstract =	"The primary purpose of the paper is to present a
		 FORTRAN 77 code for the efficient triangulation of
		 planar data points as might be required for the mesh
		 generation of a finite element analysis. The author
		 describes in detail the various features of the
		 algorithm and compares them to existing routines. The
		 efficiency of the algorithm is demonstrated for
		 randomly distributed data points where the number of
		 points varies between 100 and 10,000. It is shown that
		 the proposed scheme outperforms existing routines for
		 both large and small data sets. -G. E. Bell, St.
		 Andrews, U"
}

@techreport{s-fagcd-91
, author =	"S. W. Sloan"
, title =	"A Fast Algorithm for Generating Constrained {Delaunay} Triangulations"
, type =	"Research Report"
, number =	"065.07.1991"
, institution =	"The University of Newcastle Department of Civil Engineering and Surveying"
, address =	"New South Wales"
, year =	1991
, annote =	"First computes DT then constrained edges are inserted
		 one at a time. Flips are done that decrease number of
		 crossings with constraint edges, until no crossings
		 remain. Then Delaunay flips are done. (DT algorithm
		 uses bin ordering to speed point location)"
}

@article{sh-iwac2-84
, author =	"S. W. Sloan and G. T. Houlsby"
, title =	"An Implementation of {Watson's} Algorithm For Computing 2-dimensional {Delaunay} Triangulations"
, journal =	"Adv. Eng. Softw."
, volume =	6
, number =	4
, year =	1984
, pages =	"192--197"
, annote =	"Sigh. Incremental algorithm all triangles whose cc
		 contains new point are deleted. Points are sorted by x
		 coord, so only those triangles whose cc includes
		 current x coord need be included. F77 code included.
		 Does not keep adjacency info for triangles."
}

@inproceedings{s-aeqes-82
, author =	"A. van der Sluis"
, title =	"Asymptotic expansions for quadrature errors over a simplex"
, booktitle =	"Proc. Conf. Numerical Integration"
, site =	"Oberwolfach, West Germany"
, publisher =	"Birkh{\"a}user"
, year =	1982
, pages =	"222--240"
, update =	"98.07 bibrelex"
}

@techreport{sh-gpamg-??
, author =	"M. L. C. Sluiter and D. L. Hansen"
, title =	"A general purpose automatic mesh generator for shell and solid finite elements"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@inproceedings{s-caig-87
, author =	"M. Slusarek"
, title =	"A Coloring Algorithm for Interval Graphs"
, booktitle =	"Proc. 1987 MCFS."
, series =	"Lecture Notes in CS"
, volume =	379
, year =	1987
, pages =	"471--480"
, update =	"98.07 bibrelex"
}

@article{s-ta-87
, author =	"S. Smale"
, title =	"On the topology of algorithms {I}"
, journal =	"J. of Compl."
, volume =	3
, year =	1987
, pages =	"81--89"
, update =	"98.11 bibrelex"
}

@article{s-rcrm-58
, author =	"S. Smale"
, title =	"Regular curves on Riemannian manifolds"
, journal =	"Trans. Amer. Math. Soc."
, volume =	87
, year =	1958
, pages =	"492--512"
, update =	"98.03 bibrelex"
}

@incollection{s-passm-83
, author =	"S. Smale"
, title =	"The problem of the average speed of the simplex method"
, editor =	"A. Bachem and M. Gr{\"o}tschel and B. Korte"
, booktitle =	"Mathematical Programming: the state of the art"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1983
, pages =	"530--539"
}

@inproceedings{sv-vvtcs-92
, author =	"J. C. Smart and V. Vemuri"
, title =	"A-Vu: {A} Visualization Tool for Complex Software Systems"
, booktitle =	"Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
, month =	may
, year =	1992
, pages =	""
, keywords =	"graph drawing"
, update =	"94.05 devillers, 93.09 tamassia"
}

% not in J. ACM in 1981 or any nearby years
@article{sr-nnpir-81
, author =	"A. F. Smeaton and C. J. van Rijsbergen"
, title =	"The nearest neighbour problem in information retrieval"
, journal =	"J. ACM"
, volume =	"??"
, year =	1981
, pages =	"83--87"
}

@article{skt-acc1v-95
, author =	"A. Smellie and S. Kahn and S. Teig"
, title =	"Analysis of conformational coverage: $1$. validation and estimation of coverage"
, journal =	"J. Chem. Inf. Comput. Sci."
, volume =	8
, year =	1995
, pages =	"290--303"
, update =	"98.07 bibrelex"
}

@incollection{sd-ddcps-91
, author =	"A. Smeulders and L. Dorst"
, title =	"Decomposition of discrete curves into piece-wise straight segments in linear time"
, editor =	"Melter and Rosenfeld and Bhattacharya"
, booktitle =	"Vision Geometry"
, series =	"Proc. Amer. Math. Soc."
, volume =	119
, publisher =	"Contemporary Mathematics,"
, year =	1991
, pages =	"169--195"
, update =	"98.11 bibrelex"
}

@techreport{s-wcaso-90
, author =	"M. Smid"
, title =	"A worst-case algorithm for semi-online updates on decomposable problems"
, type =	"Report"
, number =	"A-03/90"
, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1990
, precedes =	"s-asolu-90"
}

@inproceedings{s-asolu-90
, author =	"M. Smid"
, title =	"Algorithms for semi-online updates on decomposable problems"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"347--350"
, succeeds =	"s-wcaso-90"
, cites =	"ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{s-oafkp-93
, author =	"M. Smid"
, title =	"An {$O(n \log n)$} algorithm for finding a $k$-point subset with minimal {$L_{\infty}$}-diameter"
, type =	"Report"
, number =	"MPI-I-93-116"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1993
, update =	"93.09 smid, 93.05 smid"
, annote =	"The analysis of the running time is wrong; the actual running time is very high"
}

@techreport{s-cppcg-95
, author =	"M. Smid"
, title =	"Closest point problems in computational geometry"
, type =	"Report"
, number =	"MPI-I-95-1-026"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1995
, keywords =	"survey paper"
, precedes =	"s-cppcg-00"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 smid, 96.01 smid"
}

@incollection{s-cppcg-00
, author =	"Michiel Smid"
, title =	"Closest Point Problems in Computational Geometry"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"877--935"
, succeeds =	"s-cppcg-95"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.11 smid, 98.07 mitchell"
, annote =	"Chapter 20 of su-hcg-00"
}

@phdthesis{s-ddsms-89
, author =	"M. Smid"
, title =	"Dynamic data structures on multiple storage media"
, type =	"Ph.{D}. Thesis"
, school =	"Depts. Math. Comput. Sci., Univ. Amsterdam"
, address =	"Amsterdam, Netherlands"
, year =	1989
, keywords =	"doctoral thesis"
}

@techreport{s-drpla-91
, author =	"M. Smid"
, title =	"Dynamic rectangular point location, with an application to the closest pair problem"
, type =	"Report"
, number =	"MPI-I-91-101"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1991
, precedes =	"s-drpla-95"
, update =	"95.05 smid"
}

@article{s-drpla-95
, author =	"M. Smid"
, title =	"Dynamic rectangular point location, with an application to the closest pair problem"
, journal =	"Inform. Comput."
, volume =	116
, year =	1995
, pages =	"1--9"
, succeeds =	"s-drpla-91"
, update =	"95.05 smid"
}

@techreport{s-fkpse-92
, author =	"M. Smid"
, title =	"Finding $k$ points with a smallest enclosing square"
, type =	"Report"
, number =	"MPI-I-92-152"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
}

@techreport{s-lnstd-94
, author =	"M. Smid"
, title =	"Lecture Notes: Selected Topics in Data Structures"
, type =	"Report"
, number =	"MPI-I-94-155"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, keywords =	"skip lists, union-find, range trees, post-office problem, maintaining order in a list"
, update =	"95.01 smid"
}

@techreport{s-mmdpsl-90t
, author =	"M. Smid"
, title =	"Maintaining the minimal distance of a point set in less than linear time"
, type =	"Report"
, number =	"A-06/90"
, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1990
, precedes =	"s-mmdpsl-90i"
}

@inproceedings{s-mmdpsl-90i
, author =	"M. Smid"
, title =	"Maintaining the minimal distance of a point set in less than linear time"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"1--4"
, succeeds =	"s-mmdpsl-90t"
, precedes =	"s-mmdpsl-91a"
, cites =	"agss-ltacv-89, ds-dcmdf-89, m-mdscg-84, v-oaann-86, ZZZ"
, update =	"98.07 bibrelex"
}

@article{s-mmdpsl-91a
, author =	"M. Smid"
, title =	"Maintaining the minimal distance of a point set in less than linear time"
, journal =	"Algorithms Rev."
, volume =	2
, year =	1991
, pages =	"33--44"
, succeeds =	"s-mmdpsl-90i"
}

@techreport{s-mmdpsp-90t
, author =	"M. Smid"
, title =	"Maintaining the minimal distance of a point set in polylogarithmic time"
, type =	"Report"
, number =	"A-13/90"
, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1990
, precedes =	"s-mmdpsp-91i"
}

@inproceedings{s-mmdpsp-91i
, author =	"M. Smid"
, title =	"Maintaining the minimal distance of a point set in polylogarithmic time"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"1--6"
, succeeds =	"s-mmdpsp-90t"
, precedes =	"s-mmdpsp-91t"
}

@article{s-mmdpsp-92a
, author =	"M. Smid"
, title =	"Maintaining the minimal distance of a point set in polylogarithmic time"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"415--431"
, succeeds =	"s-mmdpsp-91t"
}

@techreport{s-mmdpsp-91t
, author =	"M. Smid"
, title =	"Maintaining the minimal distance of a point set in polylogarithmic time (revised version)"
, type =	"Report"
, number =	"MPI-I-91-103"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1991
, succeeds =	"s-mmdpsp-91i"
, precedes =	"s-mmdpsp-92a"
}

@techreport{s-ocaps-96
, author =	"M. Smid"
, title =	"On the circumradius of acute point sets"
, type =	"Report"
, number =	"TR 96-08"
, institution =	"Department of Computer Science, King's College"
, address =	"London, UK"
, year =	1996
, update =	"96.05 smid"
}

@techreport{s-rtsp-91t
, author =	"M. Smid"
, title =	"Range trees with slack parameter"
, type =	"Report"
, number =	"MPI-I-91-102"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1991
, precedes =	"s-rtsp-91a"
}

@article{s-rtsp-91a
, author =	"M. Smid"
, title =	"Range trees with slack parameter"
, journal =	"Algorithms Rev."
, volume =	2
, year =	1991
, pages =	"77--87"
, succeeds =	"s-rtsp-91t"
}

@inproceedings{s-rpldc-91
, author =	"M. Smid"
, title =	"Rectangular point location and the dynamic closest pair problem"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"364--374"
}

@techreport{sj-wrspp-94
, author =	"M. Smid and R. Janardan"
, title =	"On the width and roundness of a set of points in the plane"
, type =	"Report"
, number =	"MPI-I-94-111"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1994
, update =	"95.01 smid"
}

@inproceedings{sj-wrspp-95
, author =	"Michiel Smid and Ravi Janardan"
, title =	"On the Width and Roundness of a Set of Points in the Plane"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"193--198"
, precedes =	"sj-wrspp-99"
, update =	"99.07 smid, 95.09 jones"
}

@article{sj-wrspp-99
, author =	"M. Smid and R. Janardan"
, title =	"On the width and roundness of a set of points in the plane"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, year =	1999
, pages =	"97--108"
, succeeds =	"sj-wrspp-95"
, update =	"99.07 smid"
}

@article{s-dsufp-90
, author =	"M. H. Smid"
, title =	"A data structure for the Union-Find problem having good single-operation complexity"
, journal =	"Algorithms Rev."
, volume =	1
, number =	1
, year =	1990
, pages =	"1--11"
}

@article{so-mrtsm-90
, author =	"M. H. M. Smid and M. H. Overmars"
, title =	"Maintaining range trees in secondary memory, part {II}: lower bounds"
, journal =	"Acta Inform."
, volume =	27
, year =	1990
, pages =	"453--480"
}

@techreport{s-uesi-79
, author =	"D. A. Smith"
, title =	"Using Enhanced Spherical Images"
, number =	"MIT AI Memo 530"
, institution =	"MIT"
, month =	may
, year =	1979
, update =	"97.11 bibrelex"
}

@article{sv-hsiub-89
, author =	"D. J. Smith and M. K. Vamanamurthy"
, title =	"How small is a unit ball?"
, journal =	"Math. Mag."
, volume =	62
, year =	1989
, pages =	"101--107"
, update =	"97.11 bibrelex"
}

@article{s-siec-61
, author =	"H. J. Smith"
, title =	"On systems of indeterminate equations and congruences"
, journal =	"Philos. Trans."
, volume =	151
, year =	1861
, pages =	"293--326"
, update =	"98.03 bibrelex"
}

@article{sg-smtus-82
, author =	"J. M. Smith and M. Gross"
, title =	"Steiner minimal trees and urban service networks"
, journal =	"J. Socio. Econ. Plng."
, volume =	16
, year =	1982
, pages =	"21--38"
, update =	"98.03 bibrelex"
}

@article{sll-ohars-80
, author =	"J. M. Smith and D. T. Lee and J. S. Liebman"
, title =	"An {$O(n \log n)$} algorithm for the rectilinear {Steiner} minimal tree problem"
, journal =	"Engineering Optimization"
, volume =	4
, year =	1980
, pages =	"179--192"
, update =	"98.07 bibrelex"
}

@article{sll-ohasm-81
, author =	"J. M. Smith and D. T. Lee and J. S. Liebman"
, title =	"An {$O(n \log n)$} heuristic algorithm for {Steiner} minimal tree problems on the {Euclidean} metric"
, journal =	"Networks"
, volume =	11
, year =	1981
, pages =	"23--29"
}

@incollection{sw-cgtnd-92
, author =	"J. M. Smith and P. Winter"
, title =	"Computational geometry and topological network design"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"287--385"
, keywords =	"survey paper"
, comments =	"includes morphological classification of basic computational geometry"
, precedes =	"sw-cgtnd-95"
, update =	"98.07 icking, 93.09 erickson"
}

@incollection{sw-cgtnd-95
, author =	"J. M. Smith and P. Winter"
, title =	"Computational Geometry and Topological Network Design"
, editor =	"Ding-Zhu Du and Frank Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"351--451"
, keywords =	"survey paper"
, comments =	"includes morphological classification of basic computational geometry"
, succeeds =	"sw-cgtnd-92"
, update =	"98.07 icking"
}

@article{ssw-pmapr-77
, author =	"K. T. Smith and D. C. Solomon and S. L. Wagner"
, title =	"Practical and mathematical aspects of the problem of reconstructing objects from radiographs"
, journal =	"Bull. Amer. Math. Soc."
, volume =	83
, month =	nov
, year =	1977
, pages =	"1227--1270"
, update =	"98.11 bibrelex"
}

@techreport{spg-flaip-88
, author =	"T. Smith and G. Peng and P. Gahinet"
, title =	"A Family of Local, Asynchronous, Iterative, and Parallel Procedures for Solving the Weighted Region Least Cost Path Problem"
, institution =	"Department of Computer Science, University of California, Santa Barbara"
, year =	1988
}

@inproceedings{sg-epesa-90
, author =	"T. R. Smith and P. Gao"
, title =	"Experimental performance evaluations on spatial access methods"
, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
, site =	"Z{\"u}rich"
, month =	jul
, year =	1990
, pages =	"991--1002"
, update =	"00.11 smid, 00.07 icking, 94.05 franciosa"
}

@techreport{s-ptadi-92
, author =	"W. D. Smith"
, title =	"A polynomial-time algorithm for deciding the inscribability of graphs"
, type =	"Manuscript"
, institution =	"NEC Research Institute"
, address =	"Princeton, NJ"
, year =	1992
, update =	"97.11 bibrelex"
}

@article{s-hfsmt-92
, author =	"W. D. Smith"
, title =	"How to find {Steiner} minimal trees in {Euclidean} $d$-space"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"137--177"
, update =	"98.07 bibrelex"
}

@techreport{s-ptdsi-87
, author =	"W. D. Smith"
, title =	"Polytope triangulations in $d$-space, improving {Hadamard}'s inequality, and maximal volumes of regular polytopes in hyperbolic $d$-space"
, type =	"Report"
, number =	"??"
, institution =	"Program Appl. Comput. Math., Princeton Univ."
, address =	"Princeton, NJ"
, year =	1987
}

@phdthesis{s-scgmm-88
, author =	"W. D. Smith"
, title =	"Studies in computational geometry motivated by mesh generation"
, school =	"Priceton Univ."
, address =	"Princeton, NJ"
, year =	1988
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@article{sms-sbgpp-00
, author =	"S. Smorodinsky and J. S. B. Mitchell and M. Sharir"
, title =	"Sharp Bounds on Geometric Permutations for Pairwise Disjoint Balls in {$\Re^d$}"
, journal =	"Discrete Comput. Geom."
, volume =	23
, year =	2000
, pages =	"247--259"
, update =	"01.04 orourke"
}

@article{s-pcouc-71
, author =	"C. J. Smyth"
, title =	"On the product of the conjugates outside the unit circle of an algebraic integer"
, journal =	"Bull. London Math. Soc."
, volume =	3
, year =	1971
, pages =	"169--175"
, update =	"97.11 bibrelex"
}

@article{s-mcssp-66
, author =	"P. H. A. Sneath"
, title =	"A method for curve seeking from scattered points"
, journal =	"Comput. J."
, volume =	9
, year =	1966
, pages =	"383--391"
}

@inproceedings{s-gbvtd-01
, author =	"Jack Snoeyink"
, title =	"A Geometric Basis for Visualizing Time-Dependent Volume Data"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"13--16"
, update =	"01.04 icking"
}

@inproceedings{s-tkwsd-90
, author =	"J. Snoeyink"
, title =	"A trivial knot whose spanning disks have exponential size"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"139--147"
, cites =	"a-bt-79, cm-grdg-72, cf-ikt-65, f-pc6ck-89, h-tdnei-61, r-kl-76, rs-iplt-72, s-bdpvv-61, ZZZ"
, update =	"98.03 bibrelex"
}

@unpublished{s-edpti-88
, author =	"J. Snoeyink"
, title =	"Etch: A drawing program that illustrates geometric duality"
, year =	1988
, note =	"Unpublished article"
, update =	"98.03 bibrelex"
}

@incollection{s-pl-97
, author =	"J. Snoeyink"
, title =	"Point location"
, chapter =	30
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"559--574"
, cites =	"a-bt-79, cm-grdg-72, cf-ikt-65, f-pc6ck-89, h-tdnei-61, r-kl-76, rs-iplt-72, s-bdpvv-61, ZZZ"
, update =	"97.11 bibrelex+orourke"
}

@article{s-nvapo-91
, author =	"J. Snoeyink"
, title =	"The number of views of axis-parallel objects"
, journal =	"Algorithms Rev."
, volume =	2
, year =	1991
, pages =	"27--32"
}

@inproceedings{s-votcb-93
, author =	"J. Snoeyink"
, title =	"Video: Objects that cannot be taken apart with two hands"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	405
, keywords =	"video review"
, succeeds =	"ss-otcbt-93"
, cites =	"fh-usk-63, n-pa-88, ss-otcbt-93, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@inproceedings{sh-sac-89
, author =	"J. Snoeyink and J. Hershberger"
, title =	"Sweeping arrangements of curves"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"354--363"
, cites =	"ass-sulbl-87, bo-arcgi-79, bgs-op-74, ce-oails-88, cgl-pgd-85, dghs-eafcr-88, e-acg-87, egppss-acptc-88, eg-tsa-86, eos-calha-86, epss-lebfi-87, g-pcbgs-80, gp-pgcsc-80, gp-tpdnd-81, gp-tod-82, gp-sccca-84, gp-httpa-82, gy-frcg-86, g-cp-67, g-ah-71, g-as-72, g-ibs-70, hs-ndssg-86, jk-spals-88, l-dtdpe-26, ms-rcibt-88, mo-al3sd-88, m-vigau-88p, ow-nmcvg-88, p-hresr-84, r-kl-76, sh-gip-76, scklps-gadss-86, ws-prnds-88, ZZZ"
, update =	"98.03 bibrelex"
}

@incollection{sh-sac-91
, author =	"J. Snoeyink and J. Hershberger"
, title =	"Sweeping arrangements of curves"
, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
, publisher =	"American Mathematical Society, Association for Computing Machinery"
, address =	"Providence, RI"
, year =	1991
, pages =	"309--349"
, update =	"99.11 bibrelex, 97.11 bibrelex"
}

@inproceedings{sk-goirc-97
, author =	"J. Snoeyink and M. van Kreveld"
, title =	"Good orders for incremental (re)constructions"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"400--402"
, cites =	"bkos-cgaa-97, be-mgot-92i, cns-l5cap-81, d-gc-95, dl-cvdrp-91, gks-ricdv-92, h-pm-96, k-osps-83, m-cgitr-93, pflm-tin-78, rsst-efcpg-96, s-barga-93, s-mplbc-85, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{sk-ltrdt-97
, author =	"J. Snoeyink and M. van Kreveld"
, title =	"Linear-time reconstruction of {D}elaunay triangulations with applications"
, booktitle =	"Proc. Annu. European Sympos. Algorithms"
, nickname =	"ESA'97"
, series =	"Lecture Notes Comput. Sci."
, number =	1284
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"459--471"
, update =	"98.07 oostrum"
}

@inproceedings{ss-otcbt-93
, author =	"J. Snoeyink and J. Stolfi"
, title =	"Objects that cannot be taken apart with two hands"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"247--256"
, precedes =	"s-votcb-93"
, cites =	"c-pwpd-91, d-rbwdo-84, b-navw-54, b-p11a-55, fh-usk-63, gy-tsr-80, m-camap-91, mss-esmpg-87, n-pa-88, p-gsa-89, p-pplr-90, wm-paimt-92, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{ss-otcbt-94
, author =	"J. Snoeyink and J. Stolfi"
, title =	"Objects that cannot be taken apart with two hands"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"367--384"
, update =	"95.01 smid"
}

@techreport{sz-grmp-93
, author =	"Jack Snoeyink and Chong Zhu"
, title =	"Generating random monotone polygons"
, type =	"Technical Report"
, number =	"93-28"
, institution =	"Dept. of Computer Science, University of British Columbia"
, month =	sep
, year =	1993
, update =	"98.11 bibrelex"
}

@techreport{s-tacg-90
, author =	"J. S. Snoeyink"
, title =	"Topological Approaches in Computational Geometry"
, type =	"Report"
, number =	"STAN-CS-90-1331"
, institution =	"Stanford Univ."
, address =	"Standford, CA"
, year =	1990
, update =	"97.11 bibrelex"
}

@article{swfcb-immcb-93
, author =	"J. M. Snyder and A. R. Woodbury and K. Fleischer and B. Currin and A. H. Barr"
, title =	"Interval methods for multi-point collisions between time-dependent curved surfaces"
, journal =	"Comput. Graph."
, volume =	27
, month =	aug
, year =	1993
, pages =	"321--334"
, note =	"Proc. SIGGRAPH '93"
, update =	"98.03 bibrelex"
}

@article{ss-chrw-93
, author =	"T. Snyder and J. M. Steele"
, title =	"Convex hulls of random walks"
, journal =	"Proc. Amer. Math. Soc."
, volume =	117
, number =	4
, year =	1993
, pages =	"1165--1173"
, update =	"95.01 mitchell"
}

@phdthesis{s-awcls-87
, author =	"T. L. Snyder"
, title =	"Asymptotic worst case lengths in some problems from classical Computational geometry and Combinatorial Optimization"
, school =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	1987
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@unpublished{s-lbrst-89
, author =	"T. L. Snyder"
, title =	"Lower bounds for rectilinear {Steiner} trees in bounded space"
, year =	1989
, note =	"Submitted for publication"
, update =	"97.11 bibrelex"
}

@article{s-lbrst-91
, author =	"T. L. Snyder"
, title =	"Lower bounds for rectilinear {Steiner} trees in bounded space"
, journal =	"Inform. Process. Lett."
, volume =	37
, year =	1991
, pages =	"71--74"
, update =	"98.03 bibrelex"
}

@inproceedings{s-mrsta-90
, author =	"T. L. Snyder"
, title =	"On minimal rectilinear {Steiner} trees in all dimensions"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"311--320"
, cites =	"bhh-sptmp-59, b-tprrs-88, cg-stbps-81, ch-lmrst-79, cr-wim-41, f-splrt-55, fhp-gtadm-79, gj-rstpi-77, ggj-sncgp-76, gp-smt-68, g-qwcet-88, gr-ibtsp-87, h-sprd-66, h-smtrd-76, k-hlcet-87, m-ps-61, m-lotcs-84, sr-lvsta-75, s-scgmm-88, s-awcls-87, s-sfars-89, s-lbrst-89, ss-wcgmu-90, s-sefnl-81, ss-wcgrs-89, srp-tspmm-83, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{s-wcmrs-92
, author =	"T. L. Snyder"
, title =	"Worst-case minimal rectilinear {Steiner} trees in all dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	8
, year =	1992
, pages =	"73--92"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@inproceedings{ss-piets-92
, author =	"T. L. Snyder and J. M. Steele"
, title =	"A priori inequalities for the {Euclidean} traveling salesman"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"344--349"
, cites =	"f-splrt-55, k-hlcet-89, n-ps-82, s-pwcac-90, ss-wcgrs-89, v-sptnp-51, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{ss-epsts-93
, author =	"T. L. Snyder and J. M. Steele"
, title =	"Equidistribution of Point Sets for the Traveling Salesman and Related Problems"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"462--466"
, update =	"93.09 milone+mitchell"
}

@article{ss-wcgmu-90
, author =	"T. L. Snyder and J. M. Steele"
, title =	"Worst-Case greedy matchings in the unit $d$-cube"
, journal =	"Networks"
, volume =	20
, year =	1990
, pages =	"779--800"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@inproceedings{ss-wctps-94
, author =	"T. L. Snyder and J. M. Steele"
, title =	"Worst-Case {TSP} Point Sets in All Dimensions are Asymptotically Equidistributed"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"147--152"
, cites =	"bhh-sptmp-59, f-splrt-55, g-qwcet-88, hlp-i-64, k-hlcet-89, k-pascs-76, s-wcmrs-92, ss-epsts-93, ss-wcgrs-89, srp-tspmm-83, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{st-ccdac-82
, author =	"W. E. Snyder and D. A. Tang"
, title =	"Comments on ``{A} counterexample to a diameter algorithm for convex polygons''"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-4"
, year =	1982
, pages =	309
, succeeds =	"bt-cdacp-82"
}

@article{st-fer-80
, author =	"W. E. Snyder and D. A. Tang"
, title =	"Finding the extrema of a region"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	"PAMI-2"
, year =	1980
, pages =	"266--269"
, keywords =	"diameter, polygons"
, precedes =	"bt-cdacp-82"
}

@techreport{s-aedsd-92
, author =	"J. Soares"
, title =	"Approximating {Euclidean} distances by small degree graphs"
, type =	"Technical {Report}"
, number =	"92-05"
, institution =	"Univ. Chicago"
, year =	1992
, update =	"97.11 bibrelex"
}

@article{s-aedsd-94
, author =	"J. Soares"
, title =	"Approximating {Euclidean} distances by small degree graphs"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"213--233"
, update =	"94.05 smid"
}

@phdthesis{s-gs-92
, author =	"J. Soares"
, title =	"Graph Spanners"
, school =	"Univ. Chicago"
, address =	"Chicago, IL"
, year =	1992
, note =	"Report CS 92-14"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{s-gss-92
, author =	"J. Soares"
, title =	"Graph spanners: a survey"
, journal =	"Congr. Numer."
, volume =	89
, year =	1992
, pages =	"225--238"
, update =	"98.03 smid"
}

@unpublished{s-s-91
, author =	"J. Soares"
, title =	"Spanners"
, year =	1991
, note =	"Unpublished Manuscript"
, update =	"97.11 bibrelex"
}

@book{s-hb-70
, author =	"H. A. Sober"
, title =	"Handbook of Biochemistry"
, edition =	"2nd"
, publisher =	"The Chemical Rubber Co."
, year =	1970
, update =	"98.03 bibrelex"
}

@article{s-ebrtd-89
, author =	"C. Sobhanpanah"
, title =	"Extension of a boundary representation technique for the description of $n$-dimensional polytopes"
, journal =	"Comput. Graph."
, volume =	13
, number =	1
, year =	1989
, pages =	"17--23"
, update =	"98.07 bibrelex"
}

@article{sb-ic3dm-91
, author =	"W. Sohrt and B. D. Br{\"u}derlin"
, title =	"Interaction with constraints in {3D} modeling"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	4
, year =	1991
, pages =	"405--425"
, keywords =	"geometric constraints, graphical interactive modeling, CAD/CAM"
}

@article{s-cach-83
, author =	"E. Soisalon-Soininen"
, title =	"On computing approximate convex hulls"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, pages =	"121--126"
, keywords =	"designing algorithms, convex hull, two-dimensional, approximation"
}

@inproceedings{sw-oatsd-82
, author =	"E. Soisalon-Soininen and D. Wood"
, title =	"An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems"
, booktitle =	"Proc. ACM SIGACT-SIGMOD Conf. Principles Database Systems"
, year =	1982
, pages =	"108--116"
}

@article{sw-oaccs-84
, author =	"E. Soisalon-Soininen and D. Wood"
, title =	"Optimal algorithms to compute the closure of a set of iso-rectangles"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"199--214"
}

@inproceedings{s-tseaj-97
, author =	"Eduard Sojka"
, title =	"Three Simple and Efficient Algorithms for {Jordan} Sorting"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"24--26"
, cites =	"fntv-sltjs-90, hmrt-sjslt-86, ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@book{ss-pnt-63
, author =	"R. R. Sokal and P. H. Sneath"
, title =	"Principles of Numerical Taxonomy"
, publisher =	"W. H. Freeman"
, address =	"San Francisco, CA"
, year =	1963
, update =	"98.03 bibrelex"
}

@inproceedings{sg-mdrpa-92
, author =	"V. Soltan and A. Gorpinevich"
, title =	"Minimum dissection of rectilinear polygon with arbitrary holes into rectangles"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"296--302"
, keywords =	"polygons, decomposition, rectangles, isothetic"
, precedes =	"sg-mdrpa-93"
, cites =	"l-fmprp-83, l-ompa-84, ia-eaggs-86, l-pnrh-82, ZZZ"
, update =	"97.11 bibrelex, 95.09 korneenko, 93.09 rote"
}

@article{sg-mdrpa-93
, author =	"V. Soltan and A. Gorpinevich"
, title =	"Minimum dissection of rectilinear polygon with arbitrary holes into rectangles"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"57--79"
, keywords =	"polygons, decomposition, rectangles, isothetic"
, succeeds =	"sg-mdrpa-92"
, cites =	"l-pnrh-82"
, update =	"95.09 korneenko, 93.09 rote"
}

@phdthesis{s-cpfrt-88
, author =	"J. Solymosi"
, title =	"Combinatorial problems in finite {Ramsey} theory"
, type =	"Master's Thesis"
, school =	"E{\"{o}}tv{\"{o}}s University"
, address =	"Budapest"
, year =	1988
, keywords =	"doctoral thesis"
, update =	"02.03 devillers"
}

@article{st-ddp-01
, author =	"J. Solymosi and Cs. D. T\'{o}th"
, title =	"Distinct distances in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	25
, number =	4
, year =	2001
, pages =	"629--634"
, update =	"02.03 orourke"
}

@book{s-agtd-34
, author =	"D. M. Y. Sommerville"
, title =	"Analytical Geometry in Three Dimensions"
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1934
, keywords =	"geometry, lines"
, update =	"98.11 bibrelex, 98.03 agarwal, 96.05 agarwal"
}

@techreport{ss-tocm-86
, author =	"E. Sonatg and H. Sussmann"
, title =	"Time-Optimal Control of Manipulators"
, institution =	"Dept. Math., Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1986
, update =	"97.11 bibrelex"
}

@article{s-sooau-84
, author =	"G. Sonnevend"
, title =	"Sequential optimal order algorithms for the uniform approximation of functions with convex $r$-th derivates"
, journal =	"Analysis Mathematica"
, volume =	10
, year =	1984
, pages =	"311--335"
, update =	"98.07 bibrelex"
}

@article{s-sdbh-89
, author =	"?? Sontag"
, title =	"Sigmoids distinguish better than heavisides"
, journal =	"Neural Computation"
, volume =	1
, year =	1989
, pages =	"470--472"
, update =	"98.07 bibrelex"
}

@inproceedings{ss-rtoct-85
, author =	"E. Sontag and H. Sussmann"
, title =	"Remarks on the Time-Optimal Control of Two-Link Manipulators"
, booktitle =	"Proc. 24th Conf. Decision Control"
, site =	"Ft. Lauderdale"
, year =	1985
, update =	"97.11 bibrelex"
}

@article{s-tfga-94
, author =	"J. Sorenson"
, title =	"Two fast {GCD} algorithms"
, journal =	"J. Algorithms"
, volume =	16
, year =	1994
, pages =	"110--144"
, update =	"97.11 bibrelex"
}

@article{st-gcapr-00
, author =	"M. Soss and G. T. Toussaint"
, title =	"Geometric and computational aspects of polymer reconfiguration", journal = "J. Math. Chemistry"
, volume =	27
, number =	4
, year =	2000
, pages =	"303--318"
, update =	"01.07 orourke"
}

@techreport{st-rp3dl-00
, author =	"M. Soss and G. T. Toussaint"
, title =	"Reconfiguring polymer-like {3D} linkages"
, number =	"SOCS-00.2"
, institution =	"McGill Univ., Montreal"
, year =	2000
, update =	"01.04 orourke"
}

@inproceedings{sfl-srpc-94
, author =	"P. Sou{\`e}res and J.-Y. Fourquet and J.-P. Laumond"
, title =	"Set of reachable positions for a car"
, booktitle =	"IEEE Transaction on Automatic Control"
, year =	1994
, pages =	""
, note =	"to appear"
, update =	"94.05 devillers"
}

@techreport{sl-sdpcc-92
, author =	"P. Sou{\`e}res and J.-P. Laumond"
, title =	"Synth{\`e}se des plus courts chemins pour la voiture de Reeds et Shepp"
, type =	"Research {Report}"
, number =	"LAAS/CNRS 92234"
, institution =	"LAAS"
, address =	"Toulouse, France"
, year =	1992
}

@article{sp-frsms-96
, author =	"A. I. Sourin and A. A. Pasko"
, title =	"Function Representation for Sweeping by a Moving Solid"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	2
, number =	1
, month =	mar
, year =	1996
, pages =	"11--18"
, update =	"96.09 held"
}

@book{s-rmes-40
, author =	"R. V. Southwell"
, title =	"Relaxation Methods in Engineering Science"
, publisher =	"Oxford University Press"
, year =	1940
, update =	"98.03 bibrelex"
}

@techreport{sw-cplh-94
, author =	"Diane Souvaine and Rephael Wenger"
, title =	"Constructing Piecewise Linear Homeomorphisms"
, type =	"Technical Report"
, number =	"94--52"
, institution =	"DIMACS"
, address =	"New Brunswick, New Jersey"
, year =	1994
, update =	"01.07 wenger"
}

@phdthesis{s-cgcw-86
, author =	"D. L. Souvaine"
, title =	"Computational geometry in a curved world"
, type =	"Ph.{D}. Thesis"
, school =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	1986
, keywords =	"doctoral thesis, design of algorithms"
, comments =	"UMI AAC86-29439, 134 pp."
, precedes =	"ds-cgcw-90"
, update =	"93.09 jones"
}

@inproceedings{s-cprop-89
, author =	"D. L. Souvaine"
, title =	"The contour problem for restricted-orientation polygons"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	38
}

@techreport{sb-cprop-89
, author =	"D. L. Souvaine and I. Bjorling-Sachs"
, title =	"The contour problem for restricted-orientation polygons"
, type =	"Report"
, number =	"LCSR-TR-137"
, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1989
, keywords =	"contour of union, plane-sweep, segment tree, divide-and-conquer, VLSI"
}

@article{sb-cprop-92
, author =	"D. L. Souvaine and I. Bjorling-Sachs"
, title =	"The Contour Problem for Restricted-Oriented Polygons"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1449--1470"
, update =	"93.09 held"
}

@article{ss-tseal-87
, author =	"D. L. Souvaine and J. M. Steele"
, title =	"Time- and space- efficient algorithms for least median of squares regression"
, journal =	"J. Amer. Statist. Assoc."
, volume =	82
, year =	1987
, pages =	"794--801"
, keywords =	"statistics, optimization, plane-sweep, geometric transformations, points, lines"
}

@techreport{sv-cp-89t
, author =	"D. L. Souvaine and C. J. {Van Wyk}"
, title =	"Clamping a polygon"
, type =	"Report"
, number =	"LCSR-TR-98"
, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
, address =	"New Brunswick, NJ"
, year =	1989
, keywords =	"clamp, convex polygon, simple polygon"
, precedes =	"sv-cp-89i"
}

@inproceedings{sv-cp-89i
, author =	"D. L. Souvaine and C. J. {Van Wyk}"
, title =	"Clamping a polygon"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	6
, succeeds =	"sv-cp-89t"
}

@article{sv-cp-94
, author =	"D. L. Souvaine and C. J. {Van Wyk}"
, title =	"Clamping a polygon"
, journal =	"Visual Comput."
, volume =	10
, year =	1994
, pages =	"484--494"
, update =	"95.01 smid"
}

@article{sv-hhcib-90
, author =	"D. L. Souvaine and C. J. {Van Wyk}"
, title =	"How hard can it be to draw a pie chart?"
, journal =	"Math. Mag."
, volume =	63
, year =	1990
, pages =	"165--172"
, keywords =	"design of algorithms, NP-hard"
}

@inproceedings{sy-ccsd-93
, author =	"Diane L. Souvaine and Chee-Keng Yap"
, title =	"Combinatorial Complexity of Signed Discs"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"577--588"
, precedes =	"sy-ccsd-95"
, update =	"96.09 devillers, 96.05 agarwal, 93.09 smid, 93.05 jones"
}

@article{sy-ccsd-95
, author =	"Diane L. Souvaine and Chee-Keng Yap"
, title =	"Combinatorial Complexity of Signed Discs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"207--223"
, succeeds =	"sy-ccsd-93"
, update =	"96.09 devillers"
}

@book{s-ac-57
, author =	"B. Spain"
, title =	"Analytical Conics"
, publisher =	"Pergamon Press"
, year =	1957
, update =	"98.07 bibrelex"
}

@book{s-at-66
, author =	"E. H. Spanier"
, title =	"Algebraic Topology"
, publisher =	"McGraw-Hill Book Company"
, address =	"New York"
, year =	1966
, update =	"97.03 gaertner+salinger"
}

@article{sw-qaisc-85
, author =	"M. Spann and R. Wilson"
, title =	"Quadtree Approach to Image Segmentation which Statistical and Spatial Information"
, journal =	"Pattern Recogn."
, volume =	18
, year =	1985
, pages =	"257--269"
, update =	"98.07 agarwal"
}

@inproceedings{s-olsfc-97
, author =	"H. Sp{\"a}th"
, title =	"Orthogonal Least Squares Fitting by Conic Sections and other Algebraic Curves and Surfaces with a Special Two-Step Descent Method"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	27
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{sw-olla-87
, author =	"H. Sp{\"a}th and G. A. Watson"
, title =	"On orthogonal linear {$L_{1}$} approximation"
, journal =	"Numer. Math."
, volume =	51
, year =	1987
, pages =	"531--543"
, update =	"98.03 bibrelex"
}

@article{s-adwag-49
, author =	"W. Specht"
, title =	"{Absch{\"a}tzungen} der {Wurzeln} algebraischer {Gleichungen}"
, journal =	"Math. Z."
, volume =	52
, year =	1949
, pages =	"310--321"
, update =	"97.11 bibrelex"
}

@inproceedings{ss-etstt-97
, author =	"Bettina Speckmann and Jack Snoeyink"
, title =	"Easy Triangle Strips for {TIN} Terrain Models"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"239--244"
, update =	"97.11 jones"
}

@article{s-eaovs-86
, author =	"T. Speevak"
, title =	"An efficient algorithm for obtaining the volume of a special kind of pyramid and application to convex polyhedra"
, journal =	"Math. Comput."
, volume =	46
, year =	1986
, pages =	"531--536"
}

@techreport{s-mmp-91
, author =	"J.-C. Spehner"
, title =	"Merging in maps and pavings"
, type =	"Research {Report}"
, number =	48
, institution =	"Laboratoire de Math{\'e}matiques et Informatique, Universit{\'e} des Haute-Alsace"
, address =	"Mulhouse, France"
, year =	1991
, update =	"98.07 bibrelex"
}

@article{s-ssds-85
, author =	"J. Spencer"
, title =	"Six standard deviations suffice"
, journal =	"Trans. Amer. Math. Soc."
, volume =	289
, year =	1985
, pages =	"679--706"
, keywords =	"discrepancy, probabilistic method"
, update =	"94.01 matousek"
}

@book{s-tlpm-87
, author =	"J. Spencer"
, title =	"Ten lectures on the probabilistic method"
, series =	"CBMS-NSF"
, publisher =	"SIAM"
, year =	1987
, update =	"94.05 matousek"
}

@incollection{sst-udep-84
, author =	"J. Spencer and E. Szemer{\' e}di and W. T. Trotter"
, title =	"Unit distances in the {Euclidean} plane"
, editor =	"B. Bollob{\'a}s"
, booktitle =	"Graph Theory and Combinatorics"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1984
, pages =	"293--303"
, update =	"98.07 agarwal, 98.03 agarwal"
}

@techreport{s-cgru-89
, author =	"J. Spiegels"
, title =	"Computational geometry in a restricted universe"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1989
, keywords =	"survey paper, two-dimensional, domination, convex hull, rectangles, subdivisions, range search"
, update =	"94.05 schwarzkopf"
}

@inproceedings{st-dpps-96
, author =	"Daniel A. Spielman and Shang-Hua Teng"
, title =	"Disk Packings and Planar Separators"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"349--358"
, cites =	"ast-ps-94, a-cpls-70, a-cpfvl-70, pa-cg-95, cgt-pumlp-96, cemst-acpir-93, d-pppg-82, e-acg-87, emt-dltag-93, f-slrpg-48, fpp-sssfe-88, gl-cslsp-81, g-iaspg-86, gm-psen-90, hlp-i-52, k-kdka-36, lt-stpg-79, lrt-gnd-79, m-fsscs-86, mtv-ugags-91, mttv-gsfem-95, mt-sttd-90, t-pssug-90, t-pdfip-80, t-gt3m-88, t-crg-60, t-hdg-63, ZZZ"
, update =	"97.11 bibrelex, 96.05 efrat"
}

@techreport{sy-ccmc-83
, author =	"P. Spirakis and C. Yap"
, title =	"On the combinatorial complexity of motion coordination"
, type =	"Report"
, number =	76
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1983
}

@article{sy-snhmd-84
, author =	"P. Spirakis and C. Yap"
, title =	"Strong {NP}-hardness of moving many discs"
, journal =	"Inform. Process. Lett."
, volume =	19
, year =	1984
, pages =	"55--59"
, update =	"98.11 bibrelex"
}

@techreport{s-vumsp-84
, author =	"P. G. Spirakis"
, title =	"The volume of the union of many spheres and point inclusion problems"
, type =	"Report"
, number =	"TR 133"
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1984
}

@techreport{s-vfaau-83
, author =	"P. G. Spirakis"
, title =	"Very fast algorithms for the area of the union of many circles"
, type =	"Report"
, number =	98
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, year =	1983
}

@book{s-cidg-79
, author =	"M. Spivak"
, title =	"A Comprehensive Introduction to Differential Geometry"
, volume =	3
, publisher =	"Publish or Perish Press"
, address =	"Berkeley, CA"
, year =	1979
, update =	"97.11 bibrelex"
}

@book{s-cm-65
, author =	"M. Spivak"
, title =	"Calculus on Manifolds"
, publisher =	"W. A. Benjamin Inc."
, address =	"New York"
, year =	1965
, update =	"98.03 bibrelex"
}

@inproceedings{sa-u3tst-95
, author =	"L. Spratt and A. Ambler"
, title =	"Using {3D} Tubes to Solve the Intersecting Line Representation Problem"
, booktitle =	"Proc. IEEE Symp. on Visual Languages, 1994"
, year =	1995
, pages =	"254--261"
, keywords =	"graph drawing, 3D"
, update =	"97.03 tamassia, 96.09 tamassia, 96.04 garg"
}

@article{sk-nbmlu-02
, author =	"M. J. Spriggs and J. M. Keil"
, title =	"A new bound for map labeling with uniform circle pairs"
, journal =	"Inform. Process. Lett."
, volume =	81
, year =	2002
, pages =	"47--53"
, update =	"01.11 smid"
}

@book{s-irs-81
, author =	"G. Springer"
, title =	"Introduction to {Riemann} Surfaces"
, publisher =	"Chelsea"
, year =	1981
, update =	"98.03 bibrelex"
}

@mastersthesis{s-pma-90
, author =	"J. Sprinzak"
, title =	"Point Matching Algorithms"
, type =	"Masters Thesis"
, school =	"Dept. Comput. Sci., Hebrew Univ."
, address =	"Jerusalem, Israel"
, year =	1990
, keywords =	"master thesis"
}

@article{sw-apm-94
, author =	"J. Sprinzak and M. Werman"
, title =	"Affine Point Matching"
, journal =	"Pattern Recogn. Lett."
, volume =	15
, year =	1994
, pages =	"337--339"
, update =	"96.01 werman"
}

@inproceedings{sw-epm-90
, author =	"J. Sprinzak and M. Werman"
, title =	"Exact Point Matching"
, booktitle =	"Proc. Israeli Symposium on AI, Vision and Pattern Recognition"
, publisher =	"Elsevier Science Publishers"
, year =	1990
}

@article{s-rnns-91
, author =	"R. F. Sproull"
, title =	"Refinements to nearest-neighbor searching"
, journal =	"Algorithmica"
, volume =	6
, year =	1991
, pages =	"579--589"
}

@techreport{s-rnnsk-88
, author =	"R. F. Sproull"
, title =	"Refinements to nearest-neighbor searching in $k$-d trees"
, number =	"SSAPP 184"
, institution =	"Southerland, Sproull and Associates"
, month =	jul
, year =	1988
, update =	"97.11 bibrelex"
}

% ### others?
@article{so-npdsb-88
, author =	"G. Spur and others"
, title =	"{NC} Programming and Dynamic Simulation Based on Solid Models in a {CIM} Strategy"
, journal =	"Robotics and Computer-Integrated Manufacturing"
, volume =	4
, number =	"3--4"
, year =	1988
, pages =	"471--481"
, update =	"93.09 held"
, annote =	"claims to use Voronoi diagrams"
}

@inproceedings{ssk-cdmpp-93
, author =	"K. Sridharan and H. E. Stephanou and S. S. Deerthi"
, title =	"On Computing a Distance Measure for Path Planning"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Atlanta Georgia"
, year =	1993
, pages =	"554--559"
, update =	"98.11 bibrelex"
}

@article{s-rtddi-81
, author =	"S. N. Srihari"
, title =	"Representation of three-dimensional digital images"
, journal =	"ACM Comput. Surv."
, volume =	13
, number =	4
, year =	1981
, pages =	"399--424"
, update =	"98.11 bibrelex"
}

% ### others?
@article{s-cgmvi-90
, author =	"P. Srinivasan and others"
, title =	"Computational geometric methods in volumetric intersection for {3D} reconstruction"
, journal =	"Pattern Recogn."
, volume =	23
, year =	1990
, pages =	"843--857"
, update =	"98.11 bibrelex"
}

@unpublished{s-dgvm-94
, author =	"V. Srinivasan"
, title =	"Dealing with Geometric Variations in Manufacturing"
, year =	1994
, note =	"Invited lecture, NSF Workshop on Manufacturing and
              Computational Geometry, April~1"
, update =	"95.01 mitchell"
}

@unpublished{s-gmm-94
, author =	"V. Srinivasan"
, title =	"Geometry, Measurements, and Manufacturing"
, year =	1994
, note =	"Invited lecture, Fourth MSI Workshop on
              Computational Geometry, October 14-15"
, update =	"95.01 mitchell"
}

@inproceedings{s-rsts-93
, author =	"V. Srinivasan"
, title =	"Role of Sweeps in Tolerance Semantics"
, booktitle =	"Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
, year =	1993
, pages =	"69--78"
, update =	"96.09 orourke"
}

@techreport{sn-acvdm-85
, author =	"V. Srinivasan and L. R. Nackman"
, title =	"An algorithm to compute the {Voronoi} diagram of a multiply connected polygonal domain"
, type =	"Report"
, number =	"RC 11605 (\#52150)"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1985
, update =	"94.09 bernal"
}

@techreport{sn-mblss-89
, author =	"V. Srinivasan and L. R. Nackman"
, title =	"Maximal balls of linearly separable sets"
, type =	"Report"
, number =	"RC 14596"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, month =	may
, year =	1989
, precedes =	"sn-mblss-94"
, update =	"96.09 devillers"
}

@article{sn-mblss-94
, author =	"V. Srinivasan and L. R. Nackman"
, title =	"Maximal balls of linearly separable sets"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, year =	1994
, pages =	"25--38"
, keywords =	"separable sets, maximal balls, bissectors, triangulation"
, succeeds =	"sn-mblss-89"
, update =	"96.09 devillers"
}

@article{sn-vdmcp-87
, author =	"V. Srinivasan and L. R. Nackman"
, title =	"Voronoi diagram for multiply-connected polygonal domains {I}: algorithm"
, journal =	"IBM J. Res. Develop."
, volume =	31
, year =	1987
, pages =	"361--372"
}

@techreport{sntm-amgus-90
, author =	"V. Srinivasan and L. R. Nackman and J. Tang and S. N. Meshkat"
, title =	"Automatic Mesh Generation unsing the Symmetric Axis Transformation of Polygonal Domains"
, number =	"RC 16132"
, institution =	"IBM Res. Center"
, year =	1990
, update =	"97.11 bibrelex"
}

@article{sntm-amgus-92
, author =	"V. Srinivasan and L. R. Nackman and J.-M. Tang and S. N. Meshkat"
, title =	"Automatic Mesh Generation Using the Symmetric Axis Transform of Polygonal Domains"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1485--1501"
, update =	"93.09 held"
}

@article{so-oist-94
, author =	"V. Srinivasan and M. A. O'Connor"
, title =	"On interpreting statistical tolerancing"
, journal =	"Manufacturing Review"
, volume =	7
, number =	4
, year =	1994
, pages =	"304--311"
, update =	"98.03 agarwal"
}

@book{sv-dtm-93
, title =	"Dimensional Tolerancing and Metrology"
, editor =	"V. Srinivasan and H. B. Voelcker"
, series =	"CRTD"
, volume =	27
, publisher =	"The American Society of Mechanical Engineers"
, year =	1993
, update =	"98.07 bibrelex"
}

@phdthesis{s-vipcg-92
, author =	"G. Srinivasaraghavan"
, title =	"On Some Visibility and Intersection Problems in Computational Geometry"
, school =	"Department of Computer Science and Engineering, Indian Institute of Technology"
, address =	"Kanpur, India"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@article{sm-nncvv-94
, author =	"G. Srinivasaraghavan and A. Mukhopadhyay"
, title =	"A new necessary condition for the vertex visibility graphs of simple polygons"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"65--82"
, keywords =	"visibility"
, update =	"94.09 orourke"
}

@inproceedings{sm-ncra-93
, author =	"G. Srinivasaraghavan and A. Mukhopadhyay"
, title =	"On the notion of completeness for reconstruction algorithms"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"315--320"
, cites =	"o-agta-87, s-vipcg-92, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@techreport{sm-ssps-92
, author =	"G. Srinivasaraghavan and Asish Mukhopadhyay"
, title =	"Stabbing simple planar sets"
, type =	"Technical Report"
, number =	"TRCS-92-152"
, institution =	"IIT Kanpur, Computer Science and Engg. Dept."
, year =	1992
, update =	"98.11 bibrelex"
}

@inproceedings{ss-achii-94
, author =	"A. Srivastav and P. Stangier"
, title =	"Algorithmic {Chernoff}-{Hoeffding} Inequalities in Integer Programming"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"226--234"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{ss-tarcs-94
, author =	"A. Srivastav and P. Stangier"
, title =	"Tight Approximations of Resource Constrained Scheduling Problems"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"307--318"
, update =	"97.03 gaertner+salinger"
}

@article{ss-wfikm-95
, author =	"A. Srivastav and P. Stangier"
, title =	"Weighted fractional and integral $k$-matching in hypergraphs"
, journal =	"Discrete Appl. Math."
, volume =	57
, year =	1995
, pages =	"255--269"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{sa-agoos-87
, author =	"S. Srivastava and N. Ahuia"
, title =	"An algorithm for generating octrees from object silhouettes in perspective views"
, booktitle =	"Proc. IEEE Workshop Comput. Vision"
, site =	"Miami Beach, Fl."
, month =	nov
, year =	1987
, pages =	"363--365"
, update =	"98.11 bibrelex"
}

@inproceedings{s-pmspe-98
, author =	"Ernesto Staffetti"
, title =	"Planning the Motion of a Segment in a Polygonal Environment"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"135--137"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{s-nrdec-84
, author =	"R. Stanley"
, title =	"On the Number of Reduced Decompositions of Elements of {Coxeter} Groups"
, journal =	"European J. Combin."
, volume =	5
, year =	1984
, pages =	"359--372"
, update =	"96.09 devillers, 94.09 orourke"
}

@article{s-nfscp-80
, author =	"R. Stanley"
, title =	"The number of faces of a simplical convex polytope"
, journal =	"Adv. Math."
, volume =	35
, year =	1980
, pages =	"236--238"
, update =	"97.11 bibrelex"
}

@article{s-ubccr-75
, author =	"R. Stanley"
, title =	"The upper-bound conjecture and {Cohen-Macaulay} rings"
, journal =	"Stud. Appl. Math."
, volume =	54
, year =	1975
, pages =	"135--142"
, update =	"98.07 bibrelex"
}

@book{s-ec-86
, author =	"R. P. Stanley"
, title =	"Enumerative Combinatorics"
, volume =	1
, publisher =	"Wadsworth \& Brooks/Cole"
, address =	"Monterey, CA"
, year =	1986
, update =	"97.11 bibrelex"
}

@article{s-tpp-86
, author =	"R. P. Stanley"
, title =	"Two poset polytopes"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"9--23"
}

@article{sjw-cadcs-82
, author =	"S. M. Stanley and R. B. Jerard and P. R. White"
, title =	"Computer-Aided Design of Curved Surfaces with Automatic Model Generation"
, journal =	"Journal of Mechanical Design, ASME Transactions"
, volume =	104
, number =	3
, month =	oct
, year =	1982
, pages =	"817--824"
, update =	"98.03 bibrelex"
}

@mastersthesis{s-popop-89
, author =	"M. Stanton"
, title =	"Pareto Optimal Paths Among Obstacles in the Plane"
, type =	"M.{S}. Thesis"
, school =	"Dept. Operations Research, Cornell University"
, address =	"Ithaca, NY"
, year =	1989
, keywords =	"master thesis"
, update =	"93.05 jones"
}

@article{sd-dss-76
, author =	"R. Stanton and P. Dirksen"
, title =	"{Davenport--Schinzel} sequences"
, journal =	"Ars Combinatorica"
, volume =	1
, year =	1976
, pages =	"43--51"
, update =	"95.09 agarwal"
}

@incollection{sr-rdss-69
, author =	"R. Stanton and D. Roselle"
, title =	"A result on {Davenport--Schinzel} sequences"
, editor =	"P. Erd{\H o}s and others"
, booktitle =	"Combinatorial Theory and Its Applications, Colloq. Math. Society J{\'a}nos Bolyai"
, volume =	4
, publisher =	"North-Holland"
, address =	"Amsterdam"
, year =	1969
, pages =	"1023--1027"
, update =	"95.09 agarwal"
}

@phdthesis{s-mpafo-94
, author =	"A. F. van der Stappen"
, title =	"Motion Planning amidst Fat Obstacles"
, type =	"Ph.{D}. Dissertation"
, school =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"95.01 smid"
}

@article{s-cfsmp-
, author =	"A. F. van der Stappen"
, title =	"The complexity of the free space for motion planning amidst fat obstacles"
, journal =	"Journal of Intelligent \& Robotic Systems"
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@techreport{sgo-gecmp-96
, author =	"A. F. van der Stappen and K. Goldberg and M. H. Overmars"
, title =	"Geometric eccentricity and the complexity of manipulation plans"
, type =	"Report"
, number =	"UU-CS-1996-49"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1996
, comments =	"To appear in Algorithmica"
, update =	"97.11 oostrum"
}

@inproceedings{sho-eaemp-93
, author =	"A. F. van der Stappen and D. Halperin and M. H. Overmars"
, title =	"Efficient algorithms for exact motion planning amidst fat obstacles"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1993
, pages =	"297--304"
, keywords =	"robotics, motion planning"
, update =	"95.09 halperin"
}

@techreport{sho-cfsrm-92
, author =	"A. F. van der Stappen and D. Halperin and M. H. Overmars"
, title =	"The complexity of the free space for a robot moving amidst fat obstacles"
, type =	"Report"
, number =	"RUU-CS-92-05"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1992
, keywords =	"motion planning"
, precedes =	"sho-cfsrm-93"
, update =	"96.09 devillers, 94.05 schwarzkopf"
}

@article{sho-cfsrm-93
, author =	"A. F. van der Stappen and D. Halperin and M. H. Overmars"
, title =	"The complexity of the free space for a robot moving amidst fat obstacles"
, journal =	"Comput. Geom. Theory Appl."
, volume =	3
, year =	1993
, pages =	"353--373"
, succeeds =	"sho-cfsrm-92"
, update =	"96.09 devillers"
}

@inproceedings{so-mpafo-94
, author =	"A. F. van der Stappen and M. H. Overmars"
, title =	"Motion Planning amidst Fat Obstacles"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"31--40"
, cites =	"afkmnsu-ampcb-92, abf-pempa-89, bo-arcgi-79, bgh-vdt3s-94, mmpssw-ftdlm-91, o-plfs-92, ss-pmp1c-83, ss-nempa-87, ss-pmp2g-83, ss-empae-85, sho-cfsrm-93, s-cfsmp-, sho-eaemp-93, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@techreport{so-mpelo-95
, author =	"A. F. van der Stappen and M. H. Overmars"
, title =	"Motion planning in environments with low obstacle density"
, type =	"Technical {Report}"
, number =	"UU-CS-1995-33"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, month =	oct
, year =	1995
, update =	"98.07 bibrelex"
}

@techreport{sobv-mpelo-97
, author =	"A. F. van der Stappen and M. H. Overmars and M. de Berg and J. Vleugels"
, title =	"Motion planning in environments with low obstacle density"
, type =	"Report"
, number =	"UU-CS-1997-19"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1997
, update =	"97.11 oostrum"
}

@book{se-gisi-90
, author =	"J. Star and J. Estes"
, title =	"Geographic Information Systems: an Introduction"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs"
, year =	1990
, update =	"96.09 kreveld"
}

@inproceedings{s-saat-90
, author =	"J. T. Stasko"
, title =	"Simplifying Algorithm Animation with Tango"
, booktitle =	"Proc. IEEE Workshop on Visual Languages"
, year =	1990
, pages =	"1--6"
, update =	"96.01 tamassia"
}

@article{s-tfsaa-90
, author =	"J. T. Stasko"
, title =	"Tango: a Framework and System for Algorithm Animation"
, journal =	"IEEE Computer"
, volume =	23
, number =	9
, year =	1990
, pages =	"27--39"
, url =	"http://www.cc.gatech.edu/gvu/softviz/algoanim/xtango.html"
, update =	"96.01 tamassia"
}

@article{s-ptppm-90
, author =	"J. T. Stasko"
, title =	"The Path-Transition Paradigm: a Practical Methodology for Adding Animation to Program Interfaces"
, journal =	"J. Visual Lang. Comput."
, volume =	1
, number =	3
, year =	1990
, pages =	"213--236"
, update =	"96.01 tamassia"
}

%   is this a book??
@book{s-am-83
, author =	"J. P. Steadman"
, title =	"Architectural Morphology"
, publisher =	"Pion"
, address =	"London"
, year =	1983
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@phdthesis{s-dicpl-80
, author =	"G. L. {Steele, Jr.}"
, title =	"The definition and implementation of a computer programming language based on constraints"
, school =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, month =	aug
, year =	1980
, note =	"Technical Report AI-TR-595"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{s-ccspk-81
, author =	"J. M. Steele"
, title =	"Complete convergence of short paths and {Karp}'s algorithm for the {TSP}"
, journal =	"Math. Oper. Res."
, volume =	6
, year =	1981
, pages =	"374--378"
}

@article{s-otrsp-82
, author =	"J. M. Steele"
, title =	"Optimal triangulations of random samples in the plane"
, journal =	"Ann. Probab."
, volume =	10
, number =	3
, year =	1982
, pages =	"548--553"
}

@article{s-pwcac-90
, author =	"J. M. Steele"
, title =	"Probabilistic and worst-case analysis of classical problems of combinatorial optimization in {Euclidean} space"
, journal =	"Math. Oper. Res."
, volume =	15
, year =	1990
, pages =	"749--770"
, update =	"97.11 bibrelex"
}

@article{s-sefnl-81
, author =	"J. M. Steele"
, title =	"Subadditive {Euclidean} functionals and non-linear growth in geometric probability"
, journal =	"Ann. Probab."
, volume =	9
, year =	1981
, pages =	"365--376"
, update =	"97.11 bibrelex"
}

@article{ss-wcgrs-89
, author =	"J. M. Steele and T. L. Snyder"
, title =	"Worst-case growth rates of some classical problems of combinatorial optimization"
, journal =	"SIAM J. Comput."
, volume =	18
, year =	1989
, pages =	"278--287"
, update =	"00.03 smid, 97.11 bibrelex"
}

@article{sy-lbadt-82
, author =	"J. M. Steele and A. C. Yao"
, title =	"Lower bounds for algebraic decision trees"
, journal =	"J. Algorithms"
, volume =	3
, year =	1982
, pages =	"1--8"
}

@article{s-idssd-78
, author =	"M. Stefik"
, title =	"Inferring {DNA} structures from segmentation data"
, journal =	"Artif. Intell."
, volume =	11
, year =	1978
, pages =	"85--114"
, update =	"97.11 bibrelex"
}

@article{sb-ooptv-85
, author =	"M. Stefik and D. G. Bobrow"
, title =	"Object-oriented programming: themes and variations"
, journal =	"The AI Magazine"
, volume =	"??"
, year =	1985
, pages =	"40--62"
, update =	"98.03 bibrelex"
}

@article{s-abq-92
, author =	"T. Stehling"
, title =	"Ammann bars and quasicrystals"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"125--133"
}

@inproceedings{s-ahsc-93
, author =	"William Steiger"
, title =	"Algorithms for Ham Sandwich Cuts"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	48
, update =	"93.09 milone+mitchell"
}

@inproceedings{s-sglbu-95
, author =	"William Steiger"
, title =	"Some Geometric Lower Bounds Using Connected Components"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	61
, update =	"00.03 bibrelex"
}

@inproceedings{s-ssttr-95
, author =	"William Steiger"
, title =	"Some Space/Time Tradeoffs for Ranking and Searching"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	63
, update =	"00.03 bibrelex"
}

@inproceedings{ss-paslp-94
, author =	"W. Steiger and I. Streinu"
, title =	"A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"7--11"
, cites =	"csss-otass-89, eg-ccytb-84, e-acg-87, f-hgiit-76, gp-ms-83, gp-ubcpr-86, hpss-sxoc-75, l-sxyoc-91, m-lblmp-91, pss-ubnpk-92, s-nrdec-84, gp-asotd-93, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{ss-paslp-95
, author =	"W. Steiger and I. Streinu"
, title =	"A pseudo-algorithmic separation of lines from pseudo-lines"
, journal =	"Inform. Process. Lett."
, volume =	53
, year =	1995
, pages =	"295--299"
, update =	"01.07 smid"
}

@article{ss-if-98
, author =	"W. Steiger and I. Streinu"
, title =	"Illumination by Floodlights"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, number =	1
, year =	1998
, pages =	"57--70"
, keywords =	"visibility, floodlights"
, succeeds =	"ss-pnrfp-94"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{ss-pnrfp-94
, author =	"W. Steiger and I. Streinu"
, title =	"Positive and Negative Results on the Floodlight Problem"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"87--92"
, keywords =	"visibility, floodlights"
, precedes =	"ss-if-98"
, cites =	"ae-tpss-87, bglosu-fp-93, cru-ofipt-93, e-acg-87, o-agta-87, ps-cgi-85, bfprt-tbs-73, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 94.09 orourke"
}

@inproceedings{sw-frmrl-92
, author =	"A. Stein and M. Werman"
, title =	"Finding the repeated median regression line"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"409--413"
}

@inproceedings{sw-rssf-92
, author =	"A. Stein and M. Werman"
, title =	"Robust Statistics in Shape Fitting"
, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
, month =	jun
, year =	1992
, pages =	"540--546"
, update =	"98.11 bibrelex, 96.01 werman"
}

@article{s-cm-51
, author =	"S. K. Stein"
, title =	"Convex Maps"
, journal =	"Proc. Amer. Math. Soc."
, volume =	2
, number =	3
, year =	1951
, pages =	"464--466"
, keywords =	"graph drawing"
, update =	"98.07 tamassia, 93.09 tamassia"
}

@article{s-spn4-44
, author =	"R. Steinberg"
, title =	"Solution to Problem No 4065"
, journal =	"Amer. Math. Monthly"
, volume =	51
, year =	1944
, pages =	"169--171"
, update =	"98.03 devillers"
}

@article{s-egudt-26
, author =	"J. Steiner"
, title =	"{Einige} {Gesetze} {\"u}ber die {Theilung} der {Ebene} und des {Raumes}"
, journal =	"J. Reine Angew. Math."
, volume =	1
, year =	1826
, pages =	"349--364"
, update =	"98.03 agarwal"
}

@incollection{s-sedag-81
, author =	"J. Steiner"
, title =	"Systematische {Entwicklung} der {Abh{\"a}ngigkeit} geometrischer {Gestalten} voneinander"
, booktitle =	"Jakob Steiner's Collected Works"
, publisher =	"??"
, year =	1881
, update =	"97.11 bibrelex"
}

@techreport{s-sfars-89
, author =	"T. L. Steiner"
, title =	"A simple and faster algorithm for the rectilinear {Steiner} problem in general dimension"
, type =	"Technical {Report}"
, institution =	"Dept. Comput. Sci., Georgetown Univ."
, address =	"Washington, DC"
, year =	1989
, update =	"97.11 bibrelex"
}

@article{s-pur-22
, author =	"E. Steinitz"
, title =	"Polyeder und Raumeinteilungen"
, journal =	"Enzykl. Math. Wiss."
, volume =	3
, year =	1922
, pages =	"1--139"
, note =	"Part 3AB12"
, update =	"97.11 bibrelex"
}

@article{s-uipkp-27
, author =	"E. Steinitz"
, title =	"{\"U}ber isoperimetrische Probleme bei konvexen Polyedern"
, journal =	"J. Math."
, volume =	158
, year =	1927
, pages =	"129--153"
, update =	"97.11 bibrelex"
}

@book{sr-vudtd-34
, author =	"E. Steinitz and H. Rademacher"
, title =	"{V}orlesungen {\"u}ber die {T}heorie der {P}olyeder"
, publisher =	"Julius Springer"
, address =	"Berlin, Germany"
, year =	1934
, keywords =	"graph drawing"
, update =	"98.11 bibrelex, 98.07 vismara, 93.09 tamassia"
}

@article{s-cadzp-91
, author =	"G. Stengle"
, title =	"Constraints on the angular distribution of the zeros of a polynomial of low complexity"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"163--169"
}

@incollection{s-ramsr-86
, author =	"H. I. Stern"
, title =	"A Routing Algorithm for a Mobile Search Robot"
, booktitle =	"Impacts of Microcomputers on Operations Research"
, year =	1986
, pages =	"73--87"
, update =	"93.09 milone+mitchell"
}

@article{sh-srppi-72
, author =	"B. M. Steward and F. Herzog"
, title =	"Semi-regular plane polygons of integral type"
, journal =	"Israel J. Math."
, volume =	11
, year =	1972
, pages =	"31--52"
, update =	"97.11 bibrelex"
}

@inproceedings{sg-osacs-93
, author =	"A. Stewart and S. Ghali"
, title =	"An output sensitive algorithm for the computation of shadow boundaries"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"291--296"
, cites =	"cf-nrtsg-89, cf-aaial-91, cf-fopsg-92, h-dmr-92, ltg-dmar-92, m-eahsr-89, s-agtd-34, gcs-ecrag-91, st-pplup-86, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{s-fhcap-98
, author =	"A. J. Stewart"
, title =	"Fast Horizon Computation at All Points of a Terrain with Visibility and Shading Applications"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	4
, number =	1
, month =	jan
, year =	1998
, pages =	"82--93"
, update =	"98.07 held"
}

@inproceedings{s-hvt-97
, author =	"A. James Stewart"
, title =	"Hierarchical Visibility in Terrains"
, booktitle =	"Eurographics Rendering Workshop"
, month =	jun
, year =	1997
, url =	"http://www.dgp.toronto.edu/people/JamesStewart/papers/egrw97.html"
, update =	"98.03 mitchell"
}

@article{s-lrapi-94
, author =	"A. J. Stewart"
, title =	"Local Robustness and its Application to Polyhedral Intersection"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, number =	1
, year =	1994
, pages =	"87--118"
, update =	"96.05 pascucci"
}

@techreport{s-mibap-91
, author =	"A. J. Stewart"
, title =	"Maximizing incidences between approximate polygons is {NP}-hard"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1991
}

@inproceedings{s-rplap-91
, author =	"A. J. Stewart"
, title =	"Robust point location in approximate polygons"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"179--182"
, keywords =	"point location, robustness"
, cites =	"ds-rgnap-88, f-smpst-89, hhk-tirgc-88, m-vigau-88p, gss-egbra-89, si-cvd10-89, ZZZ"
, update =	"98.07 bibrelex"
}

@phdthesis{s-tprgc-91
, author =	"A. J. Stewart"
, title =	"The theory and practice of robust geometric computation, or, how to build robust solid modelers"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	aug
, year =	1991
, note =	"Technical Report TR~91-1229"
, keywords =	"doctoral thesis, robustness"
, update =	"93.05 jones"
}

@inproceedings{sg-fcsbu-94
, author =	"A. J. Stewart and S. Ghali"
, title =	"Fast computation of shadow boundaries using spatial coherence and backprojections"
, editor =	"A. Glassner"
, booktitle =	"Proc. SIGGRAPH '94"
, site =	"Orlando, FL"
, publisher =	"ACM Press"
, year =	1994
, pages =	"231--238"
, note =	"ISBN 0-89791-667-0"
, update =	"98.07 bibrelex"
}

@book{s-imc-73
, author =	"G. W. Stewart"
, title =	"Introduction to Matrix Computations"
, publisher =	"Academic Press"
, address =	"New ork, NY"
, year =	1973
, update =	"98.07 bibrelex"
}

@article{s-mr-96
, author =	"Ian Stewart"
, title =	"Mathematical Recreations"
, journal =	"Sci. Amer."
, volume =	275
, number =	2
, month =	aug
, year =	1996
, pages =	"100--103"
, note =	"Includes light in circular forest problem due to Janos Pach."
, update =	"01.04 orourke, 97.11 orourke"
}

@article{s-scctf-92
, author =	"N. F. Stewart"
, title =	"A sufficient condition for correct topological form in tolerance specification"
, journal =	"Comput. Aided Design"
, volume =	12
, year =	1992
, pages =	"39--48"
, update =	"98.07 bibrelex"
}

@inproceedings{s-affch-90
, author =	"W. M. Stewart"
, title =	"An algorithm to find the facets of the convex hull in higher dimensions"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"252--256"
, cites =	"b-icp-83, ck-acp-70, g-eadch-72, ph-chfsp-77, ps-cgi-85, s-chaop-81, s-chdch-86, ZZZ"
, update =	"98.07 bibrelex"
}

@techreport{s-etspv-92
, author =	"W. R. Stewart"
, title =	"Euclidean traveling salesman problems and {Voronoi} diagrams"
, type =	"Manuscript"
, institution =	"School of Business Administration, College of William and Mary"
, year =	1992
, update =	"94.09 bernal"
}

@inproceedings{s-lfdle-81
, author =	"J.-M. Steyaert"
, title =	"La formule de {Lagrange} et ses applications au denombrement de familles d'arbres"
, booktitle =	"Seminaire d'Informatique Theorique"
, site =	"Universite Paris-VIII"
, year =	1981
, update =	"97.11 bibrelex"
}

@phdthesis{s-msrcp-88
, author =	"S. Stifter"
, title =	"A medley of solutions to the robot collision problem in two and three dimensions"
, type =	"Ph.{D}. Thesis"
, school =	"Johannes Kepler Univ."
, address =	"Linz, Austria"
, year =	1988
, note =	"Report RISC-LINZ 88-12.0"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@techreport{s-aavd3-88
, author =	"S. Stifter"
, title =	"An axiomatic approach to {Voronoi}-diagrams in $3$-{D}"
, type =	"Report"
, number =	"RISC-LINZ 88-64.0"
, institution =	"Johannes Kepler Univ."
, address =	"Linz, Austria"
, year =	1988
, precedes =	"s-aavd3-91"
}

@article{s-aavd3-91
, author =	"S. Stifter"
, title =	"An axiomatic approach to {Voronoi}-diagrams in $3${D}"
, journal =	"J. Comput. Syst. Sci."
, volume =	43
, year =	1991
, pages =	"361--374"
, keywords =	"Voronoi diagrams, retraction methods, findpath problem, computational geometry"
, succeeds =	"s-aavd3-88"
, abstract =	"Voronoi-diagrams were first introduced for sets of
		 points, and later generalized to other sets. There have
		 been very few attempts to generalize Voronoi-diagrams
		 for non-point sets to three (or higher) dimensions. We
		 define a Voronoi-diagram for a quite general subset of
		 three-space which is characterized by specific axioms.
		 This diagram is one-dimensional and connected provided
		 that the complement of the subset is connected. These
		 Voronoi-diagrams can be used in retraction methods to
		 solve the Findpath Problem for a ball moving in a
		 three-dimensional environment. (Author abstract) 14
		 Refs."
}

@techreport{s-avdsf-88
, author =	"S. Stifter"
, title =	"Application of {Voronoi}-diagrams to solve the findpath problem in $3$-{D}"
, type =	"Report"
, number =	"RISC-LINZ 88-71.0"
, institution =	"Johannes Kepler Univ."
, address =	"Linz, Austria"
, year =	1988
}

@article{s-ccega-97
, author =	"S. Stifter"
, title =	"Characterization of contour elements that generate abstract {Voronoi} diagrams"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	245
, update =	"97.07 devillers"
}

@inproceedings{s-gtpvs-93
, author =	"Sabine Stifter"
, title =	"Geometry Theorem Proving in Vector Spaces"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"56--58"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
}

@inproceedings{s-npprm-95
, author =	"Sabine Stifter"
, title =	"Numerical Problems in the Plane {Roider} Method"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"53--56"
, update =	"00.03 bibrelex"
}

@inproceedings{s-pacfp-91
, author =	"Sabine Stifter"
, title =	"Predictions about collision free paths from intersection tests"
, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
, nickname =	"CG '91"
, site =	"Bern"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"309--320"
, keywords =	"motion planning"
, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
, annote =	"7th Intern. Workshop Comput. Geom."
}

@inproceedings{s-spp-92
, author =	"Sabine Stifter"
, title =	"Secure Path Planning"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"7--8"
, update =	"00.03 bibrelex"
}

@inproceedings{s-tcgac-94
, author =	"Sabine Stifter"
, title =	"Technological Conditions in Geometric Algorithms: A Case Study for the Nesting Problem"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"78--80"
, cites =	"ZZZ"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{s-vdt3d-90
, author =	"Sabine Stifter"
, title =	"{Voronoi}-{Diagramme} f{\"u}r {Teilmengen} des {3D} und ihre {Anwendung} auf {Kollisionsprobleme} bei {Robotern}"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	24
, update =	"00.03 bibrelex"
}

@book{s-ctcgt-80
, author =	"J. Stillwell"
, title =	"Classical Topology and Combinatorial Group Theory"
, editor =	"P. R. Halmos and F. W. Gehring and C. C. Moore"
, series =	"Graduate Texts in Mathematics"
, number =	72
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1980
, isbn =	"0-387-90516-2"
, update =	"98.07 bibrelex, 97.11 bibrelex"
}

@book{s-ctcgt-93
, author =	"J. Stillwell"
, title =	"Classical Topology and Combinatorial Group Theory"
, publisher =	"Springer-Verlag"
, address =	"New York"
, year =	1993
, update =	"00.03 bibrelex"
}

@article{s-oocsf-83
, author =	"L. Stockmeyer"
, title =	"Optimal Orientation of Cells in Slicing Floorplan Design"
, journal =	"Inform. Control"
, volume =	57
, year =	1983
, pages =	"91--101"
, update =	"96.01 tamassia"
}

@book{s-eidnm-83
, author =	"J. Stoer"
, title =	"Einf{\"u}hrung in die {Numerische} {Mathematik} {I}"
, publisher =	"Springer-Verlag"
, year =	1983
, update =	"98.07 bibrelex"
}

@book{sb-ina-80
, author =	"J. Stoer and R. Bullirsch"
, title =	"Introduction to Numerical Analysis"
, publisher =	"Springer-Verlag"
, year =	1980
, update =	"97.11 bibrelex"
}

@book{sw-cofd1-70
, author =	"J. Stoer and C. Witzgall"
, title =	"Convexity and optimization in finite dimensions {I}"
, publisher =	"Springer-Verlag"
, year =	1970
}

@inproceedings{sw-smca-94
, author =	"M. Stoer and F. Wagner"
, title =	"A Simple Min Cut Algorithm"
, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	855
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"141--147"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{s-cgh-88
, author =	"I. Stojmenovic"
, title =	"Computational Geometry on a Hypercube"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1988
, pages =	"100--103"
, update =	"98.07 bibrelex"
}

@techreport{s-cvcpp-90t
, author =	"I. Stojmenovi{\'c}"
, title =	"Cutting the volumes of convex polyhedra by a plane"
, type =	"Technical Report"
, number =	"TR-90-23"
, institution =	"Univ. Ottawa"
, address =	"Ottawa, ON"
, month =	jun
, year =	1990
, precedes =	"s-cvcpp-90i"
}

@inproceedings{s-cvcpp-90i
, author =	"I. Stojmenovi{\'c}"
, title =	"Cutting the volumes of convex polyhedra by a plane"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"291--295"
, succeeds =	"s-cvcpp-90t"
, cites =	"a-dapa-89, aw-plts-88, e-acg-87, gm-eha3s-87, m-ptlp-85, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{s-flmdc-93
, author =	"I. Stojmenovi{\'c}"
, title =	"Finding the largest $m$-dimensional circle in a $k$-dimensional box"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"328--333"
, cites =	"ew-falc3-91t, ew-falc3-91, sb-mla-89, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@techreport{s-ndcha-85
, author =	"I. Stojmenovi{\'c}"
, title =	"$n$-dimensional convex hull algorithm"
, type =	"Manuscript"
, institution =	"??"
, year =	1985
, keywords =	"convex hull"
, update =	"94.05 devillers"
}

@article{sl-pdcms-88
, author =	"I. Stojmenovi{\'c} and M. A. Langston"
, title =	"On a Proposed Divide-and Conquer Minimal Spanning Tree Algorithm"
, journal =	"BIT"
, volume =	28
, year =	1988
, pages =	"755--791"
, annote =	"Discusses errors in \cite{cl-omsta-86}"
}

@article{ss-nach-86
, author =	"I. Stojmenovi{\'c} and E. Soisalon-Soininen"
, title =	"A note on approximate convex hulls"
, journal =	"Inform. Process. Lett."
, volume =	22
, year =	1986
, pages =	"55--56"
}

@inproceedings{s-opg-87
, author =	"J. Stolfi"
, title =	"Oriented projective geometry"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"76--85"
, precedes =	"s-pcg-88"
, cites =	"bbr-ecit-85, c-rpp-49, i-ppc-85, ir-cpc-84, r-hcppc-81, h-hgc-84, hs-cagcu-84, grs-kfcg-83, ZZZ"
, update =	"98.03 bibrelex, 93.09 milone+mitchell"
}

@book{s-opgfg-91
, author =	"J. Stolfi"
, title =	"Oriented Projective Geometry: A Framework for Geometric Computations"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1991
, keywords =	"oriented projective geometry, duality, convexity, Pl{\"u}cker coordinates"
, succeeds =	"s-pcg-88"
, update =	"95.05 korneenko"
}

@phdthesis{s-pcg-88
, author =	"J. Stolfi"
, title =	"Primitives for Computational Geometry"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, month =	may
, year =	1988
, note =	"Reprinted as Technical Report 36, DEC Systems Research Center, January 1989"
, keywords =	"doctoral thesis"
, succeeds =	"s-opg-87"
, precedes =	"s-opgfg-91"
, update =	"95.05 jones"
}

@techreport{sg-nsdbt-83
, author =	"J. Stolfi and Leonidas J. Guibas"
, title =	"A note on the shortest distance between two sets of points"
, type =	"Report"
, number =	"??"
, institution =	"Xerox Palo Alto Res. Center"
, address =	"Palo Alto, CA"
, year =	1983
, update =	"98.03 mitchell"
}

@inproceedings{shs-riids-86
, author =	"M. Stonebreaker and E. Hanson and T. Sellis"
, title =	"Rule Indexing Implementations in Database Systems"
, booktitle =	"Proc. 1st Int. Conf. on Expert Database Systems"
, year =	1986
, update =	"96.09 kreveld"
}

@article{s-mncpe-84
, author =	"J. A. Storer"
, title =	"On minimal node-cost planar embeddings"
, journal =	"Networks"
, volume =	14
, year =	1984
, pages =	"181--212"
, keywords =	"approximation, graph drawing"
, succeeds =	"s-ncmeg-80"
, update =	"93.09 tamassia"
}

@inproceedings{s-ncmeg-80
, author =	"J. A. Storer"
, title =	"The node cost measure for embedding graphs on the planar grid"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
, year =	1980
, pages =	"201--210"
, keywords =	"approximation"
, precedes =	"s-mncpe-84"
}

@techreport{sr-spppo-??
, author =	"J. A. Storer and J. H. Reif"
, title =	"Shortest paths in the plane with polygonal obstacles"
, type =	"Technical {Report}"
, year =	"??"
, succeeds =	"rs-spesp-85"
, precedes =	"sr-spppo-94"
, update =	"99.07 smid, 93.09 milone+mitchell"
}

@article{sr-spppo-94
, author =	"J. A. Storer and J. H. Reif"
, title =	"Shortest paths in the plane with polygonal obstacles"
, journal =	"J. ACM"
, volume =	41
, number =	5
, year =	1994
, pages =	"982--1012"
, succeeds =	"rs-spesp-85"
, update =	"95.05 mitchell"
}

@article{s-afvio-73
, author =	"S. Storoy"
, title =	"An algorithm for finding a vector in the intersection of open convex polyhedral cones"
, journal =	"BIT"
, volume =	13
, year =	1973
, pages =	"114--119"
}

@techreport{s-ctgp-89
, author =	"Q. Stout"
, title =	"Constant-time geometry on {PRAMs}"
, type =	"Manuscript"
, institution =	"Univ. of Michigan"
, address =	"Univ. Illinois, Urbana, IL."
, year =	1989
, comments =	"talk was the Semi-Annual Lunch, Algorithms, and Dinner Symposium"
, update =	"93.09 milone+mitchell"
}

@article{s-dslpc-82
, author =	"Q. F. Stout"
, title =	"Drawing straight lines with a pyramid cellular automaton"
, journal =	"Inform. Process. Lett."
, volume =	15
, year =	1982
, pages =	"233--237"
, update =	"97.11 bibrelex"
}

@inproceedings{s-mpcig-85
, author =	"Q. F. Stout"
, title =	"Mesh and pyramid computers inspired by geometric algorithms"
, booktitle =	"Workshop on Algorithm-Guided Parallel Architectures for Automatic Target Recognition"
, year =	1985
, pages =	"293--315"
, update =	"97.11 bibrelex"
}

@article{s-pcscp-85
, author =	"Q. F. Stout"
, title =	"Pyramid computer solutions of the closest pair problem"
, journal =	"J. Algorithms"
, volume =	"??"
, year =	1985
, note =	"To appear"
, update =	"97.11 bibrelex"
}

@inproceedings{s-smsft-83
, author =	"Q. F. Stout"
, title =	"Sorting, merging, selecting, and filtering on tree and pyramid machines"
, booktitle =	"Proc. Internat. Conf. Parallel Process."
, year =	1983
, pages =	"214--221"
, update =	"97.11 bibrelex"
}

@book{skm-sgia-87
, author =	"D. Stoyan and W. S. Kendall and J. Mecke"
, title =	"Stochastic Geometry and its Applications"
, publisher =	"Akadamie-Verlag"
, address =	"Berlin, West Germany"
, year =	1987
, update =	"96.09 agarwal"
, annote =	"Contains a summary of Voronoi diagram applications in
		 a variety of areas."
}

@book{skm-sga-95
, author =	"D. Stoyan and W. S. Kendall and J. Mecke"
, title =	"Stochastic Geometry and its Applications"
, edition =	"2nd"
, publisher =	"Wiley-Interscience"
, year =	1995
, update =	"01.11 pocchiola"
, annote =	"Contains a summary of Voronoi diagram applications in
		 a variety of areas."
}

@article{ss-apror-81
, author =	"Y. G. Stoyan and S. V. Smelyakov"
, title =	"An approach to the problems of routing optimization in the regions of intricate shape"
, journal =	"Inform. Process. Lett."
, volume =	13
, year =	1981
, pages =	"39--43"
}

@article{s-mftd-83
, author =	"G. Strang"
, title =	"Maximal flow through a domain"
, journal =	"Math. Program."
, volume =	26
, year =	1983
, pages =	"123--143"
, update =	"98.03 bibrelex"
}

@article{s-wc-82
, author =	"G. Strang"
, title =	"The width of a chair"
, journal =	"Amm. Math. Monthly"
, volume =	89
, year =	1982
, pages =	"529--535"
, update =	"98.03 bibrelex"
}

@book{sf-afem-73
, author =	"G. Strang and G. Fix"
, title =	"An Alaysis of the Finite Element Method"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1973
, update =	"97.11 bibrelex"
}

@incollection{s-act-90
, author =	"Volker Strassen"
, title =	"Algebraic Complexity Theory"
, chapter =	11
, editor =	"J. van Leeuwen"
, booktitle =	"Algorithms and Complexity"
, series =	"Handbook of Theoretical Computer Science"
, volume =	"A"
, publisher =	"MIT Press"
, year =	1990
, pages =	"633--672"
, update =	"97.07 agarwal"
}

@incollection{s-c3do2-88
, author =	"W. Stra{\ss}er"
, title =	"Constructing 3${D}$ Objects from 2${D}$ Information"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"967--996"
, isbn =	"3-540-19506-8"
, update =	"93.09 held"
}

% now Bulletin of the Polish Academy of Sciences
@article{s-supgd-57
, author =	"S. Straszewicz"
, title =	"Sur un probl{\`e}me geometrique de {P}. {Erd{\H o}s}"
, journal =	"Bulletin de l'Acad{\'e}mie Polonaise des Sciences, Classe III"
, volume =	5
, year =	1957
, pages =	"39--40"
, update =	"93.09 rote"
}

@inproceedings{s-capnc-00
, author =	"I. Streinu"
, title =	"A combinatorial approach to planar non-colliding robot arm motion planning"
, booktitle =	"Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS 2000"
, site =	"Redondo Beach, California"
, publisher =	"IEEE"
, month =	nov
, year =	2000
, note =	"443--453"
, update =	"01.04 orourke+pocchiola"
}

@techreport{s-cs-96
, author =	"I. Streinu"
, title =	"Clusters of stars"
, institution =	"Dept. Comput. Sci., Smith College"
, address =	"Northampton, MA"
, year =	1996
, update =	"98.07 bibrelex"
}

@inproceedings{s-cs-97
, author =	"I. Streinu"
, title =	"Clusters of Stars"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"439--441"
, cites =	"blwsz-om-93, eos-calha-86, ehn-sisp-96, gp-sccca-84, gp-asotd-93, k-ah-92, os-vepvgcr-97, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@techreport{s-nspvg-96
, author =	"I. Streinu"
, title =	"Nonstretchable pseudo-visibility graphs"
, type =	"Technical {Report}"
, number =	055
, institution =	"Dept. Comput. Sci., Smith College"
, month =	dec
, year =	1996
, keywords =	"visibility"
, update =	"97.11 orourke"
}

@article{sk-lrmme-99
, author =	"T. Strijk and M. van Kreveld"
, title =	"Labeling a rectilinear map more efficiently"
, journal =	"Inform. Process. Lett."
, volume =	69
, year =	1999
, pages =	"25--30"
, update =	"99.07 smid"
}

@article{sw-lpc-01
, author =	"T. Strijk and A. Wolff"
, title =	"Labeling points with circles"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"181--195"
, update =	"01.07 smid"
}

@techreport{sk-smmpp-91
, author =	"D. Strip and M. Karasick"
, title =	"Solid modeling on a massively parallel processor"
, institution =	"IBM, Research Division"
, month =	feb
, year =	1991
, precedes =	"sk-smmpp-92"
, update =	"97.03 aronov, 93.09 milone+mitchell"
}

% The journal: International Journal of Supercomputer Applications
% seems not to be in "authority" file.
@article{sk-smmpp-92
, author =	"David Strip and Michael Karasick"
, title =	"Solid Modeling on a Massively Parallel Processor"
, journal =	"Internat. J. Supercomputer Appl."
, volume =	6
, year =	"Summer 1992"
, pages =	"175--92??"
, note =	"From IBM TR index: full volume/no/pages date vol. 6, no. 2, p. 175-92, Summer 1992. Entry ID 3876. Is this the report number for IBM TRs"
, succeeds =	"sk-smmpp-91"
, update =	"97.03 aronov"
}

@book{s-dg-69
, author =	"J. J. Stroker"
, title =	"Differential Geometry"
, publisher =	"Wiley-Interscience"
, year =	1969
, update =	"95.01 schwarzkopf"
}

@inproceedings{ss-kaud-88
, author =	"Th. Strothotte and J.-R. Sack"
, title =	"Knowledge Aquisition using Diagrams"
, booktitle =	"Proc. 3rd IFIP Conference on Man-Machine Systems"
, site =	"Oulo, Finland"
, year =	1988
, update =	"99.11 smid, 97.11 sack"
}

@book{s-acmi-71
, author =	"A. H. Stroud"
, title =	"Approximate Calculation of Multiple Integrals"
, publisher =	"Prentice Hall"
, year =	1971
, update =	"98.07 bibrelex"
}

@book{s-cpl-86
, author =	"B. Stroustrup"
, title =	"The {C}++ Programming Language"
, publisher =	"Addison-Wesley"
, year =	1986
, update =	"97.11 bibrelex"
}

@techreport{sr-hdced-98
, author =	"Anja Struyf and Peter J. Rousseeuw"
, title =	"Halfspace Depth Characterizes the Empirical Distribution"
, type =	"Manuscript"
, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
, year =	1998
, keywords =	"coordinate-free, multivariate ranks, robustness, AMS Classification: 62G30, 62J05"
, update =	"98.07 mitchell"
, abstract =	"
For any empirical multivariate distribution, we show that the
resulting halfspace depth function determines the distribution
completely. We do this by actually reconstructing the data points from
the depth contours. The data need not be in general
position. Moreover, we prove an analogous property for regression
depth."
}

@article{sc-ctrmh-90
, author =	"M. A. Stuff and J. N. Cederquist"
, title =	"Coordinate transformations realizable with multiple holographic optical elements"
, journal =	"J. Optical Soc. Amer."
, volume =	"A7"
, number =	6
, year =	1990
, pages =	"977--981"
, update =	"97.11 bibrelex"
}

@inproceedings{sw-ghdcl-95
, author =	"G. Stumme and R. Wille"
, title =	"A Geometrical Heuristic for Drawing Concept Lattices"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"452--459"
, keywords =	"graph drawing, order, upward"
, update =	"95.01 tamassia"
}

@techreport{s-csg-87
, author =	"B. Sturmfels"
, title =	"Computational synthetic geometry"
, type =	"Manuscript"
, institution =	"Inst. Math. Appl., Univ. Minnesota"
, address =	"Minneapolis, MN"
, year =	1987
}

@article{s-cpdoc-87
, author =	"Bernd Sturmfels"
, title =	"Cyclic polytopes and d-order curves"
, journal =	"Geom. Dedicta"
, volume =	24
, year =	1987
, pages =	"103--107"
, update =	"97.11 bibrelex"
}

@misc{s-gbcp-95
, author =	"B. Sturmfels"
, title =	"{Gr{\"o}bner} Bases and Convex Polytopes"
, month =	apr
, year =	1995
, note =	"Expanded Lecture Notes from the Holiday Symposium at New Mexico State University"
, update =	"97.11 bibrelex"
}

@article{s-gbtv-91
, author =	"B. Sturmfels"
, title =	"{Gr{\"o}bner} Bases of Toric Varieties"
, journal =	"Tohoku Math. J."
, volume =	43
, number =	2
, year =	1991
, pages =	"249--261"
, update =	"97.11 bibrelex"
}

@article{s-fcbmt-80
, author =	"M. Styness"
, title =	"On faster convergence of the bisection method for all triangles"
, journal =	"Math. Comput."
, volume =	35
, year =	1980
, pages =	"1195--1201"
, update =	"98.11 bibrelex"
}

@article{s-ncdmc-99
, author =	"C.-J. Su"
, title =	"A New Collision Detection Method for CSG-represented Objects in Virtual Manufacturing"
, journal =	"Comput. Ind."
, volume =	40
, number =	1
, year =	1999
, pages =	"1--13"
, update =	"99.11 held"
}

@phdthesis{s-epacp-94
, author =	"P. Su"
, title =	"Efficient parallel algorithms for closest point problems"
, school =	"Dartmouth College"
, year =	1994
, note =	"Number PCS-TR94-238"
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@article{sd-csdta-97
, author =	"P. Su and R. Drysdale"
, title =	"A comparison of sequential {Delaunay} triangulation algorithms"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"361--386"
, succeeds =	"sd-csdta-95"
, update =	"97.07 devillers"
}

@inproceedings{sd-csdta-95
, author =	"Peter Su and Robert L. Scot Drysdale"
, title =	"A Comparison of Sequential {Delaunay} Triangulation Algorithms"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"61--70"
, keywords =	"experimental comparison"
, cites =	"b-cgida-93, b-etsh-90, b-kdtsp-90, bwy-oetac-80, cs-arscg-89, d-fdcac-87, d-hdvdl-91, f-savd-87, gs-cdtp-78, gks-ricdv-92, gs-pmgsc-85, gs-pmgsc-85, kk-cdtmb-87, m-dtchn-84, m-eaa-86, oim-iimvd-84, s-iggp-76, sy-ricdd-90, too-natdv-83, w-smaa-78, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
}

@article{sc-ccrng-91
, author =	"Tung-Hsin Su and Ruei-Chuan Chang"
, title =	"Computing The Constrained Relative Neighborhood Graphs And Constrained Gabriel Graphs In {Euclidean} Plane"
, journal =	"Pattern Recogn. Lett."
, volume =	24
, number =	3
, year =	1991
, pages =	"221--230"
, keywords =	"constrained relative neighborhood graphs (crng), constrained gabriel graphs (cgg), euclidean plane, Delaunay triangulation"
, update =	"93.09 rote"
, annote =	"CRNG and CGG are subgraphs of CDT."
, abstract =	"The original relative neighborhood graph (RNG) and
		 Gabriel graph (GG) were defined on a vertices set in
		 the plane. In this paper, we will extend this domain to
		 a planar straight-line graph, and call this type of RNG
		 and GG the constrained relative neighborhood graph
		 (CRNG) and the constrained Gabriel graph (CGG)
		 respectively. Given a planar straight-line graph G in
		 the plane, the edges of the CRNG of G(CRNG(G)) satisfy
		 the following two properties: (1) All of the edges in G
		 (called prespecified edges) are included in the CRNG(G)
		 and the remaining edges do not properly intersect with
		 them; (2) If non-prespecified edge (p,q) belongs to the
		 CRNG(G) then either there does not exist a vertex z
		 such that d(p,z) less than d(p,q) and d(q,z) less than
		 d(p,q), or if z satisfies the above condition then z
		 must be invisible by p or q (i.e. if you draw the line
		 segments from z to p and q, then at least one of the
		 lines segments crosses a prespecified edge of G). The
		 constrained Gabriel graph is defined similarly. The
		 CRNG and CGG are the extensions of RNG and GG
		 respectively for which one can specify in advance some
		 special or important edges which must be included in
		 the outcome graph. These variants of RNG and GG provide
		 a new application for the original RNG and GG. In this
		 paper, we will show that both CRNG and CGG are
		 subgraphs of the constrained Delaunay triangulation,
		 and propose two optimal algorithms to construct them in
		 $\Theta (n \log n)$ time. (Author abstract) 14 Refs."
}

@article{sc-crnge-91
, author =	"Tung-Hsin Su and Ruei-Chuan Chang"
, title =	"On constructing the relative neighborhood graph in {Euclidean} $k$-dimensional spaces"
, journal =	"Computing"
, volume =	46
, year =	1991
, pages =	"121--130"
, keywords =	"rng"
, update =	"93.09 rote"
, annote =	"in $O(n(n \log n)^{1-2^{-(k+1)}}$ time, under some general position assumptions"
}

@inproceedings{sc-kggta-90
, author =	"T. H. Su and R. C. Chang"
, title =	"The $k$-{Gabriel} graphs and their applications"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"66--75"
}

@inproceedings{sr-prtnd-95
, author =	"Sairam Subramanian and Sridhar Ramaswamy"
, title =	"The {$P$}-range Tree: {A} New Data Structure for Range Searching in Secondary Memory"
, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1995
, pages =	"378--387"
, keywords =	"range searching, external memory algorithms"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@article{sd-csegs-91
, author =	"R. V. Subramaniyam and A. A. Diwan"
, title =	"A Counterexample for the Sufficiency of Edge Guards in Star Polygons"
, journal =	"Inform. Process. Lett."
, volume =	40
, year =	1991
, pages =	"97--99"
, update =	"98.11 bibrelex"
}

@phdthesis{s-aasmp-91
, author =	"R. Subramonian"
, title =	"Asynchronous Algorithms for Shared Memory Parallel Computers"
, type =	"Ph.{D}. Thesis"
, school =	"Univ. California, Davis"
, year =	1991
, keywords =	"doctoral thesis"
, update =	"96.09 orourke"
}

@inproceedings{s-dsaap-92
, author =	"R. Subramonian"
, title =	"Designing synchronous algorithms for asynchronous processors"
, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
, year =	1992
, pages =	"189--198"
, update =	"96.09 orourke"
}

@article{sr-facsv-90
, author =	"S. Sudarshan and C. P. Rangan"
, title =	"A fast algorithm for computing sparse visibility graphs"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"201--214"
, keywords =	"visibility graphs, segments, two-dimensional"
, annote =	"$O(|E| \log^{2} n)$ time, $O(n)$ space"
}

@article{s-rcaic-94
, author =	"Kokichi Sugihara"
, title =	"A robust and consistent algorithm for intersecting convex polyhedra"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	3
, year =	1994
, pages =	"45--54"
, note =	"Proc. EUROGRAPHICS '94"
, keywords =	"solid modeling, convexity, polyhedra, robustness, intersection"
, update =	"95.09 korneenko"
}

@article{s-smane-92
, author =	"K. Sugihara"
, title =	"A Simple Method for Avoiding Numerical Errors and Degeneracy in {Voronoi} Diagram Construction"
, journal =	"IEICE Trans. Fundamentals"
, volume =	"E75-A"
, number =	4
, month =	apr
, year =	1992
, pages =	"468--477"
, update =	"93.09 held"
}

@incollection{s-acvd-92
, author =	"K. Sugihara"
, title =	"Algorithms for computing {Voronoi} diagrams"
, editor =	"A. Okabe and B. Boots and K. Sugihara"
, booktitle =	"Spatial Tesselations: Concepts and Applications of Voronoi Diagrams"
, publisher =	"John Wiley \& Sons"
, address =	"Chichester, UK"
, year =	1992
, update =	"98.07 bibrelex"
}

@article{s-acaal-84
, author =	"K. Sugihara"
, title =	"An algebraic and combinatorial approach to the analysis of line drawings of polyhedra"
, journal =	"Discrete Appl. Math."
, volume =	9
, year =	1984
, pages =	"77--104"
, update =	"97.11 bibrelex"
}

@techreport{s-aefsm-87t
, author =	"K. Sugihara"
, title =	"An approach to error-free solid modeling"
, type =	"Note"
, institution =	"Inst. Math. Appl., Univ. Minnesota"
, address =	"Minneapolis, MN"
, year =	1987
, update =	"98.03 bibrelex"
}

@incollection{s-aefsm-87
, author =	"K. Sugihara"
, title =	"An approach to error-free solid modeling"
, booktitle =	"IMA Summer Program on Robotics"
, publisher =	"Institute for Mathematics and Applications, University of Minnesota"
, address =	""
, year =	1987
, update =	"98.03 bibrelex"
}

@article{s-iabdt-92
, author =	"Kokichi Sugihara"
, title =	"An Intersection Algorithm Based On {Delaunay} Triangulation"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	12
, number =	2
, month =	mar
, year =	1992
, pages =	"59--67"
, keywords =	"Delaunay triangulation, computational geometry"
, abstract =	"A robust method for finding points of intersection of
		 line segments in a 2- D plane is presented. The plane
		 is subdivided by Delaunay triangulation to localize
		 areas where points of intersection exist and to
		 guarantee the topological consistency of the resulting
		 arrangement. The subdivision is refined by inserting
		 midpoints recursively until the areas containing points
		 of intersection are sufficiently localized. The method
		 is robust in the sense that it does not miss points of
		 intersection that are easily detectable when costly
		 line-pair checking is performed. The algorithm is
		 adaptive in the sense that most of the computational
		 cost is incurred for the areas where finding points of
		 intersection is difficult. 6 Refs."
}

@article{s-nadcp-84
, author =	"K. Sugihara"
, title =	"An $n \log n$ algorithm for determining the congruity of polyhedra"
, journal =	"J. Comput. Syst. Sci."
, volume =	29
, year =	1984
, pages =	"36--47"
}

@article{s-agvdo-93
, author =	"K. Sugihara"
, title =	"Approximation of generalized {Voronoi} Diagrams by ordinary {Voronoi} diagrams"
, journal =	"CVGIP: Graph. Models Image Process."
, volume =	55
, year =	1993
, pages =	"522--531"
, update =	"94.05 smid"
}

@inproceedings{s-lrusv-88
, author =	"K. Sugihara"
, title =	"Location of a Robot Using Sparse Visual Information"
, editor =	"R. Bolles and B. Roth"
, booktitle =	"Robotics Research -- The Fourth Internat. Sympos."
, year =	1988
, pages =	"319--326"
, update =	"93.09 held"
}

%, editor =	"P. H. Winston and M. Brady"
@book{s-mild-86
, author =	"K. Sugihara"
, title =	"Machine Interpretation of Line Drawings"
, series =	"MIT Press Series in Artificial Intelligence"
, publisher =	"MIT Press"
, year =	1986
, isbn =	"0-262-19254-3"
, update =	"93.09 held"
}

@techreport{s-msldp-81
, author =	"K. Sugihara"
, title =	"Mathematical structures of line drawings of polyhedra - toward man-machine commonication by means of line drawings"
, institution =	"Nagoya University"
, year =	1981
, update =	"97.11 bibrelex"
}

@techreport{s-fprgo-87
, author =	"K. Sugihara"
, title =	"On finite precision representations of geometric objects"
, type =	"Res. {Memo}"
, number =	"RMI 87-06"
, institution =	"Dept. Math. Engrg., Univ. Tokyo"
, address =	"Tokyo, Japan"
, year =	1987
, update =	"98.03 bibrelex"
}

@article{s-fprgo-89
, author =	"K. Sugihara"
, title =	"On finite-precision representations of geometric objects"
, journal =	"J. Comput. Syst. Sci."
, volume =	39
, year =	1989
, pages =	"236--247"
}

@incollection{s-rpld-88
, author =	"K. Sugihara"
, title =	"Realizability of polyhedrons from line drawings"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"177--206"
, update =	"93.09 held"
, annote =	"sehr ausfuehrlich mit vielen referenzen"
}

@article{s-rgwtd-93
, author =	"Kokichi Sugihara"
, title =	"Robust gift-wrapping for the three-dimensional convex hull"
, journal =	"J. Comput. Syst. Sci."
, volume =	"??"
, year =	1993
, note =	"to appear"
, update =	"98.11 bibrelex"
}

@article{s-slprn-88
, author =	"K. Sugihara"
, title =	"Some Location Problems for Robot Navigation Using a Single Camera"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	42
, year =	1988
, pages =	"112--129"
, update =	"93.09 held"
}

@inproceedings{s-tcarc-92
, author =	"K. Sugihara"
, title =	"Topologically Consistent Algorithms Related to Convex Polyhedra"
, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '92"
, series =	"Lecture Notes Comput. Sci."
, volume =	650
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"209--218"
, update =	"94.09 smid, 93.09 milone+mitchell"
}

@article{s-vdr-92
, author =	"K. Sugihara"
, title =	"Voronoi diagrams in a river"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	1
, year =	1992
, pages =	"29--48"
, keywords =	"Generalized Voronoi diagram, boat-sail distance, smallest hitting circle, forest of cones, plane sweep algorithm"
}

@inproceedings{sh-hdddg-97
, author =	"Kokichi Sugihara and Tetsuya Hiroshima"
, title =	"How to Draw a {Delaunay} Diagram with a Given Topology"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"13--15"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{si-w3dtd-95
, author =	"K. Sugihara and H. Inagaki"
, title =	"Why is the 3{D} {Delaunay} triangulation difficult to construct?"
, journal =	"Inform. Process. Lett."
, volume =	54
, year =	1995
, pages =	"275--280"
, update =	"95.09 smid"
}

@inproceedings{si-nsmvd-88
, author =	"K. Sugihara and M. Iri"
, title =	"A numerically stable method for {Voronoi} diagram construction"
, booktitle =	"Proc. of the 1988 Fall Conf. of the Operations Research Soc. of Japan"
, site =	"Tokyo"
, month =	sep
, year =	1988
, pages =	"20--21"
, update =	"98.11 bibrelex"
}

@article{si-rtoia-94
, author =	"K. Sugihara and M. Iri"
, title =	"A robust Topology-Oriented Incremental algorithm for {Voronoi} diagrams"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	4
, number =	2
, year =	1994
, pages =	"179--228"
, keywords =	"Voronoi diagram, robust algorithm, topology oriented method, incremental construction, combinatorial abstraction, asymptotic correctness"
, succeeds =	"si-toimc-89"
, update =	"98.07 tamassia, 96.09 devillers"
}

@article{si-smsft-89
, author =	"K. Sugihara and M. Iri"
, title =	"A Solid Modelling System Free from Topological Inconsistency"
, journal =	"J. Inform. Proc."
, volume =	12
, number =	4
, year =	1989
, pages =	"380--393"
, update =	"93.09 held"
}

@techreport{si-cvdom-89
, author =	"K. Sugihara and M. Iri"
, title =	"Construction of the {Voronoi} Diagram for One Million Generators in Single-Precision Arithmetic"
, number =	"RMI 89-05"
, institution =	"Dept. Mathematical Eng., U. Tokyo"
, address =	"Tokyo 113, Japan"
, month =	aug
, year =	1989
, keywords =	"numerical precision, stability, robustness"
, update =	"93.09 held"
}

@article{si-cvdom-92
, author =	"K. Sugihara and M. Iri"
, title =	"Construction of the {Voronoi} Diagram for `One Million' Generators in Single-Precision Arithmetic"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1471--1484"
, update =	"93.09 held"
}

@inproceedings{si-cvd10-89
, author =	"K. Sugihara and M. Iri"
, title =	"Construction of the {Voronoi} diagram for over $10^{5}$ generators in single-precision arithmetic"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, month =	aug
, year =	1989
, pages =	42
, update =	"98.07 bibrelex"
}

@techreport{si-gafpa-88
, author =	"K. Sugihara and M. Iri"
, title =	"Geometric Algorithms in Finite-Precision Arithmetic"
, type =	"Research Memorandum"
, number =	"88-10"
, institution =	"Math. Eng. and Physics Dept., U. of Tokyo, Japan"
, month =	sep
, year =	1988
, note =	"Presented at 13th Int. Sympos. Math. Prog, Tokyo, Aug 29-Sep 2, 1988"
, keywords =	"numerical precision, stability, robustness"
, update =	"98.11 bibrelex, 93.09 held"
}

@techreport{si-toimc-89
, author =	"K. Sugihara and M. Iri"
, title =	"Topology-Oriented Incremental Method for Constructing {Voronoi} Diagrams Robust against Numerical Errors"
, number =	"RMI 89-02"
, institution =	"Dept. Mathematical Eng., U. Tokyo"
, address =	"Tokyo 113, Japan"
, year =	1989
, keywords =	"numerical precision, stability, robustness"
, precedes =	"si-rtoia-94"
, update =	"96.09 devillers, 93.09 held"
}

@article{si-tdpga-89
, author =	"K. Sugihara and M. Iri"
, title =	"Two Design Principles of Geometric Algorithms in Finite-Precision Arithmetic"
, journal =	"Appl. Math. Lett."
, volume =	2
, number =	2
, year =	1989
, pages =	"203--206"
, keywords =	"numerical precision, stability, robustness"
, update =	"93.09 held"
}

@techreport{si-vrm-89
, author =	"K. Sugihara and M. Iri"
, title =	"{Voronoi2} Reference Manual"
, number =	"RMI 89-04"
, institution =	"Dept. Mathematical Eng., U. Tokyo"
, address =	"Tokyo 113, Japan"
, month =	sep
, year =	1989
, update =	"93.09 held"
}

@article{siii-toiar-00
, author =	"K. Sugihara and M. Iri and H. Inagaki and T. Imai"
, title =	"Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms"
, journal =	"Algorithmica"
, volume =	27
, number =	1
, year =	2000
, pages =	"5--20"
, update =	"00.11 smid, 00.07 held"
}

@inproceedings{soi-toari-90
, author =	"K. Sugihara and Y. Ooishi and T. Imai"
, title =	"Topology-oriented approach to robustness and its applications to several {Voronoi}-diagram algorithms"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"36--39"
, cites =	"si-cvd10-89, kk-cdtmb-88, o-nridc-90, i-nracv-89, ZZZ"
, update =	"98.07 bibrelex"
}

@article{ssy-ssp-90
, author =	"K. Sugihara and I. Suzuki and M. Yamashita"
, title =	"The searchlight scheduling problem"
, journal =	"SIAM J. Comput."
, volume =	19
, number =	6
, year =	1990
, pages =	"1024--1040"
, update =	"98.07 bibrelex"
}

@article{s-cagd-87
, author =	"K. Sugiyama"
, title =	"A Cognitive Approach for Graph Drawing"
, journal =	"Cybernetics and Systems: An International Journal"
, volume =	18
, year =	1987
, pages =	"447--488"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{s-rrddl-84
, author =	"K. Sugiyama"
, title =	"A Readability Requirement on Drawing Digraphs: Level Assignment and Edge Removal for Reducing the Total Length of Lines"
, number =	45
, institution =	"Internat. Inst. for Advanced Study of Social Information Science"
, month =	mar
, year =	1984
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{s-aurdd-85
, author =	"K. Sugiyama"
, title =	"Achieving Uniqueness Requirement in Drawing Digraphs: Optimum Code Algorithm and Hierarchic Isomorphism"
, number =	58
, institution =	"Internat. Inst. for Advanced Study of Social Information Science"
, month =	jul
, year =	1985
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{sm-sumdg-95
, author =	"K. Sugiyama and K. Misue"
, title =	"A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"364--375"
, keywords =	"graph drawing, force-directed, system"
, update =	"95.01 tamassia"
}

@article{sm-gdmsm-95
, author =	"K. Sugiyama and K. Misue"
, title =	"Graph Drawing by the Magnetic Spring Model"
, journal =	"J. Visual Lang. Comput."
, volume =	6
, number =	3
, year =	1995
, pages =	"217--231"
, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
, keywords =	"graph drawing, 3D, system, software visualization"
, succeeds =	"sm-sumdg-95"
, update =	"98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
}

% K. Sugiyama and K. Misue "Visualizing Structural Information:,
% Hierarchical Drawing of a Compound Digraph",
% IEEE Transactions on Systems Man and Cybernetics,
% Vol. 23, number = 2 1991
@article{sm-vsiad-91
, author =	"K. Sugiyama and K. Misue"
, title =	"Visualization of Structural Information: Automatic Drawing of Compound Digraphs"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	21
, number =	4
, year =	1991
, pages =	"876--892"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{stt-mvuhs-81
, author =	"K. Sugiyama and S. Tagawa and M. Toda"
, title =	"Methods for Visual Understanding of Hierarchical Systems"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-11"
, number =	2
, year =	1981
, pages =	"109--125"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{st-siucs-85
, author =	"K. Sugiyama and M. Toda"
, title =	"Structuring Information for Understanding Complex Systems: {A} Basis for Decision Making"
, journal =	"Fujitsu Scientific and Technical Journal"
, volume =	21
, number =	2
, year =	1985
, pages =	"144--164"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ss-vdpar-88
, author =	"S.-H. Suh and K. G. Shin"
, title =	"A variational dynamic programming approach to robot-path planning with a distance-safety criterion"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	4
, number =	3
, year =	1988
, pages =	"334--349"
, update =	"93.09 milone+mitchell"
}

@article{sl-nmtpg-90
, author =	"Y. S. Suh and K. Lee"
, title =	"{NC} Milling Tool Path Generation for Arbitrary Pockets Defined by Sculptured Surfaces"
, journal =	"Comput. Aided Design"
, volume =	22
, number =	5
, month =	jun
, year =	1990
, pages =	"273--284"
, update =	"93.09 held"
}

@incollection{sf-amgfe-72
, author =	"J. Suhara and J. Fukuda"
, title =	"Automatic Mesh Generation for Finite Element Analysis"
, editor =	"J. T. Oden and R. W. Clough and Y. Yamamoto"
, booktitle =	"Advances in Computational Methods in Structural Mechanics and Design"
, publisher =	"UAU Press"
, address =	"Huntsville, AL"
, year =	1972
, pages =	"607--624"
, annote =	"Adds points to interior and then triangulates."
}

@article{swm-ccr-95
, author =	"G. F. Sullivan and D. S. Wilson and G. M. Masson"
, title =	"Certification of Computational Results"
, journal =	"IEEE Trans. Comput."
, volume =	44
, number =	7
, year =	1995
, pages =	"833--847"
, update =	"97.03 tamassia"
}

@article{sl-cssbr-87
, author =	"K. Sun and V. J. Lumelsky"
, title =	"Computer Simulation of Sensor-Based Robot Collision Avoidance in an Unknown Environment"
, journal =	"Robotica"
, volume =	5
, number =	4
, year =	1987
, pages =	"291--302"
}

@article{s-dspca-85
, author =	"K. J. Supowit"
, title =	"Decomposing a set of points into chains, with applications to permutation and circle graphs"
, journal =	"Inform. Process. Lett."
, volume =	21
, year =	1985
, pages =	"249--252"
, keywords =	"decomposition"
}

@incollection{s-ghsgc-83
, author =	"Kenneth J. Supowit"
, title =	"Grid Heuristics for some Geometric Covering Problems"
, editor =	"Franco P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1983
, pages =	"215--233"
, keywords =	"balls, $d$-dimensional, covering, heuristics"
, update =	"01.04 icking"
}

@inproceedings{s-ntsdc-90
, author =	"K. J. Supowit"
, title =	"New techniques for some dynamic closest-point and farthest-point problems"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"84--90"
}

@article{s-rngam-83
, author =	"K. J. Supowit"
, title =	"The relative neighborhood graph with an application to minimum spanning trees"
, journal =	"J. ACM"
, volume =	30
, number =	3
, year =	1983
, pages =	"428--448"
, keywords =	"plane-sweep, pattern recognition, Delaunay triangulations, minimum spanning trees, polygons, convex"
, update =	"98.11 bibrelex"
}

@techreport{s-tcg-81
, author =	"K. J. Supowit"
, title =	"Topics in computational geometry"
, type =	"Report"
, number =	"UIUCDCS-R-81-1062"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1981
, keywords =	"matchings, worst-case analysis, average-case analysis, plane-sweep"
}

@article{sr-dchmw-83
, author =	"K. J. Supowit and E. M. Reingold"
, title =	"Divide-and-conquer heuristics for minimum weighted {Euclidean} matching"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"118--143"
, keywords =	"matchings, worst-case analysis, divide-and-conquer"
}

@article{sr-cdtn-83
, author =	"K. J. Supowit and E. M. Reingold"
, title =	"The Complexity of Drawing Trees Nicely"
, journal =	"Acta Inform."
, volume =	18
, year =	1983
, pages =	"377--392"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{srp-tspmm-83
, author =	"K. J. Supowit and E. M. Reingold and D. A. Plaisted"
, title =	"The traveling salesman problem and minimum matching in the unit square"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"144--156"
, keywords =	"traveling salesman tours, matchings, worst-case analysis"
}

@inproceedings{ssbt-sbpsd-00
, author =	"Tatiana Surazhsky and Vitaly Surazhsky and Gill Barequet and Ayellet Tal"
, title =	"Smooth Blending of Polygonal Slices with Different Topologies"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"40--44"
, update =	"00.03 bibrelex"
}

@inproceedings{sg-mptpu-00
, author =	"Vitaly Surazhsky and Craig Gotsman"
, title =	"Morphing Planar Triangulations and Polygons Using Convex Representations"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"31--34"
, update =	"00.03 bibrelex"
}

@article{sv-ncdma-94
, author =	"K. Suresh and H. B. Voelcker"
, title =	"New challenges in dimensional metrology: {A} case study based on ``size''"
, journal =	"Manufacturing Review"
, volume =	7
, number =	4
, year =	1994
, pages =	"292--303"
, update =	"98.03 agarwal"
}

@article{s-ltaml-86
, author =	"Subhash Suri"
, title =	"A linear time algorithm for minimum link paths inside a simple polygon"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	35
, year =	1986
, pages =	"99--110"
, update =	"98.03 mitchell"
}

@techreport{s-pptld-86
, author =	"S. Suri"
, title =	"A polygon partitioning technique for link distance problems"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	nov
, year =	1986
, update =	"98.03 bibrelex"
}

@techreport{s-cagfn-86
, author =	"S. Suri"
, title =	"Computing all geodesic furthest neighbors of a simple polygon"
, type =	"Manuscript"
, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, month =	nov
, year =	1986
, update =	"98.03 bibrelex"
}

@article{s-cgfns-89
, author =	"Subhash Suri"
, title =	"Computing geodesic furthest neighbors in simple polygons"
, journal =	"J. Comput. Syst. Sci."
, volume =	39
, year =	1989
, pages =	"220--235"
, succeeds =	"s-agfnp-87"
, update =	"98.03 mitchell"
}

@techreport{s-cesl-85
, author =	"Subhash Suri"
, title =	"Computing the envelope of a set of lines"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1985
, update =	"98.03 mitchell"
}

@techreport{s-cgdsp-86
, author =	"Subhash Suri"
, title =	"Computing the geodesic diameter of a simple polygon"
, type =	"Report"
, number =	"JHU-EECS-86/08"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1986
, update =	"98.03 mitchell"
}

@techreport{s-cldsp-86
, author =	"Subhash Suri"
, title =	"Computing the link diameter of a simple polygon"
, type =	"Report"
, number =	"JHU-EECS-86/09"
, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1986
, update =	"98.03 mitchell, 93.05 smid"
}

@phdthesis{s-mlppr-87
, author =	"Subhash Suri"
, title =	"Minimum link paths in polygons and related problems"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1987
, keywords =	"doctoral thesis"
, update =	"98.03 mitchell"
}

@article{s-ldpsp-88
, author =	"S. Suri"
, title =	"On some link distance problems in a simple polygon"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, number =	1
, year =	1988
, pages =	"108--113"
, precedes =	"s-sldps-90"
, update =	"98.07 bibrelex"
}

@article{s-sldps-90
, author =	"Subhash Suri"
, title =	"On Some Link Distance Problems in a Simple Polygon"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, year =	1990
, pages =	"108--113"
, succeeds =	"s-ldpsp-88"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@incollection{s-p-97
, author =	"Subhash Suri"
, title =	"Polygons"
, chapter =	23
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"429--444"
, update =	"98.03 mitchell, 97.11 orourke"
}

@inproceedings{s-agfnp-87
, author =	"Subhash Suri"
, title =	"The all-geodesic-furthest neighbors problem for simple polygons"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"64--75"
, precedes =	"s-cgfns-89"
, cites =	"akmsw-gamsa-86, art-lbcpr-87, at-cgcsp-86, atb-mdcp-82, c-tpca-82, cg-vippg-85, gh-ospqs-87, ghlst-ltavs-86, gjpt-tsp-78, hm-ftsp-83, lm-gmqia-84, lp-annpc-78, lp-esppr-84, p-msc-77, ps-cgcsp-86, rs-mtdmi-85, sh-cpp-75, t-safnp-83, t-cgpp-86, tb-gatuf-81, tv-otats-86, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@inproceedings{shh-cdasb-98
, author =	"Subhash Suri and Philip M. Hubbard and John F. Hughes"
, title =	"Collision Detection in Aspect and Scale Bounded Polyhedra"
, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '98"
, year =	1998
, pages =	"127--136"
, update =	"99.07 bibrelex, 98.07 mitchell"
}

@techreport{so-fmnp-85t
, author =	"Subhash Suri and J. O'Rourke"
, title =	"Finding Minimal Nested Polygons"
, type =	"Technical {Report}"
, institution =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1985
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{so-fmnp-85
, author =	"Subhash Suri and J. O'Rourke"
, title =	"Finding minimal nested polygons"
, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
, year =	1985
, pages =	"470--479"
, keywords =	"packing, visibility"
, update =	"98.03 mitchell"
}

@techreport{so-wcoac-85
, author =	"Subhash Suri and J. O'Rourke"
, title =	"Worst-case optimal algorithms for constructing visibility polygons with holes"
, institution =	"Johns Hopkins Univ."
, year =	1985
, precedes =	"so-wcoac-86"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{so-wcoac-86
, author =	"Subhash Suri and J. O'Rourke"
, title =	"Worst-case optimal algorithms for constructing visibility polygons with holes"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"14--23"
, keywords =	"visibility"
, succeeds =	"so-wcoac-85"
, cites =	"aaghi-vpses-85, c-iies-84, cg-vippg-85, e-eacwv-84, ea-lacvp-81, ghlst-ltavs-86, aaghi-vdp-86, ll-cvpe-86, m-wcohs-87, w-cvgnl-85, so-wcoac-85, g-ttn-66, ZZZ"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@inproceedings{s-s3dpp-95
, author =	"H. J. Sussman"
, title =	"Shortest 3-Dimensional Paths with a Prescribed Curvature Bound"
, booktitle =	"Proc. 34th IEEE Conf. Decision Control"
, year =	1995
, pages =	"3306--3311"
, keywords =	"curvature-constrained shortest paths"
, update =	"98.03 mitchell"
}

@techreport{st-sprsc-91
, author =	"H. J. Sussmann and G. Tang"
, title =	"Shortest paths for the {Reeds-Shepp} car: {A} worked out example of the use of geometric techniques in nonlinear optimal control"
, type =	"Research {Report}"
, number =	"SYCON-91-10"
, institution =	"Rutgers University"
, address =	"New Brunswick, NJ"
, year =	1991
, update =	"98.03 mitchell, 93.09 erickson"
}

@phdthesis{s-smmgc-63
, author =	"I. E. Sutherland"
, title =	"Sketchpad: {A} man-machine graphical communication system"
, school =	"Massachusetts Inst. Tech."
, address =	"Cambridge, MA"
, month =	jan
, year =	1963
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{sh-rpc-74
, author =	"I. E. Sutherland and G. W. Hodgman"
, title =	"Reentrant polygon clipping"
, journal =	"Commun. ACM"
, volume =	17
, year =	1974
, pages =	"32--42"
}

@article{sss-cthsa-74
, author =	"I. E. Sutherland and R. F. Sproull and R. A. Schumacker"
, title =	"A Characterization of Ten Hidden-Surface Algorithms"
, journal =	"ACM Comput. Surv."
, volume =	6
, number =	1
, month =	mar
, year =	1974
, pages =	"1--55"
, update =	"96.01 tamassia, 93.09 held"
}

@inproceedings{s-iafvd-89
, author =	"A. Suzuki"
, title =	"An incremental algorithm for the farthest {Voronoi} diagram"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	43
}

@article{si-atpvd-86
, author =	"A. Suzuki and M. Iri"
, title =	"Approximation of a tessellation of the plane by a {Voronoi} diagram"
, journal =	"J. Oper. Res. Soc. Japan"
, volume =	29
, year =	1986
, pages =	"69--96"
, update =	"94.09 bernal"
}

@inproceedings{san-fsfpg-90
, author =	"H. Suzuki and T. Akama and T. Nishizeki"
, title =	"Finding {Steiner} forests in planar graphs"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"444--453"
}

@article{sy-dmlra-96
, author =	"I. Suzuki and M. Yamashita"
, title =	"Designing multi-link robot arms in a convex polygon"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	6
, year =	1996
, pages =	"461--486"
, update =	"97.03 devillers"
}

@article{sy-smipr-92
, author =	"I. Suzuki and M. Yamashita"
, title =	"Searching for a mobile intruder in a polygonal region"
, journal =	"SIAM J. Comput."
, volume =	21
, year =	1992
, pages =	"863--888"
}

@article{so-mpclr-95
, author =	"Petr {\v S}vestka and Mark H. Overmars"
, title =	"Motion Planning for Car-Like Robots Using a Probabilistic Learning Approach"
, journal =	"Internat. J. Robot. Res."
, volume =	16
, number =	2
, month =	apr
, year =	1997
, pages =	"119--143"
, update =	"98.03 mitchell"
}

@inproceedings{sv-emptt-95
, author =	"Petr {\v S}vestka and Jules Vleugels"
, title =	"Exact Motion Planning for Tractor-Trailer Robots"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1995
, pages =	"2445--2450"
, update =	"00.03 bibrelex, 97.11 oostrum"
}

@inproceedings{s-oardc-93
, author =	"Kurt Swanson"
, title =	"An Optimal Algorithm for Roundness Determination on Convex Polygons"
, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"601--609"
, update =	"96.05 agarwal, 93.09 smid, 93.05 jones"
}

@article{slw-oardc-95
, author =	"K. Swanson and D. T. Lee and Vanban L. Wu"
, title =	"An optimal algorithm for roundness determination on convex polygons"
, journal =	"Comput. Geom. Theory Appl."
, volume =	5
, year =	1995
, pages =	"225--235"
, update =	"96.09 devillers+orourke"
}

@techreport{s-otafb-80
, author =	"G. F. Swart"
, title =	"An {$O(\log n)$} time algorithm for finding bridge points of convex arcs"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Washington"
, address =	"Seattle, WA"
, year =	1980
}

@article{s-fchff-85
, author =	"G. F. Swart"
, title =	"Finding the convex hull facet by facet"
, journal =	"J. Algorithms"
, volume =	6
, year =	1985
, pages =	"17--48"
}

@article{sp-cppca-92
, author =	"P. E. Sweeney and E. R. Paternoster"
, title =	"Cutting and packing problems: {A} categorized, application-orientated research bibliography"
, journal =	"J. Oper. Res. Society"
, volume =	43
, number =	7
, year =	1992
, pages =	"691--706"
, update =	"98.03 bibrelex"
}

@techreport{s-eepe-78
, author =	"R. E. Sweet"
, title =	"Empirical Estimates of Program Entropy"
, number =	"STAN-CS-78-698"
, institution =	"Department of Computer Science, Stanford University"
, year =	1978
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{s-nlpcc-74
, author =	"H. P. F. Swinnerton-Dyer"
, title =	"The number of lattice points on a convex curve"
, journal =	"J. Number Theory"
, volume =	6
, year =	1974
, pages =	"128--135"
, update =	"97.11 bibrelex"
}

@article{ssu-congo-88
, author =	"J. B. Sydney and S. J. Sydney and J. Urrutia"
, title =	"Circle orders, $n$-gon orders and the crossing number for partial orders"
, journal =	"Order"
, volume =	5
, year =	1988
, pages =	"1--10"
, update =	"98.03 bibrelex"
}

@article{s-qgs-57
, author =	"J. J. Sylvester"
, title =	"A question on the geometry of situation"
, journal =	"Quart. J. Math."
, volume =	1
, year =	1857
, pages =	79
}

@article{s-mq1-93
, author =	"J. J. Sylvester"
, title =	"Mathematical question 11851"
, journal =	"Educational Times"
, volume =	59
, year =	1893
, pages =	98
, update =	"98.03 devillers"
}

@article{s-pavsf-60
, author =	"J. J. Sylvester"
, title =	"On {Poncelet}'s approximate valuation of surd forms"
, journal =	"Philos. Magazine"
, volume =	"XX"
, year =	1860
, pages =	"203--222"
}

@article{s-rlttc-87
, author =	"S. Szab{\'o}"
, title =	"A reduction of lattice tiling by translates of a cubical cluster"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"33--36"
}

@article{s-cnhep-97
, author =	"L. A. Sz{\'e}kely"
, title =	"Crossing numbers and hard {E}rd{\H o}s problems in discrete geometry"
, journal =	"Combinatorics, Probability and Computing"
, volume =	6
, year =	1997
, pages =	"353--358"
, update =	"01.04 smid, 98.03 agarwal+devillers, 97.11 aronov"
}

@article{st-smops-92
, author =	"R. Szeliski and D. Tonnesen"
, title =	"Surface modeling with oriented particle systems"
, journal =	"Comput. Graph."
, volume =	26
, number =	2
, month =	jul
, year =	1992
, pages =	"185--194"
, update =	"98.07 bibrelex"
}

@article{s-pds-74
, author =	"E. Szemer\'{e}di"
, title =	"On a problem of {Davenport and Schinzel}"
, journal =	"Acta Arithmetica"
, volume =	25
, year =	1974
, pages =	"213--224"
, update =	"95.09 agarwal"
}

@article{st-cdbep-83
, author =	"E. Szemer{\'e}di and W. {Trotter, Jr.}"
, title =	"A combinatorial distinction between {E}uclidean and projective planes"
, journal =	"European J. Combin."
, volume =	4
, year =	1983
, pages =	"385--394"
, update =	"98.03 agarwal"
}

@article{st-epdg-83
, author =	"E. Szemer{\'e}di and W. {Trotter, Jr.}"
, title =	"Extremal problems in discrete geometry"
, journal =	"Combinatorica"
, volume =	3
, year =	1983
, pages =	"381--392"
, update =	"97.11 bibrelex"
}

@incollection{s-dladg-94
, author =	"L{\'a}szl{\'o} Szirmay-Kalos"
, title =	"Dynamic Layout Algorithm to Display General Graphs"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"505--517"
, keywords =	"cartography, layout, graph visualization, physically-based methods"
, update =	"94.09 heckbert"
, annote =	"Gives code that finds aesthetic arrangements for a graph.
This could be used to graphically display data structures. Contains C++
code."
}

@inproceedings{s-hctoc-86
, author =	"H. Szu"
, title =	"Holographic coordinate transformations and optical computing"
, booktitle =	"Optical and Hybrid Computing, Proc. SPIE"
, volume =	634
, year =	1986
, pages =	"480--484"
, update =	"98.11 bibrelex"
}

@article{skr-ebecs-01
, author =	"A. Szymczak and D. King and J. Rossignac"
, title =	"An {Edgebreaker-based} efficient compression scheme for regular meshes"
, journal =	"Comput. Geom. Theory Appl."
, volume =	20
, year =	2001
, pages =	"53--68"
, update =	"01.11 smid"
}

@book{t-b-95
, author =	"Serge Tabachnikov"
, title =	"Billiards"
, series =	"Panoramas et Synth\'eses"
, publisher =	"Soci\'et\'e Math\'ematique de France"
, year =	1995
, update =	"01.04 orourke"
}

@unpublished{t-ntasa-94
, author =	"B. Tagansky"
, title =	"A new technique for analyzing substructures in arrangements"
, year =	1994
, note =	"Unpublished manuscript, Tel-Aviv University"
, update =	"95.01 orourke"
}

@inproceedings{t-ntasa-95
, author =	"Boaz Tagansky"
, title =	"A New Technique for Analyzing Substructures in Arrangements"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"200--210"
, keywords =	"cell complexity, zones, levels in arrangements, vertical decomposition"
, cites =	"aa-cfi-92, ass-oletd-94, aps-zsha-93, as-tsbac-90, as-car-94, ast-ucptd-97, as-tmp3s-94, bsty-vdhdc-95, ckstw-vdl3s-95, c-narsc-87, cs-arscg-89, bds-lric-94, bgh-vdt3s-94, e-acg-87, e-ueplf-89, ess-ztha-93, ghms-vdahf-95, gs-caa-93, hs-nblet-94, hs-atarr-95, hs-ndssg-86, m-cgitr-93, ps-ueplf-89, s-atubl-94, sa-dsstg-95, ws-prnds-88, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{t-ntasa-96
, author =	"Boaz Tagansky"
, title =	"A New Technique for Analyzing Substructures in Arrangements of Piecewise Linear Surfaces"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"455--479"
, succeeds =	"t-ntasa-95"
, update =	"98.03 smid, 97.11 aronov"
, annote =	"Special Issue: ACM Symposium on Computational Geometry, Vancouver"
}

@phdthesis{t-csas-96
, author =	"B. Tagansky"
, title =	"The Complexity of Substructures in Arrangements of Surfaces"
, type =	"Ph.{D}. Thesis"
, school =	"Tel Aviv University"
, address =	"Tel Aviv"
, year =	1996
, keywords =	"doctoral thesis"
, update =	"98.03 agarwal"
}

@inproceedings{tsn-fsncr-93
, author =	"Jun-ya Takahashi and Hitoshi Suzuki and Takao Nishizeki"
, title =	"Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"98--107"
, precedes =	"tsn-sncrp-97"
, update =	"98.11 devillers, 98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
}

@article{tsn-sncrp-97
, author =	"J.-Y. Takahashi and H. Suzuki and T. Nishizeki"
, title =	"Shortest Non-Crossing Rectilinear Paths in Plane Regions"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"419--436"
, succeeds =	"tsn-fsncr-93"
, update =	"98.11 devillers"
}

@inproceedings{tisku-aeccp-95
, author =	"S. Takahashi and T. Ikeda and Y. Shinagawa and T. L. Kunii and M. Ueda"
, title =	"Algorithms for extracting correct critical points and constructing topological graphs from discrete geographical elevation data"
, booktitle =	"Eurographics'95"
, volume =	14
, year =	1995
, pages =	"C--181--C--192"
, update =	"97.11 oostrum"
}

@inproceedings{ti-etpts-97
, author =	"Fumihiko Takeuchi and Hiroshi Imai"
, title =	"Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points"
, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '97"
, site =	"Shanghai, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	1276
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"470--481"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@article{to-lseec-89a
, author =	"R. Takiyama and N. Ono"
, title =	"A least square error estimation of the center and radii of concentric arcs"
, journal =	"Pattern Recogn. Lett."
, volume =	10
, year =	1989
, pages =	"237--242"
, update =	"98.11 bibrelex"
}

@inproceedings{tcd-njlsm-92
, author =	"A. Tal and B. Chazelle and D. Dobkin"
, title =	"The New-Jersey line-segment saw massacre"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, keywords =	"video review"
, update =	"98.11 bibrelex"
}

@inproceedings{td-gsvga-94
, author =	"A. Tal and D. Dobkin"
, title =	"GASP: {A} system for visualizing geometric algorithms"
, booktitle =	"Visualization '94"
, year =	1994
, update =	"98.03 bibrelex"
}

@inproceedings{td-gsfag-94
, author =	"A. Tal and D. Dobkin"
, title =	"GASP: A System to Facilitate Animating Geometric Algorithms"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"388--389"
, keywords =	"video review"
, cites =	"b-aops-94, ce-oails-92, dg-crd-94, dk-ladsc-85, dk-dsppu-90, dt-buph-93, r-mdbp-91, s-mdbp-93, s-votcb-93, ss-otcbt-93, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones"
}

@article{td-vga-95
, author =	"A. Tal and D. P. Dobkin"
, title =	"Visualization of Geometric Algorithms"
, journal =	"IEEE Trans. Visualization and Computer Graphics"
, volume =	1
, number =	2
, year =	1995
, pages =	"194--204"
, keywords =	"algorithm animation, visualization, three-dimensional geometric algorithms"
, update =	"98.07 bibrelex, 96.09 devillers, 96.01 tamassia"
, abstract =	"This paper investigates the visualization of geometric
		 algorithms. We discuss how limiting the domain makes it
		 possible to create a system that enables others to use
		 it easily. Knowledge about the domain can be very
		 helpful in building a system which automates large
		 parts of the user's task. A system can be designed to
		 isolate the user from any concern about how graphics is
		 done. The application need only specify ``what''
		 happens and need not be concerned with ``how'' to make
		 it happen on the screen. We develop a conceptual model
		 and a framework for experimenting with it. We also
		 present a system, GASP, which implements this model.
		 GASP allows quick generation of three-dimensional
		 geometric algorithm visualizations, even for highly
		 complex algorithms. It also provides a visual debugging
		 facility for geometric computing. We show the utility
		 of GASP by presenting a variety of examples."
}

@article{ta-2dfem-91
, author =	"T. K. H. Tam and C. G. Armstrong"
, title =	"2{D} Finite Element Mesh Generation By Medial Axis Subdivision"
, journal =	"Advances in Engineering Software and Workstations"
, volume =	13
, number =	"5--6"
, month =	sep
, year =	1991
, pages =	"313--324"
, keywords =	"two-dimensional finite element mesh generation, medial axis subdivisions, quadrilateral elements, Delaunay triangulation, Voronoi diagrams, transfinite mapping techniques"
, annote =	"Vd of shape is approximated by using extra points on
		 the boundary. Vd is used to decompose shape into simple
		 regions for meshing."
, abstract =	"An algorithm for the automatic generation of
		 two-dimensional finite element meshes using
		 quadrilateral elements has been demonstrated. The
		 technique uses information derived from the medial axis
		 of a 2D region, the locus of the centre of an inscribed
		 disc of maximal diameter as it rolls around the region
		 interior. Using this information, an arbitrarily
		 complex object can be subdivided into a series of
		 meshable subregions. Within these subregions relatively
		 conventional meshing patterns are then generated. The
		 resulting meshes are well structured and flow smoothly
		 round the object boundary with minimum mesh
		 irregularity. (Author abstract) 31 Refs."
}

@article{ta-femci-93
, author =	"T. K. H. Tam and C. G. Armstrong"
, title =	"Finite element mesh control by integer programming"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	36
, year =	1993
, pages =	"2581--2605"
, update =	"98.07 bibrelex"
}

@inproceedings{tt-cpgpl-97
, author =	"Hisao Tamaki and Takeshi Tokuyama"
, title =	"A Characterization of Planar Graphs by Pseudo-Line Arrangements"
, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '97"
, site =	"Singapore"
, series =	"Lecture Notes Comput. Sci."
, volume =	1350
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"123--132"
, update =	"98.07 agarwal, 98.03 agarwal+mitchell"
}

@inproceedings{tt-hcpps-95
, author =	"Hisao Tamaki and Takeshi Tokuyama"
, title =	"How to Cut Pseudo-Parabolas into Segments"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"230--237"
, keywords =	"levels"
, cites =	"a-sdcgp-85, b-gtic-79, cs-arscg-89, e-acg-87, ew-mnemf-86, e-glbpm-95, g-bpstp-79, gs-caa-93, ki-tnprc-83, ks-empac-90, kti-mmstl-92, l-roifc-75, m-gofvc-94, m-lblmp-91, s-ksacs-91, w-mt-76, w-mksfs-86, ZZZ"
, update =	"98.03 bibrelex, 95.09 agarwal+mitchell"
}

@article{tt-hcpps-98
, author =	"Hisao Tamaki and Takeshi Tokuyama"
, title =	"How to Cut Pseudo-Parabolas into Segments"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"265--290"
, update =	"98.03 agarwal"
}

@techreport{t-ddspg-87
, author =	"R. Tamassia"
, title =	"A dynamic data structure for planar graph embedding"
, type =	"Report"
, number =	"UILU-ENG-87-2265"
, institution =	"Coordinated Sci. Lab., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1987
}

@inproceedings{t-ddspg-88
, author =	"R. Tamassia"
, title =	"A Dynamic Data Structure for Planar Graph Embedding"
, editor =	"T. Lepisto and A. Salomaa"
, booktitle =	"Automata, Languages and Programming (Proc. 15th ICALP)"
, series =	"Lecture Notes Comput. Sci."
, volume =	317
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"576--590"
, update =	"94.01 tamassia"
}

@inproceedings{t-uadpl-92
, author =	"Roberto Tamassia"
, title =	"A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	39
, update =	"00.03 bibrelex"
}

@article{t-atpgd-
, author =	"R. Tamassia"
, title =	"Advances in the Theory and Practice of Graph Drawing"
, journal =	"Theoret. Comput. Sci."
, note =	"to appear"
, keywords =	"graph drawing, survey"
, update =	"98.11 tamassia"
}

@article{t-irmdp-91
, author =	"R. Tamassia"
, title =	"An incremental reconstruction method for dynamic planar point location"
, journal =	"Inform. Process. Lett."
, volume =	37
, year =	1991
, pages =	"79--83"
, keywords =	"point location, triangulation, computational geometry, planar point location"
, abstract =	"We present a fully dynamic technique for point
		 location in triangulations that allows a tradeoff
		 between query and update time, and can be used in
		 conjunction with any of the known static point location
		 data structures. Let $S$ be a triangulation whose
		 current number of vertices is $n$. We show that for any
		 smooth nondecreasing integer function $b(n)$ with $2\le
		 b(n) \le \sqrt n$, there exists a dynamic point
		 location data structure for $S$ with space $O(n)$,
		 query time $O((\log^2n)/\log b(n))$, and update time
		 $O((\log^2n)b(n)/\log b(n))$. (Author abstract) 15
		 Refs."
}

@inproceedings{t-cgd-95
, author =	"R. Tamassia"
, title =	"Constraints in Graph Drawing"
, booktitle =	"Proc. Int. Workshop on Constraints for Graphics and Visualization"
, nickname =	"CGV '95"
, year =	1995
, pages =	85
, keywords =	"graph drawing, constraints"
, update =	"96.09 tamassia"
}

@article{t-cgd-98
, author =	"R. Tamassia"
, title =	"Constraints in Graph Drawing Algorithms"
, journal =	"Constraints"
, volume =	3
, number =	1
, year =	1998
, pages =	"89--122"
, keywords =	"graph drawing, constraints, survey"
, update =	"98.11 tamassia"
}

@article{t-ds-96
, author =	"R. Tamassia"
, title =	"Data Structures"
, journal =	"ACM Comput. Surv."
, volume =	28
, number =	1
, year =	1996
, pages =	"23--26"
, url =	"http://www.cs.brown.edu/cgc/papers/t-ds-96.ps.gz"
, keywords =	"data structures, survey"
, update =	"97.03 tamassia"
}

@techreport{t-dapsg
, author =	"R. Tamassia"
, title =	"Drawing Algorithms for Planar st-Graphs"
, type =	"Technical Report"
, institution =	"Brown Univ."
, precedes =	"t-dapsg-90"
, update =	"98.11 bibrelex"
}

@article{t-dapsg-90
, author =	"R. Tamassia"
, title =	"Drawing Algorithms for Planar st-Graphs"
, journal =	"Australasian Journal of Combinatorics"
, volume =	2
, year =	1990
, pages =	"217--235"
, keywords =	"graph drawing"
, succeeds =	"t-dapsg"
, update =	"98.11 bibrelex, 93.09 tamassia"
}

@misc{t-gd-
, author =	"Roberto Tamassia"
, title =	"Graph Drawing"
, url =	"http://www.cs.brown.edu/people/rt/gd.html"
, update =	"98.07 tamassia"
}

@incollection{t-gd-97
, author =	"R. Tamassia"
, title =	"Graph Drawing"
, chapter =	44
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"815--832"
, url =	"http://www.cs.brown.edu/cgc/papers/t-gd-97.ps.gz"
, keywords =	"graph drawing, survey"
, update =	"97.11 orourke, 97.07 orourke, 97.03 tamassia"
}

@incollection{t-gd-00
, author =	"Roberto Tamassia"
, title =	"Graph Drawing"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"Elsevier Science Publishers B.V. North-Holland"
, address =	"Amsterdam"
, year =	2000
, pages =	"937--971"
, keywords =	"graph drawing, survey"
, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 tamassia, 98.07 mitchell"
, annote =	"Chapter 21 of su-hcg-00"
}

@inproceedings{t-iadse-98
, author =	"R. Tamassia"
, title =	"Implementing Algorithms and Data Structures: an Educational and Research Perspective"
, booktitle =	"Proc. Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '98"
, series =	"Lect. Not. Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1998
, update =	"98.11 tamassia"
}

@inproceedings{t-nlter-85
, author =	"R. Tamassia"
, title =	"New Layout Techniques for Entity-Relationship Diagrams"
, booktitle =	"Proc. 4th Internat. Conf. on Entity-Relationship Approach"
, year =	1985
, pages =	"304--311"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{t-eggmn-87
, author =	"R. Tamassia"
, title =	"On Embedding a Graph in the Grid with the Minimum Number of Bends"
, journal =	"SIAM J. Comput."
, volume =	16
, number =	3
, year =	1987
, pages =	"421--444"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{t-olpge-96
, author =	"R. Tamassia"
, title =	"On-Line Planar Graph Embedding"
, journal =	"J. Algorithms"
, volume =	21
, number =	2
, year =	1996
, pages =	"201--239"
, keywords =	"graph drawing, planar, embedding, dynamic"
, succeeds =	"t-ddspg-88"
, update =	"98.07 tamassia, 97.03 pocchiola+tamassia"
}

@inproceedings{t-podg-90
, author =	"R. Tamassia"
, title =	"Planar Orthogonal Drawings of Graphs"
, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
, year =	1990
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{taacddfdhopsstvw-sdcg-96
, author =	"R. Tamassia and P. Agarwal and N. Amato and D. Chen and D. Dobkin and R. Drysdale and S. Fortune and M. Goodrich and J. Hershberger and J. O'Rourke and F. P. Preparata and J.-R. Sack and S. Suri and I. Tollis and J. Vitter and S. Whitesides"
, title =	"Strategic directions in computational geometry"
, journal =	"ACM Comput. Surv."
, volume =	28
, number =	4
, year =	1996
, pages =	"591--606"
, update =	"01.11 devillers, 98.07 tamassia, 98.03 mitchell, 97.11 sack"
, annote =	"report of working group
 formed as part of ACM Workshop on Strategic Directions in Computing Research"
}

@incollection{tc-ds-
, author =	"R. Tamassia and B. Cantrill"
, title =	"Data Structures"
, editor =	"A. B. Tucker Jr."
, booktitle =	"Handbook of Computer Science and Engineering"
, publisher =	"CRC Press"
, year =	1997
, pages =	"86--110"
, url =	"http://www.cs.brown.edu/cgc/papers/tc-ds-.ps.gz"
, keywords =	"data structures, survey"
, update =	"97.03 tamassia"
}

@article{tdb-agdrd-88
, author =	"R. Tamassia and G. {Di Battista} and C. Batini"
, title =	"Automatic Graph Drawing and Readability of Diagrams"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-18"
, number =	1
, year =	1988
, pages =	"61--79"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{tlp-rpqiv-96
, author =	"R. Tamassia and G. Liotta and F. P. Preparata"
, title =	"Robust proximity queries in implicit {Voronoi} diagrams"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	1
, update =	"97.03 agarwal, 96.09 mitchell"
, annote =	"Invited Lecture by Roberto Tamassia"
}

@article{t-sdcg-96
, author =	"Roberto Tamassia and others"
, title =	"Strategic Directions in Computational Geometry"
, journal =	"ACM Comput. Surv."
, volume =	28
, number =	4
, year =	1996
, pages =	"591--606"
, url =	"http://www.cs.brown.edu/people/rt/sdcr/report.html"
, update =	"98.07 tamassia+vismara, 97.03 tamassia"
, annote =	"short form of taacddfdhopsstvw-sdcg-96"
}

@techreport{tp-dmpda-88
, author =	"R. Tamassia and F. P. Preparata"
, title =	"Dynamic maintenance of planar digraphs, with applications"
, type =	"Report"
, number =	"UILU-ENG-88-2227"
, institution =	"Coordinated Sci. Lab., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1988
, precedes =	"tp-dmpda-90"
}

@article{tp-dmpda-90
, author =	"R. Tamassia and F. P. Preparata"
, title =	"Dynamic maintenance of planar digraphs, with applications"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"509--527"
, succeeds =	"tp-dmpda-88"
}

@article{tt-uavrp-86
, author =	"R. Tamassia and I. G. Tollis"
, title =	"A Unified Approach to Visibility Representations of Planar Graphs"
, journal =	"Discrete Comput. Geom."
, volume =	1
, number =	4
, year =	1986
, pages =	"321--341"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{tt-cgvc-87
, author =	"R. Tamassia and I. G. Tollis"
, title =	"Centipede Graphs and Visibility on a Cylinder"
, editor =	"G. Tinhofer and G. Schmidt"
, booktitle =	"Graph Theoretic Concepts in Computer Science: Proc. Internat. Workshop WG '86 (Bernierd June 1986)"
, series =	"Lecture Notes Comput. Sci."
, volume =	246
, publisher =	"Springer-Verlag"
, year =	1987
, pages =	"252--263"
, keywords =	"graph drawing"
, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
}

%    xxx = Philadelphia,
@inproceedings{tt-eepgl-87
, author =	"R. Tamassia and I. G. Tollis"
, title =	"Efficient Embedding of Planar Graphs in Linear Time"
, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
, year =	1987
, pages =	"495--498"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@proceedings{tt-gd-95
, title =	"Graph Drawing (Proc. GD '94)"
, editor =	"R. Tamassia and I. G. Tollis"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, keywords =	"graph drawing"
, update =	"98.07 bibrelex+vismara, 95.01 tamassia"
}

@article{tt-pgelt-89
, author =	"R. Tamassia and I. G. Tollis"
, title =	"Planar Grid Embedding in Linear Time"
, journal =	"IEEE Trans. Circuits Syst."
, volume =	"CAS-36"
, number =	9
, year =	1989
, pages =	"1230--1234"
, keywords =	"graph drawing"
, update =	"96.09 devillers, 93.09 tamassia"
}

@techreport{tt-prgvb-85
, author =	"R. Tamassia and I. G. Tollis"
, title =	"Plane representations of graphs and visibility between parallel segments"
, type =	"Report"
, number =	"UILU-ENG 85-2215"
, institution =	"Coordinated Sci. Lab., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1985
}

@article{tt-rpdos-93
, author =	"R. Tamassia and I. G. Tollis"
, title =	"Reachability in Planar Digraphs with One Source and One Sink"
, journal =	"Theoret. Comput. Sci. A"
, volume =	119
, year =	1993
, pages =	"331--343"
, update =	"94.05 tamassia"
}

@article{tt-rgc-91
, author =	"R. Tamassia and I. G. Tollis"
, title =	"Representations of Graphs on a Cylinder"
, journal =	"SIAM J. Discrete Math."
, volume =	4
, number =	1
, year =	1991
, pages =	"139--149"
, update =	"94.01 tamassia"
}

@inproceedings{tt-trpg-89
, author =	"R. Tamassia and I. G. Tollis"
, title =	"Tessellation Representations of Planar Graphs"
, booktitle =	"Proc. 27th Allerton Conf. Commun. Control Comput."
, year =	1989
, pages =	"48--57"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@inproceedings{ttv-lbpap-91
, author =	"R. Tamassia and I. G. Tollis and J. S. Vitter"
, title =	"Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings"
, booktitle =	"Proc. IEEE Symposium on Parallel and Distributed Processing"
, year =	1991
, pages =	"386--393"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{ttv-lbpod-91
, author =	"R. Tamassia and I. G. Tollis and J. S. Vitter"
, title =	"Lower Bounds for Planar Orthogonal Drawings of Graphs"
, journal =	"Inform. Process. Lett."
, volume =	39
, year =	1991
, pages =	"35--40"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{tv-csaeg-97
, author =	"R. Tamassia and L. Vismara"
, title =	"A Case Study in Algorithm Engineering for Geometric Computing"
, type =	"Technical Report"
, number =	"CS-97-18"
, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
, month =	dec
, year =	1997
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/97/cs97-18.ps.Z"
, update =	"98.07 vismara"
}

@inproceedings{tvb-csaeg-97
, author =	"Roberto Tamassia and Luca Vismara and James E. Baker"
, title =	"A Case Study in Algorithm Engineering for Geometric Computing"
, booktitle =	"Proc. Workshop on Algorithm Engineering"
, nickname =	"WAE'97"
, site =	"Venice"
, month =	sep
, year =	1997
, pages =	"136--145"
, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap14.ps.gz"
, update =	"00.11 smid, 00.07 icking, 98.11 bibrelex, 98.07 smid+tamassia+vahrenhold+vismara, 98.03 mitchell"
}

@inproceedings{tv-ocsfc-90
, author =	"R. Tamassia and J. S. Vitter"
, title =	"Optimal Cooperative Search in Fractional Cascaded Data Structures"
, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
, year =	1990
, pages =	"307--316"
, keywords =	"point location, fractional cascading"
, precedes =	"tv-ocsfc-96"
, update =	"97.11 bibrelex, 94.05 tamassia"
}

@article{tv-ocsfc-96
, author =	"R. Tamassia and J. S. Vitter"
, title =	"Optimal Cooperative Search in Fractional Cascaded Data Structures"
, journal =	"Algorithmica"
, volume =	15
, number =	2
, year =	1996
, keywords =	"point location, fractional cascading, cooperative search"
, succeeds =	"tv-ocsfc-90"
, update =	"95.09 tamassia, 94.05 tamassia"
}

@techreport{tv-opatc-89t
, author =	"R. Tamassia and J. S. Vitter"
, title =	"Optimal parallel algorithms for transitive closure and point location in planar structures"
, type =	"Technical {Report}"
, number =	"CS-89-20"
, institution =	"Dept. Comput. Sci., Brown Univ."
, address =	"Providence, RI"
, month =	mar
, year =	1989
, update =	"97.11 bibrelex"
}

@inproceedings{tv-opatc-89
, author =	"R. Tamassia and J. S. Vitter"
, title =	"Optimal parallel algorithms for transitive closure and point location in planar structures"
, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
, year =	1989
, pages =	"399--408"
, keywords =	"graph drawing"
, precedes =	"tv-ptcpl-91"
, update =	"94.09 vitter, 93.09 tamassia"
}

@inproceedings{tv-opatc-89i
, author =	"R. Tamassia and J. S. Vitter"
, title =	"Optimal parallel algorithms for transitive closure and point location in planar structures"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, month =	nov
, year =	1989
, pages =	"169--178"
, keywords =	"graph drawing"
, update =	"95.09 mitchell, 94.09 vitter"
, annote =	"invited paper"
}

@article{tv-ptcpl-91
, author =	"R. Tamassia and J. S. Vitter"
, title =	"Parallel transitive closure and point location in planar structures"
, journal =	"SIAM J. Comput."
, volume =	20
, number =	4
, year =	1991
, pages =	"708--725"
, keywords =	"graph drawing"
, succeeds =	"tv-opatc-89"
, update =	"94.09 vitter, 93.09 tamassia"
}

@article{t-cbmal-83
, author =	"A. Tamir"
, title =	"A class of balanced matrices arising from location problems"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	4
, year =	1983
, pages =	"363--370"
, update =	"98.11 bibrelex"
}

@article{t-icbcl-88
, author =	"A. Tamir"
, title =	"Improved complexity bounds for center location problems on networks by using dynamic data structures"
, journal =	"SIAM J. Discrete Math."
, volume =	1
, year =	1988
, pages =	"377--396"
, update =	"95.09 agarwal"
}

@article{t-csclp-92
, author =	"A. Tamir"
, title =	"On the complexity of some classes of location problems"
, journal =	"Transp. Sci."
, volume =	26
, year =	1992
, pages =	"352--354"
, update =	"96.05 agarwal"
}

@inproceedings{t-p4-87
, author =	"A. Tamir"
, title =	"Problem $4-2$"
, booktitle =	"4th Computational Geometry Day"
, organization =	"New York Univ."
, year =	1987
, update =	"98.07 bibrelex"
}

@techreport{tm-mbmpa-95
, author =	"A. Tamir and Joseph S. B. Mitchell"
, title =	"A Maximum $b$-Matching Problem Arising from Median Location Models with Applications to the Roommates Problem"
, year =	1995
, keywords =	"geodesic distances, maximum weight matching, odd cycles, shortest paths"
, precedes =	"tm-mbmpa-98"
, update =	"98.03 mitchell"
}

@article{tm-mbmpa-98
, author =	"A. Tamir and Joseph S. B. Mitchell"
, title =	"A Maximum $b$-Matching Problem Arising from Median Location Models with Applications to the Roommates Problem"
, journal =	"Math. Program."
, volume =	80
, year =	1998
, pages =	"171--194"
, keywords =	"geodesic distances, maximum weight matching, odd cycles, shortest paths"
, succeeds =	"tm-mbmpa-95"
, update =	"98.03 mitchell"
}

@article{t-gdssp-??
, author =	"M. Tamminen"
, title =	"Geometric data structures: summary of project plan for the {Finnish} {Academy}"
, journal =	"??"
, volume =	"??"
, year =	"??"
, pages =	"??"
}

@article{t-ecmcp-82
, author =	"M. Tamminen"
, title =	"The extendible cell method for closest point problems"
, journal =	"BIT"
, volume =	22
, year =	1982
, pages =	"27--41"
}

@techreport{t-ecmfg-80
, author =	"M. Tamminen"
, title =	"The extendible cell method for fast geometric access"
, type =	"Report"
, number =	"HTKK-TKP-A20"
, institution =	"Helsinki Univ. Tech."
, address =	"Espoo, Finland"
, year =	1980
}

@article{tlsww-cmsg-86
, author =	"M. Tamminen and W. K. Luk and P. Sipala and L. S. Woo and C. K. Wong"
, title =	"Constructing maximal slicings from geometry"
, journal =	"Acta Inform."
, volume =	23
, year =	1986
, pages =	"267--288"
}

@article{ts-eoccl-84
, author =	"M. Tamminen and H. Samet"
, title =	"Efficient octree conversion by connectivity labeling"
, journal =	"Comput. Graph."
, volume =	18
, number =	3
, month =	jul
, year =	1984
, pages =	"43--51"
, note =	"Proc. SIGGRAPH '84"
, update =	"96.09 devillers, 96.05 efrat"
}

% ### others?
@inproceedings{t-impbp-87
, author =	"H. L. Tan and others"
, title =	"Inspection of machine parts by back-projection reconstruction"
, booktitle =	"Proc. IEEE Robotics and Automat."
, site =	"North Carolina"
, month =	apr
, year =	1987
, pages =	"503--508"
, update =	"98.11 bibrelex"
}

@techreport{t-obcqt-94
, author =	"T. S. Tan"
, title =	"An optimal bound for conforming quality triangulations"
, type =	"Technical {Report}"
, institution =	"Det. Inform. Sys. \& Comput. Sci., National Univ. Singapore"
, address =	"Singapore"
, year =	1994
, update =	"98.03 bibrelex"
}

@article{t-obhqc-96
, author =	"T.-S. Tan"
, title =	"An Optimal Bound for High-Quality Conforming Triangulations"
, journal =	"Discrete Comput. Geom."
, volume =	15
, number =	2
, month =	mar
, year =	1996
, pages =	"169--193"
, update =	"96.09 held"
}

@inproceedings{t-obqct-94
, author =	"T.-S. Tan"
, title =	"An Optimal Bound for Quality Conforming Triangulations"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"240--249"
, cites =	"ba-acfem-76, bl-tfds-84, bde-tpwla-92, beg-pgmg-90, be-psntp-92, be-mgot-92i, bmr-lsntp-94, b-srpcs-88, c-atapd-74, d-dptd-91, et-ubcdt-93, etw-otama-92, g-eblit-75, l-scsi-77, ms-cinap-92, m-mgpqb-93, m-rtpsl-93, m-fctwm-94, r-nsaq2-93, t-otdt-93, t-obcqt-94, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
}

@phdthesis{t-otdt-93
, author =	"T. S. Tan"
, title =	"Optimal two-dimensional triangulations"
, school =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1993
, note =	"Technical Report UIUCDCS-R-92-1783"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{t-obbtc-00
, author =	"Xuehou Tan"
, title =	"On optimal bridges between two convex regions"
, journal =	"Inform. Process. Lett."
, volume =	76
, year =	2000
, pages =	"163--168"
, update =	"02.03 cheong"
}

@inproceedings{th-cswrd-93
, author =	"Xuehou Tan and Tomio Hirata"
, title =	"Constructing Shortest Watchman Routes by Divide-and-conquer"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"68--77"
, update =	"98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
}

@inproceedings{th-tawra-97
, author =	"Xuehou Tan and Tomio Hirata"
, title =	"On the Time Analysis of Watchman Route Algorithms"
, booktitle =	"Algorithm Workshop of the Information Processing Society of Japan"
, year =	1997
, pages =	"53--60"
, keywords =	"watchman route, visibility path"
, comments =	"Claims to address and fix an error in the analysis of
                  time complexities in earlier watchman route
                  algorithms, as pointed out by Hammar and Nilsson;
                  this issue is still controversial"
, update =	"98.03 mitchell"
, annote =	"IPS of Japan Technical Report 97-AL-55-7"
}

@inproceedings{th-ssrsp-94
, author =	"X. Tan and T. Hirata"
, title =	"Shortest Safari Routes in Simple Polygon"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"523--531"
, update =	"99.11 bibrelex, 98.03 mitchell+smid, 96.05 mitchell"
}

@article{thi-ciacs-99
, author =	"X. Tan and T. Hirata and Y. Inagaki"
, title =	"Corrigendum to ``An Incremental Algorithm for Constructing Shortest Watchman Routes''"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	9
, number =	3
, year =	1999
, pages =	"319--323"
, update =	"00.11 smid, 00.07 icking"
, abstract =	"This corrigendum fixes an error that appears in the previously published papers
		 concerning the watchman route problem. A modification to our incremental watchman
		 route algorithm previously presented in this journal is made, which gives an
		 $O(n^4)$ time solution to the watchman route problem."
}

@incollection{thi-iacsw-91
, author =	"X. H. Tan and T. Hirata and Y. Inagaki"
, title =	"An incremental algorithm for constructing shortest watchman routes"
, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"163--175"
, precedes =	"thi-iacsw-93"
, update =	"96.05 mitchell"
}

@article{thi-iacsw-93
, author =	"X. H. Tan and T. Hirata and Y. Inagaki"
, title =	"An incremental algorithm for constructing shortest watchman routes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, number =	4
, year =	1993
, pages =	"351--365"
, succeeds =	"thi-iacsw-91"
, update =	"96.05 mitchell"
}

@article{thi-ricop-90
, author =	"X.-H. Tan and T. Hirata and Y. Inagaki"
, title =	"Reporting intersections of $c$-oriented polygons"
, journal =	"Trans. IECE Japan"
, volume =	"E73"
, number =	11
, year =	1990
, pages =	"1886--1892"
}

@inproceedings{thi-splia-90
, author =	"X.-H. Tan and T. Hirata and Y. Inagaki"
, title =	"Spatial point location and its applications"
, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	450
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"241--250"
}

@techreport{tb-esto-80
, author =	"H. Tanaka and D. H. Ballard"
, title =	"Extension of strip tree operations"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Univ. Rochester"
, address =	"Rochester, NY"
, year =	1980
, update =	"94.05 devillers"
}

@article{tw-cmm-73
, author =	"Michikazu Tanaka and Takao Wachi"
, title =	"Computerized Marker Making"
, journal =	"Journal of The Textile Machinery Society of Japan"
, volume =	26
, number =	7
, year =	1973
, pages =	"74--81"
, update =	"98.07 bibrelex"
}

@article{th-gmt1m-80
, author =	"M. Tanemura and M. Hasegawa"
, title =	"Geometrical Models of Territory {I}. Models for Synchronous and Asynchronous Settlement of Territories"
, journal =	"Journal of Theoretical Biology"
, volume =	82
, year =	1980
, pages =	"477--496"
, annote =	"VD as model of animal's territory. Centres move to
		 equalise area. Circumcircle algorithm."
}

@article{too-natdv-83
, author =	"M. Tanemura and T. Ogawa and W. Ogita"
, title =	"A New Algorithm for Three-Dimensional {Voronoi} Tesselation"
, journal =	"J. Comput. Phys."
, volume =	51
, year =	1983
, pages =	"191--207"
, annote =	"Basic circumsphere algorithm (though calcs sphere
		 centres). Compares times with Finney, Brostow
		 algorithms."
}

@inproceedings{tgs-crphr-95
, author =	"P. J. Tanenbaum and M. T. Goodrich and E. R. Scheinerman"
, title =	"Characterization and Recognition of Point-Halfspace and Related Orders"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"234--245"
, keywords =	"graph drawing, order, containment"
, update =	"95.01 tamassia"
}

@techreport{tw-sdrmp-95
, author =	"P. J. Tanenbaum and S. Whitesides"
, title =	"Simultaneous Dominance Representations of Multiple Posets"
, type =	"Research {Report}"
, number =	2624
, institution =	"INRIA, Sophia-Antipolis"
, address =	"BP93, 06902 Sophia-Antipolis, France"
, year =	1995
, update =	"97.03 tamassia"
}

@article{tl-osupa-84
, author =	"C. Y. Tang and R. C. T. Lee"
, title =	"Optimal speeding up of parallel algorithms based upon the divide and conquer strategy"
, journal =	"Inform. Sci."
, volume =	32
, year =	1984
, pages =	"173--186"
}

@article{tccw-tmgsb-99
, author =	"K. Tang and S. Y. Chou and L.-L. Chen and T. C. Woo"
, title =	"Tetrahedral Mesh Generation for Solids Based on Alternating Sum of Volumes"
, journal =	"Comput. Ind. Engin."
, volume =	41
, number =	1
, year =	1999
, pages =	"65--81"
, update =	"00.03 held"
}

@article{twccwj-cpspt-97
, author =	"K. Tang and M.-E. Wang and L.-L. Chen and S.-Y. Chou and T. C. Woo and R. Janardan"
, title =	"Computing Planar Swept Polygons under Translation"
, journal =	"Comput. Aided Design"
, volume =	29
, number =	12
, year =	1997
, pages =	"825--836"
, update =	"98.07 held"
}

@article{tvo-ifnmu-98
, author =	"J. W. H. Tangelder and J. S. M. Vergeest and M. H. Overmars"
, title =	"Interference-free NC Machining Using Spatial Planning and {Minkowski} Operations"
, journal =	"Comput. Aided Design"
, volume =	30
, number =	4
, month =	apr
, year =	1998
, pages =	"277--286"
, update =	"98.07 held"
}

@article{t-mdsp-81
, author =	"S. L. Tanimoto"
, title =	"A method for detecting structure in polygons"
, journal =	"Pattern Recogn."
, volume =	13
, year =	1981
, pages =	"389--394"
}

@incollection{t-ids-80
, author =	"S. L. Tanimoto"
, title =	"Image data structures"
, editor =	"S. L. Tanimoto and A. Klinger"
, booktitle =	"Structured Computer Vision: {Machine} Perception through Hierarchical Computation Structures"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1980
, pages =	"??"
, update =	"99.11 bibrelex"
}

@incollection{t-pthpi-82
, author =	"S. L. Tanimoto"
, title =	"Programming techniques for hierarchical parallel image processors"
, editor =	"K. Preston and L. Uhr"
, booktitle =	"Multicomputers and Image Processing Algorithms"
, publisher =	"Academic Press"
, year =	1982
, update =	"97.11 bibrelex"
}

@book{tk-scvmp-80
, author =	"S. L. Tanimoto and A. Klinger"
, title =	"Structured Computer Vision: {Machine} Perception through Hierarchical Computation Structures"
, publisher =	"Academic Press"
, year =	1980
, update =	"97.11 bibrelex"
}

@article{th-snona-86
, author =	"D. Tank and J. Hopfield"
, title =	"Simple ``neural'' optimization networks: an {A}/{D} converter, signal decision circuit, and a linear programming circuit"
, journal =	"IEEE Trans. Circuits Syst."
, volume =	33
, year =	1986
, pages =	"533--541"
, update =	"98.07 bibrelex"
}

@inproceedings{tv-spfsa-97
, author =	"S. Tarasov and M. Vyalyi"
, title =	"Some PL functions on surfaces are not height functions"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"113--118"
, cites =	"elr-ogdi-91, m-spcgt-92, bt-hftcp-75, r-mct-74, a-slddf-21, w-bzv-36, b-cpcep-67, dnf-mg-79, st-vig-38, m-mt-63, ass-ctsp-93, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{t-hrc-97
, author =	"Sergey P. Tarasov"
, title =	"On Hardness of Roundness Calculation"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"175--180"
, update =	"97.11 jones"
}

@article{t-spasc-86
, author =	"E. Tardos"
, title =	"A strongly polynomial algorithm to solve combinatorial linear programs"
, journal =	"Oper. Res."
, volume =	34
, year =	1986
, pages =	"250--256"
, update =	"93.09 milone+mitchell"
}

@article{tv-epba-85
, author =	"R. Tarjan and U. Vishkin"
, title =	"An efficient parallel biconnectivity algorithm"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"862--874"
, update =	"97.11 bibrelex"
}

@article{t-cawrn-79
, author =	"R. E. Tarjan"
, title =	"A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets"
, journal =	"J. Comput. Syst. Sci."
, volume =	18
, year =	1979
, pages =	"110--127"
, update =	"96.09 orourke"
}

@article{t-ad-87
, author =	"R. E. Tarjan"
, title =	"Algorithm Design"
, journal =	"Commun. ACM"
, volume =	30
, number =	3
, year =	1987
, pages =	"205--212"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{t-acc-85
, author =	"R. E. Tarjan"
, title =	"Amortized computational complexity"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	6
, number =	2
, year =	1985
, pages =	"306--318"
, keywords =	"design of algorithms, data structuring, amortized analysis, survey paper"
}

@article{t-iahcu-83
, author =	"R. E. Tarjan"
, title =	"An improved algorithm for hierarchical clustering using strong components"
, journal =	"Inform. Process. Lett."
, volume =	17
, year =	1983
, pages =	"37--41"
}

@article{t-cmncc-78
, author =	"R. E. Tarjan"
, title =	"Complexity of monotone networks for computing conjunctions"
, journal =	"Ann. Discrete Math."
, volume =	2
, year =	1978
, pages =	"121--133"
, update =	"98.03 bibrelex"
}

@book{t-dsna-83
, author =	"R. E. Tarjan"
, title =	"Data Structures and Network Algorithms"
, series =	"CBMS-NSF Regional Conference Series in Applied Mathematics"
, volume =	44
, publisher =	"Society for Industrial and Applied Mathematics"
, address =	"Philadelphia, PA"
, year =	1983
, keywords =	"graph drawing, disjoint sets, heaps, search trees, linking and cutting trees, minimum spanning trees, shortest paths, network flows, matchings, analysis of algorithms"
, update =	"98.07 tamassia+vismara, 97.11 bibrelex, 93.09 tamassia"
}

@article{t-dfslg-72
, author =	"R. E. Tarjan"
, title =	"Depth-first search and linear graph algorithms"
, journal =	"SIAM J. Comput."
, volume =	1
, number =	2
, year =	1972
, pages =	"146--160"
, update =	"98.07 patrignani, 98.03 bibrelex"
}

@article{t-egbnl-75
, author =	"R. E. Tarjan"
, title =	"Efficiency of a good but not linear set union algorithm"
, journal =	"J. ACM"
, volume =	22
, year =	1975
, pages =	"215--225"
, update =	"98.03 bibrelex"
}

@article{t-ubstr-83
, author =	"R. E. Tarjan"
, title =	"Updating balanced search tree in $O(1)$ rotations"
, journal =	"Inf. Proc. Letters"
, volume =	16
, year =	1983
, update =	"97.11 bibrelex"
}

@article{tv-tsp-87
, author =	"R. E. Tarjan and C. {Van Wyk}"
, title =	"Triangulation of a simple polygon"
, journal =	"SIAM J. Comput."
, volume =	"??"
, year =	1987
, update =	"98.07 bibrelex"
}

@inproceedings{tv-ltats-86
, author =	"R. E. Tarjan and C. J. {Van Wyk}"
, title =	"A linear-time algorithm for triangulating simple polygons"
, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
, year =	1986
, pages =	"380--388"
, note =	"Erratum in SIGACT News 18:4 (1987), 63"
, keywords =	"design of algorithms, triangulation, visibility, divide-and-conquer, finger search trees, amortized analysis"
, precedes =	"tv-otats-88"
, update =	"94.01 jones"
}

@article{tv-otats-88
, author =	"R. E. Tarjan and C. J. {Van Wyk}"
, title =	"An {$O(n \log\log n)$}-time algorithm for triangulating a simple polygon"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"143--178"
, note =	"Erratum in 17 (1988), 106"
, keywords =	"design of algorithms, triangulation, visibility, divide-and-conquer, finger search trees, amortized analysis"
, succeeds =	"tv-ltats-86"
}

@techreport{tv-otats-86
, author =	"R. E. Tarjan and C. J. {Van Wyk}"
, title =	"An {$O(n \log\log n)$} Time Algorithm for Triangulating Simple Polygons"
, type =	"Report"
, number =	"CS-TR-052-86"
, institution =	"Princeton Univ."
, year =	1986
, update =	"97.11 bibrelex"
}

@article{ty-sltat-84
, author =	"R. E. Tarjan and M. Yannakakis"
, title =	"Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs"
, journal =	"SIAM J. Comput."
, volume =	13
, year =	1984
, pages =	"566--579"
, update =	"97.11 bibrelex"
}

@article{t-clc-75
, author =	"T. G. Tarj{\'a}n"
, title =	"Complexity of lattice-configurations"
, journal =	"Studia Scientiarum Mathematicarum Hungarica"
, volume =	10
, year =	1975
, pages =	"203--211"
, update =	"98.03 bibrelex"
}

@inproceedings{t-ptssq-93
, author =	"Alexander G. Tarnowski"
, title =	"Polynomial time solvability of some quillotine cutting stock problems"
, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
, month =	jun
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@book{t-dmeag-51
, author =	"A. Tarski"
, title =	"A decision method for elementary algebra and geometry"
, publisher =	"Univ. of California Press"
, address =	"Berkeley, CA"
, year =	1951
}

@article{t-wclnn-97
, author =	"L. Tassiulas"
, title =	"Worst case length of nearest neighbor tours for the {Euclidean} traveling salesman problem"
, journal =	"SIAM J. Discrete Math."
, volume =	10
, year =	1997
, pages =	"171--179"
, update =	"98.03 smid"
}

@inproceedings{tx-gpsda-00
, author =	"S. R. Tate and K. Xu"
, title =	"General-purpose spatial decomposition algorithms: {Experimental} results"
, booktitle =	"Proc. 2nd Workshop Algorithm Eng. Exper."
, nickname =	"ALENEX '00"
, year =	2000
, pages =	"197--215"
, update =	"01.11 smid"
}

@inproceedings{tghl-pfsc-98
, author =	"G. Taubin and A. Gu{\'e}ziec and W. Horn and F. Lazarus"
, title =	"Progressive Forest Split Compression"
, booktitle =	"Proc. SIGGRAPH '98"
, site =	"Orlando, FL"
, series =	"Computer Graphics Proceedings, Annual Conference Series"
, month =	jul
, year =	1998
, pages =	""
, update =	"98.11 held"
}

@techreport{tr-gctts-96
, author =	"G. Taubin and J. Rossignac"
, title =	"Geometric Compression Through Topological Surgery"
, number =	"RC-20340"
, institution =	"IBM T. J. Watson Research Center"
, address =	"Yorktown Heights, NY"
, month =	jan
, year =	1996
, update =	"96.05 held"
}

@article{tr-gctts-98
, author =	"G. Taubin and J. Rossignac"
, title =	"Geometric Compression Through Topological Surgery"
, journal =	"ACM Trans. Graph."
, volume =	17
, number =	2
, month =	apr
, year =	1998
, pages =	"84--115"
, succeeds =	"tr-gctts-96"
, update =	"99.03 held"
}

@proceedings{t-p4imr-95
, title =	"Proc. 4th International Meshing Roundtable"
, editor =	"Timothy J. Tautges"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1995
, note =	"Also Sandia Report 95-2301"
, comments =	"copies on request from Ann Sample, wasampl<at>sandia.gov"
, update =	"96.01 samitchell"
}

@inproceedings{tm-wwicr-95
, author =	"Timothy J. Tautges and Scott Mitchell"
, title =	"Whisker Weaving: Invalid Connectivity Resolution and Primal Construction Algorithm"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"115--128"
, update =	"96.01 samitchell"
}

@article{tmb-cbmrc-
, author =	"T. J. Tautges and S. A. Mitchell and T. D. Blacker"
, title =	"A connectivity based method for representing and constructing all-hexahedral finite element meshes, {Part} {II}: {Whisker} weaving"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	"??"
, year =	"??"
, note =	"Submitted"
, update =	"98.03 bibrelex"
}

@inproceedings{t-eacbr-91
, author =	"M. S. Tawfik"
, title =	"An Efficient Algorithm for {CSG} to {B}-{Rep} Conversion"
, booktitle =	"ACM SIGGRAPH Sympos. on Solid Modeling Foundations and CAD/CAM Applications"
, site =	"Austin, TX."
, year =	1991
, pages =	""
, update =	"93.09 goodrich"
}

@article{t-rprbj-83
, author =	"T. S. Tay"
, title =	"Review: problems on the rigidity of bar and joint frameworks and linkage of rigid bodies"
, journal =	"Structural Topology"
, volume =	8
, year =	1983
, pages =	"33--36"
, update =	"97.11 bibrelex"
}

@article{tw-rdgrs-84
, author =	"T. S. Tay and W. Whiteley"
, title =	"Recent developments on the generic rigidy of structures"
, journal =	"Structural Topology"
, volume =	9
, year =	1984
, pages =	"31--38"
, update =	"97.11 bibrelex"
}

@article{t-gscs-91
, author =	"J. E. Taylor"
, title =	"On the global structure of crystalline surfaces"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"225--262"
}

@article{t-sssbl-76
, author =	"J. E. Taylor"
, title =	"The structure of singularities in soap-bubble-like and soap-film-like minimal surfaces"
, journal =	"Annals of Math."
, volume =	103
, year =	1976
, pages =	"489--539"
, update =	"97.11 bibrelex"
}

@techreport{t-smcpt-76
, author =	"R. H. Taylor"
, title =	"The synthesis of manipulator control programs from task-level specifications"
, number =	"AIM-282"
, institution =	"Artificial Intelligence Laboratory, Stanford Univ."
, address =	"Stanford, CA"
, month =	jul
, year =	1976
, update =	"98.03 bibrelex"
}

@inproceedings{t-paegf-96
, author =	"M. Teichmann"
, title =	"Probabilistic algorithms for efficient grasping and fixturing"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"277--282"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@incollection{t-stc-88
, author =	"M. Teichmann"
, title =	"Shoving a table into a corner"
, editor =	"G. Toussaint"
, booktitle =	"Snapshots of computational and discrete geometry"
, publisher =	"McGill Univ."
, year =	1988
, pages =	"99--118"
, note =	"TR-SOCS 88.11"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{t-stc-89
, author =	"M. Teichmann"
, title =	"Shoving a table into a corner"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	9
}

@mastersthesis{t-wpop-89
, author =	"M. Teichmann"
, title =	"Wedge Placement Optimization Problems"
, school =	"School of Computer Science, McGill University"
, year =	1989
, keywords =	"master thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{tm-ragum-94
, author =	"M. Teichmann and B. Mishra"
, title =	"Reactive algorithms for grasping using a modified parallel jaw gripper"
, booktitle =	"Proc. IEEE Intl. Conf. on Robotics and Automation"
, month =	may
, year =	1994
, update =	"98.11 bibrelex"
}

@inproceedings{t-tdtc-99
, author =	"Monique Teillaud"
, title =	"Three Dimensional Triangulations in {CGAL}"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"175--178"
, url =	"https://hal.inria.fr/inria-00167199"
, update =	"00.03 bibrelex+devillers, 99.07 bibrelex"
}

@techreport{t-tdrac-92
, author =	"Monique Teillaud"
, title =	"Towards dynamic randomized algorithms in computational geometry"
, type =	"Research {Report}"
, number =	1727
, institution =	"INRIA"
, address =	"BP93, 06902 Sophia-Antipolis, France"
, year =	1992
, note =	"English version of a French thesis"
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
, succeeds =	"t-vdard-91"
, precedes =	"t-tdrac-93"
, update =	"99.07 devillers, 98.07 bibrelex, 95.09 devillers, 95.01 devillers, 94.05 devillers, 93.05 devillers"
}

@book{t-tdrac-93
, author =	"Monique Teillaud"
, title =	"Towards dynamic randomized algorithms in computational geometry"
, series =	"Lecture Notes Comput. Sci."
, volume =	758
, publisher =	"Springer-Verlag"
, year =	1993
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
, succeeds =	"t-tdrac-92"
, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
}

@inproceedings{t-usodt-95
, author =	"Monique Teillaud"
, title =	"Union and Split Operations on Dynamic Trapezoidal Maps"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"181--186"
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2486"
, precedes =	"t-usodt-00"
, update =	"01.11 devillers, 96.01 devillers, 95.09 jones"
}

@article{t-usodt-00
, author =	"M. Teillaud"
, title =	"Union and split operations on dynamic trapezoidal maps"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"153--163"
, succeeds =	"t-usodt-95"
, update =	"01.11 devillers, 01.04 smid"
}

@phdthesis{t-vdard-91
, author =	"Monique Teillaud"
, title =	"Vers des algorithmes randomis{\'e}s dynamiques en g{\'e}om{\'e}trie algorithmique"
, type =	"Th{\`e}se de Doctorat en Sciences"
, school =	"Uni\-ver\-sit{\'e} Paris-Sud"
, address =	"Orsay, France"
, year =	1991
, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
, keywords =	"doctoral thesis"
, precedes =	"t-tdrac-92"
, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 93.05 devillers"
}

@article{t-ta-90
, author =	"G. Tel"
, title =	"Total algorithms"
, journal =	"Algorithms Rev."
, volume =	1
, number =	1
, year =	1990
, pages =	"13--42"
, keywords =	"distributed algorithms, design methods, broadcast, mutual exclusion, election, termination detection"
}

@inproceedings{th-gvaic-93
, author =	"S. Teller and P. Hanrahan"
, title =	"Global visibility algorithms for illumination computations"
, booktitle =	"Proc. SIGGRAPH '93"
, year =	1993
, pages =	"239--246"
, keywords =	"visibility"
, update =	"94.09 orourke"
}

@inproceedings{t-mgad-93
, author =	"S. J. Teller"
, title =	"A Methodology for Geometric Algorithm Development"
, booktitle =	"Communicating with Virtual Worlds"
, nickname =	"CGI '93"
, publisher =	"Springer-Verlag"
, address =	"Lausanne, Switzerland"
, month =	jun
, year =	1993
, pages =	"306--317"
, update =	"98.07 bibrelex, 93.09 held"
}

@article{t-caals-92
, author =	"S. J. Teller"
, title =	"Computing the antipenumbra of an area light source"
, journal =	"Comput. Graph."
, volume =	26
, number =	4
, month =	jul
, year =	1992
, pages =	"139--148"
, note =	"Proc. SIGGRAPH '92"
}

@phdthesis{t-vcdop-92
, author =	"S. J. Teller"
, title =	"Visibility Computations in Densely Occluded Polyhedral Environments"
, school =	"Dept. of Computer Science, University of California"
, address =	"Berkeley"
, year =	1992
, keywords =	"graphics, visibility preprocessing, linear programming, spatial decomposition, visibility graphs, Plucker coordinates"
, update =	"95.09 mitchell"
}

@inproceedings{t-vfapv-93
, author =	"S. J. Teller"
, title =	"Visualizing {Fortune's} algorithm for planar {Voronoi} diagrams"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	393
, keywords =	"video review"
, cites =	"d-slsv-34, f-savd-87, ps-cgi-85, ZZZ"
, update =	"98.03 bibrelex, 93.09 jones"
}

@article{ts-vpiw-91
, author =	"S. J. Teller and C. H. S{\'e}quin"
, title =	"Visibility Preprocessing For Interactive Walkthroughs"
, journal =	"Comput. Graph."
, volume =	25
, number =	4
, month =	jul
, year =	1991
, pages =	"61--69"
, note =	"Proc. SIGGRAPH '91"
, update =	"93.09 milone+mitchell"
}

@article{t-cagg-98
, author =	"Shang-Hua Teng"
, title =	"Combinatorial aspects of geometric graphs"
, journal =	"Comput. Geom. Theory Appl."
, volume =	9
, year =	1998
, pages =	"277--287"
, update =	"98.11 devillers"
}

@phdthesis{t-pssug-90
, author =	"S.-H. Teng"
, title =	"Points, Spheres, and Separators: a unified geometric approach to graph partitioning"
, school =	"School of Computer Science, Carnegie-Mellon University"
, year =	1990
, note =	"Report CMU-CS-91-184"
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@article{tmpd-pavpt-97
, author =	"Y. Teng and D. Mount and E. Puppo and L. Davis"
, title =	"Parallelizing an algorithm for visibility on polyhedral terrain"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"75--84"
, update =	"99.11 bibrelex, 97.07 devillers"
}

@phdthesis{t-ppgsv-93
, author =	"Y. Ansel Teng"
, title =	"Parallel Processing of Geometric Structures: Visibility and Triangulation Algorithms"
, school =	"University of Maryland"
, address =	"College Park"
, year =	1993
, note =	"Also published as Center for Automation Research technical report CAR-TR-680"
, keywords =	"doctoral thesis"
, update =	"94.01 teng"
}

@techreport{td-vadtm-92
, author =	"Y. A. Teng and L. S. Davies"
, title =	"Visibility Analysis on Digital Terrain Models and its Parallel Implementation"
, number =	"CAR-TR-625"
, institution =	"Center for Automation Research, University of Maryland"
, year =	1992
, update =	"96.09 kreveld"
}

@techreport{tdd-stn-91
, author =	"Y. Ansel Teng and D. {DeMenthon} and L. S. Davis"
, title =	"Stealth terrain navigation"
, number =	"CAR-TR-532"
, institution =	"Center for Automation Research, University of Maryland"
, month =	jan
, year =	1991
}

@article{tdd-stn-93
, author =	"Y. Ansel Teng and Daniel DeMenthon and Larry S. Davis"
, title =	"Stealth terrain navigation"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	23
, number =	1
, year =	1993
, pages =	"96--110"
, succeeds =	"tdd-stn-91"
, update =	"94.01 teng"
}

@article{tsbp-dpatd-93
, author =	"Y. A. Teng and F. Sullivan and I. Beichl and E. Puppo"
, title =	"A data-parallel algorithm for three-dimensional {Delaunay} triangulation and its implementation"
, journal =	"SuperComputing 93"
, volume =	"??"
, year =	1993
, pages =	"112--121"
, update =	"97.11 bibrelex"
}

@article{tt-tubni-91
, author =	"K. H. Teo and T. C. Tuan"
, title =	"A tight upper bound for the number of intersections between two rectangular paths"
, journal =	"BIT"
, volume =	31
, month =	nov
, year =	1991
, pages =	"598--606"
, keywords =	"interference, intersection, rectangular path"
, update =	"94.01 tuan"
}

@article{tt-iubni-91
, author =	"K. H. Teo and T. C. Tuan"
, title =	"An improved upper bound on the number of intersections between two rectangular paths"
, journal =	"Inform. Process. Lett."
, volume =	37
, number =	6
, month =	mar
, year =	1991
, pages =	"305--309"
, keywords =	"interference, intersection, rectangular path"
, update =	"94.01 tuan"
}

@techreport{t-fanhp-80
, author =	"R. Terada"
, title =	"Fast algorithms for {NP}-hard problems which are optimal or near-optimal with probability one"
, type =	"Report"
, number =	"RT-MAP-8003"
, institution =	"Dept. Matema{\'a}tica Aplicada, Univ. Sao Paulo"
, address =	"Sao Paulo, Brazil"
, year =	1980
}

@article{t-cccm-85
, author =	"T. Terlaky"
, title =	"A Convergent Criss-Cross Method"
, journal =	"Math. Oper. and Stat. ser. Optimization"
, volume =	16
, year =	1985
, pages =	"683--690"
, update =	"97.11 bibrelex"
}

@article{t-fccmo-87
, author =	"T. Terlaky"
, title =	"A Finite Criss-Cross Method for Oriented Matroids"
, journal =	"J. Combin. Theory Ser. B"
, volume =	42
, year =	1987
, pages =	"319--327"
, update =	"97.11 bibrelex"
}

%%% What is Norwell's first initial?
@incollection{twv-dmgbl-93
, author =	"M. T. Terlien and C. J. Van Westen and T. W. Van Asch"
, title =	"Deterministic modeling in GIS-based landslide hazard assessment"
, editor =	"Norwell"
, booktitle =	"Geographical Information Systemss in Accessing Natural Hazards"
, publisher =	"Kluwer"
, year =	1993
, pages =	"57--78"
, update =	"98.03 agarwal"
}

@article{t-brtgi-80
, author =	"W. C. Thacker"
, title =	"A Brief Review of Techniques for Generating Irregular Computational Grids"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	15
, year =	1980
, pages =	"1335--1341"
, annote =	"Title says it all."
}

@article{t-ita-79
, author =	"W. C. Thacker"
, title =	"An Improved Triangulation Algorithm"
, journal =	"Appl. Math. Modelling"
, volume =	3
, month =	dec
, year =	1979
, pages =	"471--472"
, annote =	"Wants to use triangulation defined by joining two
		 nodes if there is no shorter intersecting segment. This
		 is the same as GT. Proposes $O(n^2)$ algorithm (which I
		 don't think should work.)"
}

@inproceedings{t-mlpra1-50
, author =	"H. Theil"
, title =	"A rank-invariant method of linear and polynomial regression analysis I"
, booktitle =	"Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
, volume =	53
, year =	1950
, pages =	"386--392"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{t-mlpra2-50
, author =	"H. Theil"
, title =	"A rank-invariant method of linear and polynomial regression analysis II"
, booktitle =	"Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
, volume =	53
, year =	1990
, pages =	"521--525"
, update =	"98.11 bibrelex"
}

@inproceedings{t-mlpra3-50
, author =	"H. Theil"
, title =	"A rank-invariant method of linear and polynomial regression analysis III"
, booktitle =	"Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
, volume =	53
, year =	1990
, pages =	"1397--1412"
, update =	"98.11 bibrelex"
}

@article{tn-sopub-87
, author =	"W. C. Thibault and B. F. Naylor"
, title =	"Set Operations on Polyhedra Using Binary Space Partitioning Trees"
, journal =	"Comput. Graph."
, volume =	21
, number =	4
, year =	1987
, pages =	"153--162"
, note =	"Proc. SIGGRAPH '87"
, update =	"93.09 held"
}

@phdthesis{t-eapkg-96
, author =	"C. Thiel"
, title =	"Effiziente {Algorithmen} f{\"u}r {Probleme} der {Kollisionserkennung} und der geometrischen {Optimierung}"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, Germany"
, year =	1996
, keywords =	"doctoral thesis"
, update =	"96.01 smid"
}

@mastersthesis{t-ep-91
, author =	"T. Thiele"
, title =	"Extremalprobleme f{\"u}r {Punktemengen}"
, type =	"Masters Thesis"
, school =	"Fachbereich Mathematik, Freie Univ. Berlin"
, address =	"Berlin, Germany"
, year =	1991
, keywords =	"masters thesis"
, update =	"97.03 gaertner+salinger"
}

@mastersthesis{t-dnsga-86
, author =	"G. Thiemt"
, title =	"Die numerische {Stabilit{\"a}t} geometrischer {Algorithmen}"
, school =	"Universit{\"a}t Karlsruhe"
, address =	"Karlsruhe, Germany"
, month =	oct
, year =	1986
, note =	"Diploma Thesis"
, keywords =	"master thesis"
, update =	"98.03 bibrelex"
}

@article{t-pala-11
, author =	"A. H. Thiessen"
, title =	"Precipitation Averages for Large Areas"
, journal =	"Monthly Weather Review"
, volume =	39
, month =	jul
, year =	1911
, pages =	"1082--1084"
, update =	"93.09 held"
}

@incollection{t-sldva-65
, author =	"R. Thom"
, title =	"Sur l'homologie des vari\'et\'es alg\'ebriques re\'elles"
, editor =	"S. S. Cairns"
, booktitle =	"Differential and Combinatorial Topology"
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1965
, pages =	"255--265"
, update =	"99.07 smid, 98.07 agarwal, 95.01 matousek"
}

@article{tc-saeca-89
, author =	"Samuel M. Thomas and Y. T. Chan"
, title =	"A simple approach for the estimation of circular arc and its radius"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	45
, year =	1989
, pages =	"362--370"
, update =	"98.11 bibrelex, 97.03 agarwal"
}

@article{t-tppg-83
, author =	"C. Thomassen"
, title =	"A theorem on paths in planar graphs"
, journal =	"J. Graph Theory"
, volume =	7
, number =	2
, year =	1983
, pages =	"169--176"
, update =	"98.11 bibrelex"
}

@article{t-dpg-83
, author =	"C. Thomassen"
, title =	"Deformations of plane graphs"
, journal =	"J. Combin. Theory"
, volume =	"??"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{t-irpg-86
, author =	"C. Thomassen"
, title =	"Interval representation of planar graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	40
, year =	1986
, pages =	"9--20"
, keywords =	"graph drawing"
, update =	"94.05 franciosa"
}

@article{t-paog-89
, author =	"C. Thomassen"
, title =	"Planar Acyclic Oriented Graphs"
, journal =	"Order"
, volume =	5
, number =	4
, year =	1989
, pages =	"349--361"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{t-pihhg-76
, author =	"C. Thomassen"
, title =	"Planar and infinite hypohamiltonian and hypotraceable graphs"
, journal =	"Discrete Math."
, volume =	14
, number =	4
, month =	apr
, year =	1976
, pages =	"377--389"
, update =	"98.11 bibrelex"
}

@article{t-pdfip-80
, author =	"C. Thomassen"
, title =	"Planarity and Duality of Finite and Infinite Planar Graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	29
, number =	2
, year =	1980
, pages =	"244--271"
, keywords =	"graph drawing"
, update =	"98.07 tamassia, 93.09 tamassia"
}

@incollection{t-prg-84
, author =	"C. Thomassen"
, title =	"Plane Representations of Graphs"
, editor =	"J. A. Bondy and U. S. R. Murty"
, booktitle =	"Progress in Graph Theory"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1984
, pages =	"43--69"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{t-rdg-88
, author =	"C. Thomassen"
, title =	"Rectilinear drawings of graphs"
, journal =	"J. Graph Theory"
, volume =	12
, year =	1988
, pages =	"335--341"
, update =	"97.11 bibrelex"
}

@article{t-jstcs-92
, author =	"C. Thomassen"
, title =	"The Jordan-Sch{\"o}nflies Theorem and the Classification of Surfaces"
, journal =	"Amer. Math. Monthly"
, volume =	99
, year =	1992
, pages =	"116--130"
, update =	"95.09 devillers"
}

@inproceedings{tac-rsmw-92
, author =	"C. D. Thomborson and B. Alpern and L. Carter"
, title =	"Rectilinear {Steiner} tree minimzation on a workstation"
, booktitle =	"Proc. of the DIMACS Workshop on Comput. Support for Discr. Math."
, year =	1992
, update =	"98.11 bibrelex"
}

@inproceedings{tds-crsmt-87
, author =	"C. D. Thomborson and L. L. Deneen and G. M. Shute"
, title =	"Computing a Rectilinear {Steiner} Minimal Tree in $n^{O(\sqrt{n})}$ Time"
, editor =	"A. Albrecht and H. Jung and K. Mehlhorn"
, booktitle =	"Parallel Algorithms and Architectures"
, publisher =	"Akademie-Verlag Berlin"
, month =	may
, year =	1987
, pages =	"176--83"
, update =	"93.09 held"
}

@inproceedings{t-atcv-79
, author =	"C. D. Thompson"
, title =	"Area-time complexity for {VLSI}"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
, year =	1979
, pages =	"81--88"
, precedes =	"t-ftv-83"
}

@article{t-ftv-83
, author =	"C. D. Thompson"
, title =	"Fourier transforms in {VLSI}"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, year =	1983
, pages =	"1047--1057"
, succeeds =	"t-atcv-79"
, precedes =	"t-vcs-83"
, annote =	"Model and upper bounds only"
}

@article{t-vcs-83
, author =	"C. D. Thompson"
, title =	"The {VLSI} complexity of sorting"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, year =	1983
, pages =	"1171--1184"
, succeeds =	"t-ftv-83"
, annote =	"Model and upper bounds only"
}

@article{tk-smcpc-77
, author =	"C. D. Thompson and H. T. Kung"
, title =	"Sorting on a mesh-connected parallel computer"
, journal =	"Commun. ACM"
, volume =	20
, year =	1977
, pages =	"263--271"
, update =	"97.11 bibrelex"
}

@book{twm-ngg-85
, author =	"Joe F. Thompson and Z. U. A. Warsi and C. Wayne Mastin"
, title =	"Numerical Grid Generation"
, publisher =	"Elsevier Science Publishing Co., Inc."
, address =	"New York, New York"
, year =	1985
, update =	"98.11 bibrelex"
}

@inproceedings{tpbhss-mbldo-90
, author =	"W. Thompson and H. Pick and B. Bennett and M. Heinrichs and S. Savitt an K. Smith"
, title =	"Map-based localization: the 'drop-off' problem"
, booktitle =	"Proc. DARPA Image Understanding Workshop"
, year =	1990
, pages =	"706--719"
, update =	"97.11 bibrelex"
}

@phdthesis{t-fvnrr-84
, author =	"C. E. Thorpe"
, title =	"FIDO: {Vision} and Navigation for a Robot Rover"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Computer Science, Carnegie-Mellon University"
, year =	1984
, note =	"CMU-CS-84-168"
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@inproceedings{t-prppm-84
, author =	"C. E. Thorpe"
, title =	"Path Relaxation: {Path} Planning for a Mobile Robot"
, booktitle =	"Proc. AAAI National Conference on Artificial Intelligence"
, year =	1984
, pages =	"318--321"
, update =	"93.09 milone+mitchell"
}

@inproceedings{t-usssp-97
, author =	"Mikkel Thorup"
, title =	"Undirected Single Source Shortest Path in Linear Time"
, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '97"
, year =	1997
, pages =	"To appear"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@misc{t-hdp-93
, author =	"W. Thurston"
, title =	"Hexahedral decomposition of polyhedra"
, month =	oct
, year =	1993
, url =	"http://www.ics.uci.edu/~eppstein/gina/Thurston-hexahedra"
, update =	"97.11 bibrelex"
}

@book{t-tdgt1-97
, author =	"William Thurston"
, title =	"Three-Dimensional Geometry and Topology, Volume 1"
, publisher =	"Princeton University Press"
, address =	"New Jersey"
, year =	1997
, update =	"00.11 smid, 00.07 icking, 99.07 orourke"
}

@techreport{t-gt3m-88
, author =	"W. P. Thurston"
, title =	"The geometry and topology of 3-manifolds"
, type =	"Note"
, institution =	"Princeton University"
, year =	1988
, update =	"97.11 bibrelex"
}

@techreport{t-gcvdm-86
, author =	"W. P. Thurston"
, title =	"The geometry of circles: {Voronoi} diagrams, {Moebius} transformations, convex hulls, {Fortune}'s algorithm, the cut locus, and parametrization of shapes"
, institution =	"Princeton University"
, year =	1986
, update =	"00.03 bibrelex"
}

@article{t-tdmkg-82
, author =	"W. P. Thurston"
, title =	"Three dimensional manifolds, {Kleinian} groups, and hyperbolic geometry"
, journal =	"Bull. Amer. Math. Soc."
, volume =	6
, number =	3
, year =	1982
, pages =	"357--381"
}

@inproceedings{tn-kbedg-87
, author =	"W. F. Tichy and F. J. Newbery"
, title =	"Knowledge-based Editors for Directed Graphs"
, editor =	"H. K. Nichols and D. Simpson"
, booktitle =	"Proc. 1st European Software Engineering Conference"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1987
, pages =	"109--117"
, keywords =	"graph drawing"
, update =	"96.09 agarwal, 93.09 tamassia"
}

% P. J. W. ten Hagen, editor, Elsevier North-Holland, 1983
@article{tmt-gdgdm-83
, author =	"M. Tikkanen and M. J. M{\"a}ntyl{\"a} and M. Tamminen"
, title =	"{GWB}/{DMS}: {A} Geometric Data Manager"
, journal =	"Proc. Eurographics '83"
, volume =	"??"
, year =	1983
, pages =	"99--112"
, update =	"97.07 forrest, 94.05 devillers"
}

@article{t-aciho-88
, author =	"V. S. Tikunov"
, title =	"Anamorphated cartographic images: historical outline and construction technique"
, journal =	"Cartography (Austral.)"
, volume =	17
, year =	1988
, pages =	"1--8"
, update =	"98.03 bibrelex"
}

@techreport{t-tda-81
, author =	"J. S. Tilford"
, title =	"Tree Drawing Algorithms"
, number =	"UIUCDCS-R-81-1055"
, institution =	"Department of Computer Science, University of Illinois at Urbana-Champaign"
, year =	1981
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{th-otdp-84
, author =	"W. Tiller and E. Hanson"
, title =	"Offsets of Two Dimensional Profiles"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	4
, number =	9
, month =	sep
, year =	1984
, pages =	"36--46"
, update =	"93.09 held"
}

@article{t-nodac-84
, author =	"R. B. Tilove"
, title =	"A null-object detection algorithm for constructive solid geometry"
, journal =	"Commun. ACM"
, volume =	27
, year =	1984
, pages =	"684--694"
}

@techreport{t-sgsmc-80
, author =	"R. B. Tilove"
, title =	"A study of geometric set-membership classification"
, type =	"Report"
, number =	"TM-30"
, institution =	"Production Automat. Project, Univ. Rochester"
, address =	"Rochester, NY"
, year =	1980
}

@techreport{t-lpccs-80
, author =	"R. B. Tilove"
, title =	"Line/polygon classification: a case study of the complexity of geometric computation"
, type =	"Report"
, number =	"TM-37"
, institution =	"Production Automat. Project, Univ. Rochester"
, address =	"Rochester, NY"
, year =	1980
}

@article{t-smcua-80
, author =	"R. B. Tilove"
, title =	"Set membership classification: a unified approach to geometric intersection problems"
, journal =	"IEEE Trans. Comput."
, volume =	"C-29"
, year =	1980
, pages =	"874--883"
}

@article{tr-cboge-80
, author =	"R. B. Tilove and A. A. G. Requicha"
, title =	"Closure of boolean operations on geometric entities"
, journal =	"Comput. Aided Design"
, volume =	12
, year =	1980
, pages =	"219--220"
}

@article{ts-cggps-80
, author =	"?? Timmer and ?? Stern"
, title =	"Computation of global geometric properties of solid objects"
, journal =	"Comput. Aided Design"
, volume =	12
, year =	1980
, pages =	"301--304"
, update =	"98.07 bibrelex"
}

@article{t-fpcpv-91
, author =	"John C. Tipper"
, title =	"{FORTRAN} Programs To Construct The Planar {Voronoi} Diagram"
, journal =	"Comput. Geosci."
, volume =	17
, number =	5
, year =	1991
, pages =	"597--632"
, keywords =	"Voronoi diagrams, Delaunay triangulation, spatial data structures"
, annote =	"Incremental flip algorithm. Points are sorted so that
		 they are outside CH. Triangulates inside polygon by
		 slicing it up into convex pieces, triangulating, then
		 gluing it back together and flipping."
, abstract =	"The Voronoi diagram and its geometric dual, the
		 Delaunay triangulation, both have been applied
		 extensively in spatial modeling and analysis. This
		 paper gives two FORTRAN programs which use a new
		 algorithm that creates the Voronoi diagram and Delaunay
		 triangulation rapidly and efficiently for large data
		 sets (N greater than 1000). The first program applies
		 to the special situation of data points lying either in
		 an open domain or in a simply connected closed domain
		 bounded by their convex hull: under certain conditions
		 the running time of this program is linear in the
		 number of data points. The second program applies to
		 the general situation of data points lying in a domain
		 that may be open or closed, simply or multiply
		 connected, and have convex or reentrant boundaries. A
		 GKS-based plotting program to give graphic output also
		 is provided. (Author abstract) 24 Refs."
}

@article{t-siapv-90
, author =	"John C. Tipper"
, title =	"Straightforward Iterative Algorithm For The Planar {Voronoi} Diagram"
, journal =	"Inform. Process. Lett."
, volume =	34
, number =	3
, month =	apr
, year =	1990
, pages =	"155--160"
, keywords =	"spatial data structures, triangulation, Voronoi diagrams, iterative algorithms, Delaunay triangulation"
, annote =	"Your basic incremental algorithm. Points are sorted by
		 X coordinate."
, abstract =	"Several published algorithms construct the planar
		 N-point Voronoi diagram by adding the points in turn to
		 a digram already constructed for a subset of those
		 points. The algorithm described here works in this way,
		 but stipulates that every added point be outside the
		 convex hull of the already constructed partial diagram.
		 This stipulation, which is implemented by presorting
		 the points by increasing x-coordinate, ensures that the
		 core of the algorithm runs in almost linear time. The
		 algorithm is inherently iterative, not recursive, and
		 provides a rapid, efficient way to construct the
		 Voronoi diagram for large data sets. (Author abstract)
		 16 Refs."
}

@article{t-odsga-75
, author =	"D. M. Titterington"
, title =	"Optimal design: some geometrical aspects of {D}-optimality"
, journal =	"Biometrika"
, volume =	62
, number =	2
, year =	1975
, pages =	"313--320"
, update =	"98.07 bibrelex"
}

@article{t-ctud-73
, author =	"W. R. Tobler"
, title =	"A continous transformation useful for districting"
, journal =	"Ann. New York Acad. Sci."
, volume =	219
, year =	1973
, pages =	"215--220"
, update =	"98.03 bibrelex"
}

@article{t-lqpom-85
, author =	"M. Todd"
, title =	"Linear and Quadratic Programming in Oriented Matroids"
, journal =	"J. Combin. Theory Ser. B"
, volume =	39
, year =	1985
, pages =	"105--133"
, update =	"97.11 bibrelex"
}

@incollection{t-mp-97
, author =	"M. J. Todd"
, title =	"Mathematical programming"
, chapter =	39
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"711--732"
, update =	"97.11 orourke"
}

@book{t-cfpa-76
, author =	"M. J. Todd"
, title =	"The Computation of Fixed Points and Applications"
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1976
, update =	"97.11 bibrelex"
}

@article{t-ktgtc-89
, author =	"P. Todd"
, title =	"A $k$-tree generalization that characterizes consistency of dimensioned engineering drawings"
, journal =	"SIAM J. Discrete Math."
, volume =	2
, year =	1989
, pages =	"255--261"
, update =	"97.11 bibrelex"
}

% , number =	10
% , month =	dec
@article{t-prnie-95
, author =	"George W. Tokarsky"
, title =	"Polygonal Rooms Not Illuminable from Every Point"
, journal =	"Amer. Math. Monthly"
, volume =	102
, year =	1995
, pages =	"867--879"
, keywords =	"billiards, visibility with reflection, geometric optics, simple polygons"
, comments =	"Solves an old geometric problem originally published in
\cite{k-iepri-69} by giving an example of a simple polygon in which there is
a placement of a single point light source that does not light up the polygon,
if the light is allowed to reflect off the polygon walls according to the laws
of geometric optics."
, update =	"99.07 orourke, 96.01 aronov"
}

@techreport{t-dmvdt-88
, author =	"T. Tokuyama"
, title =	"Deformation of merged {Voronoi} diagrams with translation"
, type =	"Report"
, number =	"Rep. TR87-0049"
, institution =	"IBM Tokyo Research Laboratory"
, year =	1988
, update =	"94.09 bernal"
}

@inproceedings{t-mpopm-01
, author =	"Takeshi Tokuyama"
, title =	"Minimax parametric optimization problems and multi-dimensional parametric searching"
, booktitle =	"Proc. 33rd Annu. ACM Sympos. Theory Comput."
, year =	2001
, pages =	"75--83"
, update =	"02.03 cheong"
}

@article{t-oqs-97
, author =	"T. Tokuyama"
, title =	"Orthogonal Queries in Segments"
, journal =	"Algorithmica"
, volume =	18
, year =	1997
, pages =	"229--245"
, update =	"97.11 smid"
}

@inproceedings{t-oqst-94
, author =	"T. Tokuyama"
, title =	"Orthogonal Queries in Segments and Triangles"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"505--513"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
}

@inproceedings{tn-gamca-91
, author =	"T. Tokuyama and J. Nakano"
, title =	"Geometric algorithms for a minimum cost assignment problem"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"262--271"
, keywords =	"optimization"
, cites =	"ae-tpss-87, clr-ia-90, cw-mmap-87, ff-fn-62, fr-etbs-75, ft-fhtui-87, gt-fsanp-89, nt-scs-90, r-lnra-90, ZZZ"
, update =	"97.11 bibrelex"
}

@article{t-aps-93
, author =	"S. Toledo"
, title =	"Approximate parametric search"
, journal =	"Inform. Process. Lett."
, volume =	47
, year =	1993
, pages =	"1--4"
, update =	"96.05 agarwal"
}

@inproceedings{t-epcp-91
, author =	"S. Toledo"
, title =	"Extremal point containment problems"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"176--185"
, keywords =	"optimization, prune and search, lower envelopes"
, cites =	"ab-pcp1s-87, ab-pptr-88, acgoy-pcg-88, ass-sulbl-89, c-pcp-83, c-rcsi-86, ck-plscc-89, ck-hcmpc-90, c-pms-86, e-acg-87, f-fapct-85, grs-kfcg-83, hs-ndssg-86, ks-empac-90, ls-ncfcc-87, ls-pptmc-87, m-apcad-83, py-prp-86, ss-pmp2g-83, v-pcp-75, ZZZ"
, update =	"97.11 bibrelex"
}

@mastersthesis{t-epcpo-91
, author =	"S. Toledo"
, title =	"Extremal Polygon Containment Problems and Other Issues in Parametric Searching"
, type =	"M.S. Thesis"
, school =	"Dept. Comput. Sci., Tel Aviv Univ."
, address =	"Tel Aviv"
, year =	1991
, keywords =	"master thesis"
, succeeds =	"st-epcp-91t"
, update =	"98.11 bibrelex, 96.05 agarwal"
}

@inproceedings{t-mnlcf-92
, author =	"Sivan Toledo"
, title =	"Maximizing non-linear concave functions in fixed dimension"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"676--685"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@incollection{t-mnlcf-93
, author =	"Sivan Toledo"
, title =	"Maximizing non-linear concave functions in fixed dimension"
, editor =	"Panos M. Pardalos"
, booktitle =	"Complexity in Numerical Computations"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1993
, pages =	"429--447"
, update =	"97.03 agarwal"
}

@inproceedings{tx-dtn-95
, author =	"I. G. Tollis and C. Xia"
, title =	"Drawing Telecommunication Networks"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"206--217"
, keywords =	"graph drawing, network visualization"
, update =	"95.01 tamassia"
}

@book{t-giscm-90
, author =	"C. D. Tomlin"
, title =	"Geographic Information Systems and Cartographic Modeling"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs"
, year =	1990
, update =	"96.09 kreveld"
}

@book{tcm-chgd-76
, author =	"R. F. Tomlinson and H. W. Calkins and D. F. Marble"
, title =	"Computer Handling of Geographical Data"
, publisher =	"The UNESCO Press"
, address =	"Paris"
, year =	1976
, update =	"98.11 bibrelex"
}

@inproceedings{t-oswrp-80
, author =	"M. Tompa"
, title =	"An optimal solution to a wire-routing problem"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
, year =	1980
, pages =	"161--176"
, precedes =	"t-oswrp-81"
}

@article{t-oswrp-81
, author =	"M. Tompa"
, title =	"An optimal solution to a wire-routing problem"
, journal =	"J. Comput. Syst. Sci."
, volume =	23
, year =	1981
, pages =	"127--150"
, succeeds =	"t-oswrp-80"
}

@techreport{tj-adoak-82
, author =	"K. T{\"o}nnies and D. Jack{\'e}l"
, title =	"Automatische dreidimensionale {Oberfl{\"a}chenrekonstruktion} aus {Konturlinien} zur {Visualisierung} von komplexen anatomischen"
, type =	"Manuscript"
, institution =	"Inst. Tech. Inform."
, year =	1982
}

@article{t-dmwhf-63
, author =	"A. Toomre"
, title =	"On the distibution of matter within highly flattened galaxies"
, journal =	"The astrophysical J."
, volume =	138
, year =	1963
, pages =	"385--392"
, update =	"97.11 bibrelex"
}

@article{tm-cdsp-84
, author =	"S. B. Tor and A. E. Middleditch"
, title =	"Convex decomposition of simple polygons"
, journal =	"ACM Trans. Graph."
, volume =	3
, year =	1984
, pages =	"244--265"
}

@article{t-cvor-88
, author =	"F. A. Toranzos"
, title =	"Critical Visibility and Outward Rays"
, journal =	"J. Geom."
, volume =	33
, year =	1988
, pages =	"155--167"
, update =	"98.07 bibrelex"
}

@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"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"207--228"
}

@techreport{tt-mtcpc-89
, author =	"C. Torras and F. Thomas"
, title =	"Motion of Two Convex Polyhedra in Contact"
, type =	"Technical {Report}"
, institution =	"Institut de Cibernetica"
, address =	"Barcelona, Spain"
, month =	jul
, year =	1989
, keywords =	"Spatial Reasoning, Motion Representation, Fine Motion Planning, Contact space, Stratification"
, update =	"93.09 milone+mitchell"
}

@inproceedings{t-obspa-90
, author =	"Enric Torres"
, title =	"Optimization of the Binary Space Partition Algorithm ({BSP}) for the Visualization of Dynamic Scenes"
, booktitle =	"Eurographics '90"
, publisher =	"North-Holland"
, year =	1990
, pages =	"507--518"
, update =	"97.07 agarwal"
}

@article{ts-ppp-91
, author =	"Ratko To{\v s}i{\'c} and Ivan Stojmenovi{\'c}"
, title =	"On pairing points in the plane"
, journal =	"Zb. Rad. Prirod.-Mat. Fak. Univ. u Novom Sadu, Ser. Mat."
, volume =	21
, number =	2
, year =	1991
, pages =	"157--160"
, keywords =	"points, matching, segments, intersection"
, update =	"96.09 agarwal, 95.09 korneenko"
, abstract =	"Given a set of $n$ red and $n$ blue points in the plane,
	it is requred to find a nonintersecting red-blue matching,
	i.e., a set of $n$ nonintersecting line segments that connect
	red and blue points in pairs.
	\par
	An $O(n \log^2 n)$ time algorithm for the problem was proposed
	in a-mpp-85.
	The paper under review presents a simpler
	algorithm within the same time complexity bound."
}

@inproceedings{t-nbpp-01
, author =	"Csaba David T\'oth"
, title =	"A Note on Binary Plane Partitions"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
, year =	2001
, pages =	"151--156"
, update =	"01.07 orourke"
}

@article{t-agpgr-00
, author =	"C. D. T{\'o}th"
, title =	"Art gallery problem with guards whose range of vision is $180^\circ$"
, journal =	"Comput. Geom. Theory Appl."
, volume =	17
, year =	2000
, pages =	"121--134"
, update =	"01.04 smid"
}

@inproceedings{t-gdtcp-01
, author =	"Csaba D. T{\'o}th"
, title =	"Guarding Disjoint Triangles and Claws in the Plane"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"137--139"
, update =	"01.04 icking"
}

@inproceedings{t-ipvpl-01
, author =	"Csaba D. T{\'o}th"
, title =	"Illuminating polygons with vertex $\pi$-floodlights"
, editor =	"V. N. Alexandrov and others"
, booktitle =	"Proc. Int. Conf. on Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	2073
, publisher =	"Springer-Verlag"
, year =	2001
, pages =	"772--781"
, comments =	"~(3/4)n"
, update =	"01.11 orourke"
}

@article{t-rtps-86
, author =	"D. L. Toth"
, title =	"On Ray Tracing Parametric Surfaces"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, month =	jul
, year =	1986
, pages =	"171--179"
, update =	"98.03 bibrelex"
}

@inproceedings{t-psmks-00
, author =	"G{\'e}za Toth"
, title =	"Point Sets with Many $k$-Sets"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"37--42"
, update =	"00.11 jones"
}

@article{t-psmks-01
, author =	"G{\'e}za Toth"
, title =	"Point Sets with Many $k$-Sets"
, journal =	"Discrete Comput. Geom."
, volume =	26
, number =	2
, year =	2001
, pages =	"187--194"
, update =	"01.11 pocchiola"
}

@article{t-sdpgp-97
, author =	"G. {T{\'o}th}"
, title =	"The shortest distance among points in general position"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, year =	1997
, pages =	"33--38"
, update =	"97.07 devillers"
}

@article{tv-nest-98
, author =	"G. T{\'o}th and P. Valtr"
, title =	"Note on the {Erd{\H{o}}s-Szekeres} theorem"
, journal =	"Discrete Comput. Geom."
, volume =	19
, year =	1998
, pages =	"457--450"
, update =	"02.03 devillers"
}

@incollection{t-nrtpc-83
, author =	"G. F. T{\'o}th"
, title =	"New results in the theory of packing and covering"
, editor =	"P. M. Gruber and J. M. Wills"
, booktitle =	"Convexity and its applications"
, publisher =	"Birkh{\"a}user"
, address =	"Basel, Switzerland"
, year =	1983
, pages =	"318--359"
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@incollection{ft-pc-97
, author =	"G. Fejes T{\'o}th"
, title =	"Packing and covering"
, chapter =	2
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"19--42"
, update =	"97.11 orourke"
}

@inproceedings{tg-tmc-98
, author =	"C. Touma and C. Gotsman"
, title =	"Triangle mesh compression"
, booktitle =	"Graphics Interface"
, year =	1998
, pages =	"26--34"
, update =	"01.07 devillers"
}

@techreport{t-srct-73
, author =	"G. Tourlakis"
, title =	"Some results in computational topology"
, type =	"Report"
, number =	50
, institution =	"Dept. Comput. Sci., Univ. Toronto"
, address =	"Toronto, ON"
, year =	1973
, precedes =	"tm-srct-72"
}

@inproceedings{tm-srct-72
, author =	"G. Tourlakis and J. Mylopoulos"
, title =	"Some results in computational topology"
, booktitle =	"Proc. 13th Annu. IEEE Sympos. Switching Automata Theory"
, year =	1972
, pages =	"40--51"
, succeeds =	"t-srct-73"
, precedes =	"tm-srct-73"
}

@article{tm-srct-73
, author =	"G. Tourlakis and J. Mylopoulos"
, title =	"Some results in computational topology"
, journal =	"J. ACM"
, volume =	20
, year =	1973
, pages =	"439--455"
, succeeds =	"tm-srct-72"
}

@techreport{t-ocspt-88
, author =	"G. Toussaint"
, title =	"An output-complexity-sensitive polygon triangulation algorithm"
, type =	"Technical {Report}"
, number =	"SOCS-88.11"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1988
, update =	"97.11 bibrelex"
}

@techreport{t-apctd-
, author =	"G. Toussaint"
, title =	"Approximating polygonal curves in three-dimensions"
, type =	"Manuscript"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	"??"
, update =	"97.11 bibrelex"
}

@techreport{t-cgcv-90
, author =	"G. Toussaint"
, title =	"Computational geometry and computer vision"
, type =	"Technical {Report}"
, number =	"SOCS 90.7"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@techreport{t-cgm-86
, author =	"G. Toussaint"
, title =	"Computational geometry and morphology"
, type =	"Technical {Report}"
, number =	"SOCS-86.3"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1986
, update =	"97.11 bibrelex"
}

@book{t-cm-88
, title =	"Computational Morphology"
, editor =	"G. Toussaint"
, publisher =	"North-Holland"
, year =	1988
, update =	"97.11 bibrelex"
}

@techreport{t-cgpis-90
, author =	"G. Toussaint"
, title =	"Computing Geodesic Properties inside a Simple Polygon"
, number =	"??"
, institution =	"School of Computer Science, McGill University"
, year =	1990
}

@article{t-etsp-91
, author =	"G. Toussaint"
, title =	"Efficient triangulation of simple polygons"
, journal =	"Visual Comput."
, volume =	7
, year =	1991
, pages =	"280--295"
, keywords =	"computational geometry, triangulation"
, abstract =	"This paper considers the topic of efficiently
		 triangulating a simple polygon with emphasis on
		 practical and easy-to-implement algorithms. It also
		 describes a new adaptive algorithms for triangulating a
		 simple n-sided polygon. The algorithm runs in time
		 O(n(1 plus t//0)) with t//0 less than n. The quantity
		 t//0 measures the shape-complexity of the triangulation
		 delivered by the algorithm. More precisely t//0 is the
		 number of obtained triangles contained in the
		 triangulation that share zero edges with the input
		 polygon and is, furthermore, related to the
		 shape-complexity of the input polygon. Although the
		 worst-case complexity of the algorithm is O(n**2), for
		 several classes of polygons it runs in linear time. The
		 practical advantages of the algorithm are that it is
		 simple and does not require sorting or the use of
		 balanced tree structures. On the theoretical side, it
		 is of interest because it is the first polygon
		 triangulation algorithm where the computational
		 complexity is a function of the output complexity. As a
		 side benefit, we introduce a new measure of the
		 complexity of a polygon triangulation that should find
		 application in other contexts as well. (Author
		 abstract) Refs."
}

@article{t-stsps-89
, author =	"G. Toussaint"
, title =	"On separating two simple polygons by a single translation"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"265--278"
}

@inproceedings{t-qps-95
, author =	"G. Toussaint"
, title =	"Quadrangulations of planar sets"
, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
, nickname =	"WADS '95"
, site =	"Kingston, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"218--227"
, update =	"99.07 bibrelex, 98.07 bibrelex"
}

@techreport{td-chrl-90
, author =	"G. Toussaint and L. Devroye"
, title =	"Convex Hulls for Random Lines"
, type =	"Technical {Report}"
, number =	"SOCS 90.11"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{tvwz-tsnsp-93
, author =	"G. Toussaint and C. Verbrugge and C. Wang and B. Zhu"
, title =	"Tetrahedralization of simple and non-simple polyhedra"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"24--29"
, cites =	"aap-ptem-86, b-ip-48a, c-tsplt-91a, cp-tncp-90, gp-cdpb-88, l-tsfpp-11, o-agta-87, rs-dttdn-92, s-udzvd-28, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@incollection{t-ghtt-88
, author =	"G. T. Toussaint"
, title =	"A geodesic {Helly}-type theorem"
, editor =	"G. T. Toussaint"
, booktitle =	"Snapshots of Computational and Discrete Geometry"
, publisher =	"McGill University"
, address =	"Montreal, PQ"
, year =	1988
, note =	"Technical Report SOCS-88.11"
, update =	"98.07 bibrelex"
}

@incollection{t-gtps-88
, author =	"G. T. Toussaint"
, title =	"A graph-theoretical primal sketch"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Morphology"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1988
, pages =	"229--260"
}

@article{t-hnchf-85
, author =	"G. T. Toussaint"
, title =	"A historical note on convex hull finding algorithms"
, journal =	"Pattern Recogn. Lett."
, volume =	3
, year =	1985
, pages =	"21--28"
}

@techreport{t-ltass-86t
, author =	"G. T. Toussaint"
, title =	"A linear-time algorithm for solving the strong hidden-line problem in a simple polygon"
, type =	"Report"
, number =	"SOCS-86.2"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1986
, precedes =	"t-ltass-86a"
}

@article{t-ltass-86a
, author =	"Godfried T. Toussaint"
, title =	"A linear-time algorithm for solving the strong hidden-line problem in a simple polygon"
, journal =	"Pattern Recogn. Lett."
, volume =	4
, year =	1986
, pages =	"449--451"
, succeeds =	"t-ltass-86t"
, abstract =	"A linear-time algorithm is presented for solving the
		 strong hidden-line problem in a simple polygon P, or
		 alternately, determining the region in P weakly visible
		 from a specified edge of P. The algorithm combines
		 results from visibility and shortest paths with the
		 linear-time polygon triangulation algorithm discovered
		 recently by Tarjan and Van Wyk. Previous published
		 algorithms for the strong hidden-line problem require
		 O(n log n) steps even after triangulation, where n is
		 the cardinality of P"
}

@article{t-ncsup-01
, author =	"Godfried T. Toussaint"
, title =	"A new class of stuck unknots in Pol-6"
, journal =	"Contributions to Algebra and Geometry"
, volume =	42
, number =	2
, year =	2001
, pages =	"301--306"
, update =	"02.03 orourke"
}

@techreport{t-ncsup6-99
, author =	"G. T. Toussaint"
, title =	"A new class of stuck unknots in {${\rm Pol}_6$}"
, number =	"SOCS-99.1"
, institution =	"School of Comput. Sci., McGill Univ."
, month =	apr
, year =	1999
, update =	"99.07 orourke"
}

@techreport{t-nlatm-83
, author =	"G. T. Toussaint"
, title =	"A New Linear Algorithm for Triangulating Monotone Polygons"
, number =	"SOCS 83.9"
, institution =	"McGill University"
, year =	1983
, annote =	"$O(n)$ algorithm for decomposing monotone into
		 edge-visible (which can be done in linear time)."
}

@techreport{t-nlesp-90
, author =	"G. T. Toussaint"
, title =	"A new look at {Euclid}'s second proposition"
, type =	"Report"
, number =	"SOCS-90.21"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
}

@article{t-slaic-85
, author =	"G. T. Toussaint"
, title =	"A simple linear algorithm for intersecting convex polygons"
, journal =	"Visual Comput."
, volume =	1
, year =	1985
, pages =	"118--123"
}

@article{t-sppet-82
, author =	"G. T. Toussaint"
, title =	"A simple proof of {Pach}'s extremal theorem for convex polygons"
, journal =	"Pattern Recogn. Lett."
, volume =	1
, year =	1982
, pages =	"85--86"
}

@article{t-acrng-80
, author =	"G. T. Toussaint"
, title =	"Algorithms for computing relative neighbourhood graph"
, journal =	"Electron. Lett."
, volume =	16
, number =	22
, year =	1980
, pages =	860
}

@inproceedings{t-oacmv-83
, author =	"G. T. Toussaint"
, title =	"An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons"
, editor =	"457--458"
, booktitle =	"Proc. 21st Allerton Conf. Commun. Control Comput."
, year =	1983
, update =	"97.11 bibrelex"
}

@inproceedings{t-oacmv-84i
, author =	"G. T. Toussaint"
, title =	"An Optimal Algorithm For Computing the Minimum Vertex Distance Between Two Crossing Convex Polygons"
, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn."
, year =	1984
, pages =	"465--467"
, precedes =	"t-oacmv-84a"
}

@article{t-oacmv-84a
, author =	"G. T. Toussaint"
, title =	"An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons"
, journal =	"Computing"
, volume =	32
, year =	1984
, pages =	"357--364"
, keywords =	"Voronoi diagrams"
, succeeds =	"t-oacmv-84i"
, annote =	"Linear algorithm. Exploits the fact that VD outside
		 and above semi-circle polygon can be constructed in
		 linear time."
}

@incollection{t-oacrc-86
, author =	"G. T. Toussaint"
, title =	"An optimal algorithm for computing the relative convex hull of a set of points in a polygon"
, booktitle =	"Signal Processing III: Theories and Applications"
, publisher =	"Proc. 3rd European Signal Process. Conf."
, year =	1986
, pages =	"853--856"
}

@techreport{t-ocspt-90
, author =	"G. T. Toussaint"
, title =	"An output-complexity-sensitive polygon triangulation algorithm"
, type =	"Report"
, number =	"SOCS-90.1"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, month =	feb
, year =	1990
, comments =	"Replaces report SOCS-88.10 (June 1988)"
}

% ### one of t-acrng-80 and t-cacrn-80 is duplicate
@article{t-cacrn-80
, author =	"G. T. Toussaint"
, title =	"Comment on algorithms for computing relative neighbourhood graph"
, journal =	"Electron. Lett."
, volume =	16
, year =	1980
, pages =	860
}

@inproceedings{t-ccu-84
, author =	"G. T. Toussaint"
, title =	"Complexity, convexity, and unimodality"
, booktitle =	"Proc. 2nd World Conf. Math."
, site =	"Las Palmas, Spain"
, year =	1984
, update =	"99.11 bibrelex"
}

@article{t-ccu-84a
, author =	"G. T. Toussaint"
, title =	"Complexity, convexity, and unimodality"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	13
, number =	3
, month =	jun
, year =	1984
, pages =	"197--217"
, update =	"98.03 bibrelex"
}

@incollection{t-cgppr-82
, author =	"G. T. Toussaint"
, title =	"Computational geometric problems in pattern recognition"
, editor =	"J. Kittler and K. S. Fu and L. F. Pau"
, booktitle =	"Pattern Recognition Theory and Application"
, publisher =	"D. Reidel Publishing Company"
, address =	"Boston, MA"
, year =	1982
, pages =	"73--91"
}

@book{t-cg-85
, title =	"Computational Geometry"
, editor =	"G. T. Toussaint"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, keywords =	"book"
}

@inproceedings{t-cgrd-89
, author =	"G. T. Toussaint"
, title =	"Computational geometry: recent developments"
, booktitle =	"New Advances in Computer Graphics: Proceedings of Computer Graphics International '89"
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"23--51"
, keywords =	"survey paper"
}

@article{t-cgpis-89
, author =	"Godfried T. Toussaint"
, title =	"Computing Geodesic Properties inside a Simple Polygon"
, journal =	"Revue D'Intelligence Artificielle"
, volume =	3
, number =	2
, year =	1989
, pages =	"9--42"
, note =	"also available as technical report SOCS 88.20, School of Computer Science, McGill University"
, update =	"98.11 bibrelex"
}

@techreport{t-cgpp-86
, author =	"G. T. Toussaint"
, title =	"Computing geodesic properties of polygons"
, type =	"Manuscript"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{t-clecl-83
, author =	"G. T. Toussaint"
, title =	"Computing largest empty circles with location constraints"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	12
, year =	1983
, pages =	"347--358"
, update =	"97.07 kuehn"
}

@inproceedings{t-dsprn-80
, author =	"G. T. Toussaint"
, title =	"Decomposing a simple polygon with the relative neighborhood graph"
, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
, year =	1980
, pages =	"20--28"
}

@techreport{t-mss-84
, author =	"G. T. Toussaint"
, title =	"Movable Separability of Sets"
, type =	"Technical {Report}"
, number =	"SOCS-84.17"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, month =	nov
, year =	1984
, update =	"97.11 bibrelex"
}

@incollection{t-mss-85
, author =	"G. T. Toussaint"
, title =	"Movable separability of sets"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"335--375"
}

@incollection{t-nrcgr-86
, author =	"G. T. Toussaint"
, title =	"New results in computational geometry relevant to pattern recognition in practice"
, editor =	"E. S. Gelsema and L. N. Kanal"
, booktitle =	"Pattern Recognition in Practice II"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1986
, pages =	"135--146"
}

@article{t-achha-83
, author =	"G. T. Toussaint"
, title =	"On the application of the convex hull to histogram analysis in threshold selection"
, journal =	"Pattern Recogn. Lett."
, volume =	2
, year =	1983
, pages =	"75--77"
}

@inproceedings{t-capcp-85
, author =	"G. T. Toussaint"
, title =	"On the complexity of approximating polygonal curves in the plane"
, booktitle =	"Proc. IASTED, International Symposium on Robotics and Automation"
, site =	"Lugano, Switzerland"
, year =	1985
, pages =	""
, update =	"96.09 orourke"
}

@inproceedings{t-prgc-80
, author =	"G. T. Toussaint"
, title =	"Pattern recognition and geometrical complexity"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
, year =	1980
, pages =	"1324--1347"
}

@techreport{t-spsee-85
, author =	"G. T. Toussaint"
, title =	"Shortest Path Solves Edge-to-Edge Visibility in a Polygon"
, type =	"Technical {Report}"
, number =	"SOCS-85.19"
, institution =	"School of Computer Science, McGill University"
, address =	"Montreal, Quebec, Canada"
, year =	1985
, update =	"93.09 milone+mitchell"
}

@article{t-spsee-86
, author =	"G. T. Toussaint"
, title =	"Shortest path solves edge-to-edge visibility in a polygon"
, journal =	"Pattern Recogn. Lett."
, volume =	4
, year =	1986
, pages =	"165--170"
, update =	"98.07 bibrelex"
}

@techreport{t-spsts-85
, author =	"G. T. Toussaint"
, title =	"Shortest path solves translation separability of polygons"
, type =	"Report"
, number =	"SOCS-85.27"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1985
}

@inproceedings{t-sgprc-83
, author =	"G. T. Toussaint"
, title =	"Solving geometric problems with the rotating calipers"
, booktitle =	"Proc. IEEE MELECON '83"
, site =	"Athens, Greece"
, year =	1983
, pages =	"A10.02/1--4"
, update =	"97.11 bibrelex, 93.05 jones"
, abstract =	"M. I. Shamos (1978) recently showed that the diameter of
		 a convex $n$-sided polygon could be computed in $O(n)$ time using an
		 elegant and simple procedure which resembles rotating a set of calipers
		 once around the polygon.  It is shown that this simple idea can be
		 generalized in two ways:  several sets of calipers can be used
		 simultaneously on one convex polygon, or one set of calipers can be used
		 on several convex polygons simultaneously.  These generalizations make it
		 possible to obtain simple $O(n)$ algorithms for solving a variety of
		 problems defined on convex polygons.  Such problems include (1) finding
		 the minimum-area rectangle enclosing a convex polygon, (2) computing the
		 maximum distance between two polygons, (3) performing the vector-sum of
		 two convex polygons, (4) merging convex polygons in convex hull finding
		 algorithms, and (5) finding the critical support lines between two convex
		 polygons.  Finding the critical support lines leads to obtaining solutions
		 of several additional problems concerned with visibility, collision
		 avoidance, range fitting, linear separability, and computing the Grenander
		 distance between sets."
}

@incollection{t-scapp-88
, author =	"G. T. Toussaint"
, title =	"Some collision avoidance problems in the plane"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI Series~F"
, volume =	40
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"639--672"
, update =	"99.11 bibrelex"
}

@inproceedings{t-chtpr-78
, author =	"G. T. Toussaint"
, title =	"The convex hull as a tool in pattern recognition"
, booktitle =	"Proc. AFOSR Workshop Comm. Theory Appl."
, site =	"Princetown, MA"
, year =	1978
, pages =	"43--46"
}

@inproceedings{t-entir-99
, author =	"G. T. Toussaint"
, title =	"The {E}rd{\H o}s-{N}agy theorem and its ramifications"
, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
, year =	1999
, pages =	"9--12"
, comments =	"Fuller version in Electronic proceedings
		http://www.cs.ubc.ca/conferences/CCCG/elecproc.html"
, update =	"00.03 orourke"
}

@techreport{t-pfpvd-81
, author =	"G. T. Toussaint"
, title =	"The planar furthest-point {Voronoi} diagram in the {$L_{1}$} ({$L_{\infty}$}) metrics can be computed in {$O(n)$} worst-case time"
, type =	"Report"
, number =	"SOCS 81.10"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1981
}

@article{t-rngfp-80
, author =	"G. T. Toussaint"
, title =	"The relative neighbourhood graph of a finite planar set"
, journal =	"Pattern Recogn."
, volume =	12
, year =	1980
, pages =	"261--268"
}

@techreport{t-safnp-81
, author =	"G. T. Toussaint"
, title =	"The symmetric all-furthest-neighbor problem"
, type =	"Report"
, number =	"SOCS 81.5"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1981
}

@article{t-safnp-83
, author =	"G. T. Toussaint"
, title =	"The symmetric all-furthest neighbor problem"
, journal =	"J. Comp. Math. Appl."
, volume =	9
, number =	6
, year =	1983
, pages =	"747--754"
, update =	"98.03 bibrelex"
}

@techreport{tad-echap-78
, author =	"G. T. Toussaint and S. G. Akl and L. P. Devroye"
, title =	"Efficient convex hull algorithms for points in two and more dimensions"
, type =	"Report"
, number =	"SOCS 78.5"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1978
}

@article{ta-chapi-82
, author =	"G. T. Toussaint and D. Avis"
, title =	"On a convex hull algorithm for polygons and its application to triangulation problems"
, journal =	"Pattern Recogn."
, volume =	15
, number =	1
, year =	1982
, pages =	"23--29"
, keywords =	"polygons, triangulation, convex hull"
, update =	"98.11 bibrelex"
}

@techreport{tb-facdf-??
, author =	"G. T. Toussaint and B. K. Bhattacharya"
, title =	"Fast algorithms for computing the diameter of a finite planar set"
, type =	"Report"
, number =	"??"
, institution =	"??"
, year =	"??"
, update =	"94.05 devillers"
}

@techreport{tb-gaufn-81
, author =	"G. T. Toussaint and B. K. Bhattacharya"
, title =	"On geometric algorithms that use the furthest-neighbor pair of a finite planar set"
, institution =	"School of Computer Science, McGill University"
, year =	1981
, update =	"98.03 bibrelex"
}

@techreport{tb-gatuf-81
, author =	"G. T. Toussaint and B. K. Bhattacharya"
, title =	"On geometric algorithms that use the furthest-point {Voronoi} diagram"
, type =	"Report"
, number =	"81.3"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1981
, precedes =	"bt-gatuf-85"
}

@article{tb-oacmd-83
, author =	"G. T. Toussaint and B. K. Bhattacharya"
, title =	"Optimal algorithms for computing the minimum distance between two finite planar sets"
, journal =	"Pattern Recogn. Lett."
, volume =	2
, year =	1983
, pages =	"79--82"
}

@inproceedings{tbp-avdnd-85
, author =	"G. T. Toussaint and B. K. Bhattacharya and R. S. Poulsen"
, title =	"The Application of {Voronoi} Diagrams to Nonparametric Decision Rules"
, booktitle =	"Computer Science and Statistics: The Interface"
, year =	1985
, pages =	"97--108"
, annote =	"NN-rule classifies a point according to class of
		 nearest point. That is VD of point sets. Redundant
		 points for this can be discarded."
}

@article{te-cacmh-83
, author =	"G. T. Toussaint and H. ElGindy"
, title =	"A counterexample to an algorithm for computing monotone hulls of simple polygons"
, journal =	"Pattern Recogn. Lett."
, volume =	1
, year =	1983
, pages =	"219--222"
}

@article{te-stmpl-84
, author =	"G. T. Toussaint and H. ElGindy"
, title =	"Separation of two monotone polygons in linear time"
, journal =	"Robotica"
, volume =	2
, year =	1984
, pages =	"215--220"
}

@techreport{te-tgass-81
, author =	"G. T. Toussaint and H. ElGindy"
, title =	"Traditional galleries are star-shaped if every two paintings are visible from some common point"
, type =	"Report"
, number =	"SOCS-81.10"
, institution =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1981
}

@article{tm-soafm-82
, author =	"G. T. Toussaint and M. A. McAlear"
, title =	"A simple {$O(n \log n)$} algorithm for finding the maximum distance between two finite planar sets"
, journal =	"Pattern Recogn. Lett."
, volume =	1
, year =	1982
, pages =	"21--24"
}

@inproceedings{tm-facpr-80
, author =	"G. T. Toussaint and R. Menard"
, title =	"Fast algorithms for computing the planar relative neighborhood graph"
, booktitle =	"Proc. 5th Sympos. Methods Oper. Res."
, site =	"K{\"o}ln, West Germany"
, year =	1980
, pages =	"??"
}

@inproceedings{tp-snasi-79
, author =	"G. T. Toussaint and R. S. Poulsen"
, title =	"Some new algorithms and software implementation methods for pattern recognition research"
, booktitle =	"Proc. IEEE Internat. Comput. Software Applications Conf."
, year =	1979
, pages =	"55--63"
}

@inproceedings{ts-snrmp-83
, author =	"G. T. Toussaint and J.-R. Sack"
, title =	"Some new results on moving polygons in the plane"
, booktitle =	"Proc. Robotics, Intelligence and Productivity Conf."
, site =	"Detroit, MI"
, year =	1983
, pages =	"158--163"
, keywords =	"robotics, motion planning, separation, path planning, polygons, two-dimensional"
}

@phdthesis{t-iaf-84
, author =	"B. M. Trager"
, title =	"Integration of algebraic functions"
, school =	"MIT"
, year =	1984
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{t-nmaud-96
, author =	"L. Trevisan"
, title =	"A note on minimum-area upward drawing of complete and {Fibonacci} trees"
, journal =	"Inform. Process. Lett."
, volume =	57
, number =	5
, year =	1996
, pages =	"231--236"
, update =	"96.09 orourke"
}

@inproceedings{t-whmet-97
, author =	"L. Trevisan"
, title =	"When {Hamming} meets {Euclid}: The approximability of geometric {TSP} and {MST}"
, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
, nickname =	"STOC '97"
, year =	1997
, pages =	"21--29"
, update =	"98.07 bibrelex, 98.03 mitchell+smid"
}

@inproceedings{t-dgds-88
, author =	"H. Trickey"
, title =	"Drag: {A} Graph Drawing System"
, booktitle =	"Proc. Internat. Conf. on Electronic Publishing"
, publisher =	"Cambridge University Press"
, year =	1988
, pages =	"171--182"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{td-cm-88
, author =	"Anne Sjerp Troelstra and Dirk {van Dalen}"
, title =	"Constructivism in Mathematics"
, series =	"Studies in Logic and the Foundations of Mathematics"
, publisher =	"Elsevier Science Publishers, North Holland"
, address =	"Amsterdam"
, year =	1988
, update =	"98.11 bibrelex"
}

@book{t-cpos-92
, author =	"William T. Trotter"
, title =	"Combinatorics and Partially Ordered Sets: Dimension Theory"
, series =	"Johns Hopkins Series in the Mathematical Sciences"
, publisher =	"The Johns Hopkins University Press"
, year =	1992
, update =	"96.05 pascucci"
}

@article{tm-dpp-77
, author =	"W. T. Trotter and J. Moore"
, title =	"The Dimension of Planar Posets"
, journal =	"J. Combin. Theory Ser. B"
, volume =	22
, year =	1977
, pages =	"54--67"
, update =	"95.01 tamassia"
}

@inproceedings{tw-oacp-97
, author =	"Kuo-Hui Tsai and Da-Wei Wang"
, title =	"Optimal Algorithm for Circle Partitioning"
, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '97"
, site =	"Shanghai, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	1276
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"304--310"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@phdthesis{t-pvldp-93
, author =	"L.-H. Tseng"
, title =	"Some Polygon Visibility and Link Distance Problems"
, school =	"Department of Electrical Engineering and Computer Science, Northwest University"
, month =	jun
, year =	1993
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@article{thl-tgwsp-98
, author =	"L. H. Tseng and P. Heffernan and D. T. Lee"
, title =	"Two-Guard Walkability of Simple Polygons"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, number =	1
, year =	1998
, pages =	"85--116"
, url =	"http://www.ece.nwu.edu/~dtlee/IJCGA_twoguard.ps.Z"
, succeeds =	"tl-tgwsp-93"
, update =	"98.11 bibrelex, 98.07 icking"
}

@techreport{tl-tgwsp-93
, author =	"L. H. Tseng and D. T. Lee"
, title =	"Two-Guard Walkability of Simple Polygons"
, type =	"Manuscript"
, institution =	"Department of Electrical and Computer Engineering, Northwestern University"
, year =	1993
, precedes =	"thl-tgwsp-98"
, update =	"98.11 bibrelex, 98.03 bibrelex"
}

@article{tj-dftad-91
, author =	"Y.-J. Tseng and S. Joshi"
, title =	"Determining feasible tool-approach directions for machining {B{\'e}zier} curves and surfaces"
, journal =	"Comput. Aided Design"
, volume =	23
, year =	1991
, pages =	"367--379"
, update =	"98.11 bibrelex"
}

@techreport{t-ltawv-89
, author =	"N. Tsikopoulos"
, title =	"A Linear Triangulation Algorithm for Weakly-Visible Polygons"
, type =	"Technical {Report}"
, number =	"89.03.81"
, institution =	"Univ. of Patras"
, address =	"Greece"
, year =	1989
, update =	"93.09 milone+mitchell"
}

@article{t-hmao-84
, author =	"T. Tsiligirides"
, title =	"Heuristic Methods Applied to Orienteering"
, journal =	"Journal of the Operational Research Society"
, volume =	35
, number =	9
, year =	1984
, pages =	"797--809"
, update =	"98.03 mitchell"
}

@inproceedings{tw-fgvdp-90
, author =	"Y. H. Tsin and C. A. Wang"
, title =	"Finding geodesic {Voronoi} diagrams of points in the presence of rectilinear barriers"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"227--231"
, cites =	"ZZZ"
, update =	"98.07 bibrelex"
}

@article{tt-afplp-94
, author =	"X. Tu and D. Terzopoulos"
, title =	"Artificial fishes: Physics, locomotion, perception, behavior"
, journal =	"Comput. Graph."
, volume =	"??"
, year =	1994
, pages =	"43--50"
, note =	"Proc. SIGGRAPH '94"
, update =	"97.11 bibrelex"
}

@article{tc-rsfcp-90
, author =	"M. Tuceryan and T. Chorzempa"
, title =	"Relative sensitivity of a family of closest-point graphs in computer vision applications"
, journal =	"Pattern Recogn."
, volume =	"??"
, year =	1990
, pages =	"361--373"
, keywords =	"Voronoi tessellation, Delaunay triangulation, minimum spanning tree, relative neighborhood graph, Gabriel graph, closest-point graph, Hough transform, perceptual grouping, computer vision"
, update =	"93.09 milone+mitchell"
}

@article{tj-tsuvp-90
, author =	"M. Tuceryan and A. K. Jain"
, title =	"Texture Segmentation Using {Voronoi} Polygons"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	12
, number =	2
, year =	1990
, pages =	"211--216"
, annote =	"Compute DT of points and area elongation etc for VPs.
		 Break edges connecting dissimilar polygons."
}

@article{tw-oacpp-84
, author =	"A. Tucker and D. Wilson"
, title =	"An {$O(N^{2})$} algorithm for coloring perfect planar graphs"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"60--68"
}

@book{t-ei-90
, author =	"E. R. Tufte"
, title =	"Envisioning Information"
, publisher =	"Graphics Press"
, address =	"Cheshire, Connecticut"
, year =	1990
, update =	"96.09 tamassia, 96.04 garg"
}

@book{t-vdqi-83
, author =	"E. R. Tufte"
, title =	"The Visual Display of Quantative Information"
, publisher =	"Graphics Press"
, address =	"Cheshire, Connecticut"
, year =	1983
, update =	"96.09 tamassia, 96.04 garg"
}

@techreport{t-padug-94
, author =	"D. Tunkelang"
, title =	"A practical approach to drawing undirected graphs"
, type =	"Technical Report"
, number =	"CMU-CS-94-161"
, institution =	"School Comput. Sci., Carnegie Mellon University"
, month =	jun
, year =	1994
, update =	"98.07 vismara"
}

@inproceedings{tbc-lnuig-97
, author =	"Daniel Tunkelang and Roy J. Byrd and James W. Cooper"
, title =	"Lexical Navigation: Using Incremental Graph Drawing for Query Refinement"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"316--321"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@inproceedings{t-sman-94
, author =	"S. T. Tuohy"
, title =	"A Simulation Model for AUV Navigation"
, booktitle =	"Proc. 1994 Symposium on Autonomous Underwater Vehicle Technology"
, year =	1994
, pages =	"470--478"
, update =	"95.05 abrams"
}

@phdthesis{t-gmrai
, author =	"S. T. Tuohy"
, title =	"Geophysical Map Representation, Abstraction and Interrogation for Autonomous Underwater Vehicle Navigation"
, type =	"Ph.{D}. Thesis"
, school =	"Massachusetts Institute of Technology"
, address =	"Cambridge, Massachusetts"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"95.05 abrams"
}

@article{tb-ldahd-93
, author =	"S. T. Tuohy and L. Bardis"
, title =	"Low Degree Approximation of High Degree {B}-Spline Surfaces"
, journal =	"Engineering with Computers"
, volume =	9
, number =	4
, year =	1993
, pages =	"198--209"
, update =	"95.05 abrams"
}

@article{tlbpc-mbnau-94
, author =	"S. T. Tuohy and J. J. Leonard and J. G. Bellingham and N. M. Patrikalakis and C. Chryssostomidis"
, title =	"Map Based Navigation for Autonomous Underwater Vehicles"
, journal =	"International Journal of Offshore and Polar Engineering"
, volume =	"??"
, month =	"June/September"
, year =	1995
, note =	"To appear"
, update =	"95.05 abrams"
}

@inproceedings{tmp-igmua-93
, author =	"S. T. Tuohy and T. Maekawa and N. M. Patrikalakis"
, title =	"Interrogation of Geophysical Maps with Uncertainty for AUV Micro-Navigation"
, booktitle =	"Proc. Oceans '93: Engineering in Harmony with the Ocean"
, year =	1993
, update =	"95.05 abrams"
}

@inproceedings{tp-grmp-91
, author =	"S. T. Tuohy and N. M. Patrikalakis"
, title =	"Geometric Representation of Marine Propulsors"
, booktitle =	"Proc. Marine Computers '91"
, year =	1991
, pages =	"CC5"
, update =	"95.05 abrams"
}

@inproceedings{tp-rgmu-93
, author =	"S. T. Tuohy and N. M. Patrikalakis"
, title =	"Representation of Geophysical Maps with Uncertainty"
, editor =	"N. Magnenat-Thalmann and D. Thalmann"
, booktitle =	"Proc. CG International '93"
, year =	1993
, pages =	"179--192"
, update =	"95.05 abrams"
}

@inproceedings{tplbc-anugm-93
, author =	"S. T. Tuohy and N. M. Patrikalakis and J. J. Leonard and J. G. Bellingham and C. Chryssostomidis"
, title =	"AUV Navigation Using Geophysical Maps with Uncertainty"
, booktitle =	"Proc. 8th International Symposium on Unmanned Untethered Submersible Technology"
, year =	1993
, pages =	"265--276"
, update =	"95.05 abrams"
}

@inproceedings{typ-i3dng-95
, author =	"S. T. Tuohy and J. W. Yoon and N. M. Patrikalakis"
, title =	"Interrogation of 3-D Nonlinear Geophysical Databases"
, editor =	"J. A. Vince and R. A. Earnshaw"
, booktitle =	"Proc. CG International '95"
, year =	1995
, note =	"To appear"
, update =	"95.05 abrams"
}

@inproceedings{typ-vsvod-95
, author =	"S. T. Tuohy and J. W. Yoon and N. M. Patrikalakis"
, title =	"Volumetric Splines for Visualization of Ocean Data"
, booktitle =	"Proc. of Oceans '95"
, year =	1995
, note =	"To appear"
, update =	"95.05 abrams"
}

@article{t-nw-77
, author =	"P. Tur{\'a}n"
, title =	"A note of welcome"
, journal =	"J. Graph Theory"
, volume =	1
, year =	1977
, pages =	"7--9"
, update =	"98.03 bibrelex"
}

@article{t-frnns-91
, author =	"V. Turau"
, title =	"Fixed-radius near neighbors search"
, journal =	"Inform. Process. Lett."
, volume =	39
, year =	1991
, pages =	"201--203"
, update =	"98.03 devillers"
}

@techreport{t-icdmg-90
, author =	"G. Turk"
, title =	"Interactive collision detection for molecular graphics"
, type =	"Technical {Report}"
, number =	"90-014"
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, month =	jan
, year =	1990
, update =	"98.07 bibrelex"
}

@article{t-rtps-92
, author =	"G. Turk"
, title =	"Re-tiling polygonal surfaces"
, journal =	"Comput. Graphics"
, volume =	26
, number =	2
, year =	1992
, pages =	"55--64"
, note =	"Proc. SIGGRAPH '92"
, keywords =	"model simplification, automatic mesh generation, constrained triangulation, levels-of-detail, shape interpolation, approximation"
, update =	"95.01 mitchell"
, annote =	""
}

@article{tsgcv-atmcs-97
, author =	"G. M. Turkiyyah and D. W. Storti and M. Ganter and H. Chen and M. Vimawala"
, title =	"An Accelerated Triangulation Method for Computing the Skeletons of Free-Form Solid Models"
, journal =	"Comput. Aided Design"
, volume =	29
, number =	1
, month =	jan
, year =	1997
, pages =	"5--19"
, update =	"97.11 held"
}

@techreport{t-psmfm-85
, author =	"J. U. Turner"
, title =	"Precise solid modeling with a faceted modeler"
, type =	"Report"
, number =	"??"
, institution =	"Dept. A74, IBM Corporation"
, year =	1985
}

@article{t-flg-47
, author =	"W. Tutte"
, title =	"The factorization of linear graphs"
, journal =	"J. London Math. Soc."
, volume =	22
, year =	1947
, pages =	"107--111"
, update =	"98.07 bibrelex"
}

@article{t-cpt-62
, author =	"W. T. Tutte"
, title =	"A Census of Planar Triangulation"
, journal =	"Canad. J. Math."
, volume =	14
, year =	1962
, pages =	"21--38"
, update =	"97.11 bibrelex"
}

@article{t-tpg-56
, author =	"W. T. Tutte"
, title =	"A theorem on planar graphs"
, journal =	"Trans. Amer. Math. Soc."
, volume =	82
, year =	1956
, pages =	"99--116"
, update =	"98.11 bibrelex"
}

@article{t-bhcpg-77
, author =	"W. T. Tutte"
, title =	"Bridges and {Hamiltonian} circuits in planar graphs"
, journal =	"Aequationes Mathematicae"
, volume =	15
, year =	1977
, pages =	"1--33"
, update =	"98.11 bibrelex"
}

@book{t-cg-66
, author =	"W. T. Tutte"
, title =	"Connectivity in Graphs"
, publisher =	"University of Toronto Press"
, year =	1966
, update =	"97.11 bibrelex"
}

@article{t-crg-60
, author =	"W. T. Tutte"
, title =	"Convex Representations of Graphs"
, journal =	"Proceedings London Mathematical Society"
, volume =	10
, number =	38
, year =	1960
, pages =	"304--320"
, keywords =	"graph drawing"
, update =	"98.07 tamassia, 95.09 tamassia, 93.09 tamassia"
}

@book{t-gt-84
, author =	"W. T. Tutte"
, title =	"Graph Theory"
, publisher =	"Addison-Wesley"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{t-hdg-63
, author =	"W. T. Tutte"
, title =	"How to Draw a Graph"
, journal =	"Proceedings London Mathematical Society"
, volume =	13
, number =	52
, year =	1963
, pages =	"743--768"
, keywords =	"graph drawing"
, update =	"98.07 tamassia, 95.09 tamassia, 93.09 tamassia"
}

@article{t-scg-59
, author =	"W. T. Tutte"
, title =	"On the Symmetry of Cubic Graphs"
, journal =	"Proc. London Math. Soc."
, volume =	10
, year =	1959
, pages =	"304--320"
, update =	"97.11 bibrelex"
}

@article{t-ttcn-70
, author =	"W. T. Tutte"
, title =	"Toward a theory of crossing numbers"
, journal =	"J. Combin. Theory"
, volume =	8
, year =	1970
, pages =	"45--53"
, update =	"97.11 bibrelex"
}

@incollection{t-wim-73
, author =	"W. T. Tutte"
, title =	"What is a Map?"
, booktitle =	"New Directions in the Theory of Graphs"
, publisher =	"Academic Press"
, year =	1973
, update =	"97.11 bibrelex"
}

@article{t-cgcbs-84
, author =	"Z. Tuza"
, title =	"Covering of graphs by complete bipartite subgraphs: complexity of $0-1$ matrices"
, journal =	"Combinatorica"
, volume =	4
, year =	1984
, pages =	"111--116"
, update =	"98.03 bibrelex"
}

@article{t-grt-66
, author =	"H. Tverberg"
, title =	"A generalization of {Radon}'s theorem"
, journal =	"J. London Math. Soc."
, volume =	41
, year =	1966
, pages =	"123--128"
, update =	"97.11 bibrelex"
}

@article{t-sppcs-79
, author =	"H. Tverberg"
, title =	"A separation property of plane convex sets"
, journal =	"Math. Scand."
, volume =	45
, year =	1979
, pages =	"225--260"
}

@article{t-pgcct-89
, author =	"H. Tverberg"
, title =	"Proof of {Gr{\"u}nbaum}'s conjecture on common transversals for translates"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"191--203"
, update =	"93.09 rote"
}

@article{uot-cdms-83
, author =	"T. Uchiki and T. Ohashi and M. Tokoro"
, title =	"Collision Detection in Motion Simulation"
, journal =	"Comput. \& Graphics"
, volume =	7
, number =	"3--4"
, year =	1983
, pages =	"285--293"
, update =	"95.01 mitchell"
}

@inproceedings{ut-r3dso-97
, author =	"G{\"o}kt{\"u}rk {\"U}{\c c}oluk and {\.I}. Hakk{\i} Toroslu"
, title =	"Reconstruction of 3--{D} Surface Object from its Pieces"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"187--192"
, update =	"97.11 jones"
}

@inproceedings{u-cdacc-77
, author =	"S. Udupa"
, title =	"Collision detection and avoidance in computer controlled manipulators"
, booktitle =	"Proc. Internat. Joint Conf. Artif. Intell."
, year =	1977
, pages =	"737--748"
, update =	"98.03 bibrelex"
}

% ### others?
@article{uo-cibtd-88
, author =	"J. L. Udy and others"
, title =	"Computation of Interferences between Three-Dimensional Objects and the Optimal Packing Problem"
, journal =	"Adv. Eng. Softw."
, volume =	10
, number =	1
, year =	1988
, pages =	"8--12"
, update =	"93.09 held"
}

@book{u-ascan-84
, author =	"L. Uhr"
, title =	"Algorithms- Structured Computer Arrays and Networks"
, publisher =	"Academic Press"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{u-lrcnt-72
, author =	"L. Uhr"
, title =	"Layered ``recognition cone'' networks that preprocess, classify and describe"
, journal =	"IEEE Trans. Comput."
, volume =	"C-21"
, year =	1972
, pages =	"758--768"
, update =	"97.11 bibrelex"
}

@incollection{u-pcv-60
, author =	"S. M. Ulam"
, title =	"A Problem in the Calculus of Variations"
, chapter =	"VI, Section 9"
, booktitle =	"A Collection of Mathematical Problems"
, publisher =	"Interscience Publishers"
, year =	1960
, update =	"98.03 bibrelex"
}

@book{u-pmm-64
, author =	"S. M. Ulam"
, title =	"Problems of Modern Mathematics"
, publisher =	"Science Editions"
, address =	"New York"
, year =	1964
, update =	"97.11 bibrelex"
}

@book{u-cav-84
, author =	"J. D. Ullman"
, title =	"Computational Aspects of {VLSI}"
, publisher =	"Computer Science Press"
, year =	1984
, update =	"97.11 bibrelex"
}

@book{u-cav-92
, author =	"J. D. Ullman"
, title =	"Computational Aspects of {VLSI}"
, publisher =	"Morgan-Kaufmann"
, address =	"San Mateo, CA"
, year =	1992
, update =	"96.09 orourke"
}

@inproceedings{ul-hcsgg-97
, author =	"Christopher Umans and William Lenhart"
, title =	"Hamiltonian Cycles in Solid Grid Graphs"
, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '97"
, year =	1997
, pages =	"496--507"
, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}

@mastersthesis{u-sp1s-95
, author =	"H. Umemoto"
, title =	"Searching a polygon by $1$-searchers"
, school =	"Hiroshima Univ."
, address =	"Hiroshima, Japan"
, year =	1995
, keywords =	"master thesis"
, update =	"98.07 bibrelex"
}

@article{u-2nnpd-82
, author =	"P. Ungar"
, title =	"$2$n noncollinear points determine at least $2$n directions"
, journal =	"J. Combin. Theory Ser. A"
, volume =	33
, year =	1982
, pages =	"343--347"
, update =	"97.11 bibrelex"
}

@article{u-opcp-96
, author =	"M. Urabe"
, title =	"On a partition into convex polygons"
, journal =	"Discrete Appl. Math."
, volume =	64
, year =	1996
, pages =	"179--191"
, update =	"99.11 smid"
}

@inproceedings{u-ppscp-97
, author =	"Masatsugu Urabe"
, title =	"On a Partition of Point Sets into Convex Polygons"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"21--24"
, update =	"97.11 jones"
}

@article{u-ppsdc-99
, author =	"M. Urabe"
, title =	"Partitioning point sets into disjoint convex polytopes"
, journal =	"Comput. Geom. Theory Appl."
, volume =	13
, year =	1999
, pages =	"173--178"
, update =	"99.11 smid"
}

@article{uw-ccm-92
, author =	"M. Urabe and M. Watanabe"
, title =	"On a counterexample to a conjecture of {Mirzaian}"
, journal =	"Comput. Geom. Theory Appl."
, volume =	2
, number =	1
, year =	1992
, pages =	"51--53"
, update =	"95.01 mitchell"
}

@techreport{u-gtcbl-??
, author =	"R. Urquhart"
, title =	"Graph theoretical clustering based on limited neighbourhood sets {II}"
, type =	"Manuscript"
, institution =	"Dept. Electron. Elect. Engrg., Univ. Glasgow"
, address =	"Glasgow, Scotland"
, year =	"??"
}

@techreport{u-ngdr-80
, author =	"R. B. Urquhart"
, title =	"A note on graphs defined by a region"
, type =	"Internal {Report}"
, number =	""
, institution =	"Dept. Electron. Elect. Engrg., Univ. Glasgow"
, address =	"Glasgow, Scotland"
, year =	1980
, update =	"94.05 devillers"
}

@techreport{u-ncsdt-80
, author =	"R. B. Urquhart"
, title =	"A note on the computation of subgraphs of the {Delaunay} triangulation"
, type =	"Internal {Report}"
, number =	""
, institution =	"Dept. Electron. Elect. Engrg., Univ. Glasgow"
, address =	"Glasgow, Scotland"
, year =	1980
, update =	"94.05 devillers"
}

@article{u-acrng-80
, author =	"R. B. Urquhart"
, title =	"Algorithms for computation of relative neighborhood graph"
, journal =	"Electron. Lett."
, volume =	16
, year =	1980
, pages =	"556--557"
}

@article{u-gtcbl-82
, author =	"R. B. Urquhart"
, title =	"Graph theoretical clustering based on limited neighbourhood sets"
, journal =	"Pattern Recogn."
, volume =	15
, year =	1982
, pages =	"173--187"
}

@article{u-spper-83
, author =	"R. B. Urquhart"
, title =	"Some Properties of the Planar {Euclidean} Relative Neighbourhood Graph"
, journal =	"Pattern Recogn. Lett."
, volume =	1
, year =	1983
, pages =	"317--332"
, update =	"98.11 bibrelex"
}

@inproceedings{um-ihcdb-81
, author =	"R. B. Urquhart and J. E. S. Macleod"
, title =	"Interactive hierarchic clustering: a display based on graph-theoretical methods"
, booktitle =	"Proc. Internat. Conf. Cybernet. Soc."
, year =	1981
, pages =	"11--15"
}

@incollection{u-agip-00
, author =	"Jorge Urrutia"
, title =	"Art Gallery and Illumination Problems"
, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
, booktitle =	"Handbook of Computational Geometry"
, publisher =	"North-Holland"
, year =	2000
, pages =	"973--1027"
, keywords =	"visibility"
, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 96.09 orourke"
, annote =	"Chapter 22 of su-hcg-00"
}

@phdthesis{u-igfpc-80
, author =	"J. Urrutia"
, title =	"Intersection Graphs of Some Families of Plane Curves"
, school =	"University of Waterloo"
, year =	1980
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@inproceedings{u-nieve-97
, author =	"Jorge Urrutia"
, title =	"On the Number of Internal and External Visibility Edges of Polygons"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"17--20"
, update =	"97.11 jones"
}

@incollection{u-poeg-89
, author =	"J. Urrutia"
, title =	"Partial orders and {Euclidean} geometry"
, editor =	"I. Rival"
, booktitle =	"Algorithms and Order"
, publisher =	"Kluwer Academic Publishers"
, year =	1989
, pages =	"387--434"
, keywords =	"combinatorial geometry, two-dimensional, three-dimensional"
, annote =	"studies containment relations arising from families of
		 points, circles, spheres, triangles, rectangles, etc."
}

@techreport{uz-ics-89
, author =	"J. Urrutia and J. Zaks"
, title =	"Illuminating convex sets"
, type =	"Technical {Report}"
, number =	"TR-89-31"
, institution =	"Dept. Comput. Sci., Univ. Ottawa"
, address =	"Ottawa, ON"
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{u-ealie-82
, author =	"S. Ursic"
, title =	"The ellipsoid algorithm for linear inequalities in exact arithmetic"
, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1982
, pages =	"321--326"
}

@book{u-te-48
, author =	"J. V. Uspensky"
, title =	"Theory of Equations"
, publisher =	"McGraw-Hill"
, year =	1948
, update =	"98.03 bibrelex"
}

@article{us-hmsss-92
, author =	"A. Y. Uteshev and S. G. Shulyak"
, title =	"Hermite's method of separation of solutions of systems of algebraic equations and its applications"
, journal =	"Linear Algebra and its Applications"
, volume =	177
, year =	1992
, pages =	"49--88"
, update =	"98.03 bibrelex"
}

@phdthesis{v-atmtd-74
, author =	"H. Vaccaro"
, title =	"Alternative Techniques for Modeling Travel Distance"
, school =	"MIT"
, year =	1974
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@inproceedings{vp-iopsp-91
, author =	"M.-E. Vafiadou and N. M. Patrikalakis"
, title =	"Interrogation of Offsets of Polynomial Surface Patches"
, editor =	"F. H. Post and W. Barth"
, booktitle =	"Eurographics '91, Proc. 12th Annual European Association for Computer Graphics Conference and Exhibition"
, year =	1991
, pages =	"247--259"
, update =	"95.05 abrams"
}

@inproceedings{vh-fsemp-98
, author =	"Jan Vahrenhold and Klaus H. Hinrichs"
, title =	"Fast and Simple External-Memory Planar Point-Location"
, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
, nickname =	"CG '98"
, site =	"Barcelona"
, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
, year =	1998
, pages =	"139--140"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{v-famst-84
, author =	"P. M. Vaidya"
, title =	"A fast approximation for minimum spanning trees in $k$-dimensional space"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"403--407"
, precedes =	"v-mstkd-88"
}

@inproceedings{v-namcf-89
, author =	"P. M. Vaidya"
, title =	"A new algorithm for minimizing convex functions over convex sets"
, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1989
, pages =	"338--343"
}

@article{v-sgagc-91
, author =	"P. M. Vaidya"
, title =	"A sparse graph almost as good as the complete graph on points in {$K$} dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"369--381"
}

@inproceedings{v-alpwr-87
, author =	"P. M. Vaidya"
, title =	"An algorithm for linear programming which requires {$O(((m+n)n^2+(m+n)^{1.5}n)L)$} arithmetic operations"
, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
, year =	1987
, pages =	"29--38"
, precedes =	"v-alpwr-90"
}

@article{v-alpwr-90
, author =	"P. M. Vaidya"
, title =	"An algorithm for linear programming which requires {$O(((m+n)n^2+(m+n)^{1.5}n)L)$} arithmetic operations"
, journal =	"Math. Program."
, volume =	47
, year =	1990
, pages =	"175--201"
, succeeds =	"v-alpwr-87"
}

@article{v-oaann-89
, author =	"P. M. Vaidya"
, title =	"An {$O(n \log n)$} algorithm for the all-nearest-neighbors problem"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"101--115"
, succeeds =	"v-oaann-86"
}

@inproceedings{v-oaann-86
, author =	"P. M. Vaidya"
, title =	"An optimal algorithm for the all-nearest-neighbors problem"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"117--122"
, precedes =	"v-oaann-89"
}

@article{v-amwmp-89
, author =	"P. M. Vaidya"
, title =	"Approximate minimum weight matching on points in $k$-dimensional space"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"569--583"
, keywords =	"matchings, approximation, $d$-dimensional"
}

@inproceedings{v-ghm-88
, author =	"P. M. Vaidya"
, title =	"Geometry helps in matching"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"422--435"
, precedes =	"v-ghm-89"
}

@article{v-ghm-89
, author =	"P. M. Vaidya"
, title =	"Geometry helps in matching"
, journal =	"SIAM J. Comput."
, volume =	18
, year =	1989
, pages =	"1201--1225"
, succeeds =	"v-ghm-88"
}

@article{v-mstkd-88
, author =	"P. M. Vaidya"
, title =	"Minimum spanning trees in $k$-dimensional space"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"572--582"
, succeeds =	"v-famst-84"
, update =	"98.03 mitchell"
, annote =	"He gives an $O(\epsilon^{-d} n\log n)$ algorithm to get
                  within factor $(1+\epsilon)$ of optimal, for the
                  $L_q$ metrics.  He also gives a nearly linear
                  expected time algorithm for $n$
                  points uniformly distributed in a $d$-cube; time is
                  $O(n\alpha(cn,n)$, where $\alpha$ is the inverse
                  Ackermann function, and $s$ depends on $d$.  See also
                  \cite{c-agmst-89}"
}

@inproceedings{v-rpccl-90
, author =	"P. M. Vaidya"
, title =	"Reducing the parallel complexity of certain linear programming problems"
, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1990
, pages =	"583--589"
}

@inproceedings{v-sttor-85
, author =	"P. M. Vaidya"
, title =	"Space-time tradeoffs for orthogonal range queries"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"169--174"
, precedes =	"v-sttor-89"
}

@article{v-sttor-89
, author =	"P. M. Vaidya"
, title =	"Space-time tradeoffs for orthogonal range queries"
, journal =	"SIAM J. Comput."
, volume =	18
, year =	1989
, pages =	"748--758"
, succeeds =	"v-sttor-85"
}

@article{v-fmep-90
, author =	"A. Vainshtein"
, title =	"Finding minimal enclosing parallelograms"
, journal =	"Diskretnaya Matematika"
, volume =	2
, year =	1990
, pages =	"72--81"
, note =	"In Russian"
, update =	"98.03 bibrelex"
}

@article{v-cpe-82
, author =	"V. K. Vaishnavi"
, title =	"Computing point enclosures"
, journal =	"IEEE Trans. Comput."
, volume =	"C-31"
, year =	1982
, pages =	"22--29"
}

@article{v-mhbt-83
, author =	"V. K. Vaishnavi"
, title =	"Multidimensional height-balanced trees"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, year =	1983
, pages =	"334--343"
}

@techreport{v-owcar-79
, author =	"V. K. Vaishnavi"
, title =	"Optimal worst-case algorithms for rectangle intersection and batched range searching problems"
, type =	"Report"
, number =	"79-CS-12"
, institution =	"Unit Comput. Sci., McMaster Univ."
, address =	"Hamilton, ON"
, year =	1979
}

@article{vkw-stoac-80
, author =	"V. K. Vaishnavi and H. P. Kriegel and D. Wood"
, title =	"Space and time optimal algorithms for a class of rectangle intersection problems"
, journal =	"Inform. Sci."
, volume =	21
, year =	1980
, pages =	"59--67"
}

@article{vw-dsrce-80
, author =	"V. K. Vaishnavi and D. Wood"
, title =	"Data structures for the rectangle containment and enclosure problems"
, journal =	"Comput. Graph. Image Process."
, volume =	13
, year =	1980
, pages =	"372--384"
}

@article{vw-rlsil-82
, author =	"V. K. Vaishnavi and D. Wood"
, title =	"Rectilinear line segment intersection, layered segment trees and dynamization"
, journal =	"J. Algorithms"
, volume =	3
, year =	1982
, pages =	"160--176"
}

@article{vtl-rspd-82
, author =	"J. Valdes and R. E. Tarjan and E. L. Lawler"
, title =	"The Recognition of Series-Parallel Digraphs"
, journal =	"SIAM J. Comput."
, volume =	11
, number =	2
, year =	1982
, pages =	"298--313"
, update =	"94.05 tamassia"
}

@inproceedings{v-msv-53
, author =	"F. Valentine"
, title =	"Minimal Sets of Visibility"
, booktitle =	"Proc. Amer. Math. Soc."
, volume =	4
, year =	1953
, pages =	"917--921"
, update =	"98.07 bibrelex"
}

@book{v-cs-64
, author =	"Frederick Albert Valentine"
, title =	"Convex Sets"
, publisher =	"McGraw-Hill"
, address =	"New York"
, year =	1964
, update =	"98.07 icking"
}

@article{v-lcls-65
, author =	"F. A. Valentine"
, title =	"Local convexity and {$L_{n}$} sets"
, journal =	"Proc. Amer. Math. Soc."
, volume =	16
, year =	1965
, pages =	"1305--1310"
, update =	"98.07 bibrelex"
}

@inproceedings{v-cca-79
, author =	"L. Valiant"
, title =	"Completeness classes in algebra"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
, year =	1979
, pages =	"249--261"
, update =	"95.01 devillers"
}

@article{v-pcp-75
, author =	"L. Valiant"
, title =	"Parallelism in comparison problems"
, journal =	"SIAM J. Comput."
, volume =	4
, number =	3
, year =	1975
, pages =	"348--355"
}

@article{v-smfmf-84
, author =	"L. Valiant"
, title =	"Short monotone formulae for the majority function"
, journal =	"J. Algorithms"
, volume =	5
, year =	1984
, pages =	"363--366"
, update =	"98.03 bibrelex"
}

@article{v-ucvc-81
, author =	"L. Valiant"
, title =	"Universality Considerations in {VLSI} Circuits"
, journal =	"IEEE Trans. Comput."
, volume =	"C-30"
, number =	2
, year =	1981
, pages =	"135--140"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{v-bmpc-90
, author =	"L. G. Valiant"
, title =	"A Bridging Model for Parallel Computation"
, journal =	"Commun. ACM"
, volume =	33
, number =	8
, year =	1990
, pages =	"103--111"
, update =	"98.11 kuehn, 96.09 orourke"
}

@article{v-tl-84
, author =	"L. G. Valiant"
, title =	"A theory of the learnable"
, journal =	"Commun. ACM"
, volume =	27
, number =	11
, year =	1984
, pages =	"1134--1142"
, update =	"98.07 bibrelex"
}

@incollection{v-gppa-90
, author =	"L. G. Valiant"
, title =	"General Purpose Parallel Architectures"
, editor =	"J. van Leeuwen"
, booktitle =	"Handbook of Theoretical Computer Science"
, publisher =	"Elsevier/The MIT Press"
, address =	"Amsterdam"
, year =	1990
, pages =	"943--972"
, update =	"96.09 orourke"
}

@article{vv-niedu-86
, author =	"L. G. Valiant and V. V. Vazirani"
, title =	"NP is as easy as detecting unique solutions"
, journal =	"Theoret. Comput. Sci."
, volume =	47
, year =	1986
, pages =	"85--93"
, update =	"98.03 bibrelex"
}

@article{v-ubmmk-76
, author =	"O. Vallarino"
, title =	"On the use of bit maps for multiple key retrieval"
, journal =	"SIGPLAN Notices"
, volume =	11
, year =	1976
, pages =	"108--114"
}

@article{v-cis7h-92
, author =	"P. Valtr"
, title =	"Convex independent sets and $7$-holes in restricted planar point sets"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"135--152"
}

@inproceedings{v-gdkpc-97
, author =	"Pavel Valtr"
, title =	"Graph Drawings with no $k$ Pairwise Crossing Edges"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"205--218"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{v-llpic-96
, author =	"P. Valtr"
, title =	"Lines, line-point incidences and crossing families in dense sets"
, journal =	"Combinatorica"
, volume =	16
, year =	1996
, pages =	"269--294"
, update =	"98.03 agarwal"
}

@article{v-mnepp-92
, author =	"P. Valtr"
, title =	"On the minimum number of empty polygons in planar point sets"
, journal =	"Studia Sci. Math. Hungar."
, volume =	30
, year =	1995
, pages =	"155--163"
, update =	"02.03 devillers"
}

@phdthesis{v-ppsbr-94
, author =	"P. Valtr"
, title =	"Planar point sets with bounded rations of distances"
, school =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berlin, Germany"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{v-srnle-92
, author =	"P. Valtr"
, title =	"Sets in ${R}^d$ with No Large Empty Convex Subsets"
, journal =	"Discrete Appl. Math."
, volume =	108
, year =	1992
, pages =	"115--124"
, update =	"97.03 gaertner+salinger"
}

@article{v-usias-94
, author =	"P. Valtr"
, title =	"Unit squares intersecting all secants of a square"
, journal =	"Discrete Comput. Geom."
, volume =	11
, year =	1994
, pages =	"235--239"
, update =	"97.03 gaertner+salinger"
}

@incollection{l-ga-90
, author =	"J. {van Leeuwen}"
, title =	"Graph algorithms"
, editor =	"J. {van Leeuwen}"
, booktitle =	"Handbook of Theoretical Computer Science"
, volume =	"A"
, publisher =	"Elsevier"
, address =	"Amsterdam"
, year =	1990
, pages =	"525--631"
, update =	"98.11 bibrelex"
}

@phdthesis{v-ltg-80
, author =	"C. J. {Van Wyk}"
, title =	"A language for typesetting graphics"
, school =	"Sept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, month =	jun
, year =	1980
, note =	"Technical Report STAN-CS-80-803"
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{vv-chld-86
, author =	"C. J. {Van Wyk} and J. S. Vitter"
, title =	"The complexity of hashing with lazy deletion"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"17--29"
, update =	"94.09 vitter"
}

@book{v-inc-78
, author =	"J. Vandergraft"
, title =	"Introduction to Numerical Computation"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1978
, update =	"98.03 bibrelex"
}

@article{v-sdcsf-64
, author =	"A. B. {VanderLugt}"
, title =	"Signal detection by complex spatial filtering"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-10"
, number =	2
, month =	apr
, year =	1964
, pages =	"139--145"
, update =	"97.11 bibrelex"
}

@book{v-noted-84
, author =	"G. N. Vanderplaats"
, title =	"Numerical Optimization Techniques for Engineering Design"
, publisher =	"McGraw-Hill"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{v-bfcac-94
, author =	"G. {Van{\v e}{\v c}ek, Jr.}"
, title =	"Back-face Culling Applied to Collision Detection of Polyhedra"
, journal =	"J. Visualizat. and Comput. Animation"
, volume =	5
, number =	1
, year =	1994
, update =	"97.03 held"
}

@article{v-bimsp-91
, author =	"G. {Van{\v e}{\v c}ek Jr.}"
, title =	"Brep-index: a multidimensional space partitioning tree"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	3
, year =	1991
, pages =	"243--261"
, keywords =	"classification, Brep, BSP tree, data structures"
}

@article{vc-ucrfe-71
, author =	"V. N. Vapnik and A. Y. Chervonenkis"
, title =	"On the uniform convergence of relative frequencies of events to their probabilities"
, journal =	"Theory Probab. Appl."
, volume =	16
, year =	1971
, pages =	"264--280"
, update =	"96.09 orourke"
}

@inproceedings{v-dcamc-98
, author =	"K. Varadarajan"
, title =	"A divide and conquer algorithm for min-cost perfect matching in the plane"
, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '98"
, year =	1998
, pages =	"320--329"
, update =	"01.11 orourke+smid"
}

@unpublished{va-aspp-96
, author =	"K. Varadarajan and P. K. Agarwal"
, title =	"Approximating shortest paths on a polyhedron"
, year =	1996
, note =	"unpublished manuscript"
, update =	"97.03 agarwal"
}

@inproceedings{v-ampcu-96
, author =	"Kasturi R. Varadarajan"
, title =	"Approximating Monotone Polygonal Curves Using the Uniform Metric"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"311--318"
, cites =	"aaas-cvgbr-93, abosy-fmcnp-85, as-anspt-93, as-pm-92, ak-nthld-93, bks-lsctp-95, b-tcl-85, c-vsanl-88, cc-apcmn-92, dp-arnpr-73, et-apctt-94, fm-cpgcs-91, g-eplfa-94, ghms-apsml-93, h-patmn-93, hs-cmlpg-91, hs-sudpl-92, hs-fpfsp-91, ii-pacfa-88, kd-pamm-82, ks-ebago-93, lo-aalgb-92, m-alg-87, m-olcch-87, m-roass-91, mo-pca-88, s-ltaml-86, t-capcp-85, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
}

@inproceedings{va-aspnp-97
, author =	"Kasturi R. Varadarajan and Pankaj Agarwal"
, title =	"Approximating Shortest Paths on an Nonconvex Polyhedron"
, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '97"
, year =	1997
, pages =	"To appear"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{va-aabnb-99
, author =	"K. R. Varadarajan and Pankaj K. Agarwal"
, title =	"Approximation algorithms for bipartite and non-bipartite matching in the plane"
, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1999
, pages =	"805--814"
, update =	"99.03 agarwal"
}

@inproceedings{va-laso-95
, author =	"Kasturi R. Varadarajan and P. K. Agarwal"
, title =	"Linear Approximation of Simple Objects"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"13--18"
, update =	"96.05 agarwal, 95.09 jones"
}

@article{va-laso-97
, author =	"Kasturi R. Varadarajan and P. K. Agarwal"
, title =	"Linear Approximation of Simple Objects"
, journal =	"Inform. Process. Lett."
, volume =	62
, year =	1997
, pages =	"89--94"
, update =	"99.03 agarwal"
}

@techreport{v-ssidq-
, author =	"T. Varady"
, title =	"Surface-surface Intersections for Double-quadratic Parametric Patches in a Solid Modeller"
, institution =	"Comput. Automation Res. Inst., Hungarian Academy of Science"
, year =	"??"
, update =	"97.11 bibrelex"
}

@article{v-ctdah-87
, author =	"A. N. Varchenko"
, title =	"Combinatorics and topology of the disposition of affine hyperplanes in real space"
, journal =	"Funk. Anal. i Prilozhen."
, volume =	21
, number =	"N 1"
, year =	1987
, pages =	"11--22"
, update =	"97.11 bibrelex"
}

@article{vg-hfch-87
, author =	"A. N. Varchenko and I. M. Gel\'fand"
, title =	"On {Heavyside} functions of a configuration of hyperplanes"
, journal =	"Funk. Anal. i Prilozhen."
, volume =	21
, number =	"N-4"
, year =	1987
, pages =	"1--18"
, update =	"97.11 bibrelex"
}

@phdthesis{v-hga-94
, author =	"A. Varshney"
, title =	"Hierarchical Geometric Approximations"
, type =	"Ph.{D}. Thesis"
, school =	"Department of Computer Science, University of North Carolina"
, address =	"Chapel Hill, NC 27599-3175"
, year =	1994
, note =	"TR-050-1994"
, keywords =	"doctoral thesis"
, update =	"95.01 mitchell"
}

@misc{vabww-mhgpm-94
, author =	"A. Varshney and P. K. Agarwal and F. P. {Brooks, Jr.} and W. Wright and H. Weber"
, title =	"Multiresolution hierarchy generation for polygonal models"
, year =	1994
, note =	"Manuscript"
, update =	"95.09 agarwal, 95.05 agarwal"
}

@inproceedings{vb-facrs-93
, author =	"A. Varshney and F. P. {Brooks, Jr.}"
, title =	"Fast analytical computation of {Richard}'s smooth molecular surface"
, booktitle =	"Proc. Visualization '93"
, year =	1993
, pages =	"300--307"
, update =	"98.03 bibrelex"
}

@article{vbw-csms-94
, author =	"A. Varshney and F. P. {Brooks, Jr.} and W. V. Wright"
, title =	"Computing Smooth Molecular Surfaces"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	15
, number =	5
, month =	sep
, year =	1994
, pages =	"19--25"
, keywords =	"Connolly surfaces, solvent-accessible surfaces, alpha shapes, alpha hulls"
, update =	"98.03 agarwal+mitchell"
}

@inproceedings{vbw-ivwtd-94
, author =	"A. Varshney and F. P. {Brooks, Jr.} and W. V. Wright"
, title =	"Interactive Visualization of Weighted Three-dimensional Alpha Hulls"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"395--396"
, keywords =	"video review"
, cites =	"a-pdpaa-87, c-amsc-83, e-was-92, eks-sspp-83, em-tdas-94, ec-eargd-92, fpeggemtti-pp5hm-89, r-avpps-77, s-lpchm-90, vb-facrs-93, vwb-bnusi-93, ZZZ"
, update =	"98.03 bibrelex, 94.09 jones"
}

@techreport{vwb-bnusi-93
, author =	"A. Varshney and W. V. Wright and F. P. {Brooks, Jr.}"
, title =	"Bounding the number of unit spheres inside a larger sphere"
, type =	"Technical {Report}"
, number =	"UNC-CS-TR-93-039"
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, year =	1993
, update =	"98.03 bibrelex"
}

@article{v-cdsmt-92
, author =	"V. A. Vassiliev"
, title =	"Complements of discriminants of smooth maps: topology and applications"
, journal =	"Tansl. of math. monographs"
, volume =	98
, year =	1992
, note =	"Am. Math. Soc., Providence, Rhode Island"
, update =	"98.11 bibrelex"
}

@article{v-gspc-92
, author =	"B. R. Vatti"
, title =	"A generic solution to polygon clipping"
, journal =	"Commun. ACM"
, volume =	35
, number =	7
, year =	1992
, pages =	"56--63"
}

@article{v-ppt-80
, author =	"J. Vaucher"
, title =	"Pretty Printing of Trees"
, journal =	"Softw. -- Pract. Exp."
, volume =	10
, number =	7
, year =	1980
, pages =	"553--561"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@misc{v-qfemg-95
, author =	"S. Vavasis"
, title =	"QMG: a finite element mesh generation package"
, url =	"http://www.cs.cornell.edu/Info/People/vavasis/qmg-home.html"
, update =	"97.11 bibrelex"
}

@techreport{v-adptd-90
, author =	"S. A. Vavasis"
, title =	"Automatic domain partitioning in three dimensions"
, type =	"Technical {Report}"
, number =	"TR~90-1082"
, institution =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	jan
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{v-adptd-91
, author =	"S. A. Vavasis"
, title =	"Automatic domain partitioning in three dimensions"
, journal =	"SIAM J. Sci. Statist. Comput."
, volume =	"??"
, year =	1991
, note =	"To appear"
, update =	"98.03 bibrelex"
}

@techreport{v-sfepw-93
, author =	"S. A. Vavasis"
, title =	"Stable finite elements for problems with wild coefficients"
, number =	"93-1364"
, institution =	"Cornell University"
, address =	"Ithaca, NY"
, year =	1993
, update =	"97.11 bibrelex"
}

@inproceedings{vy-aipmw-94
, author =	"Stephen A. Vavasis and Yinyu Ye"
, title =	"An Accelerated Interior Point Method whose Running Time Depends only on $A$"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	""
, update =	"94.01 jones"
}

@inproceedings{vg-mlt-97
, author =	"Eric Veach and Leonidas J. Guibas"
, title =	"Metropolis Light Transport"
, booktitle =	"SIGGRAPH 97 Conference Proceedings"
, series =	"Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"Addison-Wesley"
, year =	1997
, pages =	"65--76"
, update =	"98.03 agarwal"
}

@inproceedings{vg-ocstm-95
, author =	"Eric Veach and Leonidas J. Guibas"
, title =	"Optimally Combining Sampling Techniques for {Monte} {Carlo} Rendering"
, editor =	"Robert Cook"
, booktitle =	"SIGGRAPH 95 Conference Proceedings"
, series =	"Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"Addison-Wesley"
, month =	aug
, year =	1995
, pages =	"419--428"
, update =	"98.03 agarwal"
}

@article{va-ldoro-88
, author =	"J. Veenstra and N. Ahuja"
, title =	"Line drawings of octree-represented objects"
, journal =	"ACM Trans. Graph."
, volume =	7
, year =	1988
, pages =	"61--75"
}

@inproceedings{v-cccs-90
, author =	"Gert Vegter"
, title =	"Computational Complexity of Combinatorial Surfaces"
, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
, nickname =	"CG '90"
, site =	"Siegen"
, publisher =	"Universit{\"a}t Siegen"
, year =	1990
, pages =	25
, update =	"00.03 bibrelex"
}

@incollection{v-ct-97
, author =	"G. Vegter"
, title =	"Computational topology"
, chapter =	28
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"517--536"
, update =	"97.11 orourke"
}

@techreport{v-cbrdf-87
, author =	"G. Vegter"
, title =	"Computing the bounded region determined by finitely many lines in the plane"
, type =	"Report"
, number =	"CS 8703"
, institution =	"Dept. Math. and Comput. Sci., Univ. of Groningen"
, address =	"Groningen, Netherlands"
, year =	1987
, update =	"95.01 smid"
}

@inproceedings{v-dmvg-91
, author =	"G. Vegter"
, title =	"Dynamically maintaining the visibility graph"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"425--436"
, keywords =	"visibility, geometric graph"
}

@article{v-kfdp-90
, author =	"G. Vegter"
, title =	"Kink-free deformation of polygons"
, journal =	"Algorithms Rev."
, volume =	1
, number =	3
, year =	1990
, pages =	"125--137"
}

@inproceedings{v-kfdp-89
, author =	"G. Vegter"
, title =	"Kink-free deformations of polygons"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"61--68"
, cites =	"d-tdkaz-12, gkp-cm-89, my-chthu-88, s-rcrm-58, w-rccp-37, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{v-vddsv-90
, author =	"G. Vegter"
, title =	"The visibility diagram: {A} data structure for visibility problems and motion planning"
, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	447
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"97--110"
}

@inproceedings{vy-mcs-91
, author =	"G. Vegter and C. Yap"
, title =	"Minimal circumscribing simplices"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"58--61"
, cites =	"k-fcvm-86, kl-fstcg-85, mc-uafet-88, o-fmeb-84, oamb-oafme-86, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{vy-cccs-90
, author =	"G. Vegter and C. K. Yap"
, title =	"Computational complexity of combinatorial surfaces"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"102--111"
, cites =	"b-sctdm-22, ff-ict-34, h-gt-69, m-ati-77, my-chthu-88, m-eat-84, s-ctcgt-80, v-kfdp-89, ZZZ"
, update =	"97.11 bibrelex"
}

@article{v-bnfp-90
, author =	"M. Veldhorst"
, title =	"A bibliography on network flow problems"
, journal =	"Algorithms Rev."
, volume =	1
, number =	2
, year =	1990
, pages =	"97--117"
, keywords =	"bibliography, network flow"
}

@article{v-ordio-86
, author =	"M. Veldhorst"
, title =	"The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"1--34"
}

@article{vdg-hgts-99
, author =	"L. Velho and L. H. de Figueiredo and J. Gomes"
, title =	"Hierarchical Generalized Triangle Strips"
, journal =	"Visual Comput."
, volume =	15
, number =	1
, year =	1999
, pages =	"21--35"
, update =	"99.07 held"
}

@article{v-3dcm-93
, author =	"R. C. Veltkamp"
, title =	"3D Computational Morphology"
, journal =	"Comput. Graph. Forum"
, volume =	12
, number =	3
, year =	1993
, pages =	"115--127"
, update =	"97.11 oostrum"
}

@article{v-bspud-95
, author =	"R. C. Veltkamp"
, title =	"Boundaries through Scattered Points of Unknown Density"
, journal =	"Graphics Models and Image Processing"
, volume =	57
, number =	6
, month =	nov
, year =	1995
, pages =	"441--452"
, update =	"97.11 oostrum"
}

@phdthesis{v-cobsp-92
, author =	"R. C. Veltkamp"
, title =	"Closed object boundaries from scattered points"
, school =	"Center for Mathematics and Computer Science, Amsterdam"
, year =	1992
, keywords =	"doctoral thesis"
, precedes =	"v-cobsp-94"
, update =	"97.11 oostrum, 93.05 orourke"
, annote =	"Reconstruction of polyhedra from points in space"
}

@book{v-cobsp-94
, author =	"R. C. Veltkamp"
, title =	"Closed Object Boundaries from Scattered Points"
, series =	"Lecture Notes Comput. Sci."
, volume =	885
, publisher =	"Springer-Verlag"
, year =	1994
, isbn =	"3-540-58808-6"
, succeeds =	"v-cobsp-92"
, update =	"98.07 bibrelex, 97.11 oostrum"
}

@inproceedings{v-gpccg-97
, author =	"Remco C. Veltkamp"
, title =	"Generic programming in {CGAL}, the {C}omputational {G}eometry {A}lgorithms {L}ibrary"
, editor =	"F. Arbab and Ph. Slusallek"
, booktitle =	"Proceedings of the 6th Eurographics Workshop on Programming Paradigms in Graphics, Budapest, Hungary, 8 September 1997"
, year =	1997
, pages =	"127--138"
, issn =	"1024-0861"
, update =	"98.07 bibrelex, 98.03 bibrelex, 97.11 oostrum"
}

@inproceedings{v-fhal-92
, author =	"Remco C. Veltkamp"
, title =	"The Flintstones: Hierarchical Approximation and Localization"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"69--72"
, update =	"00.03 bibrelex"
}

@article{v-gng-92
, author =	"R. C. Veltkamp"
, title =	"The $\gamma$-neighborhood graph"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, number =	4
, year =	1992
, pages =	"227--246"
, keywords =	"neighborhood graph, Delaunay triangulation, Hamilton cycle"
}

@article{vcc-fcdaa-98
, author =	"B. C. Vemuri and Y. Cao and L. Chen"
, title =	"Fast Collision Detection Algorithms with Applications to Particle Flows"
, journal =	"Comput. Graph. Forum"
, volume =	17
, number =	2
, month =	jun
, year =	1998
, pages =	"121--134"
, update =	"99.03 held"
}

@inproceedings{vvm-eetpa-92
, author =	"B. C. Vemuri and R. Varadarajan and N. Mayya"
, title =	"An Efficient Expected Time Parallel Algorithm for {Voronoi} Construction"
, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
, year =	1992
, pages =	"392--400"
, update =	"97.11 bibrelex"
}

@inproceedings{vv-e3drs-96
, author =	"D. E. Vengroff and J. S. Vitter"
, title =	"Efficient 3-D Range Searching in External Memory"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, site =	"Philadelphia, PA"
, month =	may
, year =	1996
, update =	"97.03 murali"
}

@inproceedings{vv-ioect-96
, author =	"D. E. Vengroff and J. S. Vitter"
, title =	"{I/O}-Efficient Computation: The {TPIE} Approach"
, booktitle =	"Proceedings of the Goddard Conference on Mass Storage Systems and Technologies"
, site =	"College Park, MD"
, series =	"NASA Conference Publication 3340, Volume II"
, month =	sep
, year =	1996
, pages =	"553--570"
, update =	"97.03 murali"
}

@article{v-sarut-84
, author =	"C. E. {Veni Madhavan}"
, title =	"Secondary attribute retrieval using tree data structures"
, journal =	"Theoret. Comput. Sci."
, volume =	33
, year =	1984
, pages =	"107--116"
}

@article{v-aitco-95
, author =	"R. Venkatasubramanian"
, title =	"On the area of intersection of two closed 2D objects"
, journal =	"Inform. Sci."
, volume =	82
, year =	1995
, pages =	"25--44"
, update =	"99.11 devillers"
}

@inproceedings{vc-gicp-93
, author =	"R. Venkatasubramanian and A. Cullum"
, title =	"Grazing inside a convex polygon"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"228--234"
, cites =	"o-agta-87, nt-opg-91, nt-opg, gv-oacmg-92, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{vc-nadpd-92
, author =	"Jose A. Ventura and Jen-Ming Chen"
, title =	"A new approach to determine the pose and dimension of polygonal shapes"
, editor =	"G{\"u}nter Fandel and Thomas Gulledge and Albert Jones"
, booktitle =	"Operations Research in Production Planning and Control, Proc. Joint German/US Conf., Hagen, Germany, June 25--26, 1992"
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"151--166"
, update =	"98.07 rote"
, abstract =	"\dots\ Algorithmically, the image boundary data is partitioned into $n$
                 segments, and the best-fitting polygon is found using a non-ordinary
                 least-squares technique. The algorithm is well-suited for on-line
                 implementation in an automated environment due to its flexibility and
                 demonstrated speed."
}

@inproceedings{v-acpdp-95
, author =	"Knut Verbarg"
, title =	"Approximate Center Points in Dense Point Sets"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	65
, update =	"00.03 bibrelex"
}

@inproceedings{v-acpdp-97
, author =	"Knut Verbarg"
, title =	"Approximate Center Points in Dense Point Sets"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	"55--56"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@inproceedings{vh-hmpus-96
, author =	"Knut Verbarg and A. Hensel"
, title =	"Hierarchical Motion Planning Using a Spatial Index"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"87--90"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@article{v-sptnp-51
, author =	"S. Verblunsky"
, title =	"On the shortest path through a number of points"
, journal =	"Proc. Amer. Math. Soc."
, volume =	2
, year =	1951
, pages =	"904--913"
, update =	"97.11 bibrelex"
}

@techreport{v-ivdt-92
, author =	"J. J. Verkuil"
, title =	"Idual: Visualizing Duality Transformations"
, institution =	"Dept. Comput. Sci., Univ. Utrecht"
, year =	1992
, update =	"97.03 icking"
}

@inproceedings{v-aotpc-97
, author =	"P. Vermeer"
, title =	"Assembling objects through parts correlation"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"385--387"
, cites =	"dh-ceg-95, hv-scp-95, nwm-dkssp-90, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@phdthesis{v-matbr-94
, author =	"P. J. Vermeer"
, title =	"Medial Axis Transform to Boundary Representation Conversion"
, school =	"CS Dept., Purdue University"
, address =	"West Lafayette, Indiana 47907-1398, USA"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"95.05 held"
}

@book{v-mvavi-91
, author =	"D. Vernon"
, title =	"Machine Vision, automated visual inspection and robot vision"
, publisher =	"Prentice Hall"
, year =	1991
, update =	"98.11 bibrelex"
}

@mastersthesis{v-osvdb-84
, author =	"Colin Verrilli"
, title =	"One source {Voronoi} diagrams with barriers: a computer implementation"
, school =	"Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
, month =	may
, year =	1984
, keywords =	"master thesis, Voronoi diagrams"
, update =	"93.09 franklin"
}

@book{v-htiat-73
, author =	"J. W. Vick"
, title =	"Homology Theory: {An} Introduction to Algebraic Topology"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1973
, update =	"98.03 bibrelex"
}

@article{vh-fsppp-85
, author =	"J. Viegas and P. Hansen"
, title =	"Finding Shortest Paths in the Plane in the Presence of Barriers"
, journal =	"European J. Oper. Res."
, volume =	20
, year =	1985
, pages =	"373--381"
, update =	"93.09 milone+mitchell"
}

@article{v-nmevr-78
, author =	"J. Vignes"
, title =	"New Methods for Evaluating the Validity of the Results of Mathematical Computations"
, journal =	"Mathematics and Computers in Simulation"
, volume =	20
, year =	1978
, pages =	"227--249"
, update =	"98.03 bibrelex"
}

@inproceedings{vl-eac-74
, author =	"J. Vignes and M. {La Porte}"
, title =	"Error Analysis in Computing"
, booktitle =	"Proc. IFIP Congress"
, site =	"Stockholm, Sweden"
, year =	1974
, pages =	"610--614"
, update =	"98.03 bibrelex"
}

@phdthesis{v-ditvl-83
, author =	"G. Vijayan"
, title =	"Design implementation and theory of a VLSI layout language"
, school =	"Department of EECS, Princeton University"
, year =	1983
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{vt-ftcr-90
, author =	"G. Vijayan and R. S. Tsay"
, title =	"Floorplan by Topological Constraint Reduction"
, booktitle =	"IEEE Int. Conf. On Computer-Aided-Design"
, year =	1990
, pages =	"106--109"
, update =	"98.11 bibrelex"
}

@techreport{vw-peog-82
, author =	"G. Vijayan and A. Wigderso"
, title =	"Planarity of edge-ordered graphs"
, institution =	"Department of EECS, Princeton University"
, year =	1982
, update =	"97.11 bibrelex"
}

@article{vw-rgte-85
, author =	"G. Vijayan and A. Wigderson"
, title =	"Rectilinear Graphs and their Embeddings"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"355--372"
, update =	"94.05 tamassia"
}

@inproceedings{v-gpga-86
, author =	"V. Vijayan"
, title =	"Geometry of planar graphs with angles"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"116--124"
, keywords =	"graph drawing"
, cites =	"as-ptass-79, b-aancp-83, bm-gta-76, c-ig-61, f-slrpg-48, gs-gpg-81, j-nccog-82, k-nptal-84i, lns-vlp-83, mc-ivs-80, t-dpg-83, v-ditvl-83, vw-rgte-85, vw-peog-82, y-gt-61, y-gt-68, ZZZ"
, update =	"97.11 bibrelex, 93.09 tamassia"
}

@article{vnb-odcc-91
, author =	"A. Vinacua and I. Navazo and B. Brunet"
, title =	"Octree detection of closed compartments"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	1
, number =	3
, year =	1991
, pages =	"263--280"
, keywords =	"connected component, octree, geometric model, nonmanifold boundary"
}

@article{v-etrec-39
, author =	"P. Vincensini"
, title =	"Sur une extension d'un th{\'e}or{\`e}me de {M. J. Radon} sur les ensembles de corps convexes"
, journal =	"Bull. Soc. Math. France"
, volume =	67
, year =	1939
, pages =	"115--119"
, update =	"98.07 bibrelex"
}

@article{v-nips-63
, author =	"I. M. Vinogradov"
, title =	"On the number of integer points in a sphere"
, journal =	"1 zv. Akad. Nauk SSSR, Ser. Mat."
, volume =	27
, year =	1963
, pages =	"957--968"
, update =	"97.11 bibrelex"
}

@article{v-ismaa-83
, author =	"U. Vishkin"
, title =	"Implementation of simultaneous memory address access in models that forbid it"
, journal =	"J. Algorithms"
, volume =	4
, year =	1983
, pages =	"45--50"
, update =	"98.07 bibrelex"
}

@techreport{v-spa-91
, author =	"U. Vishkin"
, title =	"Structural parallel algorithmics"
, type =	"Technical Report"
, number =	"UMIACS-TR-91-53"
, month =	apr
, year =	1991
, update =	"98.11 bibrelex"
}

@techreport{v-spcs-83
, author =	"U. Vishkin"
, title =	"Synchronous parallel computation - a survey"
, type =	"Technical {Report}"
, number =	71
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{vdgltv-esgda-00
, author =	"L. Vismara and G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and F. Vargiu"
, title =	"Experimental Studies on Graph Drawing Algorithms"
, journal =	"Softw. -- Pract. Exp."
, volume =	30
, number =	11
, year =	2000
, pages =	"1235--1284"
, update =	"01.04 vismara"
, annote =	"Special Issue on Discrete Algorithm Engineering"
}

@inproceedings{vm-eadip-86
, author =	"V. Visvanathan and L. S. Milor"
, title =	"An efficient algorithm to determine the image of a parallelepiped under a linear transformation"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"207--215"
, cites =	"mv-psafs-86, vst-rsbtt-84, ls-smm-85, w-rsbtt-84, lp-cgs-84, r-ca-70, s-cm-65, lsv-cacsc-86, lsv-cacsc-86, dmbs-lug-79, ck-acp-70, s-fchff-85, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{vst-rsbtt-84
, author =	"V. Visvanathan and E. Szeto and A. Tits"
, title =	"A robust simulation-before-test technique for DC analog fault diagnosis"
, booktitle =	"Proc. of the International Symposium of Circuits and Systems"
, nickname =	"ISCAS"
, site =	"Montreal, Canada"
, year =	1984
, pages =	"689--692"
, update =	"98.03 bibrelex"
}

@inproceedings{v-egpsp-93
, author =	"S. Viswanathan"
, title =	"The edge guard problem for spiral polygons"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"103--108"
, keywords =	"Computational Geometry, visibility, edge guards, spiral polygon"
, cites =	"c-ctpg-75, o-agta-87, b-vagt-93, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@techreport{vw-cpsr-79
, author =	"P. M. B. Vitanyi and D. Wood"
, title =	"Computing the perimeter of a set of rectangles"
, type =	"Report"
, number =	"79-CS-23"
, institution =	"Unit Comput. Sci., McMaster Univ."
, address =	"Hamilton, ON"
, year =	1979
}

@techreport{vs-apm1t-93
, author =	"J. Vitter and E. Shriver"
, title =	"Algorithms for parallel memory {I}: two-level memories"
, type =	"Research Report"
, number =	"CS-1993-01"
, institution =	"Dept. of Comp. Sc., Duke Univ."
, address =	"Durham, NC"
, year =	1993
, update =	"95.01 devillers"
}

@techreport{vs-apm2h-93
, author =	"J. Vitter and E. Shriver"
, title =	"Algorithms for parallel memory {II}: hierarchical multilevel memories"
, type =	"Research Report"
, number =	"CS-1993-01"
, institution =	"Dept. of Comp. Sc., Duke Univ."
, address =	"Durham, NC"
, year =	1993
, update =	"95.01 devillers"
}

@article{v-cilsg-96
, author =	"J. S. Vitter"
, title =	"Communication Issues in Large-Scale Geometric Computation"
, journal =	"ACM Comput. Surv."
, volume =	"28A"
, number =	4
, month =	dec
, year =	1996
, update =	"97.03 murali"
}

@incollection{v-emals-91
, author =	"J. S. Vitter"
, title =	"Efficient Memory Access in Large-Scale Computation"
, booktitle =	"Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	""
, update =	"96.09 orourke"
}

@inproceedings{v-gsmd-99
, author =	"Jeffrey Scott Vitter"
, title =	"Geometric Searching in Massive Data"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"25--30"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@incollection{vf-acaad-90
, author =	"J. S. Vitter and Ph. Flajolet"
, title =	"Average-case analysis of algorithms and data structures"
, editor =	"J. van Leeuwen"
, booktitle =	"Algorithms and Complexity"
, series =	"Handbook of Theoretical Computer Science"
, volume =	"A"
, publisher =	"Elsevier"
, address =	"Amsterdam"
, year =	1990
, pages =	"431--524"
, update =	"94.09 vitter"
}

@inproceedings{vl-lp-88
, author =	"J. S. Vitter and J.-H. Lin"
, title =	"Learning in Parallel"
, booktitle =	"Proceedings of the 1st Annual ACM Workshop on Computational Learning Theory"
, nickname =	"COLT '88"
, year =	1988
, pages =	"106--124"
, precedes =	"vl-lp-92"
, update =	"94.09 vitter"
}

@article{vl-lp-92
, author =	"J. S. Vitter and J.-H. Lin"
, title =	"Learning in Parallel"
, journal =	"Inform. Comput."
, volume =	92
, year =	1992
, pages =	"179--202"
, succeeds =	"vl-lp-88"
, update =	"94.09 vitter"
}

@article{vn-lssum-93
, author =	"J. S. Vitter and M. H. Nodine"
, title =	"Large-Scale Sorting in Uniform Memory Hierarchies"
, journal =	"J. Parallel Distrib. Comput."
, volume =	17
, year =	1993
, pages =	"107--114"
, update =	"98.07 bibrelex, 97.03 murali"
}

@article{vs-apm1t-94
, author =	"J. S. Vitter and E. A. M. Shriver"
, title =	"Algorithms for Parallel Memory {I}: Two-Level Memories"
, journal =	"Algorithmica"
, volume =	12
, number =	"2--3"
, year =	1994
, pages =	"110--147"
, update =	"97.11 bibrelex, 97.03 murali"
}

@article{vs-apmhm-94
, author =	"J. S. Vitter and E. A. M. Shriver"
, title =	"Algorithms for Parallel Memory {II}: Hierarchical Multilevel Memories"
, journal =	"Algorithmica"
, volume =	12
, year =	1994
, pages =	"148--169"
, update =	"96.09 tamassia"
}

@inproceedings{vs-odiop-90
, author =	"J. S. Vitter and E. A. M. Shriver"
, title =	"Optimal Disk {I/O} with Parallel Block Transfer"
, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
, year =	1990
, pages =	"159--169"
, update =	"96.09 orourke"
}

@phdthesis{v-ffrim-97
, author =	"J. Vleugels"
, title =	"On Fatness and Fitness --- Realistic Input Models for Geometric Algorithms"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Utrecht"
, address =	"Utrecht, The Netherlands"
, year =	1997
, keywords =	"doctoral thesis"
, update =	"97.07 smid"
}

@article{vfor-hvv-96
, author =	"J. Vleugels and V. Ferrucci and M. Overmars and A. Rao"
, title =	"Hunting {Voronoi} Vertices"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"329--354"
, succeeds =	"forv-hvvnp-94"
, update =	"97.03 devillers+smid"
}

@article{vo-avdcs-98
, author =	"J. Vleugels and M. Overmars"
, title =	"Approximating {Voronoi} Diagrams of Convex Sites in any Dimension"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	8
, year =	1998
, pages =	"201--222"
, update =	"98.11 devillers"
}

@article{v-cptm-93
, author =	"H. Voelcker"
, title =	"Current perspective on tolerancing and metrology"
, journal =	"Manufacturing Review"
, volume =	6
, number =	4
, year =	1993
, pages =	"258--268"
, update =	"97.03 agarwal"
}

@techreport{vh-rsmmp-81
, author =	"H. B. Voelcker and W. A. Hunt"
, title =	"The Role of Solid Modeling in Machining - Process Modeling and {NC} Verification"
, type =	"SAE {Technical} {Paper}"
, number =	810195
, institution =	"SAE"
, year =	1981
, update =	"98.03 bibrelex"
}

@article{vr-gmmpp-78
, author =	"H. B. Voelcker and A. A. G. Requicha"
, title =	"Geometric modeling of mechanical parts and processes"
, journal =	"Computer"
, volume =	1977
, year =	1978
, pages =	"48--57"
}

@inproceedings{vw-tgtae-95
, author =	"F. Vogt and R. Wille"
, title =	"{TOSCANA} --- a Graphical Tool for Analyzing and Exploring Data"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"226--233"
, keywords =	"graph drawing, nested diagram, order, system"
, update =	"95.01 tamassia"
}

@mastersthesis{v-hrdgd-93
, author =	"A. Voigtmann"
, title =	"Hierarchische Repr{\"a}sentation diskreter geometrischer Daten"
, school =	"Fachbereich Mathematik, Universit{\"a}t-GH Siegen"
, year =	1993
, note =	"Diplomarbeit"
, keywords =	"master thesis"
, update =	"98.11 bibrelex"
}

@article{vbh-hmmsr-97
, author =	"A. Voigtmann and L. Becker and K. Hinrichs"
, title =	"A Hierarchical Model for Multiresolution Surface Reconstruction"
, journal =	"Graph. Models Image Process."
, volume =	59
, number =	5
, month =	sep
, year =	1997
, pages =	"333--348"
, update =	"98.07 held"
}

@inproceedings{vbh-hsruc-94
, author =	"Andreas Voigtmann and Ludger Becker and Klaus Hinrichs"
, title =	"Hierachical Surface Representation Using Constrained {Delaunay} Triangulations"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG '94"
, site =	"Santander"
, publisher =	"Universidad de Cantabria, Santander"
, year =	1994
, pages =	"16--19"
, update =	"00.11 smid, 00.07 icking"
}

@inproceedings{vbh-cdpmr-94
, author =	"A. Voigtmann and L. Becker and K. Hinrichs"
, title =	"The Constrained {Delaunay} Pyramid: a Model for ReconstructingSurfaces at Multiple Resolutions"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"177--182"
, cites =	"bkss-rtera-90, bv-hmrr-84, c-cdt-89, ct-qrdt-86, dfnp-hssa-84, d-srbtg-87, d-pdstb-89, dp-olacd-92, gg-dmtds-79, g-rtdis-84, ls-tacdt-80, mv-cdtr-93, nhs-gfasm-84, fp-ochr3-84, ps-cgi-85, s-asdsc-90, s-dasds-90, sg-apads-85, w-cabds-85, sp-htucc-92, w-ebdss-85, v-hrdgd-93, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@article{v-tpshp-86
, author =	"A. Vol{\v c}i{\v c}"
, title =	"A three-point solution to {Hammer's} x-ray problem"
, journal =	"J. London Math. Soc."
, volume =	2
, number =	27
, year =	1986
, pages =	"349--359"
, update =	"98.11 bibrelex"
}

@inproceedings{vk-apeic-87
, author =	"R. Volpe and P. Khosla"
, title =	"Artificial potential with elliptical isopotential contours for obstacle avoidance"
, booktitle =	"Proc. 26th IEEE Conf. on Decision and Control"
, year =	1987
, pages =	"180--185"
, update =	"97.03 schwarzkopf"
}

@incollection{r-hrrc-83
, author =	"S. M. {von Rump}"
, title =	"How reliable are results of computers"
, booktitle =	"Jahrbuch {\"U}berblicke Mahtematik"
, year =	1983
, pages =	"163--168"
, note =	"Trans. from German: Wie zuverl{\"a}ssig sind die Ergebnisse unserer Rechenanlagen"
, update =	"98.11 bibrelex"
}

@inproceedings{v-plcpt-
, author =	"K. Vophi"
, title =	"Perturbation de lines et circles et pr{\\xb4e}servation de la topologie"
, booktitle =	"Journ{\\xb4e}es de g{\\xb4e}ometrie algorithmique du Val d'Ajol"
, update =	"98.11 bibrelex"
}

@inproceedings{v-ilbtm-95
, author =	"Nicolai Vorobjov"
, title =	"Improved lower bound on testing membership to a polyhedron by algebraic decision trees"
, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS '95"
, year =	1995
, pages =	"To appear"
, update =	"98.07 bibrelex, 97.03 agarwal, 95.09 mitchell"
}

@article{v-dmrsl-09
, author =	"G. F. Vorono{\"\i}"
, title =	"Deuxi{\`e}me m{\'e}moire: recherches sur les parall{\'e}loedres primitifs"
, journal =	"J. Reine Angew. Math."
, volume =	136
, year =	1909
, pages =	"67--181"
}

@article{v-nadpc-08
, author =	"G. M. Voronoi"
, title =	"Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. Deuxi{\`e}me {M{\'e}moire}: Recherches sur les parall{\'e}llo{\`e}dres primitifs"
, journal =	"J. Reine Angew. Math."
, volume =	134
, year =	1908
, pages =	"198--287"
, keywords =	"Voronoi diagrams"
, update =	"93.09 held"
}

@article{v-nadpc-07
, author =	"G. M. Voronoi"
, title =	"Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. Premier {M{\'e}moire}: Sur quelques propri{\'e}t{\'e}s des formes quadratiques positives parfaites"
, journal =	"J. Reine Angew. Math."
, volume =	133
, year =	1907
, pages =	"97--178"
, update =	"93.09 held"
}

@techreport{vk-mnecd-82
, author =	"K. Voss and R. Klette"
, title =	"In the maximum number of edges of convex digital polygons included into a square"
, number =	"N/82/6"
, institution =	"Friedrich Schiller Univ., Jena"
, year =	1982
, update =	"97.11 bibrelex"
}

@article{v-sccup-85
, author =	"D. L. Vossler"
, title =	"Sweep-to-{CSG} conversion using pattern recognition techniques"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	5
, number =	8
, month =	aug
, year =	1985
, pages =	"61--66"
}

@article{vz-ctpci-92
, author =	"S. Vre{\'c}ica and R. {\v Z}ivaljevi{\'c}"
, title =	"The colored {T}verberg's problem and complexes of injective functions"
, journal =	"J. Combin. Theory Ser. A"
, volume =	61
, year =	1992
, pages =	"309--318"
, comments =	"implies $o(n^d)$ bound for k-sets in any dimension d"
, update =	"98.03 agarwal, 93.09 matousek"
}

@article{vs-dctds-91
, author =	"G. Vriend and C. Sander"
, title =	"Detection of common three-dimensional substructures in proteins"
, journal =	"PROTEINS: Structure, Funcion, and Genetics"
, volume =	11
, year =	1991
, pages =	"52--58"
, update =	"98.07 bibrelex"
}

@article{v-ulds-80
, author =	"J. Vuillemin"
, title =	"A unifying look at data structures"
, journal =	"Commun. ACM"
, volume =	23
, year =	1980
, pages =	"229--239"
}

@book{w-rfeb-
, author =	"E. Wachspress"
, title =	"A Rational Finite Elemente Basis"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	"??"
, update =	"98.03 bibrelex"
}

@book{w-eidag-73
, author =	"B. L. van der Waerden"
, title =	"Einf{\"u}hrung in die {Algebraische} {Geometrie}"
, edition =	"2nd"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1973
, update =	"98.03 bibrelex"
}

@book{w-ma-53
, author =	"B. von der Waerden"
, title =	"Modern Algebras"
, publisher =	"Ungar"
, year =	1953
, note =	"Volumes 1-2"
, update =	"98.03 bibrelex"
}

@inproceedings{w-ophcs-92
, author =	"H. Wagener"
, title =	"Optimal parallel hull construction for simple polygons in {$O(\log\log n)$} time"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"593--599"
}

@techreport{w-opach-85
, author =	"H. Wagener"
, title =	"Optimally parallel algorithms for convex hull determination"
, type =	"Manuscript"
, institution =	"??"
, year =	1985
}

@phdthesis{w-pcgup-85
, author =	"H. Wagener"
, title =	"Parallel Computational Geometry Using Polygonal Order"
, school =	"Technical University of Berlin"
, address =	"FRG"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"93.09 held"
}

@inproceedings{w-ptep-89
, author =	"H. Wagener"
, title =	"{Parallele} {Triangulierung} von einfachen {Polygonen}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@inproceedings{w-tmpp-88
, author =	"H. Wagener"
, title =	"Triangulating a monotone polygon in parallel"
, booktitle =	"Computational Geometry and its Applications"
, nickname =	"CG '88"
, site =	"W{\"u}rzburg"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"136--147"
, update =	"00.03 bibrelex, 99.11 bibrelex"
, annote =	"4th Intern. Workshop Comput. Geom."
}

@inproceedings{w-nakkc-91
, author =	"Dorothea Wagner"
, title =	"A New Approach to Knock-Knee Channel Routing"
, booktitle =	"Proc. 2nd Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"83--93"
, precedes =	"w-ortdc-93"
, update =	"96.09 devillers, 94.01 smid, 93.09 milone+mitchell"
}

@article{w-ortdc-93
, author =	"D. Wagner"
, title =	"Optimal routing through dense chanels"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"269--289"
, keywords =	"VLSI design, knock knee chanel routing, wire length, number of bends, layer assignment"
, succeeds =	"w-nakkc-91"
, update =	"96.09 devillers"
}

% ### verify year: 1992 ?
@article{ww-gzops-91
, author =	"D. Wagner and F. Wagner"
, title =	"A Generalization of the Zero-One-Principle for Sorting Algorithms"
, journal =	"Discrete Appl. Math."
, volume =	30
, year =	1991
, pages =	"265--273"
, update =	"97.03 gaertner+salinger"
}

@article{ww-eplta-92
, author =	"D. Wagner and F. Wagner"
, title =	"An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem"
, journal =	"Discrete Appl. Math."
, volume =	40
, year =	1992
, pages =	"73--81"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{ww-bmcgb-93
, author =	"D. Wagner and F. Wagner"
, title =	"Between Min Cut and Graph Bisection"
, booktitle =	"Proc. 18th Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	711
, year =	1993
, pages =	"744--750"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{ww-ltaed-93
, author =	"D. Wagner and K. Weihe"
, title =	"A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, nickname =	"ESA '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"384--395"
, update =	"95.05 tamassia"
}

@article{ww-ltaed-95
, author =	"D. Wagner and K. Weihe"
, title =	"A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs"
, journal =	"Combinatorica"
, volume =	15
, number =	1
, year =	1995
, pages =	"135--150"
, succeeds =	"ww-ltaed-93"
, update =	"98.07 tamassia+vismara"
}

@inproceedings{ww-alcvr-95
, author =	"Dorothea Wagner and Karsten Weihe"
, title =	"An Animated Library of Combinatorial {VLSI}-Routing Algorithms"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C28--C29"
, keywords =	""
, cites =	"bb-vrfls-84, fww-rtdcm-93, f-dprg-82, kww-aotlc-89, l-caicl-90, mp-rtr-86, mps-crkkm-86, pl-otlcr-84, swww-wkklg-94, w-ortdc-93, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{w-amlon-94
, author =	"F. Wagner"
, title =	"Approximate map labeling is in {$\Omega(n \log n)$}"
, journal =	"Inform. Process. Lett."
, volume =	52
, year =	1994
, pages =	"161--165"
, update =	"95.01 smid"
}

@inproceedings{ww-swrcg-91
, author =	"Frank Wagner and Barbara Wolfers"
, title =	"Short Wire Routing in Convex Grids"
, booktitle =	"Proc. 2nd Internat. Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	557
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"72--82"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@article{ww-pmla-97
, author =	"F. Wagner and A. Wolff"
, title =	"A practical map labeling algorithm"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"387--404"
, update =	"97.07 devillers"
}

@inproceedings{ww-eeaam-95
, author =	"F. Wagner and A. Wolff"
, title =	"An Efficient and Effective Approximation Algorithm for the Map Labeling Problem"
, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	979
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"420--433"
, update =	"97.07 agarwal, 97.03 gaertner+salinger"
}

@inproceedings{ww-frml-95
, author =	"F. Wagner and A. Wolff"
, title =	"Fast and Reliable Map Labeling"
, booktitle =	"Proc. 9th Internat. Symp. on Computer Science for Environment Protection"
, year =	1995
, pages =	"667--675"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{ww-mlhpg-95
, author =	"Frank Wagner and Alexander Wolff"
, title =	"Map Labeling Heuristics: {Provably} Good and Practically Useful"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"109--118"
, keywords =	"experimental, approximation algorithm"
, cites =	"aik-vspca-89, eis-ctmfp-76, f-agpsp-92, fw-ppalm-91, i-pnm-75, kr-pcr-92, mn-lledt-89, ia-eaggs-86, kmps-eagpp-93, w-amlon-94, wka-appma-94, ZZZ"
, update =	"98.03 bibrelex, 95.09 mitchell"
}

@article{w-bzv-36
, author =	"K. Wagner"
, title =	"{B}emerkungen zum {V}ierfarbenproblem"
, journal =	"Jahresbericht der Deutschen Mathematiker-Vereinigung"
, volume =	46
, year =	1936
, pages =	"26--32"
, keywords =	"graph drawing"
, update =	"98.11 bibrelex, 98.07 vismara, 93.09 tamassia"
, annote =	"Shows that any triangulation can be transformed into
		 any other by flips."
}

@article{w-sf-76
, author =	{Neal R. Wagner}
, title =       {The Sofa Problem}
, year =        {1976}
, journal =     {The American Mathematical Monthly}
, volume =      {83}
, number =         {3}
, pages =       {188--189}
, doi =         {10.2307/2977022}
}

@inproceedings{ww-oedca-00
, author =	"Uli Wagner and Emo Welzl"
, title =	"Origin-Embracing Distributions, or A Continuous Analogue of the Upper Bound Theorem"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"50--56"
, update =	"00.11 jones"
}

@article{w-sfsnd-84
, author =	"G. Wahba"
, title =	"Surface fitting with scattered noisy data on {Euclidean} $d$-space and on the sphere"
, journal =	"Rocky Mountain J. Math."
, volume =	14
, number =	1
, year =	1984
, pages =	"281--299"
}

@article{wc-stp2t-83
, author =	"J. A. Wald and C. J. Colbourn"
, title =	"Steiner trees, partial $2$-trees, and minimum {IFI} networks"
, journal =	"Networks"
, volume =	13
, year =	1983
, pages =	"159--167"
}

@article{ws-rqipu-86
, author =	"J. A. Wald and P. G. Sorenson"
, title =	"Resolving the query inference problem using {Steiner} trees"
, journal =	"ACM Trans. Database Syst."
, volume =	9
, year =	1986
, pages =	"348--368"
}

@book{w-gimk-57
, author =	"A. Walfisz"
, title =	"Gitterpunkte in mehrdimensionalischen {Kugeln}"
, publisher =	"Panstwowe Wydawnictwo Naukowe"
, address =	"Warszawa, Poland"
, year =	1957
, update =	"97.11 bibrelex"
}

@article{w-npagt-90
, author =	"J. Q. {Walker II}"
, title =	"A Node-positioning Algorithm for General Trees"
, journal =	"Softw. -- Pract. Exp."
, volume =	20
, number =	7
, year =	1990
, pages =	"685--705"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{w-ac-62
, author =	"R. Walker"
, title =	"Algebraic Curves"
, publisher =	"Dover"
, year =	1962
, update =	"98.03 bibrelex"
}

@book{w-ac-78
, author =	"R. Walker"
, title =	"Algebraic Curves"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1978
, update =	"98.03 bibrelex"
}

@inproceedings{ws-ppptu-99
, author =	"R. J. Walker and J. Snoeyink"
, title =	"Practical Point-in-Polygon Tests Using {CSG} Representations of Polygons"
, editor =	"M. T. Goodrich and C. C. McGeoch"
, booktitle =	"Algorithm Engineering and Experimentation (Proc. ALENEX~'99)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1619
, publisher =	"Springer-Verlag"
, year =	1999
, pages =	"114--123"
, update =	"00.11 smid, 00.07 vismara"
}

@inproceedings{ws-ceays-93
, author =	"R. K. Walker and V. Srinivasan"
, title =	"Creation and Evolution of the {ASME} {Y14.5.1M} Standard"
, booktitle =	"Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
, year =	1993
, pages =	"19--30"
, update =	"96.09 orourke"
}

@article{ws-ceays-94
, author =	"R. K. Walker and V. Srinivasan"
, title =	"Creation and evolution of the {ASME Y14.5.1M} standard"
, journal =	"Manufacturing Review"
, volume =	7
, number =	4
, year =	1994
, pages =	"16--23"
, update =	"98.03 agarwal"
}

@article{weh-rtapr-89
, author =	"J. R. Wallace and K. A. Elmquist and E. A. Haines"
, title =	"A ray tracing algorithm for progressive radiosity"
, journal =	"Comput. Graph."
, volume =	23
, number =	3
, year =	1989
, pages =	"315--324"
, note =	"Proc. SIGGRAPH '89"
, update =	"98.03 bibrelex"
}

@inproceedings{wbs-vbvct-92
, author =	"R. S. Wallace and B. B. Bederson and E. L. Schwartz"
, title =	"Voice bandwidth visual communication through logmaps: {The} {Telecortex}"
, booktitle =	"Workshop on Applications of Computer Vision"
, year =	1992
, pages =	"4--10"
, update =	"98.07 bibrelex"
}

@inproceedings{wc-pmhf-94
, author =	"A. Wallack and J. Canny"
, title =	"Planning for modular and hybrid fixtures"
, booktitle =	"Proc. 11th IEEE Internat. Conf. Robot. Autom."
, month =	may
, year =	1994
, update =	"98.03 bibrelex"
}

@article{wc-pmhf-97
, author =	"A. S. Wallack and J. F. Canny"
, title =	"Planning for Modular and Hybrid Fixtures"
, journal =	"Algorithmica"
, volume =	19
, number =	"1--2"
, month =	sep
, year =	1997
, pages =	"40--60"
, update =	"97.07 held"
}

@mastersthesis{w-sdssr-79
, author =	"J. Walsh"
, title =	"The Simulation of Directional Sound Sources in Rooms by Means of a Digital Computer"
, school =	"Univ. Western Ontario"
, address =	"London, Ontario, Canada"
, year =	1979
, note =	"M. Mus. Thesis"
, keywords =	"master thesis"
, update =	"97.11 bibrelex"
}

@misc{wd-ddgsr-81
, author =	"J. Walsh and N. Dadoun"
, title =	"The Design and Development of {GODOT}: {A} System for Room Acoustics Modelling"
, howpublished =	"Presented at 101st Meeting of the Acoustical Society of America"
, month =	may
, year =	1981
, update =	"97.11 bibrelex"
}

@misc{wd-wawwd-82
, author =	"J. Walsh and N. Dadoun"
, title =	"What Are We Waiting for? {Development} of {GODOT} {II}"
, howpublished =	"Presented at 103rd Meeting of the Acoustical Society of America"
, month =	apr
, year =	1982
, update =	"97.11 bibrelex"
}

@book{wo-ich-81
, title =	"Iron castings handbook"
, editor =	"C. F. Walton and T. J. Opar"
, publisher =	"Iron Casting Society, Inc."
, year =	1981
, update =	"98.03 bibrelex"
}

@article{wwp-amdc-88
, author =	"S. J. Wan and S. K. M. Wong and P. Prusinkiewicz"
, title =	"An algorithm for multidimensional data clustering"
, journal =	"ACM Trans. Math. Softw."
, volume =	14
, number =	2
, year =	1988
, pages =	"153--162"
, update =	"97.11 bibrelex"
}

@phdthesis{w-ngvdp-87
, author =	"C. Wang"
, title =	"A new generalization of {Voronoi} diagrams in the plane"
, school =	"University of Alberta"
, address =	"Edmonton, Alberta, Canada"
, year =	1987
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@techreport{w-oagts-93
, author =	"C. Wang"
, title =	"An optimal algorithm for greedy triangulation of a set of points"
, institution =	"Memorial University of Newfoundland"
, year =	1983
, succeeds =	"w-oagts-94"
, update =	"98.11 bibrelex"
}

@phdthesis{w-imdpp-83
, author =	"C. Wang"
, title =	"Intersection and minimum distance problems for planar polygons"
, school =	"University of Alberta"
, address =	"Department of Computing Science"
, year =	1983
, keywords =	"doctoral thesis"
, update =	"97.11 bibrelex"
}

@inproceedings{w-oagts-94
, author =	"C. A. Wang"
, title =	"An Optimal Algorithm for Greedy Triangulation of a Set of Points"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"332--338"
, succeeds =	"w-oagts-93"
, cites =	"a-lncg-88, cg-vippg-89, ddmw-fgta-94, g-segta-89, k-ndot-80, l-seagt-87a, ll-abgtc-87, ll-fagt-92, ll-gtaoc-91, ps-cgi-85, s-cdtvd-88, hs-parss-93, w-eucdt-93, w-oagts-93, g-nrpt-79, ls-tacdt-80, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{w-cdmpp-89
, author =	"C. A. Wang"
, title =	"Collision detection of a moving polygon in the presence of polygonal obstacles in the plane"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	35
}

@article{w-eucdt-93
, author =	"C. A. Wang"
, title =	"Efficiently updating the constrained {Delaunay} triangulations"
, journal =	"BIT"
, volume =	33
, year =	1993
, pages =	"238--252"
, update =	"94.05 drysdale"
}

@techreport{wc-fmvvd-86t
, author =	"C. A. Wang and E. P. F. Chan"
, title =	"Finding the minimum visible vertex distance between two nonintersecting simple polygons"
, institution =	"Department of Computing Science, University of Alberta"
, year =	1986
, precedes =	"wc-fmvvd-86"
, update =	"97.11 bibrelex"
}

@inproceedings{wc-fmvvd-86
, author =	"C. A. Wang and E. P. F. Chan"
, title =	"Finding the minimum visible vertex distance between two nonintersecting simple polygons"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"34--42"
, succeeds =	"wc-fmvvd-86t"
, cites =	"abosy-fmcnp-85, bo-arcgi-79, be-nlcha-84, cd-diec-80, cw-oaimd-83, csw-uacpc-85, e-cedbt-82, fm-tspep-84, gjpt-tsp-78, k-eccs-79, lp-cgs-84, ld-gvdp-81, mt-fmvdb-83, so-fmnp-85t, t-oacmv-83, w-imdpp-83, www-dpcgf-85, wc-fmvvd-86t, ZZZ"
, update =	"97.11 bibrelex"
}

@inproceedings{wc-gtp3d-94
, author =	"C. A. Wang and F. Y. Chin"
, title =	"On Greedy Tetrahedralization of Points in 3-{D}"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"532--540"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
}

@inproceedings{ws-oacdt-87
, author =	"C. A. Wang and L. Schubert"
, title =	"An optimal algorithm for constructing the {Delaunay} triangulation of a set of line segments"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"223--232"
, cites =	"ahu-daca-74, ae-oacwv-84, bo-arcgi-79, c-tpca-82, cgl-pgd-83, cw-oaimd-83, dk-ladsc-85, egs-oplms-86, eos-calha-83, f-savd-86, gjpt-tsp-78, k-eccs-79, k-osps-83, l-ccit-76, ls-tacdt-80, lp-cgs-84, l-prp-78, l-tdvdl-80, ll-gdtpg-86, ph-chfsp-77, ps-cgi-85, sh-cpp-75, ta-chapi-82, w-ngvdp-87, y-oavds-84, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{wt-fcwvd-90
, author =	"C. A. Wang and P. Y. Tsin"
, title =	"Finding constrained and weighted {Voronoi} diagrams in the place"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"200--203"
, cites =	"ae-oacwv-84, eos-calha-86, ZZZ"
, update =	"98.07 bibrelex"
}

@article{wt-otpat-87
, author =	"C. A. Wang and Y. H. Tsin"
, title =	"An {$O(\log n)$} time parallel algorithm for triangulating a set of points in the plane"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"55--60"
}

@inproceedings{wt-eucdt-92
, author =	"C. A. Wang and Y. H. Tsin"
, title =	"Efficiently updating constrained {Delaunay} triangulations"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"176--181"
, cites =	"aw-cg-88, agss-ltacv-89, a-vdsfg-91, c-cdt-87, dl-cvdrp-91, jw-dcvdd-88, ll-gdtpg-86, ll-abgtc-87, ll-fagt-90, l-seagt-87, l-vdbsd-89, ps-cgi-85, s-cdtvd-88, ws-oacdt-87, ZZZ"
, update =	"98.07 bibrelex"
}

@article{wt-fcwvd-98
, author =	"Cao An Wang and Yung H. Tsin"
, title =	"Finding constrained and weighted {Voronoi} diagrams in the plane"
, journal =	"Comput. Geom. Theory Appl."
, volume =	10
, year =	1998
, pages =	"89--104"
, succeeds =	"wt-fcwvd-90"
, update =	"98.11 devillers"
}

@inproceedings{wt-fcvsl-91
, author =	"C. A. Wang and Y. H. Tsin"
, title =	"Finding the closest and visible sites for a line in the presenc e of barriers"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"92--95"
, cites =	"aaghi-vdp-86, at-oadvp-81, ea-lacvp-81, bkt-dsvp-89, ps-cgi-85, gt-ltasc-83, ZZZ"
, update =	"98.07 bibrelex"
}

@article{wy-lbbsb-01
, author =	"C. A. Wang and B. Yang"
, title =	"A lower bound for {$\beta$}-skeleton belonging to minimum weight triangulations"
, journal =	"Comput. Geom. Theory Appl."
, volume =	19
, year =	2001
, pages =	"35--46"
, update =	"01.07 smid"
}

@inproceedings{wy-otscp-00
, author =	"Cao An Wang and Boting Yang"
, title =	"Optimal Tetrahedralizations of Some Convex Polyhedra"
, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
, nickname =	"CG 2000"
, site =	"Eilat"
, publisher =	"Ben-Gurion University of the Negev"
, year =	2000
, pages =	"5--9"
, update =	"00.03 bibrelex"
}

@inproceedings{wy-pcp-99
, author =	"Cao An Wang and Bo-Ting Yang"
, title =	"On some Polyhedra Covering Problems"
, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
, nickname =	"CG '99"
, site =	"Antibes"
, publisher =	"INRIA Sophia-Antipolis"
, year =	1999
, pages =	"119--122"
, update =	"00.03 bibrelex, 99.07 bibrelex"
}

@inproceedings{wz-slpr-97
, author =	"Cao An Wang and Binhai Zhu"
, title =	"Shooter Location Problems Revisited"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"223--228"
, update =	"97.11 jones"
}

@phdthesis{w-mddsmp-97
, author =	"C.-H. Wang"
, title =	"Manufacturability-driven decomposition of sheet metal products"
, school =	"Carnegie Mellon University, The Robotics Institute"
, year =	1997
, keywords =	"manufacturing,polytopes"
, update =	"98.11 orourke"
}

@inproceedings{wg-ctdt-96
, author =	"D. Wang and J. A. Goldak"
, title =	"Correcting topological defects of tessellations"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"50--55"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{wl-oasrm-93
, author =	"D. Wang and R. Lee"
, title =	"An optimal algorithm for solving the restricted minimal convex nested polygonal section problem"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"334--339"
, succeeds =	"wl-oasrm-92"
, cites =	"abosy-fmcnp-89, ll-ccmp-84, ps-cgi-85, wl-oasrm-92, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@article{w-oacob-01
, author =	"D. P. Wang"
, title =	"An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons"
, journal =	"Inform. Process. Lett."
, volume =	79
, year =	2001
, pages =	"229--236"
, update =	"02.03 cheong"
}

@inproceedings{whcl-psapa-93
, author =	"D. P. Wang and N. F. Huang and H. S. Chao and R. C. T. Lee"
, title =	"Plane Sweep Algorithms for Polygonal Approximation Problems with Applications"
, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '93"
, series =	"Lecture Notes Comput. Sci."
, volume =	762
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"515--522"
, update =	"98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
}

@techreport{wl-oasrm-92
, author =	"D. P. Wang and R. C. T. Lee"
, title =	"An Optimal Algorithm for Solving the Restricted minimal Convex nested Polygonal Separation Problem"
, type =	"Technical Report"
, year =	1992
, precedes =	"wl-oasrm-93"
, update =	"98.11 bibrelex"
}

@article{wk-stglp-88
, author =	"D. W. Wang and Y. S. Kuo"
, title =	"A Study of Two Geometric Location Problems"
, journal =	"Inf. Proc. Letters"
, volume =	28
, number =	6
, month =	aug
, year =	1988
, pages =	"281--286"
, update =	"98.07 bibrelex"
}

@article{w-piavp-93
, author =	"F. Wang"
, title =	"A Parallel Intersection Algorithm for Vector Polygon Overlay"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	13
, number =	2
, month =	mar
, year =	1993
, pages =	"74--81"
, update =	"93.09 held"
}

@article{w-smfib-84
, author =	"G. Wang"
, title =	"The subdivision method of finding the intersection between two {Bezier} curves or surfaces"
, journal =	"Zhejiang Univ. J., Special issue on Computational Geometry"
, volume =	"??"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{w-glc-65
, author =	"H. Wang"
, title =	"Games, logic and computers"
, journal =	"Scientific Amer."
, volume =	"??"
, year =	1965
, update =	"97.11 bibrelex"
}

@inproceedings{wa-aaccs-96
, author =	"H. Wang and P. K. Agarwal"
, title =	"Approximation algorithms for curvature constrained shortest paths"
, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1996
, pages =	"409--418"
, keywords =	"shortest paths, approximation, configuration space, path planning, curvature, robust paths"
, update =	"96.09 agarwal, 96.05 agarwal, 96.01 mitchell"
}

% ### others?
@article{wo-entpp-87
, author =	"H.-P. Wang and others"
, title =	"On the Efficiency of {NC} Tool Path Planning for Face Milling Operations"
, journal =	"Trans. of the ASME, J. of Engineering for Industry"
, volume =	109
, number =	4
, month =	nov
, year =	1987
, pages =	"370--376"
, update =	"93.09 held"
}

@inproceedings{wlb-gssnv-97
, author =	"L. Wang and M. C. Leu and D. Blackmore"
, title =	"Generating Swept Solids for {NC} Verification Using the {SEDE} Method"
, booktitle =	"Proc. 4th Sympos. Solid Modeling Found. Applications"
, site =	"Atlanta, GA, USA"
, month =	may
, year =	1997
, pages =	"364--375"
, update =	"97.07 held"
}

@article{wwcc-cslst-96
, author =	"M.-E. Wang and T. C. Woo and L.-L. Chen and S.-Y. Chou"
, title =	"Computing Spanning Line Segments in Three Dimensions"
, journal =	"Visual Comput."
, volume =	12
, number =	4
, year =	1996
, pages =	"173--180"
, update =	"96.09 held"
}

@article{w-cqsis-92
, author =	"T. Wang"
, title =	"A {$C^{2}$}-quintic spline interpolation scheme on triangulation"
, journal =	"Comput. Aided Geom. Design"
, volume =	9
, year =	1992
, pages =	"379--386"
, update =	"97.11 bibrelex"
}

@article{wg-s3dsr-93
, author =	"W. Wang and G. G. Grinstein"
, title =	"A Survey of 3{D} Solid Reconstruction from 2{D} Projection Line Drawings"
, journal =	"Comput. Graph. Forum"
, volume =	12
, number =	2
, month =	jun
, year =	1993
, pages =	"137--158"
, update =	"93.09 held"
}

@article{wjg-rqpq-97
, author =	"W. Wang and B. Joe and R. Goldman"
, title =	"Rational Quadratic Parameterizations of Quadrics"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"599--"
, update =	"98.11 devillers"
}

@inproceedings{wgcpp-ipsng-90
, author =	"Y. Wang and E. L. Gursoz and J.-M. Chen and F. B. Prinz and N. M. Patrikalakis"
, title =	"Intersections of Parametric Surfaces for Next Generation Geometric Modeling Systems"
, editor =	"J. Turner, J. Pegna and M. Wozny"
, booktitle =	"Proc. of the International Federation of Information Processing TC5/WG 5.2 Working Conference on Geometric Modeling for Product Engineering: Product Modeling for Computer-Aided Design and Manufacturing"
, year =	1990
, pages =	"75--96"
, update =	"95.05 abrams"
}

@article{wa-srr3d-86
, author =	"Y. F. Wang and J. K. Aggarwal"
, title =	"Surface reconstruction and representation for 3-D scenes"
, journal =	"Pattern Recogn."
, volume =	19
, year =	1986
, pages =	"197--207"
, update =	"94.05 drysdale"
}

@article{wlc-nibtr-89
, author =	"Y. L. Wang and R. C. T. Lee and J. S. Chang"
, title =	"The number of intersections between two rectangular paths"
, journal =	"IEEE Trans. Comput."
, volume =	38
, number =	11
, year =	1989
, pages =	"1564--1571"
, update =	"94.01 tuan"
}

@article{w-cefao-87
, author =	"Z. Wang"
, title =	"A Conformal Elimination Free Algorithm for Oriented Matroid Programming"
, journal =	"Chinese Annals of Mathematics"
, volume =	8
, year =	1987
, update =	"97.11 bibrelex"
}

@inproceedings{w-pcacc-95
, author =	"Z. J. Wang"
, title =	"Proof of Concept: An Automated CFD Computing Environment with a Cartesian/Prism Grid Generator, Grid Adaptor and Flow Solver"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"87--101"
, update =	"96.01 samitchell"
}

@article{wpw-mtpr-74
, author =	"G. E. Wangdahl and S. M. Pollock and J. B. Woodward"
, title =	"Minimum-Trajectory Pipe Routing"
, journal =	"Journal of Ship Research"
, volume =	18
, number =	1
, month =	mar
, year =	1974
, pages =	"46--49"
, update =	"93.09 milone+mitchell"
}

@article{w-wcach-93
, author =	"A. R. Warburton"
, title =	"Worst-case Analysis of some Convex Hull Heuristics for the {Euclidean} Travelling Salesman Problem"
, journal =	"Oper. Res. Lett."
, volume =	13
, year =	1993
, pages =	"37--42"
, keywords =	"travelling salesman problem, heuristic, approximation algorithms, convex hulls"
, comments =	"It is well known that the nearest insertion and cheapest
insertion are a factor 2 apx for TSP, and this is tight.
Interestingly, for pts in the plane, if you start with a tour
consisting of the convex hull vertices, and continue with nearest or
cheapest insertion this is a factor 3 apx, and this is tight!"
, update =	"98.07 mitchell"
}

@incollection{w-cbsld-94
, author =	"Greg Ward"
, title =	"A Contrast-Based Scalefactor for Luminance Display"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"415--421"
, keywords =	"brightness, color, image display, perception, Radiance system"
, update =	"94.09 heckbert"
, annote =	"Presents a simple technique for displaying pictures that
have a dynamic range (ratio of brightest to dimmest pixel) beyond that of
the display."
}

@article{wrc-rtsdi-88
, author =	"G. J. Ward and F. M. Rubinstein and R. D. Clear"
, title =	"A ray tracing solution for diffuse interreflection"
, journal =	"Comput. Graph."
, volume =	22
, number =	4
, year =	1988
, pages =	"85--92"
, note =	"Proc. SIGGRAPH '88"
, update =	"98.03 bibrelex"
}

@article{ww-ubnlm-85
, author =	"James E. Ward and Richard E. Wendell"
, title =	"Using Block Norms for Location Modeling"
, journal =	"Oper. Res."
, volume =	33
, year =	1985
, pages =	"1074--1090"
, update =	"98.07 icking"
}

@inproceedings{wc-atvit-80
, author =	"M. O. Ward and Y. T. Chien"
, title =	"Analysis of time-varying imagery through the representation of position and shape changes"
, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
, year =	1980
, pages =	"1236--1238"
}

@article{wt-ommsl-83
, author =	"C. Warde and J. Thackara"
, title =	"Operating modes of the microchannel spatial light modulator"
, journal =	"Optical Engineering"
, volume =	22
, number =	6
, year =	1983
, pages =	"695--703"
, update =	"97.11 bibrelex"
}

@article{w-cthm-77
, author =	"J. Warfield"
, title =	"Crossing Theory and Hierarchy Mapping"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-7"
, number =	7
, year =	1977
, pages =	"502--523"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{w-ocdfe-72
, author =	"J. Warga"
, title =	"Optimal Control of differential and functional equations"
, publisher =	"Academic Press"
, year =	1972
}

@incollection{w-cildp-71
, author =	"T. T. Warnock"
, title =	"Computational investigations of low-discrepancy point sets"
, editor =	"S. K. Zaremba"
, booktitle =	"Applications of Number Theory to Numerical Analysis"
, publisher =	"Academic Press"
, year =	1971
, pages =	"319--344"
, update =	"98.03 bibrelex"
}

@article{w-tsplr-57
, author =	"William Warntz"
, title =	"Transportation, Social Physics, and the Law of Refraction"
, journal =	"The Professional Geographer"
, volume =	9
, number =	4
, year =	1957
, pages =	"2--7"
, keywords =	"weighted region problem, shortest paths, GIS, Snell's Law"
, update =	"98.03 mitchell"
}

@inproceedings{w-vbarp-91
, author =	"Charles W. Warren"
, title =	"A vector based approach to robot path planning"
, booktitle =	"Proc. 1991 IEEE Internat. Conf. Robot. Autom."
, month =	apr
, year =	1991
, pages =	"1021--1026"
, update =	"96.05 efrat, 93.09 milone+mitchell"
, abstract =	"A vector-based algorithm for planning the path of a robot among
irregularly shaped obstacles is presented.  This algorithm combines many of the
desirable features of graph searching and potential field approaches to path
planning.  In this technique, a vector is created from the start position to
the goal of the robot.  If this vector crosses forbidden space, a second vector
is used to determine a new intermediate goal and the previous goal is stored on
a stack.  The procedure is repeated until the latest intermediate goal can be
reached, at which point the robot can be moved to this goal.  This procedure is
repeated by popping a goal off of the stack and continuing until the ultimate
goal is reached.  Preliminary results show much promise for quickly planning
paths of robots in two or more dimensions.  Examples of planning around
multiple two-dimensional obstacles of convex and concave shapes are shown."
}

@article{w-lbanm-68
, author =	"H. E. Warren"
, title =	"Lower bound for approximation by nonlinear manifolds"
, journal =	"Trans. Amer. Math. Soc."
, volume =	133
, year =	1968
, pages =	"167--178"
, update =	"98.03 agarwal"
}

@inproceedings{w-bqsqc-87
, author =	"J. Warren"
, title =	"Blending quadric surfaces with quadric and cubic surfaces"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"341--347"
, cites =	"d-sagd-64, l-padps-76, hh-asgca-85a, hh-qbs-85, hh-pmbsc-85, ms-bsstv-85a, ro-bssgm-85, r-bosm-85, rr-crbsm-84, w-asmgc-86, w-cpgvl-70, ZZZ"
, update =	"98.03 bibrelex"
}

@phdthesis{w-asmgc-86
, author =	"J. Warren"
, title =	"On Algebraic Surfaces Meeting with Geometric Continousity"
, school =	"Dept. Comput. Sci., Cornell Univ."
, address =	"Ithaca, NY"
, month =	aug
, year =	1986
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{wg-otmsr-86
, author =	"Glen Y. Watabayishi and J. A. Galt"
, title =	"An Optimized Triangular Mesh System from Random Points"
, editor =	"J. H{\"a}user and C. Taylor"
, booktitle =	"Numerical Grid Generation in Computational Fluid Dynamics"
, year =	1986
, pages =	"437--448"
, annote =	"Algorithm is generate initial triangulation and
		 improve with flips. Flip criterion is to maximize
		 minimum value of area over perimeter squared. One
		 method of generating initial triangulation is straight
		 insertion, join to visible points. Other method is to
		 construct greedy triangulation by a rather involved
		 $O(n^6)$ algorithm. (Authors make two mistakes in their
		 analysis and claim $O((n!)^2)$.) This is a bit a slow
		 so they compute an approximation to GT by only looking
		 at $O(n)$ short lines, giving an $O(n^2)$ algorithm."
}

@techreport{w-hgdgb-88
, author =	"H. Watanabe"
, title =	"Heuristic Graph Displayer for {G}-{BASE}"
, number =	17
, institution =	"Ricoh Software Research Center, Tokyo, Japan"
, year =	1988
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{w-rtvsa-70
, author =	"G. S. Watkins"
, title =	"A real-time visible surface algorithm"
, type =	"Report"
, number =	"UTEC-CS-70-101"
, institution =	"Dept. Comput. Sci., Univ. Utah"
, address =	"Salt Lake City, UT"
, year =	1970
}

@article{w-grras-
, author =	"M. E. Watkins"
, title =	"Graphical Regular Representations of Alt., Symm., and Misc. Small Groups"
, journal =	"Aequationes Math."
, volume =	11
, year =	"??"
, pages =	"40--50"
, update =	"97.11 bibrelex"
}

@article{w-anagg-71
, author =	"M. E. Watkins"
, title =	"On the Action of Non-abelian Groups on Graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	1
, year =	1971
, pages =	"95--104"
, update =	"97.11 bibrelex"
}

@article{w-acrd-82
, author =	"D. F. Watson"
, title =	"Automatic Contouring of Raw Data"
, journal =	"Comput. Geosci."
, volume =	8
, number =	1
, year =	1982
, pages =	"97--101"
, annote =	"FORTRAN used for DT f point set. $O(N^2)$ on average,
		 $O(N^3)$ worst case. Stores in array for each triangle
		 indices of vertices, circumcentre, circumradius. No
		 adjacency information. Incremental---new point is
		 checked against every circumcircle."
}

@article{w-cnddt-81
, author =	"D. F. Watson"
, title =	"Computing the $n$-Dimensional {Delaunay} Tesselation with Applications to {Voronoi} Polytopes"
, journal =	"Comput. J."
, volume =	24
, number =	2
, year =	1981
, pages =	"167--172"
, update =	"93.09 held"
}

@book{w-cgads-92
, author =	"David F. Watson"
, title =	"Contouring: {A} Guide to the Analysis and Display of Spatial Data"
, publisher =	"Pergamon"
, year =	1992
, comments =	"source code to calculate Voronoi diagram in $2$-d or
$3$-d available from Watson at maths.uwa.edu.au"
, update =	"93.09 jones"
}

@article{w-nnsnd-88
, author =	"D. F. Watson"
, title =	"Natural Neighbor Sorting on the {N}-Dimensional Sphere"
, journal =	"Pattern Recogn."
, volume =	21
, number =	1
, year =	1988
, pages =	"63--67"
, annote =	"Your basic Watson algorithm for DT on $n$-dimensional
		 sphere."
}

@article{w-nns-85
, author =	"D. F. Watson"
, title =	"Natural Neighbour Sorting"
, journal =	"Australian Computer Journal"
, volume =	17
, number =	4
, year =	1985
, pages =	"189--193"
, annote =	"Survey of algorithms for DT."
}

@book{w-ninni-94
, author =	"D. F. Watson"
, title =	"nngridr: An implementation of natural neighbor interpolation"
, publisher =	"David Watson"
, year =	1994
, comments =	"source code and discussion about the natural neighbor
gridding package nngridr, available from Watson at maths.uwa.edu.au"
, update =	"94.05 watson"
}

@article{wp-sst-84
, author =	"D. F. Watson and C. M. Philip"
, title =	"Survey: Systematic Triangulations"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	26
, year =	1984
, pages =	"217--223"
, annote =	"Compares Optimal, Greedy and Delaunay triangulations.
		 Shows that they are different and suggests Delaunay is
		 best because of the equiangular property and efficient
		 implementation."
}

@article{wp-nbi-87
, author =	"D. F. Watson and G. M. Philip"
, title =	"Neighborhood-based interpolation"
, journal =	"Geobyte"
, volume =	2
, number =	2
, year =	1987
, pages =	"12--16"
, update =	"94.05 watson"
, annote =	"Description of natural neighbor interpolation"
}

@book{w-3dcg-93
, author =	"A. Watt"
, title =	"3D Computer Graphics"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1993
, update =	"97.03 schwarzkopf"
}

@article{w-igbtd-90
, author =	"N. P. Weatherill"
, title =	"Integrity Of Geometrical Boundaries In The Two-Dimensional {Delaunay} Triangulation"
, journal =	"Communications in Applied Numerical Methods"
, volume =	6
, number =	2
, month =	feb
, year =	1990
, pages =	"101--109"
, keywords =	"geometrical boundaries, Delaunay triangulation, computational meshes"
, annote =	"Adds extra points so that boundary is part of DT."
, abstract =	"The Delaunay triangulation has recently received
		 attention as a viable method for constructing
		 computational meshes. However, an arbitrary boundary
		 definition which must be preserved in the triangulation
		 process will not, in general, satisfy the geometrical
		 definition on which the Delaunay construction is
		 founded. The effect of this is that the integrity of
		 the given boundary edges will be violated and the
		 computational mesh will not conform to the applied
		 geometrical shape. A method is proposed whereby
		 boundary data are supplemented with points to ensure
		 that imposed boundary edges are preserved during the
		 Delaunay triangulation. The method is illustrated on a
		 geometry of an estuary which exhibits highly complex
		 geometrical features. (Author abstract) 12 Refs."
}

@article{w-msuma-90
, author =	"N. P. Weatherill"
, title =	"Mixed structured-unstructured meshes for aerodynamic flow simulation"
, journal =	"Aeronautical Journal"
, volume =	"??"
, month =	apr
, year =	1990
, pages =	"111--123"
, update =	"98.07 bibrelex"
}

@article{w-ngg-90
, author =	"N. P. Weatherill"
, title =	"Numerical Grid Generation"
, journal =	"Lecture Series"
, volume =	1990
, number =	06
, month =	jun
, year =	1990
, pages =	"66--135"
, note =	"Rhode Saint Genese, Belgium. von Karman Institute for Fluid Dynamics"
, update =	"98.11 bibrelex"
}

@article{wg-udbvh-92
, author =	"R. Webb and M. Gigante"
, title =	"Using dynamic bounding volume hierarchies to improve efficiency of rigid body simulation"
, journal =	"Visual Comput."
, volume =	"??"
, year =	1992
, pages =	"825--842"
, update =	"98.07 bibrelex"
}

@inproceedings{ws-ggove-96
, author =	"R. Webber and A. Scott"
, title =	"{GOVE}: {Grammar}-{Oriented} {Visualisation} {Environment}"
, editor =	"F. J. Brandenburg"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"516--519"
, keywords =	"graph drawing, 3D"
, update =	"98.07 patrignani"
}

@article{ws-ltbta-92
, author =	"R. E. Webber and H. Samet"
, title =	"Linear-time border-tracing algorithms for quadtrees"
, journal =	"Algorithmica"
, volume =	8
, number =	"?"
, year =	1992
, pages =	"39--54"
, note =	"(also Computer Science TR 2309)"
, update =	"96.05 efrat"
}

@article{wka-appma-94
, author =	"G. Weber and L. Knipping and H. Alt"
, title =	"An Application of Point Pattern Matching in Astronautics"
, journal =	"J. Symbolic Comput."
, volume =	17
, year =	1994
, pages =	"321--340"
, update =	"95.05 held"
}

@article{wg-ebr-95
, author =	"C. E. Wee and R. N. Goldman"
, title =	"Elimination and Bivariate Resultants"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	15
, number =	1
, month =	jan
, year =	1995
, pages =	"69--77"
, update =	"95.05 held"
}

@inproceedings{wc-oplmv-90
, author =	"Y. C. Wee and S. Chaiken"
, title =	"An optimal parallel {$L_{1}$}-metric {Voronoi} diagram algorithm"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"60--65"
, cites =	"b-dsp-79, acgoy-pcg-88, cd-vdbcd-85, cg-opapp-88, c-aaspm-87, c-pms-86, e-acg-87, es-vda-86, es-vda-86, gbt-srtgp-84, gs-canen-83, k-racrn-88, k-cavd-89, l-tdvdl-80, pm-toacv-89, sh-cpp-75, s-rngam-83, wcr-sagnn-89, ww-qvrqi-88, y-cmstk-82, ZZZ"
, update =	"98.07 bibrelex"
}

@inproceedings{wcr-sagnn-89
, author =	"Y. C. Wee and S. Chaiken and S. S. Ravi"
, title =	"Some applications of geographic nearest neighbor approach"
, booktitle =	"Proc. 27th Allerton Conf. Commun. Control Comput."
, year =	1989
, update =	"98.07 bibrelex"
}

@inproceedings{wcw-gmarv-89
, author =	"Y. C. Wee and S. Chaiken and D. E. Willard"
, title =	"General metrics and angle restricted {Voronoi} diagrams"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	44
}

@article{whg-icmrt-84
, author =	"H. Weghorst and G. Hooper and D. P. Greenberg"
, title =	"Improved Computational Methods for Ray Tracing"
, journal =	"ACM Trans. Graph."
, volume =	3
, number =	1
, year =	1984
, pages =	"52--69"
, update =	"98.03 mitchell"
}

@article{w-picpp-93
, author =	"Bernd Wegner"
, title =	"Partial inflation of closed polygons in the plane"
, journal =	"Beitr{\"a}ge zur Algebra und Geometrie"
, volume =	34
, number =	1
, year =	1993
, pages =	"77--85"
, update =	"02.03 orourke"
}

@article{w-dcnfc-75
, author =	"G. Wegner"
, title =	"$d$-collapsing and nerves of families of convex sets"
, journal =	"Arch. Math."
, volume =	26
, year =	1975
, pages =	"317--321"
, update =	"97.11 bibrelex"
}

@article{w-uekgf-65
, author =	"G. Wegner"
, title =	"{\"U}ber eine kombinatorisch-geometrische {Frage} von {Hadwiger} und {Debrunner}"
, journal =	"Israel J. Math."
, volume =	3
, year =	1965
, pages =	"187--198"
, update =	"97.11 bibrelex"
}

@article{w-uhgs-85
, author =	"G. Wegner"
, title =	"{\"U}ber {Helly}-{Gallaische} {Stichzahlprobleme}"
, journal =	"Koll. Diskrete Geom. Salzburg"
, volume =	3
, year =	1985
, pages =	"277--282"
, update =	"97.11 bibrelex"
}

@incollection{w-gsdps-96
, author =	"R. Weibel"
, title =	"Generalization of spatial data: {Principles} and Selected Algorithms"
, booktitle =	"Lecture notes from CISM Advanced School on Algorithmic Foundations of Geographic Information Systems"
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"99--152"
, update =	"98.03 agarwal"
}

@phdthesis{w-smaa-78
, author =	"B. Weide"
, title =	"Statistical methods for the analysis of algorithms"
, school =	"School Comput. Sci., Carnegie Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1978
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@techreport{w-smada-78
, author =	"B. W. Weide"
, title =	"Statistical methods in algorithm design and analysis"
, type =	"Report"
, number =	"CMU-CS-78-142"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1978
}

@inproceedings{w-vfiur-79
, author =	"B. W. Weide"
, title =	"Very fast information update and retrieval using cells"
, booktitle =	"Proc. 17th Allerton Conf. Commun. Control Comput."
, year =	1979
, pages =	"245--254"
}

@article{w-blsf-87
, author =	"J. Weight"
, title =	"Binary logic by spatial filtering"
, journal =	"Optical Engineering"
, volume =	26
, number =	1
, year =	1987
, pages =	"28--33"
, update =	"97.11 bibrelex"
}

@inproceedings{wb-cvcm-96
, author =	"C. Weigle and D. Banks"
, title =	"Complex-valued contour meshing"
, booktitle =	"Proceedings of Visualization `96"
, publisher =	"IEEE Computer Society Press"
, year =	1996
, update =	"01.07 wenger"
}

@inproceedings{w-ra-97
, author =	"Karsten Weihe"
, title =	"Reuse of algorithms: Still a challenge to object-oriented programming"
, booktitle =	"Proc. OOPSLA '97"
, year =	1997
, pages =	"34--48"
, update =	"98.11 tamassia"
}

@article{ww-rtcmd-00
, author =	"K. Weihe and T. Willhalm"
, title =	"Reconstructing the Topology of a CAD Model - a Discrete Approach"
, journal =	"Algorithmica"
, volume =	26
, number =	1
, year =	2000
, pages =	"126--147"
, update =	"00.03 held"
}

@book{w-c-87
, author =	"K. Weihrauch"
, title =	"Computability"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Heidelberg"
, year =	1987
, update =	"98.11 bibrelex"
}

@incollection{wk-uacra-84
, author =	"K. Weihrauch and Ch. Kreitz"
, title =	"A unified approach to constructive and recursive analysis"
, editor =	"M. M. Richter and others"
, booktitle =	"Computation and proof theory"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Heidelberg"
, year =	1984
, update =	"98.11 bibrelex"
}

@article{w-sltdd-52
, author =	"A. Weil"
, title =	"Sur les th{\'e}or{\`e}mes de de {Rham}"
, journal =	"Comment. Math. Helvetici"
, volume =	26
, year =	1952
, pages =	"119--145"
, update =	"98.03 bibrelex"
}

@incollection{w-iappt-94
, author =	"Kevin Weiler"
, title =	"An Incremental Angle Point in Polygon Test"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"16--23"
, keywords =	"computational geometry, inclusion testing"
, update =	"94.09 heckbert"
, annote =	"Provides an algorithm for testing if a point is inside a
concave polygon, a task known as point inclusion testing in computational
geometry. Point-in-polygon testing is a basic task when ray tracing
polygonal models, so these methods are useful for 3D as well as 2D graphics.
Contains C code."
}

@article{w-ebdss-85
, author =	"K. Weiler"
, title =	"Edge-Based Data Structures for Solid Modeling in a Curved Surface Environment"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	5
, number =	1
, year =	1985
, pages =	"21--40"
, update =	"98.03 agarwal+bibrelex"
}

@techreport{w-nmgm-85
, author =	"K. Weiler"
, title =	"Non-manifold geometric modeling"
, type =	"Report"
, number =	"??"
, institution =	"General Electric Corporate Res. and Develop."
, address =	"Schenectady, NY"
, year =	1985
}

@article{w-pcugr-80
, author =	"K. Weiler"
, title =	"Polygon comparison using a graph representation"
, journal =	"Comput. Graph."
, volume =	14
, number =	3
, year =	1980
, pages =	"10--18"
, note =	"Proc. SIGGRAPH '80"
}

@inproceedings{w-redst-86
, author =	"K. Weiler"
, title =	"The radial-edge data structure: {A} topological representation for non-manifold geometric boundary modeling"
, booktitle =	"Proc. IFIP WG 5.2 Working Conference"
, site =	"Rensselaerville"
, year =	1986
, update =	"98.07 bibrelex"
}

@incollection{w-restr-88
, author =	"K. Weiler"
, title =	"The radial edge structure: a topological representation for non-manifold geometric boundary modeling"
, editor =	"M. J. Wozny and H. W. McLaughlin and J. L. Encarnacao"
, booktitle =	"Geometric Modeling for CAD Applications"
, publisher =	"North-Holland"
, year =	1988
, pages =	"217--254"
, update =	"98.07 bibrelex"
}

@phdthesis{w-tsgm-86
, author =	"K. Weiler"
, title =	"Topological Structures for Geometric Modeling"
, school =	"Rensselaer Polytechnic Institute"
, address =	"Troy, NY"
, month =	aug
, year =	1986
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@inproceedings{w-tfsm-84
, author =	"K. Weiler"
, title =	"Topology as a Framework for Solid Modeling"
, booktitle =	"Proc. Graphics Interface '84"
, year =	1984
, pages =	"53--56"
, update =	"98.11 ghali"
}

@article{wa-hsrup-77
, author =	"K. Weiler and P. Atherton"
, title =	"Hidden surface removal using polygon area sorting"
, journal =	"Comput. Graph."
, volume =	11
, number =	2
, year =	1977
, pages =	"214--222"
, note =	"Proc. SIGGRAPH '77"
}

@article{w-moagp-66
, author =	"L. Weinberg"
, title =	"On the Maximum Order of the Automorphism Group of a Planar Triply Connected Graph"
, journal =	"SIAM J."
, volume =	14
, year =	1966
, pages =	"729--738"
, update =	"97.11 bibrelex"
}

@inproceedings{wwt-slvtd-96
, author =	"D. Weinshall and M. Werman and N. Tishby"
, title =	"Stability and Likelihood of Views of Three Dimensional Objects"
, booktitle =	"Computing Supplement"
, volume =	11
, year =	1996
, pages =	"237--256"
, update =	"96.01 werman"
}

@inproceedings{w-naqer-93
, author =	"Volker Weispfennig"
, title =	"A New Approach to Quantifier Elimination for Real Algebra and Geometry"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	"31--35"
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
}

@inproceedings{w-plqoe-95
, author =	"Volker Weispfennig"
, title =	"Parametric Linear and Quadratic Optimization by Elimination"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	41
, update =	"00.03 bibrelex"
}

@article{w-iptc-89
, author =	"A. I. Weiss"
, title =	"Incidence-polytopes with toroidal cells"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"55--73"
}

@inproceedings{wgs-cudg-93
, author =	"Gerhard Weiss and Albert Gr{\"a}f and Martin Stumpf"
, title =	"On Coloring Unit Disk Graphs"
, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
, month =	jun
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{w-panns-80
, author =	"S. F. Weiss"
, title =	"A probabilistic algorithm for nearest neighbour searching"
, booktitle =	"Proc. ACM-BCS Sympos. Res. Develop. Inform. Retrieval"
, year =	1980
, pages =	"??"
}

@book{w-cem-99
, author =	"E. W. Weisstein"
, title =	"CRC Concise Encylopedia of Mathematics"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1999
, update =	"02.03 icking, 01.07 orourke"
}

@inproceedings{ww-agmdu-95
, author =	"L. Weitzman and K. Wittenburg"
, title =	"Automatic Generation of Multimedia Documents using Relational Grammars"
, booktitle =	"Proc. ACM MultiMedia '94"
, year =	1995
, pages =	"254--261"
, keywords =	"graph drawing, planar, visual language"
, update =	"96.09 tamassia, 96.04 garg"
}

@techreport{w-bires-71
, author =	"T. Welch"
, title =	"Bounds on the information retrieval efficiency of static file structures"
, type =	"Technical {Report}"
, number =	88
, institution =	"Massachsetts Inst. Tech."
, address =	"Cambridge, MA"
, month =	jun
, year =	1971
, update =	"98.03 bibrelex"
}

@inproceedings{w-s5nps-97
, author =	"Frank Weller"
, title =	"Stability of {V}oronoi Neighborship under Perturbations of the Sites"
, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
, year =	1997
, pages =	"251--256"
, update =	"97.11 jones"
}

@inproceedings{wk-cchsp-96
, author =	"Frank Weller and Carsten Kirstein"
, title =	"Computing the Convex Hull of a Simple Polygon on the Sphere"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	"5--6"
, cites =	"l-fchsp-83, g-eadch-72, ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@book{w-pdcig-91
, author =	"David Wells"
, title =	"The Penguin Directory of Curious and Interesting Geometry"
, publisher =	"Penguin"
, address =	"London"
, year =	1991
, update =	"98.11 bibrelex"
}

@book{w-mt-76
, author =	"D. J. A. Welsh"
, title =	"Matroid Theory"
, publisher =	"Academic Press"
, address =	"London, UK"
, year =	1976
, update =	"98.03 bibrelex"
}

@techreport{w-csedb-91
, author =	"Emo Welzl"
, title =	"Constructing smallest enclosing disks (balls and ellipsoids)"
, type =	"Technical {Report}"
, institution =	"Freie Universit{\"a}t Berlin"
, year =	1991
, note =	"To appear"
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@techreport{w-cvgnl-84
, author =	"Emo Welzl"
, title =	"Constructing the visibility graph for $n$ line segments in {$O(n^{2})$} time"
, type =	"Technical {Report}"
, institution =	"Inst. Appl. Math. Comput. Sci., Univ. Leiden"
, address =	"Leiden, Netherlands"
, year =	1984
, update =	"98.03 mitchell, 97.11 bibrelex"
}

@article{w-cvgnl-85
, author =	"Emo Welzl"
, title =	"Constructing the visibility graph for $n$ line segments in {$O(n^{2})$} time"
, journal =	"Inform. Process. Lett."
, volume =	20
, year =	1985
, pages =	"167--171"
, keywords =	"motion planning, construction, detection, visibility, plane-sweep, line segments"
, update =	"98.03 mitchell"
}

@article{w-eljf-01
, author =	"E. Welzl"
, title =	"Entering and leaving $j$-facets"
, journal =	"Discrete Comput. Geom."
, volume =	25
, number =	3
, year =	2001
, pages =	"351--364"
, update =	"01.11 pocchiola"
}

@incollection{w-ggssn-93
, author =	"Emo Welzl"
, title =	"Geometric Graphs with Small Stabbing Numbers: {Combinatorics} and Applications"
, booktitle =	"Proc. 9th Internat. Conf. Fund. Comput. Theory"
, site =	"Szeged, Hungary"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"??"
, update =	"99.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
}

@article{w-mksfs-86
, author =	"Emo Welzl"
, title =	"More on $k$-sets of finite sets in the plane"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"95--100"
, keywords =	"combinatorial geometry"
, update =	"98.03 mitchell"
}

@techreport{w-stlcn-92t
, author =	"E. Welzl"
, title =	"On spanning trees with low crossing numbers"
, type =	"Technical {Report}"
, number =	"B92-02"
, institution =	"Free University Berlin"
, address =	"Berlin, Germany"
, year =	1992
, update =	"98.07 agarwal, 98.03 bibrelex"
}

@incollection{w-stlcn-92
, author =	"Emo Welzl"
, title =	"On spanning trees with low crossing numbers"
, booktitle =	"Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative"
, series =	"Lecture Notes Comput. Sci."
, volume =	594
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"233--249"
, update =	"98.03 mitchell, 97.03 aronov, 96.05 agarwal, 94.05 matousek"
}

@inproceedings{w-pttco-88
, author =	"Emo Welzl"
, title =	"Partition trees for triangle counting and other range searching problems"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"23--33"
, cites =	"ahw-pgers-87, a-ded-83, c-prsig-87, d-cltem-78, d-brdnc-79, e-acg-87, ew-hrsls-86, hw-ensrq-87, m-mdscg-84, ps-cgi-85, s-dfs-72, vc-ucrfe-71, ww-sfrs-87, w-pr-82, ZZZ"
, update =	"98.03 bibrelex+mitchell"
}

@incollection{w-sedbe-91a
, author =	"Emo Welzl"
, title =	"Smallest enclosing disks (balls and ellipsoids)"
, editor =	"H. Maurer"
, booktitle =	"New Results and New Trends in Computer Science"
, series =	"Lecture Notes Comput. Sci."
, volume =	555
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"359--370"
, succeeds =	"w-sedbe-91"
, update =	"98.03 mitchell, 94.01 rote, 93.09 matousek"
}

@techreport{w-sedbe-91
, author =	"Emo Welzl"
, title =	"Smallest enclosing disks, balls and ellipsoids"
, type =	"Report"
, number =	"B 91-09"
, institution =	"Fachbereich Mathematik, Freie Universit{\"at} Berlin"
, address =	"Berlin, Germany"
, year =	1991
, update =	"98.03 mitchell"
}

@inproceedings{w-usoc-01
, author =	"Emo Welzl"
, title =	"Unique Sink Orientations of Cubes"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	11
, update =	"01.04 icking"
}

@techreport{ww-sfrs-87
, author =	"E. Welzl and G. W{\"o}ginger"
, title =	"On shatter functions of range spaces"
, type =	"Manuscript"
, institution =	"??"
, year =	1987
, update =	"98.03 bibrelex"
}

@incollection{ww-srbsp-93
, author =	"Emo Welzl and Barbara Wolfers"
, title =	"Surface Reconstruction Between Simple Polygons via Angle Criteria"
, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	726
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"397--408"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@article{ww-srbsp-94
, author =	"Emo Welzl and B. Wolfers"
, title =	"Surface Reconstruction Between Simple Polygons via Angle Criteria"
, journal =	"J. Symbolic Comput."
, volume =	17
, year =	1994
, pages =	"351--369"
, update =	"98.03 mitchell, 97.03 gaertner+salinger+wolfers"
}

@unpublished{w-tdbvo-92
, author =	"James Wen"
, title =	"A three dimensional browser for visualizing orthogonal hierarchies"
, year =	1992
, note =	"Brown {University}"
, update =	"97.03 tamassia"
}

@article{w-ghtti-90
, author =	"R. Wenger"
, title =	"A generalization of {Hadwiger}'s transversal theorem to intersecting sets"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"383--388"
}

@article{w-egncf-91
, author =	"Rephael Wenger"
, title =	"Extremal Graphs with No {$C^4$'s}, {$C^6$'s} or {$C^{10}$'s}"
, journal =	"J. Combin. Theory Ser. A"
, volume =	52
, year =	1991
, pages =	"113--116"
, update =	"95.09 wenger"
}

@techreport{w-gpcc-90
, author =	"R. Wenger"
, title =	"Geometric Permutations and Connected Components"
, type =	"Technical {Report}"
, number =	"90-50"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"93.09 milone+mitchell"
}

@incollection{w-httgt-97
, author =	"R. Wenger"
, title =	"Helly-type theorems and geometric transversals"
, chapter =	4
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"63--82"
, update =	"97.11 orourke"
}

@article{w-rqh-97
, author =	"Rephael Wenger"
, title =	"Randomized Quickhull"
, journal =	"Algorithmica"
, volume =	17
, year =	1997
, pages =	"322--329"
, update =	"01.07 wenger"
}

@article{w-ubgpc-90
, author =	"R. Wenger"
, title =	"Upper bounds on geometric permutations for convex sets"
, journal =	"Discrete Comput. Geom."
, volume =	5
, year =	1990
, pages =	"27--33"
}

@techreport{w-ublo-86
, author =	"R. Wenger"
, title =	"Upper bounds on linear orderings"
, type =	"Technical {Report}"
, number =	"SOCS 86.19"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, month =	oct
, year =	1986
, update =	"98.03 bibrelex"
}

@article{wd-ssvcc-81
, author =	"R. S. Wenocur and R. M. Dudley"
, title =	"Some special Vapnik-Chervonenkis classes"
, journal =	"Discrete Math."
, volume =	"??"
, year =	1981
, pages =	"313--318"
, update =	"97.11 bibrelex"
}

@inproceedings{ws-mpvcr-94
, author =	"C. Wentink and O. Schwarzkopf"
, title =	"Motion Planning for Vacuum Cleaner Robots"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"51--56"
, cites =	"ab-pptr-88, abf-pempa-88, ks-empac-90, l-rmp-91, oww-fabmo-85, ss-pmp1c-83, w-mpvcr-93, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@techreport{wso-afd-96
, author =	"C. Wentink and A. F. van der Stappen and M. Overmars"
, title =	"Algorithms for fixture design"
, type =	"Report"
, number =	"UU-CS-1996-38"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1996
, update =	"97.11 oostrum"
}

@mastersthesis{w-mpvcr-93
, author =	"C. J. Wentink"
, title =	"Motion planning for vacuum cleaners and related problems"
, school =	"Utrecht University"
, month =	aug
, year =	1993
, keywords =	"master thesis"
, update =	"98.11 bibrelex"
}

@mastersthesis{w-vfgi-94
, author =	"M. Wenzel"
, title =	"Verschneidungsoperationen f{\"u}r {Geo}-{Informationssysteme}"
, school =	"University of M{\"u}nster"
, address =	"M{\"u}nster, Germany"
, year =	1994
, keywords =	"master thesis"
, update =	"98.03 bibrelex"
}

@article{wbg-vpocp-89
, author =	"M. Werman and E. S. Baugher and A. Gualtieri"
, title =	"The Visual Potential: One Convex Polygon"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	"??"
, year =	1989
, pages =	"96--130"
, update =	"96.01 werman"
}

@article{wpmk-bgmpl-86
, author =	"M. Werman and S. Peleg and R. Melter and T. Y. Kong"
, title =	"Bipartite graph matching for points on a line or a circle"
, journal =	"J. Algorithms"
, volume =	7
, year =	1986
, pages =	"277--284"
}

@article{wpr-dmmh-85
, author =	"M. Werman and S. Peleg and A. Rosenfeld"
, title =	"A Distance Metric for Multidimensional Histograms"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	32
, year =	1985
, pages =	"328--336"
, update =	"96.01 werman"
}

@inproceedings{ms-eas3d-95
, author =	"M. Werman and A. Shashua"
, title =	"Elimination: An Approach to the Study of 3D-from-2D"
, booktitle =	"Proc. International Conference on Computer Vision"
, year =	1995
, update =	"96.01 werman"
}

@article{ww-saidb-95
, author =	"M. Werman and D. Weinshall"
, title =	"Similarity and Affine Invariant Distance Between Point Sets"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	17
, year =	1995
, pages =	"810--814"
, update =	"96.01 werman"
}

@article{w-cchsp-86
, author =	"G. Werner"
, title =	"The Computation of the Convex Hull of a Simple Polygon in Linear Time"
, journal =	"Computers and Artificial Intelligence"
, volume =	5
, number =	5
, year =	1986
, pages =	"451--458"
, update =	"93.09 held"
}

@techreport{wk-rpsav-84
, author =	"M. Wesley and G. Koppelman"
, title =	"A robot planning system applied to {VLSI} manufacturing processes"
, type =	"Report"
, number =	"RC 10510 (\#45389)"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1984
}

@techreport{wm-fop-81
, author =	"M. A. Wesley and G. Markowsky"
, title =	"Fleshing out projections"
, type =	"Report"
, number =	"RC 8884"
, institution =	"Dept. Comput. Sci., IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1981
}

@techreport{wm-gsmtt-84
, author =	"M. A. Wesley and G. Markowsky"
, title =	"Generation of solid models from two and three dimensional data"
, type =	"Report"
, number =	"RC 10328 (\#46080)"
, institution =	"IBM T. J. Watson Res. Center"
, address =	"Yorktown Heights, NY"
, year =	1984
}

@article{w-wphp-93
, author =	"G. Wesolowsky"
, title =	"The {Weber} problem: {History} and perspective"
, journal =	"Location Science"
, volume =	1
, year =	1993
, pages =	"5--23"
, keywords =	"facility location, Weber problem"
, update =	"96.05 agarwal"
}

@book{w-igt-95
, author =	"D. West"
, title =	"An Introduction to Graph Theory"
, publisher =	"Prentice Hall"
, year =	1995
, update =	"97.11 bibrelex"
}

@inproceedings{w-fipt-92
, author =	"J. Westbrook"
, title =	"Fast Incremental Planarity Testing"
, booktitle =	"Automata, Languages and Programming (Proc. 19th ICALP)"
, series =	"Lecture Notes Comput. Sci."
, volume =	623
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"342--353"
, update =	"96.05 agarwal, 95.05 tamassia, 94.01 tamassia"
}

@article{wt-mbcbc-92
, author =	"J. Westbrook and R. E. Tarjan"
, title =	"Maintaining Bridge-Connected and Biconnected Components On-Line"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"433--464"
, update =	"94.01 tamassia"
}

@article{ws-tdt-79
, author =	"C. Wetherell and A. Shannon"
, title =	"Tidy Drawing of Trees"
, journal =	"IEEE Trans. Softw. Eng."
, volume =	"SE-5"
, number =	5
, year =	1979
, pages =	"514--520"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@article{w-dpl-78
, author =	"J. E. Wetzel"
, title =	"On the division of the plane by lines"
, journal =	"Amer. Math. Monthly"
, volume =	85
, year =	1978
, pages =	"648--656"
, update =	"98.07 agarwal"
}

@incollection{w-etcp-50
, author =	"H. Weyl"
, title =	"Elementary Theory of Convex Polyhedra"
, editor =	"W. Kuhn and A. W. Tucker"
, booktitle =	"Contributions to the Theory of Games"
, series =	"Annals of Mathematical Studies"
, volume =	24
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1950
, pages =	"3--18"
, update =	"97.11 bibrelex"
}

@article{w-rhmfa-24
, author =	"H. Weyl"
, title =	"Randbemerkungen zu {H}auptproblemen der {M}athematik, {II}, {F}undamentalsatz der {A}legbra und {G}rundlagen der {M}athematik"
, journal =	"Math. Z."
, volume =	20
, year =	1924
, pages =	"131--151"
, update =	"97.07 agarwal"
}

@book{w-s-51
, author =	"H. Weyl"
, title =	"Symmetry"
, publisher =	"Princeton"
, year =	1951
, update =	"97.11 bibrelex"
}

@article{wsckcps-oaoer-96
, author =	"K. Y. Whang and J. W. Song and J. W. Chang and J. Y. Kim and W. S. Cho and C. M. Park and I. Y. Song"
, title =	"Octree-{R}: {An} Adaptible octree for efficient ray tracing"
, journal =	"IEEE Trans. Visual. and Comp. Graphics"
, volume =	1
, year =	1995
, pages =	"343--349"
, keywords =	"octree, ray tracing"
, update =	"97.07 agarwal, 96.05 agarwal"
}

@book{w-imm-84
, author =	"A. Whelan"
, title =	"Injection moulding machines"
, publisher =	"Elsevier"
, address =	"London, UK"
, year =	1984
, update =	"98.03 bibrelex"
}

@article{w-rit-86
, author =	"T. Whelan"
, title =	"A representation of a {$C^2$} interpolant over triangles"
, journal =	"Comput. Aided Geom. Design"
, volume =	3
, year =	1986
, pages =	"53--66"
, update =	"98.07 bibrelex"
}

@incollection{wb-tgt-78
, author =	"A. T. White and L. W. Beineke"
, title =	"Topological graph theory"
, editor =	"L. Beineke and R. Wilson"
, booktitle =	"Selected Topics in Graph Theory"
, publisher =	"Academic Press"
, address =	"London, UK"
, year =	1978
, pages =	"15--49"
, update =	"98.03 bibrelex"
}

@article{w-dpo-78
, author =	"D. White"
, title =	"A design for polygon overlay"
, journal =	"Harvard Papers on Geographic Inform. Sys."
, volume =	6
, year =	1978
, update =	"98.11 bibrelex"
}

@inproceedings{w-nmpo-77
, author =	"D. White"
, title =	"A New Method of Polygon Overlay"
, booktitle =	"An Advanced Study Symposium on Topological Data Structures for Geographic Information Systems"
, site =	"Cambridge, MA"
, organization =	"Laboratory for Computer Graphics and Spatial Analysis, Harvard Univ."
, month =	oct
, year =	1977
, update =	"98.03 bibrelex"
}

@inproceedings{wmbs-ahmgv-95
, author =	"David White and Lai Mingwu and Steven E. Benzley and Gregory D. Sjaardema"
, title =	"Automated Hexahedral Mesh Generation by Virtual Decomposition"
, booktitle =	"Proc. 4th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"Albuquerque, NM"
, year =	1995
, pages =	"165--177"
, update =	"96.01 samitchell"
}

@inproceedings{wj-siwst-96
, author =	"D. A. White and R. Jain"
, title =	"Similarity indexing with the {SS}-tree"
, booktitle =	"Proc. 12th IEEE Internat. Conf. Data Eng."
, year =	1996
, pages =	"516--523"
, update =	"97.07 agarwal"
}

@techreport{wj-assr-96
, author =	"D. A. White and S. Zdonik"
, title =	"Algorithms and strategies for similarity retrieval"
, type =	"Technical {Report}"
, number =	"VCL-96-1101"
, institution =	"Univ. California Davis"
, address =	"Davis, CA"
, year =	1996
, update =	"98.07 bibrelex"
}

@article{w-algau-85
, author =	"E. R. White"
, title =	"Assessment of line-generalization algorithms using characteristic points"
, journal =	"Amer. Cartogr."
, volume =	12
, number =	1
, year =	1985
, pages =	"17--27"
, update =	"98.03 bibrelex"
}

@techreport{w-ntloi-82
, author =	"M. White"
, title =	"{N}-trees: {L}arge ordered indexes for multidimensional space"
, type =	"Tech.\ Report"
, institution =	"US Bureau of the Census, Statistical Research Division"
, address =	"Washington, DC"
, year =	1982
, update =	"97.07 agarwal"
}

@inproceedings{w-tachm-83
, author =	"M. S. White"
, title =	"Tribulations of Automated Carthography and How Mathematics Helps"
, booktitle =	"Proc. 6th International Symposium on Automated Carthography"
, site =	"Ottawa"
, year =	1983
, pages =	"408--418"
, update =	"98.03 bibrelex"
}

@article{wg-plrsm-85
, author =	"M. S. White and P. Griffin"
, title =	"Piecewise Linear Rubber-Sheet Map Transformation"
, journal =	"Amer. Cartogr."
, volume =	12
, number =	2
, year =	1985
, pages =	"123--131"
, update =	"98.03 bibrelex"
}

@unpublished{w-cgpsl-87
, author =	"N. White"
, title =	"Comments on {Goodman}'s problem on skew lines"
, year =	1987
, note =	"Unpublished Note"
, update =	"98.03 bibrelex"
}

@article{ww-agmf-84
, author =	"N. White and W. Whiteley"
, title =	"the algebraic geometry of motions of frameworks"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	"??"
, year =	1984
, note =	"to appear (preprint 1984)"
, update =	"97.11 bibrelex"
}

@article{w-nmwvi-89
, author =	"N. L. White"
, title =	"A nonuniform matroid which violates the isotopy conjecture"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"1--2"
}

@incollection{w-gagca-97
, author =	"N. L. White"
, title =	"Geometric applications of the {Grassmann-Cayley} algebra"
, chapter =	48
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"881--892"
, update =	"97.11 orourke"
}

@article{w-ms-
, author =	"W. Whiteley"
, title =	"A matrix for splines"
, journal =	"J. Approx. Theory"
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@article{w-mhasa-89
, author =	"W. Whiteley"
, title =	"A matroid on hypergraphs, with applications in scene analysis and geometry"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"75--95"
, succeeds =	"w-tapp-86"
, update =	"93.09 milone+mitchell"
}

@inproceedings{w-gbs-90
, author =	"W. Whiteley"
, title =	"Geometry of bivariate splines"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"351--353"
, cites =	"a-csmpp-87, b-htssg-88, c-mss-88, s-mild-86, w-tapp-86, w-ms-, w-mrs-, w-mhasa-89, w-cbs-90, w-gbcs-90, ZZZ"
, update =	"98.07 bibrelex"
}

@incollection{w-mrs-
, author =	"W. Whiteley"
, title =	"Matroids and rigid structures"
, editor =	"N. White"
, booktitle =	"Applications of Matroid Theory"
, publisher =	"Cambridge University Press"
, year =	"??"
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@article{w-rp-79
, author =	"W. Whiteley"
, title =	"Realizability of Polyhedra"
, journal =	"Structural Topology"
, volume =	1
, year =	1979
, pages =	"46--58"
, update =	"97.11 bibrelex"
}

@incollection{w-rsa-97
, author =	"W. Whiteley"
, title =	"Rigidity and scene analysis"
, chapter =	49
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"893--916"
, update =	"97.11 orourke"
}

@techreport{w-cbs-90
, author =	"W. Whiteley"
, title =	"The combinatorics of bivariate splines"
, type =	"Preprint"
, institution =	"Champlain Regional College"
, address =	"St. Lambert, Quebec"
, month =	jan
, year =	1990
, update =	"98.07 bibrelex"
}

@techreport{w-gbcs-90
, author =	"W. Whiteley"
, title =	"The geometry of bivariate {${C^{1}}_{2}$}-splines"
, type =	"Preprint"
, institution =	"Champlain Regional College"
, address =	"St. Lambert, Quebec"
, year =	1990
, update =	"98.07 bibrelex"
}

@incollection{w-pgrf-85
, author =	"W. Whiteley"
, title =	"The projective geometry of rigid frameworks"
, editor =	"C. A. Baker and L. M. Batten"
, booktitle =	"Finite Geometries"
, series =	"Lecture Notes in Pure and Applied Mathematics"
, volume =	103
, publisher =	"Marcel Dekker"
, address =	"New York, NY"
, year =	1985
, pages =	"353--375"
}

@inproceedings{w-tapp-86
, author =	"W. Whiteley"
, title =	"Two algorithms for polyhedral pictures"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"142--149"
, precedes =	"w-mhasa-89, cw-pspp-86"
, cites =	"ab-gdt-86, ab-rdt-85, abcw-cpdts-88, cw-pspp-86, c-gs-90, es-vda-86, h-ions-71, h-dcaps-77, i-csldp-85, k-tow-80, m-ipps-73, m-orfdf-64, s-acaal-84, s-mild-86, w-mhasa-89, ww-agmf-84, w-mspp-82, ZZZ"
, update =	"97.11 bibrelex, 93.09 ne+mitchell"
}

@article{w-aigpl-92
, author =	"S. Whitesides"
, title =	"Algorithmic issues in the geometry of planar linkage movement"
, journal =	"Australian Comput. J."
, volume =	"??"
, month =	may
, year =	1992
, pages =	"42--50"
, note =	"Special Issue on Algorithms"
, update =	"98.11 bibrelex"
}

@techreport{we-mbsbg-90
, author =	"S. Whitesides and P. Eades"
, title =	"Maximal Biplanar Subgraphs of Bipartite Graphs"
, type =	"Technical {Report}"
, number =	"SOCS 90.24"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@techreport{wz-kacjc-90
, author =	"S. Whitesides and R. Zhao"
, title =	"$K$-Admissible Collections of {Jordan} Curves and Offsets of Circular Arc Figures"
, type =	"Technical {Report}"
, number =	"SOCS 90.08"
, institution =	"McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{wz-pet-89
, author =	"S. Whitesides and R. Zhao"
, title =	"On the placement of {Euclidean} trees"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	28
}

@inproceedings{wz-ocaf-90
, author =	"S. Whitesides and R. Y. Zhao"
, title =	"Offsets of circular arc figures"
, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
, year =	1990
, pages =	"362--365"
, cites =	"bo-arcgi-79, eghppsss-ajati-89, f-eopss-85, klps-ujrcf-86, oww-fabmo-85, rr-oosm-86, sh-gip-76, spd-ogm-88, s-cgcw-86, z-pet-90, ZZZ"
, update =	"98.07 bibrelex"
}

@incollection{w-cgmp-85
, author =	"S. H. Whitesides"
, title =	"Computational geometry and motion planning"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"377--427"
}

% ### verify, published in 1998 ??
@proceedings{w-gd-98
, title =	"Graph Drawing (Proc. GD '98)"
, editor =	"Sue H. Whitesides"
, series =	"Lecture Notes Comput. Sci."
, volume =	1547
, publisher =	"Springer-Verlag"
, year =	1998
, keywords =	"graph drawing, collection"
, update =	"99.07 vismara, 99.03 patrignani+vismari"
}

@inproceedings{w-pgr-95
, author =	"S. H. Whitesides"
, title =	"Poster Gallery Report"
, editor =	"R. Tamassia and I. G. Tollis"
, booktitle =	"Graph Drawing (Proc. GD '94)"
, series =	"Lecture Notes Comput. Sci."
, volume =	894
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"461--469"
, keywords =	"graph drawing, poster, system"
, update =	"95.01 tamassia"
}

@article{w-ffcmf-77
, author =	"D. Whitney"
, title =	"Force feedback control of manipulator fine motions"
, journal =	"Journal of Dynamic Systems, Measurment and Control"
, volume =	"??"
, month =	jun
, year =	1977
, pages =	"91--97"
, update =	"98.03 bibrelex"
}

@article{w-tg-31
, author =	"H. Whitney"
, title =	"A heorem on graphs"
, journal =	"Annu. Math."
, volume =	32
, year =	1931
, pages =	"378--390"
, update =	"98.11 bibrelex"
}

@article{w-aedfd-34
, author =	"H. Whitney"
, title =	"Analytic extensions of differentiable functions defined in closed sets"
, journal =	"Trans. Amer. Math. Soc."
, volume =	36
, year =	1934
, pages =	"63--89"
, update =	"98.07 bibrelex"
}

@article{w-esrav-57
, author =	"H. Whitney"
, title =	"Elementary structure of real algebraic varieties"
, journal =	"Ann. Math."
, volume =	66
, number =	3
, year =	1975
, update =	"98.03 bibrelex"
}

@article{w-rccp-37
, author =	"H. Whitney"
, title =	"On regular closed curves in the plane"
, journal =	"Compos. Math."
, volume =	4
, year =	1937
, pages =	"276--284"
, update =	"98.03 bibrelex"
}

@article{w-mspp-82
, author =	"W. Whitney"
, title =	"Motions and Stresses of Projected Polyhedra"
, journal =	"Structural Topology"
, volume =	7
, year =	1982
, pages =	"13--38"
, keywords =	"graph drawing, convex, straight-line"
, update =	"96.09 tamassia"
}

@article{w-mcp-66
, author =	"J. V. Whittaker"
, title =	"A mountain-climbing problem"
, journal =	"Canad. J. Math."
, volume =	18
, year =	1966
, pages =	"873--882"
}

@article{w-iimsd-80
, author =	"T. Whitted"
, title =	"An Improved Illumination Model for Shaded Display"
, journal =	"Commun. ACM"
, volume =	23
, number =	6
, month =	jun
, year =	1980
, pages =	"343--349"
, update =	"97.11 bibrelex"
}

@book{w-at-42
, author =	"G. T. Whyburn"
, title =	"Analytic Topology"
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1942
, update =	"97.11 bibrelex"
}

@techreport{w-etfes-86
, author =	"A. B. Widlund"
, title =	"An extension theorem for finite element spaces with three applications"
, type =	"Report"
, number =	233
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, year =	1986
}

@techreport{w-imepr-84
, author =	"A. B. Widlund"
, title =	"Iterative methods for elliptic problems on regions partitioned into substructures and the biharmonic {Dirichlet} problem"
, type =	"Report"
, number =	101
, institution =	"Dept. Comput. Sci., New York Univ."
, address =	"New York, NY"
, year =	1984
}

@phdthesis{w-cccgv-83
, author =	"P. Widmayer"
, title =	"Computational complexity in computer graphics and {VLSI} design"
, type =	"Ph.{D}. Thesis"
, school =	"Univ. Fridericiana Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1983
, keywords =	"doctoral thesis"
}

@inproceedings{w-gdsfs-92
, author =	"Peter Widmayer"
, title =	"Guard Data Structures for Fat Spatial Objects"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	89
, update =	"00.03 bibrelex"
}

@techreport{w-ndiv-89
, author =	"P. Widmayer"
, title =	"Network Design Issues in {VLSI}"
, institution =	"Institut {f\"ur} Informatik, University Freiburg"
, address =	"{Rheinstrasse} 10-12, 7800, Freiburg, West Germany"
, year =	1989
}

@techreport{ww-tsoab-86
, author =	"P. Widmayer and D. Wood"
, title =	"A time and space optimal algorithm for boolean mask operations for orthogonal polygons"
, type =	"Report"
, number =	161
, institution =	"Universit{\"a}t Karlsruhe"
, address =	"Karlsruhe, West Germany"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{ww-tsoab-88
, author =	"P. Widmayer and D. Wood"
, title =	"A time- and space-optimal algorithm for {Boolean} masking operations"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	41
, year =	1988
, pages =	"14--27"
}

@article{ww-tsocc-87
, author =	"P. Widmayer and D. Wood"
, title =	"Time- and space-optimal contour computation for a set of rectangles"
, journal =	"Inform. Process. Lett."
, volume =	24
, year =	1987
, pages =	"335--338"
, keywords =	"complexity theory, design of algorithms, combinatorial geometry"
}

@article{wwsw-suipp-86
, author =	"P. Widmayer and Y. F. Wu and M. D. F. Schlag and C. K. Wong"
, title =	"On some union and intersection problems for polygons with fixed orientation"
, journal =	"Computing"
, volume =	36
, year =	1986
, pages =	"183--197"
, update =	"98.07 bibrelex"
}

@inproceedings{www-dpcgf-85
, author =	"P. Widmayer and Y. F. Wu and C. K. Wong"
, title =	"Distance problems in computational geometry with fixed orientations"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"186--195"
, precedes =	"www-sdpfo-87"
, cites =	"bt-eacmd-83, ct-fmst-76, cw-oaimd-83, cw-mvdbs-84, e-ipcg-82, e-cedbt-82, gbt-srtgp-84, g-cceac-83, ht-fafnc-84, h-oarms-79, k-osps-83, l-tdvdl-80, lp-cgs-84, lw-vdllm-80, mt-fmvdb-83, nllw-xchsx-83, osw-dcrch-83, s-fmdbt-81, sh-cpp-75, t-oacmv-84a, tb-oacmd-83, tm-soafm-82, v-ulds-80, ZZZ"
, update =	"97.11 bibrelex, 93.05 jones"
}

@article{www-sdpfo-87
, author =	"P. Widmayer and Y. F. Wu and C. K. Wong"
, title =	"On some distance problems in fixed orientations"
, journal =	"SIAM J. Comput."
, volume =	16
, year =	1987
, pages =	"728--746"
, succeeds =	"www-dpcgf-85"
, annote =	"VD for metric where paths are limited to a fixed
		 number of orientations"
}

@inproceedings{wgpb-cadpf-96
, author =	"J. Wiegley and K. Goldberg and M. Peshkin and M. Brokowski"
, title =	"A complete algorithm for designing passive fences to orient parts"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, site =	"Minneapolis, MN"
, year =	1996
, pages =	"1133--1139"
, update =	"98.07 bibrelex"
}

@inproceedings{wrg-csdsp-92
, author =	"J. Wiegley and A. Rao and K. Goldberg"
, title =	"Computing a statistical distribution of stable poses for a polyhedron"
, booktitle =	"Proc. 30th Allerton Conf. Commun. Control Comput."
, site =	"Urbana-Champaign, IL"
, year =	1992
, update =	"98.07 bibrelex"
}

@book{w-fpg-64
, author =	"Wielandt"
, title =	"Finite Permutation Groups"
, publisher =	"Academic Press"
, year =	1964
, update =	"97.11 bibrelex"
}

@inproceedings{w-mcrgt-90
, author =	"C. Wieners-Lummer"
, title =	"Manhattan channel routing with good theoretical and practical performance"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"465--474"
}

@inproceedings{ws-prnds-86
, author =	"A. Wiernik and Micha Sharir"
, title =	"Planar realization of nonlinear {Davenport}-{Schinzel} sequences by segments"
, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1986
, pages =	"97--106"
, precedes =	"ws-prnds-88"
, update =	"98.03 mitchell"
}

@article{ws-prnds-88
, author =	"A. Wiernik and Micha Sharir"
, title =	"Planar Realizations of Nonlinear {Davenport}-{Schinzel} Sequences by Segments"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"15--47"
, keywords =	"Davenport-Schinzel sequences, line segments, lower bounds"
, succeeds =	"ws-prnds-86"
, update =	"98.03 mitchell, 93.09 milone+mitchell"
}

@article{wl-avpss-84
, author =	"H. A. G. Wijshoff and J. van Leeuwen"
, title =	"Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino"
, journal =	"Inform. Control"
, volume =	62
, year =	1984
, pages =	"1--25"
, update =	"97.11 bibrelex"
}

@techreport{wl-pvatp-82
, author =	"H. A. G. Wijshoff and J. van Leeuwen"
, title =	"Periodic versus arbitrary tesselations of the plane using polyominos of a single type"
, type =	"Report"
, number =	"RUU-CS-82-11"
, institution =	"Dept. Comput. Sci., Utrecht Univ."
, address =	"Utrecht, Netherlands"
, year =	1982
, update =	"94.05 schwarzkopf"
}

@inproceedings{w-mpav-88
, author =	"G. Wilfong"
, title =	"Motion Planning for an Autonomous Vehicle"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1988
, pages =	"529--533"
}

@inproceedings{w-mppmo-88
, author =	"G. Wilfong"
, title =	"Motion planning in the presence of movable obstacles"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"279--288"
, cites =	"a-usppe-87, afw-msm-87, c-namrm-87, fw-pcm-88, fwy-cmtra-86, gj-cigtn-79, hss-cmpmi-84, kz-tetpp-86, ks-eapcf-85, k-osps-83, lw-apcfp-79, ls-ppspm-87, o-mpic-87, oy-rmpmd-85, rs-mppmo-85, st-pplup-86, ss-pmp2g-83, s-a-83, y-amp-87, ZZZ"
, update =	"98.03 bibrelex"
}

@article{w-mppmo-91
, author =	"G. Wilfong"
, title =	"Motion planning in the presence of movable obstacles"
, journal =	"Ann. Math. Artif. Intell."
, volume =	3
, year =	1991
, pages =	"131--150"
, update =	"96.09 orourke"
}

@inproceedings{w-nnp-91
, author =	"G. Wilfong"
, title =	"Nearest neighbor problems"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"224--233"
, keywords =	"proximity"
, precedes =	"w-nnp-92"
, cites =	"ce-iacko-85, c-papop-85, de-eaahc-84, ds-cgug-87, e-acg-87, h-cnnr-68, hd-kgde-60, mih-ccmcp-81, rwli-asnnd-75, ZZZ"
, update =	"97.11 bibrelex, 96.09 devillers"
}

@article{w-nnp-92
, author =	"G. Wilfong"
, title =	"Nearest neighbor problems"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, year =	1992
, pages =	"283--416"
, keywords =	"pattern recognition, NP complete"
, succeeds =	"w-nnp-91"
, update =	"96.09 devillers"
}

@inproceedings{w-olacp-97
, author =	"G. Wilfong"
, title =	"On-line Algorithms for Compressing Planar Curves"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1997
, pages =	"158--167"
, update =	"97.03 held"
}

@inproceedings{w-raamp-87
, author =	"G. Wilfong"
, title =	"Recent advances in algorithmic motion planning"
, booktitle =	"Proc. 1st Internat. Conf. Indust. Applied Math."
, site =	"Paris, France"
, year =	1987
, pages =	"99--110"
}

@techreport{w-spav-88
, author =	"G. Wilfong"
, title =	"Shortest Paths for Autonomous Vehicles"
, type =	"Technical {Report}"
, institution =	"AT\& T Bell Labs"
, year =	1988
, precedes =	"w-spav-89"
, update =	"96.01 devillers"
}

@inproceedings{w-spav-89
, author =	"G. Wilfong"
, title =	"Shortest Paths for Autonomous Vehicles"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Robot. Autom."
, year =	1989
, pages =	"15--20"
, succeeds =	"w-spav-88"
, update =	"96.01 devillers"
}

@techreport{w-tlmcs-93
, author =	"G. Wilfong"
, title =	"Two-label minimum consistent subsets"
, type =	"Technical {Report}"
, institution =	"AT\& T Bell Labs"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@techreport{w-cpadv-90
, author =	"J. Wilhelms"
, title =	"A Coherent Projection Appoach for Direct Volume Rendering"
, type =	"Technical Report"
, number =	"UCSC-CRL-90-38"
, institution =	"Computer Research Laboratory, University of California"
, address =	"Santa Cruz"
, month =	aug
, year =	1990
, update =	"98.07 bibrelex"
}

@article{wv-ofig-92
, author =	"J. Wilhelms and A. {Van Gelder}"
, title =	"Octrees for faster isosurface generation"
, journal =	"ACM Trans. Graph."
, volume =	11
, year =	1992
, pages =	"201--227"
, update =	"98.07 bibrelex"
}

@book{w-reap-63
, author =	"J. Wilkinson"
, title =	"Rounding Errors in Algebraic Processes"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1963
, update =	"98.03 bibrelex"
}

@book{w-aep-65
, author =	"J. H. Wilkinson"
, title =	"The Algebraic Eigenvalue Problem"
, publisher =	"Clarendon Press"
, address =	"Oxford, UK"
, year =	1965
, update =	"98.03 bibrelex"
}

@inproceedings{w-fecaw-98
, author =	"Hans-Martin Will"
, title =	"Fast and Efficient Computation of Additively Weighted {Voronoi} Cells for Applications in Molecular Biology"
, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
, nickname =	"SWAT '98"
, site =	"Stockholm"
, series =	"Lecture Notes Comput. Sci."
, volume =	1432
, publisher =	"Springer-Verlag"
, year =	1998
, pages =	"310--321"
, update =	"99.03 bibrelex, 98.07 mitchell"
}

@article{w-lbaso-89
, author =	"D. Willard"
, title =	"Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems"
, journal =	"Inform. Comput."
, volume =	82
, year =	1989
, pages =	"45--64"
, update =	"97.07 agarwal"
}

@inproceedings{w-ntcor-82
, author =	"D. E. Willard"
, title =	"A new time complexity for orthogonal range queries"
, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
, year =	1982
, pages =	"462--471"
}

@techreport{w-aprt-83
, author =	"D. E. Willard"
, title =	"Abstract predicate retrieval theory"
, type =	"Report"
, number =	"83-3"
, institution =	"Dept. Comput. Sci., State Univ. New York Albany"
, address =	"Albany, NY"
, year =	1983
}

@techreport{w-isbt-79
, author =	"D. E. Willard"
, title =	"An introduction to super-$b$-trees"
, type =	"Report"
, number =	"79-01"
, institution =	"Dept. Comput. Sci., Univ. Iowa"
, address =	"Iowa City, IA"
, year =	1979
, update =	"97.11 bibrelex"
}

@article{w-arqtr-96
, author =	"D. E. Willard"
, title =	"Applications of range query theory to relational data base join and selection operations"
, journal =	"J. Comput. Syst. Sci."
, volume =	52
, year =	1996
, pages =	"157--169"
, update =	"96.05 agarwal"
}

@inproceedings{w-aftmc-92
, author =	"D. E. Willard"
, title =	"Applications of the fusion tree method to computational geometry and searching"
, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1992
, pages =	"286--295"
, update =	"00.11 smid, 00.07 smid"
}

@techreport{w-ataba-86
, author =	"D. E. Willard"
, title =	"Applied and theoretical algorithms based on the application of sheared retrieval to orthogonal range queries"
, institution =	"SUNY Albany"
, year =	1986
, update =	"97.11 bibrelex"
}

@techreport{w-bfkdt-78
, author =	"D. E. Willard"
, title =	"Balanced forests of $k$-d* trees as a dynamic data structure"
, type =	"Report"
, number =	"TR-23-78"
, institution =	"Aiken Comput. Lab., Harvard Univ."
, address =	"Cambridge, MA"
, year =	1978
}

@inproceedings{w-eprce-84
, author =	"D. E. Willard"
, title =	"Efficient processing of relational calculus expressions using range query theory"
, booktitle =	"Proceedings of ACM SIGMOD Conference"
, year =	1984
, pages =	"160--172"
, update =	"97.11 bibrelex"
}

@article{w-ecgve-00
, author =	"D. E. Willard"
, title =	"Examining computational geometry, {Van Emde Boas} trees, and hashing from the perspective of the fusion tree"
, journal =	"SIAM J. Comput."
, volume =	29
, year =	2000
, pages =	"1030--1049"
, update =	"00.11 smid, 00.07 smid"
}

@techreport{w-kdtde-80
, author =	"D. E. Willard"
, title =	"{$K$}-d trees in a dynamic environment"
, type =	"Report"
, number =	"80-01"
, institution =	"Dept. Comput. Sci., Univ. Iowa"
, address =	"Iowa City, IA"
, year =	1980
}

@article{w-llwcr-83
, author =	"D. E. Willard"
, title =	"Log-logarithmic worst case range queries are possible in space {$O(n)$}"
, journal =	"Inform. Process. Lett."
, volume =	17
, year =	1983
, pages =	"81--89"
}

@inproceedings{w-lbdrq-86
, author =	"D. E. Willard"
, title =	"Lower bounds for dynamic range query problems that permit subtraction"
, booktitle =	"Proc. 13th Internat. Coll. on Autom., Langu. and Program."
, year =	1986
, update =	"98.03 bibrelex"
}

@techreport{w-lasoo-85
, author =	"D. E. Willard"
, title =	"Lower bounds for the addition-subtraction operations in orthogonal range queries"
, institution =	"SUNY Albany"
, year =	1985
, update =	"97.11 bibrelex"
}

@article{w-mstpt-87
, author =	"D. E. Willard"
, title =	"Multidimensional Search Trees That Provide New Type of Memory Reductions"
, journal =	"J. AMC"
, volume =	34
, number =	4
, year =	1987
, pages =	"846--858"
, update =	"98.11 bibrelex"
}

@techreport{w-ndsor-78
, author =	"D. E. Willard"
, title =	"New Data Structures for Orthogonal Range Queries"
, type =	"Technical {Report}"
, institution =	"Havard Univ."
, year =	1978
, update =	"97.11 bibrelex"
}

@article{w-ndsor-85
, author =	"D. E. Willard"
, title =	"New data structures for orthogonal range queries"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"232--253"
}

@article{w-ntdsw-84
, author =	"D. E. Willard"
, title =	"New trie data structures which support very fast search operations"
, journal =	"J. Comput. Syst. Sci."
, volume =	28
, year =	1984
, pages =	"379--394"
}

@inproceedings{w-asror-86
, author =	"D. E. Willard"
, title =	"On the application of sheared retrieval to orthogonal range queries"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"80--89"
, cites =	"amm-cpmr-81, b-mbstu-75, b-mdc-80, bm-ewcds-80, bs-pmsad-77, bs-dsp1s-80, bw-owcar-80, c-fsnaq-83, c-sdssf-85, c-fadsi-85, cg-fc-85, ce-lsdst-86, e-ndrs-81, eo-esrp-82, fks-sstwc-82, f-icdds-80, f-lbcor-81, f-lbcor-81, fmn-dgds-85, gbt-srtgp-84, j-pqiqo-82, k-aru-84, kmr-nnpbd-85, lp-cgs-84, lw-wcarp-77, lw-qtfsm-80, lw-dsdrq-82, m-dsa-84, ms-idsfs-80, nhs-gfasm-84, o-rsg-85t, ol-tgmdd-81, ps-cgi-85, v-sttor-85, e-pofll-77, ekz-diepq-77, w-ndsor-78, w-ndsor-85, w-llwcr-83, wl-arrcd-85, w-sadbr-84, w-rmsmd-85, w-lasoo-85, w-ataba-86, y-sttoa-82, y-cmps-85, ZZZ"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{w-oscrd-91
, author =	"D. E. Willard"
, title =	"Optimal sample cost residues for differential database batch query problems"
, journal =	"J. ACM"
, volume =	38
, year =	1991
, pages =	"104--119"
}

@article{w-pr-82
, author =	"D. E. Willard"
, title =	"Polygon retrieval"
, journal =	"SIAM J. Comput."
, volume =	11
, year =	1982
, pages =	"149--165"
}

@phdthesis{w-podsa-78
, author =	"D. E. Willard"
, title =	"Predicate-oriented database search algorithms"
, type =	"Ph.{D}. Thesis"
, school =	"Aiken Comput. Lab., Harvard Univ."
, address =	"Cambridge, MA"
, year =	1978
, note =	"Report TR-20-78"
, keywords =	"doctoral thesis"
, update =	"93.05 jones"
}

@inproceedings{w-rmsmd-85
, author =	"D. E. Willard"
, title =	"Reduced memory space for multi-dimensional search trees"
, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
, year =	1985
, pages =	"363--374"
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@inproceedings{w-sadbr-84
, author =	"D. E. Willard"
, title =	"Sampling algorithms for differentiable batch retrieval problems"
, booktitle =	"Proceedings of ICALP"
, year =	1984
, update =	"97.11 bibrelex"
}

@article{w-sungf-85
, author =	"D. E. Willard"
, title =	"Searching unindexed and nonuniformly generated files in {$\log\log N$} time"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"1013--1029"
}

@techreport{w-sbta-79
, author =	"D. E. Willard"
, title =	"The super-$b$-tree algorithm"
, type =	"Report"
, number =	"TR-03-79"
, institution =	"Aiken Comput. Lab., Harvard Univ."
, address =	"Cambridge, MA"
, year =	1979
}

@article{wl-arrcd-85
, author =	"D. E. Willard and G. S. Lueker"
, title =	"Adding range restriction capability to dynamic data structures"
, journal =	"J. ACM"
, volume =	32
, year =	1985
, pages =	"597--617"
}

@inproceedings{ww-qvrqi-88
, author =	"D. E. Willard and Y. C. Wee"
, title =	"Quasi-valid range querying and its implications for nearest neighbor problems"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"34--43"
, cites =	"cg-opapp-88, acg-dctdp-87, acg-cdctd-87, ag-epssg-86, aks-osn-83, b-mbstu-75, b-mdc-80, bm-ewcds-80, bs-pmsad-77, bs-dsp1s-80, c-sdssf-85, c-fsnaq-86, c-lbcms-86, c-prsig-87, c-pms-86, dk-ppess-87, e-acg-87, eo-bdsds-85, ew-hrsls-86, f-icdds-80, f-lbcor-81, f-sbmrq-81, hw-ensrq-87, kmr-nnpbd-85, lp-cgs-84, lw-wcarp-77, lw-dsdrq-82, m-mdscg-84, ol-tgmdd-81, o-ddds-83, ps-cgi-85, v-sttor-85, v-oaann-86, w-pr-82, w-ndsor-85, w-asror-86, w-rmsmd-85, wl-arrcd-85, y-cmps-85, yy-gaddg-85, ZZZ"
, update =	"98.03 bibrelex"
}

@article{w-sppdt-95
, author =	"P. Willet"
, title =	"Searching for pharmacophoric patterns in databases of three-dimensional chemical structures"
, journal =	"J. Molecular Recognition"
, volume =	8
, year =	1995
, pages =	"290--303"
, update =	"98.07 bibrelex"
}

@article{w-cmc-80
, author =	"M. H. Williams"
, title =	"Cubic map configurations"
, journal =	"Inform. Process. Lett."
, volume =	11
, year =	1980
, pages =	"189--185"
}

@techreport{w-idpvr-90
, author =	"P. Williams"
, title =	"Issues in Interactive Direct Projection Volume Rendering of Nonrectilinear Meshed Data Sets"
, type =	"Work in Progress Report"
, number =	1059
, institution =	"Center for Supercomputing Research and Development, University of Illinois"
, address =	"Urbana-Champaign"
, month =	dec
, year =	1990
, update =	"98.07 bibrelex"
}

@techreport{ws-vomp-91
, author =	"P. Williams and P. Shirley"
, title =	"Visibility Ordering Meshed Polyhedra"
, type =	"Report"
, number =	1097
, institution =	"Center for Supercomputing Research and Development, Universityof Illinois"
, address =	"Urbana-Champaign"
, month =	apr
, year =	1991
, precedes =	"w-vomp-92"
, update =	"98.11 bibrelex, 98.07 bibrelex"
}

@inproceedings{w-acgvv-91
, author =	"P. L. Williams"
, title =	"Applications of computational geometry to volume visualization"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"247--251"
, cites =	"e-atccd-90, e-acg-87, fkn-vsgpt-80, mhc-avcev-90, st-padsc-90, w-cpadv-90, ws-vomp-91, ZZZ"
, update =	"98.07 bibrelex"
}

@article{w-vomp-92
, author =	"P. L. Williams"
, title =	"Visibility ordering meshed polyhedra"
, journal =	"ACM Transaction on Graphics"
, volume =	11
, number =	2
, month =	apr
, year =	1992
, pages =	"103--125"
, succeeds =	"ws-vomp-91"
, update =	"98.11 bibrelex"
}

@article{wg-ceaal-96
, author =	"David P. Williamson and Michel X. Goemans"
, title =	"Computational Experience with an Approximation Algorithm on Large-Scale {Euclidean} Matching Instances"
, journal =	"INFORMS J. Comput."
, volume =	8
, number =	1
, year =	1996
, pages =	"29--40"
, keywords =	"matching, experimental analysis"
, update =	"98.03 mitchell"
}

@inproceedings{w-nivvl-97
, author =	"Graham J. Wills"
, title =	"{NicheWorks} - Interactive Visualization of Very Large Graphs"
, editor =	"G. {Di Battista}"
, booktitle =	"Graph Drawing (Proc. GD '97)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1353
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"403--414"
, keywords =	"graph drawing"
, update =	"99.07 patrignani, 98.07 patrignani"
}

@article{w-ptp-86
, author =	"J. M. Wills"
, title =	"On polyhedra with transitivity properties"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"195--199"
}

@article{wgs-ltino-90
, author =	"F. Wesley Wilson and R. Kent Goodrich and Wendy Spratte"
, title =	"Lawson's Triangulation Is Nearly Optimal For Controlling Error Bounds"
, journal =	"SIAM J. Numer. Anal."
, volume =	27
, number =	1
, month =	feb
, year =	1990
, pages =	"190--197"
, keywords =	"Lawson's triangulation, error bounds"
, annote =	"If a triangle has side lengths $a \le b \le c$ then
		 condition number $C$ is
		 $1+\sqrt{(1-\lambda^2})/\lambda$, where
		 $\lambda=(4\mbox{Area})/(b^2+c^2)$. One wants $C$ to be
		 small. Another error bound looks like
		 $kc^n_S/\sin\alpha_S$, where $\alpha_S$ is the smallest
		 angle, $c_S$ is the longest side, and $n$ a positive
		 integer. Also gives another error bound which is really
		 hairy."
, abstract =	"One way of evaluating a triangulation method is to
		 study how well it controls error bounds and stability
		 in computations. Lawson's method, which maximizes the
		 smallest angle over all triangulations, controls error
		 bounds for linear interpolates as well as for certain
		 derivative estimates. In particular, no other
		 triangulation improves these bounds by more than a
		 factor of 2. Although Lawson's triangulation method
		 does not minimize the largest edge over all
		 triangulations, it nearly does; this edge is no longer
		 than 2/ root 3 times the longest edge in any other
		 triangulation. Thus, Lawson's triangulation method
		 controls error bounds in polynomial interpolation
		 schemes. (Author abstract) 7 Refs."
}

@article{w-tbcav-87
, author =	"P. M. H. Wilson"
, title =	"Towards Birational Classfication of Algebraic Varieties"
, journal =	"Bull. London Math. Soc."
, volume =	19
, year =	1987
, pages =	"1--48"
, update =	"97.11 bibrelex"
}

@incollection{w-epa-91
, author =	"R. H. Wilson"
, title =	"Efficiently Partitioning an Assembly"
, editor =	"L. S. Honem de Mello and S. Lee"
, booktitle =	"Computer-Aided Mechanical Assembling Planning"
, publisher =	"Kluwer Academic Publishers"
, year =	1991
}

@phdthesis{w-fap-92
, author =	"R. H. Wilson"
, title =	"On Geometric Assembly Planning"
, school =	"Stanford University"
, month =	mar
, year =	1992
, note =	"Stanford Technical Report STAN-CS-92-1416"
, keywords =	"doctoral thesis"
, update =	"98.11 bibrelex"
}

@article{wl-grama-94
, author =	"R. H. Wilson and J.-C. Latombe"
, title =	"Geometric reasoning about mechanical assembly"
, journal =	"Artif. Intell."
, volume =	71
, year =	1994
, pages =	"371--396"
, update =	"98.07 bibrelex"
}

@techreport{wll-cpa-92
, author =	"R. H. Wilson and J.-C. Latombe and T. Lozano-P{\'e}rez"
, title =	"On the complexity of partitioning an assembly"
, type =	"Technical Report"
, number =	"STAN-CS-92-1458"
, institution =	"Dept. of Computer Science, Stanford University"
, year =	1992
, update =	"99.11 bibrelex, 98.11 bibrelex"
}

@inproceedings{wm-paimt-92
, author =	"R. H. Wilson and T. Matsui"
, title =	"Partitioning an assembly for infinitesimal motions in translation and rotation"
, booktitle =	"Proc. IEEE Internat. Conf. Intell. Robots Syst."
, year =	1992
, pages =	"1311--1318"
, update =	"98.03 bibrelex"
}

@techreport{ws-apst-91
, author =	"R. H. Wilson and A. Schweikard"
, title =	"Assembling polyhedra with single translations"
, number =	"STAN-CS-91-1387"
, institution =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, month =	oct
, year =	1991
}

@inproceedings{wkc-oarbb-89
, author =	"S. Wimer and I. Koren and I. Cederbaum"
, title =	"Optimal Aspect Ratios of Building Blocks inVLSI"
, booktitle =	"IEEE Trans. Computer Aided Design of Integrated Circuits and Systems"
, year =	1989
, pages =	"139--145"
, update =	"98.11 bibrelex"
}

@article{wkc-fpgl-88
, author =	"W. Wimer and I. Koren and I. Cederbaum"
, title =	"Floorplans, Planar Graphs and Layouts"
, journal =	"IEEE Trans. Circuits Syst."
, volume =	"CAS-35"
, year =	1988
, pages =	"267--278"
, update =	"99.03 vismara, 98.11 bibrelex"
}

@inproceedings{w-ipac-95
, author =	"Franz Winkler"
, title =	"Issues in Parametrization of Algebraic Curves"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	"37--40"
, update =	"00.03 bibrelex"
}

@article{w-aspep-85
, author =	"P. Winter"
, title =	"An algortihm for the {Steiner} problem in the {Euclidean} plane"
, journal =	"Networks"
, volume =	15
, year =	1985
, pages =	"323--345"
, update =	"98.11 bibrelex"
}

@inproceedings{w-esmt3-95
, author =	"Pawel Winter"
, title =	"Euclidean {Steiner} Minimal Trees for $3$ Terminals in a Simple Polygon"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"247--253"
, update =	"95.09 jones"
}

@inproceedings{w-shtt-01
, author =	"Pawel Winter"
, title =	"{Steiner} Hull in {$\Theta(n\log n)$} Time"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"170--173"
, update =	"01.04 icking"
}

@article{w-spns-87
, author =	"P. Winter"
, title =	"Steiner problem in networks, a survey"
, journal =	"Networks"
, volume =	17
, year =	1987
, pages =	"129--167"
, update =	"97.11 bibrelex"
}

@article{w-rmqpp-85
, author =	"D. S. Wise"
, title =	"Representing matrices as quadtrees for parallel processors"
, journal =	"Inform. Process. Lett."
, volume =	20
, year =	1985
, pages =	"195--199"
}

@article{ww-stcs-88
, author =	"J. A. Wiseman and P. R. Wilson"
, title =	"A {Sylvester} theorem for conic sections"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"295--305"
}

@article{w-cfvgs-92
, author =	"S. Wismath"
, title =	"Computing the full visibility graph of a set of line segments"
, journal =	"Inform. Process. Lett."
, volume =	42
, number =	5
, month =	jul
, year =	1992
, pages =	"257--??"
, update =	"98.07 bibrelex"
}

@phdthesis{w-brvgr-89
, author =	"S. K. Wismath"
, title =	"Bar-Representable Visibility Graphs and Related Flow Problems"
, type =	"Ph.{D.} Thesis"
, school =	"Dept. Comput. Sci., Univ. British Columbia"
, year =	1989
, keywords =	"graph drawing, visibility, planar"
, update =	"97.03 tamassia"
}

@inproceedings{w-cblsg-85
, author =	"S. K. Wismath"
, title =	"Characterizing bar line-of-sight graphs"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"147--152"
, keywords =	"visibility, graph theory, geometric graphs, graph drawing"
, precedes =	"kw-wvgbr-89"
, cites =	"a-aac-78, et-csn-76, gjs-agcpc-76, ZZZ"
, update =	"01.04 icking, 97.11 bibrelex, 93.09 milone+mitchell+tamassia"
}

@inproceedings{w-rplse-94
, author =	"S. K. Wismath"
, title =	"Reconstruction of Parallel Line Segments From Endpoint Visibility Information"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"369--374"
, cites =	"cl-dvg-92, ec-rvgsp-90, elo-rchev-93, o-cgc18-93a, s-spinh-91, tt-uavrp-86, w-cblsg-85, a-srvg-92, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@mastersthesis{w-tas-80
, author =	"S. K. Wismath"
, title =	"Triangulations: {An} algorithmic study"
, type =	"M.{Sc}. Thesis"
, school =	"Dept. Comput. Inform. Sci., Queen's Univ."
, address =	"Kingston, ON"
, month =	jul
, year =	1980
, note =	"Report 80-106"
, keywords =	"master thesis, Delaunay triangulations, point-set triangulation, implementing algorithms, empirical analysis"
, update =	"93.05 jones"
}

@article{w-sacui-80
, author =	"H. S. Witsenhausen"
, title =	"Some aspects of convexity useful in information theory"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-26"
, year =	1980
, pages =	"265--271"
}

@techreport{w-enh-88
, author =	"G. Woeginger"
, title =	"Epsilon-nets for Halfplanes"
, number =	"B-88-02"
, institution =	"Dep. of Mathematics, Free University Berlin"
, month =	mar
, year =	1988
, update =	"98.03 bibrelex"
}

@inproceedings{w-enh-89
, author =	"G. Woeginger"
, title =	"Epsilon-nets for Halfplanes"
, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, year =	1989
, pages =	"243--252"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{w-avpmm-89
, author =	"G. W{\"o}ginger"
, title =	"{Auffinden} von {Vier}-{Punkte}-{Mengen} mit minimaler {Fl{\"a}che}"
, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
, nickname =	"CG '89"
, site =	"Freiburg"
, publisher =	"Universit{\"a}t Freiburg"
, year =	1989
, update =	"00.03 bibrelex"
}

@misc{w-sve-96
, author =	"T. T. Wohlers"
, title =	"STL viewers and Editors"
, year =	1996
, url =	"http://lamar.colstate.edu/~wohlers/stl_view.html"
, update =	"98.07 bibrelex"
}

@incollection{wm-fcplt-94
, author =	"George Wolberg and Henry Massalin"
, title =	"Fast Convolution with Packed Lookup Tables"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"447--464"
, keywords =	"image filter, image magnification, image resampling"
, update =	"94.09 heckbert"
, annote =	"Gives optimized code for convolution of discrete signals.
This is useful for image resampling and filtering. Contains C code."
}

@article{w-fnpp-76
, author =	"P. Wolfe"
, title =	"Finding the nearest point in a polytope"
, journal =	"Math. Program."
, volume =	11
, year =	1976
, pages =	"128--149"
}

@article{wwkgf-smpd-87
, author =	"R. N. Wolfe and M. A. Wesley and J. C. {Kyle, Jr.} and F. Gracer and W. J. Fitzgerald"
, title =	"Solid modeling for production design"
, journal =	"IBM J. Res. Develop."
, volume =	31
, year =	1987
, pages =	"277--295"
}

@book{w-msdmc-88
, author =	"S. Wolfram"
, title =	"Mathematica: a system for doing mathematics by computer"
, publisher =	"Addison-Wesley"
, address =	"Reading, Mass."
, year =	1988
, update =	"97.03 schwarzkopf, 95.05 agarwal"
}

@inproceedings{w-rfoli-96
, author =	"Michael Wolfrath"
, title =	"Results on Fat Objects with a Low Intersection Proportion"
, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
, nickname =	"CG '96"
, site =	"M{\"u}nster"
, publisher =	"Universit{\"a}t M{\"u}nster"
, year =	1996
, pages =	1
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 99.03 bibrelex"
}

@inproceedings{w-vdsta-95
, author =	"Michael Wolfrath"
, title =	"{Voronoi} Diagrams for Spheres and Their Application in Motion Planning"
, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
, nickname =	"CG '95"
, site =	"Linz"
, publisher =	"Universit{\"a}t Linz"
, year =	1995
, pages =	29
, update =	"00.03 bibrelex"
}

@techreport{ws-cmdap-87
, author =	"E. Wolfson and E. L. Schwartz"
, title =	"Computing Minimal Distances on Arbitrary Polyhedral Surfaces"
, type =	"Technical report"
, institution =	"Dept. of Computer Science, Courant Institute of Mathematical Sciences"
, year =	1987
, precedes =	"ws-cmdps-89"
, update =	"95.01 mitchell, 93.09 milone+mitchell"
}

@article{ws-cmdps-89
, author =	"E. Wolfson and E. L. Schwartz"
, title =	"Computing Minimal Distances on Polyhedral Surfaces"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	11
, number =	9
, year =	1989
, pages =	"1001--1005"
, comments =	"presents an algorithm that has been implemented for the
		discrete geodesic problem; the algorithm is worst-case exponential"
, succeeds =	"ws-cmdap-87"
, update =	"95.01 mitchell, 95.01 mitchell"
}

@techreport{ws-dimps-92
, author =	"E. Wolfson and M. Sharir"
, title =	"Design and implementation of a motion planning system in three dimensions"
, type =	"Manuscript"
, institution =	"??"
, year =	1992
, update =	"98.03 bibrelex"
}

@inproceedings{ws-impst-93
, author =	"E. Wolfson and Micha Sharir"
, title =	"Implementation of a motion planning system in three dimensions"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"399--400"
, keywords =	"video review"
, cites =	"as-car-92, cp-tncp-90, ws-dimps-92, ZZZ"
, update =	"98.03 bibrelex+mitchell, 93.09 jones"
}

@inproceedings{w-mborg-90
, author =	"H. J. Wolfson"
, title =	"Model based object recognition by `geometric hashing'"
, booktitle =	"Proc. 1st European Conf. Comput. Vision"
, year =	1990
, pages =	"526--536"
, update =	"97.11 bibrelex"
}

@article{w-cm-90
, author =	"H. J. Wolfson"
, title =	"On curve matching"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	12
, year =	1990
, pages =	"483--489"
, update =	"98.03 bibrelex"
}

@phdthesis{w-clbur-85
, author =	"F. E. Wolter"
, title =	"Cut Loci in Bordered and Unbordered Riemannian Manifolds"
, school =	"TU Berlin, FB Mathematik"
, address =	"Berlin, Germany"
, year =	1985
, keywords =	"doctoral thesis"
, update =	"95.05 held"
}

@article{w-clmag-??
, author =	"F.-E. Wolter"
, title =	"Cut Locus and Medial Axis in Global Shape Interrogation and Representation"
, journal =	"Comput. Aided Geom. Design"
, volume =	"??"
, year =	"??"
, note =	"To appear"
, update =	"95.05 abrams"
}

@techreport{w-clmag-92
, author =	"F. E. Wolter"
, title =	"Cut Locus and Medial Axis in Global Shape Interrogation and Representation"
, number =	"92-2"
, institution =	"MIT, Dept. Ocean Engg., Design Lab"
, address =	"Cambridge, MA 02139, USA"
, month =	jan
, year =	1992
, update =	"95.05 held"
}

@article{wt-ahdpc-92
, author =	"F.-E. Wolter and S. T. Tuohy"
, title =	"Approximation of High Degree and Procedural Curves"
, journal =	"Engineering with Computers"
, volume =	8
, year =	1992
, pages =	"61--80"
, update =	"95.05 abrams"
}

@article{wt-ccdsp-92
, author =	"F.-E. Wolter and S. T. Tuohy"
, title =	"Curvature Computations for Degenerate Surface Patches"
, journal =	"Comput. Aided Geom. Design"
, volume =	9
, number =	4
, year =	1992
, pages =	"241--270"
, update =	"95.05 abrams"
}

@article{wwv-oasdt-85
, author =	"Jan D. Wolter and Tony C. Woo and Richard A. Volz"
, title =	"Optimal algorithms for symmetry detection in two and three dimensions"
, journal =	"Visual Comput."
, volume =	1
, number =	1
, month =	jul
, year =	1985
, pages =	"37--48"
, keywords =	"similarity, pattern matching, graph isomorphism"
}

@article{ws-bbshm-88
, author =	"Y. Won and S. Sahni"
, title =	"A balanced bin sort for hypercube multicomputers"
, journal =	"J. of Supercomputing"
, volume =	2
, year =	1988
, pages =	"435--448"
, update =	"96.09 orourke"
}

@incollection{w-otdcs-85
, author =	"C. K. Wong"
, title =	"An optimal two-dimensional compaction scheme"
, editor =	"P. Bertolazzi and F. Luccio"
, booktitle =	"VLSI: {Algorithms} and Architectures"
, publisher =	"Elsevier"
, year =	1985
, pages =	"205--211"
, update =	"98.03 bibrelex"
}

@techreport{w-mrdpb-79
, author =	"T. Wong"
, title =	"Minimum Rectangular Distance Paths Between Two Points on a Plane with barriers"
, institution =	"Electrical Engineering and Computer Science, MIT"
, month =	may
, year =	1979
, update =	"93.09 milone+mitchell"
}

@article{wt-agseo-84
, author =	"R. C. Woo and T. Thomasma"
, title =	"An algorithm for generating solid elements in objects with holes"
, journal =	"Comput. Struct."
, volume =	18
, year =	1984
, pages =	"333--342"
}

@techreport{w-csp-83
, author =	"T. Woo"
, title =	"The Convex Skull Problem"
, type =	"Manuscript"
, institution =	"??"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{w-cabds-85
, author =	"T. C. Woo"
, title =	"A combinatorial analysis of boundary data structure schemata"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	5
, number =	3
, year =	1985
, pages =	"19--27"
}

@inproceedings{w-fevd-82
, author =	"T. C. Woo"
, title =	"Feature Extraction by Volume Decomposition"
, booktitle =	"Proceedings of Conference on CAD/CAM Technology in Mechanical Engineering"
, organization =	"MIT"
, year =	1982
, update =	"98.03 bibrelex"
}

@article{wl-tcccp-85
, author =	"T. C. Woo and H.-C. Lee"
, title =	"On the time complexity for circumscribing a convex polygon"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	30
, year =	1985
, pages =	"362--363"
}

@article{ws-ltatp-85
, author =	"T. C. Woo and S. Y. Shin"
, title =	"A linear time algorithm for triangulating a point-visible polygon"
, journal =	"ACM Trans. Graph."
, volume =	4
, number =	1
, year =	1985
, pages =	"60--70"
}

@incollection{w-ivcg-85
, author =	"D. Wood"
, title =	"An isothetic view of computational geometry"
, editor =	"G. T. Toussaint"
, booktitle =	"Computational Geometry"
, publisher =	"North-Holland"
, address =	"Amsterdam, Netherlands"
, year =	1985
, pages =	"429--459"
}

@book{w-dsap-93
, author =	"D. Wood"
, title =	"Data Structures, Algorithms, and Performance"
, publisher =	"Addison-Wesley"
, year =	1993
, update =	"97.03 tamassia"
}

@article{w-cprp-84
, author =	"D. Wood"
, title =	"The contour problem for rectilinear polygons"
, journal =	"Inform. Process. Lett."
, volume =	19
, year =	1984
, pages =	"229--236"
}

@incollection{w-rr-88
, author =	"D. Wood"
, title =	"The riches of rectangles"
, booktitle =	"Proc. 5th Internat. Meeting Young Comput. Scientists"
, series =	"Lecture Notes Comput. Sci."
, volume =	381
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"161--168"
}

@inproceedings{wy-dsv-93
, author =	"D. Wood and P. Yamamoto"
, title =	"Dent and staircase visibility"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"297--302"
, cites =	"bs-parpv-92, cr-occop-89a, b-rld-91, srw-gsv-cccg-91, ZZZ"
, update =	"98.11 bibrelex, 93.09 milone+mitchell"
}

@inproceedings{wy-ccsop-85
, author =	"D. Wood and C. K. Yap"
, title =	"Computing a convex skull of an orthogonal polygon"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"311--315"
, succeeds =	"wy-rcsp-84"
, precedes =	"wy-ocsp-88"
, cites =	"cy-psppo-84, g-lcpcn-81, osw-dcrch-85, s-mcrm-72, w-csp-83, ZZZ"
, update =	"97.11 bibrelex"
}

@article{wy-ocsp-88
, author =	"D. Wood and C. K. Yap"
, title =	"The orthogonal convex skull problem"
, journal =	"Discrete Comput. Geom."
, volume =	3
, number =	4
, year =	1988
, pages =	"349--365"
, succeeds =	"wy-ccsop-85"
, update =	"98.11 bibrelex"
}

@techreport{wy-rcsp-84
, author =	"D. Wood and C. K. Yap"
, title =	"The rectilinear convex skull problem"
, type =	"Report"
, number =	"TR 132"
, institution =	"Comput. Sci. Div., New York Univ."
, address =	"New York, NY"
, year =	1984
, precedes =	"wy-ccsop-85"
}

@techreport{w-tbtdo-98
, author =	"D. R. Wood"
, title =	"Two-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs"
, type =	"Technical Report"
, number =	"98/03"
, institution =	"School of Computer Science and Software Engineering, Monash University"
, year =	1998
, url =	"ftp://ftp.cs.monash.edu.au//publications/1998/tr98_03.ps.gz"
, keywords =	"graph drawing, orthogonal, 3D"
, update =	"98.07 patrignani"
}

@inproceedings{w-op-72
, author =	"D. R. Woodall"
, title =	"Open problems"
, editor =	"D. J. A. Welsh and D. R. Woodall"
, booktitle =	"Combinatorics, Proc. Conference on Combinatorial Mathematics"
, publisher =	"Institute of Mathematics and its Applications"
, address =	"Southend-on-Sea, UK"
, year =	1972
, pages =	"341--350"
, update =	"98.03 bibrelex"
}

@incollection{w-td-69
, author =	"D. R. Woodall"
, title =	"Thrackles and deadlock"
, editor =	"D. J. A. Welsh"
, booktitle =	"Combinatorial Mathematics and its Applications"
, publisher =	"Academic Press"
, address =	"London"
, year =	1969
, pages =	"335--348"
, update =	"98.03 bibrelex"
}

@article{w-pmdso-80
, author =	"R. J. Woodham"
, title =	"Photometric Method for Determining Surface Orientation from Multiple Images"
, journal =	"Optical Engineering"
, volume =	19
, year =	1980
, pages =	"139--144"
, update =	"97.11 bibrelex"
}

@phdthesis{w-dpg-82
, author =	"D. Woods"
, title =	"Drawing Planar Graphs"
, school =	"Department of Computer Science, Stanford University"
, year =	1982
, note =	"Technical Report STAN-CS-82-943"
, keywords =	"doctoral thesis, graph drawing"
, update =	"93.09 tamassia"
}

@incollection{w-bgm-87
, author =	"J. Woodwark"
, title =	"Blends in geometric modeling"
, editor =	"R. Martin"
, booktitle =	"The Mathematics of Surfaces II"
, year =	1987
, pages =	"255--297"
, update =	"98.03 bibrelex"
}

@article{w-cqt-84
, author =	"J. R. Woodwark"
, title =	"Compressed quad trees"
, journal =	"Comput. J."
, volume =	27
, number =	3
, year =	1984
, pages =	"225--229"
}

@book{w-cs-86
, author =	"J. R. Woodwark"
, title =	"Computing Shape"
, publisher =	"Butterwoths"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{w-erpst-88
, author =	"J. R. Woodwark"
, title =	"Eliminating Redundant Primitives from Set-Theoretic Solid Models by a Consideration of Constituents"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	8
, number =	3
, month =	may
, year =	1988
, pages =	"38--47"
, update =	"93.09 held"
}

@article{wb-bfpsm-86
, author =	"J. R. Woodwark and A. Bowyer"
, title =	"Better and faster pictures from solid models"
, journal =	"IEE Compter Aided Engineering Journal"
, volume =	"??"
, year =	1986
, update =	"98.03 bibrelex"
}

@article{wq-recvm-82
, author =	"J. R. Woodwark and K. M. Quinlan"
, title =	"Reducing the effect of complexity on volume model evaluation"
, journal =	"Compter Aided Design"
, volume =	"??"
, year =	1982
, update =	"98.03 bibrelex"
}

@inproceedings{wq-dgvmr-80
, author =	"J. R. Woodwark and K. M. Quinlan"
, title =	"The derivation of graphics from volume models by recursive subdivision of the object space"
, booktitle =	"Proc. CG"
, year =	1980
, update =	"98.03 bibrelex"
}

@techreport{w-cpgvl-70
, author =	"P. Woon"
, title =	"A Computer Procedure for Generating Visible-Line Drawings of Solids Bounded by Quadratic Surfaces"
, type =	"Technical {Report}"
, number =	"403-15"
, institution =	"Dept. Elect. Engrg., New York Univ."
, address =	"New York, NY"
, month =	nov
, year =	1970
, update =	"98.03 bibrelex"
}

@techreport{w-st-80
, author =	"B. W{\"o}rdenweber"
, title =	"Surface-triangulation"
, type =	"Document"
, number =	107
, institution =	"CAD Group, Cambridge Univ."
, address =	"Cambridge, England"
, year =	1980
}

@article{w-stpp-83
, author =	"B. W{\"o}rdenweber"
, title =	"Surface Triangulation for Picture Production"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	3
, month =	nov
, year =	1983
, pages =	"45--51"
, annote =	"Triangulation of polyhedra for representation. Claims
		 $N\log N$ for triangulation of a polygon. (I don't
		 believe this.)"
}

@techreport{w-vt-??
, author =	"B. W{\"o}rdenweber"
, title =	"Volume-triangulation"
, type =	"Document"
, number =	110
, institution =	"CAD Group, Cambridge Univ."
, address =	"Cambridge, England"
, year =	"??"
}

@inproceedings{ws-msadp-92
, author =	"Marcel Worring and Arnold W. M. Smeulders"
, title =	"Multi-Scale Analysis of Discrete Point Sets"
, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
, nickname =	"CG '92"
, site =	"Utrecht"
, publisher =	"Utrecht University"
, year =	1992
, pages =	"33--37"
, update =	"00.03 bibrelex"
}

@phdthesis{w-pdtpu-93
, author =	"B. Darce Wright"
, title =	"Planification de trajectoires pour un robot mobile sur un terrain accident{\'e}"
, school =	"Ecole Nationale Sup{\'e}rieure des T{\'e}lecommunications"
, year =	1993
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{w-tsshl-83
, author =	"T. J. Wright"
, title =	"A two-space solution to the hidden line problem for plotting functions of two variables"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, number =	1
, year =	1983
, pages =	"28--33"
, update =	"98.03 bibrelex"
}

@article{wbr-cgpma-86
, author =	"A. Y. Wu and S. K. Bhaskar and A. Rosenfeld"
, title =	"Computation of geometric properties from the medial axis transform in {$O(n \log n)$} time"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	34
, year =	1986
, pages =	"76--92"
, update =	"98.07 bibrelex"
}

@techreport{whr-tsuq-80
, author =	"A. Y. Wu and T. H. Hong and A. Rosenfeld"
, title =	"Threshold selection using quadtrees"
, type =	"Report"
, number =	"TR-886"
, institution =	"Dept. Comput. Sci., Univ. Maryland"
, address =	"College Park, MD"
, year =	1980
}

@incollection{w-filap-94
, author =	"Kevin Wu"
, title =	"Fast Inversion of Length- and Angle-Preserving Matrices"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"199--206"
, keywords =	"eigenvalue, 4x4 matrix"
, update =	"94.09 heckbert"
, annote =	"Presents optimized formulas and code to compute the
inverse of a 4x4 matrix that is known to be length- and angle-preserving
(consisting of only rotation, translation, and uniform scaling). Contains C
code."
}

@phdthesis{w-pop-87
, author =	"Peter Yick Fai Wu"
, title =	"Polygon Overlay in {Prolog}"
, school =	"Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
, year =	1987
, keywords =	"doctoral thesis, intersection, artificial intelligence"
, update =	"93.09 franklin"
}

@article{wf-lpacm-90
, author =	"Peter Y. F. Wu and Wm. Randolph Franklin"
, title =	"A Logic Programming Approach to Cartographic Map Overlay"
, journal =	"Canadian Computational Intelligence Journal"
, volume =	6
, number =	2
, year =	1990
, pages =	"61--70"
, keywords =	"artificial intelligence, intersection"
, update =	"93.09 franklin"
}

@article{w-dpmtp-78
, author =	"W. Wu"
, title =	"On the decision problem and mechanization of theorem proving in elementary geometry"
, journal =	"Sci. Sinica"
, volume =	21
, year =	1978
, pages =	"150--172"
, update =	"98.03 bibrelex"
}

@incollection{w-sramt-84
, author =	"W. Wu"
, title =	"Some recent advances in mechanical theorem proving of geometries"
, editor =	"W. W. Bledsoe"
, booktitle =	"Theorem Proving: After 25 Years"
, publisher =	"American Mathematical Society"
, year =	1984
, update =	"98.03 bibrelex"
}

@mastersthesis{w-rsbtt-84
, author =	"W. C. Wu"
, title =	"A robust simulation-before-test technique for nonlinear analog fault diagnosis"
, school =	"Electrical Engineering Department, University of Maryland"
, year =	1984
, keywords =	"master thesis"
, update =	"98.03 bibrelex"
}

@article{w-bpmtp-84
, author =	"W. T. Wu"
, title =	"Basic Principles of Mechanical Theorem Proving in Elementary Geometrics"
, journal =	"J. Syst. Sci. Math. Sci."
, volume =	4
, year =	1984
, pages =	"207--235"
, update =	"98.03 bibrelex"
}

@article{w-tl-62
, author =	"W.-T. Wu"
, title =	"On a theorem of {Leray}"
, journal =	"Chinese Math."
, volume =	2
, year =	1962
, pages =	"398--410"
, update =	"98.03 bibrelex"
}

@incollection{w-ltsbv-92
, author =	"X. Wu"
, title =	"A linear-time simple bounding volume algorithm"
, editor =	"D. Kirk"
, booktitle =	"Graphics Gems III"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1992
, update =	"98.07 bibrelex"
}

@article{w-oqms-91
, author =	"X. Wu"
, title =	"Optimal Quantization by Matrix Searching"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"663--673"
, update =	"98.03 bibrelex"
}

@article{wr-dsge-89
, author =	"X. Wu and J. G. Rokne"
, title =	"Double-step generation of ellipses"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	9
, year =	1989
, pages =	"56--69"
, keywords =	"design of algorithms, computer graphics, discrete geometry, approximation, incrementation, average-case analysis, curves, two-dimensional"
}

@article{wr-dsigl-87
, author =	"X. Wu and J. G. Rokne"
, title =	"Double-step incremental generation of lines and circles"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	37
, year =	1987
, pages =	"331--344"
, keywords =	"design of algorithms, computer graphics, discrete geometry, approximation, incrementation, average-case analysis, lines, circles, two-dimensional"
}

@article{wr-pdcc-89
, author =	"X. Wu and J. G. Rokne"
, title =	"On properties of discretized convex curves"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	11
, year =	1989
, pages =	"217--223"
, keywords =	"discrete geometry, approximation, incrementation, curves, two-dimensional, convex"
}

@article{wwsw-rspms-87
, author =	"Y.-F. Wu and P. Widmayer and M. D. F. Schlag and C. K. Wong"
, title =	"Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles"
, journal =	"IEEE Trans. Comput."
, volume =	"C-36"
, number =	3
, month =	mar
, year =	1987
, update =	"93.09 milone+mitchell"
}

@article{w-cbdd-65
, author =	"A. D. Wyner"
, title =	"Capabilities of bounded discrepancy decoding"
, journal =	"AT\&T Tech. J."
, volume =	44
, year =	1965
, pages =	"1061--1122"
, update =	"98.03 bibrelex"
}

@inproceedings{wm-sptrr-93
, author =	"E. Wynters and Joseph S. B. Mitchell"
, title =	"Shortest paths for a two-robot rendez-vous"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"216--221"
, cites =	"gm-osacv-87, m-lpltw-84, mrw-mlpop-90, mw-omcpo-90i, psr-cgcsp-89, ps-cgi-85, rs-spesp-85, w-cvgnl-85, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
}

@phdthesis{w-ompmp-91
, author =	"E. L. Wynters"
, title =	"Optimal motion planning for multiple point robots in the plane"
, type =	"Ph.{D}. Thesis"
, school =	"App. Math., Cornell Univ."
, address =	"Ithaca, NY"
, year =	1991
, keywords =	"doctoral thesis"
}

@inproceedings{x-gachr-96
, author =	"Patrick G. Xavier"
, title =	"A Generic Algorithm for Constructing Hierarchical Representations of Geometric Objects"
, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
, year =	1996
, pages =	"3644--3651"
, keywords =	"BV trees, bounding volume trees, bottom-up construction, collision detection"
, update =	"98.03 mitchell"
}

@inproceedings{xv-dvdsp-96
, author =	"J. Xia and A. Varshney"
, title =	"Dynamic View-Dependent Simplification for Polygonal Models"
, booktitle =	"IEEE Visualization '96 Proceedings"
, publisher =	"ACM/SIGGRAPH Press"
, address =	"San Francisco, CA"
, month =	oct
, year =	1996
, pages =	"327--334"
, update =	"98.03 mitchell"
}

@article{xev-artld-97
, author =	"J. C. Xia and J. El-Sana and A. Varshney"
, title =	"Adaptive Real-Time Level-of-Detail Based Rendering for Polygonal Meshes"
, journal =	"IEEE Trans. Visualizat. Comput. Graph."
, volume =	3
, number =	2
, month =	apr
, year =	1997
, pages =	"171--183"
, update =	"97.07 held"
}

@inproceedings{xhm-fesps-99
, author =	"Xinyu Xiang and Martin Held and Joseph S. B. Mitchell"
, title =	"Fast and Effective Stripification of Polygonal Surface Models"
, booktitle =	"ACM Sympos. Interactive 3D Graphics"
, year =	1999
, update =	"01.07 orourke"
}

@phdthesis{x-mwtpp-92
, author =	"Y. Xu"
, title =	"Minimum weight triangulation problem of a planar point set"
, school =	"Institute of Applied Mathematics, Academia Sinica"
, address =	"Beijing, China"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"98.03 bibrelex"
}

@article{x-dis-90
, author =	"Zhiming Xu"
, title =	"Discrete Interpolation Surface"
, journal =	"Journal of Computer Science and Technology"
, volume =	5
, number =	4
, month =	oct
, year =	1990
, pages =	"329--332"
, keywords =	"discrete interpolation surface, Voronoi diagram, scattered interpolation surface"
, abstract =	"In this paper, a method to construct a surface with
		 point interpolation and normal interpolation is
		 presented. An algorithm to construct the discrete
		 interpolation is also presented, which has the time
		 complexity O(Nlog N), where N in the number of
		 scattered points. (Author abstract) 6 Refs."
}

@article{xs-rrppu-95
, author =	"Z. Xu and M. Suk"
, title =	"Representation and reconstruction of polygons and polyhedra using hierarchical extended {Gaussian} images"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"377--400"
, keywords =	"matching, shape recognition, vision"
, update =	"98.07 bibrelex, 95.09 mitchell"
}

@inproceedings{xrp-ptdae-92
, author =	"G. L. Xue and J. B. Rosen and P. M. Pardalos"
, title =	"A Polynomial Time Dual Algorithm for the {Euclidean} Multifacility Location Problem"
, booktitle =	"INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION"
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@techreport{yd-cgalr-88
, author =	"Y. Yacoob and L. Davis"
, title =	"Computational ground and airborne localization over rough terrain"
, type =	"Technical {Report}"
, number =	"CS-TR-2788"
, institution =	"University of Maryland"
, year =	1988
, update =	"97.11 bibrelex"
}

@article{yr-vcewc-96
, author =	"R. Yagel and W. Ray"
, title =	"Visibility computations for efficient walkthrough of complex environments"
, journal =	"Presence"
, volume =	5
, number =	1
, year =	1996
, pages =	"1--16"
, update =	"98.07 bibrelex"
}

@book{y-snegi-79
, author =	"I. M. Yaglom"
, title =	"A simple non-euclidean geometry and its physical basis"
, publisher =	"Springer-Verlag"
, year =	1979
, update =	"98.03 bibrelex"
}

@book{y-gt-61
, author =	"I. M. Yaglom"
, title =	"Geometric Transformations"
, volume =	1
, publisher =	"Random House"
, year =	1961
, precedes =	"y-gt-68"
, update =	"97.11 bibrelex"
}

@book{y-gt-68
, author =	"I. M. Yaglom"
, title =	"Geometric Transformations"
, volume =	2
, publisher =	"Random House"
, year =	1968
, succeeds =	"y-gt-61"
, update =	"97.11 bibrelex"
}

@book{yb-cf-61
, author =	"I. M. Yaglom and V. G. Bolyanski"
, title =	"Convex Figures"
, publisher =	"English Translation, Holt, Rinehart and Winston"
, address =	"New York, NY"
, year =	1961
}

@inproceedings{ysi-emamc-96
, author =	"Atsushi Yamada and Kenji Shimada and Takayuki Iboh"
, title =	"Energy-minimizing approach to meshing curved wire-frame models"
, booktitle =	"Proc. 5th International Meshing Roundtable"
, publisher =	"Sandia National Laboratories"
, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
, year =	1996
, pages =	"179--191"
, note =	"Also Sand. Report 96-2301"
, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
, update =	"97.03 samitchell"
}

@article{y-uaipu-85
, author =	"F. Yamaguchi"
, title =	"A unified approach to interference problems using a triangle processor"
, journal =	"Comput. Graph."
, volume =	19
, number =	3
, year =	1985
, pages =	"141--149"
, note =	"Proc. SIGGRAPH '85"
}

% ### others?
@inproceedings{y-cfdgp-89
, author =	"F. Yamaguchi"
, title =	"The Completely Four-Dimensional Geometric Processing Based on the $4 \times 4$ Determinant Method"
, editor =	"L. Yonchun and others"
, booktitle =	"Proc. Internat. Conf. on Computer-Aided Design and Computer Graphics"
, publisher =	"Internat. Academic Publ."
, address =	"Beijing, China"
, month =	aug
, year =	1989
, pages =	"183--188"
, update =	"93.09 held"
}

@article{y-tf4dm-87
, author =	"Fujio Yamaguchi"
, title =	"Theoretical foundations for the $4 \times 4$ determinant method in computer graphics and geometric modelling"
, journal =	"Visual Comput."
, volume =	3
, number =	2
, month =	aug
, year =	1987
, pages =	"88--97"
, keywords =	"interference problems, geometric modelling, solid modelling, hidden line, surface detections, matrix, matrices"
}

@article{yn-sbgtc-97
, author =	"F. Yamaguchi and M. Niizeki"
, title =	"Some Basic Geometric Test Conditions in Terms of Pluecker Coordinates and Pluecker Coefficients"
, journal =	"Visual Comput."
, volume =	13
, number =	1
, year =	1997
, pages =	"29--41"
, update =	"97.03 held"
}

@article{yt-uabso-84
, author =	"F. Yamaguchi and T. Tokieda"
, title =	"A Unified Algorithm for {Boolean} Shape Operations"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	4
, month =	jun
, year =	1984
, pages =	"24--27"
, annote =	"Intersection etc. of polyhedra. Faces are triangulated
		 and winged edge data structure used. Face triangulation
		 algorithm: take concave vertex and cut adjacent ear(s).
		 Repeat for all concave vertices."
}

@article{ytsn-aefcb-93
, author =	"F. Yamaguchi and K. Toshimitsu and H. Sato and J. Nakagawa"
, title =	"An Adaptive, Error-free Computation Based on the $4 \times 4$ Determinant Method"
, journal =	"Visual Comput."
, volume =	9
, number =	4
, month =	jan
, year =	1993
, pages =	"173--181"
, keywords =	"robustness, numerical stability"
, update =	"93.09 held"
}

@inproceedings{yk-lsdso-83
, author =	"K. Yamaguchi and T. L. Kunii"
, title =	"A layerded data structure for an octree model"
, booktitle =	"Proc. IEEE CAPAIDIM '83"
, site =	"Pasadena, CA"
, year =	1983
, update =	"97.11 bibrelex"
}

@article{ykf-ordsa-84
, author =	"K. Yamaguchi and T. L. Kunii and K. Fujimura"
, title =	"Octree-related data structures and algorithms"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	4
, month =	jan
, year =	1984
, pages =	"53--59"
, update =	"97.11 bibrelex"
}

@inproceedings{y-cddp-94
, author =	"P. Yamamoto"
, title =	"Computing the Dent Diameter of a Polygon"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"116--121"
, cites =	"bs-parpv-92, ci-tpdc-83, cr-occop-89a, b-rld-91, dls-oaclc-89, ds-ehlec-85, k-ealdp-89, lpsssstwy-clcsp-87, ns-oarlc-91, ns-crldp-91, srw-gsv-91, s-mlppr-87, wy-dsv-93, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{ykii-avoll-88
, author =	"P. Yamamoto and K. Kato and K. Imai and H. Imai"
, title =	"Algorithms for vertical and orthogonal {$L_{1}$} linear approximation of points"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"352--361"
, cites =	"as-lce-73, b-lbact-83, c-lp-83, csy-khrp-87, eg-tsa-86, ew-cbtda-86, elss-dgpps-73, iky-ltall-87, lw-gcslp-86, m-ltalp-83, m-lpltw-84, mn-salfl-80, sw-olla-87, ZZZ"
, update =	"98.03 bibrelex"
}

@inproceedings{yusk-smipr-97
, author =	"M. Yamashita and H. Umemoto and I. Suzuki and T. Kameda"
, title =	"Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, pages =	"448--450"
, cites =	"csy-smico-95, ik-tgp-91, llglm-futwo-97, mhgjp-csg-88, o-agta-87, p-bbcra-96, p-peg-76, ssy-ssp-90, sy-smipr-92, u-sp1s-95, ZZZ"
, update =	"98.07 bibrelex, 97.07 efrat"
}

@inproceedings{yl-olpar-82
, author =	"B. Yamnitsky and L. A. Levin"
, title =	"An old linear programming algorithm runs in polynomial time"
, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1982
, pages =	"327--328"
}

@inproceedings{y-csosm-92
, author =	"H. H. Yanasse"
, title =	"Cutting stock: {Open} stack minimization"
, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
, site =	"Kyoto, Japan"
, year =	1992
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{y-bsmwt-95
, author =	"B. Yang"
, title =	"A better subgraph of the minimum weight triangulation"
, booktitle =	"Proc. Internat. Conf. Comput. Combinatorics"
, year =	1995
, pages =	"452--455"
, update =	"97.11 bibrelex"
}

@inproceedings{yxy-cdapp-94
, author =	"B.-T. Yang and Y.-F. Xu and Z.-Y. You"
, title =	"A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"423--427"
, update =	"99.11 bibrelex, 97.11 bibrelex, 96.05 mitchell"
}

@techreport{ylw-rpror-92
, author =	"C. Yang and D. Lee and C. Wong"
, title =	"Rectilinear Paths Among Rectilinear Obstacles Revisited"
, institution =	"Dept. of EE \& CS, Northwestern Univ."
, year =	1992
, precedes =	"ylw-rppro-95"
, update =	"96.05 mitchell"
}

@article{yl-nannp-79
, author =	"C. C. Yang and D. T. Lee"
, title =	"A note on the all nearest-neighbor problem for convex polygons"
, journal =	"Inform. Process. Lett."
, volume =	8
, year =	1979
, pages =	"193--194"
}

@inproceedings{ycl-srpaw-89
, author =	"C. D. Yang and T. H. Chen and D. T. Lee"
, title =	"Shortest rectilinear path among weighted rectangles"
, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
, address =	"Fukuoka, Japan"
, year =	1989
, pages =	"1--8"
, keywords =	"weighted regions, segment trees, plane sweep"
, update =	"95.09 mitchell"
}

@article{ycl-srpwr-90
, author =	"C. D. Yang and T. H. Chen and D. T. Lee"
, title =	"Shortest rectilinear paths among weighted rectangles"
, journal =	"J. Inform. Proc."
, volume =	13
, number =	4
, year =	1990
, pages =	"456--462"
, update =	"98.03 bibrelex"
}

@techreport{ylw-bdpot-91
, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
, title =	"On bends and distances of paths among obstacles in two-layer interconnection model"
, type =	"Technical {Report}"
, institution =	"Northwestern University"
, year =	1991
, update =	"96.05 mitchell, 93.09 milone+mitchell"
}

@article{ylw-bdpot-94
, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
, title =	"On bends and distances of paths among obstacles in two-layer interconnection model"
, journal =	"IEEE Trans. Comput."
, volume =	43
, number =	6
, year =	1994
, pages =	"711--724"
, succeeds =	"ylw-bdpot-91"
, update =	"96.05 mitchell"
}

@inproceedings{ylw-blrpg-91
, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
, title =	"On bends and lengths of rectilinear paths: a graph-theoretic approach"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"320--330"
, precedes =	"ylw-blrpg-92"
}

@article{ylw-blrpg-92
, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
, title =	"On bends and lengths of rectilinear paths: a graph theoretic approach"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	1
, year =	1992
, pages =	"61--74"
, keywords =	"path planning, shortest path, minimum-bend path, rectilinear obstacles, graph-theoretic approach"
, succeeds =	"ylw-blrpg-91"
}

@techreport{ylw-ptfrp-92
, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
, title =	"Problem transformation for finding rectilinear paths among obstacles in two-layer interconnection model"
, type =	"Technical {Report}"
, institution =	"Northwestern University"
, year =	1992
, update =	"96.05 mitchell, 93.09 milone+mitchell"
, annote =	"This is under revision now (Jan, 1996) for a journal."
}

@techreport{ylw-rppro-92
, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
, title =	"Rectilinear paths problems among rectilinear obstacles revisited"
, type =	"Technical {Report}"
, institution =	"Northwestern University"
, year =	1992
, update =	"93.09 milone+mitchell"
}

@article{ylw-rppro-95
, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
, title =	"Rectilinear paths problems among rectilinear obstacles revisited"
, journal =	"SIAM J. Comput."
, volume =	24
, year =	1995
, pages =	"457--472"
, keywords =	"shortest paths, rectilinear geometry, bicriteria paths, VLSI, wire routing"
, succeeds =	"ylw-rpror-92"
, update =	"98.03 mitchell, 96.05 mitchell"
, annote =	"They consider shortest paths (also MST) in the $L_1$ geodesic
metric.  They use a path-preserving graph approach, together with
segment draggin.  For a set of disjoint rectilinear obstacles
having $m$ edges, $t$ of which are ``extreme'' (locally -- having
both adjacent edges on the same side of the line through the edge),
they compute a shortest path in time $O(m\log t+ t\log^{3/2} t)$, using
$O(m+t\log^{3/2} t)$ space.  They also consider the minimum-bend
shortest path (MBSP), shortest minimum-bend path (SMBP), and
minimum-cost (MCP -- using a monotonic function of rectilinear
link length and $L_1$ length) problems; these alsorithms take time
$O(m\log^2 m)$ ($O(m\log m)$ space), or $O(m\log^{3/2} m)$ time and space.
This improves previous bound of $O(mt+m\log m)$ in
                  \cite{ylw-blrpg-92}."
}

@unpublished{ygkm-mdidq-
, author =	"J. Yang and H. Gould and W. Klein and R. Mountain"
, title =	"Molecular dynamics investigation of deeply quenched liquids"
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@article{yl-nvweu-96
, author =	"M. Yang and E. Lee"
, title =	"{NC} Verification for Wire-EDM Using an R-Map"
, journal =	"Comput. Aided Design"
, volume =	28
, number =	9
, month =	sep
, year =	1996
, pages =	"733--740"
, update =	"97.03 held"
}

@article{ysc-rdta-92
, author =	"T.-C. Yang and S. Y. Shin and K.-Y. Chwa"
, title =	"Rolling Discs and Their Applications"
, journal =	"J. of Design and Manufacturing"
, volume =	2
, year =	1992
, pages =	"71--82"
, keywords =	"Voronoi diagrams, offsetting"
, update =	"93.09 held"
}

@inproceedings{yw-ossaw-72
, author =	"Y. Y. Yang and O. Wing"
, title =	"Optimal and suboptimal solution algorithms for the wiring problem"
, booktitle =	"IEEE International Symposium on Circuit Theory"
, year =	1972
, pages =	"154--158"
, update =	"98.07 bibrelex"
}

@inproceedings{y-satif-97
, author =	"Zaifu Yang"
, title =	"A Simplicial Algorithm for Testing the Integral Feasibility of Arbitrary Simplices"
, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
, nickname =	"CG '97"
, site =	"W{\"u}rzburg"
, publisher =	"Universit{\"a}t W{\"u}rzburg"
, year =	1997
, pages =	45
, cites =	"ZZZ"
, update =	"00.03 bibrelex, 98.07 bibrelex"
}

@article{y-edp-81
, author =	"M. Yannakakis"
, title =	"Edge deletion problems"
, journal =	"SIAM J. Comput."
, volume =	"??"
, year =	1981
, pages =	"297--309"
, update =	"97.11 bibrelex"
}

@article{y-cpodp-82
, author =	"M. Yannakakis"
, title =	"The complexity of the partial order dimension problem"
, journal =	"SIAM J. Algebraic Discrete Methods"
, volume =	3
, number =	3
, year =	1982
, pages =	"351--358"
, update =	"98.11 bibrelex"
}

@inproceedings{ypk-lpsfd-79
, author =	"M. Yannakakis and C. H. Papadimitriou and H. T. Kung"
, title =	"Locking policies: safety and freedom from deadlock"
, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1979
, pages =	"286--297"
, keywords =	"database theory"
, annote =	"closure of union of isooriented rectangles"
}

@inproceedings{y-pctum-77
, author =	"A. Yao"
, title =	"Probabilistic computation: towards a unified measure of complexity"
, booktitle =	"Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1977
, pages =	"222--227"
, update =	"97.03 gaertner+salinger"
}

@article{y-lbfch-81
, author =	"A. C. Yao"
, title =	"A lower bound to finding convex hulls"
, journal =	"J. ACM"
, volume =	28
, year =	1981
, pages =	"780--787"
}

@article{y-oafms-75
, author =	"A. C. Yao"
, title =	"An {$O(|E| \log\log |V|)$} algorithm for finding minimum spanning trees"
, journal =	"Inform. Process. Lett."
, volume =	4
, year =	1975
, succeeds =	"y-oamst-74"
, update =	"93.05 jones"
}

@techreport{y-oamst-74
, author =	"A. C. Yao"
, title =	"An {$O(|E| \log\log |V|)$} algorithm for minimum spanning trees"
, type =	"Report"
, number =	"UIUCDCS-R-74-691"
, institution =	"Univ. Illinois"
, address =	"Urbana, IL"
, year =	1974
, precedes =	"y-oafms-75"
, update =	"93.05 jones"
}

@inproceedings{y-fafms-77
, author =	"A. C. Yao"
, title =	"Fast algorithms for finding minimum spanning trees in $k$ dimensions"
, booktitle =	"Proc. 15th Allerton Conf. Commun. Control Comput."
, year =	1977
, pages =	"553--556"
, precedes =	"y-cmstk-82"
, update =	"93.09 jones"
}

@article{y-lbact-91
, author =	"A. C. Yao"
, title =	"Lower bounds for algebraic computation trees with integer inputs"
, journal =	"SIAM J. Comput."
, volume =	20
, number =	4
, year =	1991
, pages =	"655--668"
, update =	"98.11 bibrelex, 96.05 smid"
}

@article{y-cmstk-82
, author =	"A. C. Yao"
, title =	"On constructing minimum spanning trees in $k$-dimensional spaces and related problems"
, journal =	"SIAM J. Comput."
, volume =	11
, number =	4
, year =	1982
, pages =	"721--736"
, succeeds =	"y-fafms-77"
, update =	"98.11 bibrelex, 93.09 jones"
}

@inproceedings{y-ccpul-75
, author =	"A. C. Yao"
, title =	"On the complexity of comparison problems using linear functions"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1975
, pages =	"85--89"
}

@article{y-cmps-85
, author =	"A. C. Yao"
, title =	"On the complexity of maintaining partial sums"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"277--288"
, succeeds =	"y-sttoa-82"
}

@inproceedings{y-sttoa-82
, author =	"A. C. Yao"
, title =	"Space-time trade-off for answering range queries"
, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
, year =	1982
, pages =	"128--136"
, precedes =	"y-cmps-85"
}

@inproceedings{yar-olbsp-77
, author =	"A. C. Yao and D. M. Avis and R. L. Rivest"
, title =	"An {$\Omega(n^2 \log n)$} lower bound to the shortest paths problem"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Theory Comput."
, year =	1977
, pages =	"11--17"
, precedes =	"yr-pdp-80"
, annote =	"Lower bound is incorrect"
}

@article{yr-pdp-80
, author =	"A. C. Yao and R. L. Rivest"
, title =	"On the polyhedral decision problem"
, journal =	"SIAM J. Comput."
, volume =	9
, year =	1980
, pages =	"343--347"
, succeeds =	"yar-olbsp-77"
}

@inproceedings{yy-gaddg-85
, author =	"A. C. Yao and F. F. Yao"
, title =	"A general approach to {$D$}-dimensional geometric queries"
, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
, year =	1985
, pages =	"163--168"
, update =	"97.11 bibrelex, 93.09 jones"
}

@techreport{yy-crfsv-75
, author =	"A. C. Yao and F. F. Yao"
, title =	"On computing the rank function for a set of vectors"
, type =	"Report"
, number =	"R-699"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1975
}

@inproceedings{y-dtcbn-94
, author =	"Andrew Chi-Chih Yao"
, title =	"Decision Tree Complexity and {Betti} Numbers"
, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	""
, update =	"98.03 mitchell, 94.01 jones"
}

@inproceedings{y-lbact-89
, author =	"A. C. C. Yao"
, title =	"Lower bounds for algebraic computation rees with integer inputs"
, booktitle =	"Proc. 30th IEEE FOCS"
, year =	1989
, pages =	"308--313"
, update =	"98.07 bibrelex"
}

@article{yr-sacma-91
, author =	"C. Yao and J. G. Rokne"
, title =	"A straightforward algorithm for computing the medial axis of a simple polygon"
, journal =	"Internat. J. Comput. Math."
, volume =	39
, year =	1991
, pages =	"51--60"
, keywords =	"design of algorithms, Voronoi diagrams, medial axis, two-dimensional"
, annote =	"$O(k n)$ time"
}

@article{yr-fc-91
, author =	"C. Yao and J. G. Rokne"
, title =	"Fat curves"
, journal =	"Comput. Graph. Forum"
, volume =	10
, year =	1991
, pages =	"237--248"
, keywords =	"digital geometry, computer graphics, design of algorithms, approximation, incrementation, curves, two-dimensional"
}

@inproceedings{y-3spia-83
, author =	"F. F. Yao"
, title =	"A $3$-space partition and its applications"
, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
, year =	1983
, pages =	"258--263"
, precedes =	"ydep-psrq-89"
}

@incollection{y-cg-90
, author =	"F. F. Yao"
, title =	"Computational Geometry"
, editor =	"R. A. Earnshaw and B. Wyvill"
, booktitle =	"Algorithms in Complexity"
, publisher =	"Elsevier"
, address =	"Amsterdam"
, year =	1990
, pages =	"345--490"
, keywords =	"survey paper"
, update =	"97.03 pocchiola, 93.09 goodrich"
}

@inproceedings{y-edpuq-80
, author =	"F. F. Yao"
, title =	"Efficient dynamic programming using quadrangle inequalities"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
, year =	1980
, pages =	"429--435"
}

@techreport{y-fmesp-74
, author =	"F. F. Yao"
, title =	"On finding the maximal elements in a set of plane vectors"
, type =	"Report"
, number =	"R-667"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1974
}

@inproceedings{y-pahsa-80
, author =	"F. F. Yao"
, title =	"On the priority approach to hidden-surface algorithms"
, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1980
, pages =	"301--307"
}

@article{ydep-psrq-89
, author =	"F. F. Yao and D. P. Dobkin and H. Edelsbrunner and M. S. Paterson"
, title =	"Partitioning space for range queries"
, journal =	"SIAM J. Comput."
, volume =	18
, number =	2
, year =	1989
, pages =	"371--384"
, keywords =	"$d$-dimensional, searching, range search"
, succeeds =	"y-3spia-83"
, update =	"97.11 bibrelex"
}

@techreport{y-amp-85
, author =	"C. Yap"
, title =	"Algorithmic Motion Planning"
, type =	"Manuscript"
, institution =	"??"
, year =	1985
, update =	"98.03 bibrelex"
}

@inproceedings{y-elr-93
, author =	"Chee Yap"
, title =	"Euclidean Lattice Reduction"
, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, site =	"Hagen"
, publisher =	"FernUniversit{\"a}t Hagen"
, year =	1993
, pages =	26
, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
}

@article{y-tegc-97
, author =	"C. Yap"
, title =	"Towards exact geometric computation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, number =	1
, year =	1997
, pages =	"3--23"
, succeeds =	"y-tegc-93"
, update =	"98.07 tamassia, 97.03 devillers, 96.09 devillers"
}

@inproceedings{y-wcbpc-87
, author =	"C. Yap"
, title =	"What can be parallelized in Computational Geometry?"
, editor =	"A. Albrecht and H. Jung and K. Mehlhorn"
, booktitle =	"Parallel Algorithms and Architectures. Proc. Internat. Workshop Suhl (Germany), May 25--30, 1987"
, series =	"Math. Res."
, volume =	38
, publisher =	"Akademie-Verlag"
, address =	"Berlin, East Germany"
, year =	1987
, pages =	"184--195"
, comments =	"Zbl. 625.68052"
, update =	"93.09 rote"
}

@inproceedings{y-gctsp-88
, author =	"C. K. Yap"
, title =	"A geometric consistency theorem for a symbolic perturbation scheme"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"134--142"
, precedes =	"y-gctsp-90"
, cites =	"b-gbamp-85, c-odlp-52, c-lp-83, dmy-aobgn-86, e-esaa-86, em-sstcd-87, ew-chsct-86, my-ngb-86, r-tgs-86, r-topr-85, y-stgd-87, ZZZ"
, update =	"98.03 bibrelex"
}

@article{y-gctsp-90
, author =	"C. K. Yap"
, title =	"A geometric consistency theorem for a symbolic perturbation scheme"
, journal =	"J. Comput. Syst. Sci."
, volume =	40
, number =	1
, year =	1990
, pages =	"2--18"
, succeeds =	"y-gctsp-88"
, update =	"98.11 bibrelex"
}

@incollection{y-amp-87
, author =	"C.-K. Yap"
, title =	"Algorithmic motion planning"
, editor =	"J. T. Schwartz and C.-K. Yap"
, booktitle =	"Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
, publisher =	"Lawrence Erlbaum Associates"
, address =	"Hillsdale, NJ"
, year =	1987
, pages =	"95--143"
, keywords =	"survey paper, motion planning, Voronoi diagrams, decomposition, cell complexes, lower bounds"
}

@techreport{y-oavds-84
, author =	"C. K. Yap"
, title =	"An {$O(n \log n)$} algorithm for the {Voronoi} diagram of a set of simple curve segments"
, type =	"Technical {Report}"
, institution =	"Courant Inst., New York Univ."
, address =	"New York, NY"
, month =	oct
, year =	1984
, update =	"97.11 bibrelex"
}

@article{y-oavds-87
, author =	"C. K. Yap"
, title =	"An {$O(n \log n)$} algorithm for the {Voronoi} diagram of a set of simple curve segments"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"365--393"
}

@techreport{y-cmsd-84
, author =	"C. K. Yap"
, title =	"Coordinating the motion of several discs"
, type =	"Report"
, number =	"TR 105"
, institution =	"Comput. Sci. Div., New York Univ."
, address =	"New York, NY"
, year =	1984
}

@incollection{y-ecgtm-95
, author =	"C. K. Yap"
, title =	"Exact computational geometry and tolerancing metrology"
, editor =	"D. Avis and J. Bose"
, booktitle =	"Snapshots of Computational and Discrete Geometry, Vol.~3, Tech. Rep. SOCS-94.50"
, publisher =	"McGill School of Comp. Sci."
, year =	1995
, update =	"96.09 orourke"
}

@techreport{y-fabor-82
, author =	"C. K. Yap"
, title =	"Fast algorithms for boolean operations on rectilinear regions"
, type =	"Report"
, number =	"??"
, institution =	"Courant Inst. Math. Sci., New York Univ."
, address =	"New York, NY"
, year =	1982
}

@inproceedings{y-furpi-92
, author =	"Chee K. Yap"
, title =	"Fast Unimodular Reduction: {Planar} Integer Lattices"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"437--446"
, update =	"94.01 smid, 93.09 milone+mitchell"
}

@book{y-fpaa-93
, author =	"C. K. Yap"
, title =	"Fundamental Problems in Algorithmic Algebra"
, publisher =	"Princeton University Press"
, year =	1993
, update =	"98.07 bibrelex, 98.03 bibrelex"
}

@article{y-hmctd-87
, author =	"C. K. Yap"
, title =	"How to move a chair through a door"
, journal =	"Internat. J. Robot. Autom."
, volume =	"RA-3"
, number =	3
, year =	1987
, pages =	"172--181"
, keywords =	"motion planning"
}

@article{y-mcgwr-95
, author =	"C. K. Yap"
, title =	"Manufacturing and Computational Geometry Workshop Report"
, journal =	"Computational Science and Engineering"
, volume =	"??"
, year =	1995
, pages =	"82--84"
, update =	"98.07 bibrelex, 95.09 mitchell"
}

@unpublished{y-nwmcg-94
, author =	"C. K. Yap"
, title =	"NSF Workshop on Manufacturing and Computational Geometry"
, month =	jun
, year =	1994
, note =	"April 1, 1994; preliminary report"
, update =	"95.01 mitchell"
}

@techreport{y-ptptc-87
, author =	"C. K. Yap"
, title =	"Parallel Triangulation of a Polygon in Two Calls to the Trapezoidal Map"
, type =	"Manuscript"
, institution =	"??"
, year =	1987
, update =	"97.11 bibrelex"
}

@article{y-ptptc-88
, author =	"C. K. Yap"
, title =	"Parallel triangulation of a polygon in two calls to the trapezoidal map"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"279--288"
, keywords =	"parallel computation, triangulation, polygon"
}

@techreport{y-ptspt-87
, author =	"C. K. Yap"
, title =	"Parallel Triangulation of a Simple Polygon in Three Calls to the Trapezoidal Map"
, institution =	"Robotics Lab, Courant Institute of Mathematical Sciences, New York University"
, address =	"NY 10012, USA"
, month =	mar
, year =	1987
, update =	"93.09 held"
}

@incollection{y-rgc-97
, author =	"C. K. Yap"
, title =	"Robust geometric computation"
, chapter =	35
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"653--668"
, update =	"97.11 orourke"
}

@article{y-stgd-
, author =	"C. K. Yap"
, title =	"Symbolic treatment of geometric degeneracies"
, journal =	"Lecture Notes in Control and Information Science"
, volume =	113
, pages =	"348--358"
, succeeds =	"y-stgd-87"
, update =	"98.11 bibrelex"
}

@inproceedings{y-stgd-87
, author =	"C. K. Yap"
, title =	"Symbolic treatment of geometric degeneracies"
, booktitle =	"Proc. 13th IFIP Conf. System Modelling and Optimization"
, site =	"Tokyo, Japan"
, year =	1987
, pages =	"348--358"
, precedes =	"y-stgd-, y-stgd-90"
, update =	"98.11 bibrelex"
}

@article{y-stgd-90
, author =	"C. K. Yap"
, title =	"Symbolic treatment of geometric degeneracies"
, journal =	"J. Symbolic Comput."
, volume =	10
, year =	1990
, pages =	"349--370"
, succeeds =	"y-stgd-87"
}

@inproceedings{y-tegc-93
, author =	"C. K. Yap"
, title =	"Towards Exact Geometric Computation"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"405--419"
, precedes =	"y-tegc-97"
, cites =	"brv-ipam-89, cot-liais-87, dst-casaa-88, ds-rgnap-88, dy-biecg-93, e-acg-87, em-sstcd-88, ft-ousls-86, f-nsa2d-92, fv-eeacg-93, h-gsm-89, kln-edtur-91, ps-cgi-85, ss-pmp2g-83, sbv-hslim-90, si-tdpga-89, si-gafpa-88, si-nsmvd-88, s-rgwtd-93, svh-bpepa-89, r-hrrc-83, y-gctsp-90, y-stgd-90, y-fpaa-93, y-easm-92, ZZZ"
, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 devillers, 96.09 orourke"
}

@inproceedings{ya-mpce-89
, author =	"Chee K. Yap and Helmut Alt"
, title =	"Motion Planning in the CL-Environment"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, site =	"Ottawa, Canada"
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"373--380"
, update =	"98.11 bibrelex, 96.05 agarwal, 95.01 schwarzkopf"
}

@inproceedings{yc-imgt-96
, author =	"C. K. Yap and E.-C. Chang"
, title =	"Issues in the metrology of geometric tolerancing"
, editor =	"M. Overmars"
, booktitle =	"Proc. Workshop on Algorithmic Robotics"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1996
, note =	"To appear"
, update =	"98.07 bibrelex"
}

@incollection{yc-imgt-97
, author =	"C. K. Yap and E.-C. Chang"
, title =	"Issues in the metrology of geometric tolerancing"
, editor =	"J.-P. Laumond and M. H. Overmars"
, booktitle =	"Robotics Motion and Manipulation"
, publisher =	"A.K. Peters"
, year =	1997
, pages =	"393--400"
, update =	"98.03 agarwal"
}

@incollection{yd-ecp-95
, author =	"C. K. Yap and T. Dub{\'e}"
, title =	"The exact computation paradigm"
, editor =	"D.-Z. Du and F. K. Hwang"
, booktitle =	"Computing in Euclidean Geometry"
, series =	"Lecture Notes Series on Computing"
, volume =	4
, edition =	"2nd"
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"452--492"
, keywords =	"survey paper, numeral computing, exact compuation, fixed-precision, multiprecision number packages"
, update =	"98.07 icking+vismara, 97.11 icking, 97.03 devillers+pocchiola"
, abstract =	"A survey of the approaches to non-robustness of geometric algorithms, and especially the exact computation approach. Also surveys available big-number packages."
}

@inproceedings{ys-dchhd-81
, author =	"M. Yau and S. N. Srihari"
, title =	"Digital convex hulls from hierarchical data structures"
, booktitle =	"Proc. Canadian Man-Comput. Comm. Soc. Conf."
, year =	1981
, pages =	"163--171"
}

@article{ys-hdsmd-83
, author =	"M.-M. Yau and S. N. Srihari"
, title =	"A hierarchical data structure for multidimensional digital images"
, journal =	"Commun. ACM"
, volume =	26
, number =	7
, year =	1983
, pages =	"504--515"
, update =	"97.11 bibrelex"
}

@inproceedings{yo-smi-96
, author =	"N. Yazdani and Z. M. Ozsoyoglu"
, title =	"Sequence matching of images"
, booktitle =	"Proc. 8th Internat Conf. on Scientific and Statistical Database Management"
, year =	1996
, pages =	"53--62"
, update =	"98.07 bibrelex"
}

@inproceedings{yn-gircc-94
, author =	"X. Ye and H. Nowacki"
, title =	"{$G^1$} Interpolation of Rectangular Cubic Curve Meshes Using Biquintic {B{\'e}zier} Patches"
, booktitle =	"The 6th IMA Conference on Mathematics of Surface VI"
, year =	1994
, update =	"95.05 abrams"
}

@article{ys-fpgdc-93
, author =	"K. Yeap and M. Sarrafzadeh"
, title =	"Floor-planning by graph dualization: 2-concave rectiliear modules"
, journal =	"SIAM J. Comput."
, volume =	22
, number =	3
, month =	jun
, year =	1993
, pages =	"500--526"
, update =	"98.11 bibrelex"
}

@article{yws-opmtd-84
, author =	"Y. Yeh and J. Wilson and S. C. Schwartz"
, title =	"Outage Probability in Mobile Telephony with Directive Antennas and Macrodiversity"
, journal =	"IEEE Trans. Selected Areas in Communication"
, volume =	2
, year =	1984
, pages =	"507--511"
, update =	"98.07 bibrelex"
}

@techreport{y-dtca-88
, author =	"D. Yellin"
, title =	"A Dynamic Transitive Closure Algorithm"
, institution =	"IBM T. J. Watson Research Center"
, year =	1988
, update =	"94.01 tamassia"
}

@inproceedings{y-stapl-79
, author =	"Y. Yemini"
, title =	"Some theoretical aspects of position-location problems"
, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1979
, pages =	"1--8"
}

@article{ys-mqafe-83
, author =	"M. A. Yerry and M. S. Shephard"
, title =	"A Modified Quadtree Approach to Finite Element Mesh Generation"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	3
, number =	1
, year =	1983
, pages =	"39--46"
, annote =	"Generates a FEM from a modified (blocks with cut
		 corners are allowed) quadtree. Mesh is smoothed by
		 moving each node to the centroid of surrounding ones."
}

@inproceedings{y-dsann-93
, author =	"P. N. Yianilos"
, title =	"Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"311--321"
, update =	"93.05 smid"
}

@inproceedings{y-gfpuk-95
, author =	"S. M. Yiu"
, title =	"A Generalized Fortress Problem using $k$-Consecutive Vertex Guards"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"139--144"
, update =	"95.09 jones"
}

@techreport{yc-egf-94t
, author =	"S. M. Yiu and A. Choi"
, title =	"Edge Guards on A Fortress"
, type =	"Technical Report"
, number =	"94-06"
, institution =	"Dept. of Computer Science, University of Hong Kong"
, year =	1994
, succeeds =	"yc-egf-94"
, update =	"98.11 bibrelex"
}

@inproceedings{yc-egf-94
, author =	"S. M. Yiu and A. Choi"
, title =	"Edge Guards on a Fortress"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"296--301"
, precedes =	"yc-egf-94t"
, cites =	"bs-tbegm-92t, bs-tbegm-92, o-agta-87, s-rrag-92, sd-csegs-91, v-egpsp-93, yc-egf-94t, ghks-ggprp-94t, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@incollection{y-cdcrc-75
, author =	"P. Yoeli"
, title =	"Compilation of data for computer-assisted relief cartography"
, editor =	"J. C. Davis and M. J. McCullagh"
, booktitle =	"Display and Analysis of Spatial Data"
, publisher =	"John Wiley \& Sons"
, address =	"New York"
, year =	1995
, pages =	"352--367"
, keywords =	"minimum-weight triangulations, data interpolation"
, update =	"99.11 bibrelex, 98.07 bibrelex, 97.11 bibrelex, 97.03 rote"
}

@article{y-laml-72
, author =	"P. Yoeli"
, title =	"The Logic of Automated Map Lettering"
, journal =	"Cardographic J."
, volume =	9
, year =	1972
, pages =	"99--108"
, update =	"97.11 bibrelex"
}

@article{ysy-smbnp-94
, author =	"Norimasa Yoshida and Masato Shyokawa and Fujio Yamaguchi"
, title =	"Solid modeling based on a new paradigm"
, journal =	"Comput. Graph. Forum"
, volume =	13
, number =	3
, year =	1994
, pages =	"55--64"
, note =	"Proc. EUROGRAPHICS '94"
, keywords =	"solid modeling, robustness, boundary representation"
, update =	"95.09 korneenko"
}

@techreport{y-vsrt-87
, author =	"S. Youssef"
, title =	"Vectorized simulation and ray tracing"
, type =	"Report"
, number =	"FSU-SCRI-87-63"
, institution =	"Supercomputer Comput. Res. Inst., Florida State Univ."
, address =	"Tallahassee, FL"
, year =	1987
}

@phdthesis{y-easm-91
, author =	"J. Yu"
, title =	"Exact Arithmetic Solid Modeling"
, school =	"Purdue University, CS Dept., West Lafayette, IN 47907, USA"
, month =	dec
, year =	1991
, keywords =	"numerical precision, stability, robustness"
, precedes =	"y-easm-92"
, update =	"98.11 bibrelex, 93.09 held"
}

@techreport{y-easm-92
, author =	"Jiaxun Yu"
, title =	"Exact arithmetic solid modeling"
, type =	"Technical Report"
, number =	"CSD-TR-92-037"
, institution =	"Comput. Sci. Dept., Purdue University"
, month =	jun
, year =	1992
, succeeds =	"y-easm-91"
, update =	"98.11 bibrelex"
}

@inproceedings{yd-slfrr-95
, author =	"M.-F. Yu and W. W.-M. Dai"
, title =	"Single-layer fanout routing and routability analysis for ball grid arrays"
, booktitle =	"Proc. IEEE/ACM Internat. Conf. on CAD"
, year =	1995
, pages =	"581--586"
, update =	"98.07 bibrelex"
}

@inproceedings{ydd-iprap-96
, author =	"M.-F. Yu and J. Darnauer and W. W.-M. Dai"
, title =	"Interchangeable pin routing with applications to package layout"
, booktitle =	"Proc. IEEE/ACM Internat. Conf. on CAD"
, year =	1996
, pages =	"668--673"
, update =	"98.07 bibrelex"
}

@inproceedings{yks-dqtfl-96
, author =	"S. Yu and M. van Kreveld and J. Snoeyink"
, title =	"Drainage queries in {TINs}: from local to global and back again"
, booktitle =	"Proc. 7th Internat. Sympos. Spatial Data Handling"
, year =	1996
, pages =	"13A.1--13A.14"
, update =	"98.07 oostrum"
}

@inproceedings{ygd-c3ddm-91
, author =	"X. Yu and J. A. Goldack and L. Dong"
, title =	"Constructing 3D Discrete Medial Axis"
, booktitle =	"Proc. ACM Sympos. Solid Modeling Found. and CAD/CAM Applic."
, site =	"Austin, TX, USA"
, year =	1991
, pages =	"481--492"
, update =	"95.09 agarwal, 95.01 held"
}

@article{yth-haafe-91
, author =	"M. M. F. Yuen and S. T. Tan and K. Y. Hung"
, title =	"A Hierarchical Approach to Automatic Finite-Element Mesh Generation"
, journal =	"Internat. J. Numer. Methods Eng."
, volume =	32
, number =	3
, year =	1991
, pages =	"501--525"
, annote =	"Uses Watson's for 3DDT. Fixes slivers with local
		 changes."
, abstract =	"A point-based two-stage hierarchical method for
		 automatic finite element mesh generation from a solid
		 model is presented. Given the solid model of a
		 component and the required nodal density distribution,
		 nodes are generated according to the hierarchy -
		 vertex, edge, face and solid. At the vertices, nodes
		 are established naturally. Nodes on the edges, faces
		 and inside the solid model are generated by recursive
		 subdivision. The nodes are then connected to form a
		 valid and well-conditioned finite element mesh of
		 tetrahedron elements using modified Delaunay
		 Triangulation. Checks are conducted to ensure the
		 compatibility of geometry and topology between the
		 solid model and the mesh. (Author abstract) 35 Refs."
}

@article{y-tinn-76
, author =	"T. P. Yunck"
, title =	"A technique to identify nearest neighbors"
, journal =	"IEEE Trans. Syst. Man Cybern."
, volume =	"SMC-6"
, year =	1976
, pages =	"678--683"
}

@article{y-fnnkd-75
, author =	"G. Yuval"
, title =	"Finding near neighbors in $k$-dimensional space"
, journal =	"Inform. Process. Lett."
, volume =	3
, year =	1975
, pages =	"113--114"
}

@article{y-fnn-76
, author =	"G. Yuval"
, title =	"Finding nearest neighbors"
, journal =	"Inform. Process. Lett."
, volume =	5
, year =	1976
, pages =	"63--65"
}

@techreport{y-md2s-76
, author =	"G. Yuval"
, title =	"The mean distance in $2$-space"
, type =	"Report"
, number =	"??"
, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
, address =	"Pittsburgh, PA"
, year =	1976
}

@inproceedings{y-t2d3d-89
, author =	"Mariette Yvinec"
, title =	"Triangulation in {2D} and {3D} Space"
, booktitle =	"Proc. of the Workshop on Geometry and Robotics"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"275--291"
, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 96.09 agarwal, 93.09 smid"
, annote =	"Survey paper"
}

@inproceedings{z-rcdda-98
, author =	"Gabriel Zachmann"
, title =	"Rapid Collision Detection by Dynamically Aligned {DOP}-Trees"
, booktitle =	"Proc. of IEEE Virtual Reality Annual International Symposium; VRAIS '98"
, site =	"Atlanta, Georgia"
, month =	mar
, year =	1998
, update =	"00.11 smid, 00.07 zachmann"
}

@techreport{z-wwcbs-80
, author =	"N. Zadeh"
, title =	"What is the worst case behavior of the simplex algorithm?"
, type =	"Technical Report"
, number =	27
, institution =	"Dept. Operations Research, Stanford University"
, year =	1980
, update =	"97.03 gaertner+salinger"
}

@article{z-gtmdg-71
, author =	"C. T. Zahn"
, title =	"Graph-therorectical methods for detecting gestalt clusters"
, journal =	"IEEE Trans. Comput."
, volume =	"C-20"
, year =	1971
, pages =	"68--86"
, update =	"97.11 bibrelex"
}

@article{zc-utapp-99
, author =	"B. {\v Z}alik and G. J. Clapworthy"
, title =	"A Universal Trapezoidation Algorithm for Planar Polygons"
, journal =	"Comput. \& Graphics"
, volume =	23
, number =	3
, month =	jun
, year =	1999
, pages =	"353--363"
, update =	"00.03 held"
}

@article{z-tcfha-91
, author =	"T. Zamfirescu"
, title =	"On two conjectures of {Franz} {Hering} about convex surfaces"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"163--169"
}

@inproceedings{z-asbim-78
, author =	"P. Zamperoni"
, title =	"Analysis and synthesis of binary images by means of convex blobs"
, booktitle =	"Proc. Internat. Conf. on Digital Signal Processing"
, site =	"Florence, Italy"
, year =	1978
, pages =	"181--188"
}

@inproceedings{z-bdkeb-78
, author =	"P. Zamperoni"
, title =	"Bilddarstellung durch konvexe elementarmuster {Bildverarbeitung} und {Musterekennung}"
, editor =	"E. Triendl"
, booktitle =	"DAGM Sympos."
, publisher =	"Informatik-Fachberichte, Springer-Verlag"
, year =	1978
, pages =	"145--154"
}

@inproceedings{z-sgcrg-82
, author =	"P. Zamperoni"
, title =	"Sequential growth of convex regions for grey-scale image analysis"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
, year =	1982
, pages =	"912--914"
}

@book{zs-ca1-58
, author =	"O. Zariski and P. Samuel"
, title =	"Commutative Algebra"
, volume =	1
, publisher =	"Springer-Verlag"
, year =	1958
, precedes =	"zs-ca2-58"
, update =	"97.11 bibrelex"
}

@book{zs-ca2-58
, author =	"O. Zariski and P. Samuel"
, title =	"Commutative Algebra"
, volume =	2
, publisher =	"Springer-Verlag"
, year =	1958
, succeeds =	"zs-ca1-58"
, update =	"97.11 bibrelex"
}

@article{z-catd-77
, author =	"T. Zaslavsky"
, title =	"A combinatorial analysis of topological dissections"
, journal =	"Adv. Math."
, volume =	25
, year =	1977
, pages =	"267--285"
, update =	"98.03 agarwal"
}

@book{z-fuafc-75
, author =	"T. Zaslavsky"
, title =	"Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes"
, series =	"Memoirs Amer. Math. Soc."
, volume =	154
, publisher =	"American Mathematical Society"
, address =	"Providence, RI"
, year =	1975
, isbn =	"0-8218-1854-6"
, keywords =	"doctoral thesis"
, comments =	"substantially the author's thesis, Massachusetts Inst. Tech."
, update =	"97.11 bibrelex, 95.09 korneenko+mitchell"
}

@book{z-tdm-96
, title =	"Teubner-Taschenbuch der {Mathematik}"
, editor =	"E. Zeidler"
, publisher =	"B. G. Teubner"
, address =	"Leipzig"
, year =	1996
, note =	"Begr{\"u}ndet von {I.} {N.} {Bronstein} und {K.} {A.} {Semendjajew},
		 weitergef{\"u}hrt von {G.} {Grosche}, {V.} {Ziegler} und {D.} {Ziegler}"
, update =	"00.03 bibrelex"
}

@techreport{z-f11aa-92
, author =	"A. Zelikovsky"
, title =	"A faster $11/6$-approximation algorithm for the {Steiner} tree problem in graphs"
, type =	"Report"
, number =	"MPI-I-92-122"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
}

@techreport{z-mbwkp-92
, author =	"A. Zelikovsky"
, title =	"Minimum base of weighted $k$-polymatroid and {Steiner} tree problem"
, type =	"Report"
, number =	"MPI-I-92-121"
, institution =	"Max-Planck-Institut Inform."
, address =	"Saarbr{\"u}cken, Germany"
, year =	1992
}

@inproceedings{zl-mbt-93
, author =	"A. Zelikovsky and D. Lozevanu"
, title =	"Minimal and bounded trees"
, booktitle =	"Tezele Cong. XVIII Acad. Romano-Americane, Kishinev"
, year =	1993
, pages =	"25--26"
, update =	"95.09 mitchell"
}

@incollection{z-1aasp-92
, author =	"A. Z. Zelikovsky"
, title =	"An $11/8$-approximation algorithm for the {Steiner} problem on networks with rectilinear distance"
, booktitle =	"Sets, Graphs and Nubers"
, series =	"Colloquia Mathematica Societatis J{\'a}nos Bolyai"
, volume =	60
, publisher =	"??"
, year =	1992
, pages =	"733--745"
, update =	"98.07 bibrelex"
}

@techreport{z-babne-96
, author =	"A. Z. Zelikovsky"
, title =	"Better Approximation Bounds for the Network and {Euclidean} {Steiner} Tree Problems"
, type =	"Technical Report"
, number =	"CS-96-06"
, institution =	"University of Virginia, Charlottesville, VA"
, year =	1996
, update =	"98.03 mitchell"
, annote =	"Was written in 1994 at Institute of Mathematics, Kishinev Moldova
and submitted for publication"
, abstract =	"
The network and Euclidean Steiner tree problems require a shortest
tree spanning a given vertex subset within a network G=(V,E,d) and
Euclidean plane, respectively. For these problems, we present a series of
heuristics finding approximate Steiner trees with performance
guarantees coming arbitrary close to 1+ln 2= 1.693... and 1+ln(2/sqrt3) =
1.1438..., respectively. The best previously known corresponding
values are close to 1.746 and 1.1546."
}

@article{z-ltras-87
, author =	"E. Zemel"
, title =	"A linear time randomizing algorithm for searching ranked functions"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"81--90"
, update =	"97.03 agarwal, 96.05 agarwal"
}

@inproceedings{z-hpspp-93
, author =	"Zhenbing Zeng"
, title =	"Heilbronn Problem for Six Points in a Planar Convex Body"
, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
, month =	jun
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ze-cacha-01
, author =	"Kyriakos Zervoudakis and Ioannis Z. Emiris"
, title =	"A Comparative Application of Convex Hull Algorithms in Two and Three Dimensions"
, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
, nickname =	"CG 2001"
, site =	"Berlin"
, publisher =	"Freie Universit{\"a}t Berlin"
, year =	2001
, pages =	"101--104"
, update =	"01.04 icking"
}

@inproceedings{zb-cstsm-86
, author =	"D. Zhang and A. Bowyer"
, title =	"{CSG} set-theoretic solid modeling and {NC} machining of blend surfaces"
, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
, year =	1986
, pages =	"236--245"
}

@techreport{zmhh-vcuho-97t
, author =	"H. Zhang and D. Manocha and T. Hudson and K. Hoff"
, title =	"Visibility culling using hierarchical occlusion maps"
, type =	"Technical {Report}"
, number =	"TR97-004"
, institution =	"Dept. Comput. Sci., Univ. North Carolina"
, address =	"Chapel Hill, NC"
, year =	1997
, update =	"98.07 bibrelex"
}

@inproceedings{zmhh-vcuho-97
, author =	"Hansong Zhang and Dinesh Manocha and Tom Hudson and Kenneth E. Hoff III"
, title =	"Visibility Culling using Hierarchical Occlusion Maps"
, booktitle =	"SIGGRAPH 97 Conference Proceedings"
, series =	"Annual Conference Series"
, organization =	"ACM SIGGRAPH"
, publisher =	"ACM Press"
, year =	1997
, pages =	"77--88"
, cites =	"hh-asgca-85t, hh-qbs-85, hh-pmbsc-85, l-pagaa-44, ms-bsstv-85a, pg-aldit-84, r-cgcg-72, sa-irpcs-84, wb-bfpsm-86, wq-recvm-82, wq-dgvmr-80, w-cs-86, ZZZ"
, update =	"99.11 bibrelex, 98.03 agarwal+bibrelex+mitchell"
}

@article{zomk-insru-00
, author =	"H.-K. Zhao and S. Osher and B. Merriman and M. Kang"
, title =	"Implicit Nonparametric Shape Reconstruction from Unorganized Points Using a Variational Level Set Method"
, journal =	"Computer Vision and Image Understanding"
, volume =	80
, number =	3
, year =	2000
, pages =	""
, update =	"01.07 devillers"
}

@article{zb-ikpnp-94
, author =	"Jianmin Zhao and Norman I. Badler"
, title =	"Inverse Kinematics Positioning Using Nonlinear Programming for Highly Articulated Figures"
, journal =	"ACM Trans. Graph."
, volume =	13
, number =	4
, year =	1994
, pages =	"313--336"
, update =	"02.03 orourke"
}

@inproceedings{z-ltacr-89
, author =	"R. Zhao"
, title =	"Linear-time algorithms for computing reachability regions from polygonal figures"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"163--170"
}

@phdthesis{z-pet-90
, author =	"R. Y. Zhao"
, title =	"Placements of {Euclidean} trees"
, school =	"School Comput. Sci., McGill Univ."
, address =	"Montreal, PQ"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"98.07 bibrelex"
}

@article{zsp-cspdf-93
, author =	"J. Zhou and E. C. Sherbrooke and N. M. Patrikalakis"
, title =	"Computation of Stationary Points of Distance Functions"
, journal =	"Engineering with Computers"
, volume =	9
, number =	4
, year =	1993
, pages =	"231--246"
, update =	"95.05 abrams"
}

@article{zszz-cctdt-90
, author =	"Jian-Ming Zhou and Ke-Ran Shao and Ke-Ding Zhou and Qiong-Hua Zhan"
, title =	"Computing Constrained Triangulation And {Delaunay} Triangulation: {A} New Algorithm"
, journal =	"IEEE Trans. Magn."
, volume =	26
, number =	2
, month =	mar
, year =	1990
, pages =	"694--697"
, keywords =	"triangulation, finite-element mesh generation, constrained triangulation, Delaunay triangulation"
, annote =	"CDT in 3D. Generalized Watson's algorithm."
, abstract =	"A novel algorithm for computing optimal constrained
		 triangulation is presented which is equally applicable
		 to 2-D and 3-D optimal constrained triangulation and
		 Delaunay triangulation. This algorithm has no
		 degenerate and near-degenerate problems. The same
		 amount of time is needed to add a new point to an
		 existing mesh of any element number provided that the
		 element it belongs to has been predetermined, as in the
		 self-adaptive finite-element analysis process. This
		 algorithm has been applied to finite- element mesh
		 generation. Test results are given. 11 Refs."
}

@article{zzs-ag3dm-92
, author =	"J. M. Zhou and K. D. Zhou and K. R. Shao"
, title =	"Automatic-Generation of 3{D} Meshes for Complicated Solids"
, journal =	"IEEE Trans. Magn."
, volume =	28
, number =	2
, year =	1992
, pages =	"1759--1762"
}

@phdthesis{z-ssgc-00
, author =	"Y. Zhou"
, title =	"Shape Sensitive Geometric Complexity"
, school =	"Washington University"
, year =	2000
, note =	"St. Louis, MO, USA."
, keywords =	"doctoral thesis"
, update =	"01.04 orourke"
}

@article{zkt-tdscg-98
, author =	"Y. Zhou and A. Kaufman and A. W. Toga"
, title =	"Three-Dimensional Skeleton and Centerline Generation Based on an Approximate Minimum Distance Field"
, journal =	"Visual Comput."
, volume =	14
, number =	7
, year =	1998
, pages =	"303--314"
, update =	"99.03 held"
}

@inproceedings{zs-ssgp-01
, author =	"Y. Zhou and S. Suri"
, title =	"Shape Sensitive Geometric Permutations"
, booktitle =	"Proc. 12th ACM-SIAM Sympos. Discrete Algorithms"
, nickname =	"SODA '01"
, year =	2001
, pages =	"234--243"
, update =	"01.04 orourke"
}

@article{z-rtatd-85
, author =	"Z. Y. Zhou"
, title =	"A real time algorithm for two-dimensional convex hull problem ({Chinese} {English} summary)"
, journal =	"Chinese J. Comput."
, volume =	8
, year =	1985
, pages =	"136--143"
}

@article{z-acpap-97
, author =	"B. Zhu"
, title =	"Approximating convex polyhedra with axis-parallel boxes"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	7
, year =	1997
, pages =	"253--267"
, update =	"97.07 devillers"
}

@article{z-cswpt-97
, author =	"Binhai Zhu"
, title =	"Computing the shortest watchtower of a polyhedral terrain in {$O(n \log n)$} time"
, journal =	"Comput. Geom. Theory Appl."
, volume =	8
, number =	4
, year =	1997
, pages =	"181--193"
, succeeds =	"z-iacsw-92"
, update =	"98.03 mitchell"
}

@inproceedings{z-frsdt-97
, author =	"Binhai Zhu"
, title =	"Fast Range Searching with {Delaunay} Triangulations"
, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
, nickname =	"COCOON '97"
, site =	"Shanghai, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	1276
, publisher =	"Springer-Verlag"
, year =	1997
, pages =	"52--61"
, update =	"99.11 bibrelex, 98.03 mitchell"
}

@inproceedings{z-fcgsm-94
, author =	"B. Zhu"
, title =	"Further Computational Geometry in Secondary Memory"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, site =	"Beijing, China"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"514--522"
, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
}

@inproceedings{z-iacsw-92
, author =	"B. Zhu"
, title =	"Improved algorithms for computing the shortest watchtower of polyhedral terrains"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"286--291"
, precedes =	"z-cswpt-97"
, cites =	"ce-oails-88, cg-fc1ds-86, cs-vppt-89, cs-agpli-90, dk-ladsc-85, dz-irls-94, k-osps-83, s-swrpp-88, ZZZ"
, update =	"98.07 bibrelex, 98.03 mitchell"
}

@inproceedings{z-idcmt-94
, author =	"B. Zhu"
, title =	"Intersection Detection and Computation of {Manhattan} Terrains"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"256--262"
, cites =	"b-akrp-77, ce-oails-92, cegs-lscaa-89, cg-fc1ds-86, c-oaitd-92, b-earsh-92, egs-oplms-86, gp-narlp-92, ht-fafnc-84, k-osps-83, p-lmps3-93, ps-cgi-85, pt-fdplm-89, s-swrpp-88, st-pplup-86, t-dsna-83, wl-arrcd-85, vw-rlsil-82, ZZZ"
, update =	"98.11 bibrelex, 94.09 jones"
}

@inproceedings{z-owlbs-96
, author =	"B. Zhu"
, title =	"On the {$\Omega (n^{4/3})$} weak lower bounds for some {3D} geometric problems"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"270--275"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@inproceedings{zm-sdnah-91
, author =	"B. Zhu and A. Mirzaian"
, title =	"Sorting does not always help in computational geometry"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, month =	aug
, year =	1991
, pages =	"239--242"
, cites =	"agss-ltacv-89, aw-cg-88, f-savd-87, gs-pmgsc-85, lp-cgs-84, ps-cgi-85, s-mplbc-85, y-lbact-89, ZZZ"
, update =	"98.07 bibrelex"
}

@article{zp-eaatl-01
, author =	"B. Zhu and C. K. Poon"
, title =	"Efficient approximation algorithms for two-label point labeling"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	11
, year =	2001
, pages =	"455--464"
, update =	"01.11 smid"
}

@article{zssm-grpgv-96
, author =	"C. Zhu and G. Sundaram and J. Snoeyink and Joseph S. B. Mitchell"
, title =	"Generating Random Polygons with Given Vertices"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"277--290"
, succeeds =	"zssm-grxmp-94"
, update =	"98.03 mitchell, 97.03 devillers+smid"
}

@inproceedings{zssm-grxmp-94
, author =	"C. Zhu and G. Sundaram and J. Snoeyink and Joseph S. B. Mitchell"
, title =	"Generating Random $x$-Monotone Polygons with Given Vertices"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"189--194"
, precedes =	"zssm-grpgv-96"
, cites =	"es-gtr-92, g-eadch-72, ghlst-ltavs-87, gh-ospqs-89, mr-ulbnm-90, ov-grp-91, sz-grmp-93, ls-utstp-82, t-cgpis-89, ZZZ"
, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 devillers+smid, 94.09 jones"
}

@article{zl-nhaeh-91
, author =	"David Zhu and Jean-Claude Latombe"
, title =	"New heuristic algorithms for efficient hierarchical path planning"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	7
, year =	1991
, pages =	"9--20"
, update =	"97.03 schwarzkopf"
}

@inproceedings{zgw-emf-94
, author =	"Y. Zhuang and K. Y. Goldberg and Y.-C. Wong"
, title =	"On the existence of modular fixtures"
, booktitle =	"Proc. 11th IEEE Internat. Conf. Robot. Autom."
, month =	may
, year =	1994
, pages =	"543--549"
, update =	"98.03 bibrelex"
}

@inproceedings{zik-eprtn-98
, author =	"Sergey Zhukov and Andrei Iones and G. Kronin"
, title =	"Environment Preprocessing for Real-Time Navigation of Intelligent Agents"
, booktitle =	"Proc. SCCG'98 Conference in Bratislava ??"
, month =	apr
, year =	1998
, comments =	"
This is Andrei Iones and Sergey Zhukov from St-Petersburg State Technical
University, Russia.
\par
We are studying the problem of intelligent agent navigation in complex
environments. The goal of our research is to develop a technique
(and theoretical foundations) to solve the navigation problem.
We assume that our algorithms must be applicable to the agents
with significantly different locomotion capabilities that live
(navigate) in {\em really} complex 3D environments, including
natural landscapes with caves, stalactites/stalagmites, etc.
Our characters (agents) are spiders, birds, hoppers, etc., so
they have totally different 'walk algorithms'. Since we have
to handle all these creature types motivated us to develop
such 'universal' techniques that:
- enables the agent to explore the environment off-line (it takes
  5 to 30 minutes) and create a representative map;
- navigate in the environment in real-time using the map.
\par
The technology is not heuristic - it can be proved that
the paths found in real-time do not differ much from the
real optimal paths.
Currently, our technology is practically implemented in a
commercial 3D title scheduled this year.
\par
We base our technology on accessibility graphs, not on
road maps/visibility graphs since these methods prove to be
inefficient in our context."
, update =	"98.07 mitchell"
}

@book{z-lp-94
, author =	"G. M. Ziegler"
, title =	"Lectures on Polytopes"
, series =	"Graduate Texts in Mathematics"
, volume =	152
, publisher =	"Springer-Verlag"
, address =	"Heidelberg"
, year =	1994
, keywords =	"polytope, Fourier-Motzkin elimination, Schlegel diagram, shellability, Gale transform, oriented matroid, cyclic polytope, zonotope, permutahedron, associhedron, neighborly polytope, fiber polytope, Lawrence construction, diameter, non-rational polytope, tiling"
, update =	"98.07 agarwal, 95.09 jones, 95.01 korneenko"
, annote =	"advanced textbook on modern theory of convex polytopes"
}

@article{z-wcm-93
, author =	"G. M. Ziegler"
, title =	"``What is a complex matroid''"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"313--348"
, update =	"96.05 pocchiola"
}

@book{z-fem-77
, author =	"O. C. Zienkiewicz"
, title =	"The Finite Element Method"
, edition =	"3rd"
, publisher =	"McGraw-Hill"
, year =	1977
, update =	"98.03 bibrelex"
}

@book{zt-fem-89
, author =	"O. C. Zienkiewicz and R. L. Taylor"
, title =	"The Finite Element Method"
, edition =	"4th"
, publisher =	"McGraw-Hill"
, year =	1989
, update =	"98.03 bibrelex, 97.11 bibrelex"
}

@article{z-udezk-70
, author =	"H. Ziezold"
, title =	"{\"U}ber die {Eckenzahl} zuf{\"a}lliger konvexer {Polygone}"
, journal =	"Izv. Akad. Nauk. Armanj. SSR. Ser. Mat."
, volume =	5
, year =	1970
, pages =	"296--312"
}

@article{z-lsir-91
, author =	"K. Zikan"
, title =	"Least-Squares Image Registration"
, journal =	"ORSA J. Comput."
, volume =	3
, year =	1991
, pages =	"169--172"
}

@techreport{zs-fmir-88
, author =	"K. Zikan and T. M. Silberberg"
, title =	"The {Frobenius} Metric in Image Registration"
, type =	"Report"
, number =	"88-13"
, institution =	"Department of Operations Research, Stanford University"
, year =	1988
, precedes =	"zs-fmir-92"
, update =	"98.07 rote"
}

@incollection{zs-fmir-92
, author =	"Karel Zikan and Theresa M. Silberberg"
, title =	"The {Frobenius} Metric in Image Registration"
, editor =	"L. Shapiro and A. Rosenfeld"
, booktitle =	"Computer Vision and Image Processing"
, publisher =	"Academic Press"
, year =	1992
, pages =	"385--420"
, succeeds =	"zs-fmir-88"
, update =	"98.07 rote"
}

@book{z-epc-93
, author =	"R. Zippel"
, title =	"Effective Polynomial Computation"
, publisher =	"Kluwer Academic Publishers"
, year =	1993
, update =	"98.03 bibrelex"
}

@techreport{z-gcema-92
, author =	"C. Zirkelbach"
, title =	"Geometrisches Clustern --- ein metrischer Ansatz"
, type =	"Dissertation"
, institution =	"Department of Computer Science"
, address =	"Universit{\"a}t W{\"u}rzburg, Germany"
, year =	1992
, update =	"94.05 franciosa"
}

@techreport{z-mbtcp-90
, author =	"C. Zirkelbach"
, title =	"Monotonous bisector trees and clustering problems"
, type =	"Technical Report"
, institution =	"Department of Computer Science"
, address =	"Universit{\"a}t W{\"u}rzburg, Germany"
, year =	1990
, precedes =	"nvz-mbtte-92"
, update =	"94.05 franciosa"
}

@incollection{z-tm-97
, author =	"R. T. {\v Zivaljevi\'c}"
, title =	"Topological methods"
, chapter =	11
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press LLC"
, address =	"Boca Raton, FL"
, year =	1997
, pages =	"209--224"
, update =	"97.11 orourke"
}

@article{zv-ehst-90
, author =	"R. T. {\v Z}ivaljevi{\'c} and S. T. Vre{\'c}ica"
, title =	"An extension of the ham sandwich theorem"
, journal =	"Bull. London Math. Soc."
, volume =	22
, year =	1990
, pages =	"183--186"
, update =	"95.01 matousek"
}

@techreport{z-tcg-78
, author =	"J. E. Zolnowsky"
, title =	"Topics in computational geometry"
, type =	"Report"
, number =	"STAN-CS-78-659"
, institution =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, year =	1978
, update =	"97.11 bibrelex"
}

@inproceedings{ze-fsbi-00
, author =	"Afra Zomorodian and Herbert Edelsbrunner"
, title =	"Fast Software for Box Intersections"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
, year =	2000
, pages =	"129--138"
, update =	"00.11 jones"
}

@article{z-gccbc-92
, author =	"A. Zucco"
, title =	"The generic contact of convex bodies with circumscribed homothets of a convex surface"
, journal =	"Discrete Comput. Geom."
, volume =	7
, year =	1992
, pages =	"319--323"
}

@incollection{z-clahe-94
, author =	"Karel Zuiderveld"
, title =	"Contrast Limited Adaptive Histogram Equalization"
, editor =	"Paul Heckbert"
, booktitle =	"Graphics Gems IV"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1994
, pages =	"474--485"
, keywords =	"contrast enhancement"
, update =	"94.09 heckbert"
, annote =	"Presents a contrast enhancement technique that overcomes
some of the flaws of simple histogram equalization, such as noise
amplification and suppression of local contrast. Contains C code."
}

@article{z-pmris-80
, author =	"N. Zvegintzov"
, title =	"Partial-match retrieval in an index sequential directory"
, journal =	"Comput. J."
, volume =	23
, year =	1980
, pages =	"37--40"
}

@article{zjh-scpc-87
, author =	"M. J. Zyda and A. R. Jones and P. G. Hogan"
, title =	"Surface construction from planar contours"
, journal =	"Computers and Graphics"
, volume =	11
, year =	1987
, pages =	"393--408"
, update =	"98.03 bibrelex"
}

@book{gg-mca-99
, author =      "Joachim von zur Gathen and J{\"u}rgen Gerhard"
, title =       "Modern Computer Algebra"
, publisher =   "Cambridge University Press"
, year =        1999
}


@article{hh-esplp-08
, author = "I. Haran and D. Halperin"
, title = "An experimental study of point location in planar arrangements in CGAL"
, journal = "ACM Journal of Experimental Algorithmics"
, volume = "13"
, year = 2008
, pages = ""
}

@article{hkh-iiplgtds-12
, author = {{Hemmer}, M. and {Kleinbort}, M. and {Halperin}, D.}
, title = "{Improved Implementation of Point Location in General Two-Dimensional Subdivisions}"
, journal = {ArXiv e-prints}
, archivePrefix = "arXiv"
, eprint = {1205.5434}
, primaryClass = "cs.CG"
, keywords = {Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms}
, year = 2012
, month = may
, adsurl = {http://adsabs.harvard.edu/abs/2012arXiv1205.5434H}
, adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

@article{Shapira2008Consistent,
  title={Consistent mesh partitioning and skeletonisation using the shape diameter function},
  author={Shapira, L. and Shamir, A. and Cohen-Or, D.},
  journal={The Visual Computer},
  volume={24},
  number={4},
  pages={249--259},
  year={2008},
  publisher={Springer}
}

@article {Shamir2008SegmentationSurvey,
author = {Shamir, Ariel},
title = {A survey on Mesh Segmentation Techniques},
journal = {Computer Graphics Forum},
volume = {27},
number = {6},
publisher = {Blackwell Publishing Ltd},
pages = {1539--1556},
year = {2008},
}

@article{tagliasacchi2012mean,
  title={Mean curvature skeletons},
  author={Tagliasacchi, Andrea and Alhashim, Ibraheem and Olson, Matt and Zhang, Hao},
  journal={Computer Graphics Forum (Proceedings of the Symposium on Geometry Processing)},
  volume={31},
  number={5},
  pages={1735--1744},
  year={2012},
  publisher={The Eurographics Association and Blackwell}
}

@article{Chen2009SegmentationBenchmark,
  author = "Xiaobai Chen and Aleksey Golovinskiy and Thomas Funkhouser",
  title = "A Benchmark for {3D} Mesh Segmentation",
  journal = "ACM Transactions on Graphics (Proc. SIGGRAPH)",
  year = "2009",
  month = aug,
  volume = "28",
  number = "3"
}

@article{Vogel1979Sampling,
author = {Helmut Vogel},
title = {{A better way to construct the sunflower head}},
journal = {Mathematical Biosciences},
volume = {44},
year = {1979},
pages = {179--189}
}

@ARTICLE{Boykov2001FastApproximate,
    author = {Yuri Boykov and Olga Veksler and Ramin Zabih},
    title = {Fast approximate energy minimization via graph cuts},
    journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
    year = {2001},
    volume = {23},
    pages = {2001}
}

@inproceedings{Tomasi1998Bilateral,
 author = {Tomasi, C. and Manduchi, R.},
 title = {Bilateral Filtering for Gray and Color Images},
 booktitle = {Proceedings of the Sixth International Conference on Computer Vision},
 series = {ICCV '98},
 year = {1998},
 isbn = {81-7319-221-9},
 pages = {839--},
 url = {http://dl.acm.org/citation.cfm?id=938978.939190},
 acmid = {939190},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
}

@inproceedings{Arthur2007Kmeans,
 author = {Arthur, David and Vassilvitskii, Sergei},
 title = {k-means++: the advantages of careful seeding},
 booktitle = {Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms},
 series = {SODA '07},
 year = {2007},
 isbn = {978-0-898716-24-5},
 location = {New Orleans, Louisiana},
 pages = {1027--1035},
 numpages = {9},
 url = {http://dl.acm.org/citation.cfm?id=1283383.1283494},
 acmid = {1283494},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
}

@book{botsch2010polygon,
  title={Polygon mesh processing},
  author={Botsch, Mario and Kobbelt, Leif and Pauly, Mark and Alliez, Pierre and L{\'e}vy, Bruno and others},
  publisher =   "A K Peters, Ltd.",
  year={2010}
}

@TechReport{Devillers2014Generator
, author = "Olivier Devillers and Philippe Duchon and R{\'e}my Thomasse"
, title =  "A generator of random convex polygon in a disc"
, institution = "INRIA"
, type = "Research Report"
, number = "RR-8467"
, month = "Feb"
, year = "2014"
, url = "https://hal.inria.fr/hal-00943409"
}

@article{XinWang2009improvingchenandhan,
 author = {Xin, Shi-Qing and Wang, Guo-Jin},
 title = {Improving Chen and Han's Algorithm on the Discrete Geodesic Problem},
 journal = {ACM Trans. Graph.},
 issue_date = {August 2009},
 volume = {28},
 number = {4},
 month = sep,
 year = {2009},
 issn = {0730-0301},
 pages = {104:1--104:8},
 articleno = {104},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/1559755.1559761},
 doi = {10.1145/1559755.1559761},
 acmid = {1559761},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Design and analysis of algorithms, computational geometry, shortest path problems},
}


@inproceedings{schnabel2007efficient,
  title={Efficient RANSAC for Point-Cloud Shape Detection},
  author={Schnabel, Ruwen and Wahl, Roland and Klein, Reinhard},
  booktitle={Computer graphics forum},
  volume={26},
  number={2},
  pages={214--226},
  year={2007},
  organization={Wiley Online Library}
}

@article{levismooth,
  title={Smooth Rotation Enhanced As-Rigid-As-Possible Mesh Animation},
  author={Levi, Zohar and Gotsman, Craig},
  journal={IEEE Transactions on Visualization \& Computer Graphics},
  publisher={IEEE},
  year={2015}
}


@incollection{bfhhm-epsph-15,
  title={Exact Minkowski sums of polygons with holes},
  author={Baram, Alon and Fogel, Efi and Halperin, Dan and Hemmer, Michael and Morr, Sebastian},
  booktitle={Algorithms-ESA 2015},
  pages={71--82},
  year={2015},
  publisher={Springer}
}

@inproceedings{cignoni1998metro,
  title={Metro: measuring error on simplified surfaces},
  author={Cignoni, Paolo and Rocchini, Claudio and Scopigno, Roberto},
  booktitle={Computer Graphics Forum},
  volume={17},
  number={2},
  pages={167--174},
  year={1998},
  organization={Blackwell Publishers}
}

@inproceedings{boissonnat2009Delaunay,
  TITLE = {{Incremental construction of the Delaunay graph in medium dimension}},
  AUTHOR = {Boissonnat, Jean-Daniel and Devillers, Olivier and Hornus, Samuel},
  URL = {https://hal.inria.fr/inria-00412437},
  BOOKTITLE = {{Annual Symposium on Computational Geometry}},
  ADDRESS = {Aarhus, Denmark},
  PAGES = {208-216},
  YEAR = {2009},
  MONTH = Jun,
  PDF = {https://hal.inria.fr/inria-00412437/file/socg09.pdf},
  HAL_ID = {inria-00412437},
  HAL_VERSION = {v1},
}
