%
% Computational geometry community bibliography project
%   ftp://ftp.cs.usask.ca/pub/geometry/geombib.tar.Z
%
% March 1997 compilation
%

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

@incollection{-dg-87
, title =	"Discrete {Geometrie}"
, booktitle =	"Tagungsber. Math. Forschungsinst. Oberwolfach"
, number =	25
, year =	1987
, pages =	"1--18"
, note =	"seminar abstracts"
, update =	"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"
}

@article{-r3scg-87
, title =	"Report on 3rd {Symposium} on {Computational} {Geometry}, 1987"
, journal =	"Bull. EATCS"
, volume =	33
, year =	1987
, pages =	"165--170"
, update =	"95.05 korneenko"
}

@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"
}

@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"
}

@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{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{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"
, update =	"93.05 jones"
}

@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"
, update =	"94.09 jones"
}

@inproceedings{ahknu-vdcfc-95
, author =	"M. 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"
, update =	"95.09 mitchell"
}

@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"
, update =	"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"
}

@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"
, update =	"96.09 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"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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"
}

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

@incollection{a-cano-88
, author =	"S. Abramowski"
, title =	"Collision avoidance for nonrigid objects"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"168--179"
, keywords =	"motion planning"
}

@incollection{alm-mrpc-88
, author =	"S. Abramowski and B. Lang and H. M{\"u}ller"
, title =	"Moving regular polygons in contact"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, year =	1988
, pages =	"229--242"
, keywords =	"motion planning, contact, regular polygon"
, update =	"95.05 korneenko"
}

@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 =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	246
, year =	1987
, pages =	"118--130"
, keywords =	"grid graph, motion planning, connected component"
, update =	"95.05 korneenko"
}

@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"
}

@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."
, year =	1991
, pages =	"215--218"
}

%, 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"
}

@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"
}

@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 =	"96.09 devillers, 96.05 mitchell"
}

@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"
}

@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"
}

@article{aks-cdofo-95
, author =	"P. Agarwal and M. Katz and M. 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 =	"96.09 devillers"
}

@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"
, update =	"96.05 agarwal"
}

@incollection{a-anspt-91
, author =	"Pankaj K. Agarwal"
, title =	"Applications of a new space partition technique"
, booktitle =	"??"
, 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 =	"96.05 agarwal, 95.09 agarwal, 95.05 korneenko"
}

@article{a-anspt-93
, author =	"P. K. Agarwal"
, title =	"Applications of a new space partition technique"
, journal =	"Discrete Comput. Geom."
, volume =	9
, number =	1
, year =	1993
, pages =	"11--38"
, keywords =	"$d$-dimensional, ray tracing, hidden line/surface elimination, minimal spanning tree, space partition"
, update =	"96.05 ramkumar"
}

@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"
, update =	"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"
, update =	"96.05 agarwal, 93.09 matousek"
}

@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"
}

@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"
, update =	"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 S. 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 =	"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 S. 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 =	"96.05 agarwal"
}

@inproceedings{aaas-cvgbr-93
, author =	"Pankaj K. Agarwal and N. Alon and B. Aronov and S. Suri"
, title =	"Can visibility graphs be represented compactly?"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"338--347"
, update =	"96.05 agarwal, 93.09 jones"
}

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

@techreport{aas-pocpi-95
, author =	"P. K. Agarwal and N. Amenta and M. 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 =	"96.05 agarwal"
}

@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"
}

@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"
, update =	"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"
, update =	"96.05 agarwal, 95.01 smid, 94.01 orourke"
}

@article{aaos-supa-97
, author =	"P. K. Agarwal and B. Aronov and J. O'Rourke and C. Schevon"
, title =	"Star unfolding of a polytope with applications"
, journal =	"SIAM J. Comput."
, volume =	26
, year =	1997
, note =	"To appear"
, keywords =	"motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
, succeeds =	"aaos-supa-93"
, update =	"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
, update =	"96.09 agarwal"
}

@inproceedings{aas-cefda-94
, author =	"Pankaj K. Agarwal and B. Aronov and M. Sharir"
, title =	"Computing Envelopes in Four Dimensions with Applications"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"348--358"
, update =	"96.05 agarwal, 94.09 jones, 94.01 jones"
}

@inproceedings{aas-ltbse-97
, author =	"P. K. Agarwal and B. Aronov and M. Sharir"
, title =	"Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1997
, pages =	"483--492"
, update =	"97.03 agarwal+held, 96.09 agarwal, 96.05 agarwal"
}

@unpublished{aas-mpcpp-96
, author =	"P. K. Agarwal and B. Aronov and M. Sharir"
, title =	"Motion planning for a convex polygon in a polygonal environment"
, year =	1996
, note =	"Unpublished manuscript"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@inproceedings{aas-olals-97
, author =	"P. K. Agarwal and B. Aronov and M. Sharir"
, title =	"On levels in arrangements of lines, segments, planes, and triangles"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, update =	"97.03 agarwal, 96.09 agarwal"
}

@inproceedings{aass-sdp-90
, author =	"Pankaj K. Agarwal and B. Aronov and M. Sharir and S. 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"
, update =	"96.05 agarwal, 95.05 smid"
}

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

@inproceedings{aas-lsbtd-95
, author =	"Pankaj K. Agarwal and Boris Aronov and Subhash Suri"
, title =	"Line Stabbing Bounds in Three Dimensions"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"267--276"
, keywords =	"ray shooting, contrained triangulation, tetrahedra"
, update =	"95.09 mitchell"
}

@inproceedings{abhs-egkda-96
, author =	"P. K. Agarwal and M. de Berg and D. Halperin and M. 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 =	"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"
, update =	"96.09 agarwal, 96.05 agarwal, 95.09 agarwal, 94.09 jones, 94.05 schwarzkopf, 94.01 jones"
}

@inproceedings{ad-aats-97
, author =	"Pankaj K. Agarwal and Pavan K. Desikan"
, title =	"An approximation algorithm for terrain simplification"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1997
, pages =	"139--147"
, update =	"97.03 agarwal, 96.09 agarwal"
}

@inproceedings{aesw-emstb-90
, author =	"Pankaj K. Agarwal and H. Edelsbrunner and O. Schwarzkopf and E. Welzl"
, title =	"Euclidean minimum spanning trees and bichromatic closest pairs"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"203--210"
, precedes =	"aesw-emstb-91"
, update =	"96.05 agarwal"
}

@article{aesw-emstb-91
, author =	"Pankaj K. Agarwal and H. Edelsbrunner and O. Schwarzkopf and E. 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 =	"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"
, update =	"95.09 mitchell"
}

@article{aest-cscpp-93
, author =	"Pankaj K. Agarwal and A. Efrat and M. 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 =	"96.05 agarwal, 95.05 korneenko, 93.09 efrat"
}

@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"
}

@misc{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
, note =	"\path|http://www.cs.brown.edu/cgc/|"
, url =	"http://www.cs.brown.edu/cgc/"
, update =	"97.03 tamassia"
}

@inproceedings{agm-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
, update =	"97.03 murali"
}

@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
, update =	"96.09 agarwal"
}

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

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

@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
, update =	"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
, update =	"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"
}

@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"
, update =	"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{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-dahrp-92"
, update =	"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"
}

@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"
, keywords =	"ray tracing, range search, intersection, partition trees"
, succeeds =	"am-rsps-92"
, update =	"96.09 agarwal, 96.05 agarwal, 94.01 matousek"
}

@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.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-39.ps.gz"
, update =	"96.09 agarwal, 96.05 agarwal, 95.09 agarwal, 94.09 jones, 94.01 jones"
}

@inproceedings{ams-fnmst-91
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and S. 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 =	"96.09 agarwal, 96.05 agarwal"
}

@article{ams-fnmst-92
, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and S. 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 =	"96.09 agarwal, 96.05 agarwal+pascucci, 95.05 korneenko"
}

@article{aps-ccai-93
, author =	"Pankaj K. Agarwal and M. Pellegrini and M. 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 =	"96.05 agarwal, 95.05 korneenko, 94.01 matousek"
}

@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"
}

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

@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.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-40.ps.gz"
, keywords =	"curved surfaces"
, update =	"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"
}

@article{as-anps-93
, author =	"Pankaj K. Agarwal and M. Sharir"
, title =	"Applications of a new partition scheme"
, 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 =	"96.05 agarwal, 95.05 korneenko, 94.01 matousek"
}

@inproceedings{as-anps-91
, author =	"Pankaj K. Agarwal and M. 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-anps-93"
, update =	"96.05 agarwal, 95.05 korneenko"
}

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

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

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

@techreport{as-cvspp-90
, author =	"Pankaj K. Agarwal and M. 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 =	"96.05 agarwal, 95.05 korneenko"
}

@inproceedings{as-ccai-91
, author =	"Pankaj K. Agarwal and M. Sharir"
, title =	"Counting circular arc intersections"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"10--20"
, keywords =	"intersection, circles, random sampling"
, update =	"96.05 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"
, update =	"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"
}

@techreport{as-oldmw-90
, author =	"Pankaj K. Agarwal and M. 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 =	"96.05 agarwal, 93.09 jones"
}

@article{as-oldmw-91
, author =	"Pankaj K. Agarwal and M. 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 =	"96.05 agarwal, 93.09 jones"
}

@inproceedings{as-nvpt-93
, author =	"Pankaj K. Agarwal and M. 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"
, update =	"96.05 agarwal, 95.09 agarwal, 93.09 milone+mitchell"
}

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

@techreport{as-pglp-90
, author =	"Pankaj K. Agarwal and M. 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 =	"96.05 agarwal, 93.09 jones"
}

@article{as-pglp-94
, author =	"Pankaj K. Agarwal and M. 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 =	"97.03 devillers, 96.05 agarwal, 94.05 sharir"
}

@inproceedings{as-pglpm-91
, author =	"Pankaj K. Agarwal and M. 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 =	"96.05 agarwal, 93.09 jones"
}

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

@article{as-rsacp-96ii
, author =	"P. K. Agarwal and M. 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 =	"96.05 smid"
}

@inproceedings{as-rsacp-93
, author =	"Pankaj K. Agarwal and M. 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 =	"96.05 smid, 93.05 smid"
}

@inproceedings{as-rbida-88
, author =	"Pankaj K. Agarwal and M. 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"
, update =	"96.05 agarwal, 95.05 korneenko"
}

@article{as-rbida-90
, author =	"Pankaj K. Agarwal and M. 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 =	"96.05 agarwal, 95.05 korneenko"
}

@article{ass-sulbl-89
, author =	"Pankaj K. Agarwal and M. Sharir and P. 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 =	"96.05 agarwal, 95.05 korneenko"
}

@techreport{ast-emst-93
, author =	"P. K. Agarwal and M. 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 =	"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 M. 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 =	"96.05 agarwal, 96.01 aronov, 95.05 korneenko, 95.01 smid"
}

@inproceedings{asw-dcp-97
, author =	"P. K. Agarwal and M. Sharir and E. Welzl"
, title =	"The discrete 2-Center problem"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year =	1997
, note =	"to appear"
, update =	"97.03 agarwal"
}

@article{as-escrs-90
, author =	"Pankaj K. Agarwal and M.-T. Shing"
, title =	"Efficient special cases of rectilinear {Steiner} trees"
, journal =	"Networks"
, volume =	20
, year =	1990
, pages =	"453--485"
, keywords =	"Steiner trees"
, update =	"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{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-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 =	"A. Aggarwal"
, title =	"The art gallery problem: {Its} variations, applications, and algorithmic aspects"
, type =	"Ph.{D}. Thesis"
, school =	"Johns Hopkins Univ."
, address =	"Baltimore, MD"
, year =	1984
, keywords =	"doctoral thesis"
}

@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 =	"97.03 agarwal, 94.05 franciosa"
}

@inproceedings{abosy-fmcnp-85
, author =	"A. Aggarwal and H. Booth and J. O'Rourke and S. 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"
}

@article{abosy-fmcnp-89
, author =	"A. Aggarwal and H. Booth and J. O'Rourke and S. 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 =	"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 B. 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
}

@article{acgoy-pcg-88
, author =	"A. Aggarwal and B. Chazelle and L. 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"
}

@inproceedings{acgoy-pcg-85
, author =	"A. Aggarwal and B. Chazelle and L. 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"
}

@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. 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"
}

@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 =	"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 S. 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"
}

@article{aiks-fkpmd-91
, author =	"A. Aggarwal and H. Imai and N. Katoh and S. 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"
}

@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. 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"
, update =	"96.09 agarwal, 96.05 agarwal"
}

@article{akmsw-gamsa-87
, author =	"A. Aggarwal and M. M. Klawe and S. Moran and P. 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 =	"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 S. 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 =	"95.05 korneenko"
}

@inproceedings{ap-nsmma-88
, author =	"A. Aggarwal and J. 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"
}

@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 =	""
, update =	"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"
, update =	"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"
}

@article{as-cldsp-90
, author =	"A. Aggarwal and S. 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 =	"95.05 korneenko, 95.01 smid"
}

@inproceedings{as-facle-87
, author =	"A. Aggarwal and S. 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"
, update =	"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 =	"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 =	"94.05 devillers+smid, 93.09 milone+mitchell"
}

@article{av-iocsr-87
, author =	"A. Aggarwal and J. S. Vitter"
, title =	"The Input/Output Complexity of Sorting and Related Problems"
, journal =	"Commun. ACM"
, volume =	31
, year =	1987
, pages =	"1116--1127"
, update =	"96.09 orourke"
}

@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{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{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
, address =	"Germany"
, year =	1988
, pages =	"29--33"
, keywords =	"polygon, monotone, unimodal"
, update =	"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"
}

@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."
}

@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"
}

@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"
}

@article{aacktrx-tin-96
, author =	"Oswin Aichholzer and Franz Aurenhammer and Siu-Wing Chen 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 =	"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."
}

@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-96"
, update =	"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 =	"1?"
, year =	"1997?"
, pages =	"??--??"
, note =	"to appear"
, succeeds =	"aarx-clgta-96"
, update =	"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"
, update =	"97.03 rote, 95.09 mitchell"
}

@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{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"
}

@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{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"
}

@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"
, 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"
}

@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{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"
}

@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
, pages =	"1--9"
, keywords =	"parallel computations"
, update =	"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"
, year =	1985
, pages =	"xiii+229p"
, update =	"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"
}

@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"
}

@inproceedings{aqs-cgspn-91
, 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"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"619--638"
}

@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."
, 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"
}

@inproceedings{a-dcpsh-94
, author =	"T. Akutsu"
, title =	"On Determining the Congruity of Point Sets in Higher Dimensions"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"96.05 mitchell"
}

@inproceedings{aahit-ssede-91
, author =	"T. Akutsu and Y. Aoki and S. Hasegawa and H. Imai and T. 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"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, address =	"Beijing, China"
, year =	1994
, pages =	"405--413"
, update =	"97.03 aronov, 96.05 mitchell"
}

@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{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"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	621
, publisher =	"Springer-Verlag"
, year =	1992
, pages =	"399--409"
}

@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
}

@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 =	"P. 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 =	"93.09 rote, 93.05 jones"
}

@techreport{abst-oaccs-90
, author =	"P. 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 =	"93.09 milone+mitchell"
}

@incollection{abp-oabcu-89
, author =	"P. Alevizos and J.-D. Boissonnat and F. P. Preparata"
, title =	"An optimal algorithm for the boundary of a cell in a union of rays"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, year =	1989
, pages =	"247--274"
, update =	"95.05 korneenko"
}

@article{abp-oabcu-90
, author =	"P. Alevizos and J. D. Boissonnat and F. 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 =	"95.05 korneenko"
}

@article{abp-oabcu-91
, author =	"P. Alevizos and J. D. Boissonnat and F. 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 =	"95.09 agarwal"
}

@inproceedings{abp-bur-89
, author =	"P. Alevizos and J.-D. 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"
}

@techreport{aby-oisra-89
, author =	"P. Alevizos and J.-D. Boissonnat and M. 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"
}

@inproceedings{aby-ooacr-87
, author =	"P. D. Alevizos and J.-D. Boissonnat and M. 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"
, update =	"93.09 milone+mitchell"
}

@article{aby-nccr-90
, author =	"P. D. Alevizos and J.-D. Boissonnat and M. 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 =	"95.05 korneenko, 93.09 milone+mitchell"
}

@inproceedings{aby-pncp-89
, author =	"P. D. Alevizos and J.-D. Boissonnat and M. Yvinec"
, title =	"Probing non-convex polygons"
, booktitle =	"Proc. 6th IEEE Internat. Conf. Robot. Autom."
, year =	1989
, pages =	"202--208"
}

@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-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-sps-78
, author =	"G. L. Alexanderson and J. E. Welzl"
, title =	"Simple partitions of space"
, journal =	"Math. Mag."
, volume =	51
, year =	1978
, pages =	"220--225"
}

@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-kp-58
, author =	"A. D. Alexandrov"
, title =	"Konvexe Polyeder"
, publisher =	"Akademie-Verlag"
, address =	"Berlin, West Germany"
, year =	1958
}

@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{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"
}

@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"
}

@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"
}

@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"
, update =	"95.05 korneenko"
}

@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"
}

@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 E. 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"
}

@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"
}

@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 S. Suri"
, title =	"Long non-crossing configurations in the plane"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"257--263"
, update =	"93.09 jones"
}

@book{as-pm-93
, author =	"N. Alon and J. Spencer"
, title =	"The {P}robabilistic {M}ethod"
, publisher =	"J. Wiley and Sons"
, address =	"New York, NY"
, year =	1993
, update =	"97.03 agarwal, 94.01 matousek, 93.09 matousek"
}

@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"
}

@article{m-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 =	"97.03 smid"
}

@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{aar-msrp-94
, author =	"H. Alt and O. Aichholzer and G. Rote"
, title =	"Matching Shapes with a Reference Point"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"85--92"
, precedes =	"aar-msrp-97"
, update =	"97.03 rote, 94.09 jones, 94.01 jones"
}

@article{aar-msrp-97
, author =	"H. Alt and O. Aichholzer and G. Rote"
, title =	"Matching Shapes with a Reference Point"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	"?"
, year =	1997
, pages =	"??--??"
, note =	"to appear"
, keywords =	"shape matching, Steiner point"
, succeeds =	"aar-msrp-94"
, update =	"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{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"
, update =	"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{abb-mrps-
, author =	"H. Alt and B. Behrends and J. Bl{\"o}mer"
, title =	"Measuring the resemblance of polygonal shapes"
, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
, address =	"Berlin"
, update =	"93.09 milone+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"
}

@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"
}

@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. Rote and G. Weber"
, title =	"Matching convex shapes with respect to the symmetric difference"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"320--333"
, update =	"97.03 smid"
}

@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"
}

@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"
, update =	"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{aag-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"
, update =	"96.09 tamassia"
}

@incollection{ag-rgo-97
, author =	"H. Alt and L. J. Guibas"
, title =	"Resemblance of Geometric Objects"
, editor =	"J.-R. Sack and J. Urrutia"
, booktitle =	"Handbook on Computational Geometry"
, publisher =	"North-Holland"
, year =	1997
, pages =	"??--??"
, note =	"To appear."
, update =	"96.09 orourke"
}

@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"
}

@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-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 E. 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"
}

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

@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.ruu.nl/~otfried/ps/as-vdco-95.ps.gz"
, keywords =	"randomized incremental algorithm"
, update =	"95.09 mitchell+schwarzkopf"
}

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

@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{ay-mpce-89
, author =	"H. Alt and C. K. Yap"
, title =	"Motion Planning in the {CL}-Environment"
, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"373--380"
, update =	"97.03 gaertner+salinger"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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-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"
, update =	"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"
, update =	"96.05 efrat"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@misc{a-dcgs-
, author =	"Nina Amenta"
, title =	"Directory of Computational Geometry Software"
, note =	"\path|http://www.geom.umn.edu/software/cglist/|"
, 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"
, update =	"96.05 efrat"
}

@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"
, update =	"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{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"
}

@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"
, update =	"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{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 L. 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"
}

% ### an opinion: year = 1977
@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 =	"95.05 korneenko"
}

@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"
}

@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"
}

@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"
}

@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"
}

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

@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"
, update =	"94.01 tamassia"
}

@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{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 =	""
, update =	"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"
}

@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"
}

@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 in Computer Science 409"
, publisher =	"Springer-Verlag"
, address =	"Berlin, Germany"
, year =	1990
, pages =	"223--252"
, update =	"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{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{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-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"
}

@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"
}

@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
, address =	"Kyoto"
, year =	1990
, pages =	"177--186"
, note =	"Proc. Sympos. Algorithms and Comput. Complexity"
, keywords =	"on-line algorithms, convex, location, Voronoi diagram"
, update =	"95.09 agarwal, 95.05 korneenko"
}

@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"
}

@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{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"
}

@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{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{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."
, 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."
, series =	"Lecture Notes Comput. Sci."
, number =	955
, year =	1995
, pages =	"334--345"
, keywords =	"external memory algorithms, data structures"
, update =	"96.09 kreveld"
}

@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"
, note =	"Also appeared in Abstracts of the First CGC Workshop on
	Computational Geometry, Center for Geometric
	Computing, Johns Hopkins university, Baltimore, MD
	October 1996"
, update =	"97.03 murali"
}

@inproceedings{accdsz-psasp-96
, author =	"S. Arikati and D. Z. Chen and L. P. Chew and G. Das and M. Smid and C. D. Zaroliagis"
, title =	"Planar spanners and approximate shortest path queries among obstacles in the plane"
, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	1136
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"514--528"
, update =	"97.03 smid"
}

@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"
, update =	"94.09 jones"
}

@techreport{a-bih-88
, author =	"E. 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"
}

@inproceedings{abmmrss-tsp-93
, author =	"E. Arkin and P. Belleville and J. 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"
, comments =	"To appear, Comput. Geom. Theory Appl."
, update =	"96.09 romanik, 95.09 agarwal, 95.01 mitchell, 93.09 milone+mitchell"
}

@techreport{afm-aalm-95
, author =	"E. Arkin and S. Fekete and J. Mitchell"
, title =	"Approximation algorithms for lawnmowing and milling"
, type =	"Report"
, institution =	"??"
, address =	"University at Stony Brook"
, year =	1995
, keywords =	"NC machining, covering, TSP, TSP with neighborhoods"
, succeeds =	"afm-lp-93"
, update =	"96.01 mitchell"
}

@inproceedings{afm-lp-93
, author =	"E. Arkin and S. Fekete and J. Mitchell"
, title =	"The lawnmower problem"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"461--466"
, precedes =	"afm-aalm-95"
, update =	"96.01 mitchell"
}

@techreport{am-ovasp-87
, author =	"E. Arkin and J. 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"
}

@inproceedings{achkm-ecmcp-90
, 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"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"129--137"
, keywords =	"matching, shape, polygons"
}

@article{achkm-ecmcp-91
, 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"
, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
, volume =	13
, number =	3
, year =	1991
, pages =	"209--216"
, keywords =	"polygon, distance, shape, similarity"
, update =	"95.05 korneenko"
}

@inproceedings{achmssy-omah-96
, author =	"E. M. Arkin and Y.-J. Chiang and M. Held and J. S. B. Mitchell and V. Sacristan and S. 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"
, update =	"97.03 smid"
}

@inproceedings{acm-mpoap-89
, author =	"E. M. Arkin and R. Connelly and J. 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"
}

@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 =	"E. M. Arkin and D. Halperin and K. Kedem and J. 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"
, update =	"96.05 efrat, 95.01 mitchell, 95.01 mitchell"
}

@techreport{ahkmn-astse-94
, author =	"E. M. Arkin and D. Halperin and K. Kedem and J. 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 =	"95.01 mitchell, 95.01 mitchell"
}

@article{ahkmn-astse-95
, author =	"E. M. Arkin and D. Halperin and K. Kedem and J. 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 =	"95.09 agarwal"
}

@article{ah-aagcs-94
, author =	"E. 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"
, update =	"96.09 devillers, 95.09 mitchell"
}

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

@inproceedings{ahm-madcg-95
, author =	"E. M. Arkin and M. Held and J. 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 =	"October 12-13"
, year =	1995
, pages =	"29--36"
, update =	"96.01 mitchell"
}

@inproceedings{ahms-htfr-94
, author =	"E. M. Arkin and M. Held and J. S. B. Mitchell and S. 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"
, update =	"96.05 agarwal, 95.01 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"
, update =	"95.09 jones"
}

@techreport{ahs-oprzp-95
, author =	"E. M. Arkin and M. 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 =	"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{akmsw-mpnrc-91
, author =	"E. M. Arkin and K. Kedem and J. 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"
}

@article{akmsw-mppdn-92
, author =	"E. M. Arkin and K. Kedem and J. 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"
}

@inproceedings{akm-gkp-91
, author =	"E. M. Arkin and S. Khuller and J. 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 =	"95.01 mitchell"
}

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

@inproceedings{akm-oep-89
, author =	"E. M. Arkin and S. Khuller and J. 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 =	"95.01 mitchell"
}

@inproceedings{ammrs-dtgm-93
, author =	"E. M. Arkin and H. Meijer and J. 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"
, update =	"93.09 jones"
}

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

@inproceedings{amp-bsppp-91
, author =	"E. M. Arkin and J. 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"
}

@article{ams-ltlpq-95
, author =	"E. M. Arkin and J. S. B. Mitchell and S. 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 =	"96.01 mitchell"
}

@inproceedings{ams-olpqs-92
, author =	"E. M. Arkin and J. S. B. Mitchell and S. 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 =	"96.01 mitchell"
}

@techreport{amz-apmp-89
, author =	"E. M. Arkin and J. 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"
}

@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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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"
, update =	"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{acegsw-ptphp-90
, author =	"B. Aronov and B. Chazelle and H. Edelsbrunner and L. J. Guibas and M. 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"
, update =	"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"
, update =	"96.09 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"
, update =	"95.09 mitchell"
}

@techreport{aegs-ibcmf-89
, author =	"B. Aronov and H. Edelsbrunner and L. Guibas and M. 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"
}

@techreport{aegs-nemfl-90
, author =	"B. Aronov and H. Edelsbrunner and L. Guibas and M. 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"
, comments =	"To appear in {\em Combinatorica} any second now"
, succeeds =	"aegs-ibcmf-89"
}

@article{aegs-nemfl-92
, author =	"B. Aronov and H. Edelsbrunner and L. J. Guibas and M. 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"
, succeeds =	"aegs-nemfl-90"
, update =	"93.09 matousek"
}

@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"
}

@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"
, update =	"94.05 aronov"
}

@incollection{ag-gvdps-87
, author =	"B. Aronov and L. Guibas"
, 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 =	"Voronoi diagram, geodesic distance, polygon"
, update =	"95.05 korneenko"
}

@inproceedings{ams-sscch-91
, author =	"B. Aronov and J. Matou{\v s}ek and M. 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}"
, update =	"96.09 agarwal"
}

@article{ams-sscch-94
, author =	"B. Aronov and J. Matou{\v s}ek and M. 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"
, succeeds =	"ams-ssch-94"
, update =	"94.05 matousek"
}

@article{anps-ipbah-93
, author =	"B. Aronov and D. Q. Naiman and J. Pach and M. Sharir"
, title =	"An invariant property of balls in arrangements of hyperplanes"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"421--425"
, succeeds =	"anps-ipbah-92"
, update =	"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"
}

@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"
, update =	"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 M. 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 =	"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 M. 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"
, update =	"95.01 aronov, 93.05 smid"
}

@article{as-car-94
, author =	"B. Aronov and M. Sharir"
, title =	"Castles in the air revisited"
, journal =	"Discrete Comput. Geom."
, volume =	12
, number =	2
, month =	sep
, year =	1994
, pages =	"119--150"
, keywords =	"combinatorial geometry, combinatorial complexity, simplex arrangements, popularity, excess"
, succeeds =	"as-car-92"
, update =	"95.01 aronov"
}

@inproceedings{as-zsha-91
, author =	"B. Aronov and M. 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 =	"95.09 aronov"
}

@inproceedings{as-tmp3s-94
, author =	"B. Aronov and M. Sharir"
, title =	"On Translational Motion Planning in $3$-Space"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"21--30"
, update =	"94.09 jones, 94.01 jones"
}

@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"
, update =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{as-tsbac-88
, author =	"B. Aronov and M. 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"
}

@article{as-tsbac-90
, author =	"B. Aronov and M. 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"
}

@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-ptase-96
, author =	"S. Arora"
, title =	"Polynomial time approximation schemes for {E}uclidean {TSP} and other geometric problems"
, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1996
, pages =	"2--11"
, update =	"97.03 agarwal, 96.05 agarwal"
}

@inproceedings{abss-haolc-93
, author =	"S. 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 =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@incollection{al-ha-96
, 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 =	1996
, pages =	"399--446"
, update =	"97.03 agarwal, 96.09 agarwal"
}

@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"
}

@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"
}

@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"
}

@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{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 =	"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 =	""
, update =	"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"
, update =	"96.05 agarwal, 95.09 mitchell"
}

@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"
}

@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"
}

@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"
}

@techreport{a-fafmw-90
, author =	"T. Asano"
, title =	"A faster algorithm for finding a maximum weight clique of a circular-arc graph"
, journal =	"Tech. Report"
, number =	"90624--OR"
, institution =	"??"
, address =	"Bonn"
, year =	1990
, pages =	"1--19"
, keywords =	"circular-arc graph"
, update =	"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"
, journal =	"Tech. Report"
, number =	"89619--OR"
, institution =	"??"
, address =	"Bonn"
, year =	1989
, pages =	"1--21"
, keywords =	"circular-arc graph"
, update =	"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"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	834
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"652--659"
, update =	"97.03 aronov, 96.05 mitchell"
}

@article{ai-eaggs-86
, author =	"T. Asano and H. Imai"
, title =	"Efficient algorithms for geometrical graph search problems"
, journal =	"SIAM J. Comput."
, volume =	15
, number =	2
, year =	1986
, pages =	"478--494"
, keywords =	"graph search"
, update =	"95.05 korneenko"
}

@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"
}

@inproceedings{arww-sfctu-95
, author =	"T. Asano and T. Roos and P. Widmayer and E. 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 =	"97.03 gaertner+salinger"
}

@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"
, update =	"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"
, booktitle =	"Ser. Title: Perspect. Comput. v. 15 Conference: Discrete algorithms and complexity, Proc. Jap.-US Joint Semin, Kyoto/Jap, 1986"
, year =	1987
, pages =	"51--64"
, update =	"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, M. 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"
}

@incollection{aa-vdpp-87
, author =	"Ta. Asano and Te. Asano"
, title =	"{Voronoi} Diagrams for Points in a Polygon"
, editor =	"D. S. Johnson"
, booktitle =	"Discrete Algorithms and Complexity"
, series =	"Perspectives in Computing"
, publisher =	"Academic Press"
, year =	1987
, pages =	"51--64"
, update =	"93.09 held"
}

@article{aaghi-vdp-86
, author =	"Ta. Asano and Te. Asano and L. 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"
}

@inproceedings{aaghi-vpses-85
, author =	"Ta. Asano and Te. Asano and L. 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"
, 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"
, update =	"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. 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"
}

@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"
}

@inproceedings{agt-wat-91
, author =	"Te. Asano and L. 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"
}

@article{agt-wat-94
, author =	"Te. Asano and L. 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 =	"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"
}

@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"
}

@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{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"
, update =	"96.05 efrat"
}

@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"
}

@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"
}

% ### also claimed pages 65--79
@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--74"
, update =	"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"
}

% ### others?
@inproceedings{am-iw81c-82
, author =	"F. Aschim and B. M. Mostue"
, title =	"{IFIP} {WG} 8.1 Case Solved Using {SYSDOC} and {SYSTEMATOR}"
, editor =	"T. Olle and others"
, booktitle =	"Information Systems Design Methodologies: a Comparative Review, Proc. of the IFIP WG 8.1 Working Conf. on Comparative Review of Information Systems Design Methodologies"
, publisher =	"North-Holland"
, address =	"New York, NY"
, year =	1982
, pages =	"15--40"
, keywords =	"graph drawing"
, update =	"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{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"
}

@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-93"
, update =	"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-93"
, update =	"96.09 devillers"
}

@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
, year =	1985
, pages =	"1171--1181"
, succeeds =	"a-dcg-83"
}

@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"
}

@inproceedings{ac-opavs-89
, author =	"M. J. Atallah and D. Z. Chen"
, title =	"Optimal parallel algorithm for visibility of a simple polygon from a point"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"114--123"
, precedes =	"acw-opavs-91"
}

@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
, year =	1991
, pages =	"79--113"
}

@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
, 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-86"
, update =	"93.09 milone+mitchell"
}

@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."
, 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 =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1990"
, 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"
}

@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. on Parallel Processing"
, 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"
}

@inproceedings{ag-epsp-86
, 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"
, update =	"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"
, update =	"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"
, year =	1991
, pages =	"394--403"
, 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"
}

@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"
}

@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{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-ugbtp-94
, author =	"M. D. Atkinson and J.-R. Sack"
, title =	"Uniform Generation of Binary Trees in Parallel"
, journal =	"J. Parallel Distrib. Progr."
, volume =	23
, year =	1994
, pages =	"101--103"
, update =	"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"
}

@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 =	"93.09 milone+mitchell"
}

@inproceedings{ah-hgrp-96
, author =	"T. Auer and M. Held"
, title =	"Heuristics for the Generation of Random Polygons"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"38--43"
, update =	"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"
}

@inproceedings{aiit-mlcor-90
, author =	"H. Aunuma and H. Imai and K. Imai and T. Tokuyama"
, title =	"Maximin Locations of Convex Objects and Related Dynamic {Voronoi} diagrams"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"225--234"
, update =	"93.09 milone+mitchell"
}

@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
, year =	1990
, pages =	"243--254"
, keywords =	"design of algorithms, discrete geometry, duality, Voronoi diagrams, convex hull, worst-case analysis"
, succeeds =	"a-ndrcv-86"
}

% ### verify year: 1990 ?
@article{a-rbgtv-91
, author =	"F. Aurenhammer"
, title =	"A relationship between {Gale} transforms and {Voronoi} diagrams"
, journal =	"Discrete Appl. Math."
, volume =	28
, year =	1991
, pages =	"83--91"
, update =	"95.05 korneenko"
}

@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"
}

@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"
}

@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"
}

@incollection{a-ugtcg-88
, author =	"F. Aurenhammer"
, title =	"Using {Gale} transforms in computational geometry"
, booktitle =	"Computational Geometry and its Applications"
, 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 =	"95.05 korneenko, 93.09 aurenhammer"
}

@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-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
, 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 =	"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-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"
}

@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"
}

@incollection{ak-vd-97
, author =	"Franz Aurenhammer and Rolf Klein"
, title =	"Voronoi Diagrams"
, editor =	"J.-R. Sack and J. Urrutia"
, booktitle =	"Handbook on Computational Geometry"
, publisher =	"North-Holland"
, year =	1997
, note =	"To appear"
, update =	"97.03 icking"
}

@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"
, precedes =	"as-solri-92"
, update =	"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"
}

@incollection{asw-popfp-91
, author =	"Franz Aurenhammer and Gerd St{\"o}ckl and Emo Welzl"
, title =	"The post office problem for fuzzy point sets"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"1--11"
, update =	"94.01 rote"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"206--217"
, update =	"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{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"
, update =	"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"
}

@incollection{ab-acddv-83
, author =	"D. Avis and B. K. Bhattacharya"
, title =	"Algorithms for computing $d$-dimensional {Voronoi} diagrams and their duals"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"159--180"
, keywords =	"Voronoi diagrams, $d$-dimensional, linear programming"
}

@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"
, update =	"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"
, update =	"95.09 mitchell"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"199--210"
, keywords =	"transversals, hyperplanes, stabbing, polyhedra, linear programming"
, succeeds =	"ad-ahdsp-87"
}

@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"
}

@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"
}

@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"
, update =	"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"
, keywords =	"polytopes, linear programming"
, succeeds =	"af-pachv-91"
, update =	"93.09 rote"
}

@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
, url =	"http://www.ifor.math.ethz.ch/staff/fukuda/fukuda.html"
, update =	"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"
, update =	"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"
, update =	"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"
, 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"
}

@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"
}

@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"
}

@phdthesis{a-peddf-89
, author =	"F. 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 =	"93.09 rote, 93.05 jones"
}

@incollection{ab-pptr-88
, author =	"F. Avnaim and J.-D. 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"
}

@article{ab-pputr-89
, author =	"F. Avnaim and J.-D. Boissonnat"
, title =	"Polygon placement under translation and rotation"
, journal =	"RAIRO Inform. Theor."
, volume =	23
, year =	1989
, pages =	"5--28"
, update =	"95.05 korneenko, 95.01 devillers"
}

@inproceedings{ab-pempc-89
, author =	"F. Avnaim and J. D. 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
}

@inproceedings{ab-scsp-87
, author =	"F. Avnaim and J.-D. Boissonnat"
, title =	"Simultaneous containment of several polygons"
, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
, year =	1987
, pages =	"242--250"
}

@techreport{abdpy-esdus-94
, author =	"F. Avnaim and J.-D. Boissonnat and O. Devillers and F. Preparata and M. 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/prisme/biblio/search.html"
, precedes =	"abdpy-esdus-97"
, update =	"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 =	"F. Avnaim and J.-D. Boissonnat and O. Devillers and F. Preparata and M. Yvinec"
, title =	"Evaluating signs of determinants using single-precision arithmetic"
, journal =	"Algorithmica"
, volume =	17
, year =	1997
, pages =	"111--132"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, succeeds =	"abdpy-esdus-94 abdpy-enmcs-95"
, update =	"97.03 devillers"
}

@inproceedings{abdpy-enmcs-95
, author =	"F. Avnaim and J.-D. Boissonnat and O. Devillers and F. Preparata and M. 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.inria.fr/prisme/biblio/search.html"
, precedes =	"abdpy-esdus-97"
, update =	"97.03 devillers, 96.01 devillers, 95.05 devillers"
}

@inproceedings{abf-pempa-88
, author =	"F. Avnaim and J.-D. Boissonnat and B. 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"
}

@incollection{abf-pempa-89
, author =	"F. Avnaim and J.-D. Boissonnat and B. 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 =	"95.05 korneenko"
}

@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"
}

@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{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"
}

@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
, publisher =	"Elsevier Science"
, year =	1993
, pages =	"1641--1651"
, keywords =	"shape approximation, generalized convexity, visibility, isothetic domain, $S-$convex hull, $S-$convex approximation"
, update =	"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."
}

@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"
}

@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"
}

@inproceedings{b-gpp-93
, author =	"Guenter Baer"
, title =	"On a generalized packing problem"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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{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 =	"??"
}

@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"
}

@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{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"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	206
, publisher =	"Springer-Verlag"
, address =	"New Delhi, India"
, month =	dec
, year =	1985
, pages =	"176--195"
, precedes =	"b-goph-87"
, update =	"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-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"
}

@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{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{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"
}

@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"
, update =	"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"
}

@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-guspe-88"
, update =	"93.09 milone+mitchell"
}

@article{bm-guspe-88
, author =	"C. Bajaj and T. T. Moh"
, title =	"Generalized Unfoldings for Shortest Paths in {Euclidean} 3-Space"
, journal =	"Internat. J. Robot. Res."
, volume =	7
, year =	1988
, pages =	"71--76"
, succeeds =	"bm-guspe-85"
, update =	"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"
}

@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."
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"96.05 efrat"
}

@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"
}

@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"
}

@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"
, update =	"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{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"
, month =	"Summer-Fall"
, year =	1989
, pages =	"161--175"
, keywords =	"mesh generation, Delaunay triangulation"
, update =	"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 =	""
, update =	"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"
, institution =	"Istituto di Analisi dei Sistemi"
, year =	1993
, pages =	"??"
, update =	"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"
}

@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"
}

@techreport{b-mpbsp-93
, author =	"C. Ballieux"
, title =	"Motion planning using binary space partitions"
, journal =	"Report"
, number =	"Inf/src/93-25"
, institution =	"Utrecht University"
, year =	1993
, update =	"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"
}

@article{bs-spbtc-88
, author =	"A. Baltsan and M. 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"
}

@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)"
}

@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 =	"??"
, journal =	"Topics in Combinatorics and Graph Theory"
, publisher =	"Physica-Verlag"
, address =	"Geidelberg"
, year =	1990
, pages =	"73--78"
, keywords =	"packing, isothetic"
, update =	"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"
, update =	"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"
, update =	"96.09 devillers, 95.05 korneenko"
}

@article{bc-tdjc-94
, author =	"R. Bar-Yehuda and B. 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 =	"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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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 \path|ftp://geom.umn.edu/pub/qhull.tar.Z|;
view results in $3$-d or $4$-d with
\path|ftp://geom.umn.edu/pub/geomview/geomview-sgi.tar.Z|
or \path|ftp://geom.umn.edu/pub/geomview/geomview-next.tar.Z|"
, update =	"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{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 =	"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"
}

@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
, update =	"97.03 tamassia"
}

@inproceedings{bbdgt-ccgg-97
, author =	"Gill Barequet and Stina S. Bridgeman and Christian A. Duncan and Michael T. Goodrich and Roberto Tamassia"
, title =	"Classic Computational Geometry with {GeomNet}"
, booktitle =	"Proc. Annu. ACM Sympos. Comput. Geom."
, year =	1997
, keywords =	"internet computing, format conversion, client-server, CGC, Brown"
, update =	"97.03 tamassia"
}

@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"
, update =	"96.05 efrat"
}

@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"
, update =	"95.09 jones"
}

@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"
, update =	"96.05 efrat"
}

@inproceedings{bs-plibp-94
, author =	"G. Barequet and M. Sharir"
, title =	"Piecewise-Linear Interpolation between Polygonal Slices"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"93--102"
, update =	"94.09 jones, 94.01 jones"
}

@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"
}

@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"
}

@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"
}

@article{b-srds-83
, author =	"R. E. Barnhill"
, title =	"A Survey of the Representation and Design of Surfaces"
, journal =	"IEEE Comput. Graph. Appl."
, 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{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."
}

@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{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"
}

@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"
}

@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"
}

@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{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"
}

@article{bgv-srmpd-97
, author =	"Rakesh D. Barve and Edward F. Grove and Jeffrey Scott Vitter"
, title =	"Simple Randomized Mergesort on Parallel Disks"
, booktitle =	"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{b-ighdp-95
, author =	"Alexander 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 =	"97.03 agarwal, 95.09 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 =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{b-cvcip-92
, author =	"A. 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"
}

@inproceedings{bgh-dsmd-97
, author =	"J. Basch and L. J. Guibas and J. Hershberger"
, title =	"Data Structure for Mobile Data"
, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, month =	jan
, year =	1997
, pages =	"747--756"
, update =	"97.03 held"
}

@inproceedings{bgr-rrbit-96
, author =	"J. Basch and L. 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 =	"97.03 smid"
}

@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"
}

@article{bsss-or3dc-86
, author =	"C. M. Bastuscheck and E. Schonberg and J. T. Schwartz and M. 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"
}

@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{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
, keywords =	"graph drawing"
, update =	"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 =	"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{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"
}

@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"
}

@inproceedings{b-prcv-75
, author =	"B. G. Baumgart"
, title =	"A polyhedron representation for computer vision"
, booktitle =	"Proc. AFIPS Natl. Comput. Conf."
, volume =	44
, year =	1975
, pages =	"589--596"
}

@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-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"
}

@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{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-96
, author =	"J. Bazik and R. Tamassia and S. P. Reiss and A. van Dam"
, title =	"Software Visualization in Teaching at {Brown University}"
, editor =	"Brown and J. Domingue and B. Price and J. Stasko"
, booktitle =	"Software Visualization: Programming as a Multi-Media Experience"
, publisher =	"MIT Press"
, year =	1996
, keywords =	"software visualization, algorithm animation"
, update =	"97.03 tamassia"
}

@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{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 =	"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-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"
}

@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"
}

@incollection{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 =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"13--25"
, update =	"94.01 rote"
}

@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{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 Interantional Conference on Management of Data"
, year =	1990
, pages =	"322--331"
, update =	"95.01 mitchell"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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"
}

@inproceedings{b-tgsp-92
, author =	"P. Belleville"
, title =	"Two-guarding simple polygons"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"103--108"
}

@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"
, update =	"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"
, update =	"96.05 efrat"
}

@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"
}

@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{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{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"
}

@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{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"
, update =	"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"
}

@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"
, year =	1990
, pages =	"91--99"
}

@article{b-fagts-92
, author =	"J. L. Bentley"
, title =	"Fast algorithms for geometric traveling salesman problems"
, journal =	"ORSA J. Comput."
, volume =	4
, number =	4
, year =	1992
, pages =	"387--411"
}

@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"
}

@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
, year =	1975
, pages =	"509--517"
}

@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"
}

@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{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 =	"J. L. Bentley and T. Ottmann and P. Widmayer"
, title =	"The complexity of manipulating hierarchically defined sets of rectangles"
, booktitle =	"Adv. Comput. Res."
, volume =	1
, year =	1983
, pages =	"127--158"
, keywords =	"isothetic, rectangles, data structuring"
, succeeds =	"bo-cmhds-82"
, update =	"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"
, year =	1979
, pages =	"643--647"
, precedes =	"b-carcg-81"
}

@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 transformation"
, journal =	"J. Algorithms"
, volume =	1
, year =	1980
, pages =	"301--358"
, succeeds =	"sb-tsdsd-79"
, update =	"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"
, keywords =	""
, update =	"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"
}

@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"
}

@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{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"
, update =	"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-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, link distance"
, update =	"93.09 held"
}

@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{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"
}

@techreport{bdds-cscut-95
, author =	"M. de Berg and O. Devillers and K. Dobrindt and O. 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/prisme/biblio/search.html"
, update =	"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 translation"
, booktitle =	"Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
, year =	1996
, update =	"97.03 agarwal, 96.05 agarwal"
}

@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"
, update =	"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.ruu.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"
}

@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 =	"M. de Berg and M. de Groot"
, title =	"Binary space partitions for sets of cubes"
, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
, nickname =	"CG'94"
, year =	1994
, pages =	"84--88"
, update =	"94.05 schwarzkopf"
}

@inproceedings{bgo-nrbsp-94
, author =	"M. de Berg and M. de Groot and M. 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"
, update =	"95.01 schwarzkopf+smid, 94.05 schwarzkopf"
}

@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"
, update =	"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.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
, precedes =	"bghosst-rgdu-95"
, update =	"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.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
, succeeds =	"bghosst-rgdu-94"
, update =	"95.09 devillers+schwarzkopf"
}

@inproceedings{bgh-vdt3s-94
, author =	"M. de Berg and L. 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"
, update =	"94.09 jones, 94.01 jones"
}

@article{bgh-vdt3s-96
, author =	"M. de Berg and L. 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 =	"96.05 smid"
}

@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
, update =	"94.05 devillers+schwarzkopf, 93.09 milone+mitchell"
}

@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"
}

@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"
}

@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.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-02.ps.gz"
, update =	"94.05 schwarzkopf, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{bkn-spqrw-91
, author =	"M. de Berg and M. van Kreveld and B. 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"
}

@techreport{bkno-fsppo-90t
, author =	"M. de Berg and M. van Kreveld and B. 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 =	"bvno-fsppo-90i"
, update =	"94.05 schwarzkopf"
}

@inproceedings{bkno-fsppo-90i
, author =	"M. de Berg and M. van Kreveld and B. 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"
, succeeds =	"bkno-fsppo-90t"
, update =	"94.05 schwarzkopf"
}

@article{bkno-spqrw-92
, author =	"M. de Berg and M. van Kreveld and B. 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"
}

@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"
}

@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."
, year =	1991
, pages =	"228--232"
, succeeds =	"bks-plzkf-91t"
}

@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.ruu.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"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@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"
, update =	"96.05 efrat"
}

@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"
, update =	"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{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"
}

@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-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"
}

@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"
}

@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{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"
, update =	"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"
, update =	"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"
}

@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"
}

@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{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"
, update =	"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"
, series =	"Lecture Notes Comput. Sci."
, volume =	583
, publisher =	"Springer-Verlag"
, address =	"Sao Paulo"
, year =	1992
, pages =	"46--60"
, precedes =	"beemt-eiot-93"
, update =	"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-96
, author =	"M. Bern and D. Eppstein"
, title =	"Approximation algorithms for geometric problems"
, editor =	"Dorit S. Hochbaum"
, booktitle =	"Approximation Problems for NP-Hard Problems"
, publisher =	"PWS Publishing Company"
, address =	"Boston, MA"
, year =	1996
, pages =	"296--345"
, note =	"ISBN -534-94968-1"
, update =	"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"
, update =	"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"
, update =	"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 =	1
, edition =	2
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1995
, pages =	"47--123"
, keywords =	"survey paper, mesh generation, optimal triangulation, Steiner triangulation"
, succeeds =	"be-mgot-92i"
, update =	"97.03 pocchiola"
}

@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"
}

@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"
, update =	"93.09 jones"
}

@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"
, comments =	"To appear in J. Comput. Sys. Sci."
}

@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"
, address =	"Providence, RI"
, year =	1991
, pages =	"45--66"
, keywords =	"arrangements, horizon, pseudo lines"
, update =	"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"
}

@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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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"
}

@incollection{be-aagp-95
, author =	"Marshall W. Bern and David Eppstein"
, title =	"Approximation algorithms for geometric problems"
, chapter =	8
, editor =	"Dorit Hochbaum"
, booktitle =	"Approximation Algorithms for NP-hard Problems"
, publisher =	"PWS Publishing"
, year =	1996
, pages =	"296--345"
, update =	"97.03 aronov"
}

@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"
}

@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-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"
}

@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"
}

@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"
}

@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"
, update =	"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"
, update =	"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"
, update =	"93.09 tamassia"
}

@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"
}

@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-ahsc-93
, author =	"M. Bertolotto and E. Bruzzone and L. {De Floriani}"
, title =	"Acyclic hierarchical simplicial complexes"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"279--284"
, update =	"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"
}

@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 spacefillig curve heuristics for the {Euclidean} {Travelling} {Salesman} {Problem}"
, journal =	"Oper. Res. Lett."
, volume =	8
, number =	5
, year =	1989
, pages =	"241--244"
, keywords =	"optimization"
, update =	"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"
}

@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"
, update =	"95.09 mitchell"
}

@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"
}

@inproceedings{b-rasdc-94
, author =	"S. N. Bespamyatnykh"
, title =	"The Region Approach for some Dynamic Closest-Point Problems"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"75--80"
, update =	"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 =	"??--??"
, update =	"93.09 milone+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"
}

@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{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"
}

@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 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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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."
}

@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"
}

@techreport{bcestu-csts-90
, author =	"B. Bhattacharya and J. Czyzowicz and P. Egyed and I. Stojmenovi{\'c} and G. Toussaint 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 =	"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"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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
, year =	1991
, pages =	"93--119"
, keywords =	"stabbing, line fitting"
, update =	"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"
}

@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"
}

@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"
, update =	"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 =	"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{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"
}

@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{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"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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"
}

% ### This reference is bogus---I cannot find it in JACM 88--92!
@article{b-sdtd-90
, author =	"E. A. Bier"
, title =	"Snap-Dragging in Three Dimensions"
, journal =	"J. ACM"
, year =	1990
, pages =	"193--203"
, keywords =	"Methodology and Techniques, Interaction techniques, Scene composition, interactive design, geometric construction, constraint systems"
, update =	"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 =	"??"
}

@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"
}

@incollection{bn-esodd-88
, author =	"H. Bieri and W. Nef"
, title =	"Elementary set operations with $d$-dimensional polyhedra"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"97--112"
}

@incollection{bs-olacs-91
, author =	"Hanspeter Bieri and Peter-Michael Schmidt"
, title =	"An on-line algorithm for constructing sweep planes in regular position"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"27--35"
, update =	"94.01 rote"
}

@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"
}

@book{b-agt-93
, author =	"N. Biggs"
, title =	"Algebraic Graph Theory"
, publisher =	"Cambridge University Press"
, year =	1993
, note =	"2nd edition"
, update =	"95.01 matousek"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"1--12"
, update =	"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"
}

@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 =	"Wiley"
, year =	1964
, pages =	"93--128"
, keywords =	"triangulation, three-dimensional, shellability, topology"
, update =	"95.09 korneenko"
, annote =	"possibly some other topics"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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{blsz-om-93
, author =	"A. Bj{\"o}rner and M. {Las Vergnas} and N. White and B. Sturmfels and G. Ziegler"
, title =	"Oriented Matroids"
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1993
, update =	"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.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"
}

@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"
}

@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"
}

@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. Internat. Conf. Data Eng."
, site =	"Los-Angeles, Calif."
, year =	1990
, pages =	"380--388"
, keywords =	"data structuring"
, update =	"95.05 korneenko"
}

@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"
}

@incollection{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"
, 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"
}

@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"
}

@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"
, update =	"96.05 efrat"
}

@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"
}

@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"
}

@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"
}

@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."
}

@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 =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@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 =	"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 =	"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"
, cites =	"py-spwm-89"
}

@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{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-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"
}

@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
}

@article{behw-clgcv-89
, author =	"A. Blumer and A. Ehrenfeucht and D. Haussler and M. Warmuth"
, title =	"Classifying learnable geometric concepts with 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"
}

@book{b-iha-07
, author =	"Maxime Bocher"
, title =	"Introduction to higher algebra"
, publisher =	"Macmillan"
, year =	1907
, update =	"97.03 tamassia"
}

@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 =	"New York--Berlin--Heidelberg"
, year =	1987
, update =	"95.05 agarwal"
}

@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{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{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
}

@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"
}

@inproceedings{bp-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 =	"96.09 tamassia, 93.09 tamassia"
}

@inproceedings{b-asmra-86
, author =	"J. D. 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"
, 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 =	"J.-D. 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, H.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 =	"93.09 milone+mitchell"
}

@inproceedings{b-rs-85
, author =	"J.-D. 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)"
, update =	"94.09 jones, 93.09 milone+mitchell"
}

@inproceedings{b-r2d3d-84
, author =	"J.-D. 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"
, 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."
}

@article{b-srpcs-88
, author =	"J.-D. 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 =	"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."
}

@inproceedings{bcddy-acchs-92
, author =	"J. D. Boissonnat and A. C{\'e}r{\'e}zo and O. Devillers and J. Duquesne and M. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, update =	"97.03 devillers, 96.01 devillers, 93.09 devillers"
}

@techreport{bcdt-osc3d-91t
, author =	"J.-D. Boissonnat and A. C{\'e}r{\'e}zo and O. Devillers and M. 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/prisme/biblio/search.html"
, keywords =	"Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
, precedes =	"bcdt-osc3d-91i, bcdt-oscdt-96"
, update =	"97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@inproceedings{bcdt-osc3d-91i
, author =	"J.-D. Boissonnat and A. C{\'e}r{\'e}zo and O. Devillers and M. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
, succeeds =	"bcdt-osc3d-91t"
, precedes =	"bcdt-oscdt-96"
, update =	"97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@article{bcdt-oscdt-96
, author =	"J.-D. Boissonnat and A. C{\'e}r{\'e}zo and O. Devillers and M. 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.inria.fr/prisme/biblio/search.html"
, succeeds =	"bcdt-osc3d-91t, bcdt-osc3d-91i"
, update =	"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)$}."
}

@techreport{bcl-spbcp-91
, author =	"J.-D. Boissonnat and A. C{\'e}r{\'e}zo and J. 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 =	"95.01 devillers, 93.09 rote"
}

@inproceedings{bcl-spbcp-92
, author =	"J.-D. Boissonnat and A. C{\'e}r{\'e}zo and J. 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 =	"95.01 devillers, 93.09 rote"
}

@article{bcl-spbcp-94
, author =	"J.-D. Boissonnat and A. C\'er\'ezo and J. Leblond"
, title =	"Shortest paths of bounded curvature in the plane"
, journal =	"Internat. J. Intell. Syst."
, volume =	10
, year =	1994
, pages =	"1--16"
, update =	"95.01 devillers"
}

@inproceedings{bcdry-ctbc-94
, author =	"J.-D. Boissonnat and J. Czyzowicz and O. Devillers and J.-M. Robert and M. 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
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, update =	"97.03 devillers, 96.01 devillers, 95.05 agarwal"
}

@techreport{bcduy-clcst-95
, author =	"J.-D. Boissonnat and J. Czyzowicz and O. Devillers and J. Urrutia and M. 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 =	"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 =	"J.-D. Boissonnat and J. Czyzowicz and O. Devillers and J. Urrutia and M. Yvinec"
, title =	"Computing largest circles separating two sets of segments"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"173--178"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"separation, containment, largest disk, Voronoi diagrams"
, update =	"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."
}

@inproceedings{bddp-mpsr-92
, author =	"J.-D. Boissonnat and O. Devillers and L. Donati and F. Preparata"
, title =	"Motion planning for a spider robot"
, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
, year =	1992
, pages =	"2321--2326"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"motion planning, legged robot"
, precedes =	"bddp-mplrs-95"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@article{bddp-mplrs-95
, author =	"J.-D. Boissonnat and O. Devillers and L. Donati and F. 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.inria.fr/prisme/biblio/search.html"
, succeeds =	"bddp-mpsr-92,bddp-spsr-92"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers"
}

@inproceedings{bddp-spsr-92
, author =	"J.-D. Boissonnat and O. Devillers and L. Donati and F. 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"
, update =	"95.09 devillers, 95.01 devillers"
}

@article{bdp-cu3ct-91
, author =	"J.-D. Boissonnat and O. Devillers and F. 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.inria.fr/prisme/biblio/search.html"
, keywords =	"convex hull, motion planning, legged robot"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@techreport{bdp-cu3ct-90
, author =	"J.-D. Boissonnat and O. Devillers and F. 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/prisme/biblio/search.html"
, precedes =	"bdp-cu3ct-91"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
}

@techreport{bdsty-arsol-90
, author =	"J.-D. Boissonnat and O. Devillers and R. Schott and M. Teillaud and M. 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/prisme/biblio/search.html"
, succeeds =	"bt-hrodt-86"
, precedes =	"bdsty-olgag-91"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
}

@article{bdsty-arsol-92
, author =	"J.-D. Boissonnat and O. Devillers and R. Schott and M. Teillaud and M. 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 =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"randomized algorithms, Delaunay triangulation, semi-dynamic algorithms, arrangement of line-segments"
, succeeds =	"bdsty-olgag-91"
, update =	"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."
}

@inproceedings{bdsty-olgag-91
, author =	"J.-D. Boissonnat and O. Devillers and R. Schott and M. Teillaud and M. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, succeeds =	"bdsty-arsol-90"
, precedes =	"bdsty-arsol-92"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@techreport{bdt-dchov-90
, author =	"J.-D. Boissonnat and O. Devillers and M. 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/prisme/biblio/search.html"
, keywords =	"randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
, succeeds =	"bdt-olcho-90, bt-hrodt-86"
, precedes =	"bdt-schov-93"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell"
}

@article{bdt-schov-93
, author =	"J.-D. Boissonnat and O. Devillers and M. 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.inria.fr/prisme/biblio/search.html"
, keywords =	"randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
, succeeds =	"bdt-olcho-90"
, update =	"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 =	"J.-D. Boissonnat and O. Devillers and M. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, comments =	"to appear in Algorithmica"
, precedes =	"bdt-schov-93"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
}

@inproceedings{bd-rcuet-92
, author =	"J. D. Boissonnat and K. 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"
}

@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 =	""
, update =	"95.09 mitchell"
}

@article{bd-olcue-96
, author =	"J. D. Boissonnat and K. T. G. 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 =	"96.05 smid"
}

@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"
}

@inproceedings{bg-3dsd-93
, author =	"J.-D. Boissonnat and B. 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 =	"94.05 devillers"
}

@techreport{bg-tdrcs-92
, author =	"J.-D. Boissonnat and B. 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.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
, keywords =	"shape reconstruction, medical images, Delaunay triangulation"
, update =	"95.09 devillers, 95.01 devillers, 93.09 held"
}

@inproceedings{bg-tdrcs-93
, author =	"J.-D. Boissonnat and B. 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 =	"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."
}

@book{bl-gr-89
, title =	"Geometry and Robotics"
, editor =	"J.-D. Boissonnat and J.-P. Laumond"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, publisher =	"Springer-Verlag"
, year =	1989
, keywords =	"book"
}

@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"
, update =	"96.05 efrat"
}

@inproceedings{bl-chbc-96
, author =	"J.-D. Boissonnat and S. Lazard"
, title =	"Convex hulls of bounded curvature"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"14--19"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@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 =	""
, update =	"95.09 mitchell"
}

@inproceedings{bt-hrodt-86
, author =	"J.-D. Boissonnat and M. 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"
, update =	"93.09 milone+mitchell"
}

@techreport{bt-rcdt-89
, author =	"J.-D. Boissonnat and M. 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 =	"95.09 devillers, 95.01 devillers, 93.09 devillers"
}

@article{bt-rcdt-93
, author =	"J.-D. Boissonnat and M. 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 =	"95.09 devillers, 95.01 devillers, 93.09 devillers"
}

@book{by-ga-95
, author =	"J.-D. Boissonnat and M. Yvinec"
, title =	"G\'eom\'etrie algorithmique"
, publisher =	"Ediscience international"
, address =	"Paris"
, year =	1995
, url =	"http://www.inria.fr/prisme/personnel/yvinec/livre.html"
, update =	"96.01 devillers"
}

@inproceedings{by-psncp-89
, author =	"J.-D. Boissonnat and M. 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"
}

@article{by-psncp-92
, author =	"J.-D. Boissonnat and M. 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"
}

@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"
}

@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"
}

@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{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"
}

% also attributed to North-Holland (Amsterdam) and Maxmillan Press (Hong Kong)
@book{bm-gta-76
, author =	"J. A. Bondy and U. S. R. Murty"
, title =	"Graph Theory with Applications"
, publisher =	"North-Holland"
, address =	"New York, NY"
, year =	1976
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

% ### 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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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"
, update =	"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"
, update =	"97.03 devillers+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"
}

@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 arrangments of lines"
, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
, year =	1996
, pages =	"143--148"
, update =	"97.03 agarwal, 96.09 mitchell"
}

@incollection{beflmrsw-ovrg3d-94
, author =	"P. Bose and H. Everett and S. 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-ovrg3d-97"
, update =	"97.03 rote, 96.09 romanik"
}

@incollection{behflmrrswz-ovrg3d-97
, author =	"P. Bose and H. Everett and Michael E. Houle and S. Fekete and A. Lubiw and H. Meijer and K. Romanik and G. Rote and T. Shermer and S. Whitesides and Christian Zelle"
, title =	"A visibility representation for graphs in three dimensions"
, booktitle =	"??"
, journal =	"Journal of Graph Algorithms and Applications"
, year =	1997
, pages =	"??--??"
, note =	"submitted"
, keywords =	"graph drawing, visibility"
, succeeds =	"beflmrsw-ovrg3d-94, fhw-nrvrg-96"
, update =	"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{bglosu-fp-93
, author =	"P. Bose and L. 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"
, update =	"93.09 milone+mitchell"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"96.05 mitchell"
}

@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"
}

@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{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"
, update =	"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"
}

@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"
, update =	"97.03 devillers"
}

@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"
, update =	"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"
}

@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"
}

@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"
}

@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{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
, pages =	"152pp."
, update =	"95.05 korneenko"
}

@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 L. 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"
}

@article{bddg-fep-85
, author =	"J. E. Boyce and D. P. Dobkin and R. L. {Drysdale, III} and L. 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"
}

@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
}

@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{b-idss-79
, author =	"J. W. Boyse"
, title =	"Interference detection among solids and surfaces"
, journal =	"Commun. ACM"
, volume =	22
, year =	1979
, pages =	"3--9"
}

@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
, update =	"96.01 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
, update =	"95.05 smid"
}

@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-pgm-80
, author =	"I. C. Braid and R. C. Hillyard and I. A. Stroud"
, title =	"Polyhedra in geometric modelling"
, editor =	"K. W. Brodlie"
, booktitle =	"Mathematical Methods in Computer Graphics and Design"
, publisher =	"Academic Press"
, address =	"London, England"
, year =	1980
, pages =	"123--141"
}

@article{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 =	"Brodlie K. W."
, journal =	"Math. Methods in Computer Graphics and Design"
, publisher =	"Academic Press"
, year =	1980
, pages =	"123--141"
, keywords =	"polyhedra, geometric modeling"
, update =	"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"
}

@book{b-gd-95
, 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 =	"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{bmr-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 =	"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"
}

@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{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"
}

@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"
}

@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{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-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-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{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 =	"Elsevier Science Publishers"
, year =	1993
, update =	"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"
}

@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"
, update =	"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"
}

@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"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"329--358"
}

@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-
, author =	"H. Breu and D. G. Kirkpatrick"
, title =	"Unit Disk Graph Recognition is {NP}-hard"
, journal =	"Comput. Geom. Theory Appl."
, note =	"(special issue on Geometric Representations of Graphs, edited by G. {Di Battista} and R. Tamassia, to appear)"
, keywords =	"graph drawing, proximity, NP-hardness"
, update =	"95.09 agarwal+devillers+tamassia, 95.05 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."
, publisher =	"Springer-Verlag"
, year =	1997
, url =	"http://www.cs.brown.edu/cgc/papers/bgt-gdtsw-97.ps.gz"
, keywords =	"graph drawing, system, WWW, orthogonal, planarization, CGC, Brown"
, update =	"97.03 tamassia"
}

@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"
}

@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"
}

@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"
, year =	1993
, pages =	"237--246"
, update =	"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--67"
, update =	"94.09 jones"
}

@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"
, update =	"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"
}

@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"
}

@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{b-aops-94
, author =	"H. Br{\"o}nnimann"
, title =	"Almost Optimal Polyhedral Separators"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"393--394"
, keywords =	"video review"
, update =	"94.09 jones"
}

@phdthesis{b-dga-95
, author =	"H. 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 =	"96.09 devillers"
}

@inproceedings{bc-hhihr-92
, author =	"H. Bronnimann and B. Chazelle"
, title =	"How hard is halfspace range searching?"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"271--275"
}

@inproceedings{bc-ossc-94
, author =	"H. Br{\"o}nnimann and B. Chazelle"
, title =	"Optimal Slope Selection Via Cuttings"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"99--103"
, update =	"94.09 jones"
}

@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{bcp-hhihr-93
, author =	"H. Br{\"o}nnimann and B. Chazelle and J. Pach"
, title =	"How hard is halfspace range searching"
, journal =	"Discrete Comput. Geom."
, volume =	10
, year =	1993
, pages =	"143--155"
, succeeds =	"bc-hhhrs-92"
, update =	"94.01 matousek"
}

@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"
, update =	"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"
}

@book{b-icp-83
, author =	"A. Br{\"o}nsted"
, title =	"An Introduction to Convex Polytopes"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1983
}

@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."
, year =	1983
, pages =	"190--197"
, update =	"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"
}

@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"
}

@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-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
, year =	1979
, pages =	"223--228"
}

@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-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"
}

@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"
}

@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"
}

@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"
, editor =	"Janos Csirik and Horst Bunke"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"227--250"
, keywords =	"matching, shape recognition, vision"
, update =	"95.09 mitchell"
}

@incollection{b-agpc-88
, author =	"B. Br{\"u}derlin"
, title =	"Automatizing geometric proofs and constructions"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"232--252"
}

@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"
}

@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{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{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"
}

@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"
}

@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{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"
}

@incollection{be-ewcst-83
, author =	"W. Bucher and H. Edelsbrunner"
, title =	"On expected- and worst-case segment trees"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"109--125"
, keywords =	"data structuring, searching, segment trees, worst-case analysis, expected-case analysis, intervals"
}

@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"
}

@incollection{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"113--135"
}

@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."
}

@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{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"
}

@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{bhr-saucf-91
, author =	"R. E. Burkard and H. W. Hamacher and G. 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 =	"93.09 rote"
}

@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"
}

@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 =	""
, update =	"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"
}

@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{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"
}

@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}-Workbench: 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 =	"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-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{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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"
}

@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{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"
}

@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"
, update =	"96.09 tamassia"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"381--392"
, update =	"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 =	"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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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-94
, author =	"J. Canny"
, title =	"Computing roadmaps in general semialgebraic sets"
, journal =	"Comput. J."
, volume =	36
, year =	1994
, pages =	"409--418"
, update =	"95.05 agarwal"
}

@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-sagcp-88
, author =	"J. Canny"
, title =	"Some algebraic and geometric configurations in {PSPACE}"
, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"460--467"
}

@book{c-crmp-87
, author =	"J. Canny"
, title =	"The Complexity of Robot Motion Planning"
, publisher =	"MIT Press"
, address =	"Cambridge, MA"
, year =	1987
, keywords =	"doctoral thesis"
, comments =	"revised version of author's Ph.D. thesis, Electrical
		 Engineering and Computer Science Dept., Massachusetts
		 Inst. Tech. 1987"
}

@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"
}

@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."
, year =	1988
, pages =	"306--316"
, comments =	"Submitted to J. ACM"
}

@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"
}

@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"
}

@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"
}

@book{c-crm-87
, author =	"J. F. Canny"
, title =	"The Complexity of Robot Motion"
, series =	"ACM -- MIT Press Doctoral Dissertation Award Series"
, publisher =	"MIT Press"
, year =	1987
, isbn =	"0-262-03136-1"
, update =	"93.09 held"
}

@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{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"
}

@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"
, precedes =	"crw-gc-91"
}

@article{crw-gc-91
, author =	"V. Capoyleas and G. Rote and G. Woeginger"
, title =	"Geometric clusterings"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"341--356"
, keywords =	"cluster analysis"
, succeeds =	"crw-gc-90"
, update =	"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 M. 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 =	"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 M. 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"
, update =	"95.09 wenger, 95.05 agarwal"
}

@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"
}

@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"
}

@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 =	"S. 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 =	"95.09 korneenko"
}

@article{ccs-ncdsd-89
, author =	"S. Carlsson and J. Chen and T. 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 =	"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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"122--134"
, update =	"96.01 smid, 95.05 mitchell"
}

@inproceedings{cj-gt-93
, author =	"S. Carlsson and H. Jonsson"
, title =	"Guarding a treasury"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"85--90"
, update =	"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 =	"94.05 devillers+smid, 93.09 milone+mitchell"
}

@inproceedings{cnn-ogcmw-91
, author =	"S. Carlsson and B. J. Nilsson and S. 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 =	"96.09 devillers"
}

@article{cnn-ogcmw-93
, author =	"S. Carlsson and B. J. Nilsson and S. 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 =	"96.09 devillers"
}

@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-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"
, year =	1980
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@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{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{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"
}

@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-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."
}

@inproceedings{cd-rsbps-95
, author =	"David Cazier and Jean-Fran{\,c}ois Dufourd"
, title =	"A Rewrite System to Build Planar Subdivisions"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"235--240"
, update =	"95.09 jones"
}

@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."
}

@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{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"
}

% ### What is it?
@inproceedings{cr-gaha-86
, author =	"S. B. Chalasani and C. S. Raghavendra"
, title =	"Geometric algorithms on a mesh architecture"
, booktitle =	"Computer Architecture in Pattern Analysis and Machine Intelligence"
, year =	1986
, pages =	"169--175"
, keywords =	"parallel computation"
, update =	"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{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"
}

@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 =	"96.09 devillers"
}

@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"
}

@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{cgkt-oaars-97
, author =	"T. 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."
, publisher =	"Springer-Verlag"
, year =	1997
, note =	"to appear"
, 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 =	"97.03 tamassia"
}

@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"
, update =	"94.09 jones"
}

@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"
, update =	"96.05 efrat"
}

@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"
}

@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"
, keywords =	"ray shooting, linear programming, convex layers, levels"
, update =	"95.09 mitchell"
}

% ### 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"
}

@article{ck-acp-70
, author =	"D. R. Chand and S. S. Kapur"
, title =	"An algorithm for convex polytopes"
, journal =	"J. ACM"
, volume =	17
, year =	1970
, pages =	"78--86"
}

@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"
, update =	"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{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"
}

@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"
}

@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"
}

@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"
, update =	"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 =	"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"
, 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-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 =	"Berlin, Germany"
, year =	1991
, update =	"96.09 agarwal, 95.05 agarwal"
}

@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-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."
}

@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-dpopp-83
, author =	"B. Chazelle"
, title =	"A decision procedure for optimal polyhedron partitioning"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, pages =	"75--78"
}

@techreport{c-fadsi-85
, author =	"B. 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"
}

@article{c-fadsi-88
, author =	"B. Chazelle"
, title =	"A functional approach to data structures and its use in multidimensional searching"
, journal =	"SIAM J. Comput."
, volume =	17
, year =	1988
, pages =	"427--462"
, succeeds =	"c-fadsi-85"
}

@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 =	"B. Chazelle"
, title =	"A spectral approach to lower bounds"
, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1994
, pages =	"674--682"
, update =	"95.01 matousek+smid"
}

@inproceedings{c-tpca-82
, author =	"B. 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"
}

@inproceedings{c-acdl-83
, author =	"B. Chazelle"
, title =	"Algorithms for computing depths and layers"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1983
, pages =	"427--436"
, keywords =	"points, convex"
, update =	"95.09 korneenko"
}

@article{c-asdii-88
, author =	"B. Chazelle"
, title =	"An algorithm for segment-dragging and its implementation"
, journal =	"Algorithmica"
, volume =	3
, year =	1988
, pages =	"205--221"
}

@article{c-iafrn-83
, author =	"B. Chazelle"
, title =	"An improved algorithm for the fixed-radius neighbor problem"
, journal =	"Inform. Process. Lett."
, volume =	16
, year =	1983
, pages =	"193--198"
}

@inproceedings{c-oaitd-89
, author =	"B. 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 =	"93.09 devillers"
}

@article{c-oaitd-92
, author =	"B. 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 =	"93.09 devillers"
}

@inproceedings{c-ochan-91
, author =	"B. 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"
}

@techreport{c-ochap-91
, author =	"B. 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
}

@article{c-ochaa-93
, author =	"B. 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 =	"94.05 matousek"
}

@incollection{c-ads-87
, author =	"B. 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 =	"??--??"
, keywords =	"survey paper, polygons, two-dimensional, three-dimensional, approximation, decomposition, covering, partition, triangulation"
}

@inproceedings{c-cgr-94
, author =	"B. Chazelle"
, title =	"Computational Geometry: A Retrospective"
, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
, year =	1994
, pages =	"75--94"
, update =	"95.01 smid, 94.05 matousek"
}

@incollection{c-cgr-95
, author =	"B. 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 =	1
, edition =	2
, publisher =	"World Scientific"
, year =	1995
, pages =	"22--46"
, keywords =	"survey paper"
, update =	"97.03 pocchiola, 96.05 pocchiola"
}

@phdthesis{c-cgc-79
, author =	"B. 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 =	"93.09 jones, 93.05 jones"
}

@incollection{c-cggof-91
, author =	"B. 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 =	"97.03 aronov, 94.05 matousek"
}

@article{c-cgsc-84
, author =	"B. 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 =	"93.09 held"
}

@article{c-cftcp-87
, author =	"B. Chazelle"
, title =	"Computing on a free tree via complexity-preserving mappings"
, journal =	"Algorithmica"
, volume =	2
, year =	1987
, pages =	"337--361"
}

@inproceedings{c-cdp-81
, author =	"B. Chazelle"
, title =	"Convex decompositions of polyhedra"
, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
, year =	1981
, pages =	"70--79"
, precedes =	"c-cpplb-84"
}

@article{c-cpplb-84
, author =	"B. 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"
}

@inproceedings{c-ccdga-84
, author =	"B. Chazelle"
, title =	"Criticality considerations in the design of geometric algorithms"
, booktitle =	"Proc. 22nd Allerton Conf. Commun. Control Comput."
, year =	1984
, pages =	"71--80"
}

@techreport{c-chdc-91
, author =	"B. Chazelle"
, title =	"Cutting hyperplanes for divide-and-conquer"
, type =	"Manuscript"
, institution =	"Princeton Univ."
, address =	"Princeton, NJ"
, year =	1991
, keywords =	"partition, divide-and-conquer, hyperplanes"
}

@article{c-chdc-93
, author =	"B. 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 =	"93.09 matousek"
}

@inproceedings{c-fsram-85
, author =	"B. 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"
}

@inproceedings{c-fsnaq-83
, author =	"B. 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"
}

@article{c-fsnaq-86
, author =	"B. 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"
}

@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 =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@incollection{c-hsh-83
, author =	"B. 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 =	"95.09 korneenko"
}

@article{c-hsh-85
, author =	"B. 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 =	"95.09 korneenko"
}

@inproceedings{c-iies-84
, author =	"B. Chazelle"
, title =	"Intersecting is easier than sorting"
, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
, year =	1984
, pages =	"125--134"
, precedes =	"c-rcsi-86"
}

@inproceedings{c-lbolr-95
, author =	"B. Chazelle"
, title =	"Lower bounds for off-line range searching"
, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
, year =	1995
, pages =	"733--740"
, update =	"95.09 smid"
}

@article{c-lbors1-90
, author =	"B. Chazelle"
, title =	"Lower bounds for orthogonal range searching, {I}: the reporting case"
, journal =	"J. ACM"
, volume =	37
, year =	1990
, pages =	"200--212"
, succeeds =	"c-lbcms-86"
, precedes =	"c-lbors2-90"
}

@article{c-lbors2-90
, author =	"B. Chazelle"
, title =	"Lower bounds for orthogonal range searching, {II}: the arithmetic model"
, journal =	"J. ACM"
, volume =	37
, year =	1990
, pages =	"439--463"
, succeeds =	"c-lbors1-90"
}

@inproceedings{c-lbcms-86
, author =	"B. 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"
}

@article{c-lbcpr-89
, author =	"B. 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"
}

@inproceedings{c-ntcos-85
, author =	"B. 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"
, update =	"93.09 milone+mitchell"
}

@article{c-clps-85
, author =	"B. Chazelle"
, title =	"On the convex layers of a planar set"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	"IT-31"
, year =	1985
, pages =	"509--517"
}

@inproceedings{c-prsig-87
, author =	"B. 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"
}

@article{c-rcsi-86
, author =	"B. Chazelle"
, title =	"Reporting and counting segment intersections"
, journal =	"J. Comput. Syst. Sci."
, volume =	32
, year =	1986
, pages =	"156--182"
, succeeds =	"c-iies-84"
}

@inproceedings{c-sdssf-85
, author =	"B. 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 =	"95.09 korneenko"
}

@article{c-stgsi-87
, author =	"B. 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 =	"93.09 milone+mitchell"
}

@article{c-blbph-83
, author =	"B. Chazelle"
, title =	"The bottom-left bin-packing heuristic: an efficient implementation"
, journal =	"IEEE Trans. Comput."
, volume =	"C-32"
, year =	1983
, pages =	"697--707"
}

@incollection{c-pcp-83
, author =	"B. Chazelle"
, title =	"The polygon containment problem"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"1--33"
}

@techreport{c-ptapv-82
, author =	"B. 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
}

@techreport{c-tbsns-88
, author =	"B. 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
}

@techreport{c-tsplt-90t
, author =	"B. 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
, precedes =	"c-tsplt-90i"
}

@inproceedings{c-tsplt-90i
, author =	"B. 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"
}

@article{c-tsplt-91a
, author =	"B. Chazelle"
, title =	"Triangulating a simple polygon in linear time"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"485--524"
, succeeds =	"c-tsplt-90i"
}

@inproceedings{c-vigt-82
, author =	"B. Chazelle"
, title =	"{VLSI} implementations of geometric tasks"
, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
, year =	1982
, pages =	"615--624"
, keywords =	"parallel computation"
, update =	"95.09 korneenko"
}

@techreport{cb-tsnis-92
, author =	"B. 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 =	"95.09 mitchell, 93.09 milone+mitchell"
}

@article{ccpy-nubns-86
, author =	"B. 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 =	"93.09 milone+mitchell"
}

@inproceedings{cd-dpicp-79
, author =	"B. 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"
}

@inproceedings{cd-diec-80
, author =	"B. 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"
}

@article{cd-icott-87
, author =	"B. Chazelle and D. P. Dobkin"
, title =	"Intersection of convex objects in two and three dimensions"
, journal =	"J. ACM"
, volume =	34
, year =	1987
, pages =	"1--27"
, keywords =	"polygons, polyhedra, intersection, detection"
, succeeds =	"cd-diec-80"
}

@incollection{cd-ocd-85
, author =	"B. 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"
}

@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"
, update =	"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"
, update =	"95.09 mitchell"
}

@inproceedings{cdl-cler-84
, author =	"B. 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"
, series =	"Lecture Notes Comput. Sci."
, volume =	166
, publisher =	"Springer-Verlag"
, year =	1984
, pages =	"43--54"
, keywords =	"rectangles, Voronoi diagrams"
, precedes =	"cdl-cler-86"
, update =	"93.09 drysdale"
}

@article{cdl-cler-86
, author =	"B. 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 =	"93.09 drysdale"
}

@inproceedings{ce-iacko-85
, author =	"B. 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"
}

@article{ce-iacko-87
, author =	"B. 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"
}

@inproceedings{ce-oails-88
, author =	"B. 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"
}

@article{ce-oails-92
, author =	"B. Chazelle and H. Edelsbrunner"
, title =	"An optimal algorithm for intersecting line segments in the plane"
, journal =	"J. ACM"
, volume =	39
, year =	1992
, pages =	"1--54"
, keywords =	"intersection, topological sweep, segments"
, succeeds =	"ce-oails-88"
}

@inproceedings{ce-lsdst-86
, author =	"B. 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"
}

@article{ce-lsdst-87
, author =	"B. 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"
}

@article{ce-oscpr-85
, author =	"B. 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"
}

@incollection{ce-oscpr-85a
, author =	"B. 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 =	"95.09 korneenko"
}

@inproceedings{cegghss-rspug-91
, author =	"B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and J. Hershberger and M. 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 =	"93.09 rote"
}

@article{cegghss-rspug-94
, author =	"B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and J. Hershberger and M. 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 =	"96.05 pocchiola+ramkumar"
}

@inproceedings{ceggs-ibwen-93
, author =	"B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and M. 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 =	"97.03 agarwal+gaertner+salinger, 93.09 milone+mitchell"
}

@article{ceggsw-ibwen-95
, author =	"B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and M. Sharir and E. Welzl"
, title =	"Improved bounds on weak $\epsilon$-nets for convex sets"
, journal =	"Discrete Comput. Geom."
, volume =	13
, year =	1995
, pages =	"1--15"
, update =	"96.05 smid"
}

@techreport{cegpsss-cccll-??
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and R. Pollack and R. Seidel and M. 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 =	"93.09 milone+mitchell"
}

@inproceedings{cegs-sessr-89
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. 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--192"
, keywords =	"cell decomposition, random sampling, triangulation"
, precedes =	"cegs-sessr-91"
}

@article{cegs-sessr-91
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. 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"
}

@techreport{cegs-ablsp-89
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. 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"
}

@article{cegs-ablsp-94
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. 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 =	"94.05 matousek+sharir"
}

@inproceedings{cegs-dwclp-92
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. Sharir"
, title =	"Diameter, width, closest line pair, and parametric searching"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"120--129"
}

@article{cegs-dwclp-93
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. 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 =	"94.01 matousek"
}

@inproceedings{cegss-cfals-91
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. 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 =	"94.05 aronov"
}

@article{cegss-cfals-93
, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. 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 =	"95.09 agarwal, 94.05 sharir, 94.01 matousek"
}

@article{ceg-ccc-89
, author =	"B. Chazelle and H. Edelsbrunner and L. 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"
}

@inproceedings{ceg-cccp-87
, author =	"B. Chazelle and H. Edelsbrunner and L. 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"
}

@inproceedings{ceghss-sdash-90
, author =	"B. Chazelle and H. Edelsbrunner and L. J. Guibas and J. E. Hershberger and R. Seidel and M. Sharir"
, title =	"Slimming down by adding; selecting heavily covered points"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"116--127"
}

@inproceedings{cegpsss-ccclr-90
, author =	"B. Chazelle and H. Edelsbrunner and L. J. Guibas and R. Pollack and R. Seidel and M. 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"
}

@article{cegpsss-ccclr-92
, author =	"B. Chazelle and H. Edelsbrunner and L. J. Guibas and R. Pollack and R. Seidel and M. 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"
}

@inproceedings{cegs-lscaa-89
, author =	"B. Chazelle and H. Edelsbrunner and L. J. Guibas and M. 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 =	"96.09 smid"
}

@article{cegss-lsca-96
, author =	"B. Chazelle and H. Edelsbrunner and L. J. Guibas and M. Sharir and J. Stolfi"
, title =	"Lines in space: {C}ombinatorics and algorithms"
, journal =	"Algorithmica"
, volume =	15
, year =	1996
, pages =	"428--447"
, update =	"97.03 agarwal, 96.09 smid"
}

@inproceedings{cf-dvrsi-88
, author =	"B. 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"
, annote =	"derandomizes with polynomial overhead"
}

@article{cf-dvrsi-90
, author =	"B. 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"
, annote =	"derandomizes with polynomial overhead"
}

@article{cf-plhur-93
, author =	"Bernard Chazelle and Joel Friedman"
, title =	"Point Location among Hyperplanes and Unidirectional Ray-Shooting"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1993
, pages =	"53--62"
, update =	"95.05 agarwal"
}

@article{cf-plhur-94
, author =	"B. 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"
, succeeds =	"cf-plhur-93"
, update =	"95.01 matousek+smid"
}

@article{cg-fc1ds-86
, author =	"B. Chazelle and L. J. Guibas"
, title =	"Fractional cascading: {I}. {A} data structuring technique"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"133--162"
}

@article{cg-fc2a-86
, author =	"B. Chazelle and L. J. Guibas"
, title =	"Fractional cascading: {II}. {Applications}"
, journal =	"Algorithmica"
, volume =	1
, year =	1986
, pages =	"163--191"
}

@inproceedings{cg-vippg-85
, author =	"B. Chazelle and L. 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"
}

@article{cg-vippg-89
, author =	"B. Chazelle and L. 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"
}

@inproceedings{cgl-pgd-83
, author =	"B. Chazelle and L. 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"
}

@article{cgl-pgd-85
, author =	"B. Chazelle and L. 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"
}

@article{ci-cccdr-84
, author =	"B. Chazelle and J. Incerpi"
, title =	"Computing connected components of {$D$}-ranges"
, journal =	"Bull. EATCS"
, volume =	22
, year =	1984
, pages =	"9--11"
}

@inproceedings{ci-tpdc-83
, author =	"B. 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"
, 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 =	"B. 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"
}

@article{cl-cpp-86
, author =	"B. Chazelle and D. T. Lee"
, title =	"On a circle placement problem"
, journal =	"Computing"
, volume =	36
, year =	1986
, pages =	"1--16"
, update =	"95.09 agarwal"
}

@techreport{cm-dosch-92
, author =	"B. 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 =	"96.09 agarwal+devillers"
}

@article{cm-dosch-95
, author =	"B. 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 =	"96.09 devillers+orourke"
}

@inproceedings{cm-ltdao-93
, author =	"B. 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 =	"96.09 agarwal, 93.05 smid"
}

@article{cm-ltdao-96
, author =	"B. 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 =	"97.03 agarwal+smid, 96.09 agarwal, 93.05 smid"
}

@inproceedings{cm-mcvrc-81
, author =	"B. 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"
}

@article{cm-mcvrc-85
, author =	"B. 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"
}

@techreport{c-accgc-96
, author =	"B. 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 \path|http://www.cs.duke.edu/~jeffe/compgeom/taskforce.html|"
, update =	"97.03 pocchiola+tamassia, 96.09 orourke"
}

@inproceedings{cosw-cds-84
, author =	"B. 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"
}

@inproceedings{cp-dbnp-92
, author =	"B. 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"
}

@inproceedings{cp-tncp-89
, author =	"B. 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"
}

@article{cp-tncp-90
, author =	"B. 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"
}

@inproceedings{cp-hrsaa-85
, author =	"B. 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"
, update =	"93.09 milone+mitchell"
}

@article{cp-hrsaa-86
, author =	"B. 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"
}

@inproceedings{cr-cpsma-89
, author =	"B. 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"
}

@incollection{cr-lbcsr-92
, author =	"B. 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 =	"94.01 smid, 93.09 matousek+milone+mitchell"
}

@article{cr-srrpm-96
, author =	"B. 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 =	"96.09 devillers"
}

@article{cr-ccpso-91
, author =	"B. 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"
}

@article{cs-agpli-90
, author =	"B. Chazelle and M. 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"
}

@inproceedings{csw-qoubs-90
, author =	"B. Chazelle and M. Sharir and E. 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"
}

@article{csw-qoubs-92
, author =	"B. Chazelle and M. Sharir and E. 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 =	"93.09 matousek"
}

@inproceedings{cs-bst-94
, author =	"B. Chazelle and N. Shouraboura"
, title =	"Bounds on the Size of Tetrahedralizations"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"231--239"
, update =	"94.09 jones, 94.01 jones"
}

@article{cw-qorss-89
, author =	"B. Chazelle and E. 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"
}

@techreport{cw-rsvdc-88
, author =	"B. Chazelle and E. 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"
}

@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"
, update =	"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"
, update =	"94.09 jones"
}

@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 =	"96.09 agarwal, 96.05 mitchell"
}

@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 =	"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"
}

@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"
}

@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"
}

@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 =	"??--??"
, update =	"94.05 devillers"
}

@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 =	"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"
, update =	"95.09 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-mmtdp-86"
, update =	"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"
, update =	"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"
}

% 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"
}

@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"
}

@article{ct-ecadc-87
, author =	"M. Chen and P. Townsend"
, title =	"Efficient and consistent algorithms for determining the containment of points in polygons and polyhedra"
, journal =	"EUROGRAPHICS '87"
, publisher =	"North-Holland"
, year =	1987
, pages =	"423--437"
, keywords =	"point location"
, update =	"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"
}

@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"
, update =	"96.05 efrat"
}

@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{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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"
}

@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"
}

@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"
, update =	"93.09 jones"
}

@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 =	"93.09 milone+mitchell"
}

% ### verify authors: cf. cls-fiplp-85
@inproceedings{cj-fiplp-86
, author =	"F. Cheng and W.-C. Jiaan"
, title =	"Finding the intersection points of a line with a polygon and its applications"
, booktitle =	"Proc. ACM Annu. Computer Sci. Conf."
, year =	1986
, pages =	"448--448"
, keywords =	"intersection, polygon"
, succeeds =	"cls-fiplp-85"
, update =	"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"
}

@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"
, update =	"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"
}

@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"
}

@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{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 =	"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 =	"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"
, update =	"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 =	"Computing and Combinatorics, Proc. First Ann. Internat. Conf., COCOON'95, Xi'an, China, August 1995"
, series =	"Lecture Notes Comput. Sci."
, volume =	959
, publisher =	"Springer-Verlag"
, address =	"Berlin"
, year =	1995
, pages =	"275--291"
, precedes =	"aacktrx-tin-96"
, update =	"97.03 rote"
}

@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{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"
}

@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{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"
}

@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
, update =	"94.09 lambert, 93.09 devillers"
}

@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"
}

@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"
, update =	"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"
, year =	1989
}

@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"
, update =	"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"
}

@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"
}

@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"
, update =	"93.09 drysdale"
}

@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{cghkkk-gpmem-
, author =	"L. P. Chew and M. T. Goodrich and D. P. Huttenlocher and K. Ked em and J. M. Kleinberg and D. Kravets"
, title =	"Geometric pattern matching under {Euclidean} motion"
, journal =	"Comput. Geom. Theory Appl."
, note =	"To appear"
, update =	"97.03 tamassia"
}

@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"
, update =	"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"
}

@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-plscc-93"
, update =	"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"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@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."
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"346--357"
, update =	"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{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"
}

@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"
}

@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-
, 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."
, note =	"to appear"
, url =	"http://www.cs.brown.edu/cgc/papers/ct-ospml-.ps.gz"
, keywords =	"Shortest Path, Minimum-Link Path, dynamic algorithm, CGC, Brown"
, succeeds =	"ct-ospmlp-94"
, update =	"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 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{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{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"
}

@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 =	"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 =	"96.01 smid, 95.09 mitchell"
}

@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"
}

@inproceedings{cf-nrtsg-89
, author =	"N. Chin and S. Feiner"
, title =	"Near real time shadow generation using bsp trees"
, booktitle =	"Proc. SIGGRAPH '89"
, year =	1989
, pages =	"99--106"
, update =	"97.03 schwarzkopf"
}

@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"
}

@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-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"
}

@article{cn-wrsp-91
, author =	"W.-P. Chin and S. Ntafos"
, title =	"Watchman routes in simple polygons"
, journal =	"Discrete Comput. Geom."
, volume =	6
, number =	1
, year =	1991
, pages =	"9--31"
, keywords =	"visibility"
, succeeds =	"cn-owr-88"
}

@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. H. 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 =	"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
}

@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."
}

@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{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{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"
, update =	"95.09 agarwal, 94.09 jones, 94.01 jones"
}

@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"
, update =	"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"
, update =	"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"
, update =	"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"
}

@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{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
, 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 =	"96.09 agarwal"
}

@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"
, update =	"93.09 erickson"
}

% ### 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."
}

@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"
}

@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
}

@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"
, update =	"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 =	"96.09 tamassia"
}

@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{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"
, update =	"96.09 tamassia"
}

%  ### {bf XXXXXX HASN'T THIS PAPER APPEARED SOMEWHERE BY NOW?????},
@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"
, 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"
}

@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"
}

@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-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-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{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"
}

@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
	\path|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{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"
}

@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{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"
}

@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 L. Guibas and M. Sharir and E. 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"
}

@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"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"93.09 erickson"
}

@inproceedings{c-sede-92
, author =	"K. L. Clarkson"
, title =	"Safe and effective determinant evaluation"
, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"387--395"
}

@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"
}

@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"
}

@inproceedings{cegsw-ccbac-88
, author =	"K. L. Clarkson and H. Edelsbrunner and L. J. Guibas and M. Sharir and E. 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"
}

@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"
, update =	"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"
}

@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"
}

@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 =	"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"
}

@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-89a"
, 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"
}

@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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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{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"
}

@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"
}

@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
, update =	"96.09 agarwal, 96.05 agarwal"
}

@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{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"
, update =	"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"
}

@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"
}

@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"
, update =	"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"
, update =	"95.01 tamassia"
}

@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"
}

@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 L. 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 =	"97.03 held"
}

@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--406"
, keywords =	"Steiner tree"
, update =	"96.09 devillers, 95.09 korneenko"
}

@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-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"
}

@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"
}

@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
, year =	1987
, pages =	"200--208"
, succeeds =	"c-sdsno-84"
}

@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"
, update =	"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
, year =	1989
, pages =	"792--810"
, keywords =	"arrangements, $d$-dimensional, points, counting, parametric search technique"
}

@article{cs-vppt-89
, author =	"R. Cole and M. 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"
}

@inproceedings{csy-khrp-84
, author =	"R. Cole and M. 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"
}

@article{csy-khrp-87
, author =	"R. Cole and M. 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"
}

@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-apspi-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 =	"96.09 orourke"
}

@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-85"
}

@article{cy-grp-85
, author =	"R. Cole and C. K. Yap"
, title =	"Geometric retrieval problems"
, journal =	"Inform. Control"
, volume =	63
, year =	1985
, pages =	"39--57"
, keywords =	"locus approach, reporting, subdivisions, points"
, succeeds =	"cy-grp-83"
}

@article{cy-sp-87
, author =	"R. Cole and C. K. Yap"
, title =	"Shape from probing"
, journal =	"J. Algorithms"
, volume =	8
, year =	1987
, pages =	"19--38"
, keywords =	"detection, probing, two-dimensional, worst-case analysis, lower bounds"
}

@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"
}

@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"
}

@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"
, update =	"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"
}

% perhaps ``GI'' stands for Gesellschaft f{\"u}r Informatik?
% Yes, it does! (g.rote)
@incollection{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"
, address =	"Berlin, West Germany"
, year =	1975
, pages =	"134--183"
, update =	"97.03 schwarzkopf, 96.09 agarwal, 93.09 rote"
}

@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-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-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"
}

@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"
}

@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{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"
}

@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 =	"95.09 korneenko"
}

@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
}

@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"
, update =	"93.09 jones"
}

@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{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"
}

@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"
}

@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{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."
}

@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"
}

@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"
}

@article{cl-dvg-92
, author =	"C. Coullard and A. Lubiw"
, title =	"Distance visibility graphs"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, year =	1992
, pages =	"349--362"
, keywords =	"visibility, geometric graphs"
, succeeds =	"cl-dvg-91"
, update =	"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{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"
}

% ### 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"
, publisher =	"Wiley"
, address =	"New York, NY"
, year =	1961
}

@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"
}

@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
}

@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
}

@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{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
}

@inproceedings{cl-hcdc-89
, author =	"Henry Crapo and Jean-Paul Laumond"
, title =	"{Hamiltonian} Cycles in {Delaunay} Complexes"
, booktitle =	"Geometry and Robotics Workshop Proceedings, Toulouse France, 26--28 May 1988"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1989
, pages =	"292--305"
, update =	"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"
}

@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}"
, number =	"??"
, institution =	"Univ. Montreal"
, address =	"Montreal, PQ"
, year =	1986
, succeeds =	"w-tapp-86"
, update =	"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 =	"96.09 devillers"
}

@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-90"
, update =	"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"
}

@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-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{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."
}

@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."
}

@inproceedings{c-dvloo-92
, author =	"I. F. Cruz"
, title =	"{DOODLE}: A visual language for object-oriented databases"
, booktitle =	"Proc. ACM SIGMOD"
, year =	1992
, pages =	"71--80"
, keywords =	"graph drawing"
, update =	"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."
, year =	1990
, pages =	"361--369"
, keywords =	"$d$-dimensional, packing, heuristics"
, update =	"96.09 devillers, 95.09 korneenko"
}

@article{ct-nagp-97
, author =	"G. Csizmadia and G. T\'oth"
, title =	"Note on an art gallery problem"
, journal =	"Comput. Geom. Theory Appl."
, year =	1997
, pages =	"??--??"
, note =	"To appear."
, keywords =	"visibility"
, update =	"96.09 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"
}

@article{cr-occop-89
, 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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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."
}

@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{eg-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 =	"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"
}

@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."
, year =	1991
, pages =	"41--45"
}

@techreport{c-ldfs-87
, author =	"J. Czyzowicz"
, title =	"Lattice Diagrams with Few Slopes"
, number =	3
, institution =	"Departement D'Informatique, Univerity of Quebec at Hull"
, year =	1987
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@techreport{c-plsp-87
, author =	"J. Czyzowicz"
, title =	"Planar Lattices and the Slope Problem"
, number =	4
, institution =	"Departement D'Informatique, Univerity of Quebec at Hull"
, year =	1987
, keywords =	"graph drawing"
, update =	"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"
, year =	1991
, pages =	"459--464"
}

@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
, update =	"97.03 pocchiola"
}

@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"
}

@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"
}

@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"
}

% ### What is it?
@inproceedings{cru-glmfc-91
, author =	"J. Czyzowicz and I. Rival and J. Urrutia"
, title =	"Galleries and light matchings: {Fat} cooperative guards"
, booktitle =	"Vision Geom.: Proc. AMS Spec. Sess. Hoboken, NJ 1989. Providence"
, year =	1991
, pages =	"21--28"
, keywords =	"visibility, watchman problem"
, update =	"95.09 korneenko"
}

@inproceedings{cru-glmvg-89
, author =	"J. Czyzowicz and I. Rival and J. Urrutia"
, title =	"Galleries, light matchings and visibility graphs"
, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"316--324"
}

@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.}"
, update =	"94.05 devillers"
}

@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"
, update =	"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"
, update =	"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}"
, update =	"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}"
, update =	"94.05 devillers"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{dexw-mmps-89
, author =	"P. Dale and P. Eades and L. Xuemin and N. C. Wormald"
, title =	"Measuring motion planning strategies"
, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
, year =	1989
, pages =	8
}

@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"
, update =	"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 1990"
, series =	"Lecture Notes Comput. Sci."
, volume =	452
, publisher =	"Springer-Verlag"
, year =	1990
, pages =	"165--172"
, precedes =	"df-ssh-93"
, update =	"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"
}

@incollection{af-ssh-90
, author =	"F. D'Amore and P. G. Franciosa"
, title =	"Separating sets or hyperrectangles"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	452
, year =	1990
, pages =	"165--172"
, keywords =	"$d$-dimensional, hyperrectangle, separation"
, update =	"95.05 korneenko"
}

@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--231"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"layout, packing, nesting, placement, reachability, Minkowski sum, configuration space, decomposition"
, update =	"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-flaaprp-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.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-fmaap-97"
, update =	"97.03 daniels+devillers, 93.09 milone+mitchell"
}

@article{dmr-fmaap-97
, author =	"K. Daniels and V. Milenkovic and D. Roth"
, title =	"Finding the maximum area axis-parallel rectangle in a polygon"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"125--148"
, succeeds =	"dmr-fmaap-93"
, update =	"97.03 devillers"
}

@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{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."
}

@book{d-lpe-63
, author =	"G. B. Dantzig"
, title =	"Linear Programming and Extensions"
, publisher =	"Princeton University Press"
, address =	"Princeton, NJ"
, year =	1963
}

@incollection{dgk-htr-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 =	"95.09 wenger"
}

% 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"
, address =	"Berlin, West Germany"
, year =	1987
, pages =	"58--67"
, keywords =	"graph drawing"
, update =	"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{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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"74--85"
, keywords =	"graph drawing, 3D, convex, polyhedron"
, update =	"96.01 smid, 95.05 mitchell+tamassia"
}

@techreport{dg-ocop3-97
, 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}, under submission to {\it CGTA}"
, institution =	"Center for Geometric Computing"
, address =	"Johns Hopkins Univ."
, year =	1997
, update =	"97.03 tamassia"
}

@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"
}

@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"
, update =	"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 =	"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"
, update =	"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 =	"94.05 devillers+smid, 93.09 milone+mitchell"
}

@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--456"
, update =	"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"
}

@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 =	"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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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"
, update =	"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"
}

@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"
}

@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 =	"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 =	"96.01 smid, 95.09 mitchell"
}

@inproceedings{di-csgs-94
, author =	"A. Datta and Ch. Icking"
, title =	"Competitive Searching in a Generalized Street"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"175--182"
, update =	"94.09 jones, 94.01 jones"
}

@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"
}

@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 =	"Internat. Conf. Parallel Processing"
, 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."
, series =	"Lecture Notes Comput. Sci."
, volume =	338
, publisher =	"Springer-Verlag"
, address =	"New Delhi, India"
, month =	dec
, year =	1988
, pages =	"108--121"
, update =	"95.01 smid, 93.09 datta"
}

@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"
}

@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
, month =	dec
, year =	1990
, pages =	"270--285"
, update =	"93.09 datta"
}

@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"
, update =	"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"
, update =	"94.09 jones"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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"
}

@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"
}

@article{dh-dgnus-
, author =	"R. Davidson and D. Harel"
, title =	"Drawing Graphs Nicely Using Simulated Annealing"
, journal =	"Commun. ACM"
, note =	"To appear"
, keywords =	"graph drawing, physical simulation, force-directed"
, succeeds =	"dh-dgnus-89"
, update =	"95.09 tamassia, 95.05 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"
, update =	"93.05 jones"
}

@book{dm-dasd-75
, author =	"J. C. Davis and M. J. McCullagh"
, title =	"Display and analysis of spatial data"
, publisher =	"Wiley"
, address =	"New York, NY"
, year =	1975
}

@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"
}

@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"
}

@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"
}

@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."
}

@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"
}

@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{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"
}

@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
, year =	1992
, pages =	"290--300"
, update =	"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 algorithms 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."
}

@article{dpp-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 representation"
, update =	"95.09 korneenko"
}

@incollection{dpp-sssfe-88
, author =	"H. {De Fraysseix} and J. Pach and R. Pollack"
, title =	"Small sets supporting {Fary} embeddings of graphs"
, booktitle =	"Proc. Annu. ACM Sympos. Theory Comput."
, year =	1988
, pages =	"426--433"
, keywords =	"graph representation"
, update =	"95.09 korneenko"
}

@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-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."
, year =	1995
, pages =	"13--20"
, note =	"Proc. SIGGRAPH '95"
, keywords =	"triangulation, surface approximation, computer graphics, hardware, graphics pipeline"
, update =	"95.09 mitchell"
}

@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-92
, author =	"M. DeHaemer and M. Zyda"
, title =	"Simplification of objects rendered by polygonal approximations"
, journal =	"Computers and Graphics"
, volume =	15
, year =	1992
, pages =	"175--184"
, keywords =	"surface approximation, simplification"
, update =	"95.05 agarwal"
}

@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"
, update =	"95.01 mitchell"
}

@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 =	"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 Course Grained Multicomputers"
, booktitle =	"Proc. 7th ACM Sympos. Parallel Algorithms Architect."
, year =	1995
, pages =	"27--33"
, update =	"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."
, 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"
}

@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 =	"fr-spgac-93"
, update =	"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"
, update =	"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. International Conference on Parallel Processing"
, 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"
}

@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"
}

@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"
}

@article{dhs-ccsrm-89
, 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 =	"F. Dehne and R. Klein"
, title =	"A sweepcircle algorithm for {Voronoi} diagrams"
, booktitle =	"Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG'87"
, year =	1987
, pages =	"59--70"
, update =	"94.01 dehne"
}

@techreport{dk-oacvd-87
, author =	"F. Dehne and R. 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 =	"94.09 bernal"
}

@inproceedings{dk-bspwa-94
, author =	"Frank Dehne and Rolf Klein"
, title =	"``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
, editor =	"I. Pr{\'{\i}}vara and B. Roven and P. Ru{{\v z}}i{{\v c}}ka"
, booktitle =	"Proc. Internat. Sympos. Math. Found. Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	841
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"296--305"
, update =	"97.03 icking"
}

@article{dmr-ocmcc-94
, author =	"F. Dehne and R. Miller and A. Rau-Chaplin"
, title =	"Optical clustering on a mesh-connected computer"
, journal =	"Internat. J. Parallel Program."
, year =	"1993/94"
, comments =	"to appear"
, update =	"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 =	"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"
}

@incollection{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 =	"95.09 korneenko, 94.01 dehne"
}

@article{ds-ssots-87
, author =	"F. Dehne and J.-R. Sack"
, title =	"Separability of sets of objects through single translations"
, journal =	"Visual Comput."
, volume =	3
, year =	1987
, pages =	"227--235"
, update =	"93.09 milone+mitchell"
}

@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 =	"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"
}

@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. 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 =	"97.03 rote"
}

@article{ddr-chlts-94
, author =	"V. G. De{\u\i}neko and Ren{\'e} van Dal and G. 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 =	"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-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"
, update =	"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."
}

@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"
}

@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"
}

@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"
}

@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 =	"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"
}

@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
, update =	"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 =	"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"
}

@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"
, succeeds =	"ht-eagp-74"
, update =	"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., Jons Hopkins Univ."
, year =	1987
, keywords =	"polygons, approximation, enclosure, doctoral thesis"
, update =	"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"
}

@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"
}

@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"
}

@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.inria.fr/prisme/biblio/search.html"
, update =	"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-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"
}

@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"
}

@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 =	"O. Devillers"
, title =	"An introduction to randomization in computational geometry"
, journal =	"Theoret. Comput. Sci."
, volume =	157
, year =	1996
, pages =	"35--52"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, update =	"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."
}

@article{d-rysoa-92
, author =	"O. 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 =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon"
, succeeds =	"d-sroa-91"
, update =	"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 =	"O. 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/prisme/biblio/search.html"
, keywords =	"randomized algorithms, Delaunay triangulation, practical issue, degenerate cases"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@inproceedings{d-sroa-91
, author =	"O. Devillers"
, title =	"Simple randomized {$O(n \log^{*} n)$} algorithms"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"141--144"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon"
, precedes =	"d-rysoa-92"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@techreport{d-scspa-90
, author =	"O. 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/prisme/biblio/search.html"
, keywords =	"polygon placement, contact configurations"
, precedes =	"d-scspa-93"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
}

@article{d-scspa-93
, author =	"O. 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.inria.fr/prisme/biblio/search.html"
, keywords =	"motion planning, polygon containment, robotics"
, succeeds =	"d-scspa-90"
, update =	"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 =	"O. Devillers and A. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, precedes =	"df-sabls-96"
, update =	"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 =	"O. Devillers and A. 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.inria.fr/prisme/biblio/search.html"
, succeeds =	"df-sabls-93"
, update =	"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{dg-dbppl-93
, author =	"O. Devillers and M. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"Voronoi, Delaunay, moving points, randomized algorithms, dynamic algorithms, localisation"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers+smid, 94.01 smid, 93.09 devillers+milone+mitchell"
}

@inproceedings{dg-iafch-94
, author =	"O. Devillers and M. 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"
, update =	"96.01 devillers, 94.09 jones"
}

@article{dg-iafch-95
, author =	"O. Devillers and M. 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"
, succeeds =	"dg-iafch-94"
, update =	"96.01 devillers"
}

@article{dgks-qvdmp-96
, author =	"O. Devillers and M. Golin and K. Kedem and S. Schirra"
, title =	"Queries on {Voronoi} Diagrams of Moving Points"
, journal =	"Comput. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"315--327"
, succeeds =	"dgks-rdqvd-94i"
, update =	"97.03 devillers+smid"
}

@techreport{dgks-rdqvd-94t
, author =	"O. Devillers and M. Golin and K. Kedem and S. 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 =	"97.03 devillers, 95.01 smid"
}

@inproceedings{dgks-rdqvd-94i
, author =	"O. Devillers and M. 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"
, update =	"97.03 devillers+smid, 95.01 smid, 94.09 jones"
}

@inproceedings{dmt-fddtl-91
, author =	"O. Devillers and S. Meiser and M. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"randomized algorithms, Delaunay triangulation, dynamizing data structures"
, precedes =	"dmt-fddtl-92"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@article{dmt-fddtl-92
, author =	"O. Devillers and S. Meiser and M. 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.inria.fr/prisme/biblio/search.html"
, keywords =	"randomized algorithms, Delaunay triangulation, dynamizing data structures"
, succeeds =	"dmt-fddtl-91"
, update =	"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 plane
and an order of insertion for these sites, the Delaunay Tree stores all
the successive Delaunay triangulations.  As proved before, the Delaunay
Tree allows the insertion of a site in logarithmic expected time and
linear expected space, when the insertion sequence is randomized.  In this
paper, we describe an algorithm maintaining the Delaunay Tree under
insertions 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 a
deletion, where $n$ is the number of sites currently present in the
strucuture.  For deletions, by expected time, we mean averaging over all
already inserted sites for the choice of the deleted sites.  The algorithm
has been effectively coded and experimental results are given."
}

@techreport{dmt-ssgtu-92t
, author =	"O. Devillers and S. Meiser and M. 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/prisme/biblio/search.html"
, precedes =	"dmt-ssgtu-92i"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}

@inproceedings{dmt-ssgtu-92i
, author =	"O. Devillers and S. Meiser and M. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"duality results, generalized Voronoi diagrams, geometric transforms, upper/lower envelopes"
, succeeds =	"dmt-ssgtu-92t"
, update =	"97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.05 smid"
}

@inproceedings{dm-gvvge-92
, author =	"O. Devillers and N. Mouawad"
, title =	"Guarding vertices versus guarding edges in a simple polygon"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"99--102"
}

@techreport{dp-papaf-96
, author =	"O. Devillers and F. 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"
, update =	"97.03 tamassia"
}

@article{dty-dlals-92
, author =	"O. Devillers and M. Teillaud and M. 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"
, url =	"http://www.inria.fr/prisme/biblio/search.html"
, keywords =	"randomized algorithms, arrangement of line-segments, dynamizing data structures"
, update =	"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{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"
}

@article{dv-cpr3a-77
, author =	"A. K. Dewdney and J. K. Vranch"
, title =	"Convex partition of $R^3$ with applicatton 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 =	"95.09 korneenko"
}

@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{d-ctdd-92
, author =	"T. Dey"
, title =	"On counting triangulations in $d$ dimensions"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"280--285"
, precedes =	"d-ctdd-93"
, update =	"96.09 devillers"
}

@article{d-ctdd-93
, author =	"T. 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 =	"96.09 devillers"
}

@inproceedings{d-oadnh-93
, author =	"T. 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"
, update =	"93.09 milone+mitchell"
}

@inproceedings{d-tcrpa-91
, author =	"T. 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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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"
}

@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"
, update =	"94.09 jones"
}

@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"
, update =	"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{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"
, year =	1995
, pages =	"To appear"
, update =	"97.03 agarwal, 95.09 mitchell"
}

@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"
}

@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"
}

@book{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/papers/compgeo/gd93-v2.tex.Z"
, keywords =	"graph drawing, collection"
, update =	"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"
, precedes =	"dett-adgab-94"
, update =	"95.01 smid, 94.01 tamassia"
}

%, 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"
, update =	"95.01 smid+tamassia"
}

@techreport{dglpttvv-ddges-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 Graphs: an Experimental Study,"
, type =	"Technical Report"
, number =	"CS-96-24"
, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
, year =	1996
, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-24.ps.Z"
, keywords =	"graph drawing, upward, experiments, CGC, Brown"
, update =	"97.03 tamassia"
}

@inproceedings{dglpttvv-ddges-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 Graphs: an Experimental Study,"
, editor =	"S. North"
, booktitle =	"Graph Drawing (Proc. GD '96)"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1997
, note =	"to appear"
, url =	"http://www.cs.brown.edu/cgc/papers/dglpttvv-ddges-97.ps.gz"
, keywords =	"graph drawing, upward, experiments, CGC, Brown"
, update =	"97.03 tamassia"
}

@article{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"
, journal =	"Comput. Geom. Theory Appl."
, note =	"to appear"
, url =	"http://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
, keywords =	"graph drawing, experiments, orthogonal, CGC, Brown"
, update =	"97.03 tamassia, 96.09 tamassia"
}

@unpublished{dglttv-ecfgd-96m
, 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"
, update =	"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"
, update =	"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. of Computer Sci., Brown University"
, year =	1996
, keywords =	"graph drawing, experiments, upward"
, update =	"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 =	"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{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"
}

@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. Workshop Algorithms Data Struct."
, series =	"Lecture Notes Comput. Sci."
, volume =	709
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"151--162"
, update =	"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)"
, 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 =	"97.03 tamassia, 96.09 tamassia"
}

@inproceedings{dlw-swp-
, author =	"G. {Di Battista} and G. Liotta and S. H. Whitesides"
, title =	"The Strength of Weak Proximity"
, booktitle =	"Graph Drawing (Proc. GD '95)"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	"to appear"
, keywords =	"graph drawing, proximity"
, update =	"96.01 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"
}

% 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"
, address =	"Berlin, West Germany"
, year =	1987
, pages =	"277--289"
, keywords =	"graph drawing"
, update =	"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{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 =	"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"
, booktitle =	"Automata, Languages and Programming (Proc. 17th ICALP)"
, series =	"Lecture Notes Comput. Sci."
, volume =	442
, year =	1990
, pages =	"598--611"
, update =	"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-omtcs-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-ogast-90, dt-omtcs-92"
, update =	"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-cgta-
, title =	"Special Issue on Geometric Representations of Graphs"
, editor =	"G. {Di Battista} and R. Tamassia"
, series =	"Comput. Geom. Theory Appl."
, note =	"To appear"
, keywords =	"graph drawing, collection"
, update =	"95.09 tamassia"
}

@book{dt-a-
, title =	"Special Issue on Graph Drawing"
, editor =	"G. {Di Battista} and R. Tamassia"
, series =	"Algorithmica"
, note =	"To appear"
, keywords =	"graph drawing, collection"
, update =	"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"
, update =	"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
, year =	1992
, pages =	"381--401"
, keywords =	"graph drawing"
, update =	"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
}

@inproceedings{dtv-olcpt-94
, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
, title =	"On-Line Convex Planarity Testing"
, booktitle =	"Proc. Graph-Theoretic Concepts in Computer Science"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1994
, keywords =	"graph drawing"
, update =	"94.05 tamassia"
}

@techreport{dtv-olcpt-95
, 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. Computer Science, Brown Univ."
, year =	1995
, note =	"\path|ftp://ftp.cs.brown.edu/pub/techreports/95/cs95-26.ps.Z|"
, update =	"97.03 tamassia"
}

@inproceedings{dtv-osrdp-96
, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
, title =	"Output-Sensitive Reporting of Disjoint Paths"
, booktitle =	"Proc. Computing and Combinatorics Conference"
, 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 =	"97.03 tamassia"
}

@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 =	"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{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"
}

@article{dd-frspp-90
, author =	"M. Dickerson and R. L. Drysdale"
, title =	"Fixed radius search problems for points and segments"
, journal =	"Inform. Process. Lett."
, volume =	35
, year =	1990
, pages =	"269--273"
}

@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"
}

@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"
, update =	"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"
}

@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"
, update =	"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 E. Welzl"
, title =	"Fast Greedy Triangulation Algorithms"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"211--220"
, update =	"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"
, update =	"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"
, update =	"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"
}

@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{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 =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, year =	1989
, pages =	"67--74"
, keywords =	"data structuring, persistent"
, update =	"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"
}

@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"
}

@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"
}

@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-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{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"
, update =	"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
, year =	1989
, pages =	"66--83"
}

@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"
}

@article{d-hcptn-90
, author =	"M. B. Dillencourt"
, title =	"Hamiltonian cycles in planar triangulations with no separating triangles"
, journal =	"J. Graph Theory"
, volume =	14
, year =	1990
, pages =	"31--49"
}

@article{d-rdt-90
, author =	"M. B. Dillencourt"
, title =	"Realizability of {Delaunay} triangulations"
, journal =	"Inform. Process. Lett."
, volume =	33
, year =	1990
, pages =	"283--287"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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 =	"??"
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"??"
, update =	"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"
, update =	"94.09 jones"
}

@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{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"
}

@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 =	"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"
}

@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"
}

@incollection{d-cvdrp-91
, author =	"H. Djidjev"
, title =	"On computing the {Voronoi} diagram of restricted planar figures"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	519
, year =	1991
, pages =	"54--64"
, keywords =	"Voronoi diagram, lower bounds"
, update =	"95.09 korneenko"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, year =	1995
, keywords =	"graph drawing, planarization"
, update =	"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"
}

@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{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"
, update =	"93.09 jones"
}

@article{dghs-eafcr-88
, author =	"D. Dobkin and L. 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 =	"96.09 devillers+orourke, 93.09 goodrich"
}

@article{dhks-cidp-93
, author =	"D. Dobkin and J. Hershberger and D. Kirkpatrick and S. Suri"
, title =	"Computing the intersection-depth of polyhedra"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"518--533"
, update =	"96.05 ramkumar"
}

@inproceedings{dhks-isccd-90
, author =	"D. Dobkin and J. Hershberger and D. Kirkpatrick and S. 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"
}

@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"
}

@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 S. 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"
}

@article{ds-mge-91
, author =	"D. Dobkin and S. 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"
}

@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"
, update =	"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 =	"242--249"
, update =	"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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"71--109"
, keywords =	"survey paper, convex hull, design of algorithms"
}

@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 =	"D. P. Dobkin and R. L. {Drysdale, III} and L. J. Guibas"
, title =	"Finding smallest polygons"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"181--214"
, keywords =	"Voronoi diagrams"
}

@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"
}

@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"
, update =	"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"
}

@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{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"
, update =	"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"
}

@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"
, precedes =	"dk-fdpi-83"
}

@article{dk-fdpi-83
, author =	"D. P. Dobkin and D. G. Kirkpatrick"
, title =	"Fast detection of polyhedral intersection"
, journal =	"Theoret. Comput. Sci."
, volume =	27
, year =	1983
, pages =	"241--253"
, keywords =	"design of algorithms, data structuring, detection, intersection, polyhedra, three-dimensional, convex, hierarchical representations"
, succeeds =	"dk-fdpi-82"
}

@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"
}

@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
, year =	1989
, pages =	"70--87"
, succeeds =	"ds-rgnap-88"
}

@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"
}

@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"
}

@article{dyep-psrq-89
, author =	"D. P. Dobkin and F. F. Yao 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"
, update =	"95.09 korneenko"
}

@phdthesis{d-adraa-94
, author =	"K. 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 =	"96.01 devillers, 95.09 agarwal"
}

@techreport{dmy-ceaig-93t
, author =	"K. Dobrindt and K. Mehlhorn and M. 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 =	"94.01 smid"
}

@inproceedings{dmy-ceaig-93
, author =	"K. Dobrindt and K. Mehlhorn and M. 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 =	"93.09 devillers+milone+mitchell+smid, 93.05 jones"
}

@inproceedings{dy-rchyd-93
, author =	"K. Dobrindt and M. 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 =	"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"
}

@book{d-egt-72
, author =	"C. W. Dodge"
, title =	"Euclidean geometry and transformations"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1972
}

@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{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"
}

@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-85
, author =	"D. Dolev and F. T. Leighton and H. Trickey"
, title =	"Planar Embedding of Planar Graphs"
, editor =	"F. P. Preparata"
, booktitle =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1985
, pages =	"147--161"
, keywords =	"graph drawing"
, update =	"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
, pages =	"1--21"
, keywords =	"plane graph representation, triangulation, area, discrete geometry, NP-completeness"
, update =	"95.09 korneenko"
}

@incollection{dg-patcp-91
, author =	"Salvador Dominguez and Oliver G{\"u}nther"
, title =	"Performance analysis of three curve presentation schemes"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"37--56"
, update =	"94.01 rote"
}

@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"
}

@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"
}

@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"
}

@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 =	"??"
}

% ### authors?
@inproceedings{dbb-r-90
, author =	"B. R. Donald and ?. Baillieul and ?. Brockett"
, title =	"Robotics"
, booktitle =	"Symposia in Applied Mathematics"
, volume =	41
, year =	1990
, pages =	"??"
}

@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"
}

@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"
}

@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"
}

@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-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"
}

@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-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
, note =	"Submitted for publication"
}

@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"
}

@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{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-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
}

@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"
}

@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{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"
}

@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
, pages =	16
, url =	"http://www.tu-graz.ac.at/Rote"
, update =	"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."
}

@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
}

@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-95
, title =	"Computing in {Euclidean} Geometry"
, editor =	"D.-Z. Du and F. K. Hwang"
, series =	"Lecture Notes Series on Computing"
, volume =	1
, edition =	2
, publisher =	"World Scientific"
, year =	1995
, update =	"96.05 pocchiola"
}

@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"
, update =	"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"
}

@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"
, update =	"93.09 jones"
}

@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"
}

@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"
, 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{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"
, comments =	"To appear in SIAM J. Comput."
, update =	"96.09 agarwal+romanik, 96.05 mitchell"
}

@inproceedings{d-vpwmb-93
, author =	"Martin J. Duerst"
, title =	"On vertices and polyhedra without minimal boolean formulae"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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"
, update =	"96.05 efrat"
}

@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"
, update =	"95.09 mitchell"
}

@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"
}

@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"
}

@incollection{d-pdcbe-91
, author =	"Martin J. D{\"u}rst"
, title =	"Preclassification and delayed classification of boundary entities in arbitrary dimensions"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"57--69"
, update =	"94.01 rote"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"97.03 agarwal"
}

@article{d-gatcl-83
, author =	"M. E. Dyer"
, title =	"A geometric approach to two-constraint linear programming with generalized upper bounds"
, journal =	"Adv. Comput. Res."
, volume =	1
, year =	1983
, pages =	"79--90"
, keywords =	"linear programming"
, update =	"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 =	""
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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"
, address =	"Berlin, West Germany"
, year =	1982
, pages =	"239--251"
, keywords =	"graph drawing"
, update =	"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"
}

@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"
}

@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 =	"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"
}

@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"
}

@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"
, precedes =	"elt-adhg-96"
, update =	"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-89
, author =	"P. Eades and X. Lin and N. C. Wormald"
, title =	"Performance Guarantees for Motion Planning with Temporal Uncertainty"
, institution =	"Dept. of Computer Science, Univ. of Queensland"
, address =	"St. Lucia, Queensland"
, year =	1989
}

@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{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"
}

@techreport{er-ccmsp-??
, author =	"P. Eades and D. Rappaport"
, title =	"The complexity of computing minimum separating polygons"
, journal =	"Pattern Recogn. Lett."
, year =	"??"
, comments =	"to appear"
, update =	"93.09 milone+mitchell"
}

@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
, pages =	""
, keywords =	"graph drawing"
, update =	"96.09 tamassia"
}

@article{es-hddg-91
, author =	"P. Eades and K. Sugiyama"
, title =	"How to Draw a Directed Graph"
, journal =	"J. Inform. Process."
, year =	1991
, pages =	"424--437"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@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-rpmst-
, author =	"P. Eades and S. Whitesides"
, title =	"The Realization Problem for {Euclidean} Minimum Spanning Trees is {NP}-hard"
, journal =	"Algorithmica"
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia, to appear)"
, keywords =	"graph drawing, proximity, NP-hardness"
, succeeds =	"ew-rpems-94"
, update =	"96.09 tamassia, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@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"
, update =	"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{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"
}

@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{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
}

@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"
}

@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"
}

% 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 Ta. Asano"
, title =	"A new point-location algorithm and its practical efficiency: comparison with existing algorithms"
, journal =	"ACM Trans. Graph."
, volume =	3
, year =	1984
, pages =	"86--109"
, keywords =	"point location, bucketing, implementing algorithms"
}

@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"
}

@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"
, 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{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 decompositions of non-convex polyhedra"
, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
, nickname =	"FOCS 95"
, year =	1995
, pages =	"To appear"
, update =	"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"
}

@article{e-atccd-90
, author =	"H. Edelsbrunner"
, title =	"An acyclicity theorem for cell complexes in $d$ dimensions"
, journal =	"Combinatorica"
, volume =	10
, year =	1990
, pages =	"251--260"
, succeeds =	"e-atccd-89"
}

@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-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"
}

@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"
, update =	"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-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"
}

@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"
}

@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-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"
, update =	"93.09 jones"
}

@article{e-ueplf-89
, author =	"H. Edelsbrunner"
, title =	"The upper envelope of piecewise linear functions: tight complexity bounds in higher dimensions"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"337--343"
, keywords =	"upper/lower envelope, arrangement of simplices"
}

@article{eghppsss-ajati-89
, author =	"H. Edelsbrunner and L. Guibas and J. Hershberger and J. Pach and R. Pollack and R. Seidel and M. 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"
}

@article{eghsssw-irals-89
, author =	"H. Edelsbrunner and L. Guibas and J. Hershberger and R. Seidel and M. Sharir and J. Snoeyink and E. 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 =	"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 L. Guibas and J. Pach and R. Pollack and R. Seidel and M. 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 =	"95.09 agarwal"
}

@article{egppss-acptc-92
, author =	"H. Edelsbrunner and L. Guibas and J. Pach and R. Pollack and R. Seidel and M. 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 =	"95.09 agarwal"
}

@inproceedings{egs-cmcap-88
, author =	"H. Edelsbrunner and L. Guibas and M. 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 =	"94.05 sharir"
}

@article{egs-cmcap-90
, author =	"H. Edelsbrunner and L. Guibas and M. 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"
}

@article{egs-ueplf-89
, author =	"H. Edelsbrunner and L. Guibas and M. 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"
}

@inproceedings{eg-tsa-86
, author =	"H. Edelsbrunner and L. 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"
}

@article{eg-tsa-89
, author =	"H. Edelsbrunner and L. 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"
}

@inproceedings{eghppsss-ajati-88
, author =	"H. Edelsbrunner and L. J. Guibas and J. Hershberger and J. Pach and R. Pollack and R. Seidel and M. 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"
}

@inproceedings{eghsssw-irals-88
, author =	"H. Edelsbrunner and L. J. Guibas and J. Hershberger and R. Seidel and M. Sharir and J. Snoeyink and E. 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"
}

@article{egs-ccmfa-90
, author =	"H. Edelsbrunner and L. J. Guibas and M. 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"
}

@inproceedings{egs-cmfal-88
, author =	"H. Edelsbrunner and L. J. Guibas and M. 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"
}

@article{egs-oplms-86
, author =	"H. Edelsbrunner and L. J. Guibas and J. Stolfi"
, title =	"Optimal point location in a monotone subdivision"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"317--340"
, keywords =	"data structuring, searching, point location, binary search, directed acyclic graphs, subdivisions, two-dimensional"
}

@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{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."
, year =	1991
, pages =	"224--227"
}

@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"
}

@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 E. 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"
}

@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"
}

@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
, year =	1990
, pages =	"66--104"
, succeeds =	"em-sstcd-88"
}

@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"
, url =	"ftp://cs.uiuc.edu/pub/edels/geometry/shapes-94.tar.Z"
, comments =	"Software in \path|ftp://cs.uiuc.edu/pub/edels/geometry/alpha-2.1a.tar.Z|"
, update =	"94.09 orourke"
}

@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 =	"93--91"
, precedes =	"eos-calha-86"
}

@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 E. Welzl"
, title =	"Stationing guards in rectilinear art galleries"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	28
, year =	1984
, pages =	"167--176"
, keywords =	"design of algorithms, construction, decomposition, visibility, subdivisions, polygons, $c$-oriented, two-dimensional"
}

@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"
}

@article{eos-smcga-84
, 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"
}

@article{eowbhf-rivc-90
, author =	"H. Edelsbrunner and M. H. Overmars and E. 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 =	"95.09 korneenko"
}

@incollection{eow-gfcs-83
, author =	"H. Edelsbrunner and M. H. Overmars and D. Wood"
, title =	"Graphics in {Flatland}: {A} case study"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"35--59"
, keywords =	"design of algorithms, computer graphics, visibility, plane-sweep, trees, two-dimensional"
}

@inproceedings{epss-lebfi-87
, author =	"H. Edelsbrunner and J. Pach and J. T. Schwartz and M. 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}"
}

@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 =	"ep-tpstd-86"
}

@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. Rote and E. 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 =	"93.09 rote"
}

@article{erw-tncst-89
, author =	"H. Edelsbrunner and G. Rote and E. 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 =	"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"
}

@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"
}

@incollection{ess-ztha-91
, author =	"H. Edelsbrunner and R. Seidel and M. 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}"
}

@article{ess-ztha-93
, author =	"H. Edelsbrunner and R. Seidel and M. 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 =	"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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@inproceedings{es-hipac-90
, author =	"H. Edelsbrunner and M. 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"
}

@inproceedings{es-hipac-91
, author =	"H. Edelsbrunner and M. 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"
, year =	1991
, pages =	"253--263"
, succeeds =	"es-hipac-90"
, update =	"93.09 erickson"
}

@techreport{es-mnwsn-87
, author =	"H. Edelsbrunner and M. 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"
}

@article{es-mnwsn-90
, author =	"H. Edelsbrunner and M. 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
, number =	1
, year =	1990
, pages =	"35--42"
, keywords =	"combinatorial geometry, stabbing, convex, Davenport-Schinzel sequences, divide-and-conquer"
, succeeds =	"es-mnwsn-87"
}

@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 S. 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 =	"95.09 korneenko"
}

@techreport{es-nfnpp-86
, author =	"H. Edelsbrunner and S. 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 =	"95.09 korneenko"
}

@techreport{es-pcpxr-86
, author =	"H. Edelsbrunner and S. 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"
}

@article{es-pcpxr-88
, author =	"H. Edelsbrunner and S. 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"
}

@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"
, update =	"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"
}

@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 E. Welzl"
, title =	"Cutting Dense Point Sets in Half"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"203--210"
, update =	"94.09 jones, 94.01 jones"
}

@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"
}

@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"
, update =	"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 E. 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"
}

@article{ew-hrsls-86
, author =	"H. Edelsbrunner and E. 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"
}

@incollection{ew-mesla-84
, author =	"H. Edelsbrunner and E. 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 =	"95.09 korneenko"
}

@article{ew-mnemf-86
, author =	"H. Edelsbrunner and E. 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"
}

@incollection{ew-nessp-83
, author =	"H. Edelsbrunner and E. 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 =	"95.09 korneenko"
}

@article{ew-nlsfs-85
, author =	"H. Edelsbrunner and E. Welzl"
, title =	"On the number of line separations of a finite set in the plane"
, journal =	"J. Combin. Theory Ser. A"
, year =	1985
, pages =	"15--29"
}

@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
}

@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"
}

@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, registratino, fiducials, lattice geometry, number theory"
, succeeds =	"eg-siruc-93"
, update =	"96.09 devillers"
}

@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"
, update =	"96.05 efrat"
}

@inproceedings{els-fmcsh-93
, author =	"A. Efrat and M. Lindenbaum and M. Sharir"
, title =	"Finding maximally consistent sets of halfspaces"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"432--436"
, update =	"94.01 matousek, 93.09 milone+mitchell"
}

@inproceedings{ers-ufwsc-93a
, author =	"A. Efrat and G. Rote and M. 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"
, precedes =	"esr-ufwsc-93b"
, update =	"97.03 rote, 96.09 devillers, 94.05 sharir, 93.09 milone+mitchell+rote"
}

@article{ers-ufwsc-93b
, author =	"A. Efrat and G. Rote and M. 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 =	"esr-ufwsc-93a"
, cites =	"mpssw-ftdlm-94"
, update =	"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 M. 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 =	"94.05 sharir"
}

@article{es-nlaps-96
, author =	"A. Efrat and M. Sharir"
, title =	"A near-linear algorithm for the planar segment center problem"
, journal =	"Discrete Comput. Geom."
, volume =	16
, year =	1996
, pages =	"239--257"
, update =	"97.03 agarwal"
}

@article{esr-ufwsc-93
, author =	"A. Efrat and M. Sharir and G. Rote"
, 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-93"
, update =	"96.09 devillers, 94.05 devillers+matousek+sharir, 93.09 rote"
}

@techreport{esz-cskec-93t
, author =	"A. Efrat and M. 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 =	"93.05 efrat"
}

@inproceedings{esz-cskec-93i
, author =	"A. Efrat and M. 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 =	"96.09 agarwal+devillers, 96.05 agarwal, 93.09 smid, 93.05 jones"
}

@article{esz-cskec-94
, author =	"A. Efrat and M. 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 =	"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{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"
, editor =	"Janos Csirik and Horst Bunke"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"347--376"
, keywords =	"matching, shape recognition, vision"
, update =	"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{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"
}

@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"
}

@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."
}

@inproceedings{e-vasud-93
, author =	"Rudolf Eisenstoeck"
, title =	"Visualization of Algebraic Surfaces Using the {Dexel} Model"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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
, year =	1992
, pages =	"418--424"
, update =	"96.05 agarwal"
}

@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-??
, author =	"H. ElGindy and P. Mitra"
, title =	"Orthogonal shortest route queries among axis parallel rectangular obstacles"
, year =	"??"
, keywords =	"shortest path, parallel algorithm, computational geometry"
, precedes =	"em-osrqa-94"
, update =	"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, 5:219"
, keywords =	"shortest path, parallel algorithm, computational geometry"
, succeeds =	"em-osrqa-??"
, update =	"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 =	"Proceedings of the International Conference on the Foundations of Data Organization"
, publisher =	"Plenum Press"
, address =	"New York"
, year =	1987
, pages =	"249--262"
, 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."
}

@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"
}

@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"
}

@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{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"
}

@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"
, update =	"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."
}

@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"
, update =	"96.09 devillers"
}

@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
}

@incollection{e-mpr-91
, author =	"Peter Engel"
, title =	"On the morphology of polytopes in {$R^d$}"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"71--83"
, keywords =	"combinatorial enumeration"
, update =	"94.01 rote"
, 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$."
}

@article{elw-bggde-90
, author =	"J. Engelfriet and G. Leih and E. Welzl"
, title =	"Boundary graph grammars with dynamic edge relabeling"
, journal =	"J. Comput. Syst. Sci."
, volume =	40
, year =	1990
, pages =	"307--345"
, update =	"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"
}

@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
, year =	1992
, pages =	"360--368"
, keywords =	"optimization, cluster analysis"
, succeeds =	"e-dtdlp-91"
, update =	"93.09 rote"
}

@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
, update =	"95.09 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"
, note =	"\path|http://www.ics.uci.edu/~eppstein/geom.html|"
, 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"
}

@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"
, update =	"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
}

@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"
, year =	1992
}

@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"
}

@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 planar graph"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"33--54"
, succeeds =	"eittwy-mmsfd-90"
}

@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"
, update =	"93.09 jones"
}

@article{eorw-fmakg-92
, author =	"D. Eppstein and M. Overmars and G. 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 =	"93.09 rote"
}

@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"
}

@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"
}

@article{e-sdnp-46
, author =	"P. Erd{\H o}s"
, title =	"On a set of distances of $n$ points"
, journal =	"Amer. Math. Monthly"
, volume =	53
, year =	1946
, pages =	"248--250"
, keywords =	"combinatorial geometry, number theory, unit distances"
}

@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{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"
}

@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"
}

@misc{e-cgp-
, author =	"Jeff Erickson"
, title =	"Computational Geometry Pages"
, note =	"\path|http://www.cs.duke.edu/~jeffe/compgeom/|"
, 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."
, year =	1996
, pages =	"1--9"
, update =	"96.05 efrat"
}

@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"
, update =	"95.09 mitchell"
}

@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"
}

@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"
, update =	"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"
, update =	"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"
}

@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"
}

@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"
}

@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 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."
, year =	1991
, pages =	"149--152"
}

@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"
}

@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"
}

@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"
, update =	"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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"62--73"
, update =	"96.01 smid, 95.05 mitchell"
}

@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"
}

@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"
, update =	"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{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"
}

@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{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{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{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{elosu-scqp-92
, author =	"H. Everett and W. Lenhart and M. 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"
}

@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"
, update =	"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"
}

@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"
, update =	"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-93"
, update =	"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"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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 =	"Applied Computational Geometry (Proc. WACG~'96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"191--202"
, url =	"http://www.cs.ruu.nl/CGAL/Papers/wacg.ps.gz"
, update =	"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"
}

@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)."
}

@inproceedings{fsr-aoosa-87
, author =	"C. Faloutsos and T. Sellis and N. Roussopoulos"
, title =	"Analysis of Object Oriented Spatial Access Methods"
, booktitle =	"Proc. SIGMOD"
, year =	1987
, pages =	"426--439"
, update =	"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"
}

@incollection{fb-rgmtb-91
, author =	"Shiaofen Fang and Beat Br{\"u}derlin"
, title =	"Robustness in geometric modeling --- tolerance-based methods"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"85--101"
, update =	"94.01 rote"
}

@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"
}

@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
}

% 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 =	"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."
}

@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"
}

@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"
}

@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"
}

@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-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 Scientiarum Mathematicarum (Szeged)"
, volume =	"12/A"
, year =	1950
, pages =	"62--67"
, update =	"97.03 pocchiola, 96.05 pocchiola"
}

@techreport{f-cmlrb-92
, author =	"S. 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 =	"95.09 mitchell"
}

@unpublished{fm-gaim-93
, author =	"S. Fekete and J. 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 =	"95.01 mitchell"
}

@mastersthesis{f-dpmp-89
, author =	"S. 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"
}

@inproceedings{f-faasc-92
, author =	"S. 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"
}

@phdthesis{f-gtsp-92
, author =	"S. 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"
}

@inproceedings{fhw-nrvrg-96
, author =	"S. 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 '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"234--241"
, keywords =	"visibility graphs"
, precedes =	"behflmrrswz-ovrg3d-97"
, update =	"97.03 rote, 96.09 orourke"
}

@inproceedings{fp-aosp-93
, author =	"S. 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"
, update =	"93.09 jones"
}

@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"
}

@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"
, update =	"96.05 efrat"
}

@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{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-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{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"
}

@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. 5th IEEE Internat. Conf. Pattern Recogn."
, year =	1980
, pages =	"1040--1043"
}

@inproceedings{fss-mrpdb-81
, author =	"L. Ferrari and P. V. Sankar and J. Sklansky"
, title =	"Minimal rectangular partitions of digitized blobs"
, booktitle =	"Internat. Conf. Patern Recogn."
, year =	1981
, pages =	"1040--1043"
, succeeds =	"fss-mrpdb-84"
, update =	"95.09 korneenko"
}

@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-81"
, update =	"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."
, year =	1991
, pages =	"162--165"
}

@inproceedings{forv-hvvnp-94
, author =	"V. Ferrucci and M. 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"
, update =	"97.03 devillers+smid, 94.09 jones"
}

@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{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-96
, title =	"On-line Algorithms: The State of the Art"
, editor =	"Amos Fiat and Gerhard Woeginger"
, publisher =	"Springer-Verlag"
, year =	1996
, update =	"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"
, 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"
}

@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."
}

@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"
}

@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"
}

@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
}

@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{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"
, update =	"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"
}

@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."
}

@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"
}

@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"
}

@incollection{f-fmcp-93
, author =	"P. Fischer"
, title =	"Finding Maximum Convex Polygons"
, booktitle =	"Proc. 9th Internat. Conf. Fund. Comput. Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	710
, publisher =	"Springer-Verlag"
, address =	"Szeged, Hungary"
, year =	1993
, pages =	"234--243"
, precedes =	"f-spafm-97"
, update =	"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"
}

@incollection{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	710
, publisher =	"Springer-Verlag"
, address =	"Szeged, Hungary"
, year =	1993
, pages =	"244--255"
, update =	"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
, organization =	"Akad. Wissensch. DDR. Inst. Math."
, year =	1986
, pages =	"1--20"
, keywords =	"rectangles, intersection"
, update =	"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"
, organization =	"Akad. Wissensch. DDR. Inst. Math."
, year =	1986
, pages =	"1--19"
, succeeds =	"f-trcgs-89"
, update =	"95.09 korneenko"
}

@incollection{f-trcgs-89
, author =	"T. Fischer"
, title =	"Towards refined classification of geometric search and computation problems"
, booktitle =	"??"
, series =	"Lecture Notes Comput. Sci."
, volume =	378
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"426--437"
, keywords =	"lower bounds, searching, $d$-dimensional"
, precedes =	"f-trcgs-87"
, update =	"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"
}

@book{f-peg-69
, author =	"W. T. Fishback"
, title =	"Projective and {Euclidean} Geometry"
, publisher =	"Wiley"
, address =	"New York, NY"
, year =	1969
}

@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"
}

@book{f-ioig-85
, author =	"P. C. Fishburn"
, title =	"Interval Orders and Interval Graphs"
, publisher =	"Wiley"
, address =	"New York, NY"
, year =	1985
, update =	"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"
}

@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-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"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"575--586"
}

@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."
, year =	1991
, pages =	"187--190"
}

@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"
}

@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"
}

@unpublished{fp-eorsm-94
, author =	"Per-Olof {Fj\"allstr\"om} and Jan Petersson"
, title =	"Evaluation of orthogonal range-searching methods for geometric contact searching"
, institution =	"Dept. Computer Science, {Link\"oping} Univ."
, year =	1994
, note =	"Manuscript (submitted)"
, update =	"95.01 mitchell"
}

@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{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"
}

@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{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"
}

@inproceedings{fmrwy-sioas-90
, author =	"R. Fleischer and K. Mehlhorn and G. Rote and E. 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"
, update =	"93.09 rote"
}

@article{fmrwy-sioas-92
, author =	"R. Fleischer and K. Mehlhorn and G. Rote and E. 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 =	"93.09 rote"
}

@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{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{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"
}

@techreport{f-enphp-??
, author =	"R. W. Floyd"
, title =	"Expected number of points on hull of points drawn from triangle"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@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"
}

@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
, update =	"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{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-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-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 E. 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
, update =	"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 E. 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"
, precedes =	"fhhklsww-dgphr-93"
, update =	"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 E. 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 =	"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"
}

@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"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"185--198"
, keywords =	"implementing algorithms"
}

@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"
}

@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-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"
}

@incollection{f-cg-93
, author =	"S. Fortune"
, title =	"Computational Geometry"
, editor =	"R. Martin"
, booktitle =	"Directions in Computational Geometry"
, publisher =	"Information Geometers"
, year =	1993
, note =	"To appear"
, keywords =	"survey paper"
, update =	"93.05 orourke"
}

@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
, year =	1995
, pages =	"193--213"
, keywords =	"robustness, numerical precision"
, succeeds =	"f-nsa2d-92"
, update =	"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"
}

@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."
, year =	1989
, pages =	"494--505"
}

@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
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"193--233"
, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations"
, update =	"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 =	1
, edition =	2
, publisher =	"World Scientific"
, address =	"Singapore"
, year =	1992
, pages =	"225--265"
, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations"
, update =	"97.03 pocchiola"
}

@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."
, year =	1991
, pages =	"334--341"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"arrangements, implementing algorithms, robust geometric computation"
, update =	"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."
, year =	1993
, pages =	"163--172"
, update =	"93.09 jones"
}

@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"
}

@article{fw-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 =	"97.03 held"
}

@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
, year =	1979
, pages =	"20--23"
, keywords =	"bucketing"
}

@inproceedings{fwy-cmtra-86
, author =	"S. J. Fortune and G. Wilfon 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"
}

@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{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"
, update =	"97.03 agarwal, 94.05 devillers+smid, 93.09 milone+mitchell"
}

@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."
, year =	1985
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

%   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"
}

% original entry claimed volume = "15", number = "2"
@inproceedings{f-bpo-83
, author =	"A. Fournier"
, title =	"Bending polyhedral objects"
, booktitle =	"Proc. 6th IFIP Internat. Sympos. Comput. Hardware"
, year =	1983
, pages =	"??"
}

@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"
}

@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"
}

@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"
}

@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{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 =	"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."
}

@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{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 =	"??"
}

@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{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"
, update =	"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 =	"10--12 June"
, year =	1981
, pages =	"173--180"
, keywords =	"computer graphics, CAD"
, update =	"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 =	"31 July -- 4 August"
, year =	1983
, keywords =	"intersection"
, update =	"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 =	"wrf-aggo-84"
, update =	"93.09 franklin"
}

@article{f-aggo-84
, author =	"Wm. Randolph Franklin"
, title =	"Adaptive Grids for geometric operations"
, journal =	"Cartographica"
, volume =	21
, number =	"2--3"
, month =	"Summer -- Autumn"
, year =	1984
, pages =	"161--167"
, note =	"monograph 32--33"
, keywords =	"intersection, grids"
, succeeds =	"f-aggo-83"
, update =	"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 =	"23--27 July"
, year =	1990
, pages =	"151--160"
, keywords =	"intersection, area, grids, measure, polygons"
, precedes =	"fsskn-ofmop-93"
, update =	"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 =	"20--24 August"
, year =	1984
, pages =	"190--208"
, keywords =	"robustness"
, update =	"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 =	"30 March -- 12 April"
, year =	1985
, pages =	"737--749"
, keywords =	"artificial intelligence"
, update =	"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 =	"July 28--August 2"
, year =	1992
, pages =	"200--203"
, keywords =	"parallel computation, intersection, area"
, update =	"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 EurographicSeminars"
, 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 =	"July 28--August 2"
, year =	1992
, pages =	"235--250"
, keywords =	"splines, tutorial"
, update =	"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 =	"3--5 October"
, year =	1984
, keywords =	"motion planning"
, update =	"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 =	"30 March -- 12 April"
, year =	1985
, pages =	"895--917"
, keywords =	"motion planning"
, update =	"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 =	"27 February -- 3 March"
, year =	1989
, pages =	"1247--1256"
, keywords =	"intersection, CAD, grids"
, update =	"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 =	"2-7 April"
, year =	1989
, pages =	"100--109"
, keywords =	"parallel computation, intersection, CAD, grids"
, update =	"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 =	"26--30 May"
, year =	1986
, pages =	"26--31"
, keywords =	"computer graphics, artificial intelligence"
, update =	"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 =	"5-8 March"
, year =	1990
, pages =	"1646--1654"
, keywords =	"intersection, area, grids"
, update =	"93.09 franklin"
}

@article{fsskn-ofmop-
, 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"
, month =	""
, year =	""
, pages =	""
, keywords =	"intersection, grids, area"
, succeeds =	"f-cmopa-90"
, update =	"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 =	"29 March -- 3 April"
, year =	1987
, pages =	"97--106"
, keywords =	"intersection, artificial intelligence"
, update =	"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."
, month =	nov
, year =	1986
, pages =	"46--55"
, keywords =	"computer graphics, artificial intelligence"
, update =	"93.09 franklin"
}

@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-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"
}

@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
, year =	1990
, pages =	"41--51"
, keywords =	"graph drawing"
, update =	"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{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!"
}

@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"
}

@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-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-luscm-87"
}

@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{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{ft-fhtui-87
, author =	"M. Fredman and R. E. Tarjan"
, title =	"Fibonacci heaps and their uses in improved network optimization problems"
, journal =	"J. ACM"
, volume =	34
, year =	1987
, pages =	"596--615"
}

@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"
}

@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"
}

@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"
}

@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{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"
}

@incollection{f-bfnkg-87
, author =	"H. Freeston"
, title =	"The {BANG} file: a new kind of grid file"
, booktitle =	"SIGMOD Conf. on Management of Data"
, year =	1987
, pages =	"260--269"
, keywords =	"data structuring"
, update =	"95.09 korneenko"
}

@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."
, year =	1991
, pages =	"220--223"
, keywords =	"arrangements, separation"
, succeeds =	"f-scph-91t"
}

@inproceedings{fkmprs-lofp-94
, author =	"R. Freimer and S. Khuller and J. 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 =	"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."
, year =	1990
, pages =	"218--222"
, keywords =	"arrangements, separation, NP-hardness"
, precedes =	"fmp-csua-91"
}

@techreport{fmp-csua-91
, author =	"R. Freimer and J. 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"
}

@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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{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. 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 =	"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."
, year =	1990
, keywords =	"motion planning"
, update =	"95.09 korneenko"
}

@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{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"
}

@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"
}

@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."
}

@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-bkkfa-91"
, update =	"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-bkkfa-89"
, update =	"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"
}

@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"
}

@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"
}

@manual{fk-pyp-90
, author =	"Z. {F\"uredi} and D. Kleitman"
, title =	"The prison yard problem"
, organization =	"MIT"
, year =	1990
, note =	"to appear in {\em Combinatorica}"
, update =	"94.05 devillers"
}

@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"
}

@article{kfhr-opasl-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"
, journal =	"SIAM J. Discrete Math."
, volume =	7
, number =	4
, year =	1994
, pages =	"632--647"
, keywords =	"graph drawing, planar, straight-line, grid, parallel"
, update =	"96.09 tamassia, 93.09 tamassia"
}

@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"
}

@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"
, update =	"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{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{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"
}

@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-lprpt-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 =	"93.09 milone+mitchell"
}

@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
, update =	"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"
, update =	"96.01 smid"
}

@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{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-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-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
}

@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"
}

@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"
}

@book{gs-ssa-1979
, author =	"G. Gane and T. Sarson"
, title =	"Structured Systems Analysis"
, publisher =	"Prentice Hall"
, year =	1979
, update =	"95.01 tamassia"
}

@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"
, update =	"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"
, update =	"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"
}

@incollection{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"55--70"
, precedes =	"gjkmrs-cholr-4scg-88"
}

@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{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{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{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"
, update =	"93.09 milone+mitchell"
}

@book{g-gt-95
, author =	"R. J. Gardner"
, title =	"Geometric Tomography"
, publisher =	"Cambridge University Press"
, year =	1995
, update =	"96.05 orourke"
}

@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{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"
}

@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
, year =	1978
, pages =	"175--179"
}

@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"
}

@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 =	"gt-putdo-96"
, update =	"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."
, publisher =	"Springer-Verlag"
, year =	1997
, url =	"http://www.cs.brown.edu/cgc/papers/gt-nmcfa-97.ps.gz"
, keywords =	"graph drawing, planar, orthogonal, grid"
, update =	"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 (Proc. 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.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 \path|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
, note =	"to appear"
, url =	"http://www.cs.brown.edu/cgc/papers/gt-gsvhs-97.ps.gz"
, keywords =	"graph drawing, upward, 3D, CGC, Brown"
, update =	"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 =	"97.03 agarwal, 95.01 mitchell"
}

@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"
}

@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"
}

@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{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"
}

@article{gw-vcdph-94
, author =	"B. G{\"a}rtner and E. Welzl"
, title =	"{Vapnik}-{Chervonenkis} Dimension and (Pseudo-)Hyperplane Arrangements"
, journal =	"Discrete Comput. Geom."
, volume =	12
, year =	1994
, pages =	"399--432"
, update =	"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"
}

@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"
, update =	"95.09 mitchell"
}

@techreport{g-tdmho-93b
, author =	"B. 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 =	"94.05 devillers"
}

@phdthesis{g-tdmho-93
, author =	"B. 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 =	"94.05 devillers, 93.09 devillers"
}

@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{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"
}

@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"
}

@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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@inproceedings{g-rssp-94
, author =	"L. Gewali"
, title =	"Recognizing S-Star Polygons"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"183--188"
, update =	"94.09 jones"
}

@inproceedings{gmmn-pp0wr-88
, author =	"L. Gewali and A. Meng and J. 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"
}

@article{gmmn-pp0wr-90
, author =	"L. Gewali and A. Meng and J. 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
, month =	"Summer"
, year =	1990
, pages =	"253--272"
, keywords =	"maximum concealment, shortest paths, Voronoi diagrams, continuous Dijkstra, visibility"
, succeeds =	"gmmn-pp0wr-88"
}

@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{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"
}

@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{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"
, update =	"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."
}

@inbook{g-vgmo-91
, author =	"P. K. Ghosh"
, title =	"Vision, geometry, and {Minkowski} operators"
, booktitle =	"Contemporary Mathematics"
, volume =	119
, year =	1991
, pages =	"63--83"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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"
}

@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"
, institution =	"TATA Institute of Fundamental Research"
, address =	"Bombay, India"
, year =	1995
, keywords =	"link distance, shortest paths, competitive ratio, visibility, simple polygons"
, update =	"95.09 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"
}

@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"
}

@article{gg-frpmp-
, author =	"M. Ghouse and M. T. Goodrich"
, title =	"Fast Randomized Parallel Methods for Planar Convex Hull Construction"
, journal =	"Comput. Geom. Theory Appl."
, note =	"To appear"
, update =	"97.03 tamassia"
}

@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{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"
, publisher =	"Chapman and Hall"
, address =	"London"
, year =	1977
, update =	"94.05 devillers"
}

@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
		  \path|http://www.cs.duke.edu/~jsv/report.ps|"
, update =	"97.03 murali"
}

@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
, year =	1991
, pages =	"542--551"
, keywords =	"visibility, aspect graphs"
, update =	"96.09 devillers, 94.09 orourke"
}

@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{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 =	"??"
, volume =	4
, number =	2
, year =	1988
}

@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-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{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{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"
}

@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"
, update =	"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-rt-89
, author =	"A. S. Glassner"
, title =	"Ray Tracing"
, publisher =	"Academic Press"
, year =	1989
, update =	"96.05 pocchiola"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"26--37"
, update =	"96.01 devillers+smid, 95.05 mitchell"
}

@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"
}

@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-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-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--225"
, update =	"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"
}

@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."
, 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''."
}

@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."
}

@article{g-wecss-91
, author =	"D. Goldberg"
, title =	"What Every Computer Scientist Should Know About Floating-Point Arithmetic"
, journal =	"ACM Comput. Surv."
, volume =	32
, number =	1
, month =	mar
, year =	1991
, pages =	"5--48"
, keywords =	"numerical precision, stability, robustness"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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."
}

@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"
, update =	"95.09 mitchell"
}

@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"
, year =	1993
, pages =	"301--310"
, update =	"93.05 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
}

@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"
, update =	"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"
}

@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-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{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"
}

@book{g-agtpg-80
, author =	"M. C. Golumbic"
, title =	"Algorithmic Graph Theory and Perfect Graphs"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1980
}

@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."
, year =	1983
, pages =	"178--186"
}

@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{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."
, year =	1991
, pages =	"183--186"
}

@inproceedings{gr-pacdt-91
, author =	"T. Gonzalez and M. Razzazi"
, title =	"Properties and algorithms for constrained {Delaunay} triangulations"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"114--117"
}

@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
, year =	1994
, pages =	"1--12"
, update =	"96.09 devillers"
}

@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"
}

@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"
, keywords =	"approximation algorithms, d-box partitions, minimize (d-1)-volume, multi-dimensional computational geometry"
, update =	"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"
}

@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"
}

@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."
}

@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"
}

@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 =	"CRC Handbook of Discrete and Computational Geometry"
, editor =	"J. E. Goodman and J. O'Rourke"
, publisher =	"CRC Press"
, year =	1997
, note =	"52 chapters, approx. xiv + 991 pages;
                projected publication: July 1997"
, location =	"Boca Raton, FL"
, update =	"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
, year =	1988
, pages =	"129--138"
, update =	"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"
}

@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"
}

@article{gp-ms-83
, author =	"J. E. Goodman and R. Pollack"
, title =	"Multidimensional sorting"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"484--507"
}

@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-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-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"
, publisher =	"American Mathematical Society and Association for Computing Machinery"
, year =	1991
, update =	"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"
, update =	"95.09 wenger, 94.09 jones, 94.01 jones"
}

@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."
, year =	1991
, pages =	"191--194"
}

@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"
}

@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-irsmcs-90
, author =	"M. T. Goodrich"
, title =	"An Improved Ray Shooting Method for Constructive Solid Geometry Models via Tree Contraction"
, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
, year =	1990
, pages =	"118--128"
, update =	"97.03 tamassia"
}

@article{g-airsm-97
, author =	"M. T. Goodrich"
, title =	"An improved ray shooting method for constructive solid geometry models via tree contraction"
, journal =	"Internat. J. Comput. Geom. Appl."
, year =	1997
, note =	"to appear"
, update =	"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"
, update =	"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"
, update =	"93.09 jones"
}

@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"
}

@article{g-psppt-
, author =	"M. T. Goodrich"
, title =	"Planar separators and parallel polygon triangulation"
, journal =	"J. Comput. Syst. Sci."
, note =	"To appear"
, update =	"97.03 tamassia"
}

@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"
}

@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. 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"
}

@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{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"
, 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"
}

@inproceedings{gmo-pmagp-94
, author =	"M. T. Goodrich and J. S. 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"
, update =	"94.09 jones, 94.01 jones"
}

@article{goy-cvdsl-93
, author =	"M. T. Goodrich and C. {\'O}'D{\'u}nlaing and C. Yap"
, title =	"Computing 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 =	"94.01 goodrich"
}

@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"
}

@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 =	"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"
}

@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."
, year =	1997
, note =	"to appear"
, update =	"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"
}

@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"
}

@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"
}

@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"
, update =	"93.09 jones"
}

@article{gt-dtdpl-97
, author =	"M. T. Goodrich and R. Tamassia"
, title =	"Dynamic trees and dynamic point location"
, journal =	"SIAM J. Comput."
, year =	1997
, note =	"to appear"
, update =	"97.03 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 =	"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"
}

@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"
}

@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"
}

@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."
, year =	1996
, note =	"Proc. SIGGRAPH '96"
, keywords =	"collision detection"
, comments =	"To Appear"
, update =	"96.09 devillers, 96.05 klosowski"
}

@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"
, update =	"96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
}

@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
}

@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"
, update =	"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"
, update =	"94.09 jones"
}

@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"
}

@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
}

@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
, update =	"97.03 gaertner+salinger"
}

@book{grs-rt-90
, author =	"R. L. Graham and B. L. Rothschild and J. Spencer"
, title =	"Ramsey Theory"
, publisher =	"J. Wiley \& Sons"
, year =	1990
, update =	"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"
}

@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 =	"Wiley"
, address =	"Chichester"
, year =	1981
, pages =	"3--19"
, 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"
}

@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 =	"94.05 devillers+smid, 93.09 milone+mitchell"
}

@incollection{g-dpcp-83
, author =	"D. H. Greene"
, title =	"The decomposition of polygons into convex parts"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"235--259"
, annote =	"minimal decomposition; finds optimal in $O(n^{4})$
		 time, constant-factor in $O(n \log n)$"
}

@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."
}

@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"
}

@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"
}

@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"
}

@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 =	"To appear"
, update =	"97.03 agarwal, 95.09 mitchell"
}

@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"
}

@inproceedings{g-pcdlp-93
, author =	"Peter Gritzmann"
, title =	"Polytope Containment And Determination By Linear Probes"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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"
, update =	"95.09 mitchell"
}

@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"
}

@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"
}

@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"
}

@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"
}

% ### others?
@article{go-eptvs-91
, author =	"P. Gritzmann and others"
, title =	"Embedding a Planar Triangulation with Vertices at Specified Points"
, journal =	"Amer. Math. Monthly"
, volume =	98
, number =	2
, year =	1991
, pages =	"165--166"
, update =	"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-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"
}

@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
}

@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"
}

@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"
}

@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 =	"Second edition 1994"
, update =	"97.03 gaertner+salinger"
}

@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"
}

% 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 =	"Elsevier Science Publishers"
, year =	1993
, update =	"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"
}

@inproceedings{g-as-72
, author =	"B. Gr{\"u}nbaum"
, title =	"Arrangements and spreads"
, booktitle =	"Regional Conf. Ser. Math., Amer. Math. Soc."
, site =	"Providence, RI"
, year =	1972
, pages =	"??"
}

@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 =	"Wiley"
, address =	"New York, NY"
, year =	1967
}

@article{g-ct-58
, author =	"B. Gr{\"u}nbaum"
, title =	"On common transversals"
, journal =	"Arch. Math."
, volume =	9
, year =	1958
, pages =	"465--469"
}

@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{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{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"
}

@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"
}

@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"
}

@inproceedings{ghms-vdahf-93
, author =	"L. Guibas and D. Halperin and J. Matou{\v s}ek and M. 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"
, update =	"96.09 agarwal, 93.09 milone+mitchell"
}

@inproceedings{gh-msp-94
, author =	"L. Guibas and J. Hershberger"
, title =	"Morphing Simple Polygons"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"267--276"
, update =	"94.09 jones, 94.01 jones"
}

@inproceedings{ghlst-ltavs-86
, author =	"L. Guibas and J. Hershberger and D. Leven and M. 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"
}

@inproceedings{ghs-citds-90
, author =	"L. 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"
}

@article{ghs-citds-91
, author =	"L. 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 =	"94.01 rote"
, annote =	"replaces the bridge tree data structure used in eghsssw-irals-89"
}

@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"
, update =	"95.09 mitchell"
}

@inproceedings{gmr-vdmpp-91
, author =	"L. Guibas and J. 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 =	1991
, pages =	"113--125"
, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences"
}

@inproceedings{gor-efpp-91
, author =	"L. Guibas and M. Overmars and J.-M. Robert"
, title =	"The exact fitting problem for points"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"171--174"
, precedes =	"gor-efpp-96"
, update =	"96.09 devillers"
}

@article{gor-efpp-96
, author =	"L. Guibas and M. 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-96"
, update =	"96.09 devillers"
}

@inproceedings{gos-ilsrs-88
, author =	"L. Guibas and M. Overmars and M. 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"
}

@techreport{gos-rsipl-89
, author =	"L. Guibas and M. Overmars and M. 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"
}

@inproceedings{gss-cscah-90
, author =	"L. 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"
}

@techreport{gs-atlrp-90
, author =	"L. Guibas and M. Sharir"
, title =	"Arrangements of Thick lines and Related problems"
, type =	"Manuscript"
, year =	1990
, update =	"93.09 milone+mitchell"
}

@incollection{gs-caa-93
, author =	"L. Guibas and M. 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"
, year =	1993
, pages =	"9--36"
, keywords =	"survey paper, arrangements, lower envelopes, Davenport-Shinzel sequences, face complexity, partitioning"
, update =	"93.09 erickson"
}

@article{gsc-srttd-87
, author =	"L. 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 =	"93.09 matousek"
}

@article{g-cgvpi-??
, author =	"L. J. Guibas"
, title =	"Computational geometry and visualization: {Problems} at the interface"
, journal =	"??"
, year =	"??"
, pages =	"45--59"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ghhlw-sepap-95
, author =	"L. 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 =	"95.09 halperin"
}

@article{gh-cvgnl-85
, author =	"L. 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"
}

@inproceedings{gh-ospqs-87
, author =	"L. 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"
}

@article{gh-ospqs-89
, author =	"L. J. Guibas and J. Hershberger"
, title =	"Optimal shortest path queries in a simple polygon"
, journal =	"J. Comput. Syst. Sci."
, volume =	39
, year =	1989
, pages =	"126--152"
, succeeds =	"gh-ospqs-87"
, precedes =	"h-ovgat-89"
}

@article{ghlst-ltavs-87
, author =	"L. J. Guibas and J. Hershberger and D. Leven and M. 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"
}

@inproceedings{ghms-apsml-91
, author =	"L. J. Guibas and J. E. Hershberger and J. 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 =	"95.01 mitchell"
}

@article{ghms-apsml-93
, author =	"L. J. Guibas and J. E. Hershberger and J. 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 =	"95.01 mitchell"
}

@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"
, address =	"Berlin, Germany"
, year =	1990
, pages =	"414--431"
, precedes =	"gks-ricdv-92"
, update =	"96.09 agarwal, 93.09 rote"
, annote =	"Main result: If the order of point insertion is
		 randomized, then the 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 =	"L. J. Guibas and D. E. Knuth and M. Sharir"
, title =	"Randomized incremental construction of {Delaunay} and {Voronoi} diagrams"
, journal =	"Algorithmica"
, volume =	7
, year =	1992
, pages =	"381--413"
, succeeds =	"gks-ricdv-90"
}

@inproceedings{gmr-rlptd-92
, author =	"L. 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"
}

@inproceedings{grs-kfcg-83
, author =	"L. 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"
}

@inproceedings{gss-egbra-89
, author =	"L. 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"
}

@techreport{gs-sp801-82
, author =	"L. 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
}

@inproceedings{gs-dfbt-78
, author =	"L. 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 =	"96.05 agarwal, 94.01 tamassia"
}

@inproceedings{gs-ccrs-86
, author =	"L. 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"
}

@article{gs-ccrs-87
, author =	"L. 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"
}

@inproceedings{gss-gmppt-88
, author =	"L. J. Guibas and M. 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"
}

@article{gss-gmppt-89
, author =	"L. J. Guibas and M. 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"
}

@article{gs-canen-83
, author =	"L. 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"
}

@inproceedings{gs-pmgsc-83
, author =	"L. 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"
}

@article{gs-pmgsc-85
, author =	"L. 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
, year =	1985
, pages =	"74--123"
, keywords =	"design of algorithms, data structuring"
, succeeds =	"gs-pmgsc-83"
, annote =	"data structure for convex hull"
}

@incollection{gs-rccda-88
, author =	"L. 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 =	"97.03 pocchiola+schwarzkopf"
}

@inproceedings{gy-tsr-80
, author =	"L. J. Guibas and F. F. 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"
}

@incollection{gy-tsr-83
, author =	"L. J. Guibas and F. F. Yao"
, title =	"On translating a set of rectangles"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"61--77"
, succeeds =	"gy-tsr-80"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"171--182"
, update =	"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-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"
}

@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"
}

@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"
, update =	"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 =	""
, update =	"95.09 mitchell"
}

@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"
}

@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"
}

@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"
}

@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-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"
}

@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"
}

@incollection{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"90--96"
, comments =	"extended abstract"
, precedes =	"g-gramq-edbt-88"
}

@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"
}

@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 E. 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 =	"97.03 gaertner+salinger"
}

@article{gww-pgc-92
, author =	"W. Gutjahr and E. Welzl and G. Woeginger"
, title =	"Polynomial Graph-Colorings"
, journal =	"Discrete Appl. Math."
, volume =	8
, year =	1992
, pages =	"29--45"
, update =	"97.03 gaertner+salinger"
}

@inproceedings{g-rtdis-84
, author =	"A. Guttman"
, title =	"R-trees: a dynamic index structure for spatial searching"
, booktitle =	"Proc. ACM SIGACT-SIGMOD Conf. Principles Database Systems"
, year =	1984
, pages =	"569--592"
, update =	"94.05 franciosa"
}

@incollection{g-cng-72
, author =	"R. K. Guy"
, title =	"Crossing Numbers of Graphs"
, booktitle =	"Graph Theory and Applications"
, series =	"Lecture Notes in Mathematics"
, 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{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"
, update =	"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"
}

@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"
}

@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. 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 =	"97.03 rote, 94.01 rote+smid, 93.09 rote"
}

@inproceedings{hr-tcpp-97
, author =	"J. Hagauer and G. Rote"
, title =	"Three-clustering of points in the plane"
, booktitle =	"??"
, journal =	"Comput. Geom. Theory Appl."
, volume =	"9?"
, year =	"1997?"
, pages =	"??--??"
, note =	"to appear"
, update =	"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."
}

@incollection{h-gmss-88
, author =	"H. Hagen"
, title =	"Geometric modeling of smooth surfaces"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"158--167"
}

@inproceedings{h-vsdsi-93
, author =	"Hans Hagen"
, title =	"Variational Surface Design and Surface Interrogation"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@inproceedings{hjw-epcah-90
, author =	"T. Hagerup and H. Jung and E. 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 =	"97.03 gaertner+salinger"
}

@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-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."
}

@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{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."
}

@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"
, year =	1992
, keywords =	"doctoral thesis"
, update =	"95.05 agarwal"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@article{hos-empls-92
, author =	"D. Halperin and M. H. Overmars and M. 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"
}

@article{hs-nqapm-96
, author =	"D. Halperin and M. 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"
, update =	"97.03 smid"
}

@inproceedings{hs-atubs-94
, author =	"D. Halperin and M. 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"
, update =	"94.09 jones, 94.01 jones"
}

@incollection{hs-atarr-95
, author =	"D. Halperin and M. Sharir"
, title =	"Arrangements and their applications in robotics: Recent developments"
, editor =	"K. Goldbergs and D. Halperin and J.-C. Latombe and R. Wilson"
, booktitle =	"Proc. Workshop on Algorithmic Foundations of Robotics"
, publisher =	"A. K. Peters"
, address =	"Boston, MA"
, year =	1995
, update =	"95.09 agarwal, 95.05 agarwal"
}

@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"
}

@article{hs-icbet-92
, author =	"D. Halperin and M. 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"
}

@inproceedings{hs-nqbmp-93
, author =	"D. Halperin and M. 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"
, update =	"97.03 agarwal, 96.09 orourke, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{hs-nblet-93
, author =	"D. Halperin and M. 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"
, update =	"93.09 devillers"
}

%, number =      3
@article{hs-nblet-94
, author =	"D. Halperin and M. 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 =	"95.01 orourke+smid"
}

@article{hs-dccap-91
, author =	"D. Halperin and M. 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"
}

@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"
}

@inproceedings{hy-ctbp3-93
, author =	"D. Halperin and C.-K. Yap"
, title =	"Complexity of translating a box in polyhedral $3$-space"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"29--37"
, update =	"93.09 devillers"
}

@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{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
}

@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."
, 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 =	"94.05 devillers+smid, 93.09 milone+mitchell"
}

@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"
}

@article{ht-otams-93
, author =	"J. Cai 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{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 =	"93.09 milone+mitchell"
}

@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"
}

@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
}

@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"
}

@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"
}

@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{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"
, update =	"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"
, update =	"93.09 tamassia"
}

@book{h-gt-72
, author =	"F. Harary"
, title =	"Graph Theory"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1972
}

@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"
}

@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
}

@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-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
, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
, keywords =	"graph drawing, physical simulation, planarization"
, update =	"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
, year =	1984
, pages =	"338--355"
, succeeds =	"h-ltalc-80"
}

@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
, year =	1975
, pages =	"347--349"
, update =	"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{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 M. 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"
}

@article{hs-ndssg-86
, author =	"S. Hart and M. 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"
}

@article{h-rvdlp-92
, author =	"D. Hartvigsen"
, title =	"Recognizing {Voronoi} diagrams with linear programming"
, journal =	"ORSA J. Comput."
, volume =	4
, year =	1992
, pages =	"369--374"
, update =	"93.09 rote"
}

@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
, note =	"Available from \path|http://www.db.toronto.edu:8020/|"
, 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{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"
}

@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"
}

@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"
}

@incollection{hd-mgv-97
, author =	"A. Hausner and D. Dobkin"
, title =	"Making Geometry Visible: An introduction to the Animation of Geometric Algorithms"
, editor =	"J.-R. Sack and J. Urrutia"
, booktitle =	"Handbook on Computational Geometry"
, publisher =	"North-Holland"
, year =	1997
, pages =	"??--??"
, note =	"To appear."
, keywords =	"algorithm animation, visualization"
, update =	"97.03 tamassia"
}

@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 E. 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"
}

@article{hw-ensrq-87
, author =	"D. Haussler and E. 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"
}

@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"
}

@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"
, update =	"94.09 jones"
}

@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"
}

@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 =	"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"
}

@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"
}

@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"
, update =	"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 =	"h-epgsp-90"
, update =	"96.09 devillers"
}

@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 \path|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."
}

@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"
}

@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{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"
, update =	"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"
}

@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 J. 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 =	"95.01 mitchell"
}

@inproceedings{hm-oacvp-91
, author =	"P. J. Heffernan and J. 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 =	"96.05 mitchell"
}

@article{hm-oacvp-95
, author =	"P. J. Heffernan and J. 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 =	"96.05 mitchell"
}

@inproceedings{hm-svpap-90
, author =	"P. J. Heffernan and J. 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"
}

@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"
, update =	"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{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{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 =	"M. 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 =	"93.09 held"
}

@article{h-gbitp-91
, author =	"M. 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 =	"93.09 held"
}

@inproceedings{h-gscgs-89
, author =	"M. 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 =	"93.09 held"
}

@inproceedings{h-cvdcp-94
, author =	"M. 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"
, update =	"94.09 jones"
}

@book{h-cgpm-91
, author =	"M. 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 =	"93.09 held"
}

@inproceedings{h-zcgzp-90
, author =	"M. 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 =	"93.09 held"
}

@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"
, update =	"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"
}

@article{hla-pmbcp-94
, author =	"M. 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 =	"96.09 devillers, 95.01 held"
}

@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"
}

@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 =	"Teubner Verlagsgesellschaft"
, address =	"Leipzig"
, year =	1989
, update =	"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"
}

@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"
}

@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"
}

@techreport{hh-vlg-90
, author =	"T. R. Henry and S. E. Hudson"
, title =	"Viewing Large Graphs"
, number =	"90-13"
, institution =	"Department of Computer Science, Univerity of Arizona"
, year =	1990
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@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"
}

@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{h-cg-94
, author =	"G. Hern{\'a}ndez-Pe{\~n}alver"
, title =	"Controlling Guards"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"387--392"
, update =	"94.09 jones"
}

@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 =	"gh-ospqs-89"
}

@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"
, update =	"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"
}

@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"
}

@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"
, update =	"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 L. 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"
}

@inproceedings{hrs-fd2ec-92
, author =	"J. Hershberger and M. Rauch and S. 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"
}

@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"
, update =	"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"
, update =	"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"
}

@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"
}

@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"
, update =	"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-parss-93
, author =	"J. Hershberger and S. Suri"
, title =	"A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk"
, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year =	1993
, pages =	"54--63"
, precedes =	"hs-parss-95"
, update =	"96.05 mitchell, 93.05 smid"
}

@article{hs-parss-95
, author =	"J. Hershberger and S. 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 =	"96.05 mitchell+pocchiola"
, annote =	"Special issue of selected papers from the
4th Symposium on Discrete Algorithms."
}

@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"
}

@inproceedings{hs-asdch-90
, author =	"J. Hershberger and S. 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"
}

@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"
, update =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@inproceedings{hs-ecesp-93-a
, 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 =	"97.03 agarwal+smid, 96.05 mitchell, 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 S. Suri"
, title =	"Finding tailored partitions"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"255--265"
, precedes =	"hs-ftp-91"
}

@article{hs-ftp-91
, author =	"J. Hershberger and S. Suri"
, title =	"Finding tailored partitions"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"431--463"
, succeeds =	"hs-ftp-89"
}

@inproceedings{hs-msspm-93
, author =	"J. Hershberger and S. 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 =	"97.03 agarwal, 93.09 milone+mitchell"
}

@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 S. Suri"
, title =	"Off-Line maintenance of planar configurations"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"453--475"
, succeeds =	"hs-ompc-91"
, update =	"97.03 smid"
}

@inproceedings{hs-ompc-91
, author =	"J. Hershberger and S. Suri"
, title =	"Offline maintenance of planar configurations"
, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
, year =	1991
, pages =	"32--41"
, keywords =	"dynamic convex hull"
, annote =	"$O(\log n)$ amortized time per operation"
}

@article{hs-ompc-96
, author =	"J. Hershberger and S. Suri"
, title =	"Offline maintenance of planar configurations"
, journal =	"J. Algorithms"
, volume =	21
, year =	1996
, pages =	"453--475"
, keywords =	"dynamic convex hull"
, update =	"97.03 agarwal"
}

@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"
, update =	"96.09 agarwal, 96.05 mitchell"
}

@techreport{hs-spp-96
, author =	"John Hershberger and Subhash Suri"
, title =	"Shortest path problems"
, type =	"Technical {Report}"
, institution =	"Washington University"
, year =	1996
, update =	"96.05 mitchell"
, annote =	"A survey chapter being written for the Handbook of Computational Geometry, Urrutia, Sack, Eds."
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"94.09 jones"
}

@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"
}

@incollection{hn-src-88
, author =	"H. Heusinger and H. Noltemeier"
, title =	"On separable and rectangular clusterings"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"25--42"
}

@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-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"
}

@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"
}

@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
, note =	"Available at \path|http://www.uni-passau.de/~himsolt/Graphlet/GML|"
, 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"
, address =	"Berlin, West Germany"
, year =	1989
, pages =	"532--533"
, keywords =	"graph drawing"
, comments =	"Software in \path|ftp://ftp.uni-passau.de/pub/local/graphed|"
, update =	"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{h-appcp-93
, author =	"Klaus Hinrichs"
, title =	"Algorithms for proximity problems on colored point sets"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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"
}

@incollection{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"43--54"
, keywords =	"proximity, points, two-dimensional, plane-sweep"
, annote =	"$\Theta(n \log n)$ time"
}

@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"
}

@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"
}

@techreport{h-gfsic-85
, author =	"K. H. Hinrichs"
, title =	"The grid file system: implementation and case studies of applications"
, type =	"Report"
, number =	"Diss. ETH 7734"
, institution =	"Swiss Federal Inst. Tech. Z{\"u}rich"
, address =	"Z{\"u}rich, Switzerland"
, year =	1985
}

@incollection{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"1--14"
}

@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"
, update =	"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{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{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"
}

@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"
}

@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{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."
}

@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-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"
}

@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"
}

% relation to 1308?
@article{hm-ascpp-84
, author =	"D. S. Hochbaum and W. Maass"
, title =	"Approximation schemes for covering and packing problems in image processing and {VLSI}"
, journal =	"J. ACM"
, volume =	31
, year =	1984
, pages =	"130--136"
, 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"
}

@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"
}

@article{hrs-cchp-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 =	"96.09 tamassia"
}

@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 =	"Proceedings of the 23rd International Conference on Parallel Processing"
, 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 =	"Proceedings of the 1992 SIGMOD Conference"
, site =	"San Diego"
, month =	jun
, year =	1992
, pages =	"205--214"
, update =	"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 =	"Proceedings of the 24th International Conference on Parallel Processing"
, 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 =	"Proceedings of the 22nd International Conference on Parallel Processing"
, nickname =	"ICPP93"
, site =	"St. Charles, IL"
, month =	aug
, year =	1993
, pages =	"47--50"
, update =	"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"
}

@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"
}

@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"
}

@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-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 =	""
, update =	"93.09 held"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{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 =	"94.05 devillers+smid, 93.09 milone+mitchell"
}

@inproceedings{hk-pyprp-93
, author =	"Frank Hoffmann and Klaus Kriegel"
, title =	"The Prison Yard Problem for Rectilinear Polygons"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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
}

@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."
}

@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"
}

@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."
}

@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{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"
}

@article{ht-dgtc-73
, author =	"J. Hopcroft and R. E. Tarjan"
, title =	"Dividing a Graph into Triconnected Components"
, journal =	"SIAM J. Comput."
, volume =	2
, year =	1973
, pages =	"135--158"
, update =	"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"
}

@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
, year =	1992
, pages =	"339--380"
}

@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 M. 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"
}

@techreport{hss-edis-83t
, author =	"J. E. Hopcroft and J. T. Schwartz and M. 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"
}

@article{hss-cmpmi-84
, author =	"J. E. Hopcroft and J. T. Schwartz and M. 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"
}

@book{hss-pgcrm-87
, author =	"J. E. Hopcroft and J. T. Schwartz and M. Sharir"
, title =	"Planning, Geometry, and Complexity of Robot Motion"
, publisher =	"Ablex Publishing"
, address =	"Norwood, NJ"
, year =	1987
}

@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"
}

@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{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{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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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"
}

@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"
}

@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"
}

@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
}

@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"
}

@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."
}

@techreport{hkr-orppg-92
, author =	"T. C. Hu and A. B. Kahng and G. Robins"
, title =	"Optimal Robust Path Planning in General Environments"
, type =	"Manuscript"
, year =	1992
, comments =	"submitted to the IEEE Transactions on Robotics and Automation"
, update =	"93.09 milone+mitchell"
}

@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{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"
}

@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!)"
}

@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"
}

@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{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"
}

@incollection{h-gaa-88
, author =	"U. Huckenbeck"
, title =	"Geometrical abstract automata"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"217--231"
, keywords =	"computational model"
}

@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
}

@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"
}

@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"
}

@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"
}

@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."
}

@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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@inproceedings{h-tvgrv-93
, author =	"Ferran Hurtado"
, title =	"Triangulations, Visibility Graph and Reflex Vertices of A Simple polygon"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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"
, update =	"96.05 efrat"
}

@techreport{hn-tvgrv-93
, 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.03 devillers, 93.09 held"
}

@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-93"
, update =	"97.03 devillers"
}

@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"
, update =	"96.05 efrat"
}

@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{hsv-rsttg-95
, author =	"J. P. Hutchinson and T. Shermer and A. Vince"
, title =	"On representations of some thickness-two graphs"
, editor =	"F. Brandenburg"
, booktitle =	"Graph Drawing '95"
, series =	"Lecture Notes Comput. Sci."
, volume =	1027
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"??--??"
, keywords =	"visibility graphs"
, update =	"96.09 orourke"
}

@incollection{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"15--24"
}

@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"
}

@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--120"
, succeeds =	"hkk-dvdmh-92t"
}

@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 =	"95.09 agarwal"
}

@inproceedings{hks-uevsi-91
, author =	"D. P. Huttenlocher and K. Kedem and M. 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"
}

@article{hks-uevsi-93
, author =	"D. P. Huttenlocher and K. Kedem and M. Sharir"
, title =	"The upper envelope of {Voronoi} surfaces and its applications"
, journal =	"Discrete Comput. Geom."
, volume =	9
, year =	1993
, pages =	"267--291"
, update =	"95.09 agarwal, 94.05 sharir"
}

@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"
}

@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"
}

@inproceedings{hl-updss-96
, author =	"M. D. Hutton and A. Lubiw"
, title =	"Upward Planar Drawing of Single-Source Acyclic Digraphs"
, booktitle =	"??"
, 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"
}

@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 =	"96.01 smid, 95.09 mitchell"
}

% 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-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"
}

@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{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"
}

@phdthesis{i-mvsp-94
, author =	"Christian Icking"
, title =	"Motion and Visibility in Simple Polygons"
, school =	"FernUniversit{\"a}t Hagen"
, year =	1994
, keywords =	"doctoral thesis"
, update =	"97.03 icking"
}

@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"
, update =	"97.03 icking"
}

@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"
, update =	"95.09 mitchell"
}

@inproceedings{ik-tgp-91
, author =	"C. Icking and R. Klein"
, title =	"The two guards problem"
, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
, year =	1991
, pages =	"166--175"
, keywords =	"polygon"
, precedes =	"ik-tgp-92"
}

@article{ik-tgp-92
, author =	"C. Icking and R. Klein"
, title =	"The two guards problem"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	2
, number =	3
, year =	1992
, pages =	"257--285"
, keywords =	"visibility, watchman routes, planar polygons, motion planning"
, succeeds =	"ik-tgp-91"
}

@inproceedings{iklm-cdf3s-93
, author =	"C. Icking and R. Klein and N.-M. L{\^e} and L. Ma"
, title =	"Convex distance functions in $3$-space are different"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"116--123"
, update =	"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"
, succeeds =	"iklm-cdf3s-93"
, update =	"97.03 icking+smid"
}

@inproceedings{ikm-hlac-93
, author =	"C. Icking and R. Klein and L. Ma"
, title =	"How to look around a corner"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"443--448"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ikm-owlac-93
, author =	"Christian Icking and Rolf Klein and Lihong Ma"
, title =	"The Optimal Way for Looking Around a Corner"
, editor =	"Jouko Parviainen and D. Hugh M. Reekie"
, booktitle =	"Proc. 4th IEEE--IEE Vehicle Navigation and Informations Systems Conference"
, nickname =	"VNIS '93"
, site =	"Ottawa, Canada"
, year =	1993
, update =	"97.03 icking"
}

@inproceedings{iko-pstsm-88
, author =	"C. Icking and R. Klein and T. 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"
}

@article{irwy-spls-92
, author =	"C. Icking and G. Rote and E. Welzl and C. Yap"
, title =	"Shortest Paths for Line Segments"
, journal =	"Algorithmica"
, volume =	10
, year =	1993
, pages =	"182--200"
, keywords =	"Ulam problem, motion planning"
, update =	"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"
}

@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"
}

@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{Ihler-Class-Steiner
, 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"
, address =	"Berlin, Germany"
, year =	1992
, pages =	"85--96"
, keywords =	"TSP"
, update =	"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."
, volume =	63
, year =	1994
, pages =	"??"
, succeeds =	"i-mrsti-92"
, update =	"95.01 mitchell"
}

@incollection{irw-sncpp-91
, author =	"Edmund Ihler and Gabriele Reich and Peter Widmayer"
, title =	"On shortest networks for classes of points in the plane"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"103--111"
, update =	"94.01 rote"
}

@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"
}

@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-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"
}

@inproceedings{ia-dosis-84
, author =	"H. Imai and Ta. Asano"
, title =	"Dynamic orthogonal segment intersection search"
, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1984
, pages =	"393--402"
, precedes =	"ia-dosis-87"
}

@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-dosis-84"
}

@article{ia-eaggs-86
, author =	"H. Imai and Ta. Asano"
, title =	"Efficient algorithms for geometric graph search problems"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"478--494"
, keywords =	"intersection, dynamizing, data structuring, searching, VLSI design, decomposition, amortized analysis"
}

@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"
}

@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
}

@article{ii-cgmpa-86
, author =	"H. Imai and M. Iri"
, title =	"Computational-Geometric Methods for Polygonal Approximations of a Curve"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	36
, year =	1986
, pages =	"31--41"
}

@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
, year =	1992
, pages =	"426--434"
, update =	"96.09 agarwal, 95.09 agarwal"
}

@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
}

@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"
}

@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{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"
, update =	"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"
, update =	"96.05 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"
, update =	"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"
, update =	"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"
, update =	"95.05 schwarzkopf"
}

@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"
}

@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"
, update =	"96.05 efrat"
}

@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{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"
}

@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{iso-vvd-87
, author =	"S. Isoda and T. Shimonmura and Y. Ono"
, title =	"VIPS: A visual Debugger"
, journal =	"IEEE Software"
, 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"
}

@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{ig-fdaec-91
, author =	"G. F. Italiano and Z. Galil"
, title =	"Fully Dynamic Algorithms for Edge Connectivity Problems"
, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
, year =	1991
, pages =	"317--327"
, update =	"94.01 tamassia"
}

@incollection{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 =	"95.05 tamassia, 94.01 smid, 93.09 milone+mitchell"
}

@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"
, update =	"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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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"
}

@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{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"
}

@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"
}

@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"
}

@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
}

@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"
, update =	"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. 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 =	"93.09 milone+mitchell"
}

@article{jmb-oairs-96
, author =	"S. Jadhav and A. Mukhopadhyay and B. 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 =	"96.05 agarwal+smid"
}

@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"
}

@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{j-dt-87
, author =	"R. E. Jamison"
, title =	"Direction trees"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"249--254"
}

@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. Preparata"
, title =	"Widest-corridor problems"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"426--431"
, update =	"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"
, update =	"95.01 smid"
}

@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"
}

@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 =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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{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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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-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."
, year =	1988
, pages =	"362--370"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1995
, pages =	"13--25"
, update =	"97.03 agarwal, 96.09 agarwal, 95.05 mitchell"
}

@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"
}

@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{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
}

@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"
}

@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"
}

@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"
}

@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
}

@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 =	"Boston, MA"
, year =	1994
, pages =	""
, keywords =	"probing, point probes, NP-complete"
, update =	"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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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"
}

@incollection{jb-dspao-91
, author =	"Xiao-Yi Jiang and Horst Bunke"
, title =	"Determination of the symmetries of polyhedra and an application to object recognition"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"113--121"
, update =	"94.01 rote"
, 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"
}

@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"
}

@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"
}

@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"
, year =	1991
, keywords =	"graph drawing, planar"
, update =	"96.09 tamassia, 96.04 garg"
}

@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 =	10
, number =	3
, year =	1987
, pages =	"309--325"
, keywords =	"graph drawing"
, update =	"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"
}

@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{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-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"
}

@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"
}

@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."
}

@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 \path|http://www.cs.duke.edu/~jeffe/compgeom/biblios.html#geombib|"
, url =	"ftp://ftp.cs.usask.ca/pub/geometry/geombib.tar.Z"
, keywords =	"bibliography"
, update =	"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"
}

@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"
}

@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"
}

@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"
, update =	"95.09 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"
}

@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"
}

@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."
}

@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
, year =	1996
, pages =	"33--59"
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
, keywords =	"graph drawing, planarization"
, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
}

@article{jm-psnep-96
, author =	"M. {J\"unger} and P. Mutzel"
, title =	"Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools"
, journal =	"Algorithmica"
, volume =	16
, number =	1
, year =	1996
, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and
 R. Tamassia)"
, keywords =	"graph drawing, planarization"
, update =	"97.03 tamassia, 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{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"
}

@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"
}

@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"
, update =	"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"
}

@inproceedings{kr-oadrp-91
, author =	"A. Kahng and G. Robins"
, title =	"Optimal algorithms for determining regularity in pointsets"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"167--170"
}

@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"
}

@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-mts-88
, author =	"G. Kalai"
, title =	"Many triangulated spheres"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"1--14"
}

@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"
}

@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"
}

@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{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"
}

@article{ksss-tdmbb-86
, author =	"A. Kalvin and E. Schonberg and J. T. Schwartz and M. 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"
}

@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"
}

@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"
}

@misc{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 =	"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-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{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"
}

@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{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"
}

@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"
}

@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{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-mcvr-93
, author =	"G. Kant"
, title =	"A More Compact Visibility Representation"
, booktitle =	"Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
, nickname =	"WG'93"
, year =	1993
, update =	"94.01 tamassia, 93.09 milone+mitchell"
}

@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
, pages =	"??"
, update =	"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"
, year =	1993
, pages =	"396--410"
, update =	"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"
, update =	"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."
, year =	1997
, note =	"to appear"
, url =	"http://www.cs.brown.edu/cgc/papers/kltt-arvrt-97.ps.gz"
, keywords =	"graph drawing, visibility, tree, CGC, Brown"
, update =	"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-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-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 =	"??"
}

% 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"
, update =	"93.09 milone+mitchell, 93.05 smid"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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
, update =	"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"
}

@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
, update =	"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"
, update =	"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"
}

@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."
}

@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
, year =	1991
, pages =	"71--91"
, succeeds =	"kln-edtra-89"
}

@inproceedings{ks-oag-93
, author =	"Y. Karasik and M. Sharir"
, title =	"Optical algorithms in geometry"
, booktitle =	"Proc. Optical Comput. Topical Meeting, Optical Society of America"
, year =	1993
, pages =	"164--167"
, update =	"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"
, update =	"94.09 jones"
}

@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"
, update =	"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"
}

@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 M. Sharir"
, title =	"Optical computational geometry"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"232--241"
}

@inproceedings{ks-pgdms-93
, author =	"Y. B. Karasik and M. 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"
, update =	"93.09 jones"
}

@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-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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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"
}

@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{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{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{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"
, 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 L. 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"
}

@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{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"
, update =	"96.09 devillers"
}

@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"
}

@techreport{k-3vrs2-95
, author =	"M. 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 =	"96.09 smid"
}

@article{k-dess-89
, author =	"M. Katz"
, title =	"Diameter-extremal subsets of spheres"
, journal =	"Discrete Comput. Geom."
, volume =	4
, year =	1989
, pages =	"117--137"
}

@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"
}

@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{kn-pso-96
, author =	"Matthew J. Katz and Franck Nielsen"
, title =	"On Piercing Sets of Objects"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"113--121"
, update =	"96.05 efrat"
}

@inproceedings{kos-ehsro-91
, author =	"M. J. Katz and M. H. Overmars and M. 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"
}

@article{kos-ehsro-92
, author =	"M. J. Katz and M. H. Overmars and M. 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 =	"96.05 ramkumar"
}

@inproceedings{ks-ebago-93
, author =	"M. J. Katz and M. Sharir"
, title =	"An expander-based approach to geometric optimization"
, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year =	1993
, pages =	"198--207"
, update =	"93.09 jones"
}

@techreport{ks-iagoe-??
, author =	"M. J. Katz and M. Sharir"
, title =	"Improved algorithms in geometric optimization via expanders"
, year =	"??"
, update =	"93.09 milone+mitchell"
}

@inproceedings{ks-osse-93i
, author =	"M. J. Katz and M. Sharir"
, title =	"Optimal slope selection via expanders"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"139--144"
, update =	"95.09 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@article{ks-osse-93
, author =	"M. J. Katz and M. Sharir"
, title =	"Optimal slope selection via expanders"
, journal =	"Inform. Process. Lett."
, volume =	47
, year =	1993
, pages =	"115--122"
, update =	"94.05 sharir"
}

@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{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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{kos-cmsrp-rep-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 =	"96.05 ramkumar"
}

@inproceedings{kos-cmsrp-91
, 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."
, year =	1991
, pages =	"74--77"
}

@techreport{kos-cmsrp-rep-91
, 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 =	"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"
, year =	1991
, pages =	"493--505"
, comments =	"use of Minkowski sums for animation"
, update =	"96.05 ramkumar"
}

@inproceedings{klw-cpa-93
, author =	"L. Kavraki and J.-C. Latombe and R. Wilson"
, title =	"Complexity of Partitioning an assembly"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"12--17"
, update =	"93.09 milone+mitchell"
}

@article{kslo-prpph-96
, author =	"L. 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 =	"97.03 schwarzkopf"
}

@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"
}

@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"
}

@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"
}

@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{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"
}

@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-??"
}

@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"
}

@article{klps-ujrcf-86
, author =	"K. Kedem and R. Livne and J. Pach and M. 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 =	"93.09 milone+mitchell"
}

@inproceedings{ks-ampsc-88
, author =	"K. Kedem and M. 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"
}

@incollection{ks-ampsc-90
, author =	"K. Kedem and M. 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"
}

@inproceedings{ks-eapcf-85
, author =	"K. Kedem and M. 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, klsp-ujrcf-86"
, update =	"93.09 milone+mitchell"
}

@article{ks-empac-90
, author =	"K. Kedem and M. 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"
}

@techreport{kst-coksm-93t
, author =	"K. Kedem and M. 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
, update =	"93.09 milone+mitchell, 93.05 orourke"
, annote =	"Fixes bug in Kedem-Sharir algorithm"
}

@inproceedings{kst-coksm-93i
, author =	"K. Kedem and M. 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"
, update =	"93.09 milone+mitchell"
}

@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"
, update =	"96.05 efrat"
}

@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"
}

@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-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"
}

@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"
}

@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"
}

@article{k-asade-91
, 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 =	"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"
}

@inproceedings{kt-dcicc-91
, 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"
}

@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"
}

@inproceedings{km-psptv-84
, author =	"D. M. Keirsey and J. 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 =	"93.09 milone+mitchell"
}

@inproceedings{kmpp-mppav-84
, author =	"D. M. Keirsey and J. 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 =	"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-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{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{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 =	"Wiley"
, address =	"New York, NY"
, year =	1979
}

@book{km-gp-63
, author =	"N. G. Kendall and P. A. P. Moran"
, title =	"Geometrical Probability"
, publisher =	"Hafner"
, address =	"New York, NY"
, year =	1963
}

@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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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 J. 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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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
}

@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"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"??"
, update =	"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"
, update =	"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"
, update =	"93.09 jones"
}

@article{k-ndot-80
, author =	"D. G. Kirkpatrick"
, title =	"A note on {Delaunay} and optimal triangulations"
, journal =	"Inform. Process. Lett."
, volume =	10
, year =	1980
, pages =	"127--128"
, keywords =	"triangulations, Delaunay triangulations, worst-case analysis"
}

@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"
}

@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
}

@article{k-osps-83
, author =	"D. G. Kirkpatrick"
, title =	"Optimal search in planar subdivisions"
, journal =	"SIAM J. Comput."
, volume =	12
, year =	1983
, pages =	"28--35"
, keywords =	"data structuring, searching, subdivisions, plane graph representation, hierarchical representations"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{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-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."
}

@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
, year =	1990
, pages =	"81--97"
}

@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"
}

@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"
}

@article{k-iepri-69
, author =	"V. Klee"
, title =	"Is Every Polygonal Region Illuminable from Some Point?"
, journal =	"Amer. Math. Monthly"
, volume =	76
, year =	1969
, pages =	180
, update =	"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{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"
}

@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"
}

@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"
}

@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"
}

@incollection{k-avdta-88
, author =	"R. Klein"
, title =	"Abstract {Voronoi} diagrams and their applications"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"148--157"
, comments =	"extended abstract"
, succeeds =	"k-vdmm-87"
}

@book{k-ag-97
, author =	"R. Klein"
, title =	"Algorithmische Geometrie"
, publisher =	"Addison-Wesley"
, address =	"Bonn"
, year =	1997
, keywords =	"textbook, in German"
, update =	"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 =	"R. 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 =	"93.09 held"
}

@incollection{k-mas-91
, author =	"Rolf Klein"
, title =	"Moving along a street"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"123--140"
, update =	"94.01 rote"
}

@techreport{k-vdmm-87
, author =	"R. Klein"
, title =	"Voronoi diagrams in the {Moscow} metric"
, type =	"Technical {Report}"
, number =	7
, institution =	"Inst. Inform., Univ. Freiburg"
, year =	1987
, precedes =	"k-avdta-88"
}

@inproceedings{k-vdmm-89
, author =	"Rolf Klein"
, title =	"{Voronoi} Diagrams in the Moscow Metric"
, booktitle =	"Graph-Theoretic Concepts in Computer Science. Proceedings."
, year =	1989
, pages =	"434--441"
}

@inproceedings{k-wusbd-91
, author =	"R. Klein"
, title =	"Walking an unknown street with bounded detour"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"304--313"
}

@article{k-wusbd-92
, author =	"R. Klein"
, title =	"Walking an unknown street with bounded detour"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1992
, pages =	"325--351"
}

@inproceedings{kl-ltrab-93
, author =	"R. Klein and A. 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"
, precedes =	"kl-ltrab-96"
, update =	"97.03 devillers, 93.09 jones"
}

@article{kl-ltrab-96
, author =	"R. Klein and A. 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 =	"97.03 devillers+icking"
}

@inproceedings{kl-ngcav-93
, author =	"R. Klein and A. 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"
, update =	"93.09 milone+mitchell"
}

@inproceedings{kl-fsc-95
, author =	"R. Klein and A. Lingas"
, title =	"Fast Skeleton Construction"
, editor =	"P. Spirakis"
, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
, series =	"Lecture Notes Comput. Sci."
, volume =	979
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"582--595"
, update =	"97.03 icking"
}

@inproceedings{kl-havdl-94
, author =	"R. Klein and A. Lingas"
, title =	"Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"96.05 mitchell"
}

@inproceedings{kl-mpsp-92
, author =	"R. Klein and A. Lingas"
, title =	"Manhattonian proximity in a simple polygon"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"312--319"
, precedes =	"kl-mpsp-95"
, update =	"96.09 devillers"
}

@article{kl-mpsp-95
, author =	"R. Klein and A. 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 =	"96.09 devillers"
}

@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"
, update =	"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 =	"R. Klein and K. Mehlhorn and S. 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 =	"93.05 smid"
}

@techreport{kmm-ricav-93
, author =	"R. Klein and K. Mehlhorn and S. 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 =	"94.05 devillers, 93.05 smid"
}

@article{kmm-ricav-93a
, author =	"R. Klein and K. Mehlhorn and S. 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-93t"
, update =	"94.05 devillers"
}

@techreport{know-dfwp-87
, author =	"R. Klein and O. Nurmi and T. Ottmann and D. 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"
}

@article{know-dfwp-89
, author =	"R. Klein and O. Nurmi and T. Ottmann and D. 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"
}

@inproceedings{know-odsfw-86
, author =	"R. Klein and O. Nurmi and T. Ottmann and D. 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"
}

@incollection{kw-vdmm-88
, author =	"R. Klein and D. Wood"
, title =	"Voronoi Diagrams and Mixed Metrics"
, booktitle =	"Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
, series =	"Lecture Notes Comput. Sci."
, volume =	294
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"281--291"
}

@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"
}

@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{k-mtpd-80
, author =	"G. T. Klincsek"
, title =	"Minimal triangulations of polygonal domains"
, journal =	"Discrete Math."
, volume =	9
, year =	1980
, pages =	"121--123"
}

@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
}

@inproceedings{kmmns-cgw-90
, author =	"A. Knight and J. May and M. McAffer and T. Nguyen and J.-R. Sack"
, title =	"A computational geometry workbench"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	370
}

@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
}

@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
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1968
}

@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
}

@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
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1969
}

@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-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
}

@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"
}

@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-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"
}

@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"
}

@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 =	"95.09 korneenko, 95.05 korneenko"
}

@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 =	"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{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"
}

@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-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{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"
}

@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"
}

@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"
}

@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 =	"ICGA91"
, year =	1991
, keywords =	"graph drawing"
, update =	"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-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"
}

@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"
}

@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. \path|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 \path|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"
}

@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"
}

@techreport{ky-acdn-??
, author =	"D. Kozen and C. K. Yap"
, title =	"Algebraic cell decomposition in {NC}"
, type =	"Manuscript"
, institution =	"??"
, year =	"??"
}

@incollection{kl-cwrfm-85
, author =	"M. R. Kramer and J. van Leeuwen"
, title =	"The Complexity of Wire-Routing and Finding Minimum Area Layouts for Arbitrary {VLSI} Circuits"
, editor =	"F. P. Preparata"
, booktitle =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1985
, pages =	"129--146"
, keywords =	"graph drawing"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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{km-igs-
, author =	"J. Kratochv{\'\i}l and J. Matou{\v s}ek"
, title =	"Intersection graphs of segments"
, journal =	"J. Combin. Theory Ser. B"
, note =	"to appear"
, update =	"96.09 agarwal, 94.05 franciosa"
}

@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"
}

@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 =	"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"
}

@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-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"
}

@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"
, update =	"95.01 smid, 93.09 smid, 93.05 jones"
}

@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 =	"v-ppp-92"
, update =	"94.01 smid"
}

@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"
, update =	"95.09 mitchell"
}

@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"
, update =	"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{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"
}

@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{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"
, update =	"95.09 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"
}

@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"
}

@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-92
, author =	"J. Krozel and D. Andrisani"
, title =	"Intelligent Path Prediction for Vehicular Travel"
, journal =	"IEEE Trans. Syst. Man Cybern."
, year =	1992
, keywords =	"path prediction, gradient field representation"
, update =	"93.09 milone+mitchell"
}

@article{ka-ippvt-
, author =	"J. Krozel and D. Andrisani"
, title =	"Intelligent Path Prediction for Vehicular Travel"
, journal =	"IEEE Trans. Syst. Man Cybern."
, year =	"to appear"
, keywords =	"path prediction, gradient field representation, generalized cost criteria, path similarity"
}

@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"
}

@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{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"
}

@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"
}

@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 =	"96.01 smid, 95.09 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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"1039--1060"
}

@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"
}

@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"
, update =	"94.09 lambert, 93.09 milone+mitchell"
}

@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-pcfds-96
, author =	"Suboth Kumar and Dinesh Manocha"
, title =	"The power of coherence: fast display of surfaces"
, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year =	1996
, pages =	"V15--V16"
, update =	"96.05 efrat"
}

@article{kml-idlnm-97
, author =	"S. Kumar and D. Manocha and A. Lastra"
, title =	"Interactive display of large {NURBS} models"
, journal =	"IEEE Trans. on Visualization and Computer Graphics"
, year =	1997
, note =	"to appear"
, update =	"97.03 tamassia"
}

@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"
}

@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"
}

@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"
}

@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{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 =	"96.01 smid, 95.09 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{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{p-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 =	"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"
}

@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"
}

@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"
}

@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"
}

@incollection{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"
}

@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."
}

@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"
, update =	"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"
, update =	"94.09 jones"
}

@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{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 =	"??"
, publisher =	"Springer-Verlag"
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@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 and its radius"
, journal =	"Comput. Vision Graph. Image Process."
, volume =	38
, year =	1987
, pages =	"317--326"
, update =	"97.03 agarwal"
}

@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"
, update =	"96.05 efrat"
}

@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"
}

@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{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"
}

@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{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"
}

@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"
, year =	1996
, note =	"ISBN 0-13-290842-5"
, update =	"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"
}

@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 =	"96.05 ramkumar"
}

@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"
}

@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
}

@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-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"
, update =	"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"
}

@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{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 =	"Wiley"
, address =	"New York, NY"
, year =	1985
, isbn =	"0-471-90413-9"
, keywords =	"book"
, update =	"97.03 pocchiola, 93.09 rote"
, annote =	"a collection of survey articles by various authors (the BIBLE on the TSP)"
}

@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-csta-82
, author =	"Steven R. Lay"
, title =	"Convex Sets and Their Applications"
, publisher =	"Wiley"
, address =	"New York, NY"
, year =	1982
, keywords =	"book"
}

@techreport{ll-lbrn-92
, author =	"A. Lazanas and J. Latombe"
, title =	"Landmark-based robot navigation"
, type =	"Technical {Report}"
, institution =	"Dept. of Computer Science, Stanford University"
, year =	1992
, update =	"93.09 milone+mitchell"
}

@techreport{ll-mpula-92
, author =	"A. Lazanas and J. Latombe"
, title =	"Motion planning with uncertainty: {A} landmark approach"
, type =	"Technical {Report}"
, institution =	"Dept. of Computer Science, Stanford University"
, year =	1992
, update =	"93.09 milone+mitchell"
}

@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-gpscs-93
, author =	"N.-M. 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"
, update =	"93.09 milone+mitchell"
}

@inproceedings{l-nscdf-96
, author =	"N.-M. 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 =	"96.09 mitchell"
}

@article{l-vdlm-96
, author =	"N.-M. 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"
, update =	"97.03 smid"
}

@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"
}

@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"
}

@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{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"
}

@article{ll-ccagp-86
, author =	"D. Lee and A. Lin"
, title =	"Computational complexity of art gallery problems"
, journal =	"IEEE Trans. Inform. Theory"
, volume =	32
, year =	1986
, pages =	"276--282"
, update =	"94.05 devillers"
}

@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
}

@incollection{l-mcprg-83
, author =	"D. T. Lee"
, title =	"Maximum clique problem of rectangle graphs"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"91--107"
}

@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"
, year =	1982
, pages =	"363--369"
}

@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"
}

@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
}

@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
, year =	1980
, pages =	"604--618"
}

@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"
}

@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"
}

@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"
}

@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
, year =	1979
, pages =	"415--421"
}

@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
, year =	1977
, pages =	"594--606"
, succeeds =	"lp-lppsi-76"
}

@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 a {Delaunay} triangulation"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	9
, year =	1980
, pages =	"219--242"
}

@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
, year =	1980
, pages =	"200--211"
}

@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-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."
}

@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 Linz 1981"
, publisher =	"Hanser"
, address =	"M{\"u}nchen"
, year =	1982
, pages =	"87--98"
, comments =	"replaces the old techreport vs-utstp-80"
, update =	"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{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{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-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{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."
, year =	1991
, pages =	"211--214"
}

@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"
}

@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"
}

@article{ll-domwt-96
, author =	"W. Lenhart and G. Liotta"
, title =	"Drawing Outerplanar Minimum Weight Triangulations"
, journal =	"Inform. Process. Lett."
, volume =	6
, number =	12
, 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 =	"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."
, publisher =	"Springer-Verlag"
, year =	1997
, note =	"to appear"
, url =	"http://www.cs.brown.edu/cgc/papers/ll-pdog-97.ps.gz"
, keywords =	"graph drawing, proximity, CGC, Brown"
, update =	"97.03 tamassia"
}

@inproceedings{lpsssstwy-clcsp-87
, author =	"W. Lenhart and R. Pollack and J.-R. Sack and R. Seidel and M. Sharir and S. 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"
, update =	"93.05 smid"
}

@article{lpsssstwy-clcsp-88
, author =	"W. Lenhart and R. Pollack and J.-R. Sack and R. Seidel and M. Sharir and S. 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"
}

@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"
}

@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"
}

@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."
, year =	1991
, pages =	"66--69"
}

@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"
, update =	"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."
}

@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"
}

@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"
}

@article{l-olbng-87
, author =	"C. Levcopoulos"
, title =	"An {$\Omega(\sqrt{n})$} lower bound for the nonoptimality of the greedy triangulation"
, journal =	"Inform. Process. Lett."
, volume =	25
, year =	1987
, pages =	"247--251"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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
}

@inproceedings{ls-esmpa-85
, author =	"D. Leven and M. 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"
}

@article{ls-esmpa-87
, author =	"D. Leven and M. 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"
}

@incollection{ls-ippvd-87
, author =	"D. Leven and M. 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"
}

@article{ls-ncfcc-87
, author =	"D. Leven and M. 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"
}

@article{ls-pptmc-87
, author =	"D. Leven and M. 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"
}

@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{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 =	""
, update =	"95.09 mitchell"
}

@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"
}

@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"
}

@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"
, update =	"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"
, update =	"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 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"
, update =	"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."
, year =	1991
, pages =	"70--73"
}

@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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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{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"
}

@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"
}

@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-
, author =	"M. Lin and D. Manocha"
, title =	"Efficient Contact Determination in Dynamic Environments"
, journal =	"Internat. J. Comput. Geom. Appl."
, year =	"To appear"
, update =	"96.05 klosowski, 95.01 mitchell"
}

@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{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"
, update =	"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"
}

@techreport{ls-cavg-92
, author =	"Y. Lin and 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 =	"96.09 devillers, 93.09 milone+mitchell"
}

@article{ls-cavg-95
, author =	"Y. Lin and 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 =	"96.09 devillers"
}

@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 =	95
, update =	"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)."
}

@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 =	"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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@article{lms-oparl-95
, author =	"A. Lingas and A. Maheshwari and J.-R. Sack"
, title =	"Optimal parallel algorithms for rectilinear link-distance problems"
, journal =	"Algorithmica"
, volume =	14
, year =	1995
, pages =	"261--289"
, update =	"97.03 smid"
}

@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."
, publisher =	"IEEE Computer Society"
, year =	1993
, pages =	"??"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"228--238"
, update =	"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"
}

@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"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	955
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"239--250"
, keywords =	"graph drawing, 3D, proximity"
, update =	"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"
, update =	"97.03 tamassia"
}

@article{lpt-rpqid-
, 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."
, note =	"to appear"
, url =	"http://www.cs.brown.edu/cgc/papers/lpt-rpqid-.ps.gz"
, keywords =	"nearest-neighbor search, point location, arithmetic precision, CGC, Brown"
, update =	"97.03 tamassia"
}

@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. Annu. ACM Sympos. Comput. Geom."
, year =	1997
, keywords =	"nearest-neighbor search, point location, arithmetic precision, CGC, Brown"
, update =	"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."
, publisher =	"Springer-Verlag"
, year =	1997
, note =	"to appear"
, url =	"http://www.cs.brown.edu/cgc/papers/lttv-argd-97.ps.gz"
, keywords =	"graph drawing, proximity, CGC, Brown"
, update =	"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"
, update =	"94.09 jones"
}

@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"
}

@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-83
, author =	"W. {Lipski, Jr.}"
, title =	"On the structure of three-layer wirable layouts"
, editor =	"F. P. Preparata"
, booktitle =	"VLSI Theory"
, series =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1983
, pages =	"231--243"
}

@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 {II}"
, journal =	"Fundam. Inform."
, volume =	2
, year =	1979
, pages =	"245--260"
}

@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-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"
}

@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"
, update =	"93.09 tamassia, 93.05 jones"
}

@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-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."
}

% ###
@misc{ls-agt-
, author =	"F. F. Little and J. L. Schwing"
, title =	"Automatic Generation of Triangulations"
}

@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"
, update =	"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"
}

@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-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{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"
}

@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"
}

@techreport{ls-ipjc-85
, author =	"R. Livne and M. 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 =	"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-hscdd-92"
, update =	"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"
}

@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 {I}"
, journal =	"Fundam. Inform."
, volume =	2
, year =	1979
, pages =	"211--226"
}

@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
}

@article{lst-gbtsh-95
, author =	"J. de Loera and B. Strumfels and R. Thomas"
, title =	"Gr{\"o}bner bases and triangulation of the second hypersimplex"
, journal =	"Combinatorica"
, year =	1995
, note =	"To appear"
, update =	"95.05 orourke"
}

@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{l-cv-93
, author =	"Jesus Garcia Lopez"
, title =	"Circular Visibility"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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 =	"97.03 smid"
}

@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."
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, year =	1995
, pages =	"??"
, update =	"95.05 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"
}

@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-sdtc-96
, author =	"Michael C. Loui and others"
, title =	"Strategic Directions in Theory of Computing"
, journal =	"ACM Comput. Surv."
, volume =	28
, number =	4
, year =	1996
, note =	"\path|http://geisel.csl.uiuc.edu/~loui/complete.html|"
, url =	"http://geisel.csl.uiuc.edu/~loui/complete.html"
, update =	"97.03 tamassia"
}

@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"
}

@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\'aszl\'o Lov\'asz and J\'anos Pach and Mario Szegedy"
, title =	"On Conway's Thrackle Conjecture"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"147--151"
, keywords =	""
, update =	"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"
}

@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{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"
}

@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
}

@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"
}

@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
, year =	1979
, pages =	"560--570"
}

@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"
}

@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"
, update =	"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"
, update =	"93.09 milone+mitchell"
}

@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"
, update =	"95.01 matousek"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"397--432"
}

@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{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 =	"l-dsorq-82"
}

@article{l-dsorq-82
, author =	"G. S. Lueker"
, title =	"A data structure for orthogonal range queries"
, journal =	"Inform. Process. Lett."
, volume =	15
, number =	5
, year =	1982
, pages =	"209--213"
, succeeds =	"l-dsorq-78"
}

@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-dsdrs-82
, author =	"G. S. Lueker and D. E. Willard"
, title =	"A data structure for dynamic range searching"
, journal =	"Inform. Process. Lett."
, volume =	15
, year =	1982
, pages =	"209--213"
}

@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"
}

@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"
}

@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"
}

@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 =	"??"
}

@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{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"
}

@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"
, update =	"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
}

@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"
}

@article{m-cnc-86
, author =	"W. Maass"
, title =	"On the complexity of nonconvex covering"
, journal =	"SIAM J. Comput."
, volume =	15
, year =	1986
, pages =	"453--467"
}

@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 =	"??--??"
, keywords =	"visibility graphs"
, update =	"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"
}

@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"
}

@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{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"
}

@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
}

@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"
, 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"
}

@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"
}

@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"
}

@techreport{mjsg-osgop-97
, 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.03 smid"
}

@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"
}

@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{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 =	"G. K. Manacher and A. L. Zobrist"
, title =	"Probabilistic Methods with Heaps for Fast Average-case Greedy Algorithms"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, year =	1983
, pages =	"261--278"
, update =	"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"
}

@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"
}

@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"
}

@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{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"
}

@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"
}

@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{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"
}

@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 =	"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 S. 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"
}

@article{ms-fmapp-91
, author =	"O. Marcotte and S. 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"
}

@inproceedings{ms-gm-89
, author =	"O. Marcotte and S. Suri"
, title =	"On geometric matching"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"302--314"
, precedes =	"ms-fmapp-89"
}

@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"
}

@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"
, update =	"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{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"
}

@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-tgis-66
, author =	"G. E. Martin"
, title =	"Transformation Geometry: An Introduction to Symmetry"
, publisher =	"Springer-Verlag"
, address =	"New York, NY"
, year =	1966
}

@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{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"
}

@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{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"
, update =	"96.05 efrat"
}

@article{m-dac-56
, author =	"R. M. Mason"
, title =	"The digital approximation of contours"
, journal =	"J. ACM"
, volume =	3
, year =	1956
, pages =	"355--359"
}

@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-aagtn-95
, author =	"C. Mata and J. S. 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"
, update =	"95.09 mitchell"
}

@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 =	"95.09 mitchell, 95.01 mitchell"
}

@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-sdcp-93
, author =	"Y. Matias"
, title =	"Semi-dynamic closest pairs"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"264--271"
, update =	"93.09 milone+mitchell"
}

@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{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 =	""
, update =	"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"
}

@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"
}

@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"
, note =	"Also to appear in {\em J. Comput. Syst. Sci.}"
, keywords =	"approximations, VC-dimension, shatter function, derandomization, cutting, partition"
, update =	"96.09 agarwal, 93.09 erickson+matousek"
}

@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 =	"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"
, update =	"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"
, update =	"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"
}

@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"
, update =	"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"
, year =	1993
, pages =	"69--89"
, keywords =	"survey paper, epsilon-nets, range spaces, VC-dimension, cuttings, derandomization"
, update =	"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-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 =	"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"
}

@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"
, update =	"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"
}

@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"
, update =	"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-rshec-92"
, update =	"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 M. Sharir and S. Sifrony and E. Welzl"
, title =	"Fat triangles determine linearly many holes"
, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1991
, pages =	"49--58"
, update =	"96.09 agarwal"
}

@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"
, year =	1993
, pages =	"74--82"
, update =	"96.09 agarwal, 93.05 smid"
}

@article{mpssw-ftdlm-94
, author =	"J. Matou{\v s}ek and J. Pach and M. Sharir and S. Sifrony and E. Welzl"
, title =	"Fat triangles determine linearly many holes"
, journal =	"SIAM J. Comput."
, volume =	23
, year =	1994
, pages =	"154--169"
, update =	"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"
}

@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"
, update =	"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 E. 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"
, update =	"96.09 agarwal"
}

@inproceedings{msw-sblp-92
, author =	"J. Matou{\v s}ek and M. Sharir and E. Welzl"
, title =	"A subexponential bound for linear programming"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"1--8"
, update =	"97.03 smid, 96.09 agarwal"
}

@article{msw-sblp-96
, author =	"J. Matou{\v s}ek and M. Sharir and E. Welzl"
, title =	"A subexponential bound for linear programming"
, journal =	"Algorithmica"
, volume =	16
, year =	1996
, pages =	"498--516"
, update =	"97.03 agarwal+smid"
}

@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 E. Welzl"
, title =	"Good splitters for counting points in triangles"
, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year =	1989
, pages =	"124--130"
, update =	"96.09 agarwal"
}

@article{mw-gscpt-92
, author =	"J. Matou{\v s}ek and E. Welzl"
, title =	"Good splitters for counting points in triangles"
, journal =	"J. Algorithms"
, volume =	13
, year =	1992
, pages =	"307--319"
, succeeds =	"mw-gscpt-89"
, update =	"96.09 agarwal, 93.09 matousek"
}

@inproceedings{mww-deabv-91
, author =	"J. Matou{\v s}ek and E. 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 =	"96.09 agarwal"
}

@article{mww-deabv-93
, author =	"J. Matou{\v s}ek and E. 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 =	"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
, year =	1980
, pages =	"205--222"
}

@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"
}

@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-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{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{m-avdsc-93
, author =	"Marisa Mazon"
, title =	"About {Voronoi} Diagrams For Strictly Convex Distances"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
, update =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@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"
}

@inproceedings{ms-tdctd-93
, author =	"M. McAllister and J. Snoeyink"
, title =	"Two-dimensional computation of the three-dimensional reachable region for a welding head"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"437--442"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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
}

@article{m-pst-85
, author =	"E. M. McCreight"
, title =	"Priority search trees"
, journal =	"SIAM J. Comput."
, volume =	14
, year =	1985
, pages =	"257--276"
}

@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-90
, author =	"Kenneth M. McDonald and J. G. Peters"
, title =	"Smallest paths in simple rectilinear polygons"
, type =	"Manuscript"
, month =	mar
, year =	1990
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@inproceedings{mos-fmrio-85
, author =	"M. McKenna and J. O'Rourke and S. 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"
}

@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"
}

@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"
}

@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
}

@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"
}

@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 =	"Mathematica"
, volume =	17
, year =	1970
, pages =	"179--184"
}

@book{ms-cpubc-71
, author =	"P. McMullen and G. C. Shephard"
, title =	"Convex Polytopes and the Upper Bound Conjecture"
, booktitle =	"Lecture Notes Ser. 3"
, publisher =	"Cambridge University Press"
, address =	"Cambridge, England"
, year =	1971
}

@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"
}

@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"
}

@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
}

@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."
}

@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
, year =	1983
, pages =	"852--865"
, keywords =	"design of algorithms, parallel computation, binary search"
}

@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
, 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"
}

@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 =	"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
, year =	1984
, pages =	"182--196"
, keywords =	"NP-completeness, packing, covering, proximity"
}

@article{mt-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"
}

@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"
}

@book{m-dsa-84
, author =	"K. Mehlhorn"
, title =	"Data Structures and Algorithms"
, publisher =	"Springer-Verlag"
, year =	1984
, note =	"Volumes 1--3"
, update =	"97.03 tamassia"
}

@book{m-dsa3mscg-84
, author =	"K. 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, West Germany"
, year =	1984
, keywords =	"data structures,  algorithms, computational geometry, book"
, update =	"96.05 pascucci"
}

@book{m-ganc-84
, author =	"K. Mehlhorn"
, title =	"Graph Algorithms and {NP}-Completeness"
, series =	"Data Structures and Algorithms"
, volume =	2
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, West Germany"
, year =	1984
}

@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"
}

@book{m-mdscg-84
, author =	"K. Mehlhorn"
, title =	"Multi-dimensional Searching and Computational Geometry"
, series =	"Data Structures and Algorithms"
, volume =	3
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, West Germany"
, year =	1984
}

@book{m-ss-84
, author =	"K. Mehlhorn"
, title =	"Sorting and Searching"
, series =	"Data Structures and Algorithms"
, volume =	1
, publisher =	"Springer-Verlag"
, address =	"Heidelberg, West Germany"
, year =	1984
}

@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 =	"Fachber. Inform., Univ. Saarlandes"
, address =	"Saarbr{\"u}cken, West Germany"
, year =	1989
, keywords =	"Voronoi diagrams, randomized algorithms"
, precedes =	"mmo-cavd-91"
}

@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"
, precedes =	"mmo-cavd-91"
}

@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-89"
}

@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
}

@article{mn-bodot-90
, author =	"K. Mehlhorn and S. 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"
}

@manual{mn-cgs-96
, author =	"K. Mehlhorn and S. N{\"a}her"
, title =	"Checking Geometric Structures"
, month =	dec
, year =	1996
, note =	"Manual"
, update =	"97.03 tamassia"
}

@techreport{mn-dfc-86
, author =	"K. Mehlhorn and S. 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"
}

@article{mn-dfc-90
, author =	"K. Mehlhorn and S. N{\"a}her"
, title =	"Dynamic fractional cascading"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"215--241"
, succeeds =	"mn-dfc-86"
}

@techreport{mn-islas-94
, author =	"K. Mehlhorn and S. 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 =	"95.01 smid"
}

@techreport{mn-lledt-89
, author =	"K. Mehlhorn and S. 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"
, update =	"93.05 jones"
}

@article{mn-lpcgc-95
, author =	"K. Mehlhorn and S. N{\"a}her"
, title =	"{LEDA}: a platform for combinatorial and geometric computing"
, journal =	"Commun. ACM"
, volume =	38
, year =	1995
, pages =	"96--102"
, url =	"http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html"
, update =	"96.09 devillers, 96.01 tamassia"
}

@inproceedings{mn-iga-94
, author =	"K. Mehlhorn and S. N{\"a}her"
, title =	"The Implementation of Geometric Algorithms"
, booktitle =	"Proc. 13th World Computer Congress IFIP94"
, volume =	1
, year =	1994
, pages =	"223--231"
, update =	"97.03 devillers"
}

@techreport{mna-lbcus-86
, author =	"K. Mehlhorn and S. N{\"a}her and H. 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"
}

@article{mna-lbcus-88
, author =	"K. Mehlhorn and S. N{\"a}her and H. 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"
}

@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"
, update =	"96.05 efrat"
}

@unpublished{mnssssu-cgpvg-
, 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.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{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"
}

@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"
}

@techreport{msw-teeri-93t
, author =	"K. Mehlhorn and M. Sharir and E. 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 =	"94.01 smid, 93.05 smid"
}

@article{msw-teeri-93a
, author =	"K. Mehlhorn and M. Sharir and E. 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 =	"94.01 smid"
}

@techreport{msw-tescr-91
, author =	"K. Mehlhorn and M. Sharir and E. 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"
}

@inproceedings{msw-tescr-92
, author =	"K. Mehlhorn and M. Sharir and E. 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-teeri-93"
, update =	"93.05 smid"
}

@article{msw-tescr-93
, author =	"K. Mehlhorn and M. Sharir and E. 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 =	"97.03 gaertner+salinger"
}

@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{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"
}

@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."
, year =	1991
, pages =	"175--178"
}

@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"
}

@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"
, update =	"93.09 milone+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"
}

@incollection{m-pla-88
, author =	"S. Meiser"
, title =	"Point location in arrangements"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"71--84"
, succeeds =	"m-seavh-88"
, precedes =	"m-plah-93"
, update =	"94.01 smid"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, keywords =	"graph drawing, trees"
, update =	"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."
}

@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"
, 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"
}

@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"
, update =	"94.09 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-lrplf-87
, author =	"D. Michelucci"
, title =	"La repr{\'e}sentation par les fronti{\`e}res"
, type =	"Th{\`e}se de Doctorat en Sciences"
, school =	"Ecole des Mines"
, address =	"Saint-Etienne, France"
, year =	1987
, keywords =	"doctoral thesis"
, update =	"97.03 devillers, 93.09 rote"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"211--252"
}

@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"
}

@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"
, update =	"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 =	"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"
, update =	"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
, note =	"(special issue on Uncertainties in Geometric Design)"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"algorithms, polygons, geometric modeling"
, update =	"97.03 daniels, 96.05 pascucci"
}

@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"
, update =	"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"
}

@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-88"
, update =	"97.03 daniels, 95.01 devillers"
}

@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"
, update =	"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"
, update =	"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"
, update =	"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
, year =	1990
, pages =	"753--769"
, url =	"http://www.cs.miami.edu/~vjm/papers.html"
, keywords =	"robust geometric computation"
, succeeds =	"mn-fccrp-90i"
, update =	"97.03 daniels"
}

@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-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"
, update =	"97.03 daniels, 95.01 devillers"
}

@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-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."
, 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."
, school =	"Dept. Comput. Sci., Yale Univ."
, address =	"New Haven, CT"
, year =	1985
, pages =	"122--127"
, update =	"93.09 milone+mitchell"
}

@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
}

@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"
}

@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 =	"??"
, update =	"93.09 milone+mitchell"
}

@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"
}

@unpublished{nm-eracu-
, author =	"N. Miller and M. Sharir"
, title =	"Efficient randomized algorithms for constructing the union of fat triangles and pseudodiscs"
, note =	"Unpublished manuscript"
, update =	"97.03 schwarzkopf"
}

@inproceedings{ms-cgmcc-84
, author =	"R. Miller and Q. F. Stout"
, title =	"Computational geometry on a mesh connected computer"
, booktitle =	"Proc. IEEE Internat. Conf. on Parallel Processing"
, 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"
}

@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"
}

@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"
}

@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 =	"??"
}

@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"
}

@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. Milnor"
, title =	"Hyperbolic geometry: the first 150 years"
, journal =	"Bull. Amer. Math. Soc."
, volume =	6
, number =	1
, year =	1982
, pages =	"9--24"
}

@article{m-bnrav-64
, author =	"J. Milnor"
, title =	"On the betti numbers of real algebraic varieties"
, journal =	"Proc. Amer. Math. Soc."
, volume =	15
, year =	1964
, pages =	"275--280"
, update =	"95.01 matousek"
}

@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{mw-rsact-82
, author =	"A. Mirante and N. Weingarten"
, title =	"The Radial Sweep Algorithm for Constructing Triangulated Irreguler Networks"
, journal =	"IEEE Comput. Graph. Appl."
, 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 =	"Wiley"
, year =	1990
, pages =	"xvi+555"
, keywords =	"facility location"
, update =	"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"
, update =	"94.09 jones"
}

@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"
, update =	"96.05 efrat"
}

@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"
}

@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"
}

@article{mss-esmpg-87
, author =	"B. Mishra and J. T. Schwartz and M. 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"
}

@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"
}

@techreport{mw-dmvgi-90
, author =	"J. Mitchell and E. Welzl"
, title =	"Dynamically Maintaining a Visibility Graph under Insertions of New Obstacles"
, institution =	"Operations Research, Cornell University"
, year =	1990
}

@article{m-naspo-91
, author =	"J. 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"
}

@inproceedings{m-aaorp-90
, author =	"J. S. B. Mitchell"
, title =	"Algorithmic approaches to optimal route planning"
, booktitle =	"Proc. SPIE Conference on Mobile Robots"
, site =	"Boston, MA"
, month =	"4-9 November"
, year =	1990
, pages =	"??"
, keywords =	"shortest paths, visibility graphs, weighted regions"
}

@article{m-aaspt-88
, author =	"J. 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"
}

@incollection{m-aaspt-91
, author =	"J. 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"
}

@inproceedings{m-avna-84
, author =	"J. S. B. Mitchell"
, title =	"An Autonomous Vehicle Navigation Algorithm"
, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
, volume =	485
, year =	1984
, pages =	"153--158"
}

@inproceedings{m-oasrp-89
, author =	"J. 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"
}

@techreport{m-aagsp-93
, author =	"J. S. B. Mitchell"
, title =	"Approximation Algorithms for Geometric Separation Problems"
, institution =	"Department of Applied Mathematics., SUNY Stony Brook, NY"
, month =	jul
, year =	1993
, update =	"95.01 mitchell"
}

@techreport{m-esppo-94
, author =	"J. S. B. Mitchell"
, title =	"Euclidean shortest paths among polygonal obstacles in the plane"
, type =	"Technical {Report}"
, institution =	"University at Stony Brook"
, year =	1994
, update =	"96.05 mitchell"
, annote =	"Gives an $O(n+ h^2\log n)$ algorithm for shortest paths"
}

@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"
, update =	"96.09 agarwal, 96.01 mitchell"
}

@article{m-lsppo-92
, author =	"J. 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 =	"93.09 milone+mitchell"
}

@techreport{m-csfal-90
, author =	"J. 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"
}

@inproceedings{m-mfpd-88
, author =	"J. 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"
}

@article{m-mfpd-90
, author =	"J. 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"
}

@phdthesis{m-psp-86
, author =	"J. 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 =	"93.09 jones"
}

@inproceedings{m-spop-93
, author =	"J. 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"
, update =	"97.03 devillers, 93.09 jones"
}

@inproceedings{m-spop-93-a
, author =	"J. 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"
, update =	"96.05 mitchell, 93.09 jones"
}

@article{m-spop-96
, author =	"J. 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 =	"97.03 devillers+schwarzkopf, 96.05 mitchell"
}

@techreport{m-spozc-87
, author =	"J. 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"
}

@techreport{m-spn-96
, author =	"J. S. B. Mitchell"
, title =	"Shortest paths and networks"
, type =	"Technical {Report}"
, institution =	"University at Stony Brook"
, year =	1996
, update =	"96.05 mitchell"
, annote =	"A survey chapter written for the CRC Handbook of Computational Geometry.
		This version is somewhat expanded, with all references, etc."
}

@inproceedings{m-srpo-87
, author =	"J. 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 =	"94.05 smid"
}

@article{mmp-dgp-87
, author =	"J. 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"
}

@inproceedings{mms-qsrs-94
, author =	"J. S. B. Mitchell and D. M. Mount and S. Suri"
, title =	"Query-Sensitive Ray Shooting"
, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year =	1994
, pages =	"359--368"
, update =	"94.09 jones, 94.01 jones"
}

@inproceedings{mp-psp-85
, author =	"J. 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"
}

@inproceedings{mp-wrp-87
, author =	"J. 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"
}

@article{mp-wrpfs-91
, author =	"J. 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"
}

@article{mpk-pravc-87
, author =	"J. 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"
}

@inproceedings{mpa-csklp-92
, author =	"J. S. B. Mitchell and C. Piatko and E. 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"
}

@article{mrsw-ccppp-95
, author =	"Joseph S. B. Mitchell and G. 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-chsck-91, rw-cckgp-92, eorw-fmakg-92"
, update =	"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 =	"J. S. B. Mitchell and G. 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"
, update =	"93.09 rote"
}

@article{mrw-mlpop-92
, author =	"J. S. B. Mitchell and G. 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 =	"93.09 rote"
}

@incollection{ms-ga-95
, author =	"J. S. B. Mitchell and S. Suri"
, title =	"Geometric Algorithms"
, 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"
, update =	"95.01 mitchell, 95.01 mitchell"
}

@article{ms-sapo-95
, author =	"J. S. B. Mitchell and S. 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 =	"97.03 agarwal, 96.01 mitchell"
}

@techreport{ms-saps-91
, author =	"J. S. B. Mitchell and S. 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"
}

@inproceedings{ms-saps-92
, author =	"J. S. B. Mitchell and S. 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 =	"96.01 mitchell, 95.01 mitchell"
}

@techreport{mw-fobpp-90
, author =	"J. 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"
}

@inproceedings{mw-fobpp-91
, author =	"J. 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"
}

@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"
}

@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"
}

@inproceedings{mw-wrmg-91
, author =	"J. 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"
}

@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{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-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"
, update =	"94.09 jones"
}

@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 =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

@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"
, update =	"96.05 efrat"
}

@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"
}

@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"
, update =	"97.03 smid"
}

@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"
}

@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 Software"
, volume =	7
, year =	1990
, pages =	"21--8"
, keywords =	"graph drawing"
, update =	"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{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-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"
}

@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"
}

@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"
}

@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 S. 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"
}

@article{mpsy-cemst-90
, author =	"C. Monma and M. Paterson and S. Suri and F. Yao"
, title =	"Computing {Euclidean} maximum spanning trees"
, journal =	"Algorithmica"
, volume =	5
, year =	1990
, pages =	"407--419"
, succeeds =	"mpsy-cemst-88"
}

@inproceedings{ms-ppgmm-91
, author =	"C. Monma and S. 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 =	"Wiley"
, address =	"New York, NY"
, year =	1991
, pages =	"899--912"
}

@techreport{ms-setpc-90
, author =	"C. Monma and S. Suri"
, title =	"Some Embedding and topological problems concerning minimum spanning trees"
, month =	dec
, year =	1990
, update =	"93.09 milone+mitchell"
}

@inproceedings{ms-tgmst-91
, author =	"C. Monma and S. 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"
}

@article{ms-tgmst-92
, author =	"C. Monma and S. 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 =	"95.09 agarwal"
}

@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"
}

@incollection{m-pgrth-91
, author =	"Paul-Andr{\'e} Monney"
, title =	"Planar geometric reasoning with the theory of hints"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"141--159"
, update =	"94.01 rote"
}

@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"
}

@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"
}

@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"
}

@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
}

@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"
}

@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"
}

@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
}

@inproceedings{m-hdt-94
, author =	"J.-M. Moreau"
, title =	"Hierarchical {Delaunay} Triangulation"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"165--170"
, update =	"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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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"
}

@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 =	"Wiley"
, address =	"New York, NY"
, year =	1985
, update =	"93.05 orourke"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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-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"
}

@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"
}

@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 =	"N. Mouawad"
, title =	"The minimal cone-segment cover problem"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"100--103"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{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"
, update =	"95.09 agarwal, 93.09 milone+mitchell"
}

@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"
}

@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 Wu"
, title =	"Chromatic Nearest Neighbour Searching: a Query Sensitive Approach"
, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
, year =	1995
, pages =	"261--266"
, update =	"95.09 jones"
}

@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"
}

@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{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"
}

@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"
, update =	"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$."
}

@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"
}

@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"
, update =	"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"
}

@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
}

@incollection{m-tccar-88
, author =	"H. M{\"u}ller"
, title =	"Time coherence in computer animation by ray tracing"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"187--201"
, keywords =	"design of algorithms, computer graphics, rays, interval trees"
}

@incollection{mo-sasbb-91
, author =	"Heinrich M{\"u}ller and Matthias Otte"
, title =	"Solving algebraic systems in {Bernstein}-{B{\'e}zier} representation"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"161--169"
, update =	"94.01 rote"
}

@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"
}

@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{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"
}

@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"
}

@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"
, update =	"95.05 aronov"
}

@article{m-gdsrs-93
, author =	"Ketan Mulmuley"
, title =	"A Generalization of {Dehn}-{Sommerville} Relations to Simple Stratified Spaces"
, 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
, year =	1989
, pages =	"379--388"
}

@book{m-cgitr-93
, author =	"K. Mulmuley"
, title =	"Computational Geometry: An Introduction Through Randomized Algorithms"
, publisher =	"Prentice Hall"
, address =	"Englewood Cliffs, NJ"
, year =	1994
, update =	"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"
, update =	"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"
}

@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"
}

@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"
, update =	"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"
}

@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"
}

@book{m-eat-84
, author =	"J. R. Munkers"
, title =	"Elements of algebraic topology"
, publisher =	"Addison-Wesley"
, year =	1984
, update =	"93.09 matousek"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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{mlp-gsgv-95
, author =	"Tamara Munzner and Stuart Levy and Mark Philips"
, title =	"Geomview: {A} System for Geometric Visualization"
, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year =	1995
, pages =	"C12--C13"
, keywords =	"software, visualization"
, update =	"95.09 mitchell"
}

@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
}

@inproceedings{ms-rtnns-93
, author =	"M. Murphy and S. 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"
, update =	"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."
}

@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-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"
}

@incollection{m-spcgt-92
, author =	"O. R. Musin"
, title =	"On some problems of computational geometry and topology"
, booktitle =	"??"
, series =	"Lecture Notes in Mathematics"
, 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."
}

@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
, note =	"\path|http://www.cs.cmu.edu/\~{}bam/nsfworkshop/hcireport.html|"
, 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"
}

@inproceedings{nm-lledt-90
, author =	"S. Naeher 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 =	"95.05 agarwal"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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
}

@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{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"
}

@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"
}

@phdthesis{n-rpoca-??
, author =	"L. S. Narasimhan"
, title =	"Recognition of Polyhedral Objects: {Concepts} and Algorithms"
, school =	"The University of Texas"
, address =	"Dallas, Texas"
, year =	"??"
, keywords =	"doctoral thesis"
, update =	"93.09 milone+mitchell"
}

@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-dmppci-91i"
, update =	"93.09 franklin"
}

@inproceedings{nf-bcpp-92
, author =	"Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
, title =	"Boolean Combinations of Polygons in Parallel"
, booktitle =	"Proceedings of the 1992 International Conference on Parallel Processing"
, 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 =	"5--7 June"
, year =	1991
, pages =	"279--?"
, keywords =	"parallel computation, intersection, grids, constructive solid geometry, area"
, precedes =	"nf-dmppc-91a"
, update =	"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 =	"3 April"
, year =	1992
, pages =	"257--262"
, keywords =	"parallel algorithms, performance evaluation, intersection, grids"
, update =	"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"
}

@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-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-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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@inproceedings{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"
, booktitle =	"Conf. Analysis Problem Classes and Programming for Parallel Computing"
, year =	1981
, pages =	"358--372"
, note =	"(Tech. Report EE 8005, Dept. Electrical Eng., Indian Inst. Technology, New Delhi, India)"
, update =	"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"
}

@unpublished{n-cgpt-
, author =	"Bruce F. Naylor"
, title =	"Constructing Good Partitioning Trees"
, institution =	"AT\& T Bell Laboratories"
, year =	"??"
, note =	"Manuscript"
, update =	"95.01 mitchell"
}

@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"
}

@book{n-bztdp-78
, author =	"W. Nef"
, title =	"Beitr{\"{a}}ge zur Theorie der Polyeder"
, publisher =	"Herbert Lang"
, address =	"Bern"
, year =	1978
, update =	"93.09 devillers"
}

@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 =	"Proceedings of the SIGMOD Conference"
, site =	"San Francisco"
, month =	may
, year =	1987
, pages =	"270--277"
, update =	"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"
}

@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
, update =	"93.09 milone+mitchell"
}

@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"
}

@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 =	"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"
}

@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{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"
, update =	"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"
}

@inproceedings{nwr-bcsh-93
, author =	"Viet Hai Nguyen and Peter Widmayer and Thomas Roos"
, title =	"Best cuts of a set of hyperrectangles"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"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
, year =	1983
, pages =	"456--471"
}

@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"
}

@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"
}

@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"
, update =	"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."
}

@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."
}

@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{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"
}

@incollection{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 =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"171--186"
, update =	"94.01 rote"
}

@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{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"
}

@phdthesis{n-gagmm-95
, author =	"B. J. Nilsson"
, title =	"Guarding Art Galleries --- Methods for Mobile Guards"
, school =	"Lund University"
, year =	1995
, keywords =	"doctoral thesis"
, update =	"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"
, address =	"Berlin"
, year =	1992
, pages =	"148--185"
, update =	"97.03 icking"
}

@inproceedings{ns-oarlc-91
, author =	"B. 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 =	"distance, polygon"
, precedes =	"ns-oarlc-96"
, update =	"96.09 devillers"
}

@article{ns-oarlc-96
, author =	"B. 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"
, succeeds =	"ns-oarlc-91"
, update =	"96.09 devillers"
}

@incollection{ns-crldp-91
, author =	"Bengt J. Nilsson and Sven Schuierer"
, title =	"Computing the rectilinear link diameter of a polygon"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"203--215"
, update =	"94.01 rote"
, 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."
}

@inproceedings{nw-owrsp-90
, 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"
}

@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"
}

@article{nc-pgta-88
, author =	"T. Nishizeki and N. Chiba"
, title =	"Planar Graphs: {Theory} and Algorithms"
, journal =	"Ann. Discrete Math."
, volume =	32
, year =	1988
, keywords =	"graph drawing"
, update =	"96.09 devillers, 96.05 agarwal, 93.09 tamassia"
}

@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"
}

@article{ngv-begs-
, author =	"M. H. Nodine and M. T. Goodrich and J. S. Vitter"
, title =	"Blocking for External Graph Searching"
, journal =	"Algorithmica"
, note =	"To appear"
, update =	"97.03 tamassia"
}

@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"
}

@incollection{n-cgia-88
, author =	"H. Noltemeier"
, title =	"Computational Geometry and its Applications"
, booktitle =	"Proceedings Workshop CG '88"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, institution =	"Universit{\"a}t W{\"u}rzburg"
, publisher =	"Springer-Verlag"
, month =	mar
, year =	1988
, update =	"93.09 milone+mitchell"
}

@incollection{n-lfmss-91
, author =	"Hartmut Noltemeier"
, title =	"Layout of flexible manufacturing systems --- selected problems"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"217--225"
, update =	"94.01 rote"
}

@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"
}

@misc{n-5dg-95
, author =	"S. North"
, title =	"5114 directed graphs"
, year =	1995
, note =	"Manuscript. \path|ftp.research.bell-labs.com/dist/drawdag/|"
, keywords =	"graph drawing, experiments"
, update =	"96.09 tamassia"
}

@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 \path|http://www.research.bell-labs.com/dist/drawdag|"
, keywords =	"graph drawing"
, update =	"96.09 tamassia, 96.04 garg"
}

@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"
}

@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"
}

@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"
}

@article{nv-rttp-94
, author =	"J. N{\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 =	"97.03 gaertner+salinger"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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-88
, author =	"O. Nurmi and J.-R. Sack"
, title =	"Separating a polyhedron by one translation from a set of obstacles"
, booktitle =	"Proc. Workshop Graph Theory"
, series =	"Lecture Notes Comput. Sci."
, volume =	344
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"202--212"
, keywords =	"separation"
}

@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{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"
}

@incollection{oss-picpu-87
, author =	"S. Ocken and J. T. Schwartz and M. Sharir"
, title =	"Precise implementation of {CAD} primitives using rational parameterization of standard surfaces"
, editor =	"J. Hopcroft and J. Schwartz and M. Sharir"
, booktitle =	"Planning, Geometry, and Complexity of Robot Motion"
, publisher =	"Ablex Pub. Corp."
, address =	"Norwood, NJ"
, year =	1987
, pages =	"245--266"
, keywords =	"CAD, rational parameterization, quadric surfaces, intersection"
}

@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
}

@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"
}

@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 M. 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 =	"96.01 aronov"
}

@article{osy-gvdl-87
, author =	"C. {\'O}'D{\'u}nlaing and M. 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 =	"96.01 aronov"
}

@inproceedings{osy-rnamp-83
, author =	"C. {\'O}'D{\'u}nlaing and M. 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 =	"96.05 agarwal"
}

@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
}

@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
}

@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"
}

@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"
}

% review in Science (21 May 1993), 1170--1173
@book{obs-stcav-92
, author =	"Atsuyuki Okabe and Barry Boots and Kokichki 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.03 schwarzkopf, 96.05 agarwal, 93.09 jones, 93.05 jones"
}

@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-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."
}

@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{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"
}

@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"
}

@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"
}

@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"
, update =	"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"
, update =	"96.05 efrat"
}

@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"
}

@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"
}

@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{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-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-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"
}

@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"
, publisher =	"Oxford University Press"
, address =	"New York, NY"
, year =	1987
, keywords =	"visibility, decomposition, covering, partition, geometric graphs"
}

@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-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
, year =	1993
, pages =	"107--113"
, note =	"Also in SIGACT News 24:1 (1993), 20--25"
, update =	"93.05 orourke"
, annote =	"Visibility graphs"
}

@article{o-cgc19-93
, author =	"J. O'Rourke"
, title =	"Computational geometry column 19"
, journal =	"Internat. J. Comput. Geom. Appl."
, volume =	3
, year =	1993
, pages =	"221--224"
, note =	"Also in SIGACT News 24:2 (1993), 15--17"
, update =	"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 =	"??"
, year =	1997
, pages =	"?--?"
, note =	"Also in SIGACT News, 28(1):7--8 (1997), Issue 102"
, update =	"97.03 orourke"
, annote =	"Several results from {\em Combinatorial Geometry}
		(J. Pach and P.K. Agarwal) are detailed."
}

@book{o-cgc-94
, author =	"J. O'Rourke"
, title =	"Computational Geometry in {C}"
, publisher =	"Cambridge University Press"
, year =	1994
, note =	"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"
, comments =	"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 =	"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-94b
, author =	"J. O'Rourke"
, title =	"Computational Geometry in {C}"
, publisher =	"Cambridge University Press"
, year =	1994
, update =	"97.03 tamassia"
}

@book{o-cgcfix-94
, author =	"J. O'Rourke"
, title =	"Computational Geometry in {C}"
, publisher =	"Cambridge University Press"
, year =	1994
, update =	"97.03 tamassia"
}

@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"
}

@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-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-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"
}

@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"
, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
, year =	1981
, pages =	"664--666"
, keywords =	"polyhedra, area"
}

@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"
}

@incollection{o-v-97
, author =	"J. O'Rourke"
, title =	"Visibility"
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"CRC Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press"
, year =	1997
, pages =	"467--479"
, location =	"Boca Raton, FL"
, update =	"97.03 orourke"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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
}

@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"
}

@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-pvgppI-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 =	"96.05 orourke"
}

@techreport{os-pvgppII-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 =	"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 =	""
, year =	1997
, pages =	""
, note =	"To appear (maybe not until 1998)"
, update =	"97.03 orourke"
}

@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"
}

@inproceedings{osb-spps-85
, author =	"J. O'Rourke and S. 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"
}

@incollection{ot-pr-97
, author =	"J. O'Rourke and G. T. Toussaint"
, title =	"Pattern recognition"
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"CRC Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press"
, year =	1997
, pages =	"797--813"
, location =	"Boca Raton, FL"
, update =	"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"
}

@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{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"
}

@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"
}

@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{ot-nsga-87
, author =	"T. Ottmann and G. Thiemt"
, 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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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 =	"??"
}

@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{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"
, update =	"95.09 mitchell+schwarzkopf"
}

@article{oss-slspt-90
, author =	"M. Overmars and H. Schipper and M. Sharir"
, title =	"Storing line segments in partition trees"
, journal =	"BIT"
, volume =	30
, year =	1990
, pages =	"385--403"
, succeeds =	"oss-slspt-89"
}

@article{os-sosah-92
, author =	"M. Overmars and M. Sharir"
, title =	"A simple output-sensitive algorithm for hidden surface removal"
, journal =	"ACM Trans. Graph."
, volume =	11
, year =	1992
, pages =	"1--11"
, update =	"94.05 matousek"
}

@inproceedings{os-oshsr-89
, author =	"M. Overmars and M. 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"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"167--184"
}

@inproceedings{o-dcgalc-96
, author =	"Mark H. Overmars"
, title =	"Designing the {C}omputational {G}eometry {A}lgorithms {L}ibrary {CGAL}"
, editor =	"M. C. Lin and D. Manocha"
, booktitle =	"Applied Computational Geometry (Proc. WACG~'96)"
, series =	"Lecture Notes Comput. Sci."
, volume =	1148
, publisher =	"Springer-Verlag"
, year =	1996
, pages =	"53--58"
, url =	"http://www.cs.ruu.nl/CGAL/Papers/panel.ps.gz"
, update =	"97.03 tamassia"
}

@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"
}

@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"
}

@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 =	"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 =	"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"
}

@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"
, address =	"Heidelberg, West Germany"
, year =	1981
, pages =	"224--233"
, update =	"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 M. 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 =	"94.05 schwarzkopf"
}

@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 M. 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 =	"93.09 milone+mitchell"
}

@inproceedings{os-mvm-90
, author =	"M. H. Overmars and M. Sharir"
, title =	"Merging visibility maps"
, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year =	1990
, pages =	"168--176"
, precedes =	"os-mvm-91"
}

@article{os-mvm-91
, author =	"M. H. Overmars and M. Sharir"
, title =	"Merging visibility maps"
, journal =	"Comput. Geom. Theory Appl."
, volume =	1
, year =	1991
, pages =	"35--49"
, succeeds =	"os-mvm-90"
}

@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}: partitions"
, journal =	"Acta Inform."
, volume =	27
, year =	1990
, pages =	"423--452"
}

@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"
, address =	"Berlin"
, year =	1994
, pages =	"240--253"
, update =	"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"
}

@inproceedings{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 =	"Boston, MA"
, year =	1995
, keywords =	"probabilistic, motion planning, learning"
, update =	"97.03 schwarzkopf"
}

@article{ow-sms2d-85
, author =	"M. H. Overmars and E. 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"
}

@techreport{ow-csvg-87
, author =	"M. H. Overmars and E. 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 =	"93.09 milone+mitchell"
}

@inproceedings{ow-nmcvg-88
, author =	"M. H. Overmars and E. Welzl"
, title =	"New methods for computing visibility graphs"
, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
, year =	1988
, pages =	"164--171"
}

@inproceedings{ow-ccp-85
, author =	"M. H. Overmars and E. Welzl"
, title =	"The complexity of cutting paper"
, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
, year =	1985
, pages =	"316--321"
, keywords =	"shape, dynamic programming"
}

@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"
}

@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"
, address =	"Berlin, Germany"
, year =	1981
, pages =	"95--107"
, keywords =	"graph drawing"
, update =	"96.09 agarwal, 93.09 tamassia"
}

@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"
}

@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
, update =	"96.05 pocchiola"
}

@article{p-ip-78
, author =	"J. Pach"
, title =	"On an isoperimetric problem"
, journal =	"Studia Sci. Math. Hungar."
, volume =	13
, year =	1978
, pages =	"43--45"
}

@book{p-stces-93
, 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
, 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 =	"93.09 erickson"
}

@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 E. 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"
}

@article{ppw-wplls-93
, author =	"J. Pach and R. Pollack and E. Welzl"
, title =	"Weaving Patterns of Lines and Line Segments in Space"
, journal =	"Algorithmica"
, volume =	9
, year =	1993
, pages =	"561--571"
, update =	"97.03 gaertner+salinger"
}

@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"
, update =	"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"
}

@inproceedings{ps-vvasq-89
, author =	"J. Pach and M. 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"
}

@article{ps-vvasq-91
, author =	"J. Pach and M. Sharir"
, title =	"On vertical visibility in arrangements of segments and the queue size in the {Bentley}-{Ottman} line sweeping algorithm"
, journal =	"SIAM J. Comput."
, volume =	20
, year =	1991
, pages =	"460--470"
, succeeds =	"ps-vvasq-89"
}

@techreport{ps-raprp-90
, author =	"J. Pach and M. Sharir"
, title =	"Repeated Angles in the Plane and Related Problems"
, type =	"Technical {Report}"
, number =	"90-10"
, institution =	"DIMACS, Rutgers Univ."
, year =	1990
, update =	"93.09 milone+mitchell"
}

@article{ps-raprp-92
, author =	"J. Pach and M. Sharir"
, title =	"Repeated angles in the plane and related problems"
, journal =	"J. Combin. Theory Ser. A"
, volume =	59
, year =	1992
, pages =	"12--22"
}

@techreport{ps-ueplf-87
, author =	"J. Pach and M. 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"
}

@article{ps-ueplf-89
, author =	"J. Pach and M. 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"
}

@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-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"
, update =	"93.09 jones"
}

@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"
, update =	"93.09 rote"
}

@book{p-ggv-95
, title =	"Graphics Gems V"
, editor =	"Alan W. Paeth"
, publisher =	"Academic Press"
, address =	"Boston, MA"
, year =	1995
, isbn =	"0-12-543455-3"
, update =	"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."
}

@phdthesis{p-wvrp-90
, author =	"S. P. Pal"
, title =	"Weak Visibility and Related Problems"
, type =	"Ph.{D}. Thesis"
, school =	"Indian Inst. Science"
, year =	1990
, keywords =	"doctoral thesis"
, update =	"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"
}

@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"
}

@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"
, update =	"94.09 jones"
}

@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"
, update =	"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"
}

@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{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{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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@techreport{py-spwm-88
, author =	"C. H. Papadimitriou and M. Yannakakis"
, title =	"Shortest Paths Without a Map"
, type =	"Manuscript"
, year =	1988
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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--116"
, update =	"94.09 jones"
}

@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"
}

@techreport{pt-iabod-96
, author =	"A. Papakostas and I. G. Tollis"
, title =	"Improved Algorithms and Bounds for Orthogonal Drawings"
, journal =	"Manuscript"
, year =	1995
, keywords =	"graph drawing"
, update =	"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"
}

@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"
}

@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"
}

@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{t-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 =	"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"
}

@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"
}

@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."
, year =	1989
, pages =	"23--32"
, precedes =	"py-ebsph-90"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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 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 =	"J. Wiley"
, address =	"London, UK"
, year =	1991
, pages =	"13--41"
, update =	"95.05 abrams"
}

@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"
}

@article{pt-eege-90
, author =	"F. Newbery Paulish and W. F. Tichy"
, title =	"{EDGE}: An Extendible Graph Editor"
, journal =	"Softw. -- Pract. Exp."
, volume =	20
, number =	"S1"
, year =	1990
, pages =	"1/63--S1/88"
, note =	"also as Technical Report 8/88, Fakultat fur
                 Informatik, Univ. of Karlsruhe, 1988"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@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 Annual ACM Conference on Object-Oriented Programming Systems, Languages, and Applications"
, 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"
}

@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"
}

@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"
, 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-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"
}

@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"
}

@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"
}

@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 =	""
, update =	"95.09 mitchell"
}

@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"
, update =	"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."
, year =	1991
, pages =	"233--238"
, precedes =	"aps-zsha-93"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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{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"
}

@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"
}

@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-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."
}

@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"
}

@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"
}

@article{p-rpsts-95
, author =	"G. Ch. Pflug"
, title =	"Random planar shapes and their statistical recognition"
, editor =	"Janos Csirik and Horst Bunke"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"267--280"
, keywords =	"matching, shape recognition, vision"
, update =	"95.09 mitchell"
}

@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{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"
}

@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"
}

@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"
, update =	"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"
}

@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"
}

@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-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"
}

@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{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-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{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"
, update =	"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"
, update =	"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"
}

@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"
, update =	"96.05 efrat+pocchiola"
}

@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"
, update =	"97.03 devillers, 93.09 jones"
}

@article{pv-vc-96
, author =	"M. Pocchiola and G. Vegter"
, title =	"The visibility complex"
, booktitle =	"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.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"
}

@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"
}

@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"
}

@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
}

@techreport{ps-cgcsp-86
, author =	"R. Pollack and M. 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 =	"93.09 milone+mitchell"
}

@article{psr-cgcsp-89
, author =	"R. Pollack and M. Sharir and G. 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"
}

@article{pss-stsps-87
, author =	"R. Pollack and M. Sharir and S. Sifrony"
, title =	"Separating two simple polygons by a sequence of translations"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1987
, pages =	"123--136"
, keywords =	"polygons, simple, Davenport-Schinzel sequences, motion planning, rays"
}

@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"
}

@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"
}

@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"
, update =	"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"
}

@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"
}

@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
}

% ### 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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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{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"
}

@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{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"
}

@article{p-nappl-81
, author =	"F. P. Preparata"
, title =	"A new approach to planar point location"
, journal =	"SIAM J. Comput."
, volume =	10
, year =	1981
, pages =	"473--482"
}

@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"
}

@article{p-pplr-90
, author =	"F. P. Preparata"
, title =	"Planar point location revisited"
, journal =	"Internat. J. Found. Comput. Sci."
, volume =	1
, year =	1990
, pages =	"71--86"
}

@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"
}

@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
, keywords =	"book"
, comments =	"corrected and expanded second printing, 1988"
, update =	"95.09 agarwal"
}

@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
, year =	1981
, pages =	"161--164"
, keywords =	"polygons, design of algorithms"
}

@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
, year =	1989
, pages =	"811--830"
}

@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"
}

@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-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"
}

@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"
}

@article{p-slpab-90
, author =	"W. Pugh"
, title =	"Skip lists: a probabilistic alternative to balanced trees"
, journal =	"Commun. ACM"
, volume =	35
, year =	1990
, pages =	"668--676"
, keywords =	"data structuring, randomized algorithms"
, update =	"93.05 jones"
}

@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{pch-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 =	"96.09 tamassia, 96.04 garg"
}

@article{p-rae-88
, author =	"G. Purdy"
, title =	"Repeated angles in {$E_4$}"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"73--75"
}

@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"
}

@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"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1976
, pages =	"21--30"
}

@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 =	"??"
}

@inbook{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
}

@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"
}

@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 =	"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{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{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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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, Univerity of Texas at Austin"
, year =	1990
, keywords =	"graph drawing"
, update =	"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"
}

@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?)"
}

@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"
, update =	"95.09 jones"
}

@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"
, update =	"96.05 efrat"
}

@article{r-iubdp-96
, author =	"E. Ramos"
, title =	"Intersection of unit-balls and diameter of a point set in {$R^3$}"
, journal =	"Computat. Geom. Theory Appl."
, volume =	6
, year =	1996
, pages =	"in press"
, update =	"97.03 agarwal, 96.05 agarwal, 95.09 agarwal"
}

@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-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"
}

@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 =	""
, update =	"95.09 mitchell"
}

@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 =	""
, update =	"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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"96.09 devillers"
}

@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
, year =	1990
, pages =	"289--304"
, succeeds =	"rit-cscsl-86"
}

@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"
}

@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"
}

@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"
}

@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"
}

@unpublished{rr-dess-95
, author =	"H. Ratshek 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 =	"96.05 devillers"
}

@article{r-fdbg-92
, author =	"M. Rauch"
, title =	"Fully Dynamic Biconnectivity in Graphs"
, journal =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
, year =	1992
, pages =	"50--59"
, update =	"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"
}

@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"
}

@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
, update =	"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"
}

@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-89"
}

@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{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{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
}

@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 =	""
, update =	"95.09 mitchell"
}

@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"
, address =	"Heidelberg, NY"
, year =	1989
, pages =	"??"
, update =	"95.01 mitchell"
}

@article{r-dcikc-88ii
, 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 =	"96.05 agarwal"
}

@incollection{r-dcikc-88
, author =	"M. Reichling"
, title =	"On the detection of a common intersection of $k$ convex polyhedra"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"180--186"
}

@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"
}

@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-ccopt-90"
, update =	"95.01 matousek"
}

@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 M. Sharir"
, booktitle =	"Planning, Geometry and Complexity of Robot Motion"
, publisher =	"Ablex Pub. Corp."
, address =	"Norwood, NJ"
, year =	1987
, pages =	"267--281"
, succeeds =	"r-cmpg-79"
}

@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"
}

@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 =	"Proceedings of the 1987 International Conference on Parallel Processing."
, 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."
}

@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"
}

@inproceedings{rs-mppmo-85
, author =	"J. H. Reif and M. 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"
, comments =	"Submitted to J. ACM"
}

@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."
, 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"
}

@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{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"
}

@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
, 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 =	"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"
, 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 Software"
, 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"
, 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{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"
}

@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"
}

@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"
}

@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
}

@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
}

@inproceedings{r-mfdg-93
, author =	"Jean-Pierre Reveilles"
, title =	"Mathematical foundations of Discrete Geometry"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"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-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"
, update =	"93.09 milone+mitchell"
}

@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"
, update =	"93.09 jones"
}

@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"
}

@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-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"
}

@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-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-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"
}

@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"
}

@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"
}

@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"
}

@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{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"
}

@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"
}

@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-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."
}

@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"
}

@inproceedings{ru-pcp-91
, author =	"E. Rivera-Campo and J. Urrutia"
, title =	"A property of convex polygons"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"203--206"
}

@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"
}

@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"
}

@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"
, update =	"95.09 mitchell"
}

@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{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 theorems 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"
, update =	"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-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"
}

@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"
}

@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"
, update =	"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 =	"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{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."
}

@book{r-pc-64
, author =	"C. A. Roger"
, title =	"Packing and Covering"
, publisher =	"Cambridge University Press"
, address =	"Cambridge, England"
, year =	1964
, keywords =	"book"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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''"
}

@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"
, update =	"96.09 romanik, 96.05 efrat"
}

@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"
, update =	"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"
}

@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."
}

@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"
, year =	1991
, keywords =	"doctoral thesis"
}

@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"
, address =	"Heidelberg, NY"
, year =	1989
, pages =	"330--340"
, update =	"94.05 smid, 93.09 milone+mitchell"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@article{r-vdds-92
, author =	"T. Roos"
, title =	"Voronoi diagrams over dynamic scenes"
, journal =	"Discrete Appl. Math."
, year =	1992
, pages =	"to appear"
, succeeds =	"r-vdods-90"
, update =	"95.01 mitchell"
}

@incollection{rn-dvdmp-91
, author =	"Thomas Roos and Hartmut Noltemeier"
, title =	"Dynamic {Voronoi} diagrams in motion planning"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"227--236"
, update =	"94.01 rote"
}

@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{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"
}

@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-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
}

@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"
, update =	"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
}

@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"
}

@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"
}

@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"
}

@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"
}

@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. 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 =	"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. Rote"
, title =	"Computing the minimum {Hausdorff} distance between two point sets on a line under translation"
, journal =	"Inform. Process. Lett."
, volume =	38
, year =	1991
, pages =	"123--127"
, keywords =	"pattern recognition, pattern matching"
, cites =	"hk-cmhdp-90"
, update =	"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 =	"Mathematical Proceedings of the Cambridge Philosophical Society"
, volume =	115
, number =	1
, year =	1994
, pages =	"1--12"
, update =	"97.03 icking"
}

@inproceedings{r-dchhd-92
, author =	"G. 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"
, update =	"93.09 rote"
}

@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"
, update =	"93.09 rote"
}

@article{r-crsaa-92
, author =	"G. 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 =	"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. 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 =	"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. 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 =	"ks-tpscf-95"
, update =	"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."
}

@article{rw-cckgp-92
, author =	"G. 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-chsck-91"
, update =	"97.03 rote, 94.01 rote"
, annote =	"complexity was improved by the techniques
		 of eorw-fmakg-92, see mrsw-ccppp-95"
}

@article{rwzw-cksck-91
, author =	"G. 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 =	"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-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"
}

@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"
}

@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"
}

@techreport{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"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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 =	"N. 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
, year =	1997
, pages =	"?--?"
, keywords =	"optimal paths, anisotropism, minimum-energy, friction, gravity, qualitative physics, cylinder"
, update =	"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"
}

@article{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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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."
}

@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."
, year =	1991
, pages =	"207--210"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@inproceedings{s-der-91
, author =	"A. Saalfeld"
, title =	"Delaunay edge refinements"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"33--36"
}

@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"
}

@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"
}

@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-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{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"
}

@techreport{ss-oadwv-86
, author =	"J.-R. Sack and S. 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"
}

@article{ss-oadwv-90
, author =	"J.-R. Sack and S. 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 =	"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-97
, title =	"Handbook on Computational Geometry"
, editor =	"J.-R. Sack and J. Urrutia"
, publisher =	"North-Holland"
, year =	1997
, note =	"To appear."
, update =	"97.03 tamassia"
}

@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"
}

@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"
, 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-"
, update =	"94.05 tamassia"
}

@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"
}

@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"
}

@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-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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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-79
, author =	"H. Samet"
, title =	"A quadtree medial axis transform"
, journal =	"Commun. ACM"
, volume =	26
, year =	1979
, pages =	"680--693"
}

@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-asds-90
, author =	"H. Samet"
, title =	"Applications of Spatial Data Structures"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1990
, 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 =	"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"
}

@manual{s-sdsqo-89
, author =	"H. Samet"
, title =	"Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods"
, journal =	""
, year =	1989
, pages =	""
, note =	"To appear"
, update =	"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."
, month =	may
, year =	1988
}

@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."
, month =	jul
, year =	1988
}

@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 =	"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"
}

@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
, note =	"Available at \path|http://www.cs.uni-sb.de/RW/users/sander/html/gstools.html|"
, 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"
}

@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"
, update =	"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 =	"97.03 held"
}

@book{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"
}

@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"
}

@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"
, update =	"94.09 jones"
}

@inproceedings{s-tspvd-93
, author =	"Francisco Santos"
, title =	"On The Topological Shape Of Planar {Voronoi} Diagrams"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
, 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{st-pplup-86
, author =	"N. Sarnak and R. E. Tarjan"
, title =	"Planar point location using persistent search trees"
, journal =	"Commun. ACM"
, volume =	29
, year =	1986
, pages =	"669--679"
}

@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"
}

@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{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"
}

@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."
}

@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"
}

@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"
}

@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"
}

@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"
}

@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."
, 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"
}

@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-92
, author =	"H. Schipper"
, title =	"Determining contactibility of curves"
, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
, year =	1992
, pages =	"358--367"
}

@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
}

@incollection{s-gt2m-91
, author =	"Haijo Schipper"
, title =	"Generating triangulations of $2$-manifolds"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"237--248"
, keywords =	"topology"
, update =	"94.01 rote"
, 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"
}

@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"
}

@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"
, update =	"93.09 jones"
}

@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 =	"F. P. Preparata"
, booktitle =	"VLSI Theory"
, series =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"London, England"
, year =	1984
, pages =	"259--282"
}

@incollection{slmlw-vpvlc-85
, 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 =	"F. P. Preparata"
, booktitle =	"Adv. Comput. Res."
, volume =	2
, publisher =	"JAI Press"
, address =	"Greenwich, Conn."
, year =	1985
, pages =	"259--282"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@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{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"
}

@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 =	"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 =	"Teubner"
, address =	"Stuttgart"
, year =	1996
, keywords =	"textbook, in German"
, update =	"97.03 smid"
}

@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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"997--1030"
, keywords =	"ray tracing, implementing algorithms, survey paper"
}

@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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@article{s-tgh-87
, author =	"R. Schneider"
, title =	"Tessellations generated by hyperplanes"
, journal =	"Discrete Comput. Geom."
, volume =	2
, year =	1987
, pages =	"223--232"
}

@incollection{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 =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"249--263"
, update =	"94.01 rote"
}

@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"
}

@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-cdpg-92
, author =	"W. Schnyder and W. T. Trotter"
, title =	"Convex drawings of planar graphs"
, journal =	"Abstracts of the AMS"
, volume =	"92T-05-135"
, year =	1992
, keywords =	"graph drawing, planar, convex, straight-line"
, update =	"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"
}

@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"
}

@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"
}

@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"
, update =	"96.05 efrat"
}

@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"
, update =	"95.09 mitchell"
}

@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-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"
}

@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"
}

@incollection{s-ixgpe-91
, author =	"Peter Schorn"
, title =	"Implementing the {XYZ} {GeoBench}: A programming environment for geometric algorithms"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"187--202"
, update =	"94.01 rote"
}

@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
, update =	"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."
}

@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"
}

@incollection{s-vdbak-91
, author =	"Thomas Schreiber"
, title =	"A {Voronoi} diagram based adaptive $k$-means-type clustering algorithm for multidimensional weighted data"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"265--275"
, update =	"94.01 rote"
}

@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{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"
, month =	"Summer-Fall"
, year =	1989
, pages =	"177--193"
, keywords =	"geometric triangulations, Delaunay circumsphere criteria"
, update =	"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{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-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"
}

@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."
, year =	1991
, pages =	"96--99"
}

@incollection{srw-gsv-91
, author =	"Sven Schuierer and Gregory J. E. Rawlins and Derick Wood"
, title =	"A generalization of staircase visibility"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"277--287"
, update =	"94.01 rote"
}

@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"
}

@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"
, update =	"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"
}

@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"
}

@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"
}

@article{s-fssd-??
, author =	"L. L. Schumaker"
, title =	"Fitting surfaces to scattered data"
, journal =	"??"
, volume =	"??"
, year =	"??"
, pages =	"203--268"
}

@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"
}

@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
}

@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"
}

@article{ss-smprg-88
, author =	"J. T. Schwartz and M. 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"
}

@incollection{ss-smprg-89
, author =	"J. T. Schwartz and M. 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 =	"94.05 devillers+sharir"
}

@incollection{ss-ampr-90
, author =	"J. T. Schwartz and M. 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"
}

@techreport{ss-empae-85
, author =	"J. T. Schwartz and M. 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
}

@inproceedings{ss-feftt-87
, author =	"J. T. Schwartz and M. 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 =	"94.05 sharir"
}

@article{ss-feftt-92
, author =	"J. T. Schwartz and M. 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 =	"94.05 sharir"
}

@article{ss-ipoot-87
, author =	"J. T. Schwartz and M. 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"
}

@article{ss-mptr-83
, author =	"J. T. Schwartz and M. Sharir"
, title =	"Mathematical problems and training in robotics"
, journal =	"Notices Amer. Math. Soc."
, volume =	30
, year =	1983
, pages =	"478--481"
, keywords =	"survey paper, robotics"
}

@inproceedings{ss-mprga-86
, author =	"J. T. Schwartz and M. 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"
}

@inproceedings{ss-bfmpi-87
, author =	"J. T. Schwartz and M. 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 =	"94.05 sharir"
}

@article{ss-pmp1c-83
, author =	"J. T. Schwartz and M. Sharir"
, title =	"On the ``piano movers'' problem {I}: the 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"
}

@article{ss-pmp2g-83
, author =	"J. T. Schwartz and M. Sharir"
, title =	"On the ``piano movers'' problem {II}: general 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"
}

@article{ss-pmp3c-83
, 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 moving amidst polygonal barriers"
, journal =	"Internat. J. Robot. Res."
, volume =	2
, number =	3
, year =	1983
, pages =	"46--75"
, keywords =	"motion planning"
}

@article{ss-pmp5c-84
, author =	"J. T. Schwartz and M. 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"
}

@article{ss-tddsp-90
, author =	"J. T. Schwartz and M. 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"
}

@techreport{ss-srrv-84
, author =	"J. T. Schwartz and M. 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"
}

@inproceedings{ss-srrv-85
, author =	"J. T. Schwartz and M. 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 =	"94.05 sharir"
}

@techreport{sss-eafcc-85
, author =	"J. T. Schwartz and M. 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"
}

@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"
, year =	1992
, precedes =	"rss-mawsp-93"
, update =	"93.09 rote"
}

@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-oaocp-92"
}

@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-oalcp-91"
}

@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 =	""
, update =	"95.09 mitchell"
}

@techreport{stwe-fmep-94
, author =	"C. Schwarz and J. Teich and E. 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 =	"94.09 smid"
}

@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"
}

@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"
}

@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"
, update =	"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"
, update =	"95.09 mitchell"
}

@inproceedings{sfrw-acfpr-90
, author =	"O. Schwarzkopf and U. Fuchs and G. Rote and E. 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-90"
, update =	"97.03 rote, 93.09 rote, 93.05 schwarzkopf"
}

@inproceedings{sfrw-acfpr-97
, author =	"O. Schwarzkopf and U. Fuchs and G. Rote and E. Welzl"
, title =	"Approximation of convex figures by pairs of rectangles"
, booktitle =	"??"
, journal =	"Comput. Geom. Theory Appl. (to appear)"
, volume =	"??"
, year =	"1997?"
, pages =	"???--???"
, succeeds =	"sfrw-acfpr-90"
, cites =	"ks-tpscf-95"
, update =	"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"
, update =	"96.05 efrat"
}

@unpublished{sv-rslde-96
, author =	"Otfried Schwarzkopf and Jules Vleugels"
, title =	"Range Searching in Low-Density Environments"
, year =	1996
, note =	"Submitted to IPL"
, update =	"96.09 agarwal"
}

@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"
}

@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"
}

@book{s-a-83
, author =	"R. Sedgewick"
, title =	"Algorithms"
, publisher =	"Addison-Wesley"
, address =	"Reading, MA"
, year =	1983
, keywords =	"book, convex hull"
, annote =	"Chapter 25 treats convex hull"
}

@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"
}

@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
}

@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{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"
, update =	"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"
, update =	"93.09 erickson"
}

@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"
}

@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"
}

@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
, year =	1991
, pages =	"51--64"
}

@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"
, update =	"93.09 erickson"
}

@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-barga-91"
, update =	"93.09 erickson+matousek"
}

@incollection{s-cdtvd-88
, author =	"R. Seidel"
, title =	"Constrained {Delaunay} triangulations and {Voronoi} diagrams"
, booktitle =	"Report 260"
, publisher =	"IIG-TU"
, address =	"Graz, Austria"
, year =	1988
, pages =	"178--191"
, annote =	"Plane sweep algorithm"
}

@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"
}

@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"
}

@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-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"
}

@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"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	775
, publisher =	"Springer-Verlag"
, year =	1994
, pages =	"3--17"
, update =	"96.09 devillers"
}

@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{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"
}

@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"
}

@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-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"
}

@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"
}

@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{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{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"
, update =	"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
, update =	"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 =	"April-June"
, year =	1990
, pages =	"103--131"
, update =	"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."
}

@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-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"
}

@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"
}

@article{sr-sbuss-95
, author =	"M. Shapira and A. Rappoport"
, title =	"Shape Blending Using the Star-Skeleton Representation"
, journal =	"IEEE Comput. Graph. Appl."
, volume =	15
, number =	2
, month =	mar
, year =	1995
, pages =	"44--51"
, update =	"96.01 held"
}

@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-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."
}

@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
}

@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"
, update =	"96.05 efrat"
}

@article{s-npsap-89
, author =	"M. 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"
}

@techreport{s-ampr-88
, author =	"M. 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"
}

@article{s-ampr-89
, author =	"M. 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"
}

@article{s-alubl-87
, author =	"M. 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"
}

@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"
, update =	"97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
}

%, number =      3
@article{s-atubl-94
, author =	"M. 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"
, update =	"95.01 orourke+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"
, update =	"93.09 milone+mitchell"
}

@incollection{s-dsstg-88
, author =	"M. Sharir"
, title =	"Davenport-{Schinzel} sequences and their geometric applications"
, editor =	"R. A. Earnshaw"
, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
, series =	"NATO ASI"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"253--278"
, keywords =	"Davenport-Schinzel sequences, survey paper"
}

@inproceedings{s-eappt-87
, author =	"M. 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"
}

@article{s-ilbld-88
, author =	"M. 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"
}

@article{s-icpps-85
, author =	"M. 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"
}

@article{s-ksrh-93
, author =	"M. Sharir"
, title =	"$k$-sets and random hulls"
, journal =	"Combinatorica"
, volume =	13
, year =	1993
, pages =	"483--495"
, update =	"94.05 sharir"
}

@article{s-ksacs-91
, author =	"M. Sharir"
, title =	"On $k$-sets in arrangements of curves and surfaces"
, journal =	"Discrete Comput. Geom."
, volume =	6
, year =	1991
, pages =	"593--613"
}

@article{s-spacp-87
, author =	"M. 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"
}

@techreport{s-tddsp-85
, author =	"M. 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"
}

@article{s-swrpp-88
, author =	"M. Sharir"
, title =	"The shortest watchtower and related problems for polyhedral terrains"
, journal =	"Inform. Process. Lett."
, volume =	29
, year =	1988
, pages =	"265--270"
, keywords =	"visibility, polyhedral terrain"
}

@book{sa-dsstg-95
, author =	"M. Sharir and P. K. Agarwal"
, title =	"{Davenport}-{Schinzel} Sequences and Their Geometric Applications"
, publisher =	"Cambridge University Press"
, address =	"New York"
, year =	1995
, update =	"95.09 agarwal, 94.05 matousek"
}

@article{sa-pmp4v-84
, author =	"M. 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"
}

@inproceedings{sb-spacp-86
, author =	"M. 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"
}

@techreport{sb-spbtc-85
, author =	"M. 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"
}

@inproceedings{scklps-gadss-86
, author =	"M. 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-87}, \cite{ks-empac-90},
		 \cite{cs-vppt-89}, \cite{ws-prnds-88}"
}

@inproceedings{sl-mfipc-85
, author =	"M. 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 =	"94.05 sharir"
}

@article{so-sosah-92
, author =	"M. 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"
}

@inproceedings{ss-spps-84
, author =	"M. 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"
}

@article{ss-spps-86
, author =	"M. 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"
}

@inproceedings{ss-cmpti-88
, author =	"M. 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"
}

@article{ss-cmpti-91
, author =	"M. 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"
}

@article{ss-tbpli-91
, author =	"M. Sharir and S. S. Skiena"
, title =	"Tight bounds on a problem of lines and intersections"
, journal =	"Discrete Math."
, volume =	89
, year =	1991
, pages =	"313--314"
}

@article{st-epcp-94
, author =	"M. Sharir and S. Toledo"
, title =	"Extremal polygon containment problems"
, journal =	"Comput. Geom. Theory Appl."
, volume =	4
, year =	1994
, pages =	"99--118"
, update =	"95.09 agarwal"
}

@inproceedings{sw-cblpr-92
, author =	"M. Sharir and E. 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"
}

@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"
, update =	"96.05 efrat"
}

@techreport{sy-ricdd-90
, author =	"M. Sharir and E. Yaniv"
, title =	"Randomized incremental construction of {Delaunay} diagrams: {Theory} and Practice"
, institution =	"Tel Aviv Univ, Israel"
, month =	jul
, year =	1990
, update =	"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"
}

@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"
}

@techreport{se-tlbsv-86
, author =	"X. Shen and H. Edelsbrunner"
, title =	"A tight lower bound on the size of visibility graphs"
, type =	"Report"
, number =	"UIUCDCS-R-86-1299"
, institution =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1986
}

@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{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-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-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"
}

@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"
}

@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-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"
}

@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"
}

@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"
}

@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.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"
, update =	"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"
}

@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"
, update =	"96.09 devillers+orourke, 96.05 efrat"
}

@inproceedings{s-swa-92
, author =	"J. S. Shieh"
, title =	"Shortsighted watchman arrangement"
, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
, year =	1992
, pages =	"192--197"
}

@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"
}

@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{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{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{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"
}

@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."
}

@unpublished{s-pc-90
, author =	"P. Shor"
, note =	"private communication"
, update =	"95.09 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"
}

@incollection{s-spinh-91
, author =	"P. W. Shor"
, title =	"Stretchability of Pseudolines is {NP}-Hard"
, 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 =	"93.09 erickson"
}

@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"
}

@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"
}

@techreport{sbgs-sacgi-69
, author =	"R. A. Shumacker and R. Brand and M. Gilliland and W. Sharp"
, title =	"Study for applying computer-generated images to visual simulation"
, type =	"Report"
, number =	"AFHRL-TR-69-14"
, institution =	"U.S. Air Force Human Resources Lab."
, year =	1969
}

@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"
}

@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 =	"Wiley"
, address =	"Chichester"
, year =	1981
, pages =	"21--36"
, 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"
}

@article{s-let-78
, author =	"R. Sibson"
, title =	"Locally equiangular triangulations"
, journal =	"Comput. J."
, volume =	21
, year =	1978
, pages =	"243--245"
, keywords =	"point-set triangulation"
, 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"
}

@inproceedings{ss-nempa-86
, author =	"S. Sifrony and M. 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"
}

@article{ss-nempa-87
, author =	"S. Sifrony and M. 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"
}

@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"
}

@book{sp-rgi-94
, author =	"F. Sillion and C. Puech"
, title =	"Radiosity Global Illumination"
, publisher =	"Morgan Kauffmann"
, year =	1994
, update =	"96.05 pocchiola"
}

@inproceedings{smk-agtin-95
, author =	"C. Silva and J. 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 =	"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
}

@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-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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@phdthesis{s-gp-88
, author =	"S. S. Skiena"
, title =	"Geometric probing"
, type =	"Ph.{D}. Thesis"
, school =	"Dept. Comput. Sci., Univ. Illinois"
, address =	"Urbana, IL"
, year =	1988
, keywords =	"probing, doctoral thesis"
}

@article{s-irgp-92
, author =	"S. S. Skiena"
, title =	"Interactive Reconstruction via Geometric Probing"
, journal =	"Proc. IEEE"
, volume =	80
, number =	9
, month =	sep
, year =	1992
, pages =	"1364--1383"
, update =	"93.09 held"
}

@article{s-pcphp-91
, author =	"S. S. Skiena"
, title =	"Probing convex polygons with half-planes"
, journal =	"J. Algorithms"
, volume =	12
, year =	1991
, pages =	"359--374"
}

@article{s-pgp-89
, author =	"S. S. Skiena"
, title =	"Problems in geometric probing"
, journal =	"Algorithmica"
, volume =	4
, year =	1989
, pages =	"599--605"
, keywords =	"survey paper, problem collection"
}

@article{s-rgcss-89
, author =	"S. S. Skiena"
, title =	"Reconstructing graphs from cut-set sizes"
, journal =	"Inform. Process. Lett."
, volume =	32
, number =	3
, year =	1989
, pages =	"123--7"
}

@inproceedings{ssl-rsid-90
, author =	"S. 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"
}

@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."
}

@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"
}

@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"
}

@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"
}

@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."
}

@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 =	"??"
}

@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"
}

@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"
}

@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"
, update =	"96.01 smid"
}

@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"
}

@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"
, update =	"95.09 jones"
}

@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"
}

@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"
, update =	"93.09 erickson"
}

@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 =	"23--27 July"
, year =	1990
, pages =	"991--1002"
, update =	"94.05 franciosa"
}

@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
}

@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-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"
}

@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"
, update =	"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"
}

@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"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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"
}

@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"
}

@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{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-mdrra-93"
, update =	"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"
}

@book{s-agtd-51
, author =	"D. M. H. Sommerville"
, title =	"Analytical Geometry in Three Dimensions"
, publisher =	"Cambridge University Press"
, address =	"Cambridge"
, year =	1951
, keywords =	"geometry, lines"
, update =	"96.05 agarwal"
}

@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"
}

@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-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{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"
}

@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"
}

@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"
, update =	"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
}

@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
}

@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"
}

@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"
}

% ### 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"
}

@article{s-rtddi-81
, author =	"S. N. Srihari"
, title =	"Representation of three-dimensional digital images"
, journal =	"ACM Comput. Surv."
, volume =	13
, year =	1981
, pages =	"399--424"
}

@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"
}

@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{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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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-tpp-86
, author =	"R. P. Stanley"
, title =	"Two poset polytopes"
, journal =	"Discrete Comput. Geom."
, volume =	1
, year =	1986
, pages =	"9--23"
}

@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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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"
}

@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{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-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{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"
, update =	"94.09 jones"
}

@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"
, update =	"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."
, year =	1992
, pages =	"540--546"
, update =	"96.01 werman"
}

@article{s-cm-51
, author =	"S. K. Stein"
, title =	"Convex Maps"
, journal =	"Proc. Amer. Math. Soc."
, volume =	2
, year =	1951
, pages =	"464--466"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{sr-vudtd-34
, author =	"E. Steinitz and H. Rademacher"
, title =	"Vorlesungen {\"u}ber die Theorie der Polyeder"
, publisher =	"Julius Springer"
, address =	"Berlin, Germany"
, year =	1934
, keywords =	"graph drawing"
, update =	"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"
}

@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"
, update =	"93.09 milone+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."
, year =	1991
, pages =	"179--182"
, keywords =	"point location, robustness"
}

@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{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"
}

@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"
}

@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
}

@inproceedings{s-gtpvs-93
, author =	"Sabine Stifter"
, title =	"Geometry Theorem Proving in Vector Spaces"
, booktitle =	"Proc. 9th European Workshop Comput. Geom."
, nickname =	"CG '93"
, year =	1993
, update =	"93.09 milone+mitchell"
}

@incollection{s-pacfp-91
, author =	"Sabine Stifter"
, title =	"Predictions about collision free paths from intersection tests"
, booktitle =	"Computational Geometry --- Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91"
, series =	"Lecture Notes Comput. Sci."
, volume =	553
, publisher =	"Springer-Verlag"
, year =	1991
, pages =	"309--320"
, keywords =	"motion planning"
, update =	"94.01 rote"
}

@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{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"
}

@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"
}

@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"
, update =	"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"
, update =	"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 L. 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
}

@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 =	"??"
, comments =	"To appear, JACM"
, succeeds =	"rs-spesp-85"
, update =	"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"
}

@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."
}

@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"
}

@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"
}

@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{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
}

@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"
, update =	"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"
}

@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"
}

@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"
}

@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-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"
}

@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"
}

@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
, year =	1994
, pages =	"179--228"
, keywords =	"Voronoi diagram, robust algorithm, topology oriented method, incremental construction, combinatorial abstraction, asymptotic correctness"
, succeeds =	"si-toimc-89"
, update =	"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."
, year =	1989
, pages =	42
}

@techreport{si-gafpa-88
, author =	"K. Sugihara and M. Iri"
, title =	"Geometric Algorithms in Finite-Precision Arithmetic"
, number =	"88-10"
, institution =	"Math. Eng. and Physics Dept., U. of Tokyo, Japan"
, month =	sep
, year =	1988
, keywords =	"numerical precision, stability, robustness"
, update =	"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"
}

@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"
}

@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 Magnetic-Spring Model"
, journal =	"J. Visual Lang. Comput."
, volume =	6
, number =	3
, year =	1995
, 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 =	"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 =	"K. J. Supowit"
, title =	"Grid heuristics for some geometric covering problems"
, editor =	"F. P. Preparata"
, booktitle =	"Computational Geometry"
, series =	"Adv. Comput. Res."
, volume =	1
, publisher =	"JAI Press"
, address =	"Greenwich, CT"
, year =	1983
, pages =	"215--233"
, keywords =	"balls, $d$-dimensional, covering, heuristics"
}

@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
, year =	1983
, pages =	"428--448"
, keywords =	"plane-sweep, pattern recognition, Delaunay triangulations, minimum spanning trees, polygons, convex"
}

@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"
}

@article{s-ltaml-86
, author =	"S. 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"
}

@article{s-cgfns-89
, author =	"S. 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"
}

@techreport{s-cesl-85
, author =	"S. 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
}

@techreport{s-cgdsp-86
, author =	"S. 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
}

@techreport{s-cldsp-86
, author =	"S. 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 =	"93.05 smid"
}

@phdthesis{s-mlppr-87
, author =	"S. 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"
}

@article{s-sldps-90
, author =	"S. Suri"
, title =	"On Some Link Distance Problems in a Simple Polygon"
, journal =	"IEEE Trans. Robot. Autom."
, volume =	6
, year =	1990
, pages =	"108--113"
}

@inproceedings{s-agfnp-87
, author =	"S. 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"
}

@inproceedings{so-fmnp-85
, author =	"S. 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"
}

@inproceedings{so-wcoac-86
, author =	"S. 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"
}

@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 =	"93.09 erickson"
}

@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"
}

@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"
}

@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-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-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-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"
}

@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."
}

@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"
, update =	"95.09 mitchell"
}

@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"
, update =	"94.05 smid, 93.09 milone+mitchell"
}

@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"
, update =	"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
, year =	1995
, keywords =	"algorithm animation, visualization"
, update =	"96.09 devillers, 96.01 tamassia"
}

@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."
}

@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"
, update =	"95.09 agarwal+mitchell"
}

@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-agd-94
, author =	"R. Tamassia"
, title =	"Advances in Graph Drawing"
, booktitle =	"Proc. 2nd Italian Conference on Algorithms and Complexity"
, year =	1994
, update =	"95.01 mitchell"
}

@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-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"
}

@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"
, update =	"93.09 tamassia"
}

@incollection{t-gd-97
, author =	"R. Tamassia"
, title =	"Graph Drawing"
, editor =	"Jacob E. Goodman and Joseph O'Rourke"
, booktitle =	"CRC Handbook of Discrete and Computational Geometry"
, publisher =	"CRC Press"
, year =	1997
, url =	"http://www.cs.brown.edu/cgc/papers/t-gd-97.ps.gz"
, keywords =	"graph drawing, survey"
, update =	"97.03 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
, year =	1996
, pages =	"201--239"
, keywords =	"graph drawing, planar, embedding, dynamic"
, succeeds =	"t-ddspg-88"
, update =	"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"
}

@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
, note =	"\path|http://www.cs.brown.edu/people/rt/sdcr/report.html|"
, url =	"http://www.cs.brown.edu/people/rt/sdcr/report.html"
, update =	"97.03 tamassia"
}

@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"
, address =	"Berlin, West Germany"
, year =	1987
, pages =	"252--263"
, keywords =	"graph drawing"
, update =	"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"
}

@book{tt-gd-94
, 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 =	"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"
}

@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-"
, update =	"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"
}

@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-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"
}

@techreport{tm-mbmpa-95
, author =	"A. Tamir and J. 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"
, update =	"96.01 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"
}

@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"
, update =	"94.09 jones, 94.01 jones"
}

@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 =	"94.05 smid, 93.09 milone+mitchell"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"96.05 mitchell"
}

@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{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{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 Klinger"
, booktitle =	"Structured Computer Vision"
, publisher =	"Academic Press"
, address =	"New York, NY"
, year =	1980
, pages =	"??"
}

@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{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"
}

@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 Applied Mathematics"
, year =	1983
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
}

@book{t-dsna-87
, author =	"R. E. Tarjan"
, title =	"Data Structures and Network Algorithms"
, publisher =	"Society for Industrial and Applied Mathematics"
, address =	"Philadelphia, PA"
, year =	1987
}

@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"
}

@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
}

@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"
}

@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"
}

@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-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"
}

@inproceedings{t-paegf-96
, author =	"M. Teichmann"
, title =	"Probalistic 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"
}

@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
}

@techreport{t-tdrac-92
, author =	"M. 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-vardg-91"
, precedes =	"t-tdrac-93"
, update =	"95.09 devillers, 95.01 devillers, 94.05 devillers, 93.05 devillers"
}

@book{t-tdrac-93
, author =	"M. 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 =	"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"
, update =	"96.01 devillers, 95.09 jones"
}

@phdthesis{t-vdard-91
, author =	"M. 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 =	"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 =	"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"
, update =	"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"
}

@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{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-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.)"
}

@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"
}

@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-
, author =	"R. Thom"
, title =	"Sur l'homologie des vari\'et\'es alg\'ebriques re\'elles"
, editor =	"S. S.Cairns"
, booktitle =	"Differential and Combinatorial Topology"
, note =	"Princeton Univ. Press 1965"
, update =	"95.01 matousek"
}

@article{tc-saeca-89
, author =	"Samuel M. Thomas and Y. T. Chen"
, 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 =	"97.03 agarwal"
}

@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-pdfip-80
, author =	"C. Thomassen"
, title =	"Planarity and Duality of Finite and Infinite Planar Graphs"
, journal =	"J. Combin. Theory Ser. B"
, volume =	29
, year =	1980
, pages =	"244--271"
, keywords =	"graph drawing"
, update =	"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-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{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"
}

@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"
}

@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"
}

@article{tmt-gdgdm-
, author =	"M. Tikkanen and M. J. M{\"a}ntyl{\"a} and M. Tamminen"
, title =	"{GWB}/{DMS}: {A} geometric data manager"
, journal =	"Unknown publication by Elsevier/North-Holland/Eurographics Association"
, volume =	""
, year =	""
, pages =	""
, update =	"94.05 devillers"
}

@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{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."
}

% , 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"
, note =	"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."
, keywords =	"billiards, visibility with reflection, geometric optics, simple polygons"
, update =	"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-oqst-94
, author =	"T. Tokuyama"
, title =	"Orthogonal Queries in Segments and Triangles"
, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
, nickname =	"ISAAC '94"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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"
}

@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"
}

@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"
, update =	"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"
}

@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{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"
}

@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"
}

@article{ts-ppp-1991
, 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."
}

@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-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-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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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-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
, pages =	"197--217"
}

@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-clecl-86
, author =	"G. T. Toussaint"
, title =	"Computing largest empty circle with location constraints"
, journal =	"Internat. J. Comput. Inform. Sci."
, volume =	12
, year =	1986
, pages =	"347--358"
}

@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"
}

@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"
}

@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 =	"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"
, volume =	"F40"
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1988
, pages =	"639--672"
}

@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"
}

@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
}

@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
, year =	1982
, pages =	"23--29"
, keywords =	"polygons, triangulation, convex hull"
}

@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-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"
}

@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-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{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"
}

@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"
}

@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"
}

@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"
}

@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."
, 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"
}

@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"
, 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-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 =	""
}

@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-crg-60
, author =	"W. T. Tutte"
, title =	"Convex Representations of Graphs"
, journal =	"Proceedings London Mathematical Society"
, volume =	10
, number =	3
, year =	1960
, pages =	"304--320"
, keywords =	"graph drawing"
, update =	"95.09 tamassia, 93.09 tamassia"
}

@article{t-hdg-63
, author =	"W. T. Tutte"
, title =	"How to Draw a Graph"
, journal =	"Proceedings London Mathematical Society"
, volume =	13
, number =	3
, year =	1963
, pages =	"743--768"
, keywords =	"graph drawing"
, update =	"95.09 tamassia, 93.09 tamassia"
}

@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"
}

% ### 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-cav-92
, author =	"J. D. Ullman"
, title =	"Computational Aspects of {VLSI}"
, publisher =	"Morgan-Kaufmann"
, address =	"San Mateo, CA"
, year =	1992
, update =	"96.09 orourke"
}

@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"
}

@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-97
, author =	"J. Urrutia"
, title =	"Art Gallery and Illumination Problems"
, editor =	"J.-R. Sack and J. Urrutia"
, booktitle =	"Handbook on Computational Geometry"
, publisher =	"North-Holland"
, year =	1997
, pages =	"??--??"
, note =	"To appear."
, keywords =	"visibility"
, update =	"96.09 orourke"
}

@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."
}

@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"
}

@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{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"
}

@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-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-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-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
, year =	1990
, pages =	"103--111"
, update =	"96.09 orourke"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"96.05 efrat"
}

@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"
}

@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{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"
, update =	"94.09 jones"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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"
}

@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."
, year =	1991
, pages =	"58--61"
}

@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"
}

@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"
}

@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"
, update =	"93.05 orourke"
, annote =	"Reconstruction of polyhedra from points in space"
}

@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"
}

@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 =	"??"
}

@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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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"
}

@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{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"
, update =	"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"
}

@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"
}

@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"
, update =	"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"
}

@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"
, editor =	"A. Choudhary"
, journal =	"J. Parallel Distrib. Comput."
, volume =	17
, year =	1993
, pages =	"107--114"
, update =	"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.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"
}

@inproceedings{vv-edsem-96
, author =	"J. S. Vitter and D. E. Vengroff"
, title =	"Efficient 3-D range searching in external memory"
, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
, year =	1996
, pages =	"to appear"
, update =	"96.05 agarwal"
}

@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{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"
}

@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"
}

@inproceedings{vbh-cdpmr-94
, author =	"A. Voigtmann and L. Becker and K. Hinrichs"
, title =	"The Constrained {Delaunay} Pyramid: a Model for Reconstructing Surfaces at Multiple Resolutions"
, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
, year =	1994
, pages =	"177--182"
, update =	"94.09 jones"
}

@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"
}

@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 =	"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"
}

@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 Tverberg'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 =	"93.09 matousek"
}

@article{v-ulds-80
, author =	"J. Vuillemin"
, title =	"A unifying look at data structures"
, journal =	"Commun. ACM"
, volume =	23
, year =	1980
, pages =	"229--239"
}

@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"
}

@incollection{w-tmpp-88
, author =	"H. Wagener"
, title =	"Triangulating a monotone polygon in parallel"
, booktitle =	"Computational Geometry and its Applications"
, series =	"Lecture Notes Comput. Sci."
, volume =	333
, publisher =	"Springer-Verlag"
, year =	1988
, pages =	"136--147"
}

@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"
}

@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 =	""
, update =	"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"
}

@inproceedings{ww-eeaam-95
, author =	"F. Wagner and A. Wolff"
, title =	"An Efficient and Effective Approximation on 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.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"
, update =	"95.09 mitchell"
}

@article{w-bzv-36
, author =	"K. Wagner"
, title =	"Bemerkungen zum Vierfarbenproblem"
, journal =	"Jahresbericht der Deutschen Mathematiker-Vereinigung"
, volume =	46
, year =	1936
, pages =	"26--32"
, keywords =	"graph drawing"
, update =	"93.09 tamassia"
, annote =	"Shows that any triangulation can be transformed into
		 any other by flips."
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"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"
}

@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"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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"
}

@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"
}

@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"
}

@inproceedings{wt-fcvsl-91
, author =	"C. A. Wang and Y. H. Tsin"
, title =	"Finding the closest and visible sites for a line in the presence of barriers"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"92--95"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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 =	"94.05 smid, 93.09 milone+mitchell"
}

@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"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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."
}

@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{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
}

@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."
}

@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"
}

@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-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{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"
}

@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
}

@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"
}

@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."
}

@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"
}

@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"
}

@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"
}

@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 =	"??"
}

@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"
}

@article{w-cvgnl-85
, author =	"E. 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"
}

@incollection{w-ggssn-93
, author =	"E. Welzl"
, title =	"Geometric Graphs with Small Stabbing Numbers: {Combinatorics} and Applications"
, booktitle =	"Proc. 9th Internat. Conf. Fund. Comput. Theory"
, series =	"Lecture Notes Comput. Sci."
, publisher =	"Springer-Verlag"
, address =	"Szeged, Hungary"
, year =	1993
, pages =	"??"
, update =	"93.09 milone+mitchell"
}

@article{w-mksfs-86
, author =	"E. 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"
}

@incollection{w-stlcn-92
, author =	"E. 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 =	"97.03 aronov, 96.05 agarwal, 94.05 matousek"
}

@inproceedings{w-pttco-88
, author =	"E. 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"
}

@incollection{w-sedbe-91a
, author =	"E. 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 =	"94.01 rote, 93.09 matousek"
}

@techreport{w-sedbe-91
, author =	"E. 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
}

@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 =	"E. 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 =	"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"
}

@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"
}

@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"
, update =	"94.09 jones"
}

@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."
, 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"
}

@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{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 =	1996
, pages =	"343--349"
, keywords =	"octree, ray tracing"
, update =	"96.05 agarwal"
}

@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"
}

@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"
}

@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"
}

@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"
, update =	"93.09 milone+mitchell"
}

@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"
}

@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"
}

@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-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"
}

@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"
}

@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
}

@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"
}

@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"
, update =	"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{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 M. 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"
}

@article{ws-prnds-88
, author =	"A. Wiernik and M. 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 =	"93.09 milone+mitchell"
}

@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"
}

@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"
, update =	"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"
}

@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 =	"??"
, institution =	"Dept. Comput. Sci., Univ. Iowa"
, address =	"Iowa City, IA"
, year =	1979
}

@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--296"
}

@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
}

@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"
}

@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"
}

@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"
}

@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"
}

@article{w-cmc-80
, author =	"M. H. Williams"
, title =	"Cubic map configurations"
, journal =	"Inform. Process. Lett."
, volume =	11
, year =	1980
, pages =	"189--185"
}

@inproceedings{w-acgvv-91
, author =	"P. L. Williams"
, title =	"Applications of computational geometry to volume visualization"
, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
, year =	1991
, pages =	"247--251"
}

@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."
}

@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
}

@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{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"
}

@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"
}

@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"
, update =	"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"
, update =	"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"
}

@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"
}

@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"
}

@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"
}

@inproceedings{ws-impst-93
, author =	"E. Wolfson and M. 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"
, update =	"93.09 jones"
}

@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"
, 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"
}

@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"
}

@article{wccts-shiom-93
, author =	"T. Woo and S. Chou and L. Chen and K. Tang and S. Shin"
, title =	"Scallop Hull and Its Offset for a Monotone Chain in Linear Time"
, journal =	"Comput. Aided Design"
, volume =	""
, year =	1993
, pages =	""
, comments =	"submitted!!!"
, update =	"93.09 held"
}

@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"
}

@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"
, update =	"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"
}

@article{wy-ocsp-88
, author =	"D. Wood and C. K. Yap"
, title =	"The orthogonal convex skull problem"
, journal =	"Discrete Comput. Geom."
, volume =	3
, year =	1988
, pages =	"349--365"
, succeeds =	"wy-ccsop-85"
}

@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"
}

@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"
}

@article{w-cqt-84
, author =	"J. R. Woodwark"
, title =	"Compressed quad trees"
, journal =	"Comput. J."
, volume =	27
, number =	3
, year =	1984
, pages =	"225--229"
}

@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"
}

@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."
, 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 =	"??"
}

@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{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"
}

@inproceedings{wm-sptrr-93
, author =	"E. Wynters and J. 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"
, update =	"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"
}

@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"
, editor =	"Janos Csirik and Horst Bunke"
, journal =	"Ann. Math. Artif. Intell."
, volume =	13
, year =	1995
, pages =	"377--400"
, keywords =	"matching, shape recognition, vision"
, update =	"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"
}

@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{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"
, update =	"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"
}

@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{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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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"
}

@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 =	"96.05 mitchell"
}

@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{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
, year =	1991
, pages =	"655--668"
, update =	"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
, year =	1982
, pages =	"721--736"
, succeeds =	"y-fafms-77"
, update =	"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 =	"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 =	"94.01 jones"
}

@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
, year =	1989
, pages =	"371--384"
, succeeds =	"y-3spia-83"
}

@inproceedings{y-llicg-93
, author =	"Chee Yap"
, title =	"Low Level Issues in Computational Geometry"
, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
, site =	"Waterloo, Canada"
, year =	1993
, pages =	"405--419"
, update =	"93.09 milone+mitchell"
}

@article{y-tegc-97
, author =	"C. Yap"
, title =	"Towards exact geometric computation"
, journal =	"Comput. Geom. Theory Appl."
, volume =	7
, year =	1997
, pages =	"3--23"
, succeeds =	"y-tegc-93"
, update =	"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"
}

@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
, year =	1990
, pages =	"2--18"
, succeeds =	"y-gctsp-88"
}

@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"
}

@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"
}

@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"
, publisher =	"IEEE Computer Society Press"
, year =	1995
, pages =	"82--84"
, update =	"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"
}

@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"
}

@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-90"
}

@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."
, year =	1993
, pages =	"405--419"
, precedes =	"y-tegc-97"
, update =	"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."
, series =	"Lecture Notes Comput. Sci."
, volume =	382
, publisher =	"Springer-Verlag"
, year =	1989
, pages =	"373--380"
, update =	"96.05 agarwal, 95.01 schwarzkopf"
}

@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 =	1
, edition =	"2nd"
, publisher =	"World Scientific Press"
, address =	"Singapore"
, year =	1995
, pages =	"452--492"
, url =	"http://cs.nyu.edu/cs/faculty/yap/papers/paradigm.ps"
, keywords =	"survey paper, numeral computing, exact compuation, fixed-precision, multiprecision number packages"
, update =	"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"
}

@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"
}

@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"
}

@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"
, update =	"94.09 jones"
}

@inbook{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 =	"Wiley"
, address =	"New York"
, year =	1995
, pages =	"352--367"
, keywords =	"minimum-weight triangulations, data interpolation"
, update =	"97.03 rote"
}

@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"
, update =	"93.09 held"
}

@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 =	"M. Yvinec"
, title =	"Triangulation in {2D} and {3D} Space"
, booktitle =	"Geometry and Robotics Workshop Proceedings, Toulouse France, 26--28 May 1988"
, series =	"Lecture Notes Comput. Sci."
, volume =	391
, publisher =	"Springer-Verlag"
, address =	"Berlin, West Germany"
, year =	1989
, pages =	"275--291"
, update =	"96.09 agarwal, 93.09 smid"
, annote =	"Survey paper"
}

@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-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"
}

% bibtex dislikes reality of number = "154"
@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 =	"1: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 =	"95.09 korneenko+mitchell"
}

@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"
}

@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{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"
}

@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"
}

@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"
}

@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"
}

@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"
, series =	"Lecture Notes Comput. Sci."
, volume =	"??"
, publisher =	"Springer-Verlag"
, address =	"Beijing"
, year =	1994
, pages =	"??"
, update =	"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"
}

@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"
, update =	"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."
, year =	1991
, pages =	"239--242"
}

@inproceedings{zssm-grxmp-94
, author =	"C. Zhu and G. Sundaram and J. Snoeyink and J. 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"
, update =	"97.03 devillers+smid, 94.09 jones"
}

@article{zssm-grpgv-96
, author =	"C. Zhu and G. Sundaram and J. Snoeyink and J. 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 =	"97.03 devillers+smid"
}

@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"
}

@book{z-lp-94
, author =	"G. M. Ziegler"
, title =	"Lectures on Polytopes"
, series =	"Graduate Texts in Mathematics"
, volume =	152
, publisher =	"Springer-Verlag"
, 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 =	"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"
}

@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
, update =	"93.09 milone+mitchell"
}

@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"
}

@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 =	"??"
, institution =	"Dept. Comput. Sci., Stanford Univ."
, address =	"Stanford, CA"
, year =	1978
}

@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"
}