%
% Computational geometry community bibliography project
% ftp://ftp.cs.usask.ca/pub/geometry/geombib.tar.gz
%
% July 2002 compilation
%
@article{-eera-57,
author = "??",
title = "ERA. {An} electronic reading automaton",
journal = "Electronic Engineering",
volume = "??",
month = apr,
year = 1957,
pages = "189--190"
}
@incollection{-akg-87,
title = "Algorithmen in der kombinatorischen {Geometrie}",
booktitle = "Tagungsber. Math. Forschungsinst. Oberwolfach",
number = 5,
year = 1987,
pages = "1--14a",
note = "seminar abstracts"
}
@manual{-arm-92,
title = "AutoCAD Reference Manual",
organization = "Autodesk, Inc.",
year = 1992
}
@incollection{-dg-87,
title = "Diskrete {Geometrie}",
booktitle = "Tagungsber. Math. Forschungsinst. Oberwolfach",
number = 25,
year = 1987,
pages = "1--18",
note = "seminar abstracts"
}
@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"
}
@techreport{-gchpc-92,
title = "Grand challenges: {High} performance computing and
communications",
type = "Report",
institution = "Committee in Physical, Mathematical, and Engineering
Sciences. Federal Council for Science, Engineering,
and Technology",
year = 1992,
note = "The FY 1992 U.S. Research and Development Program"
}
@manual{-isbfp-85,
title = "IEEE Standard for binary floating point arithmetic,
{ANSI}/{IEEE} Std $754-1985$",
publisher = "IEEE Computer Society",
address = "New York, NY",
year = 1985,
note = "Reprinted in SIGPLAN Notices, 22(2):9--25, 1987",
key = "IEEE754"
}
@manual{-i6um-96,
title = "IRIT $6.0$ User's Manual",
organization = "Technion",
year = 1996,
url = "http://www.cs.technion.ac.il/~irit"
}
@manual{-mrm-83,
title = "{MACSYMA} Reference Manual",
organization = "Lab. Comput. Sci., Massachusetts Inst. Tech.",
address = "Cambridge, MA",
year = 1983
}
@manual{-m4rm-85,
title = "Maple $4.0$ Reference Manual",
organization = "Symbolic Computation Group, Univ. Waterloo",
address = "Waterloo, Canada",
year = 1985
}
@manual{-mrg-92,
title = "{MATLAB} Reference Guide",
organization = "The MathWorks, Inc.",
address = "Natick, MA",
year = 1992
}
@manual{-nwp-91,
title = "NURBS White Paper",
organization = "Automotive Industry Action Group",
address = "Southfield, MI",
year = 1991
}
@manual{-pltc-85,
title = "POSTSCRIPT Language Tutorial and Cookbook",
organization = "Adobe Systems Incorporated",
year = 1985
}
@manual{-rurcp-88,
title = "Robface: {The} universal {Rob}-{Cad} programming
interface",
organization = "Technomatics, N. V.",
year = 1988
}
@manual{-rpmv4-82,
title = "Romulus Programmers Manual: Version 4",
organization = "Shape Data Ltd.",
address = "Cambridge, UK",
year = 1982
}
@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"
}
@article{-sill-84,
title = "Special issue on legged locomotion",
journal = "Internat. J. Robot. Res.",
volume = 3,
number = 2,
year = 1984
}
@article{-sill-90,
title = "Special issue on legged locomotion",
journal = "Internat. J. Robot. Res.",
volume = 9,
number = 2,
year = 1990
}
@misc{-sp-,
title = "STEP on a page",
url = "http://www.nist.gov/sc5/soap/"
}
@manual{-sis-89,
title = "Stereolithography interface specification",
organization = "3D Systems, Inc.",
address = "Valencia, CA",
year = 1989,
note = "p/n 50065-S01-00"
}
@manual{-t1-78,
title = "TIPS-1",
organization = "Inst. Precision Engg., Hokkaido Univ.",
address = "Sapporo, Japan",
year = 1978
}
@techreport{a-am3sa-91,
author = "C. Aarmstrong",
title = "Abstraction and meshing of 3d stress analysis
models",
type = "Progress Report",
institution = "SERC Directorate",
address = "UK",
year = 1991
}
@article{a-srcg-74,
author = "H. L. Abbott",
title = "Some results in combinatorial geometry",
journal = "Discrete Math.",
volume = 9,
year = 1974,
pages = "199--204"
}
@inproceedings{a-bigj-91,
author = "A. Abdullah",
title = "Bottleneck identification in general junctions",
booktitle = CCCG_1991,
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"
}
@article{am-castd-90,
author = "D. J. Abel and D. M. Mark",
title = "A comparative analysis of some two-dimensional
orderings",
journal = "Intl. J. Geographic Informations Systems",
volume = 4,
year = 1990,
pages = "21--31"
}
@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"
}
@inproceedings{a-dgpg-99,
author = "Manuel Abellanas",
title = "{Delaunay} Graphs on a Prescribed Graph",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "101--103"
}
@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 = CCCG_1992,
year = 1992,
pages = "127--131"
}
@article{aghhsu-up-93,
author = "M. Abellanas and J. Garc{\'\i}a and G. Hern{\'a}ndez
and F. Hurtado and O. Serra and J. Urrutia",
title = "Updating Polygonizations",
journal = "Comput. Graph. Forum",
volume = 12,
number = 3,
year = 1993,
pages = "143--152"
}
@inproceedings{agh-cg-94,
author = "M. Abellanas and J. Garc{\'\i}a-L{\'o}pez and
F. Hurtado",
title = "Consecutive Guards",
booktitle = CCCG_1994,
year = 1994,
pages = "393--398"
}
@inproceedings{agrh-tsgs-94,
author = "Manuel Abellanas and Francisco G{\'o}mez and Ferran
Hurtado and Pedro Ramos",
title = "On the Tolerance of Some Geometric Structures",
booktitle = "Abstracts 10th European Workshop Comput. Geom.",
nickname = "CG '94",
site = "Santander",
publisher = "Universidad de Cantabria, Santander",
year = 1994,
pages = "64--67"
}
@techreport{aghr-stdt-,
author = "M. Abellanas and F. G{\'o}mez and F. Hurtado and
P. Ramos",
title = "Structural Tolerance and {Delaunay} Triangulation",
type = "Technical Report",
number = "MA2-IR-93-11",
institution = "Dept. Mat. Aplicada II, Univesitat Polit{\`e}cnica
de Catalunya"
}
@techreport{ahknu-cpcs-95,
author = "Manuel Abellanas and G. Hernandes and Rolf Klein and
V. Neumann-Lara and Jorge Urrutia",
title = "A Combinatorial Property of Convex Sets",
number = 176,
institution = "Department of Computer Science, FernUniversit{\"a}t
Hagen",
address = "Germany",
year = 1995,
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr176.pdf"
}
@article{ahknu-cpcs-97,
author = "Manuel Abellanas and G. Hernandes and Rolf Klein and
V. Neumann-Lara and Jorge Urrutia",
title = "A Combinatorial Property of Convex Sets",
journal = DCG,
volume = 17,
number = 3,
year = 1997,
pages = "307--318",
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr176.pdf"
}
@techreport{ahknu-vdcfc-95t,
author = "Manuel Abellanas and G. Hernandes and Rolf Klein and
V. Neumann-Lara and Jorge Urrutia",
title = "Voronoi-Diagrams and Containment of Families of
Convex Sets on the Plane",
number = 173,
institution = "Department of Computer Science, FernUniversit{\"a}t
Hagen",
address = "Germany",
year = 1995
}
@inproceedings{ahknu-vdcfc-95,
author = "Manuel Abellanas and G. Hernandez and Rolf Klein and
V. Neumann-Lara and Jorge Urrutia",
title = "Voronoi Diagrams and Containment of Families of
Convex Sets on the Plane",
booktitle = SOCG_1995,
year = 1995,
pages = "71--78",
keywords = "convex distance functions"
}
@techreport{ahiklmps-scso-01t,
author = "Manuel Abellanas and Ferran Hurtado and Christian
Icking and Rolf Klein and Elmar Langetepe and Lihong
Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n",
title = "Smallest Color-Spanning Objects",
number = 283,
institution = "Department of Computer Science, FernUniversit{\"a}t
Hagen",
address = "Germany",
year = 2001,
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf"
}
@inproceedings{ahiklmps-scso-01,
author = "Manuel Abellanas and Ferran Hurtado and Christian
Icking and Rolf Klein and Elmar Langetepe and Lihong
Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n",
title = "Smallest Color-Spanning Objects",
booktitle = ESA_2001,
nickname = "ESA 2001",
series = LNCS,
volume = 2161,
publisher = "Springer-Verlag",
year = 2001,
pages = "278--289",
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf"
}
@inproceedings{ahiklmps-fcvdr-01,
author = "Manuel Abellanas and Ferran Hurtado and Christian
Icking and Rolf Klein and Elmar Langetepe and Lihong
Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n",
title = "The Farthest Color {Voronoi} Diagram and Related
Problems",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "113--116",
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/ahiklmps-fcvdr-01.pdf"
}
@inproceedings{ahr-tgs-94,
author = "M. Abellanas and F. Hurtado and P. Ramos",
title = "Tolerance of Geometric Structures",
booktitle = CCCG_1994,
year = 1994,
pages = "250--255"
}
@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 = LNCS,
volume = 894,
publisher = "Springer-Verlag",
year = 1995,
pages = "246--253",
keywords = "graph drawing, Delaunay triangulation"
}
@inproceedings{ar-vdisg-95,
author = "Manuel Abellanas and Eugenio Roanes-Lozano",
title = "{Voronoi} Diagrams for Infinite Sets Generated by
Consecutive Stretches",
booktitle = "Abstracts 11th European Workshop Comput. Geom.",
nickname = "CG '95",
site = "Linz",
publisher = "Universit{\"a}t Linz",
year = 1995,
pages = "13--16"
}
@techreport{ae-vgspu-91,
author = "J. Abello and {\"O}. E{\~g}ecio{\~g}lu",
title = "Visibility graphs of staircase polygons with uniform
step length",
type = "Manuscript",
institution = "??",
year = 1991
}
@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 = IJCGA,
volume = 3,
year = 1993,
pages = "27--37",
keywords = "visibility graph, staircase polygon, orthogonal
convex fan, uniform step length"
}
@techreport{aek-rvgsp-91,
author = "J. Abello and {\"O}. E{\~g}ecio{\~g}lu and K. Kumar",
title = "Recognizing visibility graphs of staircase polygons",
type = "Manuscript",
institution = "??",
year = 1991
}
@article{aesu-iopof-98,
author = "James Abello and Vladimir Estivill-Castro and Thomas
Shermer and Jorge Urrutia",
title = "Illumination of Orthogonal Polygons with Orthogonal
Floodlights",
journal = IJCGA,
volume = 8,
year = 1998,
pages = "25--38"
}
@inproceedings{aesu-iof-95,
author = "James Abello and Vladimir Estivill-Castro and Thomas
Shermer and Jorge Urrutia",
title = "Illumination with Orthogonal Floodlights",
booktitle = ISAAC_1995,
nickname = "ISAAC '95",
series = LNCS,
volume = 1004,
publisher = "Springer-Verlag",
year = 1995,
pages = "362--371"
}
@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 = LNCS,
volume = 894,
publisher = "Springer-Verlag",
year = 1995,
pages = "147--158",
keywords = "graph drawing, visibility"
}
@article{alp-vgsp-92,
author = "J. Abello and H. Lin and S. Pisupati",
title = "On visibility graphs of simple polygons",
journal = "Congr. Numer.",
volume = 90,
year = 1992,
pages = "119--128"
}
@book{ad-tg-80,
author = "H. Abelson and A. A. diSessa",
title = "Turtle Geometry",
publisher = "MIT Press",
address = "Cambridge",
year = 1980
}
@book{a-ca-80,
author = "O. Aberth",
title = "Computable analysis",
publisher = "McGraw-Hill",
address = "New York",
year = 1980
}
@article{a-gph-88,
author = "S. Abhyankar",
title = "Good Points of a Hypersurface",
journal = "Adv. Math.",
volume = 68,
number = 2,
year = 1988,
pages = "87--256"
}
@article{a-hragr-76,
author = "S. Abhyankar",
title = "Historical Ramblings in Algebraic Geometry and
Related Algebra",
journal = "Amer. Math. Monthly",
volume = 83,
number = 6,
year = 1976,
pages = "409--448"
}
@article{ab-arpcs2-87,
author = "S. Abhyankar and C. Bajaj",
title = "Automatic Rational Parameterization of Curves and
Surfaces {II}: Cubics and Cubicoids",
journal = "Comput. Aided Design",
volume = 19,
number = 2,
year = 1987,
pages = "499--502"
}
@inproceedings{ab-cac-89,
author = "S. Abhyankar and C. Bajaj",
title = "Computations with Algebraic Curves",
booktitle = "Proc. Internat. Sympos. on Symbolic and Algebraic
Computation",
series = LNCS,
volume = 358,
publisher = "Springer-Verlag",
year = 1989,
pages = "279--284"
}
@techreport{ab-arpcs3-86,
author = "S. Abhyankar and C. Bajal",
title = "Automatic Rational Parameterization of Curves and
Surfaces {III}: {Algebraic} Plane Curves",
type = "Technical {Report}",
number = "CSD-TR-619",
institution = "Dept. Comput. Sci., Purdue Univ.",
address = "West Lafayette, IN",
year = 1986
}
@article{a-asc-70,
author = "S. S. Abhyankar",
title = "Algebraic space curves",
journal = "Montreal Lecture Notes",
volume = "??",
year = 1970
}
@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 = CCCG_1989,
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 = SOCG_1989,
year = 1989,
pages = "88--93"
}
@techreport{acc-iiac-88,
author = "S. S. Abhyankar and S. Chandrasekar and V. Chandru",
title = "Improper intersection of algebraic curves",
number = "CC-88-24",
institution = "Purdue University",
month = sep,
year = 1988
}
@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
}
@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"
}
@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"
}
@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"
}
@incollection{abbkw-pdb-87,
author = "E. E. Abola and F. C. Bernstein and S. H. Bryant and
T. F. Koetzle and J. Weng",
title = "Protein data bank",
editor = "F. H. Allen and G. Bergerhoff and R. Seivers",
booktitle = "Crystallographic Databases: Information Content,
Software Systems, Scientific Applications",
publisher = "Data Comission of the International Union of
Crystallography",
address = "Bonn/Cambridge/Chester",
year = 1987
}
@article{a-mcp-90,
author = "Karl Abrahamson",
title = "On the Modality of Convex Polygons",
journal = DCG,
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 = JALG,
volume = 10,
year = 1989,
pages = "287--302"
}
@inproceedings{a-cano-88,
author = "S. Abramowski",
title = "Collision avoidance for nonrigid objects",
booktitle = "Computational Geometry and its Applications",
nickname = "CG '88",
site = "W{\"u}rzburg",
series = LNCS,
volume = 333,
publisher = "Springer-Verlag",
year = 1988,
pages = "168--179",
keywords = "motion planning",
annote = "4th Intern. Workshop Comput. Geom."
}
@incollection{alm-mrkgp-89,
author = "S. Abramowski and B. Lang and H. M{\"u}ller",
title = "Moving regular $k$-gons in contact",
booktitle = "Proc. 14th Internat. Workshop
Graph-Theoret. Concepts Comput. Sci.",
nickname = "WG '88",
series = LNCS,
volume = 344,
publisher = "Springer-Verlag",
year = 1989,
pages = "229--242",
keywords = "motion planning, contact, regular polygon"
}
@techreport{am-1dq3d-85,
author = "S. Abramowski and H. M{\"u}ller",
title = "$1$-d queries in $3$-d space",
type = "Report",
number = "09/85",
institution = "Fakult{\"a}t Inform., Univ. Karlsruhe",
address = "Karlsruhe, West Germany",
year = 1985
}
@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"
}
@book{am-gm-91,
author = "S. Abramowski and H. M{\"u}ller",
title = "{Geometrisches} {Modellieren}",
publisher = "BI-Wissenschaftsverlag",
address = "Mannheim",
year = 1991
}
@incollection{am-sccvl-87,
author = "S. Abramowski and H. M{\"u}ller",
title = "Searching connected components in very large grid
graphs",
booktitle = "Proc. 12th Internat. Workshop
Graph-Theoret. Concepts Comput. Sci.",
nickname = "WG '86",
series = LNCS,
volume = 246,
year = 1987,
pages = "118--130",
keywords = "grid graph, motion planning, connected component"
}
@article{ag-ftfcf-02,
author = "Aaron Abrams and Robert Shrist",
title = "Finding Topology in a Factory: {Configuration}
Spaces",
journal = "Amer. Math. Monthly",
volume = 109,
number = 2,
year = 2002,
pages = "140--150",
comments = "Several robots"
}
@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"
}
@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"
}
@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"
}
@article{vk-mnecd-82a,
author = "D. M. Acketa and J. {\v Z}uni{\'c}",
title = "On the maximal number of edges of convex digital
polygons included into a square grid",
journal = "Pocitace a umela inteligencia",
volume = 1,
number = 6,
month = dec,
year = 1982,
pages = "549--558"
}
@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 = CCCG_1991,
month = aug,
year = 1991,
pages = "215--218"
}
@inproceedings{akss-icsac-97,
author = "Bruno Adam and Pierre Kauffmann and Dominique
Schmitt and Jean-Claude Spehner",
title = "An Increasing--Circle Sweep--Algorithm to Construct
the {D}elaunay Diagram in the Plane",
booktitle = CCCG_1997,
year = 1997,
pages = "268--273"
}
%, 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",
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"
}
@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"
}
@article{as-mith3-91,
author = "C. Adams and W. Sherman",
title = "Minimum ideal triangulations of hyperbolic
$3$-manifolds",
journal = DCG,
volume = 6,
year = 1991,
pages = "135--153"
}
@book{a-kb-94,
author = "C. C. Adams",
title = "The Knot Book",
publisher = "W. H. Freeman",
address = "New York",
year = 1994
}
@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"
}
@inproceedings{agj-lcsr-00,
author = "Udo Adamy and Joachim Giesen and Matthias John",
title = "The {$\lambda$}-Complex and Surface Reconstruction",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "14--17"
}
@inproceedings{as-ewcqc-98,
author = "Udo Adamy and R. Seidel",
title = "On the Exact Worst Case Query Complexity of Planar
Point Location",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "609--618"
}
@article{aos-mlcps-94,
author = "John Adegeest and M. H. Overmars and J. Snoeyink",
title = "Minimum-link $C$-oriented paths: {Single}-source
queries",
journal = IJCGA,
volume = 4,
number = 1,
year = 1994,
pages = "39--51",
keywords = "shortest path, link distance, rectilinear link
distance",
annote = "They consider a set of obstacles given by $n$ line
segments having disjoint interiors, and being at $c$
different fixed orientations. For a fixed source
point, they build a data structure (SPM) of size
$O(cn)$ that supports min-link queries from the
source to any query point in time $O(c\log n)$ (with
additional time $O(k)$ to report a path, if it has
$k$ links). Here, link distance is $C$-oriented link
distance. The preprocessing is done with $O(c^2
n\log n)$ time and space, OR with $O(c^2 n \log^2
n)$ time and $O(c^2 n)$ space."
}
@phdthesis{a-ap-71,
author = "I. Adler",
title = "Abstract Polytopes",
school = "Dept. Operations Research, Stanford University",
year = 1971,
keywords = "doctoral thesis"
}
@inproceedings{ab-palpa-92,
author = "I. Adler and P. A. Beling",
title = "Polynomial algorithms for linear programming over
the algebraic numbers",
booktitle = STOC_1992,
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"
}
@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"
}
@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 = STOC_1984,
year = 1984,
pages = "312--323"
}
@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 = JACM,
volume = 32,
year = 1985,
pages = "871--895",
keywords = "average-case analysis, linear programming"
}
@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"
}
@techreport{as-rssua-90,
author = "I. Adler and R. Shamir",
title = "A randomization scheme for speeding up algorithms
for linear and convex quadratic programming problems
with a high constraints-to-variables ratio",
type = "Technical {Report}",
number = "21-90",
institution = "Rutgers Univ.",
address = "New Brunswick, NJ",
month = may,
year = 1990
}
@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"
}
@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"
}
@article{as-rprs-92,
author = "F. Affentranger and R. Schneider",
title = "Random projections of regular simplices",
journal = DCG,
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 = DCG,
volume = 6,
year = 1991,
pages = "291--305"
}
@inproceedings{asw-emstb-90,
author = "P. K. Agarwal and O. Schwarzkopf and E. Welzl",
title = "Euclidean Minimum Spanning Trees and Bichromatic
Closest Pairs",
booktitle = "Abstracts 6th Intern. Workshop Comput. Geom.",
nickname = "CG '90",
site = "Siegen",
publisher = "Universit{\"a}t Siegen",
year = 1990,
pages = 3
}
@inproceedings{a-dapal-89,
author = "P. K. Agarwal",
title = "A deterministic algorithm for partitioning
arrangements of lines and its applications",
booktitle = SOCG_1989,
year = 1989,
pages = "11--22"
}
@inproceedings{a-anspt-91,
author = "P. K. Agarwal",
title = "Applications of a new space partition technique",
booktitle = WADS_1991,
nickname = "WADS '91",
series = LNCS,
volume = 519,
year = 1991,
pages = "379--392",
keywords = "$d$-dimensional, ray tracing, hidden line/surface
elimination, minimal spanning tree, space partition"
}
@mastersthesis{a-ga-85,
author = "P. 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"
}
@techreport{a-gpia-91t,
author = "P. 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"
}
@incollection{a-gpia-91i,
author = "P. 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"
}
@phdthesis{a-idaac-89,
author = "P. K. Agarwal",
title = "Intersection and decomposition algorithms for
arrangements of curves in the plane",
school = "Dept. Comput. Sci., New York Univ.",
month = aug,
year = 1989,
keywords = "doctoral thesis"
}
@book{a-idapa-91,
author = "P. 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"
}
@techreport{a-slp3d-93,
author = "P. 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
}
@article{a-slp3d-94,
author = "P. K. Agarwal",
title = "On stabbing lines for polyhedra in $3$d",
journal = CGTA,
volume = 4,
year = 1994,
pages = "177--189"
}
@article{a-pal1e-90,
author = "P. K. Agarwal",
title = "Partitioning arrangements of lines: {I}. {An}
efficient deterministic algorithm",
journal = DCG,
volume = 5,
year = 1990,
pages = "449--483",
keywords = "deterministic partitioning, random sampling,
arrangements of lines"
}
@article{a-pal2a-90,
author = "P. K. Agarwal",
title = "Partitioning arrangements of lines:
{II}. {Applications}",
journal = DCG,
volume = 5,
year = 1990,
pages = "533--573",
keywords = "random sampling, arrangements, divide-and-conquer"
}
@techreport{a-rs-96,
author = "P. K. Agarwal",
title = "Range searching",
type = "Report",
number = "CS-1996-05",
institution = "Dept. Comput. Sci., Duke Univ.",
address = "Durham, NC",
year = 1996
}
@incollection{a-rs-97,
author = "P. K. Agarwal",
title = "Range searching",
chapter = 31,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "575--598"
}
@inproceedings{a-rsoas-89,
author = "P. K. Agarwal",
title = "Ray shooting and other applications of spanning
trees with low stabbing number",
booktitle = SOCG_1989,
year = 1989,
pages = "315--325"
}
@article{a-rsoas-92,
author = "P. K. Agarwal",
title = "Ray shooting and other applications of spanning
trees with low stabbing number",
journal = SICOMP,
volume = 21,
year = 1992,
pages = "540--570",
keywords = "ray shooting, visibility, spanning trees, partition
trees"
}
% yes, "farthest"
@inproceedings{aaakss-cefns-89,
author = "P. 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 = CCCG_1989,
year = 1989,
pages = 45,
keywords = "furthest neighbors, geodesic distance, simple
polygon, diameter"
}
% yes, "farthest"
@article{aaakss-cefns-91,
author = "P. 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"
}
@inproceedings{aaas-cvgbr-93,
author = "P. K. Agarwal and N. Alon and B. Aronov and S. Suri",
title = "Can visibility graphs be represented compactly?",
booktitle = SOCG_1993,
year = 1993,
pages = "338--347"
}
@article{aaas-cvgbr-94,
author = "P. K. Agarwal and N. Alon and B. Aronov and S. Suri",
title = "Can visibility graphs be represented compactly?",
journal = DCG,
volume = 12,
year = 1994,
pages = "347--365"
}
@inproceedings{aaas-lpmpc-97,
author = "P. K. Agarwal and N. Amenta and B. Aronov and
M. Sharir",
title = "Largest placements and motion planning of a convex
polygon",
editor = "Jean-Paul Laumond and M. H. Overmars",
booktitle = "Algorithms for Robotic Motion and Manipulation",
nickname = "WAFR '96",
publisher = "A. K. Peters",
address = "Wellesley, MA",
year = 1997,
pages = "143--154",
annote = "Proc. 1996 Workshop on the Algorithmic Foundations
of Robotics"
}
@article{aas-lpocp-98,
author = "P. K. Agarwal and N. Amenta and M. Sharir",
title = "Largest Placement of One Convex Polygon Inside
Another",
journal = DCG
}
@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"
}
@article{aas-pocpi-98,
author = "P. K. Agarwal and N. Amenta and M. Sharir",
title = "Placement of one convex polygon inside another",
journal = DCG,
volume = 19,
year = 1998,
pages = "95--104"
}
@inproceedings{aabv-iedpl-99,
author = "P. K. Agarwal and L. Arge and G. Brodal and
J. S. Vitter",
title = "I/O-efficient dynamic point location in monotone
subdivisions",
booktitle = SODA_1999,
year = 1999,
pages = "11--20"
}
@inproceedings{aae-imp-00,
author = "P. K. Agarwal and L. Arge and J. Erickson",
title = "Indexing moving points",
booktitle = "Proc. Annu. ACM Sympos. Principles Database Syst.",
year = 2000,
note = "175--186"
}
@inproceedings{aaefv-eslc-98,
author = "P. K. Agarwal and L. Arge and J. Erickson and
P. G. Franciosa and J. S. Vitter",
title = "Efficient Searching with Linear Constraints",
booktitle = "Proc. Annu. ACM Sympos. Principles Database Syst.",
year = 1998,
note = "to appear"
}
@inproceedings{aamvv-ieacl-98,
author = "P. K. Agarwal and L. Arge and T. M. Murali and
Kasturi R. Varadarajan and J. S. Vitter",
title = "{I/O}-Efficient Algorithms for Contour-Line
Extraction and Planar Graph Blocking",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "117--126"
}
@techreport{aa-cfi-89,
author = "P. 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"
}
@article{aa-cfi-92,
author = "P. K. Agarwal and B. Aronov",
title = "Counting facets and incidences",
journal = DCG,
volume = 7,
year = 1992,
pages = "359--369",
keywords = "combinatorial geometry, combinatorial complexity,
hyperplane arrangements, triangle arrangements"
}
@article{aacs-lalsp-98,
author = "P. K. Agarwal and B. Aronov and T. M. Chan and
M. Sharir",
title = "On Levels in Arrangements of Lines, Segments,
Planes, and Triangles",
journal = DCG,
volume = 19,
year = 1998,
pages = "315--331"
}
@inproceedings{aahs-aeamw-99,
author = "P. K. Agarwal and B. Aronov and S. Har-Peled and
M. Sharir",
title = "Approximation and Exact Algorithms for Minimum-Width
Annuli and Shells",
booktitle = SOCG_1999,
year = 1999,
pages = "380--389"
}
@inproceedings{aaos-supa-90,
author = "P. K. Agarwal and B. Aronov and J. O'Rourke and
C. Schevon",
title = "Star unfolding of a polytope with applications",
booktitle = SWAT_1990,
series = LNCS,
volume = 447,
publisher = "Springer-Verlag",
year = 1990,
pages = "251--263",
keywords = "motion planning, shortest paths, polytopes,
diameter, edge sequences, unfolding of polytopes"
}
@techreport{aaos-supa-93,
author = "P. 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"
}
% number = 6
% month = dec
@article{aaos-supa-97,
author = "P. K. Agarwal and B. Aronov and J. O'Rourke and
Catherine A. Schevon",
title = "Star Unfolding of a Polytope with Applications",
journal = SICOMP,
volume = 26,
year = 1997,
pages = "1689--1713",
keywords = "motion planning, shortest paths, polytopes,
diameter, edge sequences, unfolding of polytopes"
}
@techreport{aapps-qpghl-95,
author = "P. K. Agarwal and B. Aronov and Janos Pach and
Richard Pollack and M. 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
}
@inproceedings{aapps-qpghl-96,
author = "P. K. Agarwal and B. Aronov and Janos Pach and
Richard Pollack and M. Sharir",
title = "Quasi-planar graphs have a linear number of edges",
booktitle = "Graph Drawing (Proc. GD '95)",
series = LNCS,
volume = 1027,
publisher = "Springer-Verlag",
year = 1996,
pages = "1--7"
}
@article{aapps-qpghl-97,
author = "P. K. Agarwal and B. Aronov and Janos Pach and
Richard Pollack and M. Sharir",
title = "Quasi-planar graphs have a linear number of edges",
journal = "Combinatorica",
volume = 17,
year = 1997,
pages = "1--9"
}
@inproceedings{aas-cefda-94,
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Computing Envelopes in Four Dimensions with
Applications",
booktitle = SOCG_1994,
year = 1994,
pages = "348--358"
}
% number = 6
% month = dec
@article{aas-cefda-97,
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Computing Envelopes in Four Dimensions with
Applications",
journal = SICOMP,
volume = 26,
year = 1997,
pages = "1714--1732"
}
@inproceedings{aas-eaamw-00,
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Exact and approximation algorithms for minimum-width
cylindrical shells",
booktitle = SODA_2000,
nickname = "SODA",
year = 2000,
pages = "510--517"
}
@article{aas-eaamw-01,
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Exact and approximation algorithms for minimum-width
cylindrical shells",
journal = DCG,
volume = 26,
year = 2001,
pages = "307--320"
}
@inproceedings{aas-ltbse-97,
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Line Traversals of Balls and Smallest Enclosing
Cylinders in Three Dimensions",
booktitle = SODA_1997,
year = 1997,
pages = "483--492"
}
@article{aas-ltbse-99,
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Line Traversals of Balls and Smallest Enclosing
Cylinders in Three Dimensions",
journal = DCG,
volume = 21,
year = 1999,
pages = "373--388"
}
@techreport{aas-mpcpp-97,
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Motion planning for a convex polygon in a polygonal
environment",
type = "Tech. Report",
number = "CS-1997-17",
institution = "Department of Computer Science",
address = "Duke University",
year = 1997,
annote = "Corrects and supercedes parts of
\cite{aaas-lpmpc-97}"
}
@article{aas-mpcpp-99,
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Motion planning for a convex polygon in a polygonal
environment",
journal = DCG,
volume = 22,
year = 1999,
pages = "201--221"
}
@inproceedings{aass-sdp-90,
author = "P. K. Agarwal and B. Aronov and M. Sharir and
S. Suri",
title = "Selecting distances in the plane",
booktitle = SOCG_1990,
year = 1990,
pages = "321--331",
keywords = "selection problems, parametric search"
}
@article{aass-sdp-93,
author = "P. 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"
}
@inproceedings{aas-stl3d-95,
author = "P. K. Agarwal and B. Aronov and S. Suri",
title = "Stabbing Triangulations by Lines in $3$D",
booktitle = SOCG_1995,
publisher = "ACM Press",
address = "New York, NY, USA",
month = jun,
year = 1995,
pages = "267--276",
issn = "0-89791-724-3",
keywords = "ray shooting, contrained triangulation, tetrahedra"
}
@inproceedings{abghz-dfstk-00,
author = "P. K. Agarwal and J. Basch and L. J. Guibas and
J. Hershberger and L. Zhang",
title = "Deformable free space tiling for kinetic collision
detection",
booktitle = WAFR_1997,
year = 2000,
note = "To appear"
}
@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 = SODA_1996,
year = 1996,
pages = "122--131",
keywords = "depth order, translational motion, rotational
motion, assembly planning, stack products, upper
envelope searching, maximality"
}
@inproceedings{abms-claho-94,
author = "P. K. Agarwal and M. de Berg and J. Matou{\v s}ek
and O. Schwarzkopf",
title = "Constructing Levels in Arrangements and Higher Order
{Voronoi} Diagrams",
booktitle = SOCG_1994,
year = 1994,
pages = "67--75"
}
@article{abms-claho-98,
author = "P. K. Agarwal and M. de Berg and J. Matou{\v s}ek
and O. Schwarzkopf",
title = "Constructing Levels in Arrangements and Higher Order
{Voronoi} Diagrams",
journal = SICOMP,
volume = 27,
year = 1998,
pages = "654--667"
}
@inproceedings{abs-osaup-99,
author = "P. K. Agarwal and Binay K. Bhattacharya and Sandeep
Sen",
title = "Output-Sensitive Algorithms for Uniform Partitions
of Points",
booktitle = "Proc. 10th Intl. Sympos. Algorithms and Computation",
year = 1999,
pages = "??"
}
@inproceedings{ablrsw-ccspc-98,
author = "P. K. Agarwal and T. Biedl and S. Lazard and
S. Robbins and S. Suri and S. Whitesides",
title = "Curvature-Constrained Shortest Paths in a Convex
Polygon",
booktitle = SOCG_1998,
year = 1998,
pages = "to appear"
}
@inproceedings{ad-aats-97,
author = "P. K. Agarwal and P. K. Desikan",
title = "An efficient algorithm for terrain simplification",
booktitle = SODA_1997,
year = 1997,
pages = "139--147"
}
@inproceedings{ad-aalm-00,
author = "P. K. Agarwal and P. K. Desikan",
title = "Approximation algorithms for layered manufacturing",
booktitle = SODA_2000,
year = 2000,
pages = "528--537"
}
@inproceedings{aesw-emstb-90,
author = "P. K. Agarwal and H. Edelsbrunner and O. Schwarzkopf
and E. Welzl",
title = "Euclidean minimum spanning trees and bichromatic
closest pairs",
booktitle = SOCG_1990,
year = 1990,
pages = "203--210"
}
@article{aesw-emstb-91,
author = "P. K. Agarwal and H. Edelsbrunner and O. Schwarzkopf
and E. Welzl",
title = "Euclidean minimum spanning trees and bichromatic
closest pairs",
journal = DCG,
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"
}
@inproceedings{aes-vdsl3-95,
author = "P. K. Agarwal and A. Efrat and M. Sharir",
title = "Vertical Decomposition of Shallow Levels in
$3$-Dimensional Arrangements and Its Applications",
booktitle = SOCG_1995,
year = 1995,
pages = "39--50",
keywords = "curved surfaces, range searching, nearest neighbor,
segment center, bipartite matching, smallest
stabbing disk, parametric search, convex distance
functions"
}
@article{aes-vdsl3-99,
author = "P. K. Agarwal and A. Efrat and M. Sharir",
title = "Vertical decomposition of shallow levels in
$3$-dimensional arrangements and its applications",
journal = SICOMP,
volume = 29,
year = 1999,
pages = "912--953"
}
@techreport{aest-cscpp-91,
author = "P. K. Agarwal and A. Efrat and M. Sharir and
S. Toledo",
title = "Computing a segment center for a planar point set",
type = "Manuscript",
number = "DUKE--TR--1991--33",
institution = "Department of Computer Science, Duke University",
year = 1991,
url = "ftp://ftp.cs.duke.edu/dist/techreport/1991/1991-33.ps.Z",
abstract = "\indent Given a set $S$ of $n$ points in the plane
and a segment $e$, a {\em center placement} of $e$
is a placement (allowing translation and rotation)
that minimizes the maximum distance from $e$ to the
points of $S$. We present an algorithm for computing
a center placement for $S$, whose running time is
$O(n^{2} \alpha (n) \, \mbox {log} ^{3}n),$ where
$\alpha (n)$ is the inverse Ackermann function. The
algorithm makes use of the parametric searching
technique of Megiddo."
}
@article{aest-cscpp-93,
author = "P. K. Agarwal and A. Efrat and M. Sharir and
S. Toledo",
title = "Computing a Segment Center for a Planar Point Set",
journal = JALG,
volume = 15,
number = 2,
year = 1993,
pages = "314--323",
keywords = "points, center, placement"
}
@inproceedings{aegm-pkmst-98,
author = "P. K. Agarwal and D. Eppstein and L. J. Guibas and
M. Henzinger",
title = "Parametric and kinetic minimum spanning trees",
booktitle = FOCS_1998,
year = 1998,
pages = "596--605"
}
@inproceedings{aem-dhsrg-92,
author = "P. K. Agarwal and D. Eppstein and J. Matou{\v s}ek",
title = "Dynamic half-space reporting, geometric
optimization, and minimum spanning trees",
booktitle = FOCS_1992,
year = 1992,
pages = "80--89"
}
@techreport{ae-rsir-97,
author = "P. K. Agarwal and J. Erickson",
title = "Geometric range searching and its relatives",
type = "Tech.\ Report",
number = "CS-1997-11",
institution = "Department of Computer Science",
address = "Duke University",
year = 1997
}
@incollection{ae-rsir-99,
author = "P. K. Agarwal and J. Erickson",
title = "Geometric range searching and its relatives",
editor = "B. Chazelle and J. E. Goodman and R. Pollack",
booktitle = "Advances in Discrete and Computational Geometry",
series = "Contemporary Mathematics",
volume = 223,
publisher = "American Mathematical Society",
address = "Providence, RI",
year = 1999,
pages = "1--56"
}
@unpublished{aeg-kbspr-97,
author = "P. K. Agarwal and J. Erickson and L. J. Guibas",
title = "Kinetic binary space partitions in {$R^{3}$}",
year = 1997,
note = "In preparation"
}
@inproceedings{aeg-kbisd-98,
author = "P. K. Agarwal and J. Erickson and L. J. Guibas",
title = "Kinetic {BSP}s for Intersecting Segments and
Disjoint Triangles",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "107--116"
}
@techreport{agkptv-argc-95,
author = "P. K. Agarwal and M. T. Goodrich and S. R. Kosaraju
and F. P. Preparata and R. Tamassia and
J. S. Vitter",
title = "Applicable and Robust Geometric Computing",
type = "Project Proposal (U. S. Army Research Office grant
DAAH04-96-1-0013)",
institution = "Center for Geometric Computing",
year = 1995,
note = "\path|http://www.cs.brown.edu/cgc/|",
url = "http://www.cs.brown.edu/cgc/"
}
@inproceedings{agmv-bspfr-96,
author = "P. K. Agarwal and E. F. Grove and T. M. Murali and
J. S. Vitter",
title = "Binary Space Partitions for Fat Rectangles",
booktitle = FOCS_1996,
site = "Burlington, VT",
month = oct,
year = 1996,
pages = "482--491"
}
@article{agmv-bspfr-00,
author = "P. K. Agarwal and E. F. Grove and T. M. Murali and
J. S. Vitter",
title = "Binary Space Partitions for Fat Rectangles",
journal = SICOMP,
volume = 29,
year = 2000,
pages = "1422--1448"
}
@techreport{agps-rss-92,
author = "P. K. Agarwal and L. J. Guibas and M. Pellegrini and
M. Sharir",
title = "Ray shooting among spheres",
type = "Manuscript",
institution = "??",
year = 1992
}
@inproceedings{aghrs-cpdtc-00,
author = "P. K. Agarwal and L. J. Guibas and S. Har-Peled and
A. Rabinovitch and M. Sharir",
title = "Computing the Penetration Depth of Two Convex
Polytopes in 3D",
booktitle = SWAT_2000,
year = 2000,
pages = "??"
}
@inproceedings{aghv-memps-97,
author = "P. K. Agarwal and L. J. Guibas and J. Hershberger
and E. Veach",
title = "Maintaining the extent of a moving point set",
booktitle = WADS_1997,
nickname = "WADS '97",
site = "Halifax, Canada",
series = LNCS,
volume = 1272,
publisher = "Springer-Verlag",
year = 1997,
pages = "31--44"
}
@inproceedings{agmv-cskbs-97,
author = "P. K. Agarwal and L. J. Guibas and T. M. Murali and
J. S. Vitter",
title = "Cylindrical Static and Kinetic Binary Space
Partitions",
booktitle = SOCG_1997,
year = 1997,
pages = "39--48"
}
@inproceedings{ahk-caspc-00,
author = "P. K. Agarwal and S. Har-Peled and M. Karia",
title = "Computing approximate shortest paths on convex
polytopes",
booktitle = SOCG_2000,
year = 2000,
pages = "270--279"
}
@techreport{ahsv-aspcp-96,
author = "P. K. Agarwal and S. Har-Peled and M. 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
}
@article{ahsv-aspcp-97,
author = "P. K. Agarwal and S. Har-Peled and M. Sharir and
K. R. Varadarajan",
title = "Approximate Shortest Paths on a Convex Polytope in
Three Dimensions",
journal = JACM,
volume = 44,
year = 1997,
pages = "567--584"
}
@article{aks-cdofo-95,
author = "P. K. Agarwal and M. Katz and M. Sharir",
title = "Computing depth orders for fat objects and related
problems",
journal = CGTA,
volume = 5,
year = 1995,
pages = "187--206"
}
@inproceedings{aks-cdorp-94,
author = "P. K. Agarwal and M. J. Katz and M. Sharir",
title = "Computing depth orders and related problems",
booktitle = SWAT_1994,
year = 1994,
pages = "1--12"
}
@article{aks-cdorp-95,
author = "P. K. Agarwal and M. J. Katz and M. Sharir",
title = "Computing depth orders and related problems",
journal = CGTA,
volume = 5,
year = 1995,
pages = "187--206"
}
@book{akm-rap-98,
title = "Robotics: The Algorithmic Perspective",
editor = "P. K. Agarwal and L. E. Kavraki and M. T. Mason",
publisher = "A. K. Peters",
address = "Wellesley",
year = 1998
}
@inproceedings{akksw-seahq-99,
author = "P. K. Agarwal and Lars Knipping and M. van~Kreveld
and Tycho Strijk and Alexander Wolf",
title = "A Simple and Efficient Algorithm for High-Quality
Line Labeling",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "93--96"
}
@inproceedings{ak-ccspi-93,
author = "P. K. Agarwal and M. van~Kreveld",
title = "Connected Component and Simple Polygon Intersection
Searching",
booktitle = "Proc. 3rd Workshop Algorithms Data Struct.",
series = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "36--47"
}
@techreport{ak-iplal-92t,
author = "P. 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
}
@inproceedings{ak-iplal-92i,
author = "P. K. Agarwal and M. van Kreveld",
title = "Implicit Point Location in Arrangements of Line
Segments, with an Application to Motion Planning",
booktitle = FSTTCS_1992,
site = "New Delhi, India",
year = 1992
}
@article{ak-iplal-94,
author = "P. K. Agarwal and M. van Kreveld",
title = "Implicit Point Location in Arrangements of Line
Segments, with an Application to Motion Planning",
journal = IJCGA,
volume = 4,
year = 1994,
pages = "369--383",
keywords = "point location, motion planning, arrangements"
}
@article{ak-pccis-96,
author = "P. K. Agarwal and M. van~Kreveld",
title = "Polygon and connected component intersection
searching",
journal = "Algorithmica",
volume = 15,
year = 1996,
pages = "626--660"
}
@techreport{ako-iqco-90,
author = "P. K. Agarwal and M. van Kreveld and M. H. Overmars",
title = "Intersection queries for curved objects",
type = "Manuscript",
year = 1990
}
@inproceedings{ako-iqco-91,
author = "P. K. Agarwal and M. van Kreveld and M. H. Overmars",
title = "Intersection queries for curved objects",
booktitle = SOCG_1991,
year = 1991,
pages = "41--50",
keywords = "range searching, partition trees, intersection"
}
@article{ako-iqco-93,
author = "P. K. Agarwal and M. van Kreveld and M. H. Overmars",
title = "Intersection queries in curved objects",
journal = JALG,
volume = 15,
number = 2,
year = 1993,
pages = "229--266",
keywords = "intersection, searching, curvilinear, ray shooting,
partition trees, geometric transformations"
}
@inproceedings{aks-lpmis-97,
author = "P. K. Agarwal and Mark van Kreveld and S. Suri",
title = "Label Placement by Maximum Independent Set in
Rectangles",
booktitle = CCCG_1997,
year = 1997,
pages = "233--238"
}
@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
}
@techreport{am-dhsrr-91,
author = "P. 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
}
@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"
}
@inproceedings{am-rsss-92,
author = "P. 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 = LNCS,
volume = 629,
publisher = "Springer-Verlag",
year = 1992,
pages = "1--13",
keywords = "range search, partition tree, cutting, algebraic
surface, semialgebraic set, Tarski cell"
}
@article{am-rsss-94,
author = "P. K. Agarwal and J. Matou{\v s}ek",
title = "On range searching with semialgebraic sets",
journal = DCG,
volume = 11,
year = 1994,
pages = "393--418"
}
@techreport{am-rsps-91,
author = "P. K. Agarwal and J. Matou{\v s}ek",
title = "Ray shooting and parametric search",
type = "Technical {Report}",
number = "CS-1991-22",
institution = "Dept. Comput. Sci., Duke Univ.",
address = "Durham, NC",
year = 1991
}
@inproceedings{am-rsps-92,
author = "P. K. Agarwal and J. Matou{\v s}ek",
title = "Ray shooting and parametric search",
booktitle = STOC_1992,
year = 1992,
pages = "517--526",
keywords = "ray tracing, range search, intersection, partition
trees"
}
@article{am-rsps-93,
author = "P. K. Agarwal and J. Matou{\v s}ek",
title = "Ray shooting and parametric search",
journal = SICOMP,
volume = 22,
number = 4,
year = 1993,
pages = "794--806"
}
@techreport{am-rng3d-91,
author = "P. 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"
}
@inproceedings{am-rngtd-92i,
author = "P. K. Agarwal and J. Matou{\v s}ek",
title = "Relative neighborhood graphs in three dimensions",
booktitle = SODA_1992,
year = 1992,
pages = "58--65",
keywords = "pattern recognition, geometric graphs"
}
@article{am-rngtd-92a,
author = "P. K. Agarwal and J. Matou{\v s}ek",
title = "Relative neighborhood graphs in three dimensions",
journal = CGTA,
volume = 2,
number = 1,
year = 1992,
pages = "1--14",
keywords = "pattern matching, geometric graphs, arrangements,
random sampling, closest pairs"
}
@inproceedings{ams-cmfal-94,
author = "P. K. Agarwal and J. Matou{\v s}ek and
O. Schwarzkopf",
title = "Computing Many Faces in Arrangements of Lines and
Segments",
booktitle = SOCG_1994,
year = 1994,
pages = "76--84",
url = "ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-39.ps.gz"
}
@article{ams-cmfal-98,
author = "P. K. Agarwal and J. Matou{\v s}ek and
O. Schwarzkopf",
title = "Computing Many Faces in Arrangements of Lines and
Segments",
journal = SICOMP,
volume = 27,
number = 2,
year = 1998,
pages = "491--505"
}
@inproceedings{ams-fnmst-91,
author = "P. K. Agarwal and J. Matou{\v s}ek and S. Suri",
title = "Farthest neighbors, maximum spanning trees and
related problems in higher dimensions",
booktitle = WADS_1991,
series = LNCS,
volume = 519,
publisher = "Springer-Verlag",
year = 1991,
pages = "105--116"
}
@article{ams-fnmst-92,
author = "P. K. Agarwal and J. Matou{\v s}ek and S. Suri",
title = "Farthest neighbors, maximum spanning trees and
related problems in higher dimensions",
journal = CGTA,
volume = 1,
number = 4,
year = 1992,
pages = "189--201",
keywords = "proximity, partition, maximal spanning tree, minimal
spanning tree, $d$-dimensional, furthest neighbors,
approximation, bichromatic"
}
@inproceedings{amv-nacbs-98,
author = "P. K. Agarwal and T. Murali and J. S. Vitter",
title = "A new algorithm for constructing binary space
partitions for orthogonal rectangles",
booktitle = "Proc. European Sympos. Algortihms",
year = 1998
}
@inproceedings{amv-ptcbs-97,
author = "P. K. Agarwal and T. Murali and J. S. Vitter",
title = "Practical techniques for constructing binary space
partitions for orthogonal rectangles",
booktitle = SOCG_1997,
year = 1997,
pages = "382--384"
}
@article{aps-ccai-93,
author = "P. K. Agarwal and M. Pellegrini and M. Sharir",
title = "Counting circular arc intersections",
journal = SICOMP,
volume = 22,
number = 4,
year = 1993,
pages = "778--793",
keywords = "intersection, counting, circles, circular arc
arrangement, point location, random sampling,
partition trees, geometric transformations"
}
@inproceedings{ap-aapc-00,
author = "P. K. Agarwal and Cecilia M. Procopiuc",
title = "Approximation Algorithms for Projective Clustering",
booktitle = SODA_2000,
year = 2000,
pages = "538--547"
}
@inproceedings{ap-eaac-98,
author = "P. K. Agarwal and Cecilia M. Procopiuc",
title = "Exact and Approximation Algorithms for Clustering",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "658--667"
}
@inproceedings{art-mpscr-95,
author = "P. K. Agarwal and P. Raghavan and H. Tamaki",
title = "Motion planning for a steering-constrained robot
through moderate obstacles",
booktitle = STOC_1995,
year = 1995,
pages = "343--352"
}
@techreport{ass-oleia-93,
author = "P. K. Agarwal and O. Schwarzkopf and M. Sharir",
title = "The overlay of lower envelopes and its applications",
type = "Manuscript",
institution = "??",
year = 1993
}
@article{ass-oleia-96,
author = "P. K. Agarwal and O. Schwarzkopf and M. Sharir",
title = "The overlay of lower envelopes and its applications",
journal = DCG,
volume = 15,
year = 1996,
pages = "1--13"
}
@techreport{ass-oletd-94,
author = "P. K. Agarwal and O. Schwarzkopf and M. Sharir",
title = "The overlay of lower envelopes in three dimensions
and its applications",
type = "Manuscript",
institution = "??",
year = 1994
}
@inproceedings{ass-oletd-95,
author = "P. K. Agarwal and O. Schwarzkopf and M. Sharir",
title = "The Overlay of Lower Envelopes in Three Dimensions
and its Applications",
booktitle = SOCG_1995,
year = 1995,
pages = "182--189",
url = "ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-40.ps.gz",
keywords = "curved surfaces"
}
@article{as-smmck-96,
author = "P. K. Agarwal and Sandeep Sen",
title = "Selection in monotone matrices and computing $k$-th
nearest neighbors",
journal = JALG,
volume = 20,
year = 1996,
pages = "581--601"
}
@incollection{as-atgo-95,
author = "P. K. Agarwal and M. Sharir",
title = "Algorithmic techniques for geometric optimization",
booktitle = "??",
series = LNCS,
volume = 1000,
publisher = "Springer-Verlag",
year = 1995,
pages = "234--253"
}
@inproceedings{as-anps-91,
author = "P. K. Agarwal and M. Sharir",
title = "Applications of a new partitioning scheme",
booktitle = WADS_1991,
series = LNCS,
volume = 519,
publisher = "Springer-Verlag",
year = 1991,
pages = "379--391",
keywords = "random sampling, range searching, ray tracing,
hidden line/surface elimination"
}
@techreport{as-anspt-91,
author = "P. K. Agarwal and M. Sharir",
title = "Applications of a New Space Partition Technique",
type = "Manuscript",
year = 1991
}
@article{as-anspt-93,
author = "P. K. Agarwal and M. Sharir",
title = "Applications of a new space-partitioning technique",
journal = DCG,
volume = 9,
year = 1993,
pages = "11--38",
keywords = "random sampling, range searching, ray tracing,
hidden line/surface elimination, partition trees"
}
@incollection{as-aa-00,
author = "P. K. Agarwal and M. Sharir",
title = "Arrangements and Their Applications",
editor = "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier Science Publishers B.V. North-Holland",
address = "Amsterdam",
year = 2000,
pages = "49--119",
annote = "Chapter 2 of su-hcg-00"
}
@techreport{as-cssp-90,
author = "P. K. Agarwal and M. Sharir",
title = "Circle shooting in a simple polygon",
type = "Technical {Report}",
number = "90-56",
institution = "DIMACS, Rutgers Univ.",
year = 1990
}
@article{as-cssp-93,
author = "P. K. Agarwal and M. Sharir",
title = "Circle shooting in a simple polygon",
journal = JALG,
volume = 14,
year = 1993,
pages = "69--87"
}
@article{as-cvspf-93,
author = "P. K. Agarwal and M. Sharir",
title = "Circular visibility of a simple polygon from a fixed
point",
journal = IJCGA,
volume = 3,
month = mar,
year = 1993,
pages = "1--25",
keywords = "visibility, simple polygon"
}
@techreport{as-cvspp-90,
author = "P. 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"
}
@techreport{as-cci-91,
author = "P. K. Agarwal and M. Sharir",
title = "Counting circular arc intersections",
type = "Technical {Report}",
number = "CS-1991-04",
institution = "Dept. Comput. Sci., Duke Univ.",
address = "Durham, NC",
month = jan,
year = 1991
}
@inproceedings{as-ccai-91,
author = "P. K. Agarwal and M. Sharir",
title = "Counting circular arc intersections",
booktitle = SOCG_1991,
year = 1991,
pages = "10--20",
keywords = "intersection, circles, random sampling"
}
@incollection{as-dssga-00,
author = "P. K. Agarwal and M. Sharir",
title = "{Davenport-Schinzel} Sequences and Their Geometric
Applications",
editor = "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier Science Publishers B.V. North-Holland",
address = "Amsterdam",
year = 2000,
pages = "1--47",
annote = "Chapter 1 of su-hcg-00"
}
@techreport{as-eago-96,
author = "P. K. Agarwal and M. Sharir",
title = "Efficient Algorithms for Geometric Optimization",
number = "CS-1996-19",
institution = "Dept. Computer Science, Duke University",
year = 1996
}
@article{as-eago-98,
author = "P. K. Agarwal and M. Sharir",
title = "Efficient algorithms for geometric optimization",
journal = "ACM Comput. Surv.",
volume = 30,
year = 1998,
pages = "412--458"
}
@inproceedings{as-erasg-95,
author = "P. K. Agarwal and M. Sharir",
title = "Efficient Randomized Algorithms for Some Geometric
Optimization Problems",
booktitle = SOCG_1995,
year = 1995,
pages = "326--335",
keywords = "vertical decompositions, width of point sets,
minimum-width annulus, biggest stick problem"
}
@article{as-erasg-96,
author = "P. K. Agarwal and M. Sharir",
title = "Efficient Randomized Algorithms for Some Geometric
Optimization Problems",
journal = DCG,
volume = 16,
year = 1996,
pages = "317--337"
}
@inproceedings{as-mpbpo-99,
author = "P. K. Agarwal and M. Sharir",
title = "Motion planning of a ball amid polyhedral obstacles
in three dimensions",
booktitle = SODA_1999,
year = 1999,
pages = "21--30"
}
@unpublished{as-mpbas-98,
author = "P. K. Agarwal and M. Sharir",
title = "Motion Planning of a Ball Amidst Segments in Three
Dimensions",
year = 1998,
note = "unpublished manuscript"
}
@techreport{as-oldmw-90,
author = "P. 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
}
@article{as-oldmw-91,
author = "P. K. Agarwal and M. Sharir",
title = "Off-line dynamic maintenance of the width of a
planar point set",
journal = CGTA,
volume = 1,
year = 1991,
pages = "65--78",
keywords = "off-line problem, dynamization, width, convex hull"
}
@inproceedings{as-nvpt-93,
author = "P. K. Agarwal and M. Sharir",
title = "On the number of views of polyhedral terrains",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "55--60"
}
@article{as-nvpt-94,
author = "P. K. Agarwal and M. Sharir",
title = "On the number of views of polyhedral terrains",
journal = DCG,
volume = 12,
year = 1994,
pages = "177--182"
}
@inproceedings{as-pckum-99,
author = "P. K. Agarwal and M. Sharir",
title = "Pipes, cigars, and kreplach: The union of
{M}inkowski sums in three dimensions",
booktitle = SOCG_1999,
year = 1999,
pages = "143--153"
}
@article{as-pckum-00,
author = "P. K. Agarwal and M. Sharir",
title = "Pipes, cigars, and kreplach: The union of
{M}inkowski sums in three dimensions",
journal = DCG,
volume = 24,
number = 4,
year = 2000,
pages = "645--685"
}
@techreport{as-pglp-90,
author = "P. 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
}
@article{as-pglp-94,
author = "P. 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"
}
@inproceedings{as-pglpm-91,
author = "P. K. Agarwal and M. Sharir",
title = "Planar geometric location problems and maintaining
the width of a planar set",
booktitle = SODA_1991,
year = 1991,
pages = "449--458",
keywords = "location problems, arrangements, width, parametric
search techniques"
}
@article{as-rsacp-96i,
author = "P. K. Agarwal and M. Sharir",
title = "Ray shooting amidst convex polygons in {2D}",
journal = JALG,
volume = 21,
year = 1996,
pages = "508--519"
}
@article{as-rsacp-96ii,
author = "P. K. Agarwal and M. Sharir",
title = "Ray shooting amidst convex polyhedra and polyhedral
terrains in three dimensions",
journal = SICOMP,
volume = 25,
year = 1996,
pages = "100--116"
}
@inproceedings{as-rsacp-93,
author = "P. K. Agarwal and M. Sharir",
title = "Ray Shooting Amidst Convex Polytopes in Three
Dimensions",
booktitle = SODA_1993,
year = 1993,
pages = "260--270"
}
@techreport{as-rbida-88t,
author = "P. K. Agarwal and M. Sharir",
title = "Red-blue intersection detection algorithms, with
applications to motion planning and collision
detection",
type = "Manuscript",
institution = "??",
year = 1988
}
@inproceedings{as-rbida-88,
author = "P. K. Agarwal and M. Sharir",
title = "Red-blue intersection detection algorithms, with
applications to motion planning and collision
detection",
booktitle = SOCG_1988,
year = 1988,
pages = "70--80",
keywords = "motion planning, red-blue intersection"
}
@article{as-rbida-90,
author = "P. K. Agarwal and M. Sharir",
title = "Red-blue intersection detection algorithms, with
applications to motion planning and collision
detection",
journal = SICOMP,
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"
}
@techreport{ass-sulbl-87,
author = "P. K. Agarwal and M. Sharir and P. W. Shor",
title = "Sharp upper and lower bounds on the length of
general {Davenport}-{Schinzel} sequences",
number = 332,
institution = "Department of Computer Science, New York University",
year = 1987
}
@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
}
@inproceedings{ast-apsgo-92,
author = "P. K. Agarwal and M. Sharir and Sivan Toledo",
title = "Applications of parametric searching in geometric
optimization",
booktitle = SODA_1992,
year = 1992,
pages = "72--82",
keywords = "parametric search"
}
@article{ast-apsgo-94,
author = "P. K. Agarwal and M. Sharir and S. Toledo",
title = "Applications of parametric searching in geometric
optimization",
journal = JALG,
volume = 17,
year = 1994,
pages = "292--318",
keywords = "parametric search"
}
@inproceedings{asw-d2cp-97,
author = "P. K. Agarwal and M. Sharir and E. Welzl",
title = "The Discrete $2$-Center Problem",
booktitle = SOCG_1997,
year = 1997,
pages = "147--155"
}
@article{ass-sulbl-89,
author = "P. K. Agarwal and M. Sharir and P. W.Shor",
title = "Sharp upper and lower bounds on the length of
general {Davenport}-{Schinzel} sequences",
journal = "J. Combin. Theory Ser. A",
volume = 52,
number = 2,
year = 1989,
pages = "228--274",
keywords = "Davenport-Schinzel sequences, Ackermann's function,
combinatorial geometry"
}
@article{as-escrs-90,
author = "P. K. Agarwal and M.-T. Shing",
title = "Efficient special cases of rectilinear {Steiner}
trees: Points on the boundary of a rectilinear
rectangle",
journal = "Networks",
volume = 20,
year = 1990,
pages = "453--485",
keywords = "Steiner trees"
}
@inproceedings{as-sagp-94,
author = "P. K. Agarwal and S. Suri",
title = "Surface Approximation and Geometric Partitions",
booktitle = SODA_1994,
year = 1994,
pages = "24--33",
keywords = "triangulation, ray shooting"
}
@article{as-sagp-98,
author = "P. K. Agarwal and S. Suri",
title = "Surface Approximation and Geometric Partitions",
journal = SICOMP,
volume = 27,
year = 1998,
pages = "1016--1035"
}
@article{av-eaapc-00,
author = "P. K. Agarwal and Kasturi R. Varadarajan",
title = "Efficient algorithms for approximating polygonal
chains",
journal = DCG,
volume = 23,
year = 2000,
pages = "273--291"
}
@article{af-wmsia-96,
author = "R. Agarwala and D. Fern\'{a}ndez-Baca",
title = "Weighted multidimensional search and its
applications to convex optimization",
journal = SICOMP,
volume = 25,
year = 1996,
pages = "83--99"
}
@article{a-lncg-88,
author = "A. Aggarwal",
title = "Lecture Notes in Computational Geometry",
journal = "MIT Reserch Seminar Series MIT/LCS/RSS",
volume = 3,
month = aug,
year = 1988
}
@article{a-obfma-86,
author = "A. Aggarwal",
title = "Optimal bounds for finding maximum on array of
processors with {$k$} global buses",
journal = "IEEE Trans. Comput.",
volume = "C-35",
year = 1986,
pages = "62--64"
}
@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"
}
@phdthesis{a-agpiv-84,
author = "Alok Aggarwal",
title = "The art gallery problem: {Its} variations,
applications, and algorithmic aspects",
school = "Dept. of Comput. Sci., Johns Hopkins University",
address = "Baltimore, MD",
year = 1984,
keywords = "visibility"
}
@inproceedings{aacs-mhm-87,
author = "A. Aggarwal and B. Alpern and A. K. Chandra and
M. Snir",
title = "A model for hierarchical memory",
booktitle = STOC_1987,
nickname = "STOC '87",
year = 1987,
pages = "305--313"
}
@inproceedings{abkks-emcmu-92,
author = "A. Aggarwal and A. Bar-Noy and S. Khuller and
D. Kravets and B. Schieber",
title = "Efficient minimum cost matching using quadrangle
inequality",
booktitle = FOCS_1992,
year = 1992,
pages = "583--592"
}
@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 = SOCG_1985,
year = 1985,
pages = "296--304",
keywords = "packing, visibility"
}
@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"
}
@inproceedings{ac-vma-88,
author = "A. Aggarwal and A. K. Chandra",
title = "Virtual memory algorithms",
booktitle = STOC_1988,
year = 1988,
pages = "173--185"
}
@article{acs-ccp-90,
author = "A. Aggarwal and A. K. Chandra and M. Snir",
title = "Communication Complexity of {PRAM}s",
journal = TCS,
volume = 71,
year = 1990,
pages = "3--28"
}
@inproceedings{acs-hmbt-87,
author = "A. Aggarwal and A. K. Chandra and M. Snir",
title = "Hierarchical memory with block transfer",
booktitle = FOCS_1987,
year = 1987,
pages = "204--216"
}
@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"
}
@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. J. Guibas and
C. {\'O}'D{\'u}nlaing and C. Yap",
title = "Parallel computational geometry",
journal = "Algorithmica",
volume = 3,
year = 1988,
pages = "293--327"
}
@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 = FOCS_1985,
year = 1985,
pages = "468--477"
}
@inproceedings{ackms-amtsp-97,
author = "Alok Aggarwal and Don Coppersmith and Sanjeev Khanna
and Rajeev Motwani and Baruch Schieber",
title = "The Angular-Metric Traveling Salesman Problem",
booktitle = SODA_1997,
site = "New Orleans, Louisiana",
month = jan,
year = 1997,
pages = "221--229",
annote = "An earlier version, titled 'The Angle-TSP Problem
and the Weighted Linear Matroid Parity Problem' was
accepted to STOC96, but apparently was withdrawn, as
it never appeared there"
}
@article{ackms-amtsp-99,
author = "A. Aggarwal and D. Coppersmith and S. Khanna and
R. Motwani and B. Schieber",
title = "The angular-metric traveling salesman problem",
journal = SICOMP,
volume = 29,
year = 1999,
pages = "697--711"
}
@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 = IPL,
volume = 42,
number = 1,
year = 1992,
pages = "55--60",
keywords = "proximity, lower bounds"
}
@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"
}
@inproceedings{agss-ltacv-87,
author = "A. Aggarwal and L. J. Guibas and J. Saxe and
P. W. Shor",
title = "A linear time algorithm for computing the {Voronoi}
diagram of a convex polygon",
booktitle = STOC_1987,
year = 1987,
pages = "39--45"
}
@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 = DCG,
volume = 4,
number = 6,
year = 1989,
pages = "591--604",
keywords = "convex polygons, Voronoi diagram"
}
@inproceedings{ahl-sqrpc-90,
author = "A. Aggarwal and M. Hansen and T. Leighton",
title = "Solving query-retrieval problems by compacting
{Voronoi} diagrams",
booktitle = STOC_1990,
year = 1990,
pages = "331--340",
keywords = "Voronoi diagram, searching, separator, filtering
search, probabilistic geometry",
comments = "Submitted to J. ACM"
}
@article{ah-ccbpc-89,
author = "A. Aggarwal and M. Hawrylycz",
title = "On computing the closest boundary point on the
convex hull",
journal = IPL,
volume = 31,
year = 1989,
pages = "311--314",
keywords = "proximity, points, convex hull, lower bound"
}
@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 = SOCG_1989,
year = 1989,
pages = "283--291"
}
@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 = JALG,
volume = 12,
year = 1991,
pages = "38--56"
}
@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"
}
@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"
}
@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 = FOCS_1985,
year = 1985,
pages = "186--196"
}
@inproceedings{akmsw-gamsa-86,
author = "A. Aggarwal and M. M. Klawe and S. Moran and
P. W. Shor and R. Wilber",
title = "Geometric applications of a matrix searching
algorithm",
booktitle = SOCG_1986,
year = 1986,
pages = "285--292"
}
@article{akmsw-gamsa-87,
author = "A. Aggarwal and M. M. Klawe and S. Moran and
P. W. Shor and R. Wilber",
title = "Geometric applications of a matrix-searching
algorithm",
journal = "Algorithmica",
volume = 2,
year = 1987,
pages = "195--208",
keywords = "polygons, furthest neighbors, convex polygons,
routing"
}
@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 = IPL,
volume = 31,
number = 1,
year = 1989,
pages = "17--20",
keywords = "convex polygons, furthest neighbors"
}
@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"
}
@article{am-fcmp-86,
author = "A. Aggarwal and R. Melville",
title = "Fast computation of the modality of polygons",
journal = JALG,
volume = 7,
number = 3,
year = 1986,
pages = "369--381",
keywords = "polygons, modality"
}
@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 = WADS_1989,
series = LNCS,
volume = 382,
publisher = "Springer-Verlag",
year = 1989,
pages = "115--134",
keywords = "proximity, visibility, polygons"
}
@inproceedings{ap-nsmma-88,
author = "A. Aggarwal and J. K. Park",
title = "Notes on searching in multidimensional monotone
arrays",
booktitle = FOCS_1988,
year = 1988,
pages = "497--512",
comments = "To appear in J. Algorithms as two papers"
}
@techreport{ap-psmma-89,
author = "A. Aggarwal and J. K. Park",
title = "Parallel searching in Multidimensional Monotone
Arrays",
type = "Manuscript",
institution = "??",
year = 1989
}
@techreport{ap-ssmma-89,
author = "A. Aggarwal and J. K. Park",
title = "Sequential searching multidimensional monotone
arrays",
institution = "?",
month = jun,
year = 1989
}
@inproceedings{ap-opsml-94,
author = "A. Aggarwal and C. G. Plaxton",
title = "Optimal Parallel Sorting in Multi-Level Storage",
booktitle = SODA_1994,
year = 1994,
pages = "659--668"
}
@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
}
@article{ar-ddsnn-91,
author = "A. Aggarwal and P. Raghawan",
title = "Deferred data structures for the nearest-neighbor
problem",
journal = IPL,
volume = 40,
number = 3,
year = 1991,
pages = "119--122",
keywords = "convex hull, Voronoi diagram, proximity, nearest
neighbor, furthest neighbor, deferred data
structures"
}
@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 = SOCG_1993,
year = 1993,
pages = "189--197"
}
@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 = DCG,
volume = 12,
year = 1994,
pages = "263--280"
}
@techreport{as-cldsp-89,
author = "A. Aggarwal and S. Suri",
title = "Computing the longest diagonal of a simple polygon",
type = "Research {Report}",
number = "14775 (\#66232)",
institution = "IBM",
month = jul,
year = 1989
}
@article{as-cldsp-90,
author = "A. Aggarwal and S. Suri",
title = "Computing the longest diagonal of a simple polygon",
journal = IPL,
volume = 35,
number = 1,
year = 1990,
pages = "13--18",
keywords = "polygon, diagonal"
}
@inproceedings{as-facle-87,
author = "A. Aggarwal and S. Suri",
title = "Fast algorithms for computing the largest empty
rectangle",
booktitle = SOCG_1987,
year = 1987,
pages = "278--290",
keywords = "orthogon, extremal figures, empty rectangle"
}
@inproceedings{at-iatp-93,
author = "Alok Aggarwal and Takeshi Tokuyama",
title = "An Improved Algorithm for the Traveler's Problem",
booktitle = ISAAC_1993,
nickname = "ISAAC '93",
series = LNCS,
volume = 762,
publisher = "Springer-Verlag",
year = 1993,
pages = "476--485"
}
@inproceedings{at-ciqdp-93,
author = "Alok Aggarwal and Takeshi Tokuyama",
title = "Consecutive Interval Query and Dynamic Programming
on Intervals",
booktitle = ISAAC_1993,
nickname = "ISAAC '93",
series = LNCS,
volume = 762,
publisher = "Springer-Verlag",
year = 1993,
pages = "466--475"
}
@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"
}
@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",
annote = "Uses incremental flip algorithm. Extra point at
infinity. Points are ordered by a plane filling
fractal to speed point location. Extra points are
added at cc centres until tris are small enough.",
abstract = "We describe here a new technique and a package for
rapid reconstruction of smooth surfaces from
scattered data points. This method is based on a
fast recurrent algorithm for the Delaunay
triangulation followed by rational interpolation
inside triangles. Preprocessing of data includes
sorting and takes N log(N) time. Afterwards the
computational cost is a linear function of the
amount of data. This technique enables a user to
construct a surface of any class of smoothness and
degree of convergence. Our package reconstructs
surfaces that can be uniquely projected either on a
plane or a plane or on a sphere. The graphical
section of this package includes three dimensional
transformations, shading, hidden surface removal,
interactive adding points into triangulation by
mouse, etc. The graphics has been implemented on
Iris-4D, SUN-4 and IBM-5080. (Author abstract) 17
Refs."
}
@article{a-rmli-54,
author = "S. Agmon",
title = "The Relaxation Method for Linear Inequalities",
journal = "Canad. J. Math.",
volume = 6,
year = 1954,
pages = "382--392"
}
@book{a-atfc-76,
author = "M. Agoston",
title = "Algebraic Topology: A First Course",
series = "Lecture Notes in Pure and Applied Mathematics",
publisher = "Marcel Dekker",
address = "New York, NY",
year = 1976
}
@book{a-at-76,
author = "M. K. Agoston",
title = "Algebraic Topology",
publisher = "Marcel Dekker Inc",
address = "New York, NY",
year = 1976
}
@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"
}
@inproceedings{afs-esssd-93,
author = "R. Agrawal and C. Faloutsos and A. Swami",
title = "Efficient similarity search in sequence databases",
booktitle = "Proc. 4th Internat. Conf. Foundations of Data
Organization and Algorithms",
nickname = "FODO '93",
year = 1993
}
@inproceedings{aggr-aschd-98,
author = "R. Agrawal and J. Gehrke and D. Gunopulos and
P. Raghavan",
title = "Automatic subspace clustering of high dimensional
data for data mining applications",
booktitle = SIGMOD,
year = 1998,
pages = "94--105"
}
@inproceedings{ag-icdma-92,
author = "R. Agrawal and A. Ghosh and T. Imielinski and
B. Iyer and A. Swami",
title = "An Interval Classifier for Database Mining
Applications",
booktitle = "Proceedings of the 18th Conference on Very Large
Databases",
publisher = "Morgan Kauffman",
month = aug,
year = 1992,
pages = "560--573",
annote = "marketing example; creates decision rules; compared
with CART and ID3; splits continuous values into
weak and strong intervals"
}
@inproceedings{alss-fsspn-95,
author = "R. Agrawal and K.-I. Lin and H. S. Sawhney and
S. Shim",
title = "Fast similarity search in the presence of noise,
scaling and translation in time-series databases",
booktitle = "Proc. 21st VLDB Conference",
year = 1995,
pages = "490--501"
}
@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 = STOC_1985,
year = 1985,
pages = "476--482"
}
@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"
}
@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"
}
@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"
}
@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"
}
@article{ahh-suusm-88,
author = "U. Ahlfeld and H.-D. Hecker",
title = "Strenge {Unimodalit\"at} und strenge monotonie
einfacher {Polygone}",
journal = "Wiss. Z. P{\"a}dagog. Hochschule
``K. W. F. Wander'', Dresden. Math. Naturwiss. R.",
volume = 22,
year = 1988,
pages = "29--33",
keywords = "polygon, monotone, unimodal"
}
@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"
}
@book{a-ca-66,
author = "L. V. Ahlfors",
title = "Complex Analysis",
publisher = "McGraw-Hill",
year = 1966
}
@inproceedings{abbchms-soc-97,
author = "H.-K. Ahn and M. de Berg and P. Bose and S.-W. Cheng
and D. Halperin and J. Matou{\v s}ek and
O. Schwarzkopf",
title = "Separating an Object from its Cast",
booktitle = SOCG_1997,
year = 1997,
pages = "221--230"
}
@inproceedings{acc-csed-98,
author = "H.-K. Ahn and S.-W. Cheng and O. Cheong",
title = "Casting with skewed ejection direction",
booktitle = ISAAC_1998,
nickname = "ISAAC '98",
series = LNCS,
volume = 1533,
publisher = "Springer-Verlag",
year = 1998,
pages = "139--148"
}
@inproceedings{acmv-rpbcc-00,
author = "Hee-Kap Ahn and Otfried Cheong and Ji{\v r}{\'i}
Matou{\v s}ek and Antoine Vigneron",
title = "Reachability by Paths of Bounded Curvature in Convex
Polygons",
booktitle = SOCG_2000,
year = 2000,
pages = "251--259"
}
@inproceedings{acs-bcrrp-01,
author = "Hee-Kap Ahn and Otfried Cheong and Chan-Su Shin",
title = "Bridging Convex Regions and Related Problems",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "53--56"
}
@article{af-panp-84,
author = "J. Ahn and H. Freeman",
title = "A program for automatic name placement",
journal = "Cartographica",
volume = 21,
number = "2--3",
year = 1984,
pages = "101--109"
}
@incollection{a-afps-90,
author = "A. V. Aho",
title = "Algorithms for finding patterns in strings",
booktitle = "Algorithms and Complexity",
series = "Handbook of Theoretical Computer Science",
volume = "A",
publisher = "Elsevier",
year = 1990,
pages = "255--400"
}
@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"
}
@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"
}
@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"
}
@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"
}
@article{aas-iruvt-85,
author = "N. Ahuja and B. An and B. Schachter",
title = "Image Representation Using {Voronoi} Tessellation",
journal = "Comput. Vision Graph. Image Process.",
volume = 29,
year = 1985,
pages = "286--295",
annote = "Suggests using Voronoi cells as primitives to
represent an image."
}
@inproceedings{acyb-idcat-80,
author = "N. Ahuja and R. T. Chien and R. Yen and N. Birdwell",
title = "Interference detection and collision avoidance among
three dimensional objects",
booktitle = "Proc. 1st Nat. Conf. Artificial Intell.",
site = "Palo Alto, CA",
year = 1980,
pages = "44--48"
}
@inproceedings{ah-amat-84,
author = "N. Ahuja and W. Hoff",
title = "Augmented Medial Axis Transform",
booktitle = "Proceedings of Workshop on Computer Vision,
Representation and Control",
year = 1984,
pages = "251--256",
annote = "Representation of 2D shape by MAT (overlapping
blocks). AMAT adds adjacency info for blocks. Build
from DT of block centres."
}
@article{as-mpabu-84,
author = "N. Ahuja and S. Swamy",
title = "Multiprocessor pyramid architectures for bottom-up
image analysis",
journal = "IEEE Trans. Pattern Anal. Mach. Intell.",
volume = "PAMI-6",
year = 1984,
pages = "463--474"
}
@article{av-gooso-89,
author = "N. Ahuja and J. Veenstra",
title = "Generating Octrees from Object Silhouettes in
orthographic views",
journal = "IEEE Trans. Pattern Anal. Mach. Intell.",
volume = 11,
year = 1989,
pages = "137--149"
}
@incollection{amo-nf-90,
author = "R. K. Ahuja and T. L. Magnanti and J. B. Orlin",
title = "Network Flows",
editor = "G. L. Nemhauser and A. H. G. {Rinnooy Kan} and
M. J. Todd",
booktitle = "Optimization",
series = "Handbooks in Operations Research and Management",
volume = 1,
publisher = "North-Holland",
year = 1990,
pages = "211--360"
}
@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
}
@inproceedings{a-e01ss-98,
author = "O. Aichholzer",
title = "Efficient \{0,1\}-String Searching Based on
Pre-Clustering",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "11--13"
}
@inproceedings{a-lpt-95,
author = "O. Aichholzer",
title = "Local Properties of Triangulations",
booktitle = "Abstracts 11th European Workshop Comput. Geom.",
nickname = "CG '95",
site = "Linz",
publisher = "Universit{\"a}t Linz",
year = 1995,
pages = "33--36"
}
@inproceedings{a-pt-97,
author = "O. Aichholzer",
title = "The Path of a Triangulation",
booktitle = "Abstracts 13th European Workshop Comput. Geom.",
nickname = "CG '97",
site = "W{\"u}rzburg",
publisher = "Universit{\"a}t W{\"u}rzburg",
year = 1997,
pages = "1--3"
}
@inproceedings{a-pt-99,
author = "O. Aichholzer",
title = "The Path of a Triangulation",
booktitle = "Proc. 15th Ann. Sympos. Comput. Geom.",
nickname = "SCG'99",
year = 1999,
pages = "14--23"
}
@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"
}
@inproceedings{aah-fps-01,
author = "O. Aichholzer and Lyuba S. Alboul and Ferran
Hurtado",
title = "On Flips in Polyhedral Surfaces",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "27--30"
}
@inproceedings{aa-chh-94,
author = "O. Aichholzer and F. Aurenhammer",
title = "Classifying Hyperplanes in Hypercubes",
booktitle = "Abstracts 10th European Workshop Comput. Geom.",
nickname = "CG '94",
site = "Santander",
publisher = "Universidad de Cantabria, Santander",
year = 1994,
pages = "53--57"
}
@techreport{aa-skfgpf-95,
author = "O. Aichholzer and F. Aurenhammer",
title = "Straight skeletons for general polygonal figures",
number = 432,
institution = "Inst. for Theor. Comput. Sci., Graz Univ. of
Technology, Graz, Austria",
year = 1995
}
@inproceedings{aa-ssgpf-96,
author = "O. Aichholzer and F. Aurenhammer",
title = "Straight skeletons for general polygonal figures in
the plane",
booktitle = "Proc. 2nd Ann. Internat. Conf. Computing and
Combinatorics",
nickname = "COCOON '96",
site = "Hong Kong",
series = LNCS,
volume = 1090,
publisher = "Springer-Verlag",
year = 1996,
pages = "117--126"
}
@incollection{aa-ssgpf-98,
author = "O. Aichholzer and F. Aurenhammer",
title = "Straight skeletons for general polygonal figures in
the plane",
editor = "P. Engel and H. Syta",
booktitle = "Voronoi's Impact on Modern Science, Book 2",
publisher = "Institute of Mathematics of the National Academy of
Sciences of Ukraine",
address = "Kyiv",
year = 1998,
pages = "7--21"
}
@inproceedings{aaclmp-vddsd-97,
author = "O. Aichholzer and F. Aurenhammer and D. Chen and
D. Lee and A. Mukhopadhyay and E. Papadopoulou",
title = "Voronoi Diagrams for Direction-Sensitive Distances",
booktitle = SOCG_1997,
year = 1997,
pages = "418--420"
}
@article{aacktrx-tin-96,
author = "O. Aichholzer and F. Aurenhammer and S.-W. Cheng and
Naoki Katoh and Michael Taschwer and G. Rote and
Yin-Feng Xu",
title = "Triangulations Intersect Nicely",
journal = DCG,
volume = 16,
year = 1996,
pages = "339--359",
keywords = "matching, minimum weight triangulation, greedy
triangulation",
abstract = "We show that there is a matching between the edges
of any two triangulations of a planar point set such
that an edge of one triangulation is matched either
to the identical edge in the other triangulation or
to an edge that crosses it. This theorem also holds
for the triangles of the triangulations and in
general independence systems. As an application we
give some lower bounds for the minimum weight
triangulation which can be computed in polynomial
time by matching and network flow techniques. We
exhibit an easy-to-recognize class of point sets for
which the minimum-weight triangulation coincides
with the greedy triangulation."
}
@article{aahk-tct-02,
author = "O. Aichholzer and F. Aurenhammer and Ferran Hurtado
and Hannes Krasser",
title = "Towards compatible triangulations",
journal = TCS,
volume = "??",
year = 2002,
pages = "??--??",
note = "\url{http://www.cis.TUGraz.at/igi/oaich/}",
url = "http://www.cis.TUGraz.at/igi/oaich/publications.html"
}
@techreport{aaiklr-psac-97,
author = "O. Aichholzer and F. Aurenhammer and Christian
Icking and Rolf Klein and Elmar Langetepe and
G. Rote",
title = "$\varphi$-Self-Approaching Curves",
number = 226,
institution = "Department of Computer Science, FernUniversit{\"a}t
Hagen",
address = "Germany",
year = 1997,
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr226.pdf"
}
@inproceedings{aaiklr-gsac-98,
author = "O. Aichholzer and F. Aurenhammer and Christian
Icking and Rolf Klein and Elmar Langetepe and
G. Rote",
title = "Generalized Self-Approaching Curves",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "15--17"
}
@inproceedings{aaiklr-gsac-98p,
author = "O. Aichholzer and F. Aurenhammer and Christian
Icking and Rolf Klein and Elmar Langetepe and
G. Rote",
title = "Generalized Self-Approaching Curves",
booktitle = ISAAC_1998,
nickname = "ISAAC '98",
site = "Taejon",
series = LNCS,
volume = 1533,
publisher = "Springer-Verlag",
year = 1998,
pages = "317--326"
}
@article{aaiklr-gsac-01,
author = "O. Aichholzer and F. Aurenhammer and Christian
Icking and Rolf Klein and Elmar Langetepe and
G. Rote",
title = "Generalized Self-Approaching Curves",
journal = "Discrete Appl. Math.",
volume = 109,
year = 2001,
pages = "3--24",
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr226.pdf"
}
@inproceedings{aak-eotsp-01,
author = "O. Aichholzer and F. Aurenhammer and Hannes Krasser",
title = "Enumerating order types for small point sets with
applications",
booktitle = SOCG_2001,
year = 2001,
pages = "11--18"
}
@inproceedings{aak-ctps-01,
author = "O. Aichholzer and F. Aurenhammer and Hannes Krasser",
title = "On Compatible Triangulations of Point Sets",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "23--26"
}
@inproceedings{aarx-clgta-96,
author = "O. Aichholzer and F. Aurenhammer and G. 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"
}
@inproceedings{aarx-clgta-97,
author = "O. Aichholzer and F. Aurenhammer and G. Rote and
Yin-Feng Xu",
title = "Constant-level greedy triangulations approximate the
{MWT} well",
booktitle = "??",
journal = "Journal of Combinatorial Optimization",
volume = "2?",
year = "1998?",
pages = "??--??",
note = "to appear",
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 = "O. Aichholzer and F. Aurenhammer and Michael
Taschwer and G. Rote",
title = "Triangulations Intersect Nicely",
booktitle = SOCG_1995,
year = 1995,
pages = "220--229",
keywords = "matching, minimum weight triangulation, greedy
triangulation"
}
@inproceedings{abdmss-lpuof-01,
author = "O. Aichholzer and David Bremner and Erik D. Demaine
and Henk Meijer and Vera Sacrist{\'a}n and Michael
Soss",
title = "Long Proteins with Unique Optimal Foldings in the
{H-P} Model",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "59--62"
}
@inproceedings{acddemoprt-fp-00,
author = "O. Aichholzer and Carmen Cort{\'e}s and Erik
D. Demaine and Vida Dujmovi{\'c} and J. Erickson and
Henk Meijer and M. H. Overmars and Bel\'en Palop and
Suneeta Ramaswami and G. T. Toussaint",
title = "Flipturning Polygons",
booktitle = "Proc. Japan Conf. Discrete Comput. Geom.",
site = "Tokyo, Japan",
series = LNCS,
month = nov,
year = 2000,
note = "To appear in \emph{Discrete Comput. Geom.}."
}
@article{adehost-rcp-01,
author = "O. Aichholzer and E. D. Demaine and J. Erickson and
F. Hurtado and M. H. Overmars and M. Soss and
G. T. Toussaint",
title = "Reconfiguring convex polygons",
journal = CGTA,
volume = 20,
year = 2001,
pages = "85--95"
}
@inproceedings{ah-eoncs-00,
author = "O. Aichholzer and Ferran Hurtado",
title = "Edge Operations on Non-Crossing Spanning Trees",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "121--125"
}
@inproceedings{ar-ngta-96v,
author = "O. Aichholzer and G. Rote",
title = "New Greedy Triangulation Algorithms",
booktitle = "Abstracts 12th European Workshop Comput. Geom.",
nickname = "CG '96",
site = "M{\"u}nster",
publisher = "Universit{\"a}t M{\"u}nster",
year = 1996,
pages = "11--14"
}
@book{az-pftb-98,
author = "M. Aigner and G. M. Ziegler",
title = "Proofs from {THE} {BOOK}",
publisher = "Springer-Verlag",
address = "Berlin",
year = 1998
}
@phdthesis{a-iurbw-90,
author = "John Milligan Airey",
title = "Increasing Update Rates in the Building Walkthrough
System with Automatic Model-space Subdivision and
Potentially Visible Set Calculations",
school = "Dept. of Computer Science, University of North
Carolina, Chapel Hill",
year = 1990,
keywords = "doctoral thesis"
}
@article{arb-tiriu-90,
author = "J. M. Airey and J. H. Rohlf and F. P. {Brooks, Jr.}",
title = "Towards Image Realism with Interactive Update Rates
in Complex Virtual Building Environments",
journal = "ACM Siggraph Special Issue on 1990 Symposium on
Interactive 3D Graphics",
volume = 24,
number = 2,
year = 1990,
pages = "41--50"
}
@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"
}
@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"
}
@article{acns-cfs-82,
author = "M. Ajtai and V. Chv{\'a}tal and M. Newborn and
E. Szemer{\'e}di",
title = "Crossing-free subgraphs",
journal = "Ann. Discrete Math.",
volume = 12,
year = 1982,
pages = "9--12"
}
@inproceedings{akss-dsot-86,
author = "M. Ajtai and J. Koml{\'o}s and W. Steiger and
E. Szemer{\'e}di",
title = "Deterministic selection in {$O( \log \log n)$} time",
booktitle = STOC_1986,
year = 1986,
pages = "188--195"
}
@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"
}
@inproceedings{aks-osn-83,
author = "M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di",
title = "An {$O(n \log n)$} Sorting Network",
booktitle = STOC_1983,
year = 1983,
pages = "1--9"
}
@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"
}
@article{akt-om-84,
author = "M. Ajtai and J. Koml{\'o}s and G. Tusn{\'a}dy",
title = "On optimal matchings",
journal = "Combinatorica",
volume = 4,
year = 1984,
pages = "259--264"
}
@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 = SICOMP,
volume = 25,
year = 1996,
pages = "1171--1195"
}
@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 = STOC_1992,
year = 1992,
pages = "327--338"
}
@inproceedings{a-reg-93,
author = "Kurt Akeley",
title = "Reality Engine Graphics",
booktitle = SIGGRAPH_1993,
series = "In {\em Comput. Graph.\/} Proceedings, Annual
Conference Series",
organization = "ACM SIGGRAPH",
publisher = "Addison-Wesley",
year = 1993,
pages = "109--116"
}
@incollection{ahlm-spfoj-96,
author = "S. Akella and W. Huang and K. M. Lynch and
M. T. Mason",
title = "Sensorless parts feeding with a one joint robot",
editor = "J.-P. Laumond and M. H. Overmars",
booktitle = "Algorithms for Robotic Motion and Manipulation",
publisher = "A. K. Peters",
address = "Wellesley, MA",
year = 1996
}
@inproceedings{am-ppopp-92,
author = "S. Akella and M. T. Mason",
title = "Posing polygonal objects in the plane by pushing",
booktitle = "Proc. 9th IEEE Internat. Conf. Robot. Autom.",
year = 1992,
pages = "2255--2268"
}
@inproceedings{ahk-sgaan-87,
author = "S. B. Akers and D. Harel and B. Krishnamurthy",
title = "The Star Graph: An Attractive Alternative to the
{$n$}-cube",
booktitle = "Proc. Int. Conf. on Parrallel Processing",
year = 1987,
pages = "393--400"
}
@inproceedings{ak-gtmsi-86,
author = "S. B. Akers and B. Krishnamurthy",
title = "A group theoretic model for symmetric
interconnection networks",
booktitle = "Proc. Internat. Conf. Parallel Process.",
year = 1986,
pages = "216--223"
}
@article{ak-gtmsi-38,
author = "S. B. Akers and B. Krishnamurthy",
title = "A Group Theoretic Model for Symmetric
Interconnection Networks",
journal = "IEEE Trans. Comput.",
volume = 38,
number = 4,
year = 1989,
pages = "555--566"
}
@inproceedings{ak-ftsg-87,
author = "S. B. Akers and B. Krishnamurthy",
title = "The fault tolerance of star graphs",
booktitle = "Proc. 2nd International Conference on
Supercomputing",
site = "San Francisco, CA",
year = 1987
}
@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",
annote = "Multiplicative weights in $n$
dimensions. Incremental algorithm",
abstract = "Weighted Voronoi partitions are proposed in this
paper as a generalization of the Voronoi
partition. Properties of such partitions are
obtained, and an algorithm developed for their
construction. Certain applied problems whose
solution would benefit from the use of Voronoi
diagrams are indicated. (Author abstract) 13 Refs."
}
@inproceedings{a-wtcdg-97,
author = "Jin Akiyama",
title = "Why {Taro} Can Do Geometry",
booktitle = CCCG_1997,
year = 1997,
pages = 112
}
@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"
}
@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"
}
@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"
}
@article{ans-nchcp-80,
author = "T. Akiyama and T. Nishizeki and N. Saito",
title = "{NP}-completeness of the {Hamiltonian} cycle problem
for bipartite graphs",
journal = "J. Inform. Process.",
volume = 3,
year = 1980,
pages = "73--76"
}
@proceedings{adss-p4wad-95,
title = WADS_1995,
editor = "S. Akl and F. Dehne and J.-R. Sack and N. Santoro",
series = LNCS,
volume = 955,
publisher = "Springer-Verlag",
year = 1995
}
@techreport{amr-pgg-88,
author = "S. Akl and H. Meijer and D. Rappaport",
title = "Parallel geometry on a grid",
number = "cisc 88--238",
institution = "Dept. Computer Inf. Sci. Queen's Univ.",
address = "Kingston, Ontario, Canada",
year = 1988,
keywords = "parallel computations"
}
@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"
}
@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"
}
@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 = IPL,
volume = 7,
number = 2,
year = 1978,
pages = 86,
keywords = "polygon similarity, affine maps"
}
@article{a-ccha-80,
author = "S. G. Akl",
title = "Corrigendum on convex hull algorithms",
journal = IPL,
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"
}
@article{a-oacch-84,
author = "S. G. Akl",
title = "Optimal algorithms for computing convex hulls and
for sorting",
journal = "Computing",
volume = 33,
year = 1984,
pages = "1--11"
}
@incollection{a-opass-85,
author = "S. G. Akl",
title = "Optimal parallel algorithms for selection, sorting
and computing convex hulls",
editor = "G. T. Toussaint",
booktitle = "Computational Geometry",
publisher = "North-Holland",
address = "Amsterdam, Netherlands",
year = 1985,
pages = "1--22"
}
@book{a-psa-85,
author = "S. G. Akl",
title = "Parallel Sorting Algorithms",
publisher = "Academic Press",
address = "Orlando, Florida",
year = 1985,
isbn = "0-12-047680-0"
}
@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
}
@article{a-trcha-79,
author = "S. G. Akl",
title = "Two remarks on a convex hull algorithm",
journal = IPL,
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
}
@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"
}
@article{am-acba-82,
author = "S. G. Akl and H. Meijer",
title = "On the average-case of ``bucketing'' algorithms",
journal = JALG,
volume = 3,
number = 1,
year = 1982,
pages = "9--13",
keywords = "average-case analysis, bucketing"
}
@article{am-pbs-90,
author = "S. G. Akl and J. Meijer",
title = "Parallel binary search",
journal = "IEEE Trans. Parallel Distrib. Syst.",
volume = 1,
year = 1990,
pages = "247--250"
}
@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 = CCCG_1992,
year = 1992,
pages = "353--358"
}
@inproceedings{aqs-cgspn-91i,
author = "S. G. Akl and K. Qui and I. Stojmenovi{\'c}",
title = "Computational geometry on the star and pancake
networks",
booktitle = CCCG_1991,
year = 1991,
pages = "252--255"
}
@techreport{aqs-dccgs-91t,
author = "S. G. Akl and K. Qui and I. Stojmenovic",
title = "Data Communication and Computational Geometry on the
Star and Pancake Interconnection Networks",
type = "Technical Report",
number = "91-301",
institution = "Dept. Comp and Info Sci, Queens's University",
month = apr,
year = 1991
}
@article{at-fcha-78,
author = "S. G. Akl and G. T. Toussaint",
title = "A fast convex hull algorithm",
journal = IPL,
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 = IPL,
volume = 8,
number = 3,
year = 1979,
pages = "157--158"
}
@article{at-iacps-78,
author = "S. G. Akl and G. T. Toussaint",
title = "An improved algorithm to check for polygon
similarity",
journal = IPL,
volume = 7,
year = 1978,
pages = "127--128"
}
@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 = IPL,
volume = 24,
number = 3,
year = 1987,
pages = "193--198",
keywords = "triangulation, Steiner trees, minimum spanning
trees, visibility, convex polygon"
}
@incollection{a-ggar-88,
author = "V. Akman",
title = "Geometry and graphics applied to robotics",
editor = "R. A. Earnshaw",
booktitle = "Theoretical Foundations of Computer Graphics and
CAD",
series = "NATO ASI Series~F",
volume = 40,
publisher = "Springer-Verlag",
address = "Berlin, West Germany",
year = 1988,
pages = "619--638"
}
@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"
}
@article{a-sp825-83,
author = "V. Akman",
title = "Solution to ``problem 82-5''",
journal = JALG,
volume = 4,
year = 1983,
pages = "184--187",
keywords = "triangulation, subdivision"
}
@book{a-usppe-87,
author = "V. Akman",
title = "Unobstructed Shortest Paths in Polyhedral
Environments",
series = LNCS,
volume = 251,
publisher = "Springer-Verlag",
year = 1987,
keywords = "book, polyhedra, motion planning"
}
@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"
}
@article{af-rrkdt-89,
author = "Varol Akman and Wm. Randolph Franklin",
title = "Ray Representation for K-d Trees",
journal = "Pattern Recogn. Lett.",
volume = "??",
month = nov,
year = 1989,
pages = "315--320",
keywords = "oct trees, measure, rays"
}
@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"
}
@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"
}
@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 = LNCS,
volume = 650,
publisher = "Springer-Verlag",
year = 1992,
pages = "279--288"
}
@article{a-dcpsd-98,
author = "Tatsuya Akutsu",
title = "On Determining the Congruence of Point Sets in {$d$}
Dimensions",
journal = CGTA,
volume = 9,
number = 4,
year = 1998,
pages = "247--256"
}
@inproceedings{a-dcpsh-94,
author = "Tatsuya Akutsu",
title = "On Determining the Congruity of Point Sets in Higher
Dimensions",
booktitle = ISAAC_1994,
nickname = "ISAAC '94",
site = "Beijing, China",
series = LNCS,
volume = 834,
publisher = "Springer-Verlag",
year = 1994,
pages = "38--46"
}
@inproceedings{a-ssaat-94,
author = "T. Akutsu",
title = "Substructures search and alignment algorithms for
three-dimensional protein structures",
booktitle = "Proc. SIGAL-41",
year = 1994,
pages = "1--8"
}
@inproceedings{aahit-ssede-91,
author = "Tatsuya Akutsu and Yasukazu Aoki and Susumi Hasegawa
and Hiroshi Imai and Takeshi Tokuyama",
title = "The sum of smaller endpoint degree over edges of
graphs and its. applications to geometric problems",
booktitle = CCCG_1991,
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 = ISAAC_1994,
nickname = "ISAAC '94",
site = "Beijing, China",
series = LNCS,
volume = 834,
publisher = "Springer-Verlag",
year = 1994,
pages = "405--413"
}
@inproceedings{att-ddtps-97,
author = "T. Akutsu and H. Tamaki and T. Tokuyama",
title = "Distribution of Distances and Triangles in a Point
Set and Algorithms for Computing the Largest Common
Point Set",
booktitle = SOCG_1997,
year = 1997,
pages = "314--323"
}
@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"
}
@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"
}
@article{n-loviu-92,
author = "V. B. Nitya el al.",
title = "Linear octree by volume intersection using
perspective silhouettes",
journal = "Pattern Recogn. Lett.",
volume = "??",
year = 1992,
pages = "781--788"
}
@article{a-dmbds-91,
author = "S. R. Ala",
title = "Design methodology of boundary data structures",
journal = IJCGA,
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"
}
@phdthesis{a-tddvd-91,
author = "G. Albers",
title = "Three-Dimensional Dynamic {Voronoi} Diagrams",
school = "University of W{\"u}rzburg",
month = jul,
year = 1991,
note = "in German",
keywords = "doctoral thesis"
}
@article{agmr-vdmp-98,
author = "G. Albers and L. J. Guibas and J. S. B. Mitchell and
T. Roos",
title = "Voronoi Diagrams of Moving Points",
journal = IJCGA,
volume = 8,
year = 1998,
pages = "365--380",
keywords = "Voronoi diagrams, Davenport-Schinzel sequences"
}
@inproceedings{ar-vdmph-92,
author = "G. Albers and T. Roos",
title = "Voronoi diagrams of moving points in higher
dimensional spaces",
booktitle = SWAT_1992,
nickname = "SWAT '92",
site = "Helsinki, Finland",
series = LNCS,
volume = 621,
publisher = "Springer-Verlag",
year = 1992,
pages = "399--409",
keywords = "Voronoi diagrams, Davenport-Schinzel sequences"
}
@inproceedings{aks-eueo-99,
author = "Susanne Albers and Klaus Kursawe and Sven Schuierer",
title = "Exploring Unknown Environments with Obstacles",
booktitle = SODA_1999,
nickname = "SODA '99",
site = "Baltimore",
year = 1999,
pages = "842--843"
}
@inproceedings{agmn-allag-97,
author = "D. Alberts and C. Gutwenger and P. Mutzel and
S. N{\"a}her",
title = "{AGD-Library}: {A} Library of Algorithms for Graph
Drawing",
booktitle = "Proc. Workshop on Algorithm Engineering",
nickname = "WAE '97",
site = "Venice",
month = sep,
year = 1997,
pages = "112--123",
url = "http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap12.ps.gz"
}
@inproceedings{ah-acadg-95,
author = "D. Alberts and M. R. Henzinger",
title = "Average Case Analysis of Dynamic Graph Algorithms",
booktitle = SODA_1995,
year = 1995,
pages = "312--321"
}
@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"
}
@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"
}
@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"
}
@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"
}
@inproceedings{a-ccpo-84,
author = "A. Albrecht",
title = "On the circuit complexity of planar objects",
booktitle = "Proc. 7th IEEE Internat. Conf. Pattern Recogn.",
site = "Montreal, PQ",
year = 1984,
pages = "468--470"
}
@techreport{a-vcsgc-84,
author = "A. Albrecht",
title = "On the {VLSI} complexity of some geometrical
computation problems",
type = "Report",
number = 86,
institution = "Sektion Math., Humboldt Univ.",
address = "Berlin, West Germany",
year = 1984
}
@book{az-igs-67,
author = "A. D. Aleksandrov and U. A. Zalgaller",
title = "Intrinsic Geometry of Surfaces",
publisher = "American Mathematical Society",
address = "Providence, RI",
year = 1967
}
@inproceedings{alms-eaaws-98,
author = "Lyudmil Aleksandrov and Mark Lanthier and Anil
Maheshwari and J{\"o}rg-R{\"u}diger Sack",
title = "An {$\epsilon$}-Approximation Algorithm for Weighted
Shortest Path Queries on Polyhedral Surfaces",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "19--21"
}
@inproceedings{alms-eaaws-98b,
author = "L. Aleksandrov and M. Lanthier and A. Maheshwari and
J.-R. Sack",
title = "An {$\epsilon$}-Approximation Algorithm for Weighted
Shortest Paths on Polyhedral Surfaces",
booktitle = SWAT_1998,
nickname = "SWAT '98",
site = "Stockholm",
series = LNCS,
volume = 1432,
publisher = "Springer-Verlag",
year = 1998,
pages = "11--22"
}
@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 = FOCS_1979,
year = 1979,
pages = "218--223"
}
@phdthesis{a-adral-88,
author = "Panagiotis Alevizos",
title = "Arrangements de rayons: application {\`a} la
reconstruction de formes planes",
type = "Th{\`e}se de Doctorat en Sciences",
school = "Uni\-ver\-sit{\'e} Paris-Sud",
address = "Orsay, France",
year = 1988,
keywords = "doctoral thesis"
}
@techreport{abst-oaccs-90,
author = "Panagiotis Alevizos and V. Bistiolas and
D. Sofotassios and A. Tsakalidis",
title = "An Optimal Algorithm for Computing the Closure of a
Set of Planar Rectangles and Locked-Transaction
Systems",
type = "Technical {Report}",
number = "90.11.33",
institution = "Univ. of Patras",
address = "Greece",
year = 1990
}
@incollection{abp-oabcu-89,
author = "Panagiotis 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 = "Geometry and Robotics",
series = LNCS,
volume = 391,
year = 1989,
pages = "247--274"
}
@article{abp-oabcu-90,
author = "Panagiotis 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"
}
@article{abp-oabcu-91,
author = "Panagiotis 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"
}
@inproceedings{abp-bur-89,
author = "Panagiotis 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 = LNCS,
volume = 349,
publisher = "Springer-Verlag",
year = 1989,
pages = "72--83"
}
@techreport{aby-oisra-89,
author = "Panagiotis 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{a-aorsd-98,
author = "Panagiotis D. Alevizos",
title = "An Algorithm for Orthogonal Range Search in
{$d\ge3$} Dimensions",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "23--25"
}
@inproceedings{aby-ooacr-87,
author = "Panagiotis D. Alevizos and J.-D. Boissonnat and
M. Yvinec",
title = "An optimal {$O(n \log n)$} algorithm for contour
reconstruction from rays",
booktitle = SOCG_1987,
year = 1987,
pages = "162--170"
}
@article{aby-nccr-90,
author = "Panagiotis 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"
}
@inproceedings{aby-pncp-89,
author = "Panagiotis 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"
}
@incollection{abc-gdtud-97,
author = "J. R. Alexander and J. Beck and W. W. L. Chen",
title = "Geometric discrepancy theory and uniform
distribution",
chapter = 10,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "185--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"
}
@article{a-lmtmc-85,
author = "R. Alexander",
title = "Lipschitzian mappings and total mean curvature of
polyhedral surfaces I",
journal = "Trans. Amer. Math. Soc.",
volume = 288,
number = 2,
year = 1985,
pages = "661--678"
}
@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"
}
@techreport{ar-gpppo-89,
author = "R. Alexander and N. Rowe",
title = "Geometrical Principles for Path Planning by
Optimal-Path-Map Construction for Linear and
Polygonal Homogeneous-Region Terrain",
institution = "Computer Science, U.S. Naval Postgraduate School",
address = "Monterey, CA",
year = 1989
}
@inproceedings{ar-ppopm-90,
author = "R. Alexander and N. Rowe",
title = "Path Planning by Optimal-Path-Map Construction for
Homogeneous-Cost Two-Dimensional Regions",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
year = 1990
}
@article{aw-aps-81,
author = "G. L. Alexanderson and J. E. Wetzel",
title = "Arrangements of planes in space",
journal = "Discrete Math.",
volume = 34,
year = 1981,
pages = "219--240"
}
@article{aw-dpo-77,
author = "G. L. Alexanderson and J. E. Wetzel",
title = "Dissections of a plane oval",
journal = "Amer. Math. Monthly",
volume = 84,
year = 1977,
pages = "442--449"
}
@article{aw-sps-78,
author = "G. L. Alexanderson and J. E. Wetzel",
title = "Simple partitions of space",
journal = "Math. Mag.",
volume = 51,
year = 1978,
pages = "220--225"
}
@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 = IPL,
volume = 25,
year = 1987,
pages = "199--206"
}
@book{ah-t1-35,
author = "P. Alexandroff and H. Hopf",
title = "Topologie {I}",
series = "Grundlehren der math",
volume = 45,
publisher = "Julius Springer",
address = "Berlin, Germany",
year = 1935
}
@book{a-digdk-55,
author = "A. D. Alexandrov",
title = "Die innere Geometrie der konvexen Fl{\"a}chen",
publisher = "Akademie-Verlag",
address = "Berlin, Germany",
year = 1955
}
@book{a-kp-58,
author = "A. D. Alexandrov",
title = "Konvexe Polyeder",
publisher = "Akademie-Verlag",
address = "Berlin, West Germany",
year = 1958
}
@techreport{abfhz-csbp-90,
author = "M. Alfaro and J. Brock and J. Foisy and N. Hodges
and J. Zimba",
title = "Compound soap bubbles in the plane",
type = "SMALL {Geometry} {Group} {Report}",
institution = "Williams College",
year = 1990
}
@article{achlkkmh-scmfe-90,
author = "M. Alfaro and M. Conger and K. Hodges and A. Levy
and R. Kochar and L. Kuklinski and Z. Mahmood and
K. von Haam",
title = "Segments can meet in fours in energy-minimizing
networks",
journal = "J. Und. Math.",
volume = "??",
year = 1990,
pages = "9--20"
}
@article{achlkkmh-sspmn-91,
author = "M. Alfaro and M. Conger and K. Hodges and A. Levy
and R. Kochar and L. Kuklinski and Z. Mahmood and
K. von Haam",
title = "The structure of singularities in
{$\Phi$}-minimizing networks in {$R^{2}$}",
journal = "Pacific J. Math.",
volume = "??",
year = 1991,
note = "To appear"
}
@incollection{a-csmpp-87,
author = "P. Alfeld",
title = "A case study of multivariate piecewise polynomials",
editor = "G. Farin",
booktitle = "Geometric Modeling: Algorithms and New Trends",
publisher = "SIAM Publications",
year = 1987,
pages = "149--160"
}
@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"
}
@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 = SODA_1993,
year = 1993,
pages = "371--381"
}
@article{ad-dessl-95,
author = "S. Allen and D. Dutta",
title = "Determination and evaluation of support structures
in layered manufacturing",
journal = "Journal of Design and Manufacturing",
volume = 5,
year = 1995,
pages = "153--162"
}
@inproceedings{ad-wtclm-97,
author = "S. Allen and D. Dutta",
title = "Wall thickness control in layered manufacturing",
booktitle = SOCG_1997,
year = 1997,
pages = "240--247"
}
@article{ad-wtclm-98,
author = "Seth Allen and Debasish Dutta",
title = "Wall thickness control in layered manufacturing for
surfaces with closed slices",
journal = CGTA,
volume = 10,
year = 1998,
pages = "223--238"
}
@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"
}
@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"
}
@inproceedings{ad-pcltt-01,
author = "Pierre Alliez and Mathieu Desbrun",
title = "Progressive Compression for Lossless Transmission of
Triangles Meshes",
booktitle = "Siggraph 2001",
year = 2001
}
@inproceedings{ads-rdppw-98,
author = "Pierre Alliez and O. Devillers and J. Snoeyink",
title = "Removing Degeneracies by Perturbing the Problem or
the World",
booktitle = CCCG_1998,
year = 1998,
url = "http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-alliez-removing.ps.gz",
annote = "extended abstract"
}
@article{ads-rdppw-00,
author = "Pierre Alliez and O. Devillers and J. Snoeyink",
title = "Removing Degeneracies by Perturbing the Problem or
the World",
journal = "Reliable Computing",
volume = 6,
year = 2000,
pages = "61--79",
note = "Special Issue on Computational Geometry, to appear",
url = "http://www-sop.inria.fr/prisme/biblio/",
abstract = "We describe two problem-specific approaches to
remove geometric degeneracies that we call {\it
perturbing the problem} and {\it perturbing the
world}. Using as our primary examples 2-d and 3-d
Delaunay triangulation with Euclidean and polygonal
metrics, we show that these approaches lead to
relatively simple and efficient perturbations of the
points that do not depend on a fixed ordering or
index. Thus, they produce canonical output, which is
important for producing test suites and verifiers
for randomized or dynamic geometric algorithms."
}
@article{an-cchsp-87,
author = "D. C. S. Allison and M. T. Noga",
title = "Computing the convex hull of a set of points",
journal = "Computer Physics Commun.",
volume = 43,
number = 3,
year = 1987,
pages = "381--386",
keywords = "convex hull, points"
}
@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 = IPL,
volume = 18,
number = 4,
year = 1984,
pages = "195--199"
}
@book{ag-hpc-90,
author = "G. S. Almasi and A. Gottlieb",
title = "Highly parallel computing",
publisher = "Benjamin/Cummings",
address = "Redwood City, California",
year = 1990
}
@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"
}
@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"
}
@article{awb-av-88,
author = "J. Aloimonos and I. Weiss and A. Bandyopadhyay",
title = "Active vision",
journal = "Internat. J. Comput. Vision",
volume = 2,
year = 1988,
pages = "333--356"
}
@article{a-egesr-86,
author = "N. Alon",
title = "Eigenvalues, geometric expanders, sorting in rounds
and {Ramsey} theory",
journal = "Combinatorica",
volume = 6,
year = 1986,
pages = "207--219"
}
@inproceedings{a-esrsl-85,
author = "N. Alon",
title = "Expanders, sorting in rounds and superconcentrators
of limited depth",
booktitle = STOC_1985,
year = 1985,
pages = "98--102"
}
@incollection{a-tha-95,
author = "N. Alon",
title = "Tools from Higher Algebra",
editor = "R. L. Graham and M. Gr{\" o}tschel and L. Lov{\'
a}sz",
booktitle = "Handbook of Combinatorics",
publisher = "Elsevier",
address = "Amsterdam",
year = 1995,
pages = "1749--1783"
}
@inproceedings{aa-csstm-92,
author = "N. Alon and Y. Azar",
title = "Comparison-sorting and selecting in totally monotone
matrices",
booktitle = SODA_1992,
year = 1992,
pages = "403--408"
}
@article{aa-fam-89,
author = "N. Alon and Y. Azar",
title = "Finding the approximate maximum",
journal = SICOMP,
volume = 18,
number = 2,
year = 1989,
pages = "258--267"
}
@inproceedings{aa-olste-92,
author = "N. Alon and Y. Azar",
title = "On-line {Steiner} trees in the {Euclidean} plane",
booktitle = SOCG_1992,
year = 1992,
pages = "337--343",
keywords = "Steiner tree, points, on-line algorithms,
competitive algorithms"
}
@article{aa-olste-93,
author = "N. Alon and Y. Azar",
title = "On-line {Steiner} trees in the {Euclidean} plane",
journal = DCG,
volume = 10,
year = 1993,
pages = "113--121",
keywords = "Steiner tree, points, on-line algorithms,
competitive algorithms"
}
@inproceedings{aa-pcaap-88,
author = "N. Alon and Y. Azar",
title = "Parallel Comparison Algorithms for Approximation
Problems",
booktitle = FOCS_1988,
year = 1988,
pages = "194--203"
}
@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"
}
@techreport{abfk-pswen-91,
author = "N. Alon and I. B{\'a}r{\'a}ny and Z. F{\"u}redi and
D. J. Kleitman",
title = "Point selections and weak $\varepsilon$-nets for
convex hulls",
type = "Manuscript",
institution = "??",
year = 1991
}
@article{ae-degg-89,
author = "N. Alon and P. Erd{\H o}s",
title = "Disjoint edges in geometric graphs",
journal = DCG,
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"
}
@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"
}
@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"
}
@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 = SOCG_1987,
year = 1987,
pages = "331--340"
}
@article{ak-spubt-85,
author = "N. Alon and G. Kalai",
title = "A simple proof of the upper bound theorem",
journal = "European J. Combin.",
volume = 6,
year = 1985,
pages = "211--214"
}
@article{ak-bpn-95,
author = "N. Alon and G. Kalai",
title = "Bounding the piercing number",
journal = DCG,
volume = 13,
year = 1995,
pages = "245--256"
}
@article{akp-cddsl-89,
author = "N. Alon and M. Katchalski and W. R. Pulleyblank",
title = "Cutting disjoint disks by straight lines",
journal = DCG,
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 = DCG,
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"
}
@article{ak-csspr-86,
author = "N. Alon and D. J. Kleitman",
title = "Covering a square by small perimeter rectangles",
journal = DCG,
volume = 1,
year = 1986,
pages = "1--7"
}
@inproceedings{ak-pcs-92i,
author = "N. Alon and D. J. Kleitman",
title = "Piercing convex sets",
booktitle = SOCG_1992,
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 = FOCS_1990,
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"
}
@inproceedings{ars-lnccp-93,
author = "N. Alon and S. Rajagopalan and S. Suri",
title = "Long non-crossing configurations in the plane",
booktitle = SOCG_1993,
year = 1993,
pages = "257--263"
}
@techreport{as-opaol-87,
author = "N. Alon and B. Schieber",
title = "Optimal preprocessing for answering on-line product
queries",
number = "TR 71/87",
institution = "The Moise and Frida Eskenasy Institute of Computer
Science, Tel Aviv University",
year = 1987
}
@article{ast-ps-94,
author = "N. Alon and P. Seymour and R. Thomas",
title = "Planar separators",
journal = "SIAM J. Discrete Math.",
volume = 2,
number = 7,
year = 1994,
pages = "184--193"
}
@book{as-pm-92,
author = "N. Alon and J. Spencer",
title = "The {P}robabilistic {M}ethod",
publisher = "John Wiley \& Sons",
address = "New York, NY",
year = 1992
}
@article{agr-lmulb-92,
author = "Laurent Alonso and Arthur S. Goldstein and Edward
M. Reingold",
title = "'Lion and Man': Upper and Lower Bounds",
journal = "ORSA J. Comput.",
volume = 4,
number = 4,
year = 1992,
pages = "447--452",
annote = "Special issue on computational geometry; J. Mitchell
and J. Karel Lenstra, eds."
}
@inproceedings{aht-dismr-89,
author = "P. G. Alourdas and G. R. Hottel and S. T. Tuohy",
title = "A Design and Interrogation System for Modeling with
Rational Splines",
booktitle = "Proc. 9th International Symposium on Offshore
Mechanics and Arctic Engineering",
year = 1990,
pages = "555--565"
}
@inproceedings{acf-umh-90,
author = "B. Alpern and L. Carter and E. Feig",
title = "Uniform Memory Hierarchies",
booktitle = FOCS_1990,
year = 1990,
pages = "600--608"
}
@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 = SODA,
year = 1990,
pages = "32--42",
keywords = "dynamic algorithm"
}
@book{a-aac-78,
title = "Algorithmic Aspects of Combinatorics",
editor = "Brian Alspach",
series = "Ann. Discrete Math.",
volume = 2,
publisher = "North-Holland",
address = "Amsterdam",
year = 1978
}
@article{a-fshpi-96,
author = "M. H. Alsuwaiyel",
title = "Finding a shortest {Hamiltonian} path inside a
simple polygon",
journal = IPL,
volume = 59,
year = 1996,
pages = "207--210"
}
@article{a-tasdp-97,
author = "M. H. Alsuwaiyel",
title = "Two Algorithms for the Sum of Diameters Problem and
a Related Problem",
journal = IJCGA,
volume = 7,
year = 1997,
pages = "493--508"
}
@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 = IPL,
volume = 55,
number = 2,
year = 1995,
pages = "75--79",
keywords = "simple polygon, link distance, watchman routes,
visibility, approximation, set cover",
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 = CGTA,
volume = 3,
number = 1,
year = 1993,
pages = "1--25",
keywords = "simple polygon, link distance, watchman route,
NP-hardness, approximation, set cover",
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 = JACM,
volume = 9,
year = 1962,
pages = "240--258"
}
@article{a-cccaf-88,
author = "H. Alt",
title = "Comparing the combinational complexities of
arithmetic functions",
journal = JACM,
volume = 35,
year = 1988,
pages = "447--460"
}
@inproceedings{a-gmpsm-97,
author = "Helmut Alt",
title = "Geometric Methods in Pattern and Shape Matching",
booktitle = "Abstracts 13th European Workshop Comput. Geom.",
nickname = "CG '97",
site = "W{\"u}rzburg",
publisher = "Universit{\"a}t W{\"u}rzburg",
year = 1997,
pages = 42
}
@inproceedings{aar-msrp-94,
author = "H. Alt and O. Aichholzer and G. Rote",
title = "Matching Shapes with a Reference Point",
booktitle = SOCG_1994,
year = 1994,
pages = "85--92"
}
@inproceedings{aar-msrp-94c,
author = "Helmut Alt and O. Aichholzer and G. Rote",
title = "Matching Shapes with a Reference Point",
booktitle = "Abstracts 10th European Workshop Comput. Geom.",
nickname = "CG '94",
site = "Santander",
publisher = "Universidad de Cantabria, Santander",
year = 1994,
pages = "81--84"
}
@article{aar-msrp-97,
author = "H. Alt and O. Aichholzer and G. Rote",
title = "Matching Shapes with a Reference Point",
journal = IJCGA,
volume = 7,
year = 1997,
pages = "349--363",
keywords = "shape matching, Steiner point",
abstract = "For two given point sets, we present a very simple
(almost trivial) algorithm to translate one set so
that the Hausdorff distance between the two sets is
not larger than a constant factor times the minimum
Hausdorff distance which can be achieved in this
way. The algorithm just matches the so-called
Steiner points of the two sets. The focus of our
paper is the general study of reference points (like
the Steiner point) and their properties with respect
to shape matching."
}
@inproceedings{ab-akp-90,
author = "Helmut Alt and Bernd Behrends",
title = "{Approximative} {Kongruenz} von {Polygonen}",
booktitle = "Abstracts 6th Intern. Workshop Comput. Geom.",
nickname = "CG '90",
site = "Siegen",
publisher = "Universit{\"a}t Siegen",
year = 1990,
pages = 4
}
@inproceedings{abb-amps-91,
author = "H. Alt and B. Behrends and J. Bl{\"o}mer",
title = "Approximate matching of polygonal shapes",
booktitle = SOCG_1991,
year = 1991,
pages = "186--193",
keywords = "matching, polygons, approximation"
}
@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"
}
@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"
}
@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 = LNCS,
volume = 443,
publisher = "Springer-Verlag",
year = 1990,
pages = "703--716"
}
@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 = IPL,
volume = 37,
year = 1991,
pages = "237--240"
}
@book{acs-cg-95,
title = "Computational Geometry",
editor = "Helmut Alt and B. Chazelle and R. Seidel",
series = "Dagstuhl-Seminar-Report",
volume = 109,
publisher = "Internat. Begegnungs- und Forschungszentrum f{\"u}r
Informatik",
address = "Schloss Dagstuhl, Germany",
year = 1995,
url = "http://www.dagstuhl.de/DATA/Participants/9511.html"
}
@book{acw-cg-93,
title = "Computational Geometry",
editor = "Helmut Alt and B. Chazelle and E. Welzl",
series = "Dagstuhl-Seminar-Report",
volume = 59,
publisher = "Internat. Begegnungs- und Forschungszentrum f{\"u}r
Informatik",
address = "Schloss Dagstuhl, Germany",
year = 1993,
url = "http://www.dagstuhl.de/DATA/Seminars/93/"
}
@inproceedings{afhn-psfks-98,
author = "Helmut Alt and Stefan Felsner and Ferran Hurtado and
Marc Noy",
title = "Point-Sets with few {$k$}-Sets",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "27--28",
note = "To appear in Proc. 14th ACM Sympos. Comput. Geom."
}
@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 = SOCG_1990,
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"
}
@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 = "Algorithms --- Proc. 4th Annu. European
Sympos. Algorithms",
nickname = "ESA'96",
series = LNCS,
volume = 1136,
publisher = "Springer-Verlag",
year = 1996,
pages = "320--333"
}
@article{afrw-mcsrs-98,
author = "H. Alt and U. Fuchs and G. Rote and G. Weber",
title = "Matching convex shapes with respect to the symmetric
difference",
journal = "Algorithmica",
volume = 21,
year = 1998,
pages = "89--103",
abstract = "This paper deals with questions from convex geometry
related to shape matching. In particular, we
consider the problem of moving one convex figure
over another, minimizing the area of their symmetric
difference. We show that if we just let the two
centers of gravity coincide, the resulting symmetric
difference is within a factor of 11/3 of the
optimum. This leads to efficient approximate
matching algorithms for convex figures."
}
@inproceedings{afrw-rpsm-96,
author = "Helmut Alt and Ulrich Fuchs and G. Rote and Gerald
Weber",
title = "Reference Points for Shape Matching",
booktitle = "Abstracts 12th European Workshop Comput. Geom.",
nickname = "CG '96",
site = "M{\"u}nster",
publisher = "Universit{\"a}t M{\"u}nster",
year = 1996,
pages = "73--74"
}
@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 = IPL,
volume = 42,
year = 1992,
pages = "25--27"
}
@article{ag-cfdbt-95,
author = "H. Alt and M. Godau",
title = "Computing the {Fr\'echet} distance between two
polygonal curves",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "75--91",
keywords = "Frechet distance, shape analysis, resemblance of
curves, computational morphology"
}
@unpublished{ag-chdhd-,
author = "H. Alt and M. Godau",
title = "Computing the {Hausdorff}-distance in higher
dimensions",
note = "In preparation"
}
@inproceedings{ag-mrpc-92,
author = "H. Alt and M. Godau",
title = "Measuring the resemblance of polygonal curves",
booktitle = SOCG_1992,
year = 1992,
pages = "102--109"
}
@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"
}
@inproceedings{agw-u3dvr-96,
author = "H. Alt and M. Godau and S. Whitesides",
title = "Universal 3-Dimensional Visibility Representations
for Graphs",
editor = "F. J. Brandenburg",
booktitle = "Graph Drawing (Proc. GD '95)",
series = LNCS,
volume = 1027,
publisher = "Springer-Verlag",
year = 1996,
pages = "8--19",
keywords = "graph drawing, visibility, 3D"
}
@article{agw-u3dvr-98,
author = "Helmut Alt and Michael Godau and S. Whitesides",
title = "Universal $3$-Dimensional Visibility Representations
for Graphs",
journal = CGTA,
volume = 9,
year = 1998,
pages = "111--125",
note = "(special issue on Graph Drawing, edited by G.~{Di
Battista} and R.~Tamassia)",
keywords = "graph drawing, visibility, 3D"
}
@incollection{ag-dgsmi-00,
author = "Helmut Alt and L. J. Guibas",
title = "Discrete Geometric Shapes: {Matching},
Interpolation, and Approximation",
editor = "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier Science Publishers B.V. North-Holland",
address = "Amsterdam",
year = 2000,
pages = "121--153",
annote = "Chapter 3 of su-hcg-00"
}
@inproceedings{ah-elnns-99,
author = "Helmut Alt and Ulrich Hoffmann",
title = "Exact {$L_\infty$} Nearest Neighbor Search in High
Dimensions",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "91--92"
}
@inproceedings{ahs-cliir-95,
author = "Helmut Alt and David Hsu and J. Snoeyink",
title = "Computing the Largest Inscribed Isothetic Rectangle",
booktitle = CCCG_1995,
year = 1995,
pages = "67--72"
}
@inproceedings{ak-msrsd,
author = "Helmut Alt and Christian Knauer",
title = "Matching Shape with Respect to the Symmetric
Difference",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "195--197"
}
@inproceedings{akw-bfdhd-01,
author = "Helmut Alt and Christian Knauer and Carola Wenk",
title = "Bounding the {Fr{\'e}chet} Distance by the
{Hausdorff} Distance",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "166--169"
}
@article{am-sst-85,
author = "H. Alt and K. Mehlhorn",
title = "Searching semisorted tables",
journal = SICOMP,
volume = 14,
year = 1985,
pages = "840--848"
}
@article{amm-cpmr-81,
author = "H. Alt and K. Mehlhorn and J. I. Munro",
title = "On the complexity of partial match retrieval",
journal = "Mathematical Foundations of Computer Science",
volume = "??",
year = 1981,
pages = "156--161"
}
@article{amm-pmrid-84,
author = "H. Alt and K. Mehlhorn and J. I. Munro",
title = "Partial match retrieval in implicit data structures",
journal = IPL,
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 = SOCG_1987,
year = 1987,
pages = "308--315"
}
@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 = DCG,
volume = 3,
year = 1988,
pages = "237--256"
}
@inproceedings{as-vdco-95,
author = "Helmut Alt and O. Schwarzkopf",
title = "The {Voronoi} diagram of curved objects",
booktitle = SOCG_1995,
year = 1995,
pages = "89--97",
url = "http://www.cs.ruu.nl/~otfried/ps/as-vdco-95.ps.gz",
keywords = "randomized incremental algorithm"
}
@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"
}
@inproceedings{aww-plabc-97,
author = "H. Alt and E. Welzl and B. Wolfers",
title = "Piecewise Linear Approximation of B{\'e}zier-Curves",
booktitle = SOCG_1997,
year = 1997,
pages = "433--435"
}
@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"
}
@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"
}
@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"
}
@inproceedings{am-pttbc-00,
author = "E. Althaus and K. Mehlhorn",
title = "Polynomial time {TSP}-based curve reconstruction",
booktitle = SODA_2000,
nickname = "SODA '00",
month = jan,
year = 2000,
pages = "686--695"
}
@inproceedings{amns-ecr-00,
author = "E. Althaus and K. Mehlhorn and S. N{\"a}her and
S. Schirra",
title = "Experiments on curve reconstruction",
booktitle = "Proc. 2nd Workshop Algorithm Eng. Exper.",
nickname = "ALENEX '00",
month = jan,
year = 2000,
pages = "103--114"
}
@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 = DCG,
volume = 3,
year = 1988,
pages = "103--122"
}
@inproceedings{addj-gsswg-90,
author = "I. Alth{\"o}fer and G. Das and D. Dobkin and
D. Joseph",
title = "Generating Sparse Spanners for Weighted Graphs",
booktitle = SWAT_1990,
year = 1990,
pages = "26--37"
}
@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 = DCG,
volume = 9,
year = 1993,
pages = "81--100"
}
@incollection{achllstu-mairp-81,
author = "M. D. Altschuler and Y. Censor and G. T. Hermann and
A. Lent and R. M. Lewitt and S. N. Srihari and
H. Tuy and J. K. Udupa",
title = "Mathematical aspects of image reconstruction from
projections",
editor = "L. N. Kanal and A. Rosenfeld",
booktitle = "Progress in pattern recognition",
volume = 1,
publisher = "North-Holland",
address = "New-York, NY",
year = 1981,
pages = "323--375"
}
@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 = DCG,
volume = 1,
year = 1986,
pages = "355--369"
}
@inproceedings{as-dchan-99,
author = "S. Aluru and F. E. Sevilgen",
title = "Dynamic compressed hyperoctrees with application to
the {N}-body problem",
booktitle = FSTTCS_1999,
series = LNCS,
volume = 1738,
publisher = "Springer-Verlag",
year = 1999,
pages = "21--33"
}
@article{a-rtc-84,
author = "J. Amanatides",
title = "Ray Tracing with Cones",
journal = "Comput. Graph.",
volume = 18,
number = 3,
year = 1984,
pages = "129--135",
note = SIGGRAPH_1984
}
@book{a-dgms-85,
author = "S. Amari",
title = "Differential Geometrical Methods in Statistics",
series = "Lecture Notes in Statistics",
volume = 28,
publisher = "Springer-Verlag",
address = "New York, NY",
year = 1985
}
@article{a-dssp-94,
author = "N. Amato",
title = "Determining the separation of simple polygons",
journal = IJCGA,
volume = 4,
year = 1994,
pages = "457--474",
keywords = "separation, simple polygon, parallel algorithm,
sequential algorithm"
}
@incollection{abdjv-oobp3-98,
author = "N. Amato and O. B. Bayazit and L. K. Dale and
C. Jones and D. Vallejo",
title = "{OBPRM}: An obstacle-based {PRM} for {3D}
workspaces",
editor = "P. K. Agarwal and L. E. Kavraki and M. Mason",
booktitle = WAFR,
publisher = "A. K. Peters",
address = "Wellesley, MA",
year = 1998,
note = "To appear"
}
@inproceedings{a-oafss-93,
author = "N. M. Amato",
title = "An Optimal Algorithm for Finding the Separation of
Simple Polygons",
booktitle = "Proc. 3rd Workshop Algorithms Data Struct.",
series = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "48--59"
}
@article{agr-ratsp-01,
author = "N. M. Amato and Michael T. Goodrich and E. A. Ramos",
title = "A Randomized Algorithm for Triangulating a Simple
Polygon in Linear Time",
journal = DCG,
volume = 26,
number = 2,
year = 2001,
pages = "245--265"
}
@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 = STOC_1995,
year = 1995,
pages = "672--682"
}
@inproceedings{agr-cacsd-00,
author = "N. M. Amato and M. T. Goodrich and E. A. Ramos",
title = "Computing the arrangement of curve segments:
divide-and-conquer algorithms via sampling",
booktitle = SODA_2000,
nickname = "SODA '00",
year = 2000,
pages = "705--706"
}
@inproceedings{agr-lttsp-00,
author = "N. M. Amato and Michael T. Goodrich and E. A. Ramos",
title = "Linear-Time Triangulation of a Simple Polygon Made
Easier via Randomization",
booktitle = SOCG_2000,
year = 2000,
pages = "201--212"
}
@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 = FOCS_1994,
year = 1994,
pages = "683--694"
}
@inproceedings{ap-np3dc-93,
author = "N. M. Amato and F. P. Preparata",
title = "An {NC}$^1$ Parallel 3{D} convex hull algorithm",
booktitle = SOCG_1993,
year = 1993,
pages = "289--297"
}
@article{ap-p3dch-92,
author = "N. M. Amato and F. P. Preparata",
title = "The parallel 3{D} convex hull problem revisited",
journal = IJCGA,
volume = 2,
number = 2,
year = 1992,
pages = "163--173",
keywords = "convex hull, parallel computation, PRAM,
hierarchical representation"
}
@inproceedings{ar-cvddp-96,
author = "N. M. Amato and E. A. Ramos",
title = "On Computing {Voronoi} Diagrams by
Divide-Prune-and-Conquer",
booktitle = SOCG_1996,
year = 1996,
pages = "166--175"
}
@article{a-cspcp-66,
author = "R. V. Ambarcumjam",
title = "Convex subclusters of point clusters in the plane",
journal = "Dokl. Acad. Nauk Armjan. SSR",
volume = 43,
year = 1966,
pages = "12--14"
}
@inproceedings{a-bbhdn-94,
author = "N. Amenta",
title = "Bounded Boxes, {Hausdorff} Distance, and a New Proof
of an Interesting {Helly} Theorem",
booktitle = SOCG_1994,
year = 1994,
pages = "340--347"
}
@incollection{a-cgs-97,
author = "N. Amenta",
title = "Computational geometry software",
chapter = 52,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "951--960"
}
@misc{a-dcgs-,
author = "N. Amenta",
title = "Directory of Computational Geometry Software",
note = "\path|http://www.geom.umn.edu/software/cglist/|",
url = "http://www.geom.umn.edu/software/cglist/"
}
@inproceedings{a-fltao-92,
author = "N. Amenta",
title = "Finding a line transversal of axial objects in three
dimensions",
booktitle = SODA_1992,
year = 1992,
pages = "66--71"
}
@inproceedings{a-fpf-96,
author = "N. Amenta",
title = "Four-polytopes and a funeral",
booktitle = SOCG_1996,
year = 1996,
pages = "V1--V2"
}
@phdthesis{a-htglp-93t,
author = "N. Amenta",
title = "Helly Theorems and Generalized Linear Programming",
school = "Geometry Center",
address = "Minneapolis, MN",
year = 1993,
note = "Technical Report GCG61",
keywords = "doctoral thesis"
}
@inproceedings{a-htglp-93,
author = "N. Amenta",
title = "Helly theorems and generalized linear programming",
booktitle = SOCG_1993,
year = 1993,
pages = "63--72"
}
@article{a-httgl-94,
author = "N. Amenta",
title = "Helly-type theorems and generalized linear
programming",
journal = DCG,
volume = 12,
year = 1994,
pages = "241--261"
}
@inproceedings{a-ktpcs-96,
author = "N. Amenta",
title = "$k$-{Transversals} of parallel convex sets",
booktitle = CCCG_1996,
year = 1996,
pages = "80--86"
}
@inproceedings{ab-srvf-98,
author = "N. Amenta and M. Bern",
title = "Surface reconsruction by {Voronoi} filtering",
booktitle = SOCG_1998,
site = "Minneapolis",
year = 1998,
pages = "39--48"
}
@article{ab-srvf-99,
author = "N. Amenta and M. Bern",
title = "Surface Reconstruction by {Voronoi} Filtering",
journal = DCG,
volume = 22,
number = 4,
year = 1999,
pages = "481--504"
}
@inproceedings{abe-oppms-97,
author = "N. Amenta and M. Bern and D. Eppstein",
title = "Optimal Point Placement for Mesh Smoothing",
booktitle = SODA_1997,
month = jan,
year = 1997,
pages = "528--537"
}
@techreport{abe-cbscc-97,
author = "N. Amenta and M. Bern and D. Eppstein",
title = "The Crust and the $\beta$-Skeleton: Combinatorial
Curve Reconst ruction",
type = "Research {Report}",
institution = "Xerox PARC",
year = 1997,
note = "\path|http://www.geom.umn.edu/~nina/papers/crust.ps.gz|",
url = "http://www.geom.umn.edu/~nina/papers/crust.ps.gz"
}
@article{abe-cbscc-98,
author = "N. Amenta and M. Bern and D. Eppstein",
title = "The Crust and the $\beta$-Skeleton: Combinatorial
Curve Reconstruction",
journal = "Graphical Models and Image Processing",
volume = 60,
year = 1998,
pages = "125--135",
url = "http://www.geom.umn.edu/~nina/papers/crust.ps.gz",
comments = "\path|http://www.geom.umn.edu/~nina/papers/crust.ps.gz|"
}
@article{abet-rdcp-00,
author = "N. Amenta and M. Bern and D. Eppstein and
S.-H. Teng",
title = "Regression Depth and Center Points",
journal = DCG,
volume = 23,
year = 2000,
pages = "305--323"
}
@inproceedings{abk-nvbsr-98,
author = "N. Amenta and M. Bern and M. Kamvysselis",
title = "A New {Voronoi}-Based Surface Reconstruction
Algorithm",
booktitle = SIGGRAPH_1998,
site = "Orlando, FL",
series = "Computer Graphics Proceedings, Annual Conference
Series",
month = jul,
year = 1998,
pages = "415--412"
}
@unpublished{ac-opdfh-99,
author = "N. Amenta and S. Choi",
title = "One-pass {Delaunay} filtering for homeomorphic {3D}
surface reconstruction",
year = 1999,
note = "Manuscript"
}
% title page uses initials only
@inproceedings{acdl-sahsr-00,
author = "N. Amenta and S. Choi and T. K. Dey and N. Leekha",
title = "A Simple Algorithm for Homeomorphic Surface
Reconstruction",
booktitle = SOCG_2000,
year = 2000,
pages = "213--222"
}
@article{ack-pcubm-01,
author = "N. Amenta and S. Choi and R. K. Kolluri",
title = "The power crust, unions of balls, and the medial
axis transform",
journal = CGTA,
volume = 19,
year = 2001,
pages = "127--153"
}
@inproceedings{ak-aeub-00,
author = "N. Amenta and Ravi Krishna Kolluri",
title = "Accurate and Efficient Unions of Balls",
booktitle = SOCG_2000,
year = 2000,
pages = "119--128"
}
@article{ak-maub-01,
author = "N. Amenta and R. K. Kolluri",
title = "The medial axis of a union of balls",
journal = CGTA,
volume = 20,
year = 2001,
pages = "25--37"
}
@inproceedings{almp-gsgv-95,
author = "N. Amenta and S. Levy and T. Munzner and M. Philips",
title = "Geomview: A System for Geometric Visualization",
booktitle = SOCG_1995,
year = 1995,
pages = "C12--C13",
keywords = "software, visualization"
}
@inproceedings{az-ssp-96,
author = "N. Amenta and G{\"u}nter Ziegler",
title = "Shadows and Slices of Polytopes",
booktitle = SOCG_1996,
year = 1996,
pages = "10--19"
}
@inproceedings{ab-tdpia-92,
author = "A. Amir and G. Benson",
title = "Two-dimensional periodicity and its applications",
booktitle = SODA_1992,
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 = SODA_1991,
year = 1991,
pages = "212--223"
}
@article{a-afccf-90,
author = "I. Amir",
title = "Algorithms for finding the center of circular
fiducials",
journal = "Comput. Vision Graph. Image Process.",
volume = 49,
year = 1990,
pages = "398--406"
}
@techreport{a-pmwt-90,
author = "Efthymios Anagnostou",
title = "Progress in Minimum Weight Triangulation",
type = "Technical Report 232/90",
institution = "Department of Computer Science, University of
Toronto",
year = 1990
}
@article{ac-ptimw-93,
author = "E. Anagnostou and D. Corneil",
title = "Polynomial time instances of the minimum weight
triangulation problem",
journal = CGTA,
volume = 3,
year = 1993,
pages = "247--259"
}
@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 = LNCS,
volume = 450,
publisher = "Springer-Verlag",
year = 1990,
pages = "310--317",
keywords = "topological sweep, three-dimensional"
}
@inproceedings{arrms-dgbb2-97,
author = "Brad Andalman and Kathy Ryall and Wheeler Ruml and
Joe Marks and Stuart Shieber",
title = "Design Gallery Browsers Based on {2D} and {3D} Graph
Drawing",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "322--329",
keywords = "graph drawing"
}
@book{a-caa-73,
author = "M. R. Anderberg",
title = "Cluster Analysis for Applications",
publisher = "Academic Press",
address = "New York",
year = 1973,
comments = "Unchecked reference from PRNN"
}
@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 = IPL,
volume = 7,
number = 1,
year = 1978,
pages = "53--55"
}
@article{aw-omht-96,
author = "L. Anderson and R. Wenger",
title = "Oriented Matroids and Hyperplane Transversals",
journal = "Adv. Math.",
volume = 119,
year = 1996,
pages = "117--125"
}
@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"
}
@article{abb-paa-96,
author = "Richard Anderson and Paul Beame and Erik Brisson",
title = "Parallel Algorithms for Arrangements",
journal = "Algorithmica",
volume = 15,
year = 1996,
pages = "104--125"
}
@inproceedings{aks-oa1dt-90,
author = "R. Anderson and S. Kahan and M. Schlag",
title = "An {$O(n \log n)$} algorithm for $1$-d tile
compaction",
editor = "M. Nagl",
booktitle = "Graph-Theoretic Concepts in Computer Science",
series = LNCS,
volume = 411,
publisher = "Springer-Verlag",
year = 1990,
pages = "287--301"
}
@inproceedings{am-dplr-88,
author = "R. Anderson and G. Miller",
title = "Deterministic parallel list ranking",
booktitle = "Proc. 3rd Aegean Workshop Computing",
series = LNCS,
volume = 319,
publisher = "Springer-Verlag",
year = 1988,
pages = "81--90"
}
@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"
}
@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"
}
@article{am-dplr-91,
author = "R. J. Anderson and G. L. Miller",
title = "An optimal algorithm for intersecting line segments
in the plane",
journal = "Algorithmica",
volume = 6,
year = 1991,
pages = "859--868"
}
@inproceedings{aw-wfpau-91,
author = "R. J. Anderson and H. Woll",
title = "Wait-free parallel algorithms for the union-find
problem",
booktitle = STOC_1991,
year = 1991,
pages = "370--380"
}
@article{ahnr-slt-98,
author = "Andersson and Hagerup and Nilsson and Raman",
title = "Sorting in linear time?",
journal = "J. Comput. Syst. Sci.",
volume = 57,
year = 1998,
pages = "74--93",
keywords = ""
}
@inproceedings{ahhp-fms-94,
author = "Arne Andersson and Torben Hagerup and Johan
H{\.a}astad and Ola Petersson",
title = "Faster Multidimensional Searching",
booktitle = STOC_1993,
year = 1994,
pages = ""
}
@article{aiko-bstao-90,
author = "Arne Andersson and Christian Icking and Rolf Klein
and Thomas Ottmann",
title = "Binary Search Trees of Almost Optimal Height",
journal = "Acta Inform.",
volume = 28,
year = 1990,
pages = "165--178"
}
@inproceedings{amrt-sdarq-96,
author = "Arne Andersson and Peter Bro Miltersen and S{\o}ren
Riis and Mikkel Thorup",
title = "Static Dictionaries on {$\mathit{AC}^0$} {RAMs}:
Query Time {$\Theta(\sqrt(\log n/\log \log n))$} is
Necessary and Sufficient",
booktitle = FOCS_1996,
year = 1996,
pages = "441--450"
}
@inproceedings{as-drs-95,
author = "Arne Andersson and Kurt Swanson",
title = "On the Difficulty of Range Searching",
booktitle = WADS_1995,
nickname = "WADS '95",
site = "Kingston, Canada",
series = LNCS,
volume = 955,
publisher = "Springer-Verlag",
year = 1995,
pages = "473--481"
}
@article{as-drs-97,
author = "A. Andersson and K. Swanson",
title = "On the Difficulty of Range Searching",
journal = CGTA,
volume = 8,
year = 1997,
pages = "115--122"
}
@article{adps-pptpt-95,
author = "L.-E. Andersson and S. M. Dorney and T. J. Peters
and N. F. Stewart",
title = "Polyhedral Perturbations that Preserve Topological
Form",
journal = "Comput. Aided Geom. Design",
volume = 12,
number = 8,
month = dec,
year = 1995,
pages = "785--799"
}
@article{as-eacs-01,
author = "M. V. A. Andrade and J. Stolfi",
title = "Exact algorithms for circles on the sphere",
journal = IJCGA,
volume = 11,
year = 2001,
pages = "267--290"
}
@unpublished{a-srvg-89,
author = "T. Andrae",
title = "Some results on visibility graphs",
year = 1989,
note = "Preprint"
}
@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"
}
@article{a-cpls-70,
author = "E. M. Andreev",
title = "On convex polyhedra in {Lobacevskii} space",
journal = "Math. USSR Sbornik",
volume = 10,
number = 3,
year = 1970,
pages = "413--440"
}
@article{a-cpfvl-70,
author = "E. M. Andreev",
title = "On convex polyhedra of finite volume in
{Lobacevskii} space",
journal = "Math. USSR Sbornik",
volume = 12,
number = 2,
year = 1970,
pages = "259--270"
}
@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"
}
@article{a-aeach-79,
author = "A. M. Andrew",
title = "Another efficient algorithm for convex hulls in two
dimensions",
journal = IPL,
volume = 9,
number = 5,
year = 1979,
pages = "216--219",
keywords = "designing algorithms, convex hull, two-dimensional"
}
@inproceedings{a-fcagi-94,
author = "D. S. Andrews",
title = "Further comparison of algorithms for geometric
intersection problems",
booktitle = "Proc. 6th Internat. Sympos. Spatial Data Handling",
site = "Edinburgh, UK",
year = 1994,
pages = "709--724"
}
@inproceedings{as-gginc-95,
author = "D. Scott Andrews and J. Snoeyink",
title = "Geometry in {GIS} is not Combinatorial: {Segment}
Intersection for Polygon Overlay",
booktitle = SOCG_1995,
year = 1995,
pages = "C24--C25",
keywords = ""
}
@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"
}
@book{a-imtpr-72,
author = "H. C. Andrews",
title = "Introduction to Mathematical Techniques in Pattern
Recognition",
publisher = "Wiley-Interscience",
address = "New York",
year = 1972
}
@article{al-pacag-95,
author = "M. Andrews and D. T. Lee",
title = "Parallel algorithms on circular-arc graphs",
journal = CGTA,
volume = 5,
year = 1995,
pages = "117--141"
}
@unpublished{aahsw-rksjf-98,
author = "A. Andrzejak and B. Aronov and S. Har-Peled and
R. Seidel and E. Welzl",
title = "Results on $k$-sets and $j$-facets via continuous
motion arguments",
booktitle = SOCG_1998,
year = 1998,
pages = "192--199"
}
@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"
}
@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 = LNCS,
volume = 409,
publisher = "Springer-Verlag",
year = 1990,
pages = "223--252"
}
@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)"
}
@inproceedings{ap-sstvc-01,
author = "P. Angelier and M. Pocchiola",
title = "A sum of squares theorem for visibility complexes",
booktitle = SOCG_2001,
year = 2001,
pages = "302--311",
note = ""
}
@inproceedings{ap-ctvg-00,
author = "Pierre Angelier and Michel Pocchiola",
title = "On Computing Tangent Visibility Graphs",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "108--111"
}
@inproceedings{apr-tsm-99,
author = "Pierre Angelier and Michel Pocchiola and
St{\'e}phane Rivi{\`e}re",
title = "On the Topological Sweep Method",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = 179
}
@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"
}
@article{av-fpahc-79,
author = "D. Angluin and L. G. Valiant",
title = "Fast Probabilistic Algorithms for {Hamiltonian}
Circuits and Matchings",
journal = "J. Comput. Syst. Sci.",
volume = 18,
year = 1979,
pages = "155--193"
}
@inproceedings{awz-rnrq-96,
author = "Dana Angluin and Jeffery Westbrook and Wenhong Zhu",
title = "Robot Navigation with Range Queries",
booktitle = STOC_1996,
nickname = "STOC '96",
site = "Philadelphia, PA",
month = may,
year = 1996,
pages = "469--478"
}
@inproceedings{adf-efgrs-84,
author = "S. Ansaldi and L. {De Floriani} and B. Falcidieno",
title = "Edge-face graph representation of solid objects",
booktitle = "Poceedings of Workshop on Computer Vision,
Representation and Control",
site = "Annapolis, MD",
year = 1984,
pages = "164--169"
}
@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 = SIGGRAPH_1985
}
@book{ab-clt-92,
author = "M. Anthony and N. Biggs",
title = "Computational Learning Theory",
publisher = "Cambridge University Press",
address = "Cambridge",
year = 1992
}
@article{a-slddf-21,
author = "L. Antoine",
title = "Sur l'homeomorphisme de deux figures et de leurs
voisinages",
journal = "J. Math., Ser. 8",
volume = 4,
year = 1921,
pages = "221--235"
}
@inproceedings{ag-iad5v-97,
author = "Fran{\c c}ois Anton and Christopher Gold",
title = "An Iterative Algorithm for the Determination of
{V}oronoi Vertices in Polygonal and Non--Polygonal
Domains",
booktitle = CCCG_1997,
year = 1997,
pages = "257--262"
}
@inproceedings{am-dldme-00,
author = "Fran{\c c}ois Anton and Darka Mioc",
title = "Dynamic {Laguerre} Diagrams Made Easy",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "10--13"
}
@inproceedings{asg-iadvv,
author = "Fran{\c c}ois Anton and J. Snoeyink and Christopher
Gold",
title = "An Iterative Algorithm for the Determination of
{Voronoi} Vertices in Polygonal and Non-Polygonal
Domains on the Plane and the Sphere",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "33--35"
}
@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"
}
@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 = "??"
}
@phdthesis{a-ccra-93,
author = "Y. Aoki",
title = "The combinatorial complexity of reconstructing
arrangements",
school = "Department of Information Science, University of
Tokyo",
year = 1993,
keywords = "doctoral thesis"
}
@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 = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "72--82"
}
@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 = SOCG_1990,
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,
year = 1990,
pages = "177--186",
note = "Proc. Sympos. Algorithms and Comput. Complexity",
keywords = "on-line algorithms, convex, location, Voronoi
diagram"
}
@inproceedings{aik-vspca-89,
author = "H. Aonuma and H. Imai and Y. Kambayashi",
title = "A Visual System of Placing Characters Appropriately
in Multimedia Map Databases",
booktitle = "Visual Database Systems",
publisher = "North-Holland",
year = 1989,
pages = "525--546",
note = "Proc. IFIP TC2/WG2.6 Working Conf. Visual Database
Syst."
}
@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"
}
@book{a-iant-76,
author = "T. M. Apostol",
title = "Introduction to Analytic Number Theory",
publisher = "Springer-Verlag",
year = 1976
}
@article{aalm-epase-90,
author = "A. Apostolico and M. J. Atallah and L. L. Larmore
and H. S. McFaddin",
title = "Efficient parallel algorithms for string editing and
related problems",
journal = SICOMP,
volume = 19,
number = 5,
year = 1990,
pages = "968--988"
}
@article{ah-fmcca-88,
author = "A. Apostolico and S. E. Hambrusch",
title = "Finding maximal cliques of circular-arc graphs",
journal = IPL,
volume = 26,
number = 4,
year = 1988,
pages = "209--215",
keywords = "circular-arc graph, geometric graphs, clique"
}
@article{as-lce-73,
author = "G. Appa and C. Smith",
title = "On {$L_{1}$} and {Chebyshev} estimation",
journal = "Math. Program.",
volume = 5,
year = 1973,
pages = "73--87"
}
@inproceedings{a-nqimr-67,
author = "A. Appel",
title = "The notion of quantitative invisibility and the
machine rendering of solids",
booktitle = "Proc. ACM National Conference",
year = 1967,
pages = "367--393"
}
@article{aw-dtdch-76,
author = "A. Appel and P. M. Will",
title = "Determining the three-dimensional convex hull of a
polyhedron",
journal = "IBM J. Res. Develop.",
volume = 20,
year = 1976,
pages = "590--611"
}
@article{ah-epmfc-77,
author = "K. Appel and W. Haken",
title = "Every planar map is four colourable, Part {I}:
discharging",
journal = "Illinois J. Math.",
volume = 21,
year = 1977,
pages = "429--490"
}
@book{a-tdmrt-41,
author = "P. Appell",
title = "Trait{\'e} de M{\'e}canique Rationelle, Tome {I}:
Statique, Dynamique du Point",
edition = "6th",
publisher = "Gauthier-Villars",
year = 1941
}
@inproceedings{ak-levtg-91,
author = "D. Applegate and R. Kannan",
title = "Local expansion of vertex-transitive graphs and
random generation in finite groups",
booktitle = STOC_1991,
year = 1991,
pages = "164--174",
keywords = "approximation, volume, convex"
}
@inproceedings{at-qdbt-00,
author = "Sigal Ar and A. Tal",
title = "Query Driven {BSP} Trees",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "81--84"
}
@inproceedings{as-rst-89,
author = "C. Aragon and R. Seidel",
title = "Randomized search trees",
booktitle = FOCS_1989,
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"
}
@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"
}
@inproceedings{a-iacs-95,
author = "Eugen Ardeleanu",
title = "Intersection Algorithms: A Comparative Study",
booktitle = "Abstracts 11th European Workshop Comput. Geom.",
nickname = "CG '95",
site = "Linz",
publisher = "Universit{\"a}t Linz",
year = 1995,
pages = "43--46"
}
@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"
}
@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"
}
@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"
}
@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
}
@article{as-dwmqb-93,
author = "W. G. Aref and H. Samet",
title = "Decomposing a window into maximal quadtree blocks",
journal = "Acta Inform.",
volume = "??",
year = 1993,
note = "(also University of Maryland Computer Science
TR-2771)"
}
@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
}
@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)"
}
@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)"
}
@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)"
}
@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"
}
@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"
}
@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"
}
@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"
}
@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
}
@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"
}
@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"
}
@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
}
@inproceedings{a-btnto-95,
author = "L. Arge",
title = "The {Buffer} {Tree}: A New Technique for Optimal
{I/O}-Algorithms",
booktitle = WADS_1995,
nickname = "WADS '95",
site = "Kingston, Canada",
series = LNCS,
number = 955,
year = 1995,
pages = "334--345",
keywords = "external memory algorithms, data structures"
}
@inproceedings{aprsv-tpiea-98,
author = "L. Arge and O. Procopiuc and Sridhar Ramaswamy and
Torsten Suel and J. S. Vitter",
title = "Theory and Practice of {I/O}-Efficient Algorithms
for Multidimensional Batched Searching Problems",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "685--694"
}
@inproceedings{av-ioedp-00,
author = "L. Arge and Jan Vahrenhold",
title = "{I/O}-Efficient Dynamic Planar Point Location",
booktitle = SOCG_2000,
year = 2000,
pages = "191--200"
}
@inproceedings{avv-emapl-96,
author = "L. Arge and Darren Erik Vengroff and J. S. 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"
}
@inproceedings{av-oimem-96,
author = "L. Arge and J. S. Vitter",
title = "Optimal Interval Management in External Memory",
booktitle = FOCS_1996,
site = "Burlington, VT",
month = oct,
year = 1996,
pages = "560--569"
}
@inproceedings{amz-sbme-94,
author = "S. Arikati and A. Maheshwari and C. Zaroliagis",
title = "Saving Bits Made Easy",
booktitle = CCCG_1994,
year = 1994,
pages = "140--146"
}
@inproceedings{accdsz-psasp-96,
author = "Srinivasa Rao Arikati and Danny Z. Chen and L. Paul
Chew and Gautam Das and Michiel Smid and Christos
D. Zaroliagis",
title = "Planar Spanners and Approximate Shortest Path
Queries among Obstacles in the Plane",
editor = "Josep D{\'\i}az and Maria Serna",
booktitle = "Algorithms---ESA~'96, Fourth Annual European
Symposium",
site = "Barcelona, Spain",
series = LNCS,
volume = 1136,
publisher = "Springer-Verlag",
year = 1996,
pages = "514--528",
issn = "3-540-61680-2",
keywords = "two-point shortest path queries, fixed orientations,
geodesics"
}
@techreport{am-accgp-90,
author = "E. Arkin and J. Mitchell",
title = "Applications of combinatorics and computational
geometry to pattern recognition",
type = "Technical {Report}",
institution = "Cornell Univ.",
address = "Ithaca, NY",
year = 1990
}
@techreport{a-bih-88,
author = "E. M. Arkin",
title = "Beautification is hard",
type = "Technical {Report}",
number = 818,
institution = "School Oper. Res. Indust. Engrg., Cornell Univ.",
address = "Ithaca, NY",
year = 1988,
keywords = "clustering"
}
@techreport{abmmrss-tsp-93t,
author = "E. M. Arkin and P. Belleville and J. S. B. Mitchell
and D. M. Mount and K. Romanik and S. Salzberg and
D. Souvaine",
title = "Testing simple polygons",
number = "TR-93-14",
institution = "DIMACS",
month = apr,
year = 1993
}
@inproceedings{abmmrss-tsp-93,
author = "E. M. Arkin and P. Belleville and J. S. B. Mitchell
and D. M. Mount and K. Romanik and S. Salzberg and
D. Souvaine",
title = "Testing simple polygons",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "387--392",
keywords = "probing, point probes, testing, simple polygons"
}
@article{abmmrss-tsp-97,
author = "E. M. Arkin and P. Belleville and J. S. B. Mitchell
and D. M. Mount and K. Romanik and S. Salzberg and
D. Souvaine",
title = "Testing simple polygons",
journal = CGTA,
volume = 8,
year = 1997,
pages = "97--114",
keywords = "probing, point probes, testing, simple polygons"
}
@inproceedings{abfms-ftphwusr-01,
author = "E. M. Arkin and M. A. Bender and S. P. Fekete and
J. S. B. Mitchell and M. Skutella",
title = "The Freeze-Tag Problem: How to Wake Up a Swarm of
Robots",
booktitle = SODA_2002,
year = 2002,
note = "To appear"
}
@techreport{achkm-ecmcp-89,
author = "E. M. Arkin and L. P. Chew and D. P. Huttenlocher
and K. Kedem and J. S. B. Mitchell",
title = "An efficiently computable metric for comparing
polygonal shapes",
type = "Technical {Report}",
number = "TR 89-1007",
institution = "Dept. Comput. Sci., Cornell Univ.",
address = "Ithaca, NY",
month = may,
year = 1989
}
@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 = SODA_1990,
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"
}
@inproceedings{achmssy-omah-96,
author = "E. M. Arkin and Y.-J. Chiang and Martin Held and
J. S. B. Mitchell and V. Sacristan and Steven
S. Skiena and T.-C. Yang",
title = "On minimum-area hulls",
booktitle = ESA_1996,
series = LNCS,
volume = 1136,
publisher = "Springer-Verlag",
year = 1996,
pages = "334--348"
}
@article{achmssy-omah-98,
author = "E. M. Arkin and Y.-J. Chiang and Martin Held and
J. S. B. Mitchell and V. Sacristan and Steven
S. Skiena and T.-C. Yang",
title = "On minimum-area hulls",
journal = "Algorithmica",
volume = 21,
year = 1998,
pages = "119--136"
}
@inproceedings{acmsy-mst-97,
author = "E. M. Arkin and Y.-J. Chiang and J. S. B. Mitchell
and Steven S. Skiena and T. Yang",
title = "On the Maximum Scatter {TSP}",
booktitle = SODA_1997,
nickname = "SODA '97",
year = 1997,
pages = "211--220",
keywords = "TSP, MAX TSP, bottleneck TSP, approximation
algorithms"
}
@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 = SOCG_1989,
year = 1989,
pages = "334--343",
keywords = "path planning, monotonicity, assembly, visibility,
separability"
}
@techreport{afm-aalmm-97,
author = "E. M. Arkin and S{\'a}ndor P. Fekete and
J. S. B. Mitchell",
title = "Approximation Algorithms for Lawn Mowing and
Milling",
institution = "Mathematisches Institut, Universit{\"a}t zu
K{\"o}ln",
year = 1997,
url = "ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr97-255.ps.gz",
keywords = "NC machining, covering, TSP, TSP with neighborhoods,
approximation algorithms, NP-completeness, traveling
salesman problem, shortest paths, watchman routes,
lawn mowing, milling, NC machines; 68Q25, 68U05,
90C27, 90C28, 90C35",
abstract = "We study the problem of finding shortest tours/paths
for ``lawn mowing'' and ``milling'' problems: Given
a region in the plane, and given the shape of a
``cutter'' (typically, a circle or a square), find a
shortest tour/path for the cutter such that every
point within the region is covered by the cutter at
some position along the tour/path. In the milling
version of the problem, the cutter is constrained to
stay within the region. The milling problem arises
naturally in the area of automatic tool path
generation for NC pocket machining. The lawn mowing
problem arises in optical inspection, spray
painting, and optimal search planning. \par Both
problems are NP-hard in general. We give efficient
constant-factor approximation algorithms for both
problems. In particular, we give a
$(3+\epsilon)$-approximation algorithm for the lawn
mowing problem and a 2.5-approximation algorithm for
the milling problem. Furthermore, we give a simple
6/5-approximation algorithm for the TSP problem in
simple grid graphs, which leads to an
11/5-approximation algorithm for milling simple
rectilinear polygons."
}
@article{afm-aalmm-00,
author = "E. M. Arkin and S. P. Fekete and J. S. B. Mitchell",
title = "Approximation algorithms for lawn mowing and
milling",
journal = CGTA,
volume = 17,
year = 2000,
pages = "25--50"
}
@techreport{afm-aalm-95,
author = "E. M. Arkin and S{\'a}ndor P. Fekete and
J. S. B. Mitchell",
title = "Approximation algorithms for lawnmowing and milling",
type = "Report",
institution = "University at Stony Brook",
year = 1995,
keywords = "NC machining, covering, TSP, TSP with neighborhoods"
}
@inproceedings{afm-lp-93,
author = "E. M. Arkin and S{\'a}ndor P. Fekete and
J. S. B. Mitchell",
title = "The lawnmower problem",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "461--466"
}
@inproceedings{afms-mpsms-01,
author = "E. M. Arkin and S{\'a}ndor P. Fekete and
J. S. B. Mitchell and Steven S. Skiena",
title = "On the Manufacturability of Paperclips and Sheet
Metal Structures",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "187--190"
}
@inproceedings{agmmps-ppdtg-93,
author = "E. M. Arkin and Michael T. Goodrich and
J. S. B. Mitchell and D. M. 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 = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "95--106"
}
@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 = SOCG_1991,
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))$."
}
@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"
}
@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 = DCG,
volume = 13,
year = 1995,
pages = "257--270"
}
@techreport{ah-aagcs-91,
author = "E. M. Arkin and R. Hassin",
title = "Approximation Algorithms for the Geometric Covering
Salesman Problem",
type = "Technical Report",
number = 968,
institution = "School of Operations Research and Industrial
Engineering, Cornell University",
month = jul,
year = 1991
}
@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"
}
@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"
}
@inproceedings{ahm-madcg-95,
author = "E. M. Arkin and Martin 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 = oct,
year = 1995,
pages = "29--36"
}
@inproceedings{ahms-htfr-94,
author = "E. M. Arkin and Martin Held and J. S. B. Mitchell
and Steven S. Skiena",
title = "Hamiltonian Triangulations for Fast Rendering",
editor = "J. van Leeuwen",
booktitle = "Algorithms -- ESA'94",
site = "Utrecht, NL",
series = LNCS,
volume = 855,
month = sep,
year = 1994,
pages = "36--47",
keywords = "triangulation, tri-strips, mesh generation,
rendering, sequential triangulation, ribbons"
}
@article{ahms-htfr-96,
author = "E. M. Arkin and Martin Held and J. S. B. Mitchell
and Steven S. Skiena",
title = "Hamiltonian Triangulations for Fast Rendering",
journal = "Visual Comput.",
volume = 12,
number = 9,
year = 1996,
pages = "429--444",
keywords = "triangulation, tri-strips, mesh generation,
rendering, sequential triangulation, ribbons"
}
@inproceedings{ahms-rppwm-95,
author = "E. M. Arkin and Martin Held and J. S. B. Mitchell
and Steven S. Skiena",
title = "Recognizing Polygonal Parts from Width Measurements",
booktitle = CCCG_1995,
year = 1995,
pages = "199--204"
}
@article{ahms-rppwm-98,
author = "E. M. Arkin and Martin Held and J. S. B. Mitchell
and Steven S. Skiena",
title = "Recognizing Polygonal Parts from Width Measurements",
journal = CGTA,
volume = 9,
number = 4,
year = 1998,
pages = "237--246"
}
@techreport{ahs-oprzp-95,
author = "E. M. Arkin and Martin Held and C. L. Smith",
title = "Optimization problems related to zigzag pocket
machining",
type = "Manuscript",
institution = "Department of Applied Mathematics, SUNY Stony Brook,
NY",
year = 1995
}
@inproceedings{ahs-oprzp-96,
author = "E. M. Arkin and Martin Held and Christopher
L. Smith",
title = "Optimization problems related to zigzag pocket
machining",
booktitle = SODA_1996,
year = 1996,
pages = "419--428",
keywords = "CAD, NC-machining, milling, lawnmower problem,
retractions, approximation, NP-hardness"
}
@inproceedings{ahs-oprzp-96c,
author = "E. M. Arkin and Martin Held and Christopher
L. Smith",
title = "Optimization Problems Related to Zigzag Pocket
Machining",
booktitle = "Abstracts 12th European Workshop Comput. Geom.",
nickname = "CG '96",
site = "M{\"u}nster",
publisher = "Universit{\"a}t M{\"u}nster",
year = 1996,
pages = "109--111"
}
@article{ahs-oprzp-00,
author = "E. M. Arkin and M. Held and C. L. Smith",
title = "Optimization Problems Related to Zigzag Pocket
Machining",
journal = "Algorithmica",
volume = 26,
number = 2,
year = 2000,
pages = "197--236"
}
@inproceedings{ahmss-00,
author = "E. M. Arkin and F. Hurtado and J. S. B. Mitchell and
C. Seara and S. S. Skiena",
title = "Some Separability Problems in the Plane",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "51--54"
}
@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 = SODA_1991,
year = 1991,
pages = "42--51",
keywords = "matching, similarity"
}
@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",
annote = "Special issue on computational geometry; J. Mitchell
and J. Karel Lenstra, eds."
}
@inproceedings{akm-gkp-91,
author = "E. M. Arkin and S. Khuller and J. S. B. Mitchell",
title = "Geometric knapsack problems",
booktitle = WADS_1991,
series = LNCS,
volume = 519,
publisher = "Springer-Verlag",
year = 1991,
pages = "165--176"
}
@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"
}
@inproceedings{akm-oep-89,
author = "E. M. Arkin and S. Khuller and J. S. B. Mitchell",
title = "Optimal enclosure problems",
booktitle = CCCG_1989,
year = 1989,
pages = 36,
keywords = "partitioning, enclosure, knapsack, optimization"
}
@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 = SOCG_1993,
year = 1993,
pages = "369--378"
}
@article{ammrs-dtgm-98,
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",
journal = IJCGA,
volume = 8,
year = 1998,
pages = "343--364"
}
@techreport{am-ovasp-87,
author = "E. M. 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{amn-rcgno-98,
author = "E. M. Arkin and J. S. B. Mitchell and Giri
Narasimhan",
title = "Resource-Constrained Geometric Network Optimization",
booktitle = SOCG_1998,
year = 1998,
pages = "307--316",
keywords = "orienteering, generalized TSP, bank robber problem,
approximation algorithms, guillotine subdivisions"
}
@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
}
@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 = CCCG_1991,
year = 1991,
pages = "153--156"
}
@unpublished{amp-gbpp-90,
author = "E. M. Arkin and J. S. B. Mitchell and C. D. Piatko",
title = "Geometric Bicriteria Path Problems",
year = 1990,
note = "Manuscript in Preparation"
}
@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 = IJCGA,
volume = 5,
number = 4,
year = 1995,
pages = "369--395",
keywords = "link distance, shortest paths, geodesic paths"
}
@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 = SODA_1992,
year = 1992,
pages = "269--279"
}
@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"
}
@article{ate-plcsl-89,
author = "D. Armitage and J. I. Thakara and W. D. Eades",
title = "Photoaddressed liquid crystal spatial light
modulators",
journal = "Appl. Optics",
volume = 28,
number = 22,
year = 1989,
pages = "4763--4771"
}
@inproceedings{ar-dsa-93,
author = "D. Armon and J. H. Reif",
title = "A Dynamic Separator Algorithm",
booktitle = "Proc. 3rd Workshop Algorithms Data Struct.",
series = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "107--118"
}
@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"
}
@phdthesis{a-sagni-82,
author = "G. T. Armstrong",
title = "A Study of Automatic Generation of Non-Invasive
Machine Paths from Geometric Models",
school = "Univ. Leeds",
address = "Leeds, UK",
month = oct,
year = 1982,
keywords = "doctoral thesis"
}
@incollection{acp-ncggm-84,
author = "G. T. Armstrong and G. C. Carey and A. de
Pennington",
title = "Numerical Code Generation from a Geometric Modeling
System",
editor = "M. S. Pickett and J. W. Boyse",
booktitle = "Solid Modeling by Computers: {From} Theory to
Applications",
publisher = "Plenum Press",
address = "Ne York, NY",
year = 1984
}
@book{a-bt-79,
author = "M. A. Armstrong",
title = "Basic Topology",
publisher = "McGraw-Hill",
address = "London, UK",
year = 1979
}
@article{acp-cfekt-87,
author = "S. Arnborg and D. G. Corneil and A. Proskurowski",
title = "Complexity of finding embeddings in a $k$-tree",
journal = "SIAM J. Algebraic Discrete Methods",
volume = 8,
year = 1987,
pages = "277--284"
}
@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"
}
@article{ap-crp3t-86,
author = "S. Arnborg and A. Proskurowski",
title = "Characterization and recognition of partial
$3$-trees",
journal = "SIAM J. Algebraic Discrete Methods",
volume = 7,
year = 1986,
pages = "305--314"
}
@article{am-uvtps-84,
author = "D. B. Arnold and W. J. Milne",
title = "The use of {Voronoi} tessellations in processing
soil survey results",
journal = "IEEE Comput. Graph. Appl.",
volume = 4,
year = 1984,
pages = "22--28",
keywords = "application, Voronoi diagrams, subdivision"
}
@book{ag-jpl-96,
author = "K. Arnold and J. Gosling",
title = "The Java Programming Language",
publisher = "Addison-Wesley",
address = "Reading, MA",
year = 1996
}
@article{a-sicp-80,
author = "V. I. Arnold",
title = "Statistics of integral convex polytopes",
journal = "Functional Anal. Appl.",
volume = 14,
year = 1980,
pages = "1--3"
}
@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"
}
@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"
}
@book{ab-arag-88,
title = "Algorithms in Real Algebraic Geometry",
editor = "D. S. Arnon and B. Buchberger",
volume = "5/1, 2",
publisher = "??",
year = 1988,
note = "Special issue of the Journal of Symbolic
Computation"
}
@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"
}
@article{acm-cad1b-84,
author = "D. S. Arnon and G. E. Collins and S. {McCallum}",
title = "Cylindrical algebraic decomposition {I}: {The} basic
algorithm",
journal = SICOMP,
volume = 13,
number = 4,
year = 1984,
pages = "865--877",
keywords = "algebraic geometry, motion planning"
}
@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 = SICOMP,
volume = 13,
number = 4,
year = 1984,
pages = "878--889",
keywords = "algebraic geometry, motion planning"
}
@unpublished{a-lbvdc-98,
author = "B. Aronov",
title = "A lower bound on {Voronoi} diagram complexity",
year = 1998,
note = "unpublished manuscript"
}
@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 = SOCG_1987,
year = 1987,
pages = "39--49",
keywords = "geodesic distance, Voronoi diagram, simple polygon,
shortest path"
}
@article{a-gvdps-89,
author = "B. 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",
abstract = "Given a simple polygon with $n$ sides in the plane
and a set of $k$ point ``sites'' in its interior or
on the boundary, compute the Voronoi diagram of the
set of sites using the internal ``geodesic''
distance inside the polygon as the metric. We
describe an $O((n+k)\log(n+k)\log n )$-time
algorithm for solving this problem and sketch a
faster $O((n+k)\log(n+k))$ algorithm for the case
when the set of sites includes all reflex vertices
of the polygon in question."
}
@inproceedings{aas-lalsp-97,
author = "B. Aronov and P. K. Agarwal and M. Sharir",
title = "On Levels in Arrangements of Lines, Segments,
Planes, and Triangles",
booktitle = SOCG_1997,
year = 1997,
pages = "30--38"
}
@inproceedings{abssv-mpmr-98,
author = "B. Aronov and M. de Berg and A. F. van der Stappen
and O. \v{S}vestka and J. Vleugels",
title = "Motion planning for multiple robots",
booktitle = SOCG_1998,
year = 1998,
pages = "374--382"
}
@article{advsv-mpmr-99,
author = "B. Aronov and M. de Berg and A. F. van der Stappen
and P. {\v S}vestka and J. Vleugels",
title = "Motion Planning for Multiple Robots",
journal = DCG,
volume = 22,
number = 4,
year = 1999,
pages = "505--525"
}
@unpublished{abe-acp-95,
author = "B. Aronov and M. Bern and D. Eppstein",
title = "Arrangements of convex polytopes",
year = 1995,
note = "unpublished manuscript"
}
%, number = 1
@article{abe-nm1st-94,
author = "B. Aronov and M. Bern and D. Eppstein",
title = "On the Number of Minimal {1-Steiner} Trees",
journal = DCG,
volume = 12,
year = 1994,
pages = "29--34"
}
@techreport{abe-ap1sp-91,
author = "B. Aronov and M. Bern and D. Epstein",
title = "Arrangement of polytopes and the $1$-{Steiner}
problem",
type = "Preprint",
institution = "??",
year = 1991
}
@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 = SOCG_1990,
year = 1990,
pages = "112--115",
keywords = "combinatorial geometry, halving sets, $k$-sets"
}
@article{acegsw-ptphp-91,
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",
journal = DCG,
volume = 6,
year = 1991,
pages = "435--442",
keywords = "combinatorial geometry, halving sets, $k$-sets",
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 = "B. Aronov and Alan R. Davis and T. K. Dey and
Sudebkumar P. Pal and D. Chithra Prasad",
title = "Visibility with Multiple Reflections",
booktitle = SWAT_1996,
series = LNCS,
volume = 1097,
publisher = "Springer-Verlag",
year = 1996,
pages = "284--295"
}
%% Edited this from addpp-vmr in old version of geombib--was completely wrong!
%% Yes, the names are abbreviated like that in DCG version. --BA
@article{addpp-vmr-98,
author = "B. Aronov and A. R. Davis and T. K. Dey and
S. P. Pal and D. C. Prasad",
title = "Visibility with Multiple Reflections",
journal = DCG,
volume = 20,
year = 1998,
pages = "61--78"
}
@article{addpp-vor-98,
author = "B. Aronov and A. R. Davis and T. K. Dey and
S. P. Pal and D. C. Prasad",
title = "Visibility with One Reflection",
journal = DCG,
volume = 19,
year = 1998,
pages = "553--574"
}
@inproceedings{addpp-vr-95,
author = "B. Aronov and Alan R. Davis and T. K. Dey and
Sudebkumar P. Pal and D. Chithra Prasad",
title = "Visibility with Reflection",
booktitle = SOCG_1995,
year = 1995,
pages = "316--325",
keywords = "mirrors"
}
@techreport{aegs-ibcmf-89,
author = "B. Aronov and H. Edelsbrunner and L. J. 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"
}
@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",
keywords = "combinatorial geometry, combinatorial complexity,
arrangements, complexity of faces, random sampling"
}
@techreport{aegs-nemfl-90,
author = "B. Aronov and H. Edelsbrunner and L. J. 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"
}
@inproceedings{aehs-nrvuj-98,
author = "B. Aronov and A. Efrat and D. Halperin and
M. Sharir",
title = "On the Number of Regular Vertices of the Union of
{Jordan} Regions",
booktitle = SWAT_1998,
nickname = "SWAT '98",
site = "Stockholm",
series = LNCS,
volume = 1432,
publisher = "Springer-Verlag",
year = 1998,
pages = "322--334"
}
@techreport{aes-sbnrv-97,
author = "B. Aronov and A. Efrat and M. Sharir",
title = "A Subquadratic Bound on the Number of Regular
Vertices of the Union of {Jordan} Regions",
type = "Manuscript",
institution = "Tel Aviv University",
year = 1997
}
@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 = SOCG_1991,
year = 1991,
pages = "351--356",
keywords = "partition"
}
@article{aegkkps-cf-94,
author = "B. Aronov and P. Erd{\H o}s and W. Goddard and
D. J. Kleitman and M. Klugerman and J. Pach and
L. J. Schulman",
title = "Crossing families",
journal = "Combinatorica",
volume = 14,
year = 1994,
pages = "127--134",
keywords = "partition"
}
@inproceedings{af-acrsm-97,
author = "B. Aronov and S. Fortune",
title = "Average-Case Ray Shooting and Minimum Weight
Triangulations",
booktitle = SOCG_1997,
year = 1997,
pages = "203--211"
}
@unpublished{afw-msm-87,
author = "B. Aronov and S. Fortune and G. Wilfong",
title = "Minimum speed motion",
year = 1987,
note = "??"
}
@article{afw-fsgvd-93,
author = "B. Aronov and S. J. Fortune and G. Wilfong",
title = "Furthest-Site Geodesic {Voronoi} Diagram",
journal = DCG,
volume = 9,
year = 1993,
pages = "217--255",
keywords = "geodesic distance, simple polygon, Voronoi diagram",
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 = SOCG_1988,
year = 1988,
pages = "229--240",
keywords = "geodesic distance, simple polygon, Voronoi diagram"
}
@unpublished{agpw-tinhn-,
author = "B. Aronov and J. E. Goodman and R. Pollack",
title = "There is no {Hadwiger} number for line traversals in
higher dimensions",
note = "Unpublished Manuscript"
}
@inproceedings{agpw-httht-00,
author = "B. Aronov and J. E. Goodman and Richard Pollack and
R. Wenger",
title = "A {Helly}-Type Theorem for Hyperplane Transversals
to Well-Separated Convex Sets",
booktitle = SOCG_2000,
year = 2000,
pages = "57--63"
}
% issue number 1
@article{am-stl3s-95,
author = "B. Aronov and J. Matou{\v s}ek",
title = "On stabbing triangles by lines in 3-space",
journal = "Comment. Math. Univ. Carolinae",
volume = 36,
year = 1995,
pages = "109--113"
}
@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 = SOCG_1991,
year = 1991,
pages = "307--313",
keywords = "combinatorial geometry, combinatorial complexity,
arrangements, polytopes, hyperplanes",
comments = "To appear in {\em Journal Combin. Theory Ser. A}"
}
@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"
}
@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 = DCG,
volume = 10,
year = 1993,
pages = "421--425"
}
@techreport{ao-ampps-87,
author = "B. Aronov and C. {\'O}'D{\'u}nlaing",
title = "Analysis of the motion-planning problem for a simple
two-link planar arm",
type = "Report",
number = 314,
institution = "Dept. Comput. Sci., New York Univ.",
address = "New York, NY",
month = aug,
year = 1987,
keywords = "motion planning, configuration space"
}
@techreport{ao-nsu-91t,
author = "B. Aronov and J. O'Rourke",
title = "Nonoverlap of the star unfolding",
type = "Technical {Report}",
number = 002,
institution = "Smith College",
address = "Northampton, MA",
month = mar,
year = 1991
}
@inproceedings{ao-nsu-91,
author = "B. Aronov and J. O'Rourke",
title = "Nonoverlap of the star unfolding",
booktitle = SOCG_1991,
year = 1991,
pages = "105--114",
keywords = "polytopes, shortest paths, Voronoi diagrams, edge
sequences"
}
@article{ao-nsu-92,
author = "B. Aronov and J. O'Rourke",
title = "Nonoverlap of the star unfolding",
journal = DCG,
volume = 8,
year = 1992,
pages = "219--250",
keywords = "polytopes, shortest paths, Voronoi diagrams, edge
sequences"
}
@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 = DCG,
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)"
}
@article{ass-ctsp-93,
author = "B. Aronov and R. Seidel and D. Souvaine",
title = "On compatible triangulations of simple polygons",
journal = CGTA,
volume = 3,
number = 1,
year = 1993,
pages = "27--35",
keywords = "polygon, triagulation"
}
@inproceedings{as-car-92,
author = "B. Aronov and M. Sharir",
title = "Castles in the air revisited",
booktitle = SOCG_1992,
year = 1992,
pages = "146--156",
keywords = "combinatorial geometry, combinatorial complexity,
simplex arrangements, popularity, excess"
}
%, number = 2
%, month = sep
@article{as-car-94,
author = "B. Aronov and M. Sharir",
title = "Castles in the air revisited",
journal = DCG,
volume = 12,
year = 1994,
pages = "119--150",
keywords = "combinatorial geometry, combinatorial complexity,
simplex arrangements, popularity, excess"
}
@inproceedings{as-ccpsi-01,
author = "B. Aronov and M. Sharir",
title = "Cutting Circles into Pseudo-Segments and Improved
Bounds for Incidences",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "66--69"
}
@unpublished{as-cscas-,
author = "B. Aronov and M. Sharir",
title = "On the complexity of a single cell in an arrangement
of simplices in $d$-space",
note = "In preparation"
}
@techreport{as-cocat-91,
author = "B. Aronov and M. Sharir",
title = "On the complexity of one cell in an arrangement of
triangles",
type = "Manuscript",
year = 1991
}
@inproceedings{as-zsha-91,
author = "B. Aronov and M. Sharir",
title = "On the zone of a surface in a hyperplane
arrangement",
booktitle = WADS_1991,
series = LNCS,
volume = 519,
publisher = "Springer-Verlag",
year = 1991,
pages = "13--19",
keywords = "arrangements, hyperplanes"
}
@techreport{as-zasha-91,
author = "B. Aronov and M. Sharir",
title = "On the Zone of an Algebraic Surface in a Hyperplane
Arrangement",
type = "Manuscript",
year = 1991
}
@inproceedings{as-tmp3s-94,
author = "B. Aronov and M. Sharir",
title = "On Translational Motion Planning in $3$-Space",
booktitle = SOCG_1994,
year = 1994,
pages = "21--30"
}
% number = 6
% month = dec
@article{as-tmpcp-97,
author = "B. Aronov and M. Sharir",
title = "On Translational Motion Planning of a Convex
Polyhedron in $3$-Space",
journal = SICOMP,
volume = 26,
year = 1997,
pages = "1785--1803"
}
@techreport{as-cecpp-94,
author = "B. Aronov and M. Sharir",
title = "The common exterior of convex polygons in the plane",
type = "Manuscript",
institution = "??",
year = 1994
}
@article{as-cecpp-97,
author = "B. Aronov and M. Sharir",
title = "The common exterior of convex polygons in the plane",
journal = CGTA,
volume = 8,
year = 1997,
pages = "139--149"
}
@inproceedings{as-ucptd-93,
author = "B. Aronov and M. Sharir",
title = "The Union of Convex Polyhedra in Three Dimensions",
booktitle = FOCS_1993,
nickname = "FOCS '93",
year = 1993,
pages = "518--527"
}
@techreport{as-tsbac-87,
author = "B. Aronov and M. Sharir",
title = "Triangles in space, or building and analyzing
castles in the air",
type = "Manuscript",
institution = "??",
year = 1987
}
@inproceedings{as-tsbac-88,
author = "B. Aronov and M. Sharir",
title = "Triangles in space or building (and analyzing)
castles in the air",
booktitle = SOCG_1988,
year = 1988,
pages = "381--391",
keywords = "three-dimensional, triangle arrangements"
}
@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"
}
% number = 6
% month = dec
@article{ast-ucptd-97,
author = "B. Aronov and M. Sharir and Boaz Tagansky",
title = "The Union of Convex Polyhedra in Three Dimensions",
journal = SICOMP,
volume = 26,
year = 1997,
pages = "1670--1688"
}
@article{a-efslc-67,
author = "G. Aronsson",
title = "Extensions of functions satisfying {Lipschitz}
conditions",
journal = "Arkiv f{\"o}r Matematik",
volume = 28,
year = 1967,
pages = "551--561"
}
@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"
}
@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"
}
@inproceedings{a-nltas-97,
author = "S. Arora",
title = "Nearly Linear Time Approximation Schemes for
{Euclidean} {TSP} and Other Geometric Problems",
booktitle = FOCS_1997,
nickname = "FOCS '97",
year = 1997,
pages = "554--563"
}
@article{a-ptase-98,
author = "Sanjeev Arora",
title = "Polynomial time approximation schemes for
{Euclidean} traveling salesman and other geometric
problems",
journal = JACM,
volume = 45,
number = 5,
year = 1998,
pages = "753--782"
}
@inproceedings{a-ptase-96,
author = "Sanjeev Arora",
title = "Polynomial time approximation schemes for
{Euclidean} {TSP} and other geometric problems",
booktitle = FOCS_1996,
year = 1996,
pages = "2--11"
}
@inproceedings{abss-haolc-93,
author = "Sanjeev Arora and L. Babai and J. Stern and
Z. Sweedyk",
title = "The Hardness of Approximate Optima in Lattices,
Codes, and Systems of Linear Equations",
booktitle = FOCS_1993,
nickname = "FOCS '93",
year = 1993,
pages = "724--733"
}
@inproceedings{agkkw-ptasw-98,
author = "Sanjeev Arora and Michelangelo Grigni and David
Karger and Philip Klein and Andrzej Woloszyn",
title = "A Polynomial-Time Approximation Scheme for Weighted
Planar Graph {TSP}",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "33--41",
comments = "running time {$n^{O(1/\epsilon^2)}$}"
}
@incollection{al-ha-97,
author = "Sanjeev Arora and Carsten Lund",
title = "Hardness of approximations",
editor = "D. S. Hochbaum",
booktitle = "Approximation Algorithms for NP-Hard Problems",
publisher = "PWS Publishing Company",
address = "Boston, MA",
year = 1997,
pages = "399--446"
}
@techreport{almss-iap-92,
author = "S. Arora and C. Lund and R. Motwani and M. Sudan and
M. Szegedy",
title = "On the Intractability of Approximation Problems",
type = "Manuscript",
institution = "??",
year = 1992
}
@inproceedings{arr-asekm-98,
author = "Sanjeev Arora and Prabhakar Raghavan and Satish Rao",
title = "Approximation schemes for {Euclidean} $k$-median and
related problems",
booktitle = STOC_1998,
year = 1998,
pages = "106--113"
}
@inproceedings{arr-ptase-98,
author = "S. Arora and P. Raghavan and S. Rao",
title = "Polynomial time approximation schemes for the
{Euclidean} {$k$}-medians problem",
booktitle = STOC_1998,
year = 1998,
pages = "to appear"
}
@inproceedings{ak-mdspl-89,
author = "D. Arqu{\`e}s and P. Koch",
title = "Mod{\'e}lisation de solides par les pavages",
booktitle = "Proc. of Pixim '89",
site = "Paris, France",
month = sep,
year = 1989,
pages = "47--61"
}
@book{a-ocds-89,
title = "Optical Computing: Digital and Symbolic",
editor = "R. Arrathoon",
publisher = "Marcel Dekker, Inc.",
year = 1989,
keywords = "angular resolution"
}
@book{as-dsdem-92,
author = "D. K. Arrowsmith and C. M. Smith",
title = "Dynamical Systems. Differential Equations, Maps, and
Chaotic Behavior",
publisher = "Chapman and Hall",
address = "London",
year = 1992
}
@article{afh-tdie3-81,
author = "E. Artzy and G. Frieder and G. T. Herman",
title = "The theory, design, implementation, and evaluation
of $3$-d surface detection algorithms",
journal = "Comput. Graph. Image Process.",
volume = 15,
year = 1981,
pages = "1--24"
}
@article{ahb-lsft3-87,
author = "K. S. Arun and T. S. Huang and S. D. Blostein",
title = "Least squares fitting of two $3$-d point sets",
journal = "IEEE Trans. Pattern Anal. Mach. Intell.",
volume = "PAMI-9",
number = 5,
month = sep,
year = 1987
}
@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 = "??"
}
@book{a-gg2-91,
title = "Graphics Gems {II}",
editor = "James Arvo",
publisher = "Academic Press",
address = "Boston, MA",
year = 1991
}
@incollection{a-rrm-91,
author = "J. Arvo",
title = "Random rotation matrics",
editor = "J. Arvo",
booktitle = "Graphics Gems II",
publisher = "Academic Press",
address = "Boston, MA",
year = 1991,
pages = "355--356"
}
@article{a-ijpop-94,
author = "J. Arvo",
title = "The irradiance {Jacobian} for partially occluded
polyhedral sources",
journal = "Comput. Graph.",
volume = "??",
year = 1994,
pages = "343--350",
note = SIGGRAPH_1994
}
@inproceedings{ak-frtrc-87,
author = "J. Arvo and D. Kirk",
title = "Fast ray tracing by ray classification",
editor = "M. C. Stone",
booktitle = "Proc. SIGGRAPH '87",
year = 1987,
pages = "55--63"
}
@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"
}
@inproceedings{acm-aamtm-98,
author = "S. Arya and S.-W. Cheng and D. M. Mount",
title = "Approximation Algorithms for Multiple-Tool Milling",
booktitle = SOCG_1998,
year = 1998,
pages = "to appear"
}
@article{acm-aamtm-01,
author = "S. Arya and S.-W. Cheng and D. M. Mount",
title = "Approximation Algorithm for Multiple-Tool Milling",
journal = IJCGA,
volume = 11,
year = 2001,
pages = "339--372"
}
@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 = STOC_1995,
nickname = "STOC '95",
year = 1995,
pages = "489--498"
}
@inproceedings{amn-abenn-95,
author = "S. Arya and D. M. Mount and O. Narayan",
title = "Accounting for Boundary Effects in Nearest Neighbor
Searching",
booktitle = SOCG_1995,
year = 1995,
pages = "336--344",
keywords = ""
}
@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"
}
@inproceedings{am-annqf-93,
author = "S. Arya and D. M. Mount",
title = "Approximate Nearest Neighbor Queries in Fixed
Dimensions",
booktitle = SODA_1993,
year = 1993,
pages = "271--280"
}
@inproceedings{am-ars-95,
author = "S. Arya and David M. Mount",
title = "Approximate Range Searching",
booktitle = SOCG_1995,
year = 1995,
pages = "172--181",
keywords = "quadtrees, box decomposition trees"
}
@article{am-ars-00,
author = "S. Arya and D. M. Mount",
title = "Approximate range searching",
journal = CGTA,
volume = 17,
year = 2000,
pages = "135--152"
}
@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
}
@article{amn-abenn-96,
author = "S. Arya and D. M. Mount and O. Narayan",
title = "Accounting for boundary effects in nearest-neighbor
searching",
journal = DCG,
volume = 16,
year = 1996,
pages = "155--176"
}
@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 = SODA_1994,
year = 1994,
pages = "573--582"
}
@article{amnsw-oaann-98,
author = "S. Arya and D. M. Mount and N. S. Netanyahu and
R. Silverman and A. Wu",
title = "An optimal algorithm for approximate nearest
neighbor searching in fixed dimensions",
journal = JACM,
volume = 45,
year = 1998,
pages = "891--923"
}
@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
}
@article{ams-dagss-99,
author = "S. Arya and D. M. Mount and M. Smid",
title = "Dynamic algorithms for geometric spanners of small
diameter: {Randomized} solutions",
journal = CGTA,
volume = 13,
year = 1999,
pages = "91--107"
}
@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 = FOCS_1994,
year = 1994,
pages = "703--712"
}
@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
}
@inproceedings{as-ecbds-94i,
author = "S. Arya and M. Smid",
title = "Efficient construction of a bounded degree spanner
with low weight",
booktitle = ESA_1994,
nickname = "ESA '94",
series = LNCS,
volume = 855,
publisher = "Springer-Verlag",
year = 1994,
pages = "48--59"
}
@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"
}
@article{ab-kawff-85,
author = "H. Asada and A. B. By",
title = "Kinematic analysis of workpart fixturing for
flexible assembly with automatically reconfigurable
fixtures",
journal = "Internat. J. Robot. Autom.",
volume = "RA-1",
number = 2,
month = jun,
year = 1985
}
@book{as-rac-86,
author = "H. Asada and J.-J. E. Slotine",
title = "Robot Analysis and Control",
publisher = "John Wiley \& Sons",
address = "New York, NY",
year = 1986
}
@techreport{a-fafmw-90,
author = "T. Asano",
title = "A faster algorithm for finding a maximum weight
clique of a circular-arc graph",
number = "90624--OR",
institution = "??",
address = "Bonn",
year = 1990,
keywords = "circular-arc graph"
}
@techreport{a-oafmc-89,
author = "T. Asano",
title = "An optimal algorithm for finding a minimal clique
covering of a circular-arc graph",
number = "89619--OR",
institution = "??",
address = "Bonn",
year = 1989,
keywords = "circular-arc graph"
}
@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"
}
@unpublished{a-eafvp,
author = "T. Asano",
title = "Efficient algorithms for finding the visibility
polygon for a polygonal region with holes",
note = "Manuscript, University of California at Berkeley"
}
@inproceedings{a-rcilw-94,
author = "T. Asano",
title = "Reporting and Counting Intersections of Lines within
a Polygon",
booktitle = ISAAC_1994,
nickname = "ISAAC '94",
site = "Beijing, China",
series = LNCS,
volume = 834,
publisher = "Springer-Verlag",
year = 1994,
pages = "652--659"
}
@article{ackt-eaobi-01,
author = "T. Asano and D. Z. Chen and N. Katoh and
T. Tokuyama",
title = "Efficient algorithms for optimization-based image
segmentation",
journal = IJCGA,
volume = 11,
year = 2001,
pages = "145--166"
}
@inproceedings{ak-nthld-93,
author = "T. Asano and N. Katoh",
title = "Number theory helps line detection in digital
images",
booktitle = ISAAC_1993,
nickname = "ISAAC '93",
series = LNCS,
volume = 762,
publisher = "Springer-Verlag",
year = 1993,
pages = "313--322"
}
@article{ak-vhtld-96,
author = "T. Asano and N. Katoh",
title = "Variants for the {Hough} transform for line
direction",
journal = CGTA,
volume = 6,
year = 1996,
pages = "231--252"
}
@article{akt-usdfc-94,
author = "T. Asano and N. Katoh and T. Tokuyama",
title = "A Unified Scheme for Detecting Fundamental Curves in
Binary Edge Images",
journal = "SIGAL Technical Report of Inform
Process. Soc. Japan",
volume = "AL38-7",
year = 1994,
pages = "49--56"
}
@article{akt-usdfc-01,
author = "T. Asano and N. Katoh and T. Tokuyama",
title = "A Unified Scheme for Detecting Fundamental Curves in
Binary Edge Images",
journal = CGTA,
volume = 18,
year = 2001,
pages = "73--93"
}
@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 = LNCS,
volume = 911,
publisher = "Springer-Verlag",
year = 1995,
pages = "36--48"
}
@incollection{at-cpabg-93,
author = "T. Asano and T. Tokuyama",
title = "Circuit Partitioning Algorithm Based on Geometry
Model",
editor = "M. Sarrafzadeh and D. T. Lee",
booktitle = "Algorithmic Aspects of VLSI Layout",
series = "Lecture Notes Series on Computing",
volume = 2,
publisher = "World Scientific",
year = 1993,
pages = "199--212"
}
@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
}
@inproceedings{at-twr-94,
author = "T. Asano and T. Tokuyama",
title = "Topological Walk Revisited",
booktitle = CCCG_1994,
year = 1994,
pages = "1--6"
}
@inproceedings{a-dpi-91,
author = "Ta. Asano",
title = "Dynamic Programming on Intervals",
booktitle = "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms",
series = LNCS,
volume = 557,
publisher = "Springer-Verlag",
year = 1991,
pages = "199--207"
}
@article{a-dpi-93,
author = "Ta. Asano",
title = "Dynamic Programming on Intervals",
journal = IJCGA,
volume = 3,
year = 1993,
pages = "323--330",
keywords = "Circular-arc graph, clique, dynamic programming,
interval graph, segment tree, sequential partition"
}
@inproceedings{aa-mpprt-83,
author = "Ta. Asano and Te. Asano",
title = "Minimum partition of polygonal regions into
trapezoids",
booktitle = FOCS_1983,
year = 1983,
pages = "233--241"
}
@inproceedings{aa-vdpsp-87,
author = "Ta. Asano and Te. Asano",
title = "{Voronoi} diagram for points in a simple polygon",
editor = "D. S. Johnson",
booktitle = "Discrete Algorithms and Complexity",
series = "Perspectives in Computing",
publisher = "Academic Press",
year = 1987,
pages = "51--64",
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. SICOMP
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"
}
@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"
}
@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 = FOCS_1985,
year = 1985,
pages = "155--164",
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 = JACM,
volume = 33,
year = 1986,
pages = "290--312",
keywords = "decomposition, approximation, dynamic programming,
polygon triangulation"
}
@article{aai-spbts-87,
author = "Ta. Asano and Te. Asano and H. Imai",
title = "Shortest path between two simple polygons",
journal = IPL,
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 = JALG,
volume = 7,
year = 1986,
pages = "221--231",
keywords = "lower bounds, design of algorithms, triangulation",
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"
}
@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 = "T. Asano",
title = "Generalized {Manhattan} path algorithm with
applications",
journal = "Comput. Aided Design",
volume = 7,
number = 7,
month = jul,
year = 1988,
pages = "797--804"
}
@article{a-gcvpr-86,
author = "Te. Asano",
title = "Generating and counting valid patterns in routes
between two points",
journal = "Graphs Combin.",
volume = 2,
year = 1986,
pages = "9--13",
keywords = "counting, VLSI design, path planning"
}
@article{a-mwprb-85,
author = "Te. Asano",
title = "On minimum width packing of rectilinear blocks",
journal = "Trans. IECE Japan",
volume = "E68",
year = 1985,
pages = "647--649",
keywords = "design of algorithms, plane-sweep, graph theory,
VLSI design, packing"
}
@article{a-pgr-82,
author = "Te. Asano",
title = "Parallel global route",
journal = "Japanese Journal",
volume = 23,
year = 1982,
pages = "443--450"
}
@article{a-rsprs-86,
author = "Te. Asano",
title = "Rectilinear shortest paths in a rectilinear simple
polygon",
journal = "Trans. IECE Japan",
volume = "E69",
number = 6,
year = 1986,
pages = "750--758",
keywords = "design of algorithms, minimum spanning trees,
decomposition, point location"
}
@article{a-rbtp-82,
author = "Te. Asano",
title = "Routes between two points",
journal = "Japanese Journal",
volume = 23,
year = 1982,
pages = "576--578"
}
@techreport{a-tlrpl-87,
author = "Te. Asano",
title = "Two layer routing problem with large vias",
type = "Technical {Report}",
number = "CAS86-198",
institution = "IECE of Japan",
year = 1987,
keywords = "design of algorithms, VLSI design, path planning,
decomposition, plane-sweep, priority search trees,
reporting, point location"
}
@article{aao-pprmn-84,
author = "Te. Asano and Ta. Asano and Y. Ohsuga",
title = "Partitioning a polygonal region into a minimum
number of triangles",
journal = "Trans. IECE Japan",
volume = "E67",
number = 4,
year = 1984,
pages = "232--233",
keywords = "approximation, dynamic programming, triangulation"
}
@inproceedings{abky-cabmm-88,
author = "Te. Asano and B. K. Bhattacharya and J. M. Keil and
F. Yao",
title = "Clustering algorithms based on minimum and maximum
spanning trees",
booktitle = SOCG_1988,
year = 1988,
pages = "252--257",
keywords = "cluster analysis, minimum spanning trees, diameter,
partition"
}
@inproceedings{ackt-ptsis-96,
author = "T. Asano and Danny Z. Chen and Naoki Katoh and
Takeshi Tokuyama",
title = "Polynomial-time solutions to image segmentation",
booktitle = SODA_1996,
year = 1996,
pages = "104--113",
keywords = "separation, monotone chains, dynamic programming,
probing, computer vision"
}
@incollection{ags-vp-00,
author = "T. Asano and Subis K. Ghosh and Thomas C. Shermer",
title = "Visibility in the Plane",
editor = "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier Science Publishers B.V. North-Holland",
address = "Amsterdam",
year = 2000,
pages = "829--876",
annote = "Chapter 19 of su-hcg-00"
}
@inproceedings{agt-wat-91,
author = "Te. Asano and L. J. Guibas and T. Tokuyama",
title = "Walking on an arrangement topologically",
booktitle = SOCG_1991,
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 = IJCGA,
volume = 4,
year = 1994,
pages = "123--151",
keywords = "arrangements, lines"
}
@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 = CCCG_1990,
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 = CCCG_1990,
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 = CCCG_1989,
year = 1989,
pages = 15
}
@inproceedings{aklr-oamcg-95,
author = "T. Asano and Naoki Katoh and Elena Lodi and Thomas
Roos",
title = "Optimal Approximation of Monotone Curves on a Grid",
booktitle = CCCG_1995,
year = 1995,
pages = "37--42"
}
@inproceedings{aktt-cppkt-97,
author = "Te. Asano and N. Katoh and H. Tamaki and
T. Tokuyama",
title = "Covering points in the plane by $k$-tours: towards a
polynomial time approximation scheme for general
$k$",
booktitle = STOC_1997,
nickname = "STOC '97",
year = 1997,
pages = "275--283"
}
@inproceedings{aky-domr-96,
author = "T. Asano and D. Kirkpatrick and C. K. Yap",
title = "$d_1$-Optimal Motion for a Rod",
booktitle = SOCG_1996,
year = 1996,
pages = "252--263"
}
@article{arrww-sfcdg-97,
author = "T. Asano and Desh Ranjan and Thomas Roos and
E. Welzl and Peter Widmayer",
title = "Space-Filling Curves and Their Use in the Design of
Geometric Data Structures",
journal = TCS,
volume = 181,
number = 1,
month = jul,
year = 1997,
pages = "3--15"
}
@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 = LNCS,
volume = 450,
publisher = "Springer-Verlag",
year = 1990,
pages = "300--309"
}
@article{at-appgm-93,
author = "Te. Asano and T. Tokuyama",
title = "Algorithms for projecting points to give the most
uniform distribution with application to hashing",
journal = "Algorithmica",
volume = "??",
year = 1993,
pages = "572--590"
}
@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 = LNCS,
volume = 557,
publisher = "Springer-Verlag",
year = 1991,
pages = "94--103"
}
@incollection{at-cgcsp-87,
author = "Te. Asano and G. Toussaint",
title = "Computing the Geodesic Center of a Simple Polygon",
editor = "D. S. Johnson",
booktitle = "Discrete Algorithms and Complexity",
series = "Perspectives in Computing",
publisher = "Academic Press",
year = 1987,
pages = "65--79"
}
@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"
}
@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"
}
@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",
abstract = "Many geometrical problems have been shown to require
at least O(n log n) computer time in the worst
case. A problem of this kind is the following: Given
a polygonal domain with (polygonal) holes and a
point q in its interior, find the vertices of the
boundary that are visible from q. Since the problem
is almost solved when the rays from q to the
vertices are sorted according to their direction, it
follows that one has the n log n-asymptotics. Now
the computer time can be reduced to const. n, if
O(n) processors are organized as a one-dimensional
systolic array. Each processor cell needs only to
communicate with its two neighbours. The
communication links with the outside are located at
the ends of the array. The essential step is the
following. In each processor only an amount of
information which is independent of n is
needed. Also each vertex ``who is sent through the
systolic array'' may carry an amount of information
which does not depend on n. It is described how this
is possible. Another problem which fits into this
framework is often encountered in CAD. Which part of
a polygonal body is visible? A subdivision of a
polygonal domain into a minimal set of triangles is
also treated"
}
@incollection{abbgotwz-fds-93,
author = "B. Asberg and G. Blanco and P. Bose and
J. Garcia-Lopez and M. H. Overmars and G. Toussaint
and G. Wilfong and B. Zhu",
title = "Feasibility of Design in Stereolithography",
booktitle = FSTTCS_1993,
series = LNCS,
volume = 761,
publisher = "Springer-Verlag",
year = 1993,
pages = "228--237"
}
@article{abbgotwz-fds-97,
author = "B. Asberg and G. Blanco and P. Bose and
J. Garcia-Lopez and M. H. Overmars and G. Toussaint
and G. Wilfong and B. Zhu",
title = "Feasibility of Design in Stereolithography",
journal = "Algorithmica",
volume = 19,
number = "1--2",
month = sep,
year = 1997,
pages = "61--83"
}
@incollection{am-iw81c-82,
author = "F. Aschim and B. M. Mostue",
title = "{IFIP} {WG} 8.1 Case Solved Using {SYSDOC} and
{SYSTEMATOR}",
editor = "T. W. Olle and H. G. Sol and A. A. Verrijn-Stuart",
booktitle = "Information Systems Design Methodologies: A
Comparative Review",
publisher = "North-Holland",
address = "New York, NY",
year = 1982,
pages = "15--40",
keywords = "graph drawing"
}
@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",
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",
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."
}
@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."
}
@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."
}
@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"
}
@article{a-gttvmd-85,
author = "D. Asimov",
title = "The {Grand Tour}: {A} tool for viewing
multidimensional data",
journal = "SIAM J. Sci. Statist. Comput.",
volume = 6,
year = 1985,
pages = "128--143"
}
@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"
}
@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"
}
@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"
}
@inproceedings{as-ptass-79,
author = "B. Aspvall and Y. Shiloac",
title = "A polynomial time algorithm for solving systems of
linear inequalities with two variables per
inequality",
booktitle = FOCS_1979,
year = 1979
}
@techreport{aa-vdpsp-,
author = "T. Assano and T. Assano",
title = "Voronoi diagram for points in a simple polygon",
type = "Manuscript",
institution = "??",
year = "??"
}
@article{a-ded-83,
author = "P. Assouad",
title = "Densit\'e et dimension",
journal = "Ann. Inst. Fourier, Grenoble",
volume = 3,
year = 1983,
pages = "232--282"
}
@inproceedings{ac-proap-93i,
author = "M. Atallah and D. Chen",
title = "On parallel rectilinear obstacle-avoiding paths",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "210--215"
}
@article{ac-proap-93a,
author = "M. Atallah and D. Chen",
title = "On parallel rectilinear obstacle-avoiding paths",
journal = CGTA,
volume = 3,
year = 1993,
pages = "307--313",
annote = "They improve the results of \cite{ac-prspr-91}, to
give a CREW algorithm using $O(n^2/\log n)$
processors (versus earlier bound of $O(n^2)$),
$O(\log^2 n)$ time, and $O(n^2)$ space (versus
earlier bound of $O(n^2\log^2 n)$). See also ElGindy
and Mitra~\cite{em-osrqa-94}, who are said to have
an $O(\log^3 n)$ time, $O(n^2/\log^2 n)$ processor,
method that uses very different techniques."
}
@incollection{a-fpams-90,
author = "M. J. Atallah",
title = "A faster parallel algorithm for a matrix searching
problem",
booktitle = "??",
series = LNCS,
volume = 447,
year = 1990,
pages = "192--200",
keywords = "matrix searching, parallel computation"
}
@article{a-ltahd-83,
author = "M. J. Atallah",
title = "A linear time algorithm for the {Hausdorff} distance
between convex polygons",
journal = IPL,
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 = JALG,
volume = 7,
year = 1986,
pages = "285--288"
}
@inproceedings{a-dcg-83,
author = "M. J. Atallah",
title = "Dynamic computational geometry",
booktitle = FOCS_1983,
year = 1983,
pages = "92--99"
}
@article{a-sd-85,
author = "M. J. Atallah",
title = "On symmetry detection",
journal = "IEEE Trans. Comput.",
volume = "C-34",
year = 1985,
pages = "663--666"
}
@article{a-ptcg-92,
author = "M. J. Atallah",
title = "Parallel techniques for computational geometry",
journal = "Proc. IEEE",
volume = 80,
number = 9,
month = sep,
year = 1992,
pages = "1435--1448",
keywords = "survey paper"
}
@article{a-sdcgp-85,
author = "M. J. Atallah",
title = "Some dynamic computational geometry problems",
journal = "Comput. Math. Appl.",
volume = 11,
number = 12,
year = 1985,
pages = "1171--1181"
}
@article{ab-eact-87,
author = "M. J. Atallah and C. Bajaj",
title = "Efficient algorithms for common transversals",
journal = IPL,
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"
}
@article{acg-pcgp-93,
author = "M. J. Atallah and P. Callahan and M. T. Goodrich",
title = "{$P$}-complete geometric problems",
journal = IJCGA,
volume = 3,
year = 1993,
pages = "443--462",
keywords = "computational geometry, complexity, P-completeness,
parallel algorithms"
}
@article{ac-opamc-89,
author = "M. J. Atallah and D. Z. Chen",
title = "An optimal parallel algorithm for the minimum
circle-cover problem",
journal = IPL,
volume = 34,
number = 4,
year = 1989,
pages = "159--165"
}
@article{ac-caplc-95,
author = "M. J. Atallah and D. Z. Chen",
title = "Computing the all-pairs longest chains in the plane",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "257--271",
keywords = "computational geometry, CREW PRAM, increasing
chains, longest paths, Monge matrices, parallel
algorithms, sequential algorithms"
}
@incollection{ac-dpcg-00,
author = "Mikhail J. Atallah and Danny Z. Chen",
title = "Deterministic Parallel Computational Geometry",
editor = "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier Science Publishers B.V. North-Holland",
address = "Amsterdam",
year = 2000,
pages = "155--200",
annote = "Chapter 4 of su-hcg-00"
}
@article{ac-crbrp-01,
author = "M. J. Atallah and D. Z. Chen",
title = "On connecting red and blue rectilinear polygonal
obstacles with nonintersecting monotone rectilinear
paths",
journal = IJCGA,
volume = 11,
year = 2001,
pages = "373--400"
}
@inproceedings{ac-opavs-89,
author = "M. J. Atallah and D. Z. Chen",
title = "Optimal parallel algorithm for visibility of a
simple polygon from a p oint",
booktitle = SOCG_1989,
year = 1989,
pages = "114--123"
}
@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 = ""
}
@article{ac-prspr-91,
author = "M. J. Atallah and D. Z. Chen",
title = "Parallel rectilinear shortest paths with rectangular
obstacles",
journal = CGTA,
volume = 1,
number = 2,
year = 1991,
pages = "79--113",
comments = "They preprocess a set of $n$ disjoint axis-aligned
rectangles (obstacles), within a rectilinearly
convex polygon $P$, for 2-point shortest path
queries (rectilinear shortest paths). The query time
is $O(\log n)$, on one processor. The sequential
preprocessing time is $O(n^2)$ (no space bounds seem
to be stated explicitly). Their parallel (CREW)
algorithms take time $O(\log^2 n)$, on either
$O(n^2/\log^2 n)$, $O(n^2/\log n)$, or $O(n^2)$
processors, depending on whether 2, 1, or 0 of the
points $\{s,t\}$ lie on the boundary of $P$."
}
@inproceedings{ack-palic-97,
author = "Mikhail J. Atallah and Danny Z. Chen and Kevin
S. Klenk",
title = "Parallel Algorithms for Longest Increasing Chains in
the Plane and Related Problems",
booktitle = CCCG_1997,
year = 1997,
pages = "59--64"
}
@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 = JACM,
volume = 38,
year = 1991,
pages = "516--553"
}
@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 = FOCS_1987,
year = 1987,
pages = "151--160",
keywords = "cascading divide-and-conquer algorithm, parallel
algorithms, concurrent-read- exclusive-write,
parallel random-access machine",
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 = SICOMP,
volume = 18,
number = 3,
year = 1989,
pages = "499--532",
keywords = "parallel computation, decomposition, range search,
point location, visibility, domination, points,
lines, divide-and-conquer, two-dimensional"
}
@techreport{acg-dctdp-87,
author = "M. J. Atallah and R. Cole and M. T. Goodrich",
title = "Divide-and-Conquer: {A} Technique for Designing
Parallel Algorithms",
type = "Technical {Report}",
number = 665,
institution = "Dept. Comput. Sci., Purdue Univ.",
address = "West Lafayette, IN",
year = 1987
}
@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"
}
@article{admrt-mtids-94,
author = "M. J. Atallah and F. Dehne and R. Miller and
A. Rau-Chaplin and J.-J. Tsay",
title = "Multisearch techniques for implementing data
structures on a mesh-connected computer",
journal = "J. Parallel Distrib. Comput.",
volume = "??",
year = "1993/94",
comments = "to appear"
}
@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"
}
@article{af-mph-96,
author = "M. J. Atallah and A. Fabri",
title = "On the multisearching problem for hypercubes",
journal = CGTA,
volume = 5,
year = 1996,
pages = "293--302"
}
@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"
}
@article{afk-seusp-88,
author = "M. J. Atallah and G. N. Frederickson and
S. R. Kosaraju",
title = "Sorting with efficient use of special-purpose
sorters",
journal = "ILP",
volume = "??",
year = 1988,
pages = "13--15"
}
@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"
}
@inproceedings{ag-epsgp-85,
author = "M. J. Atallah and M. T. Goodrich",
title = "Efficient Parallel Solutions to Geometric Problems",
booktitle = "Proc. Internat. Conf. Parallel Process.",
year = 1985,
pages = "411--417"
}
@article{ag-epssg-86,
author = "M. J. Atallah and M. T. Goodrich",
title = "Efficient parallel solutions to some geometric
problems",
journal = "J. Parallel Distrib. Comput.",
volume = 3,
year = 1986,
pages = "492--507",
keywords = "parallel computation, convex hull, proximity,
divide-and-conquer, points, two-dimensional"
}
@techreport{ag-epsp-86t,
author = "M. J. Atallah and M. T. Goodrich",
title = "Efficient plane sweeping in parallel",
number = "CSD-TR-563",
institution = "Prude University, Computer Science",
year = 1986
}
@inproceedings{ag-epsp-86i,
author = "M. J. Atallah and M. T. Goodrich",
title = "Efficient plane sweeping in parallel",
booktitle = SOCG_1986,
year = 1986,
pages = "216--225",
keywords = "parallel computation, decomposition, range search,
point location, triangulation, visibility,
domination, points, lines, two-dimensional"
}
@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"
}
@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"
}
@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 = SOCG_1994,
year = 1994,
pages = "150--159"
}
@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"
}
@article{ah-bmmd-87,
author = "M. J. Atallah and S. E. Hambrusch",
title = "On bipartite matching of minimum density",
journal = JALG,
volume = 8,
year = 1987,
pages = "480--502",
keywords = "geometric graphs"
}
@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
}
@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"
}
@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 = SODA_1991,
site = "San Francisco, California",
year = 1991,
pages = "394--403",
note = "accepted for publication in J. of Algorithms",
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 = SICOMP,
volume = 17,
number = 5,
year = 1988,
pages = "849--869",
keywords = "motion planning"
}
@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 = "??"
}
@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"
}
@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"
}
@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"
}
@inproceedings{at-pdgp-89,
author = "M. J. Atallah and J.-J. Tsay",
title = "On the parallel-decomposability of geometric
problems",
booktitle = SOCG_1989,
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 = CCCG_1996,
year = 1996,
pages = "246--251"
}
@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 = SIGGRAPH_1978
}
@book{an-bp-72,
author = "K. B. Athreya and P. E. Ney",
title = "Branching processes",
publisher = "Springer-Verlag",
year = 1972
}
@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"
}
@article{agw-fqo-86,
author = "H. H. Atkinson and I. Gargantini and T. R. S. Walsh",
title = "Filling by quadrants or octants",
journal = "Comput. Graph. Image Process.",
volume = 33,
year = 1986,
pages = "138--155"
}
@techreport{a-oagc-83,
author = "M. D. Atkinson",
title = "An Optimal Algorithm for Geometric Congruence",
type = "Technical {Report}",
number = "SCS-TR-31",
institution = "Carleton Univ.",
address = "Ottawa, ON",
year = 1983
}
@article{a-oagc-87,
author = "M. D. Atkinson",
title = "An optimal algorithm for geometrical congruence",
journal = JALG,
volume = 8,
year = 1987,
pages = "159--172"
}
@article{as-gbtr-92,
author = "M. D. Atkinson and J.-R. Sack",
title = "Generating Binary Trees at Random",
journal = IPL,
volume = 41,
year = 1992,
pages = "21--23"
}
@article{as-ugbtp-94,
author = "M. D. Atkinson and J.-R. Sack",
title = "Uniform Generation of Binary Trees in Parallel",
journal = "J. Parallel Distrib. Comput.",
volume = 23,
year = 1994,
pages = "101--103",
keywords = "combinatorial objects; CREW-PRAM; generator;
parallel algorithms; random-access storage; trees;
unbiased random; uniform generation of binary trees"
}
@article{as-ugfrh-94,
author = "M. D. Atkinson and J.-R. Sack",
title = "Uniform Generation of Forests of Restricted Height",
journal = IPL,
volume = 50,
year = 1994,
pages = "323--327"
}
@techreport{asss-moacp-85,
author = "M. D. Atkinson and J.-R. Sack and N. Santoro and
Th. Strothotte",
title = "Minmaxheaps, orderstatisticstrees and their
application to the coursmarks problem",
institution = "School of Computer Science, Carleton University",
year = 1985
}
@inproceedings{a-rrsru-97,
author = "D. Attali",
title = "$R$-regular shape reconstruction from unorganized
points",
booktitle = SOCG_1997,
year = 1997,
pages = "248--253"
}
@article{a-rrsru-98,
author = "D. Attali",
title = "$r$-regular shape reconstruction from unorganized
points",
journal = CGTA,
volume = 10,
year = 1998,
pages = "239--247"
}
@phdthesis{a-segdv-95,
author = "D. Attali",
title = "Squelettes et graphes de {Vorono{\"{\i}}} $2$-d et
$3$-d",
school = "Univ. Joseph Fourier",
address = "Grenoble",
month = oct,
year = 1995,
keywords = "doctoral thesis"
}
@inproceedings{ab-lbcdt-02,
author = "Dominique Attali and J.-D. Boissonnat",
title = "Complexity of the {Delaunay} Triangulation of Points
on Polyhedral Surfaces",
booktitle = "Proc. 7th ACM Symposium on Solid Modeling and
Applications",
year = 2002,
pages = ""
}
@article{al-dciss-01,
author = "D. Attali and J.-O. Lachaud",
title = "Delaunay conforming iso-surface, skeleton extraction
and noise removal",
journal = CGTA,
volume = 19,
year = 2001,
pages = "175--189"
}
@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
}
@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 = "??"
}
@inproceedings{ah-hgrp-96,
author = "T. Auer and Martin Held",
title = "Heuristics for the Generation of Random Polygons",
booktitle = CCCG_1996,
year = 1996,
pages = "38--43",
url = "http://www.cosy.sbg.ac.at/~held/papers/cccg96.ps.gz"
}
@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 = ESA_1996,
series = LNCS,
volume = 1136,
publisher = "Springer-Verlag",
year = 1996,
pages = "529--545"
}
@book{as-cg-93,
author = "G{\"u}nter Aumann and Klaus Spitzm{\"u}ller",
title = "Computerorientierte Geometrie",
publisher = "BI-Wissenschaftsverlag",
address = "Mannheim",
year = 1993
}
@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 = FOCS_1993,
year = 1993,
pages = ""
}
@techreport{a-acps-88,
author = "L. J. Aupperle",
title = "An algorithm for covering polygons with squares",
type = "Draft",
institution = "Dept. Comput. Sci., Princeton Univ.",
month = oct,
year = 1988
}
@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"
}
@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 = DCG,
volume = 2,
year = 1987,
pages = "49--64",
keywords = "discrete geometry, cell complexes, power diagrams,
reciprocal figure, $d$-dimensional"
}
@inproceedings{a-ndrcv-86,
author = "F. Aurenhammer",
title = "A new duality result concerning {Voronoi} diagrams",
booktitle = "Proc. 13th Internat. Colloq. Automata
Lang. Program.",
series = LNCS,
volume = 226,
publisher = "Springer-Verlag",
year = 1986,
pages = "21--30",
keywords = "design of algorithms, discrete geometry, duality,
Voronoi diagrams, convex hull, worst-case analysis"
}
@article{a-ndrcv-90,
author = "F. Aurenhammer",
title = "A new duality result concerning {Voronoi} diagrams",
journal = DCG,
volume = 5,
number = 3,
year = 1990,
pages = "243--254",
keywords = "design of algorithms, discrete geometry, duality,
Voronoi diagr ams, convex hull, worst-case analysis"
}
@article{a-rbgtv-90,
author = "F. Aurenhammer",
title = "A relationship between {Gale} transforms and
{Voronoi} diagrams",
journal = "Discrete Appl. Math.",
volume = 28,
year = 1990,
pages = "83--91"
}
@inproceedings{a-pvd-89,
author = "F. Aurenhammer",
title = "{Das} {Peeper's} {Voronoi}-{Diagramm}",
booktitle = "Abstracts 5th Intern. Workshop Comput. Geom.",
nickname = "CG '89",
site = "Freiburg",
publisher = "Universit{\"a}t Freiburg",
year = 1989
}
@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"
}
@article{a-iadbu-88,
author = "F. Aurenhammer",
title = "Improved algorithms for discs and balls using power
diagrams",
journal = JALG,
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 = SOCG_1987,
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"
}
@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"
}
@techreport{a-pdpaa-83,
author = "F. Aurenhammer",
title = "Power Diagrams: {Properties}, Algorithms and
Applications",
number = "F120",
institution = "Techn. Univ. Graz",
address = "Graz, Austria",
year = 1983
}
@article{a-pdpaa-87,
author = "F. Aurenhammer",
title = "Power diagrams: properties, algorithms and
applications",
journal = SICOMP,
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"
}
@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
}
@article{a-odwvd-86,
author = "F. Aurenhammer",
title = "The one-dimensional weighted {Voronoi} diagram",
journal = IPL,
volume = 22,
year = 1986,
pages = "119--123",
keywords = "design of algorithms, divide-and-conquer,
plane-sweep, upper envelope, Voronoi diagrams,
weighted"
}
@inproceedings{a-ugtcg-88,
author = "F. Aurenhammer",
title = "Using {Gale} transforms in computational geometry",
booktitle = "Computational Geometry and its Applications",
nickname = "CG '88",
site = "W{\"u}rzburg",
series = LNCS,
volume = 333,
publisher = "Springer-Verlag",
year = 1988,
pages = "202--216",
keywords = "geometric transform, convex hulls, scene analysis,
$d$-dimensional",
annote = "4th Intern. Workshop Comput. Geom."
}
@article{a-ugtcg-91,
author = "F. Aurenhammer",
title = "Using {Gale} transforms in computational geometry",
journal = "Math. Program.",
volume = "B 52",
year = 1991,
pages = "179--190",
keywords = "geometric transform, convex hulls, scene analysis,
$d$-dimensional"
}
@techreport{a-vds-88,
author = "F. Aurenhammer",
title = "{Voronoi} diagrams: a survey",
institution = "Tech. Univ. Graz",
address = "Graz, Austria",
year = 1988
}
@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"
}
@article{a-vdsfg-91,
author = "F. Aurenhammer",
title = "Voronoi diagrams: A survey of a fundamental
geometric data structure",
journal = "ACM Comput. Surv.",
volume = 23,
number = 3,
month = sep,
year = 1991,
pages = "345--405",
keywords = "survey paper, Voronoi diagrams, Delaunay
triangulations, arrangements, hyperplanes, plane
sweep, divide-and-conquer, parallel computation,
minimum spanning trees, cluster analysis, motion
planning"
}
@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"
}
@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"
}
@inproceedings{aha-lsp-92,
author = "F. Aurenhammer and Friedrich Hoffmann and B. Aronov",
title = "Least-Squares Partitioning",
booktitle = "Abstracts 8th European Workshop Comput. Geom.",
nickname = "CG '92",
site = "Utrecht",
publisher = "Utrecht University",
year = 1992,
pages = "55--57"
}
@article{aha-mttlsc-98,
author = "F. Aurenhammer and Friedrich Hoffmann and B. Aronov",
title = "Minkowski-type theorems and least-squares
clustering",
journal = "Algorithmica",
volume = 20,
year = 1998,
pages = "61--76"
}
@inproceedings{aha-mttls-92,
author = "F. Aurenhammer and F. Hoffmann and B. Aronov",
title = "Minkowski-type theorems and least-squares
partitioning",
booktitle = SOCG_1992,
year = 1992,
pages = "350--357",
keywords = "optimization, least squares, power diagram,
matching"
}
@techreport{ai-grvd-86,
author = "F. Aurenhammer and H. Imai",
title = "Geometric relations among {Voronoi} diagrams",
type = "Technical {Report}",
number = 228,
institution = "Inst. Informationsverarb., Techn. Univ. Graz",
address = "Graz, Autria",
year = 1986
}
@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 = LNCS,
volume = 247,
publisher = "Springer-Verlag",
year = 1987,
pages = "53--65",
keywords = "design of algorithms, discrete geometry, Voronoi
diagrams, distance, weighted"
}
@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"
}
@techreport{ak-vd-96,
author = "F. Aurenhammer and Rolf Klein",
title = "Voronoi Diagrams",
number = 198,
institution = "Department of Computer Science, FernUniversit{\"a}t
Hagen",
address = "Germany",
year = 1996,
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf"
}
@incollection{ak-vd-00,
author = "F. Aurenhammer and Rolf Klein",
title = "Voronoi Diagrams",
editor = "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier Science Publishers B.V. North-Holland",
address = "Amsterdam",
year = 2000,
pages = "201--290",
url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf",
annote = "Chapter 5 of su-hcg-00"
}
@techreport{as-solri-91t,
author = "F. Aurenhammer and O. Schwarzkopf",
title = "A Simple On-line Randomized Incremental Algorithm
for Computing Higher Order {Voronoi} Diagrams",
type = "Technical {Report}",
institution = "Freie Universit{\"a}t Berlin",
address = "Berlin, Germany",
year = 1991
}
@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 = SOCG_1991,
year = 1991,
pages = "142--151",
keywords = "Voronoi diagrams, geometric transforms,
dynamization"
}
@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 = IJCGA,
volume = 2,
year = 1992,
pages = "363--381",
keywords = "Voronoi diagrams, geometric transforms,
dynamization"
}
@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"
}
@article{as-sslro-92,
author = "F. Aurenhammer and G. St{\"o}ckl",
title = "Searching for segments with largest relative
overlap",
journal = IPL,
volume = 41,
year = 1992,
pages = "103--108",
keywords = "line segments, search structure, one-dimensional,
two-dimensional"
}
@inproceedings{asw-popfp-91,
author = "F. Aurenhammer and Gerd St{\"o}ckl and E. Welzl",
title = "The post office problem for fuzzy point sets",
booktitle = "Proc. Computational Geometry: Methods, Algorithms
and Applications",
nickname = "CG '91",
site = "Bern",
series = LNCS,
volume = 553,
publisher = "Springer-Verlag",
year = 1991,
pages = "1--11",
annote = "7th Intern. Workshop Comput. Geom."
}
@inproceedings{aflst-caolt-95,
author = "Giorgio Ausiello and Esteban Feuerstein and Stefano
Leonardi and Leen Stougie and Maurizio Talamo",
title = "Competitive Algorithms for the On-line Traveling
Salesman",
booktitle = WADS_1995,
nickname = "WADS '95",
site = "Kingston, Canada",
series = LNCS,
volume = 955,
publisher = "Springer-Verlag",
year = 1995,
pages = "206--217"
}
@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 = SODA,
year = 1990,
pages = "12--21"
}
@article{ajd-cdans-97,
author = "S. P. Austin and R. B. Jerard and R. L. Drysdale",
title = "Comparison of Discretization Algorithms for NURBS
Surfaces With Application to Numerically Controlled
Machining",
journal = "Comput. Aided Design",
volume = 29,
number = 1,
month = jan,
year = 1997,
pages = "71--83"
}
@article{as-vswma-93,
author = "S. V. Avgustinovich and S. V. Sevast{\'\j}anov",
title = "Vector Summation within Minimal Angle",
journal = CGTA,
volume = 2,
number = 5,
month = mar,
year = 1993,
pages = "235--239"
}
@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 = FOCS_1981,
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 = IPL,
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 = DCG,
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"
}
@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 = IPL,
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 = SOCG_1985,
year = 1985,
pages = "116--120",
keywords = "point sets, partition, half spaces",
comments = "some results appeared in a-spiag-85"
}
% ### 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"
}
% == "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"
}
@article{a-nfnfp-84,
author = "D. Avis",
title = "The number of furthest neighbors of a finite planar
set",
journal = "Amer. Math. Monthly",
volume = 91,
year = 1984,
pages = "417--420",
keywords = "combinatorial geometry, proximity"
}
@article{a-wcbem-81,
author = "D. Avis",
title = "Worst case bounds for the {Euclidean} matching
problem",
journal = "Comput. Math. Appl.",
volume = 7,
year = 1981,
pages = "251--257",
keywords = "heuristics, worst-case analysis"
}
@inproceedings{abdeghz-umpca-93,
author = "D. Avis and B. Beresford-Smith and L. Devroye and
H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and
B. Zhu",
title = "Unoriented {$\Theta$}-Maxima in the Plane",
booktitle = "Proc. of the 16th Australian Conf. in Comp. Science",
site = "Brisbane",
year = 1993
}
@article{abdeghz-utmp-98,
author = "D. Avis and B. Beresford-Smith and L. Devroye and
H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and
B. Zhu",
title = "Unoriented {$\Theta$}-Maxima in the Plane:
{Complexity} and Algorithms",
journal = SICOMP,
volume = 28,
year = 1998,
pages = "278--296"
}
@unpublished{abdeghz-ump2,
author = "D. Avis and B. Beresford-Smith and L. Devroye and
H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and
B. Zhu",
title = "Unoriented {$\Theta$}-Maxima in the Plane {II}",
note = "in preparation"
}
@incollection{ab-acddv-83,
author = "David Avis and Binay 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 = "Greenwich, Conn.",
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
}
@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"
}
@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 = SOCG_1996,
year = 1996,
pages = "C11--C12"
}
@inproceedings{ab-hgach-95,
author = "David Avis and David Bremner",
title = "How Good are Convex Hull Algorithms?",
booktitle = SOCG_1995,
year = 1995,
pages = "20--28",
keywords = "vertex enumeration, pivoting"
}
@article{abs-hgach-97,
author = "D. Avis and D. Bremner and R. Seidel",
title = "How good are convex hull algorithms?",
journal = CGTA,
volume = 7,
year = 1997,
pages = "265--302"
}
@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"
}
@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"
}
@inproceedings{ad-lecmf-89,
author = "D. Avis and M. Deza",
title = "{$L_{1}$} embeddability, complexity, and
multicommodity flows",
booktitle = CCCG_1989,
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
}
@incollection{ad-ahdsp-88,
author = "D. Avis and M. Doskas",
title = "Algorithms for high dimensional stabbing problems",
editor = "R. A. Earnshaw",
booktitle = "Theoretical Foundations of Computer Graphics and
CAD",
series = "NATO ASI Series~F",
volume = 40,
publisher = "Springer-Verlag",
year = 1988,
pages = "199--210",
keywords = "transversals, hyperplanes, stabbing, polyhedra,
linear programming"
}
@article{ad-ahdsp-90,
author = "D. Avis and M. Doskas",
title = "Algorithms for high dimensional stabbing problems",
journal = "Discrete Appl. Math.",
volume = 27,
year = 1990,
pages = "59--62"
}
@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 = DCG,
volume = 2,
year = 1987,
pages = "99--111",
keywords = "triangulation, decomposition, three-dimensional,
$d$-dimensional, point sets"
}
@inproceedings{ae-tspss-86,
author = "D. Avis and H. ElGindy",
title = "Triangulating simplicial point sets in space",
booktitle = SOCG_1986,
year = 1986,
pages = "133--141",
keywords = "triangulation, decomposition, three-dimensional,
$d$-dimensional, point sets"
}
@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 = CGTA,
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"
}
@techreport{af-pachv-90,
author = "D. Avis and K. Fukuda",
title = "A Pivoting Algorithm for Convex Hulls and Vertex
Enumeration of Arrangements and Polyhedra",
type = "Technical {Report}",
number = "B-237",
institution = "Dept. of Information Science, Tokyo Institute of
Technology",
address = "Tokyo, Japan",
month = nov,
year = 1990
}
@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 = SOCG_1991,
year = 1991,
pages = "98--104"
}
@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 = DCG,
volume = 8,
year = 1992,
pages = "295--313"
}
@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."
}
@article{af-rse-96,
author = "D. Avis and K. Fukuda",
title = "Reverse search for enumeration",
journal = "Discrete Appl. Math.",
volume = 65,
year = 1996,
pages = "21--46",
url = "http://www.ifor.math.ethz.ch/staff/fukuda/fukuda.html",
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 = CGTA,
volume = 2,
number = 5,
month = mar,
year = 1993,
pages = "241--254"
}
@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"
}
@inproceedings{ah-cahti-91,
author = "D. Avis and M. E. Houle",
title = "Computational aspects of {Helly}'s theorem and its
relatives",
booktitle = CCCG_1991,
year = 1991,
pages = "11--14"
}
@article{ah-cahti-95,
author = "D. Avis and M. E. Houle",
title = "Computational aspects of {Helly}'s theorem and its
relatives",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "357--367",
keywords = "computational geometry, convexity, intersection,
separation"
}
@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"
}
@inproceedings{ak-grtmd-96,
author = "D. Avis and C. M. Kong",
title = "Generating rooted triangulations with minimum degree
four",
booktitle = CCCG_1996,
year = 1996,
pages = "56--61"
}
@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 = SOCG_1985,
year = 1985,
pages = "161--167",
keywords = "planar point sets, convex subsets, discrete
geometry"
}
@article{arw-lbls-89,
author = "D. Avis and J.-M. Robert and R. Wenger",
title = "Lower bounds for line stabbing",
journal = IPL,
volume = 33,
year = 1989,
pages = "59--62"
}
@article{at-eadps-81,
author = "D. Avis and G. T. Toussaint",
title = "An efficient algorithm for decomposing a polygon
into star-shaped polygons",
journal = "Pattern Recogn.",
volume = 13,
year = 1981,
pages = "395--398",
keywords = "decomposition, polygons, star-shaped, coloring",
annote = "Uses Fisk's constructive proof of Chvatal's theorem:
for every $n$-gon there is a decomposition into
$\lfloor n/3 \rfloor$ star shaped pieces. Proceeds
by colouring a triangulation with three colours."
}
@article{at-oadvp-81,
author = "D. Avis and G. T. Toussaint",
title = "An optimal algorithm for determining the visibility
of a polygon from an edge",
journal = "IEEE Trans. Comput.",
volume = "C-30",
number = 12,
year = 1981,
pages = "910--1014",
keywords = "combinatorial geometry, design of algorithms,
construction, incrementation, geometric
transformations, worst-case analysis, Voronoi
diagrams, two-dimensional, three-dimensional,
weighted"
}
@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 = SOCG_1987,
year = 1987,
pages = "300--307"
}
@article{aw-plts-88,
author = "D. Avis and R. Wenger",
title = "Polyhedral line transversals in space",
journal = DCG,
volume = 3,
year = 1988,
pages = "257--265"
}
@article{aw-plts-89,
author = "D. Avis and R. Wenger",
title = "Polyhedral line traversals in space",
journal = DCG,
volume = 4,
year = 1989
}
@article{ah-g-66,
author = "S. Avital and H. Hanani",
title = "Graphs",
journal = "Gilyonot Lematematika",
volume = 3,
year = 1966,
pages = "2--8",
note = "In Hebrew"
}
@phdthesis{a-peddf-89,
author = "Francis Avnaim",
title = "Placement et d{\'e}placement de formes rigides ou
articul{\'e}es",
type = "Th{\`e}se de Doctorat en Sciences",
school = "Uni\-ver\-sit{\'e} de Franche-Comt{\'e}",
address = "Besan\c{c}on, France",
year = 1989,
keywords = "doctoral thesis"
}
@incollection{ab-pptr-88,
author = "Francis Avnaim and J.-D. Boissonnat",
title = "Polygon placement under translation and rotation",
booktitle = "Proc. 5th Sympos. Theoret. Aspects Comput. Sci.",
series = LNCS,
volume = 294,
publisher = "Springer-Verlag",
year = 1988,
pages = "322--333"
}
@article{ab-pptr-89,
author = "Francis Avnaim and J.-D. Boissonnat",
title = "Polygon placement under translation and rotation",
journal = "RAIRO Inform. Theor.",
volume = 23,
year = 1989,
pages = "5--28"
}
@inproceedings{ab-pempc-89,
author = "Francis Avnaim and J.-D. Boissonnat",
title = "Practical exact motion planning of a class of robots
with three degrees of freedom",
booktitle = CCCG_1989,
year = 1989,
pages = 19
}
@inproceedings{ab-scsp-87,
author = "Francis Avnaim and J.-D. Boissonnat",
title = "Simultaneous containment of several polygons",
booktitle = SOCG_1987,
year = 1987,
pages = "242--250"
}
@techreport{ab-pcp1s-87,
author = "Francis Avnaim and J.-D. Boissonnat",
title = "The polygon containment problem: 1. Simultaneous
containment under translation",
type = "Technical {Report}",
number = 689,
institution = "INRIA Sophia-Antipolis",
month = jun,
year = 1987
}
@techreport{abdpy-esdus-94,
author = "Francis Avnaim and J.-D. Boissonnat and O. Devillers
and F. P. 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/RRRT/RR-2306",
abstract = "We propose a method to evaluate signs of $2\times 2$
and $3\times 3$ determinants with $b$-bit integer
entries using only $b$ and $(b+1)$-bit arithmetic
respectively. This algorithm has numerous
applications in geometric computation and provides a
general and practical approach to robustness. The
algorithm has been implemented and experimental
results show that it slows down the computing time
by only a small factor with respect to
floating-point calculation."
}
@article{abdpy-esdus-97,
author = "Francis Avnaim and J.-D. Boissonnat and O. Devillers
and F. P. Preparata and M. Yvinec",
title = "Evaluating signs of determinants using
single-precision arithmetic",
journal = "Algorithmica",
volume = 17,
number = 2,
year = 1997,
pages = "111--132",
url = "http://www-sop.inria.fr/prisme/publis/abdpy-esdus-97.ps.gz",
abstract = "We propose a method to evaluate signs of $2\times 2$
and $3\times 3$ determinants with $b$-bit integer
entries using only $b$ and $(b+1)$-bit arithmetic
respectively. This algorithm has numerous
applications in geometric computation and provides a
general and practical approach to robustness. The
algorithm has been implemented and compared with
other exact computation methods."
}
@inproceedings{abdpy-enmcs-95,
author = "Francis Avnaim and J.-D. Boissonnat and O. Devillers
and F. P. Preparata and M. Yvinec",
title = "Evaluation of a new method to compute signs of
determinants",
booktitle = SOCG_1995,
year = 1995,
pages = "C16--C17",
url = "http://www-sop.inria.fr/prisme/publis/abdpy-enmcs-95.ps.gz"
}
@inproceedings{abf-pempa-88,
author = "Francis Avnaim and J.-D. Boissonnat and Bernard
Faverjon",
title = "A practical exact motion planning algorithm for
polygonal objects amidst polygonal obstacles",
booktitle = "Proc. 5th IEEE Internat. Conf. Robot. Autom.",
year = 1988,
pages = "1656--1661"
}
@incollection{abf-pempa-89,
author = "Francis Avnaim and J.-D. Boissonnat and Bernard
Faverjon",
title = "A practical exact motion planning algorithm for
polygonal objects amidst polygonal obstacles",
booktitle = "??",
series = LNCS,
volume = 391,
year = 1989,
pages = "67--86",
keywords = "motion planning"
}
@incollection{ak-srtat-89,
author = "J. Avro and D. Kirk",
title = "A survey of ray tracing acceleration techniques",
editor = "A. Glassner",
booktitle = "An Introduction to Ray Tracing",
publisher = "Academic Press",
address = "San Diego, CA",
year = 1989,
pages = "201--262",
isbn = "0-12-286160-4"
}
@article{a-cns-85,
author = "B. Awerbuch",
title = "Complexity of network synchronization",
journal = JACM,
volume = "??",
year = 1985,
pages = "804--823"
}
@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
}
@inproceedings{aabv-iagmw-95,
author = "B. Awerbuch and Y. Azar and A. Blum and S. Vempala",
title = "Improved approximation guarantees for minimum-weight
$k$-trees and prize-collecting salesmen",
booktitle = STOC_1995,
nickname = "STOC 95",
year = 1995,
pages = "277--283"
}
@article{aabv-nagmw-98,
author = "B. Awerbuch and Y. Azar and A. Blum and S. Vempala",
title = "New approximation guarantees for minimum-weight
$k$-trees and prize-collecting salesmen",
journal = SICOMP,
volume = 28,
year = 1998,
pages = "254--262"
}
@article{abcp-nltcs-98,
author = "B. Awerbuch and B. Berger and L. Cowen and D. Peleg",
title = "Near-linear time construction of sparse neighborhood
covers",
journal = SICOMP,
volume = 28,
year = 1998,
pages = "263--277"
}
@inproceedings{ap-sp-90,
author = "B. Awerbuch and D. Peleg",
title = "Sparse partitions",
booktitle = FOCS_1990,
year = 1990,
pages = "503--513"
}
@book{a-avmrs-91,
author = "N. Ayache",
title = "Artificial Vision for Mobile Robots: Stereo Vision
and Multisensory Perception",
publisher = "MIT Press",
address = "Cambridge, MA",
year = 1991
}
@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"
}
@article{af-ersmg-87,
author = "N. Ayache and B. Faverjon",
title = "Efficient registration of stereo by matching graph
descriptors of edge segments",
journal = "Internat. J. Comput Vision",
volume = "??",
year = 1987,
pages = "107--131"
}
@article{abjn-ormnd-85,
author = "D. Ayala and P. Brunet and R. Juan and I. Navazo",
title = "Object representation by means of nominal division
quadtrees",
journal = "ACM Trans. Graph.",
volume = 4,
number = 1,
year = 1985,
pages = "41--59"
}
@inproceedings{adfqr-ndstd-94,
author = "R. Ayala and E. Dom{\'\i}nguez and A. R. Franc{\'e}s
and A. Quintero and J. Rubio",
title = "{$N$}-Dimensional Separation Theorems in Digital
Topology",
booktitle = "Abstracts 10th European Workshop Comput. Geom.",
nickname = "CG '94",
site = "Santander",
publisher = "Universidad de Cantabria, Santander",
year = 1994,
pages = "29--32"
}
@inproceedings{ai-patgt-97,
author = "Cavit Aydin and Doug Ierardi",
title = "Partitioning Algorithms for Transportation Graphs
and their Applications to Routing",
booktitle = CCCG_1997,
year = 1997,
pages = "245--250"
}
@article{a-lbimt-94,
author = "Yossi Azar",
title = "Lower Bounds for Insertion Methods for {TSP}",
journal = "Combinatorics, Probability and Computing",
volume = 3,
year = 1994,
pages = "285--292",
annote = "See also \cite{bkp-naimy-94}; Bafna et al
independently discovered the same result."
}
@article{ae-tdp-97,
author = "Yossi Azar and Leah Epstein",
title = "On Two Dimensional Packing",
journal = JALG,
volume = 25,
number = 2,
month = nov,
year = 1997,
pages = "290--310",
keywords = "bin packing, rectangles, boxes, approximation
algorithm"
}
@article{amm-cgcap-93,
author = "A. S. Azarenok and V. N. Martynchik and
N. N. Metel'skii",
title = "Computation of generalized convex approximations of
planar geometric objects",
journal = "Comp. Maths Math. Phys. (English translation of
Zhurnal Vychislitelnoi Matematiki i Matematicheskoi
Fiziki)",
volume = 33,
number = 12,
year = 1993,
pages = "1641--1651",
keywords = "shape approximation, generalized convexity,
visibility, isothetic domain, $S-$convex hull,
$S-$convex approximation",
annote = "The author's notion of $S-$convex hull for an
isothetic domain is in other words the minimal
externally isothetically visible hull. An $O(rn^3)$
time $O(rn^2)$ space algorithm for $r-$vertex
$S-$convex approximation of miminal area of an
$n-$vertex isothetic domain is given.",
abstract = "Using generalizations of the concept of convexity, a
technique is described for approximating polygonal
domains by simplifying their geometric shape. An
algorithm of polynomial complexity is obtained for
computing a generalized-convex approximation with a
priori constraints on the number of vertices of the
resulting domain. The quality of the approximation
is evaluated from the increment in area of the
original domain which is minimized by solving a
certain extremum combinatorial problem. (Author
abstract) 8 Refs."
}
@inproceedings{bw-acmrs-92,
author = "J. H. B{\/o}hn and M. J. Wozny",
title = "Automatic {CAD}-model repair: {Shell}-closure",
booktitle = "Proc. Sympos. on Solid Freeform Fabrication",
site = "Austin, TX",
organization = "Dept. Mech. Eng., Univ. Texas Austin",
year = 1992,
pages = "86--94"
}
@techreport{bf-lamcp-88,
author = "L. Babai and P. Frankl",
title = "Linear Algebra Methods in Combinatorics, Part {I}",
type = "Technical {Report}",
institution = "Univ. Chicago",
address = "Chicago, IL",
year = 1988
}
@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"
}
@inproceedings{bsw-cplhp-97,
author = "Mark Babikov and Diane Souvaine and R. Wenger",
title = "Constructing Piecewise Linear Homeomorphisms of
Polygons with Holes",
booktitle = CCCG_1997,
year = 1997,
pages = "6--10"
}
@article{ba-acfem-76,
author = "I. Babuska and A. K. Aziz",
title = "On the angle condition in the finite element method",
journal = "SIAM J. Numer. Anal.",
volume = 13,
year = 1976,
pages = "214--227"
}
@article{bb-3drcg-78,
author = "N. Badler and R. Bajcsy",
title = "$3$-d representation for computer graphics and
computer vision",
journal = "Comput. Graph. Image Process.",
volume = 12,
year = 1978,
pages = "153--160"
}
@article{bsc-ctsv-99,
author = "N. Baek and S.-Y. Shin and K.-Y. Chwa",
title = "On Computing Translational Swept Volumes",
journal = IJCGA,
volume = 9,
number = 3,
month = jun,
year = 1999,
pages = "293--317"
}
@article{bsc-tdtsc-00,
author = "N. Baek and S.-Y. Shin and K.-Y. Chwa",
title = "Three-dimensional topological sweep for computing
rotational swept volumes of polyhedral objects",
journal = IJCGA,
volume = 10,
year = 2000,
pages = "131--156"
}
@article{beh-gms-79,
author = "A. Baer and C. Eastman and M. Henrion",
title = "Geometric Modeling: {A} Survey",
journal = "CAD",
volume = 11,
number = 5,
month = sep,
year = 1979,
pages = "253--272"
}
@incollection{b-ssar-89,
author = "R. {Baeza-Yates}",
title = "String searching algorthms revisited",
booktitle = "??",
series = LNCS,
volume = 382,
year = 1989,
pages = "75--96",
keywords = "searching, string matching"
}
@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"
}
@incollection{br-fatdm-90,
author = "R. {Baeza-Yates} and M. Regnier",
title = "Fast algorithms for two-dimensional and multiple
pattern matching",
booktitle = "??",
series = LNCS,
volume = 447,
year = 1990,
pages = "332--247",
keywords = "searching, pattern matching"
}
@article{bs-psp-95,
author = "R. {Baeza-Yates} and R. Schott",
title = "Parallel searching in the plane",
journal = CGTA,
volume = 5,
year = 1995,
pages = "143--154"
}
@article{bkp-naimy-94,
author = "Vineet Bafna and Bala Kalyanasundaram and Kirk
Pruhs",
title = "Not All Insertion Methods Yield Constant Approximate
Tours in the {Euclidean} Plane",
journal = TCS,
volume = 125,
year = 1994,
pages = "345--353",
annote = "See also \cite{a-lbimt-94}; Azar independently
discovered the same result."
}
@article{b-bdce-86,
author = "V. Bagatelj",
title = "On the balanced divide-and-conquer equation",
journal = "Internat. J. Comput. Math.",
volume = 19,
number = "3--4",
year = 1986,
pages = "259--266",
keywords = "divide and conquer"
}
@techreport{b-ip-??,
author = "F. Bagemihl",
title = "On indecomposable polyhedra",
type = "Report",
number = "??",
institution = "Univ. Rochester",
address = "Rochester, NY",
year = "??"
}
@article{b-ip-48a,
author = "F. Bagemihl",
title = "On indecomposable polyhedra",
journal = "Amer. Math. Monthly",
volume = "??",
month = sep,
year = 1948,
pages = "411--413"
}
@inproceedings{bdegm-cvgls-97,
author = "J. Bagga and S. Dey and J. Emert and L. Gewali and
J. McGrew",
title = "Contracted Visibility Graphs of Line Segments",
booktitle = CCCG_1997,
year = 1997,
pages = "82--86"
}
@inproceedings{bgg-cipaf-96,
author = "J. Bagga and L. Gewali and D. Glasser",
title = "The complexity of illuminating polygons by
{$\alpha$}-flood-lights",
booktitle = CCCG_1996,
year = 1996,
pages = "337--342"
}
@inproceedings{bgn-vemeu-97,
author = "Jay Bagga and Laxmi Gewali and Simeon Ntafos",
title = "Visibility Edges, Mixed Edges, and Unique
Triangulation",
booktitle = "Abstracts 13th European Workshop Comput. Geom.",
nickname = "CG '97",
site = "W{\"u}rzburg",
publisher = "Universit{\"a}t W{\"u}rzburg",
year = 1997,
pages = 11
}
@techreport{b-phpmp-93,
author = "D. H. Bailey",
title = "A Portable High Performance Multiprecision Package",
number = "RNR-90-022",
institution = "NASA Ames Res. Center",
month = may,
year = 1993
}
@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"
}
@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
}
@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"
}
@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"
}
@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"
}
@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"
}
@inproceedings{br-tdarp-94,
author = "B. Bajaj and A. Royappa",
title = "Triangulation and display of arbitrary rational
parametric surfaces",
editor = "R. Bergeron and A. Kaufman",
booktitle = "IEEE Visualiuation '94 Conference",
publisher = "IEEE",
year = 1994
}
@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
}
@inproceedings{b-cgiv-96,
author = "C. Bajaj",
title = "Computational geometry for interrogative
visualization",
booktitle = CCCG_1996,
year = 1996,
pages = "99--100",
annote = "Invited Lecture by C. Bajaj"
}
@incollection{b-gmas-89,
author = "C. Bajaj",
title = "Geometric Modeling with Algebraic Surfaces",
editor = "D. Handscomb",
booktitle = "The Mathematics of Surfaces III",
publisher = "Oxford University Press",
year = 1989,
pages = "3--48"
}
@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 = FSTTCS_1985,
site = "New Delhi, India",
series = LNCS,
volume = 206,
publisher = "Springer-Verlag",
month = dec,
year = 1985,
pages = "176--195"
}
@article{b-goph-87,
author = "C. Bajaj",
title = "Geometric optimization and the polynomial hierarchy",
journal = TCS,
volume = 54,
number = 1,
year = 1987,
pages = "87--102",
keywords = "optimization, facility location, computational
complexity"
}
@inproceedings{b-lasgm-86,
author = "C. Bajaj",
title = "Limitations to algorithm solvability: {Galois}
methods and models of computation",
booktitle = "Proc. ACM Sympos. Symbolic and Algebraic
Computation",
year = 1986,
pages = "71--76",
keywords = "discrete geometry, algebra, complexity theory,
two-dimensional, three-dimensional, CAD, robotics"
}
@techreport{b-lpiir-89,
author = "C. Bajaj",
title = "Local Parameterization, Implicitazion and Inversion
of Real Algebraic Curves",
type = "Technical {Report}",
number = "CSD-TR-863",
institution = "Purdue Univ.",
address = "West Lafayette, IN",
year = 1989,
note = "Also CAPO-89-9, Proc. AAECC-7 Conf."
}
@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}"
}
@article{b-pgans-86,
author = "C. Bajaj",
title = "Proving geometric algorithm non-solvability: {An}
application of factoring polynomials",
journal = "J. Symbolic Comput.",
volume = 2,
year = 1986,
pages = "99--102",
keywords = "discrete geometry, algebra, complexity theory,
two-dimensional, three-dimensional, CAD, robotics"
}
@inproceedings{b-rhd-90,
author = "C. Bajaj",
title = "Rational Hypersurface Display",
booktitle = "Proc. 1990 Sympos. Interactive 3D Graphics",
site = "Snowbird, UT",
year = 1990
}
@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 = DCG,
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"
}
@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"
}
@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"
}
@article{bbx-arssf-95,
author = "C. Bajaj and F. Bernardini and G. Xu",
title = "Automatic reconstruction of surface and scalar
fields from $3$d scans",
journal = "Comput. Graph.",
volume = "??",
year = 1995,
pages = "109--118",
note = "Proc. SIGGRAPH'95"
}
@inproceedings{bcgw-frpc-89,
author = "C. Bajaj and J. Canny and T. Garrity and J. Warren",
title = "Factoring Rational Polynomials over the Complexes",
booktitle = "Proc. Internat. Sympos. on Symbolic and Algebraic
Computation",
year = 1989,
pages = "81--90"
}
@article{bcx-mcap-95,
author = "C. Bajaj and J. Chen and G. Xu",
title = "Modeling with cubic {A}-patches",
journal = "ACM Trans. Graph.",
volume = 14,
number = 2,
year = 1995,
pages = "103--133"
}
@techreport{bd-cdpr-90,
author = "C. Bajaj and T. Dey",
title = "Convex Decomposition of Polyhedra and Robustness",
type = "Technical {Report}",
number = "CSD-TR-990",
institution = "Dept. Comput. Sci., Purdue Univ.",
year = 1990
}
@techreport{bd-cdsp-89,
author = "C. Bajaj and T. Dey",
title = "Convex Decomposition of Simple Polyhedra",
number = "CSD-TR-833",
institution = "Dept. Comput. Sci., Purdue Univ.",
year = 1989
}
@article{bd-cdpr-92,
author = "C. Bajaj and T. K. Dey",
title = "Convex decomposition of polyhedra and robustness",
journal = SICOMP,
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"
}
@article{bd-pnr-90,
author = "C. Bajaj and T. K. Dey",
title = "Polygon nesting and robustness",
journal = IPL,
volume = 35,
year = 1990,
pages = "23--32",
keywords = "containment"
}
@techreport{bgw-amer-88,
author = "C. Bajaj and T. Garrity and J. Warren",
title = "Applications of multi-equational resultants",
type = "Technical {Report}",
number = 826,
institution = "Dept. Comput. Sci., Purdue Univ.",
address = "West Lafayette, IN",
year = 1988
}
@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 = SIGGRAPH_1992
}
@inproceedings{bk-gcso3-87,
author = "C. Bajaj and M. Kim",
title = "Generation of Configuration Space Obstacles {III}:
{The} Case of Moving Algebraic Curves",
booktitle = "Proc. 4th IEEE Internat. Conf. Robot. Autom.",
year = 1987
}
@incollection{bkm-apgm-88,
author = "C. Bajaj and M.-S. Kim",
title = "Algorithms for planar geometric models",
booktitle = "??",
series = LNCS,
volume = 317,
year = 1988,
pages = "67--81",
keywords = "curvilinear, convex hull, decomposition, motion
planning"
}
@inproceedings{bk-cmpgm-87,
author = "C. Bajaj and M.-S. Kim",
title = "Compliant motion planning with geometric models",
booktitle = SOCG_1987,
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"
}
@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
}
@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"
}
@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"
}
@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"
}
@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"
}
@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"
}
@article{bl-godc-89,
author = "C. Bajaj and M. Li",
title = "Geometric optimization and {$D^P$}-completeness",
journal = DCG,
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
}
@article{br-frrpc-95,
author = "C. Bajaj and A. Royappa",
title = "Finite representations of real parametric curves and
surfaces",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "313--326",
keywords = "real parametric curves and surfaces, varieties,
computer graphics, projective domain
transformations"
}
@techreport{br-gagt-90,
author = "C. Bajaj and A. Royappa",
title = "The {GANITH} Algebraic Geometry Toolkit",
type = "Technical {Report}",
number = 914,
institution = "Purdue Univ.",
address = "West Lafayette, IN",
year = 1990,
note = "CAPO Report No. CER-89-21, Also to appear in DISCO
90"
}
@inproceedings{bs-ebrtm-96,
author = "C. Bajaj and D. Schikore",
title = "Error-bounded reduction of triangle meshes with
multivariate data",
booktitle = "Proc. SPIE Sympos. Visual Data Exploration and
Analysis III",
month = jan,
year = 1996,
pages = "34--45"
}
@article{bs-tpdse-98,
author = "C. Bajaj and D. Schikore",
title = "Topology preserving data simplification with error
bounds",
journal = "Computers \& Graphics",
volume = 22,
number = 1,
year = 1998,
pages = "3--12"
}
@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",
annote = "Discusses a low-level operation on curves:
conversion of a rational piecewise polynomial curve
into rational Bernstein-Bezier form, a commonly used
type of non-uniform rational B-spline
(NURB). Rational splines are useful because they
allow conic curves to be represented exactly,
whereas standard (polynomial) splines do
not. Contains pseudocode."
}
@booklet{b-cmst-95,
author = "C. L. Bajaj",
title = "Collaborative Multimedia \& Scientific Toolkits",
howpublished = "Course Notes, Dept. Comp. Sci., Purdue Univ.",
address = "West Lafayette, Indiana",
year = 1996
}
@inproceedings{b-gcavb-90,
author = "C. L. Bajaj",
title = "Geometric computations with algebraic varieties of
bounded degree",
booktitle = SOCG_1990,
year = 1990,
pages = "148--156"
}
@article{bbx-rsfsu-97,
author = "C. L. Bajaj and F. Bernadini and G. Xu",
title = "Reconstructing Surfaces and Functions on Surfaces
from Unorganized Three-Dimensional Data",
journal = "Algorithmica",
volume = 19,
number = "1--2",
month = sep,
year = 1997,
pages = "243--261"
}
@inproceedings{bb-dvddt-90,
author = "C. L. Bajaj and W. J. Bouma",
title = "Dynamic {Voronoi} diagrams and {Delaunay}
triangulations",
booktitle = CCCG_1990,
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"
}
@incollection{bd-rdp-89,
author = "C. L. Bajaj and T. K. Dey",
title = "Robust decompositions of polyhedra",
booktitle = "??",
series = LNCS,
volume = 405,
year = 1989,
pages = "267--279",
keywords = "polyhedron decomposition robust"
}
@incollection{be-sgm-97,
author = "C. L. Bajaj and S. Evans",
title = "Splines and geometric modeling",
chapter = 45,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "833--850"
}
@article{bhlh-tsi-88,
author = "C. L. Bajaj and C. M. Hoffman and R. E. Lynch and
J. E. Hopcroft",
title = "Tracing surface intersections",
journal = "Comput. Aided Geom. Design",
volume = 5,
year = 1988,
pages = "285--307"
}
@inproceedings{bi-hiura-89,
author = "C. L. Bajaj and I. Ihm",
title = "Hermite interpolation using real algebraic surfaces",
booktitle = SOCG_1989,
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 = SOCG_1996,
year = 1996,
pages = "88--97"
}
@inproceedings{bps-fiii-96,
author = "C. L. Bajaj and V. Pascucci and D. R. Schikore",
title = "Fast isocontouring for improved interactivity",
booktitle = "Proc. 1996 IEEE Symposium on Volume Visualization",
site = "San Francisco, CA",
month = oct,
year = 1996,
pages = "39--46"
}
@article{a-pfp-00,
author = "C. L. Bajaj and A. V. Royappa",
title = "Parameterization in Finite Precision",
journal = "Algorithmica",
volume = 27,
number = 1,
year = 2000,
pages = "100--114"
}
@article{b-ap-88,
author = "R. Bajcsy",
title = "Active perception",
journal = "Proc. IEEE",
volume = 76,
number = 8,
year = 1988,
pages = "996--1005"
}
@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
}
@inproceedings{bfg-spmfh-85,
author = "B. Baker and S. Fortune and E. Grosse",
title = "Stable prehension with a multi-fingered hand",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
site = "St. Louis, Missouri",
year = 1985
}
@inproceedings{b-aancp-83,
author = "B. S. Baker",
title = "Approximation algorithms for {NP}-complete problems
on planar graphs",
booktitle = FOCS_1983,
year = 1983
}
@article{b-aancp-94,
author = "B. S. Baker",
title = "Approximation algorithms for {NP}-complete problems
on planar graphs",
journal = JACM,
volume = 41,
year = 1994,
pages = "153--180"
}
@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 = JALG,
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 = SICOMP,
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 = STOC_1985,
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"
}
@article{bfm-pct-86,
author = "B. S. Baker and S. J. Fortune and S. R. Mahaney",
title = "Polygon containment under translation",
journal = JALG,
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 = DCG,
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 = SICOMP,
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"
}
@inproceedings{bb-deibs-81,
author = "H. H. Baker and T. O. Binford",
title = "Depth from Edge and Intensity Bases Stereo",
booktitle = "Proc. 7th Internat. Joint Conf. Artif. Intell.",
site = "Vancouver",
year = 1981,
pages = "631--636"
}
@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"
}
@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"
}
@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 = SOCG_1996,
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"
}
@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"
}
@article{bclt-vga-,
author = "J. E. Baker and I. F. Cruz and G. Liotta and
R. Tamassia",
title = "Visualizing Geometric Algorithms over the Web",
journal = CGTA,
note = "to appear"
}
@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"
}
@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"
}
@article{b-amgct-89,
author = "Timothy J. Baker",
title = "Automatic Mesh Generation For Complex
Three-Dimensional Regions Using a Constrained
{Delaunay} Triangulation",
journal = "Engineering with Computers (USA)",
volume = 5,
number = "3--4",
year = 1989,
pages = "161--175",
keywords = "mesh generation, Delaunay triangulation",
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 = SOCG_1995,
year = 1995,
pages = "211--219",
keywords = ""
}
@inproceedings{bf-mp-93,
author = "E. Balas and M. Fischetti",
title = "On the Monotonization of Polyhedra",
booktitle = "Proc. 3rd IPCO Conference Integer Programming and
Combinatorial Optimization",
site = "Erice, Italy",
year = 1993,
pages = "??"
}
@article{bp-pmspb-83,
author = "E. Balas and W. Pulleyblank",
title = "The perfectly matchable subgraph polytope of a
bipartite graph",
journal = "Networks",
volume = 13,
year = 1983,
pages = "495--516"
}
@phdthesis{b-gmhsr-01,
author = "Sophie Balaven",
title = "G\'en\'eration de maillages hybrides pour la
simulation de r\'eservoirs p\'etroliers",
type = "Th\`{e}se de doctorat en sciences",
school = "Ecole des Mines, Paris",
address = "France",
year = 2001,
keywords = "doctoral thesis"
}
@incollection{bmb-pmmca-94,
author = "L. Balbes and S. Mascarella and D. Boyd",
title = "A perspective of modern methods in computer-aided
drug design",
editor = "K. Lipkowitz and D. B. Boyd",
booktitle = "Reviews in Computational Chemistry",
volume = 5,
publisher = "VCH Publishers",
year = 1994,
pages = "337--370"
}
@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"
}
@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"
}
@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"
}
@book{bb-cv-82,
author = "D. H. Ballard and C. M. Brown",
title = "Computer Vision",
publisher = "Prentice Hall",
year = 1982
}
@techreport{b-mpbsp-93,
author = "C. Ballieux",
title = "Motion planning using binary space partitions",
number = "Inf/src/93-25",
institution = "Utrecht University",
year = 1993
}
@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 = SOCG_1991,
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 = JACM,
volume = 35,
year = 1988,
pages = "267--287",
keywords = "shortest paths, polyhedra, convex, $3$-dimensional"
}
@inproceedings{b-pichc-99,
author = "Helymar Balza-Gomez",
title = "The Periodicity of Integral Convex Hulls for Conics
in {$E^2$}",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "47--49"
}
@article{b-cpcep-67,
author = "T. F. Banchoff",
title = "Critical points and curvature for embedded
polyhedra",
journal = "J. Diff. Geom.",
volume = 1,
year = 1967,
pages = "245--256"
}
@article{bt-hftcp-75,
author = "T. F. Banchoff and F. Takens",
title = "Height functions with three critical points",
journal = "Illinois J. Math.",
volume = 76,
year = 1975,
pages = "326--335"
}
@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"
}
@article{bmr-pcnds-91,
author = "Saibal Banerjee and D. M. Mount and Azriel
Rosenfeld",
title = "Pyramid Computation Of Neighbor Distance Statistics
In Dot Patterns",
journal = "CVGIP: Graph. Models Image Process.",
volume = 53,
number = 4,
month = jul,
year = 1991,
pages = "373--381",
keywords = "Voronoi neighbors",
abstract = "This paper describes an algorithm for computing
statistics of Voronoi neighbor distances in a dot
pattern, using a cellular pyramid computer, in a
logarithmic number of computational steps. Given a
set of dots in a square region of the digital plane,
the algorithm determines with high probability the
Voronoi neighbors of the dots in the interior of the
region and then computes statistics of the neighbor
distances. An algorithm of this type may account for
the ability of humans to perceive at a glance
whether the dots in a pattern are randomly or
regularly spaced, i.e., their neighbor distances
have high or low variance. (Author abstract)"
}
@manual{b-pug-90,
author = "R. E. Bank",
title = "{PLTMG} User's Guide",
organization = "SIAM",
year = 1990
}
@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 = SODA_1992,
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 = JALG,
volume = 17,
year = 1994,
pages = "319--341"
}
@incollection{b-lotdp-90,
author = "G. Bar",
title = "On the level-oriented two-dimensional packing with
rotation of rectangles",
editor = "R. Bodendiek and R. Henn",
booktitle = "??",
publisher = "Physica-Verlag",
address = "Geidelberg",
year = 1990,
pages = "73--78",
keywords = "packing, isothetic"
}
@inproceedings{bi-rppt-93,
author = "G. B{\"a}r and C. Iturriaga",
title = "Rectangle packing in polynomial time",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "455--460"
}
@article{bkp-hanc-93,
author = "J. Bar-Ilan and G. Kortsarz and D. Peleg",
title = "How to allocate network centers",
journal = JALG,
volume = 15,
number = 3,
year = 1993,
pages = "385--415"
}
@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 = IJCGA,
volume = 6,
year = 1996,
pages = "79--102"
}
@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 = CCCG_1990,
year = 1990,
pages = "186--190",
keywords = "polygons, covering"
}
@article{bc-tdjc-94,
author = "R. Bar-Yehuda and B. Chazelle",
title = "Triangulating disjoint {Jordan} chains",
journal = IJCGA,
volume = 4,
number = 4,
year = 1994,
pages = "475--481",
keywords = "triangulation, polygons with holes, merging holes"
}
@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 = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "252--257"
}
@article{be-lrtaw-85,
author = "R. Bar-Yehuda and S. Even",
title = "A local ratio theorem for approximating the weighted
vertex cover problem",
journal = "Ann. Discrete Math.",
volume = 25,
year = 1985,
pages = "27--46"
}
@inproceedings{be-avcpg-82,
author = "R. Bar-Yehuda and S. Even",
title = "On Approximating a Vertex Cover for Planar Graphs",
booktitle = STOC_1982,
month = may,
year = 1982,
pages = "303--309"
}
@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"
}
@unpublished{bf-bcnag-90,
author = "R. Bar-Yehuda and S. Fogel",
title = "Better constructions and new applications of good
splitters",
year = 1990,
note = "In preparation"
}
@inproceedings{bf-gsars-90,
author = "R. Bar-Yehuda and S. Fogel",
title = "Good splitters with applications to ray shooting",
booktitle = CCCG_1990,
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
}
@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
}
@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"
}
@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"
}
@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"
}
@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"
}
@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
}
@inproceedings{bg-tph-90,
author = "R. Bar-Yehuda and R. Grinwald",
title = "Triangulating polygons with holes",
booktitle = CCCG_1990,
year = 1990,
pages = "112--115"
}
@article{b-j-79,
author = "J. Baracs",
title = "Juxtapositions",
journal = "Structural Topology",
volume = 1,
year = 1979,
pages = "59--72"
}
@article{b-amdsn-89,
author = "D. Baraff",
title = "Analytical methods for dynamic simulation of
non-penetrating rigid bodies",
journal = "Comput. Graph",
volume = 23,
number = 3,
year = 1989,
pages = "223--232",
note = SIGGRAPH_1988
}
@article{b-cscnp-90,
author = "D. Baraff",
title = "Curved surfaces and coherence for non-penetrating
rigid body simulation",
journal = "Comput. Graph.",
volume = 24,
number = 4,
year = 1990,
pages = "19--28"
}
@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"
}
@article{bmk-mffac-97,
author = "D. Baraff and R. Matikalli and P. Khosla",
title = "Minimal Fixturing of Frictionless Assemblies:
Complexity and Algorithms",
journal = "Algorithmica",
volume = 19,
number = "1--2",
month = sep,
year = 1997,
pages = "4--39"
}
@article{br-lbceo-87,
author = "R. Barakat and J. H. Reif",
title = "Lower bounds on the computational efficiency of
optical computing systems",
journal = "Appl. Optics",
volume = 26,
number = 6,
year = 1987,
pages = "1015--1018"
}
@article{br-pcamm-87,
author = "R. Barakat and J. H. Reif",
title = "Polynomial convolution algorithm for matrix
multiplication with application for optical
computing",
journal = "Appl. Optics",
volume = 26,
number = 14,
year = 1987,
pages = "2707--2711"
}
@article{bv-nclp-92,
author = "I. B{\'a}r{\'a}nav and A. M. Vershik",
title = "On the number of convex lattice polytopes",
journal = "Geometric and Functional Analysis",
volume = 2,
year = 1992,
pages = "381--393"
}
@article{b-gct-82,
author = "I. B{\'a}r{\'a}ny",
title = "A generalization of {Carath{\'e}odory}'s theorem",
journal = "Discrete Math.",
volume = 40,
year = 1982,
pages = "141--152"
}
@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"
}
@inproceedings{bf-cvid-86,
author = "I. B{\'a}r{\'a}ny and Z. F{\"u}redi",
title = "Computing the volume is difficult",
booktitle = STOC_1986,
year = 1986,
pages = "442--447"
}
@article{bf-cvid-87,
author = "I. B{\'a}r{\'a}ny and Z. F{\"u}redi",
title = "Computing the volume is difficult",
journal = DCG,
volume = 2,
year = 1987,
pages = "319--326",
keywords = "approximation, volume, convex"
}
@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
}
@article{bf-eses-87,
author = "I. B{\'a}r{\'a}ny and Z. Furedi",
title = "Empty simplices in {Euclidean} space",
journal = "Canad. Math. Bull.",
volume = 30,
year = 1987,
pages = "436--445"
}
@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 = SOCG_1989,
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"
}
@article{bhl-ipplb-92,
author = "I. B{\'a}r{\'a}ny and R. Howe and L. Lov{\'a}sz",
title = "On integer points in polyhedra: A lower bound",
journal = "Combinatorica",
volume = 12,
year = 1992
}
@article{bl-cppe-90,
author = "I. B{\'a}r{\'a}ny and D. G. Larman",
title = "A combinatorial property of points and ellipsoids",
journal = DCG,
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"
}
@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 = DCG,
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 = CCCG_1990,
year = 1990,
pages = "55--59"
}
@article{bs-enks-94,
author = "I. B{\'a}r{\'a}ny and W. Steiger",
title = "On the expected number of $k$-sets",
journal = DCG,
volume = 11,
year = 1994,
pages = "243--263"
}
@article{bv-pfest-98,
author = "I. B{\'a}r{\'a}ny and P. Valtr",
title = "A positive fraction {Erd{\H{o}}s-Szekeres} theorem",
journal = DCG,
volume = 19,
year = 1998,
pages = "335--342"
}
@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"
}
@inproceedings{bh-rapp-93,
author = "B. Barber and M. Hirsch",
title = "A robust algorithm for point in polyhedron",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "479--484"
}
@phdthesis{b-cgida-93,
author = "C. B. Barber",
title = "Computational geometry with imprecise data and
arithmetic",
school = "Princeton Univ.",
address = "Princeton, NJ",
year = 1993,
keywords = "doctoral thesis"
}
@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|",
abstract = "The convex hull of a set of points is the smallest
convex set that contains the points. This paper
presents a convex hull algorithm that combines the
$2$-d Quickhull algorithm with the general dimension
Beneath-beyond algorithm. It is similar to the
randomized, incremental algorithms for convex hull
and Delaunay triangulation. Our algorithm is
simpler, uses less memory, and allows good use of
virtual memory. A simple modification produces an
approximate convex hull. We provide empirical
evidence that the algorithm runs faster and is
output sensitive."
}
@article{bdh-qach-96,
author = "C. Bradford Barber and David P. Dobkin and Hannu
Huhdanpaa",
title = "The {Quickhull} Algorithm for Convex Hulls",
journal = "ACM Trans. Math. Softw.",
volume = 22,
number = 4,
month = dec,
year = 1996,
pages = "469--483"
}
@techreport{bh-ppida-92,
author = "C. B. Barber and M. D. Hirsch",
title = "Point in polyhedron with imprecise data and
arithmetic",
type = "Technical Report",
number = "GCG46",
institution = "The Geometry Center",
year = 1992
}
@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"
}
@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"
}
@inproceedings{bp-brbs-89,
author = "L. Bardis and N. M. Patrikalakis",
title = "Blending Rational {B}-Spline Surfaces",
booktitle = "Proc. Eurographics '89",
year = 1989,
pages = "453--462"
}
@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"
}
@article{b-csmpi-72,
author = "E. H. Bareiss",
title = "Computational solution of matrix problems over an
integral domain",
journal = "J. Inst. Maths Applics",
volume = 10,
year = 1972,
pages = "68--104"
}
@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
}
@article{b-dpdpe-98,
author = "G. Barequet",
title = "{DCEL}: A Polyhedral Database and Programming
Environment",
journal = IJCGA,
volume = 8,
year = 1998,
pages = "619--636"
}
@article{b-ughrc-97,
author = "G. Barequet",
title = "Using Geometric Hashing to Repair CAD Objects",
journal = "IEEE Comput. Sci. \& Eng.",
volume = 4,
number = 4,
month = oct,
year = 1997,
pages = "22--28"
}
@inproceedings{bbdgt-ccgg-97,
author = "G. Barequet and Stina S. Bridgeman and Christian
A. Duncan and Michael T. Goodrich and Roberto
Tamassia",
title = "Classical Computational Geometry in {GeomNet}",
booktitle = SOCG_1997,
year = 1997,
pages = "412--414",
keywords = "internet computing, format conversion,
client-server, CGC, Brown"
}
@article{bbdgt-ggcoi-99,
author = "G. Barequet and Stina S. Bridgeman and Christian
A. Duncan and Michael T. Goodrich and Roberto
Tamassia",
title = "{GeomNet:} Geometric Computing Over the Internet",
journal = "IEEE Internet Computing",
volume = 3,
number = 2,
year = 1999,
pages = "21--29",
keywords = "internet computing, format conversion,
client-server, CGC, Brown"
}
@inproceedings{bbddg-aopdf-97,
author = "G. Barequet and A. Briggs and M. Dickerson and
C. Dima and M. Goodrich",
title = "Animating the Offset Polygon Distance Function",
booktitle = SOCG_1997,
year = 1997,
pages = "479--480",
keywords = "video review"
}
@techreport{bbdg-opapp-,
author = "G. Barequet and A. Briggs and M. Dickerson and
M. Goodrich",
title = "Offset polygon annulus placement problems",
type = "Manuscript",
institution = "??",
year = "??"
}
@article{bcgmt-bhrs3-96,
author = "G. Barequet and B. Chazelle and L. J. Guibas and
J. Mitchell and A. Tal",
title = "{BOXTREE}: {A} Hierarchical Representation for
Surfaces in {3D}",
journal = "Comput. Graph. Forum",
volume = 15,
number = 3,
month = sep,
year = 1996,
pages = "C387--C396, C484",
note = "Proc.\ Eurographics'96",
keywords = "Boxtree, Collision detection, Computational
geometry, Data structures, Hierarchical systems,
Octrees, Piecewise linear techniques, Ray shooting,
Ray tracing, Surfaces, Three dimensional computer
graphics"
}
@inproceedings{bde-ttdp-96,
author = "G. Barequet and Matthew Dickerson and D. Eppstein",
title = "On Triangulating Three-Dimensional Polygons",
booktitle = SOCG_1996,
year = 1996,
pages = "38--47"
}
@article{bde-ttdp-98,
author = "G. Barequet and M. Dickerson and D. Eppstein",
title = "On Triangulating Three-dimensional Polygons",
journal = CGTA,
volume = 10,
number = 3,
year = 1998,
pages = "155--170"
}
@techreport{bdg-vdpod-,
author = "G. Barequet and M. Dickerson and M. Goodrich",
title = "Voronoi diagrams for polygon-offset distance
functions",
type = "Manuscript",
institution = "??",
year = "??"
}
@inproceedings{bdp-tcpcm-95,
author = "G. Barequet and Matthew Dickerson and Petru Pau",
title = "Translating a Convex Polygon to Contain a Maximum
Number of Points",
booktitle = CCCG_1995,
year = 1995,
pages = "61--66"
}
@article{bdp-tcpcm-97,
author = "G. Barequet and Matthew Dickerson and Petru Pau",
title = "Translating a convex polygon to contain a maximum
number of points",
journal = CGTA,
volume = 8,
number = 4,
year = 1997,
pages = "167--179"
}
@article{bdk-rgtcr-98,
author = "G. Barequet and C. A. Duncan and S. Kumar",
title = "RSVP: A Geometric Toolkit for Controlled Repair of
Solid Models",
journal = "IEEE Trans. Visualizat. Comput. Graph.",
volume = 4,
number = 2,
month = apr,
year = 1998,
pages = "162--177"
}
@inproceedings{be-asrv-00b,
author = "G. Barequet and Gershon Elber",
title = "{$\alpha$}-Sectors of Rational Varieties",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "35--39"
}
@article{bh-pctmh-01,
author = "G. Barequet and S. Har-Peled",
title = "Polygon containment and translational
min-{Hausdorff}-distance between segment sets are
{3SUM}-hard",
journal = IJCGA,
volume = 11,
year = 2001,
pages = "465--474"
}
@inproceedings{bk-dfelm-97,
author = "G. Barequet and Y. Kaplan",
title = "A data front end for layered manufacturing",
booktitle = SOCG_1997,
year = 1997,
pages = "231--239"
}
@article{bk-dfelm-98,
author = "G. Barequet and Y. Kaplan",
title = "A Data Front-End for Layered Manufacturing",
journal = "Comput. Aided Design",
volume = 30,
number = 4,
month = apr,
year = 1998,
pages = "231--243"
}
@inproceedings{bk-rcm-97,
author = "G. Barequet and S. Kumar",
title = "Repairing {CAD} Models",
booktitle = "Proc. IEEE Visualization",
site = "Phoenix, AZ",
year = 1997,
pages = "363--370"
}
@techreport{bs-fgbp-93,
author = "G. Barequet and M. Sharir",
title = "Filling gaps in the boundary of a polyhedron",
type = "Technical {Report}",
number = "277/93",
institution = "Dept. Comput. Sci., Tel Aviv Univ.",
address = "Tel Aviv, Israel",
year = 1993
}
@article{bs-fgbp-95,
author = "G. Barequet and M. Sharir",
title = "Filling Gaps in the Boundary of a Polyhedron",
journal = "Comput. Aided Geom. Design",
volume = 12,
year = 1995,
pages = "207--229"
}
@inproceedings{bs-psvmt-94,
author = "G. Barequet and M. Sharir",
title = "Partial surface and volume matching in three
dimensions",
booktitle = "Proc. 12th Annu. IAPR/IEEE Internat. Conf. Pattern
Recogn.",
site = "Jerusalem, Israel",
volume = 2,
year = 1994,
pages = "610--614"
}
@inproceedings{bs-psmud-96,
author = "G. Barequet and M. Sharir",
title = "Partial Surface Matching by Using Directed
Footprints",
booktitle = SOCG_1996,
year = 1996,
pages = "C9--C10"
}
@inproceedings{bs-plibp-94,
author = "G. Barequet and M. Sharir",
title = "Piecewise-Linear Interpolation between Polygonal
Slices",
booktitle = SOCG_1994,
year = 1994,
pages = "93--102"
}
@article{bs-plibp-96,
author = "G. Barequet and M. Sharir",
title = "Piecewise-linear interpolation between polygonal
slices",
journal = "Comput. Vision Graph. Image Process.",
volume = 63,
year = 1996,
note = "in press."
}
@inproceedings{bw-ocbtp-96,
author = "G. Barequet and B. Wolfers",
title = "Optimizing a corridor between two polygons with an
application to polyhedral interpolation",
booktitle = CCCG_1996,
year = 1996,
pages = "32--37"
}
@inproceedings{bml-ggpj-97,
author = "Naser S. Barghouti and John Mocenigo and Wenke Lee",
title = "{\em Grappa}: A {GRAPh} {PAckage} in {Java}",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "336--343",
keywords = "graph drawing"
}
@article{bbr-ecit-85,
author = "M. Barnabei and A. Brini and G.-C. Rota",
title = "On the exterior calculus of invariant theory",
journal = "J. Algebra",
volume = 96,
number = 1,
year = 1985,
pages = "120--160"
}
@article{bs-dnapv-66,
author = "O. Barndorff-Nielsen and M. Sobel",
title = "On the distribution of the number of admissible
points in a vector sample",
journal = "Theory Probab. Appl.",
volume = "XI",
number = 2,
year = 1966,
pages = "249--269"
}
@book{bf-a2-83,
author = "M. Barner and F. Flohr",
title = "Analysis II",
publisher = "Walter de Gruyter",
address = "Berlin",
year = 1983
}
@article{bh-hofca-86,
author = "J. Barnes and P. Hut",
title = "A hierarchical {$O(n \log n)$} force-calculation
algorithm",
journal = "Nature",
volume = 324,
number = 4,
month = dec,
year = 1986,
pages = "446--449"
}
@article{b-gc2ce-87,
author = "D. W. Barnette",
title = "Generating closed $2$-cell embeddings in the torus
and the projective plane",
journal = DCG,
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"
}
@article{b-wpt-90,
author = "D. W. Barnette",
title = "{$W_V$} paths on the torus",
journal = DCG,
volume = 5,
year = 1990,
pages = "603--608"
}
@incollection{b-casrd-83,
author = "R. Barnhill",
title = "Computer aided surface representation and design",
editor = "R. Barnhill and W. Boehm",
booktitle = "Surfaces in Computer-Aided Geometric Design",
publisher = "North-Holland",
year = 1983,
pages = "1--24"
}
@article{b-srds-83,
author = "R. E. Barnhill",
title = "A Survey of the Representation and Design of
Surfaces",
journal = "IEEE Comput. Graph. Appl.",
volume = "??",
month = oct,
year = 1983,
pages = "9--16",
annote = "Suggests triangulation for basis of interpolation,
using Little's minmax, rather than Delaunay
Triangulation."
}
@incollection{b-ras-77,
author = "R. E. Barnhill",
title = "Representation and approximation of surfaces",
editor = "J. R. Rice",
booktitle = "Math. Software III",
publisher = "Academic Press",
address = "New York, NY",
year = 1977,
pages = "69--120"
}
@article{bbl-ntc-78,
author = "R. E. Barnhill and J. H. Brown and I. M. Lucewicz",
title = "A new twist in CAGD",
journal = "Comput. Graph. Image Process.",
volume = 8,
year = 1978,
pages = "78--79"
}
@article{bfjp-ssi-87,
author = "R. E. Barnhill and G. Farin and M. Jordan and
B. R. Piper",
title = "Surface/surface intersection",
journal = "Comput. Aided Geom. Design",
volume = 4,
year = 1987,
pages = "3--16"
}
@article{bl-atc-84,
author = "R. E. Barnhill and F. F. Little",
title = "Adaptive triangular cubatures",
journal = "Rocky Mountain J. Math.",
volume = 14,
number = 1,
year = 1984,
pages = "53--75"
}
@article{bl-tfds-84,
author = "R. E. Barnhill and F. F. Little",
title = "Three- and four-dimensional surfaces",
journal = "Rocky Mountain J. Math.",
volume = 14,
year = 1984,
pages = "77--102"
}
@article{bo-sds-90,
author = "R. E. Barnhill and H. S. Ou",
title = "Surfaces Defined on Surfaces",
journal = "Comput. Aided Geom. Design",
volume = 7,
year = 1990,
pages = "323--336",
annote = "Defines triangulation of a convex surface to be the
same as the convex hull. Hull algorithm is gift
wrapping."
}
@book{br-cagd-74,
author = "R. E. Barnhill and R. F. Riesenfeld",
title = "Computer aided geometric design",
publisher = "Academic Press",
address = "New York",
year = 1974
}
@article{bgss-icfcm-96,
author = "D. Barnum and J. Greene and A. Smellie and
P. Sprague",
title = "Identification of common functional components among
molecules",
journal = "J. Chem. Inf. Comput. Sci.",
volume = "??",
year = 1996,
note = "To appear"
}
@inproceedings{bjz-adrc-99,
author = "Ala Eddine Barouni and Ali Jaoua and Nejib Zaguia",
title = "An Algorithm for Drawing a Ring Cover",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "157--159"
}
@article{bgs-apcme-80,
author = "R. C. Barr and T. M. Gallie and M. S. Spach",
title = "Automated Production of Contour Maps for
Electrophysiology",
journal = "Computers in Biomedical Research",
volume = 13,
year = 1980,
pages = "142--191",
annote = "Constructs triangulation. Uses McLains circle
criterion for $O(n^2)$ DT."
}
@article{bkllmr-rsfpp-??,
author = "J. Barraquand and L. E. Kavraki and J.-C. Latombe
and T.-Y. Li and R. Motwani and P. Raghavan",
title = "A Random Sampling Framework for Path Planning in
Large-Dimensional Configuration Spaces",
journal = "Internat. J. Robot. Res.",
volume = "??",
year = "??",
pages = "to appear"
}
@inproceedings{bl-mcapp-90,
author = "J. Barraquand and J.-C. Latombe",
title = "A Monte-Carlo Algorithm for Path Planning with Many
Degrees of Freedom",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
month = may,
year = 1990,
pages = "1712--1717",
location = "Cincinnati, Ohio"
}
@article{bl-nmrom-89,
author = "J. Barraquand and J.-C. Latombe",
title = "Nonholonomic mobile robots and optimal maneuvering",
journal = "Revue d'Intelligence artificielle",
volume = 3,
year = 1989,
pages = "77--103"
}
@article{bl-nmbmr-93,
author = "J. Barraquand and J.-C. Latombe",
title = "Nonholonomic multi-body mobile robots:
controllability and motion planning in the presence
of obstacles",
journal = "Algorithmica",
volume = 10,
year = 1993,
pages = "121--155"
}
@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"
}
@inproceedings{b-cmsmp-96,
author = "Antonio Hern{\'a}ndez Barrera",
title = "Computing the {Minkowski} Sum of Monotone Polygons",
booktitle = "Abstracts 12th European Workshop Comput. Geom.",
nickname = "CG '96",
site = "M{\"u}nster",
publisher = "Universit{\"a}t M{\"u}nster",
year = 1996,
pages = "113--116"
}
@inproceedings{bv-hmrr-84,
author = "R. Barrera and A. M. Vazques",
title = "A Hierarchical Method for Representing Relief",
booktitle = "Proc. Pecora IX Symposium in Spatial Information
Technologies for Remote Sensing Today and Tomorrow",
site = "Sioux Falls, South Dakota",
month = oct,
year = 1984,
pages = "87--92"
}
@inproceedings{bgmrz-tsees-93,
author = "T. Barrera and J. Griffith and S. A. McKee and
G. Robins and T. Zhang",
title = "Toward a {Steiner} engine: {Enhanced} serial and
parallel implementations of the iterated
$1$-{Steiner} algorithm",
booktitle = "Proc. Great Lakes Sympos. VLSI",
site = "Kalamazoo, MI",
month = mar,
year = 1993,
pages = "90--94"
}
@inproceedings{bgrz-ngnos-93,
author = "T. Barrera and J. Griffith and G. Robins and
T. Zhang",
title = "Narrowing the gap: {Near}-optimal {Steiner} trees in
polynomial time",
booktitle = "Proc. IEEE Internat. ASIC Conf.",
site = "Rochester, NY",
month = sep,
year = 1993,
pages = "87--90"
}
@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",
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"
}
@inproceedings{b-aamtm-98,
author = "Yair Bartal",
title = "On Approximating Arbitrary Metrics by Tree Metrics",
booktitle = STOC_1998,
year = 1998,
pages = "to appear"
}
@inproceedings{b-pamsi-96,
author = "Y. Bartal",
title = "Probabilistic approximation of metric spaces and its
algorithmic applications",
booktitle = FOCS_1996,
year = 1996,
pages = "184--193"
}
@book{bbb-isucg-87,
author = "R. H. Bartels and J. C. Beatty and B. A. Barsky",
title = "An introduction to splines for use in computer
graphics and geometric modeling",
publisher = "Morgan Kaufman",
address = "Los Altos, CA",
year = 1987
}
@inproceedings{b-nacvh-91,
author = "Timothy J. Barth",
title = "Numerical aspects of computing viscous high reynolds
number flows on unstructured meshes",
booktitle = "AIAA 29th Aerospace Sciences Meeting",
month = jan,
year = 1991
}
@inproceedings{bh-ctbvg-99,
author = "Wilhelm Barth and Ernst Huber",
title = "Computations with Tight Bounding Volumes for General
Parametric Surfaces",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "123--127"
}
@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 = IPL,
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"
}
@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
}
@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 = LNCS,
volume = 577,
publisher = "Springer-Verlag",
year = 1992,
pages = "221--232"
}
@inproceedings{bh-psafc-92c,
author = "Frank Bartling and Klaus Hinrichs",
title = "A Plane-Sweep Algorithm for Finding a Closest Pair
Among Convex Planar Objects",
booktitle = "Abstracts 8th European Workshop Comput. Geom.",
nickname = "CG '92",
site = "Utrecht",
publisher = "Utrecht University",
year = 1992,
pages = 91
}
@techreport{bh-paask-90,
author = "F. Bartling and K. Hinrichs",
title = "Probabilistic analysis of an algorithm for solving
the $k$-dimensional all-nearest-neighbors problem by
projection",
type = "Report",
number = "90-02",
institution = "Dept. Comput. Sci., Univ. Siegen",
address = "Siegen, West Germany",
year = 1990
}
@article{bh-paask-91,
author = "F. Bartling and K. Hinrichs",
title = "Probabilistic analysis of an algorithm for solving
the $k$-dimensional all-nearest-neighbors problem by
projection",
journal = "BIT",
volume = 31,
year = 1991,
pages = "558--565"
}
@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"
}
@article{bb-pp-80,
author = "E. E. Barton and I. Buchanan",
title = "The polygon package",
journal = "Comput. Aided Design",
volume = 12,
year = 1980,
pages = "3--11"
}
@inproceedings{bmn-reisl-97,
author = "U. Bartuschka and K. Mehlhorn and S. N{\"a}her",
title = "A Robust and Efficient Implementation of a Sweep
Line Algorithm for the Straight Line Segment
Intersection Problem",
booktitle = "Proc. Workshop on Algorithm Engineering",
nickname = "WAE '97",
site = "Venice",
month = sep,
year = 1997,
pages = "124--135",
url = "http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap13.ps.gz"
}
@article{bmh-oaocl-99,
author = "D. Bartz and M. Mei{\ss}ner and T. H{\"u}ttner",
title = "OpenGL-assisted Occlusion Culling for Large
Polygonal Models",
journal = "Comput. \& Graphics",
volume = 23,
number = 5,
month = oct,
year = 1999,
pages = "667--679"
}
@article{bgv-srmpd-97,
author = "Rakesh D. Barve and Edward F. Grove and
J. S. Vitter",
title = "Simple Randomized Mergesort on Parallel Disks",
journal = "Parallel Comput.",
volume = 23,
number = 4,
year = 1997,
note = "Special issue on parallel I/O. An earlier version
appears in Proc. of the 8th Annual ACM Symposium on
Parallel Algorithms and Architectures (SPAA~'96),
Padua, Italy, June 1996, 109--118"
}
@inproceedings{bjww-ptamp-98,
author = "Alexander Barvinok and David S. Johnson and Gerhard
J. Woeginger and Russell Woodroofe",
title = "Polynomial Time Algorithms for Maximization Problems
in Spaces with Polyhedral Norms",
booktitle = "Sixth Conference on Integer Programming and
Combinatorial Optimization",
nickname = "IPCO Houston '98",
site = "Rice University, Houston, TX",
month = jun,
year = 1998,
pages = "to appear"
}
@inproceedings{b-ptaci-93,
author = "A. I. Barvinok",
title = "A Polynomial Time Algorithm for Counting Integral
Points in Polyhedra when the dimension is fixed",
booktitle = FOCS_1993,
nickname = "FOCS '93",
year = 1993,
pages = "566--572"
}
@article{b-cei-91,
author = "A. I. Barvinok",
title = "Computation of exponential integrals",
journal = "Zap. Nauchn. Sem. LOMI",
volume = 192,
number = 5,
year = 1991,
pages = "149--163"
}
@inproceedings{b-cvcip-92,
author = "A. I. Barvinok",
title = "Computing the volume, counting integral points and
exponential sums",
booktitle = SOCG_1992,
year = 1992,
pages = "161--170"
}
@inproceedings{b-ighdp-95,
author = "A. I. Barvinok",
title = "Integral geometry of higher-dimensional polytopes
and the average case in combinatorial optimization",
booktitle = FOCS_1995,
nickname = "FOCS '95",
year = 1995,
pages = "To appear"
}
@incollection{b-lplp-97,
author = "A. I. Barvinok",
title = "Lattice points and lattice polytopes",
chapter = 7,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "133--152"
}
@article{b-tarts-96,
author = "A. I. Barvinok",
title = "Two Algorithmic Results for the {TSP}",
journal = "Math. Oper. Res.",
volume = 21,
year = 1996,
pages = "65--84",
keywords = "MAX TSP, longest cycle, PTAS, approximation scheme"
}
@article{bb-msbdc-88,
author = "R. Barzel and A. H. Barr",
title = "A modeling system based on dynamics constraints",
journal = "Comput. Graph.",
volume = 22,
number = 4,
year = 1988,
pages = "179--187",
note = SIGGRAPH_1987
}
@inproceedings{bdiz-pacfm-97,
author = "J. Basch and H. Devarajan and P. Indyk and L. Zhang",
title = "Probabilistic Analysis for Combinatorial Functions
of Moving Points",
booktitle = SOCG_1997,
year = 1997,
pages = "442--444"
}
@inproceedings{bgh-dsmd-97,
author = "J. Basch and L. J. Guibas and J. Hershberger",
title = "Data Structures for Mobile Data",
booktitle = SODA_1997,
year = 1997,
pages = "747--756"
}
@inproceedings{bgr-sllsh-97,
author = "J. Basch and L. J. Guibas and G. Ramkumar",
title = "Sweeping Lines and Line Segments with a Heap",
booktitle = SOCG_1997,
year = 1997,
pages = "469--472"
}
@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 = ESA_1996,
series = LNCS,
volume = 1136,
publisher = "Springer-Verlag",
year = 1996,
pages = "302--319"
}
@unpublished{bgrr-pttc-,
author = "J. Basch and L. J. Guibas and G. D. Ramkumar and
L. Ramshaw",
title = "Polyhedral tracings and their convolution",
note = "Submitted"
}
@inproceedings{bgsz-pekds-97,
author = "J. Basch and L. J. Guibas and C. Silverstein and
L. Zhang",
title = "A practical evaluation of kinetic data structures",
booktitle = SOCG_1997,
year = 1997,
pages = "388--390"
}
@inproceedings{bgz-ppmp-97,
author = "J. Basch and L. J. Guibas and L. Zhang",
title = "Proximity Problems on Moving Points",
booktitle = SOCG_1997,
year = 1997,
pages = "344--351"
}
@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",
annote = "Gives formulas and code to find the centroid (center
of mass) of a polygon. This is useful when
simulating Newtonian dynamics. Contains C code."
}
@article{bs-fdmrc-67,
author = "L. J. Bass and S. R. Schubert",
title = "On finding the disc of minimum radius containing a
given set of points",
journal = "Math. Comput.",
volume = 12,
year = 1967,
pages = "712--714"
}
@techreport{bh-fpsae-93,
author = "H. Bast and T. Hagerup",
title = "Fast parallel space allocation, estimation and
integer sorting",
type = "Report",
number = "MPI-I-93-123",
institution = "Max-Planck-Institut Inform.",
address = "Saarbr{\"u}cken, Germany",
year = 1993
}
@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"
}
@inproceedings{b-sgtfp-88,
author = "M. Bastuscheck",
title = "On the stability of grasping: three fingers and a
planar polygon",
booktitle = "Proc. 5th IEEE Internat. Conf. Robot. Autom.",
year = 1988
}
@inproceedings{b-bbnce-96,
author = "Saugata Basu",
title = "On Bounding the {Betti} Numbers and Computing the
{Euler} Characteristic of Semi-Algebraic Sets",
booktitle = STOC_1996,
nickname = "STOC '96",
site = "Philadelphia, PA",
month = may,
year = 1996,
pages = "408--417"
}
@unpublished{b-ctcsc-98,
author = "S. Basu",
title = "On the combinatorial and topological complexity of a
single cell",
booktitle = FOCS_1998,
year = 1998,
pages = "606--616"
}
@unpublished{bpr-ccsad-98,
author = "S. Basu and R. Pollack and M.-F. Roy",
title = "Complexity of computing semi-algebraic descriptions
of the connected components of a semi-algebraic set",
year = 1998,
note = "unpublished manuscript"
}
% , month = may
@inproceedings{bpr-crsas-96,
author = "Saugata Basu and Richard Pollack and
Marie-Fran{\c{c}}oise Roy",
title = "Computing Roadmaps of Semi-Algebraic Sets",
booktitle = STOC_1996,
nickname = "STOC '96",
site = "Philadelphia, PA",
year = 1996,
pages = "168--173"
}
@article{bpr-ocspm-97,
author = "S. Basu and R. Pollack and M.-F. Roy",
title = "On Computing a Set of Points meeting every
Semi-algebraically Connected Component of a Family
of Polynomials on a Variety",
journal = "J. Complexity",
volume = 13,
year = 1997,
pages = "28--37"
}
@article{bpr-oncdf-94,
author = "S. Basu and R. Pollack and M.-F. Roy",
title = "On the number of cells defined by a family of
polynomials on a variety",
journal = "Mathematika",
volume = 43,
year = 1994,
pages = "120--126"
}
@incollection{bpr-ncdfp-95,
author = "S. Basu and R. Pollack and M.-F. Roy",
title = "On the number of cells defined by a family of
polynomials on a variety",
editor = "K. Y. Goldberg and D. Halperin and J.-C. Latombe and
R. H. Wilson",
booktitle = "Algorithmic Foundations of Robotics",
publisher = "A. K. Peters",
address = "Wellesley, MA",
year = 1995
}
@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"
}
@inproceedings{bhrz-pgrtc-97,
author = "C. Douglass Bateman and C. S. Helvig and Gabriel
Robins and Alexander Zelikovsky",
title = "Provably Good Routing Tree Construction with
Multi-Port Terminals",
booktitle = "Proc. ACM/SIGDA International Symposium on Physical
Design",
site = "Napa Valley, CA",
month = apr,
year = 1997,
pages = "??",
keywords = "one-of-a-set TSP, group TSP, approximation
algorithms"
}
@article{b-nccp-49,
author = "P. T. Bateman",
title = "Note on the coefficients of the cyclotomic
polynomial",
journal = "Bull. Amer. Math. Soc.",
volume = 55,
year = 1949,
pages = "1180--1181"
}
@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"
}
@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
}
@book{bf-mpbds-86,
author = "C. Batini and E. Fortunato",
title = "Metodi per la Progettazione di Basi di Dati
Statistici",
publisher = "ISTAT",
year = 1986
}
@inproceedings{bfn-wigdp-85,
author = "C. Batini and L. Furlani and E. Nardelli",
title = "What is a Good Diagram? {A} Pragmatic Approach",
booktitle = "Proc. 4th Internat. Conf. on the Entity-Relationship
Approach",
year = 1985,
pages = "312--319",
keywords = "graph drawing"
}
@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"
}
@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"
}
@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"
}
@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"
}
@article{bpccd-tdcrs-81,
author = "S. Batnitzky and H. I. Price and P. N. Cook and
L. T. Cook and S. J. {Dwyer, III}",
title = "Three-dimensional computer reconstruction from
surface contours for head {CT} examinations",
journal = "J. Comput. Assisted Tomography",
volume = 5,
year = 1981,
pages = "60--67"
}
@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"
}
@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"
}
@article{b-solq-85,
author = "M. A. Bauer",
title = "Set operations on linear quadtrees",
journal = "Comput. Vision Graph. Image Process.",
volume = 29,
year = 1985,
pages = "248--258"
}
@inproceedings{bkkmnsu-osca-95,
author = "F. Bauern{\"o}ppel and E. Kranankis and D. Krizanc
and A. Maheshwari and M. Noy and J.-R. Sack and
J. Urrutia",
title = "Optimal shooting: characterizations and
applications",
booktitle = "Proc. 22nd ICALP",
site = "Szeged, Hungary",
series = LNCS,
volume = 944,
publisher = "Springer-Verlag",
year = 1995,
pages = "220--231"
}
@article{bkkmsu-psgca-97,
author = "F. Bauern{\"o}ppel and E. Kranankis and D. Krizanc
and A. Maheshwari and J.-R. Sack and J. Urrutia",
title = "Planar stage graphs: characterization and
applications",
journal = TCS,
volume = 175,
month = apr,
year = 1997
}
@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 = SIGGRAPH_1991,
keywords = "triangulation, computer graphics"
}
@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"
}
@article{b-cmp-88,
author = "E. B. Baum",
title = "On the capabilities of multilayer perceptrons",
journal = "J. Complexity",
volume = 4,
year = 1988,
pages = "19--25"
}
@article{bh-wsngv-89,
author = "E. B. Baum and D. Haussler",
title = "What size net gives valid generalization?",
journal = "Neural Computation",
volume = 1,
year = 1989,
pages = "151--160"
}
@inproceedings{b-prcv-75,
author = "B. G. Baumgart",
title = "A polyhedron representation for computer vision",
booktitle = "Proc. AFIPS Natl. Comput. Conf.",
volume = 44,
publisher = "AFIPS Press, Alrington, Va.",
year = 1975,
pages = "589--596"
}
@techreport{b-gmcv-74,
author = "B. G. Baumgart",
title = "Geometric Modeling for Computer Vision",
number = "STAN-CS-74463",
institution = "Dept. Comput. Sci., Stanford Univ.",
address = "Stanford, CA",
month = oct,
year = 1974
}
@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
}
@inproceedings{bjm-dplgs-92,
author = "Hanna Baumgarten and Hermann Jung and Kurt Mehlhorn",
title = "Dynamic Point Location in General Subdivisions",
booktitle = "Abstracts 8th European Workshop Comput. Geom.",
nickname = "CG '92",
site = "Utrecht",
publisher = "Utrecht University",
year = 1992,
pages = "81--83"
}
@inproceedings{bjm-dplgs-92i,
author = "H. Baumgarten and H. Jung and K. Mehlhorn",
title = "Dynamic point location in general subdivisions",
booktitle = SODA_1992,
year = 1992,
pages = "250--258"
}
@article{bjm-dplgs-94,
author = "H. Baumgarten and H. Jung and K. Mehlhorn",
title = "Dynamic point location in general subdivisions",
journal = JALG,
volume = 17,
year = 1994,
pages = "342--380"
}
@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"
}
@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"
}
@inproceedings{by-kmafr-90,
author = "J. J. Bausch and K. Youcef-Toumi",
title = "Kinematic methods for automated fixture
reconfiguration planning",
booktitle = "Proc. 7th IEEE Internat. Conf. Robot. Autom.",
month = may,
year = 1990
}
@incollection{bl-cacp-93,
author = "M. Bayer and C. Lee",
title = "Combinatorial aspects of convex polytopes",
chapter = "2.3",
editor = "P. Gruber and J. Wills",
booktitle = "Handbook of Convex Geometry",
publisher = "North-Holland",
address = "New York, NY",
year = 1993,
pages = "485--534"
}
@article{bk-nip-91,
author = "M. M. Bayer and A. Klapper",
title = "An new index for polytopes",
journal = DCG,
volume = 6,
year = 1991,
pages = "33--47"
}
@article{b-sbbtd-72,
author = "R. Bayer",
title = "Symmetric binary B-trees: data structure and
maintenace algorithms",
journal = "Acta Inform.",
volume = 1,
year = 1972,
pages = "290--306"
}
@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"
}
@incollection{btrv-svtbu-98,
author = "J. Bazik and R. Tamassia and S. P. Reiss and A. van
Dam",
title = "Software Visualization in Teaching at {Brown
University}",
editor = "J. Stasko and J. Domingue and M. H. Brown and
B. A. Price",
booktitle = "Software Visualization: Programming as a Multimedia
Experience",
publisher = "MIT Press",
year = 1998,
pages = "383--398",
keywords = "software visualization, algorithm animation"
}
@inproceedings{bh-obdpc-87,
author = "P. Beame and J. Hastad",
title = "Optimal bounds for decision problems on the {CRCW}
{PRAM}",
booktitle = STOC_1987,
year = 1987,
pages = "83--93"
}
@article{bh-obdpc-89,
author = "P. Beame and J. Hastad",
title = "Optimal Bounds for Decision Problems on the {CRCW}
{PRAM}",
journal = JACM,
volume = 36,
number = 3,
year = 1989,
pages = "643--670"
}
@book{b-gdg-83,
author = "A. F. Beardon",
title = "The Geometry of Discrete Groups",
series = "Graduate Texts in Mathematics",
publisher = "Springer-Verlag",
year = 1983
}
@article{bhh-sptmp-59,
author = "J. Beardwood and J. H. Halton and J. M. Hammersley",
title = "The shortest path through many points",
journal = "Math. Proc. Camb. Phil. Soc.",
volume = 55,
year = 1959,
pages = "299--327"
}
@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 = DCG,
volume = 6,
year = 1991,
pages = "575--592"
}
@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 = CGTA,
volume = 5,
year = 1995,
pages = "1--25"
}
@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"
}
@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"
}
@article{b-srnpt-83,
author = "J. Beck",
title = "On size {Ramsey} number of paths, trees, and
circuits, {I}.",
journal = "J. Graph Theory",
volume = 7,
year = 1983,
pages = "115--129"
}
@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"
}
@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"
}
@book{bc-id-87,
author = "J. Beck and W. Chen",
title = "Irregularities of distribution",
publisher = "Cambridge University Press",
year = 1987
}
@article{bfh-sam-86,
author = "J. Beck and R. Farouki and J. Hinds",
title = "Surface Analysis Methods",
journal = "IEEE Comput. Graph. Appl.",
volume = "??",
year = 1986,
pages = "18--36"
}
@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"
}
@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
}
@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 = JALG,
volume = 21,
year = 1996,
pages = "520--541"
}
@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
}
@inproceedings{bfgotw-oaasr-91i,
author = "Bruno Becker and Paolo Giulio Franciosa and Stephan
Gschwind and Thomas Ohler and Gerald Thiemt and
Peter Widmayer",
title = "An optimal algorithm for approximating a set of
rectangles by two minimum area rectangles",
booktitle = "Proc. Computational Geometry: Methods, Algorithms
and Applications",
nickname = "CG '91",
site = "Bern",
series = LNCS,
volume = 553,
publisher = "Springer-Verlag",
year = 1991,
pages = "13--25",
annote = "7th Intern. Workshop Comput. Geom."
}
@inproceedings{bfgotw-embop-92,
author = "B. Becker and P. G. Franciosa and S. Gschwind and
T. Ohler and G. Thiemt and P. Widmayer",
title = "Enclosing many boxes by an optimal pair of boxes",
booktitle = "Proc. 9th Sympos. Theoret. Aspects Comput. Sci.",
series = LNCS,
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 = SICOMP,
volume = 16,
number = 5,
year = 1987,
pages = "946--972",
keywords = "graph drawing"
}
@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"
}
@techreport{bo-lwbl-84,
author = "B. Becker and H. G. Osthof",
title = "Layouts with wires of balanced length",
type = "Report",
number = "??",
institution = "Univ. Saarlandes",
address = "Saarbr{\"u}cken, West Germany",
year = 1984
}
@inproceedings{bsw-spsat-91,
author = "B. Becker and H. W. Six and P. Widmayer",
title = "Spatial priority search: {An} access technique for
scaleless maps",
booktitle = SIGMOD,
year = 1991,
pages = "128--138"
}
@inproceedings{bw-mvl-90,
author = "Bruno Becker and Peter Widmayer",
title = "{Ma{\ss}stabsunabh{\"a}ngige} {Verwaltung} von
{Landkarten}",
booktitle = "Abstracts 6th Intern. Workshop Comput. Geom.",
nickname = "CG '90",
site = "Siegen",
publisher = "Universit{\"a}t Siegen",
year = 1990,
pages = 5
}
@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 = SIGMOD,
year = 1990,
pages = "322--331"
}
@phdthesis{b-msvav-92,
author = "B. B. Bederson",
title = "A miniature space-variant active vision system:
{Cortex}-{I}",
school = "Dept. Comput. Sci., Courant Inst. Math. Sci., New
York Univ.",
address = "New York, NY",
year = 1992,
keywords = "doctoral thesis"
}
@book{bbf-fmg-86,
author = "Behnke and Bachmann and Fladt",
title = "Fundamentals of mathematics, geometry",
volume = 1,
publisher = "MIT Press",
year = 1986
}
@article{b-udkuu-38,
author = "F. Behrend",
title = "{\"U}ber die kleinste umbeschriebene und die
gr{\"o}{\ss}te einbeschriebene {Ellipse} eines
konvexen {Bereiches}",
journal = "Math. Ann.",
volume = 115,
year = 1938,
pages = "379--411"
}
@mastersthesis{b-azede-90,
author = "B. Behrends",
title = "Algorithmen zur {Erkennung} der
$\epsilon$-{Kongruenz} von {Punktmengen} und
{Polygonen}",
school = "Freie Universit{\"a}t Berlin",
address = "Berlin, Germany",
year = 1990,
note = "Diploma Thesis",
keywords = "master thesis"
}
@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",
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 = CCCG_1990,
year = 1990,
pages = "107--111"
}
@techreport{bg-sos-87,
author = "R. Beigel and J. Gill",
title = "Sorting $n$ Objects with a $k$-sorter",
institution = "The John Hopkins University",
year = 1987
}
@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"
}
@misc{blp-despp-92,
author = "W. Bein and L. Larmore and J. Park",
title = "The $d$-edge shortest-path problem for a {Monge}
graph",
year = 1992,
note = "Preprint"
}
@inproceedings{bs-ilmth-98,
author = "Ronald Beirouti and J. Snoeyink",
title = "Implementations of the LMT Heuristic for Minimum
Weight Triangulations",
booktitle = SOCG_1998,
year = 1998,
pages = "96--105"
}
@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"
}
@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"
}
@inproceedings{bglr-epcpa-93,
author = "M. Bellare and S. Goldwasser and C. Lund and
A. Russel",
title = "Efficient probabilistically checkable proofs and
applications to approximation",
booktitle = STOC_1993,
year = 1993,
pages = "294--304"
}
@inproceedings{bs-inar-94,
author = "M. Bellare and M. Sudan",
title = "Improved non-approximability results",
booktitle = STOC_1994,
year = 1994,
pages = "184--193"
}
@mastersthesis{b-ctcsp-91,
author = "P. 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 = "P. Belleville",
title = "Convex Covers in Higher Dimensions",
booktitle = CCCG_1995,
year = 1995,
pages = "145--150"
}
@inproceedings{b-rbcct-93,
author = "P. Belleville",
title = "On restricted boundary covers and convex
three-covers",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "467--472"
}
@inproceedings{b-ppmih-91,
author = "P. Belleville",
title = "Probing polygons minimally is hard",
booktitle = CCCG_1991,
year = 1991,
pages = "50--53"
}
@inproceedings{b-tgsp-92,
author = "P. Belleville",
title = "Two-guarding simple polygons",
booktitle = CCCG_1992,
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 = CCCG_1994,
year = 1994,
pages = "381--386"
}
@inproceedings{bkms-cetaa-96,
author = "P. Belleville and M. Keil and M. McAllister and
J. Snoeyink",
title = "On computing edges that are in all minimum-weight
triangulations",
booktitle = SOCG_1996,
year = 1996,
pages = "V7--V8"
}
@techreport{bs-ppmh-91,
author = "P. Belleville and T. Shermer",
title = "Probing polygons minimially is hard",
type = "Technical {Report}",
number = "91-12",
institution = "Dept. Comput. Sci., Simon Fraser Univ.",
address = "Burnaby, BC",
month = dec,
year = 1991
}
@article{bs-ppmih-93,
author = "P. Belleville and T. C. Shermer",
title = "Probing Polygons Minimally is Hard",
journal = CGTA,
volume = 2,
number = 5,
month = mar,
year = 1993,
pages = "255--265"
}
@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"
}
@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
}
@article{bbdr-msdtc-00,
author = "A. Below and U. Brehm and J. A. {De Loera} and
J. Richter-Gebert",
title = "Minimal simplicial dissections and triangulations of
convex 3-polytopes",
journal = DCG,
volume = 24,
year = 2000,
pages = "35--48"
}
@unpublished{bdr-cfst-00,
author = "A. Below and J. A. {De Loera} and J. Richter-Gebert",
title = "The complexity of finding small triangulations of
convex 3-polytopes",
year = 2000,
note = "Manuscript. \url{http://www.inf.ethz.ch/personal/richter/}"
}
@article{bft-crup-01,
author = "A. Bemporad and K. Fukuda and F. D. Torrisi",
title = "Convexity recognition of the union of polyhedra",
journal = CGTA,
volume = 18,
year = 2001,
pages = "141--154"
}
@inproceedings{b-lbara-95,
author = "Amir M. Ben-Amram",
title = "Lower Bounds on Algebraic Random Access Machines",
booktitle = "Proc. 22nd Internat. Colloq. Automata Lang. Prog.",
nickname = "ICALP '95",
series = LNCS,
volume = 944,
publisher = "Springer-Verlag",
year = 1995,
pages = "360--371",
abstract = "The method of proving lower bounds for decision
problems by topological component counting,
previously used with respect to algebraic
computation trees, is extended in this work to
random access machines with operations
$\{+,-,\times,/\}$ or
$\{+,-,\times,\lfloor\;\rfloor\}$."
}
@article{b-wipm-95,
author = "Amir M. Ben-Amram",
title = "What is a ``Pointer Machine''?",
journal = "SIGACT News",
volume = 26,
year = 1995,
pages = "88--95"
}
@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 = STOC_1990,
year = 1990,
pages = "379--386"
}
@inproceedings{bk-adspp-01,
author = "Boaz Ben-Moshe and Matthew J. Katz",
title = "Approximating the Diameter of a Set of Points in the
Presence of Rectangular Obstacles",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "154--157"
}
@article{bks-oflcs-00,
author = "B. Ben-Moshe and M. J. Katz and M. Segal",
title = "Obnoxious facility location: complete service with
minimal harm",
journal = IJCGA,
volume = 10,
year = 2000,
pages = "581--592"
}
@inproceedings{b-actcp-94,
author = "Michael Ben-Or",
title = "Algebraic Computation Trees in Characteristic
{$p>0$}",
booktitle = FOCS_1994,
year = 1994,
pages = "534--539"
}
@inproceedings{b-lbact-83,
author = "M. Ben-Or",
title = "Lower bounds for algebraic computation trees",
booktitle = STOC_1983,
year = 1983,
pages = "80--86"
}
@article{bkr-ceag-86,
author = "M. Ben-Or and D. Kozen and J. H. Reif",
title = "The complexity of elementary algebra and geometry",
journal = "J. Comput. Syst. Sci.",
volume = 32,
year = 1986,
pages = "251--264"
}
@article{bs-cht-90,
author = "Ben-Tzvi and D. and M. B. Sandler",
title = "A Combinatorial Hough Transform",
journal = "Pattern Recogn. Lett.",
volume = "??",
number = 11,
year = 1990,
pages = "167--174"
}
@article{bd-rstod-86,
author = "H. Bendelt and A. Dress",
title = "Reconstructing the shape of a tree from observed
dissimilarity data",
journal = "Adv. Appl. Math.",
volume = 7,
year = 1986,
pages = "309--343"
}
@book{bo-ammse-78,
author = "C. M. Bender and S. A. Orszag",
title = "Advanced mathematical methods for scientists and
engineers",
series = "International Series in Pure and Applied
Mathematics",
publisher = "McGraw-Hill",
year = 1978
}
@article{b-ame-74,
author = "E. A. Bender",
title = "Asymptotic methods in enumeration",
journal = "SIAM Rev.",
volume = 16,
number = 4,
month = oct,
year = 1974,
pages = "485--515"
}
@article{bcm-anlcg-90,
author = "E. A. Bender and E. R. Candfield and B. D. McKay",
title = "The asymptotic number of labeled connected graphs
with a given number of vertices and edges",
journal = "Random Structures and Algorithms",
volume = 1,
number = 2,
year = 1990,
pages = "127--169"
}
@inproceedings{bf-lpr-00,
author = "M. A. Bender and M. Farach-Colton",
title = "The {LCA} problem revisited",
booktitle = "Proceedings of the 4th Latin American Symposium on
Theoretical Informatics",
series = LNCS,
volume = 1776,
publisher = "Springer-Verlag",
address = "Berlin",
year = 2000,
pages = "88--94"
}
@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 = DCG,
volume = 6,
year = 1991,
pages = "191--209"
}
@book{br-rasas-90,
author = "R. Benedetti and J.-J. Risler",
title = "Real algebraic and semi-algebraic sets",
series = "Actualit{\'e}s math{\'e}matiques",
publisher = "Hermann",
address = "Paris",
year = 1990
}
@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"
}
@article{bn-ciimc-64,
author = "B.-E. Bengtsson and S. Norbeck",
title = "Construction of isarithms and isarithmic maps by
computers",
journal = "BIT",
volume = 4,
year = 1964,
pages = "87--105"
}
@inproceedings{b-rbasv-90,
author = "Daniel Benninger",
title = "{R-B{\"a}ume} und {Abfragen} auf skalarwertigen
{Vektorkarten}",
booktitle = "Abstracts 6th Intern. Workshop Comput. Geom.",
nickname = "CG '90",
site = "Siegen",
publisher = "Universit{\"a}t Siegen",
year = 1990,
pages = 6
}
@inproceedings{bc-arstp-92,
author = "I. Bennour and J. Cloutier",
title = "Approximation of the rectilinear {Steiner} tree
problem with neural networks",
booktitle = "Canadian Conf. on VLSI",
site = "Halifax",
month = oct,
year = 1992
}
@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 = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "73--78"
}
@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"
}
@book{b-egc-66,
author = "R. V. Benson",
title = "Euclidean Geometry and Convexity",
publisher = "McGraw-Hill",
address = "New York, NY",
year = 1966
}
@article{bst-bst-85,
author = "S. W. Bent and D. D. Sleator and R. E. Tarjan",
title = "Biased Search Trees",
journal = SICOMP,
volume = 14,
year = 1985,
pages = "545--568"
}
@unpublished{b-akrp-77,
author = "J. Bentley",
title = "Algorithms for {Klee's} rectangle problems",
year = 1977,
note = "unpublished manuscript, Dept. of Computer Science,
Carnegie-Mellon University"
}
@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 = IPL,
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"
}
@inproceedings{b-etsh-90,
author = "J. L. Bentley",
title = "Experiments on traveling salesman heuristics",
booktitle = SODA_1990,
site = "San Francisco, CA",
month = jan,
year = 1990,
pages = "91--99"
}
@article{b-fagts-92,
author = "Jon Louis Bentley",
title = "Fast Algorithms for Geometric Traveling Salesman
Problems",
journal = "ORSA J. Comput.",
volume = 4,
number = 4,
year = 1992,
pages = "387--411",
annote = "Special issue on computational geometry; J. Mitchell
and J. Karel Lenstra, eds."
}
@inproceedings{b-kdtsp-90,
author = "J. L. Bentley",
title = "{$K$}-d trees for semidynamic point sets",
booktitle = SOCG_1990,
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,
month = sep,
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"
}
@article{b-pqrr-79,
author = "J. L. Bentley",
title = "Priority queues with range restriction",
journal = "Bull. EATCS",
volume = 9,
year = 1979,
pages = "7--8"
}
@book{b-pp-85,
author = "J. L. Bentley",
title = "Programming Pearls",
publisher = "Addison-Wesley",
address = "Reading, MA",
year = 1985
}
@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
}
@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 = IPL,
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 = SODA_1990,
year = 1990,
pages = "179--187"
}
@techreport{bfpp-tpcg-80,
author = "J. L. Bentley and G. M. Faust and
C. H. Papadimitriou and F. P. Preparata",
title = "Two papers on computational geometry",
type = "Report",
number = "CMU-CS-80-109",
institution = "Carnegie-Mellon Univ.",
address = "Pittsburgh, PA",
year = 1980
}
@article{bfp-aach-82,
author = "J. L. Bentley and G. M. Faust and F. P. Preparata",
title = "Approximation algorithms for convex hulls",
journal = "Commun. ACM",
volume = 25,
year = 1982,
pages = "64--68",
keywords = "designing algorithms, convex hull, approximation,
two-dimensional, worst-case analysis",
annote = "$O(n)$ time"
}
@article{bf-dsrs-79,
author = "J. L. Bentley and J. H. Friedman",
title = "Data structures for range searching",
journal = "ACM Comput. Surv.",
volume = 11,
year = 1979,
pages = "397--409"
}
@article{bf-facms-78,
author = "J. L. Bentley and J. H. Friedman",
title = "Fast algorithms for constructing minimal spanning
trees in coordinate spaces",
journal = "IEEE Trans. Comput.",
volume = "C-27",
year = 1978,
pages = "97--105"
}
@inproceedings{bhh-fgavt-81,
author = "J. L. Bentley and D. Haken and R. W. Hon",
title = "Fast geometric algorithms for {VLSI} tasks",
booktitle = "Proc. Comput. Conf.",
year = 1981,
pages = "88--92"
}
@article{bkv-eccm-91,
author = "J. L. Bentley and B. Kernigham and C. {Van Wyk}",
title = "An elementary {C} cost model",
journal = "UNIX Review",
volume = 9,
number = 2,
year = 1991,
pages = "38--48"
}
@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 = JACM,
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 = IPL,
volume = 8,
year = 1979,
pages = "133--136"
}
@article{bm-ewcds-80,
author = "J. L. Bentley and H. A. Maurer",
title = "Efficient worst-case data structures for range
searching",
journal = "Acta Inform.",
volume = 13,
year = 1980,
pages = "155--168"
}
@incollection{bow-cmhds-83,
author = "Jon Louis Bentley and Thomas Ottmann and Peter
Widmayer",
title = "The Complexity of Manipulating Hierarchically
Defined Sets of Rectangles",
editor = "F. P. Preparata",
booktitle = "Computational Geometry",
series = "Adv. Comput. Res.",
volume = 1,
publisher = "JAI Press",
address = "Greenwich, Conn.",
year = 1983,
pages = "127--158",
keywords = "isothetic, rectangles, data structuring"
}
@article{bo-arcgi-79,
author = "J. L. Bentley and T. A. Ottmann",
title = "Algorithms for reporting and counting geometric
intersections",
journal = "IEEE Trans. Comput.",
volume = "C-28",
number = 9,
month = sep,
year = 1979,
pages = "643--647"
}
@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 = LNCS,
volume = 118,
publisher = "Springer-Verlag",
year = 1982,
pages = "1--15"
}
@article{bs-avs-79,
author = "J. L. Bentley and J. B. Saxe",
title = "Algorithms on vector sets",
journal = "SIGACT News",
volume = 11,
year = 1979,
pages = "36--39"
}
@inproceedings{bs-athet-80,
author = "J. L. Bentley and J. B. Saxe",
title = "An analysis of two heuristics for the {Euclidean}
traveling salesman problem",
booktitle = "Proc. 18th Allerton Conf. Commun. Control Comput.",
year = 1980,
pages = "41--49"
}
@article{bs-dsp1s-80,
author = "J. L. Bentley and J. B. Saxe",
title = "Decomposable searching problems {I}:
{S}tatic-to-dynamic transformations",
journal = JALG,
volume = 1,
year = 1980,
pages = "301--358"
}
@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 = IPL,
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 = STOC_1976,
year = 1976,
pages = "220--230"
}
@article{bs-arsqt-75,
author = "J. L. Bentley and D. F. Stanat",
title = "Analysis of range searches in quad trees",
journal = IPL,
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 = IPL,
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 = SOCG_1995,
year = 1995,
pages = "C4--C5"
}
@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"
}
@inproceedings{bbbkk-fpssm-97,
author = "S. Berchtold and C. B{\"o}hm and B. Barunm{\"u}ller
and D. A. Keim and H.-P. Kriegel",
title = "Fast parallel similarity search in multimedia
databases",
booktitle = SIGMOD,
year = 1997,
pages = "1--12"
}
@inproceedings{bbkk-cmnns-97,
author = "S. Berchtold and C. B{\"o}hm and D. A. Keim and
H.-P. Kriegel",
title = "A cost model for nearest neighbor search in
high-dimensional data space",
booktitle = "Proc. Annu. ACM Sympos. Principles Database Syst.",
year = 1997,
pages = "78--86"
}
@inproceedings{bkk-xtish-96,
author = "S. Berchtold and D. A. Keim and H.-P. Kriegel",
title = "The {X}-tree: {A}n index structure for higher
dimensional data",
booktitle = "Proc. 22th VLDB Conference",
year = 1996,
pages = "28--39"
}
@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"
}
@article{bklo-gasra-87,
author = "C. A. Berenstein and L. N. Kanal And D. Lavine and
E. Olson",
title = "A geometric approach to subpixel registration
accuracy",
journal = "Comput. Vision Graph. Image Process.",
volume = 40,
number = 3,
year = 1987,
pages = "334--360"
}
@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"
}
@inproceedings{bos-oppp-00,
author = "Robert-Paul Beretty and Mark H. Overmars and
A. Frank van der Stappen",
title = "Orienting Polyhedral Parts by Pushing",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "136--139"
}
@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"
}
@article{b-chpsd-96,
author = "M. de Berg",
title = "Computing half-plane and strip discrepancy of planar
point sets",
journal = CGTA,
volume = 6,
year = 1996,
pages = "69--83"
}
@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
}
@article{b-doshs-92,
author = "M. de Berg",
title = "Dynamic output-sensitive hidden surface removal for
$c$-oriented polyhedra",
journal = CGTA,
volume = 2,
number = 3,
year = 1992,
pages = "119--140"
}
@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"
}
@inproceedings{b-ghsr-93,
author = "M. de Berg",
title = "Generalized hidden surface removal",
booktitle = SOCG_1993,
year = 1993,
pages = "1--10"
}
@article{b-ghsr-96,
author = "M. de Berg",
title = "Generalized hidden surface removal",
journal = CGTA,
volume = 5,
year = 1996,
pages = "249--276"
}
@inproceedings{b-lsbsp-95,
author = "M. de~Berg",
title = "Linear Size Binary Space Partitions for Fat Objects",
booktitle = "Proc. 3rd Annu. European Sympos. Algorithms",
series = LNCS,
volume = 979,
publisher = "Springer-Verlag",
year = 1995,
pages = "252--263"
}
@article{b-lsbsp-00,
author = "M. de~Berg",
title = "Linear size binary space partitions for uncluttered
scenes",
journal = "Algorithmica",
volume = 28,
year = 2000,
pages = "353--366"
}
@techreport{d-rld-89,
author = "M. de Berg",
title = "On Rectilinear Link Distance",
type = "Technical Report",
number = "RUU-CS-89-13",
institution = "Dept. of Computer Science, Univ. of Utrecht",
year = 1989
}
@article{b-rld-91,
author = "M. de Berg",
title = "On Rectilinear Link Distance",
journal = CGTA,
volume = 1,
number = 1,
month = jul,
year = 1991,
pages = "13--34",
keywords = "motion planning, rectilinear paths, rectilinear
polygons, linkdistance",
annote = "He considers rectilinear paths in a rectilinear
simple polygon. In $O(n\log n)$ preprocessing time
and space, he builds a data structure that supports
$O(\log n)$ time queries for distance between two
points ($O(1)$ time between two polygon
vertices). He is actually searching for paths that
are``smallest'' in that they are shortest
simultaneously in rectilinear link distance and
$L_1$ length (which is always possible). See
improvements to $O(n)$ time and space by Lingas,
Maheshwari, and Sack~\cite{lms-parld-95} and
Schuierer~\cite{s-odssr-96}."
}
@book{b-rsdoh-93,
author = "M. de Berg",
title = "Ray Shooting, Depth Orders and Hidden Surface
Removal",
series = LNCS,
volume = 703,
publisher = "Springer-Verlag",
address = "Berlin, Germany",
year = 1993,
keywords = "book, ray shooting, depth orders, hidden surface
removal, translation orders, graphics, data
structures"
}
@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 = SWAT_1990,
series = LNCS,
volume = 447,
publisher = "Springer-Verlag",
year = 1990,
pages = "60--70"
}
@inproceedings{b-tpwah-90,
author = "M. de~Berg",
title = "Translating Polygons With Applications to Hidden
Surface Removal",
booktitle = "Abstracts 6th Intern. Workshop Comput. Geom.",
nickname = "CG '90",
site = "Siegen",
publisher = "Universit{\"a}t Siegen",
year = 1990,
pages = 7
}
@article{b-tdcg-97,
author = "M. de Berg",
title = "Trends and developments in computational geometry",
journal = "Comput. Graph. Forum",
volume = 16,
year = 1997,
pages = "3--30"
}
@inproceedings{bbbrw-ccmwa-97,
author = "M. de Berg and J. Bose and D. Bremner and
S. Ramaswami and G. Wilfong",
title = "Computing constrained minimum-width annuli of point
sets",
booktitle = WADS_1997,
nickname = "WADS '97",
site = "Halifax, Canada",
series = LNCS,
volume = 1272,
publisher = "Springer-Verlag",
year = 1997,
pages = "3--16"
}
@article{bbbrw-ccmwa-98,
author = "M. de Berg and P. Bose and D. Bremner and
S. Ramaswami and G. Wilfong",
title = "Computing Constrained Minimum-Width Annuli of Point
Sets",
journal = "Comput. Aided Design",
volume = 30,
number = 4,
month = apr,
year = 1998,
pages = "267--275"
}
@inproceedings{bbdkogrsy-crtt-96,
author = "M. de Berg and P. Bose and K. Dobrint and M. van
Kreveld and M. H. Overmars and M. de Groot and
T. Roos and J. Snoeyink and S. Yu",
title = "The complexity of rivers in triangulated terrains",
booktitle = CCCG_1996,
year = 1996,
pages = "325--330"
}
@article{bcdkt-cmotc-98,
author = "M. de~Berg and Otfried Cheong and O. Devillers and
Mark van Kreveld and M. Teillaud",
title = "Computing the Maximum Overlap of Two Convex Polygons
Under Translations",
journal = "Theory of Computing Systems",
volume = 31,
year = 1998,
pages = "613--628",
url = "http://www-sop.inria.fr/prisme/biblio/search.html",
abstract = "Let $P$ be a convex polygon in the plane with $n$
vertices and let $Q$ be a convex polygon with $m$
vertices. We prove that the maximum number of
combinatorially distinct placements of $Q$ with
respect to $P$ under translations is
$O(n^2+m^2+\min(nm^2+n^2m))$, and we give an example
showing that this bound is tight in the worst
case. Second, we present an $O((n+m)\log(n+m))$
algorithm for determining a translation of $Q$ that
maximizes the area of overlap of $P$ and $Q$. We
also prove that the placement of $Q$ that makes the
centroids of $Q$ and $P$ coincide realizes an
overlap of at least $9/25$ of the maximum possible
overlap. As an upper bound, we show an example where
the overlap in this placement is $4/9$ of the
maximum possible overlap."
}
@article{bdds-cscot-97,
author = "M. de~Berg and O. Devillers and Katrin Dobrindt and
O. Schwarzkopf",
title = "Computing a Single Cell in the Overlay of Two Simple
Polygons",
journal = IPL,
volume = 63,
number = 4,
month = aug,
year = 1997,
pages = "215--219",
url = "http://www-sop.inria.fr/prisme/biblio/search.html",
abstract = "This note combines the lazy randomized incremental
construction scheme with the technique of
``connectivity acceleration'' to obtain an
$O(n(\log^{\star}n)^2)$ time randomized algorithm to
compute a single face in the overlay of two simple
polygons in the plane."
}
@techreport{bdds-cscut-95,
author = "M. de~Berg and O. Devillers and Katrin 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/RRRT/RR-2626",
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 = "M. de~Berg and O. Devillers and M. van~Kreveld and
O. Schwarzkopf and M. Teillaud",
title = "Computing the maximum overlap of two convex polygons
under translations",
booktitle = ISAAC_1996,
nickname = "ISAAC'96",
series = LNCS,
volume = 1178,
publisher = "Springer-Verlag",
year = 1996,
pages = "126--135"
}
@inproceedings{bd-ldt-95,
author = "M. de~Berg and Katrin Dobrindt",
title = "On Levels of Detail in Terrains",
booktitle = SOCG_1995,
year = 1995,
pages = "C26--C27",
keywords = "Delaunay triangulation, surface simplification,
decimation"
}
@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"
}
@inproceedings{bds-lric-94,
author = "M. de Berg and K. Dobrindt and O. Schwarzkopf",
title = "On Lazy Randomized Incremental Construction",
booktitle = STOC_1994,
year = 1994,
pages = "105--114",
comments = "Full and ftp-able version see bds-lric-94t."
}
% also claimed, pages = "161--186"
@article{bds-lric-95,
author = "M. de Berg and K. Dobrindt and O. Schwarzkopf",
title = "On lazy randomized incremental construction",
journal = DCG,
volume = 14,
year = 1995,
pages = "261--286"
}
@article{bd-ldt-98,
author = "M. de Berg and K. T. G. Dobrindt",
title = "On Levels of Details in Terrains",
journal = "Graph. Models Image Process.",
volume = 60,
number = 1,
month = jan,
year = 1998,
pages = "1--12"
}
@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"
}
@article{bew-tqsp-95,
author = "M. de Berg and H. Everett and H. Wagener",
title = "Translation queries for sets of polygons",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "221--242",
keywords = "convex hull, embedding, depth order"
}
@inproceedings{bg-bspsc-94,
author = "M. de~Berg and Marko de Groot",
title = "Binary Space Partitions for Sets of Cubes",
booktitle = "Abstracts 10th European Workshop Comput. Geom.",
nickname = "CG '94",
site = "Santander",
publisher = "Universidad de Cantabria, Santander",
year = 1994,
pages = "85--88"
}
@inproceedings{bgo-nrbsp-94,
author = "M. de~Berg and Marko de Groot and M. H. Overmars",
title = "New Results on Binary Space Partitions in the Plane",
booktitle = SWAT_1994,
series = LNCS,
volume = 824,
publisher = "Springer-Verlag",
year = 1994,
pages = "61--72"
}
@article{bgo-nrbsp-97,
author = "M. de~Berg and Marko de Groot and M. H. Overmars",
title = "New Results on Binary Space Partitions in the Plane",
journal = CGTA,
volume = 8,
year = 1997,
pages = "317--333"
}
@inproceedings{bgo-pbsp-93,
author = "M. de Berg and M. de Groot and M. H. Overmars",
title = "Perfect binary space partitions",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "109--114"
}
@article{bgo-pbsp-97,
author = "M. de Berg and M. de Groot and M. H. Overmars",
title = "Perfect binary space partitions",
journal = CGTA,
volume = 7,
year = 1997,
pages = "81--91"
}
@inproceedings{bghosst-rgdu-93,
author = "M. de~Berg and Leonidas Guibas and D. Halperin and
M. H. Overmars and O. Schwarzkopf and M. Sharir and
M. Teillaud",
title = "Reaching a Goal with Directional Uncertainty",
booktitle = ISAAC_1993,
nickname = "ISAAC '93",
series = LNCS,
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"
}
@article{bghosst-rgdu-95,
author = "M. de~Berg and Leonidas Guibas and D. Halperin and
M. H. Overmars and O. Schwarzkopf and M. Sharir and
M. Teillaud",
title = "Reaching a Goal with Directional Uncertainty",
journal = TCS,
volume = 140,
year = 1995,
pages = "301--317",
url = "ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
}
@inproceedings{bgh-vdt3s-94,
author = "M. de Berg and L. J. Guibas and D. Halperin",
title = "Vertical Decompositions for Triangles in $3$-Space",
booktitle = SOCG_1994,
year = 1994,
pages = "1--10"
}
@article{bgh-vdt3s-96,
author = "M. de Berg and L. J. Guibas and D. Halperin",
title = "Vertical decompositions for triangles in $3$-space",
journal = DCG,
volume = 15,
year = 1996,
pages = "35--61"
}
@techreport{bhok-sanvp-91,
author = "M. de Berg and D. Halperin and M. H. Overmars and
M. van Kreveld",
title = "Sparse arrangements and the number of views of
polyhedral scenes",
type = "manuscript",
year = 1991
}
@techreport{bhok-sanvp-92,
author = "M. de Berg and D. Halperin and M. H. 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
}
@article{bhok-sanvp-97,
author = "M. de Berg and D. Halperin and M. H. Overmars and
M. van Kreveld",
title = "Sparse arrangements and the number of views of
polyhedral scenes",
journal = IJCGA,
volume = 7,
year = 1997,
pages = "175--195"
}
@inproceedings{bhosk-ershs-91,
author = "M. de Berg and D. Halperin and M. H. Overmars and
J. Snoeyink and M. van Kreveld",
title = "Efficient ray shooting and hidden surface removal",
booktitle = SOCG_1991,
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. H. 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"
}
@inproceedings{bkosv-mmp-98,
author = "M. de~Berg and Matthew Katz and M. H. Overmars and
A. Frank van der Stappen and Jules Vleugels",
title = "Models and Motion Planning",
booktitle = SWAT_1998,
nickname = "SWAT '98",
site = "Stockholm",
series = LNCS,
volume = 1432,
publisher = "Springer-Verlag",
year = 1998,
pages = "83--94"
}
@inproceedings{bksv-rimga-97,
author = "M. de Berg and M. J. Katz and A. F. van der Stappen
and J. Vleugels",
title = "Realistic Input Models for Geometric Algorithms",
booktitle = SOCG_1997,
year = 1997,
pages = "294--303"
}
@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
}
@article{bk-rdlsn-94,
author = "M. de Berg and M. van Kreveld",
title = "Rectilinear decompositions with low stabbing number",
journal = IPL,
volume = 52,
year = 1994,
pages = "215--221"
}
@incollection{bk-tawfg-93,
author = "M. de~Berg and M. van~Kreveld",
title = "Trekking in the Alps Without Freezing or Getting
Tired",
booktitle = "Proc. 1st Annu. European Sympos. Algorithms",
series = LNCS,
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"
}
@article{bk-tafgt-97,
author = "M. de Berg and M. van Kreveld",
title = "Trekking in the alps without freezing or getting
tired",
journal = "Algorithmica",
volume = 18,
year = 1997,
pages = "306--323"
}
@inproceedings{bkn-spqrw-91,
author = "M. de Berg and M. van Kreveld and Bengt J. Nilsson",
title = "Shortest path queries in rectilinear worlds of
higher dimension",
booktitle = SOCG_1991,
year = 1991,
pages = "51--60"
}
@techreport{bkno-fsppo-90t,
author = "M. de Berg and M. van Kreveld and Bengt J. Nilsson
and M. H. Overmars",
title = "Finding shortest paths in the presence of orthogonal
obstacles using a combined {$L_{1}$} and link
metric",
type = "Report",
number = "RUU-CS-90-20",
institution = "Dept. Comput. Sci., Utrecht Univ.",
address = "Utrecht, Netherlands",
year = 1990
}
@inproceedings{bkno-fsppo-90i,
author = "M. de Berg and M. van Kreveld and Bengt J. Nilsson
and M. H. Overmars",
title = "Finding shortest paths in the presence of orthogonal
obstacles using a combined {$L_{1}$} and link
metric",
booktitle = SWAT_1990,
series = LNCS,
volume = 447,
publisher = "Springer-Verlag",
year = 1990,
pages = "213--224",
keywords = "shortest paths, rectilinear paths, rectilinear
obstacles, combined metric",
annote = "They consider rectilinear paths among $n$
axis-parallel line segment obstacles (possibly
crossing). They preprocess in time $O(n^2)$, space
$O(n\log n)$, for single-source shortest paths in
query time $O(\log n)$. Distance is measured in a
combined metric: linear combination of rectilinear
link distance and $L_1$ path length"
}
@article{bkno-spqrw-92,
author = "M. de Berg and M. van Kreveld and Bengt J. Nilsson
and M. H. Overmars",
title = "Shortest path queries in rectilinear worlds",
journal = IJCGA,
volume = 2,
number = 3,
year = 1992,
pages = "287--309",
keywords = "shortest paths, rectilinear paths, rectilinear
obstacles, combined metric",
abstract = " In this paper, a data structure is given for two
and higher dimensional shortest path queries. For a
set of $n$ axis-parallel rectangles in the plane, or
boxes in $d$-space, and a fixed target, it is
possible with this structure to find a shortest
rectilinear path avoiding all rectangles or boxes
from any point to this target. Alternatively, it is
possible to find the length of the path. The metric
considered is a generalization of the $L_1$-metric
and the link metric, where the length of a path is
its $L_1$-length plus some (fixed) constant times
the number of turns on the path. The data structure
has size $O((n\log n)^{d-1})$, and a query takes
$O(\log^{d-1} n)$ time (plus the output size if the
path must be reported). As a byproduct, a relatively
simple solution to the single shot problem is
obtained; the shortest path between two given points
can be computed in time $O(n^d \log n)$ for $d\geq
3$ and in time $O(n^2)$ in the plane."
}
@article{bkoo-stses-97,
author = "M. de Berg and M. van Kreveld and R. van Oostrum and
M. H. Overmars",
title = "Simple traversal of a subdivision without extra
storage",
journal = "International Journal on Geographical Information
Science",
volume = 11,
year = 1997,
pages = "359--373"
}
@book{bkos-cgaa-97,
author = "M. de~Berg and M. van~Kreveld and M. H. Overmars and
O. Schwarzkopf",
title = "Computational Geometry: Algorithms and Applications",
publisher = "Springer-Verlag",
address = "Berlin",
year = 1997,
isbn = "3-540-61270-X",
url = "http://www.cs.ruu.nl/geobook/",
keywords = "textbook"
}
@book{bkos-cgaa-00,
author = "M. de~Berg and M. van~Kreveld and M. H. Overmars and
O. Schwarzkopf",
title = "Computational Geometry: Algorithms and Applications",
edition = "2nd",
publisher = "Springer-Verlag",
address = "Berlin, Germany",
year = 2000
}
@techreport{bkos-cge-95,
author = "M. de Berg and M. van Kreveld and M. H. Overmars and
O. Schwarzkopf",
title = "Computational Geometry by Example",
type = "Manuscript",
institution = "??",
year = 1995
}
@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"
}
@inproceedings{bks-lsctp-95,
author = "M. de Berg and M. van Kreveld and S. Schirra",
title = "Line simplification consistent with tag points",
booktitle = "Proc. Auto-Carto 12",
year = 1995,
note = "to appear"
}
@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 = CGTA,
volume = 6,
year = 1996,
pages = "131--143",
keywords = "zones, arrangements, point location, many cells"
}
@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
}
@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 = CCCG_1991,
month = aug,
year = 1991,
pages = "228--232"
}
@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
}
@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 = SWAT_1992,
series = LNCS,
volume = 621,
publisher = "Springer-Verlag",
year = 1992,
pages = "352--363"
}
@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 = JALG,
volume = 18,
year = 1995,
pages = "256--277"
}
@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 = STOC_1993,
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",
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 = DCG,
volume = 14,
year = 1995,
pages = "9--29",
keywords = "configuration space, motion planning, convex,
robotics"
}
@inproceedings{bmow-cat-96,
author = "M. de Berg and H. Meijer and M. H. Overmars and
G. Wilfong",
title = "Computing the angularity tolerance",
booktitle = CCCG_1996,
year = 1996,
pages = "331--336"
}
@article{bmow-cat-98,
author = "M. de Berg and H. Meijer and M. H. Overmars and
G. Wilfong",
title = "Computing the angularity tolerance",
journal = IJCGA,
volume = 8,
year = 1998,
pages = "467--"
}
@inproceedings{boo-stswe-96,
author = "M. de~Berg and Ren{\'e} van Oostrum and
M. H. Overmars",
title = "Simple Traversal of a Subdivision Without Extra
Storage",
booktitle = SOCG_1996,
year = 1996,
pages = "C5--C6"
}
@proceedings{bo-ewcg-92,
title = "Abstracts 8th European Workshop Comput. Geom.",
editor = "M. de~Berg and M. H. Overmars",
nickname = "CG '92",
site = "Utrecht",
volume = "RUU-CS-92-10",
publisher = "Utrecht University",
year = 1992
}
@inproceedings{bo-dpo-88,
author = "M. de Berg and M. H. Overmars",
title = "Dominance in the presence of obstacles",
booktitle = "Proc. 14th Internat. Workshop
Graph-Theoret. Concepts Comput. Sci.",
nickname = "WG '88",
series = LNCS,
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. H. Overmars",
title = "Hidden surface removal for $c$-oriented polyhedra",
journal = CGTA,
volume = 1,
number = 5,
year = 1992,
pages = "247--268",
keywords = "hidden surface removal, $c$-oriented polyhedra,
output-sensitive algorithms"
}
@article{bok-fcbsb-90,
author = "M. de Berg and M. H. 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. H. Overmars and O. Schwarzkopf",
title = "Computing and verifying depth orders",
booktitle = SOCG_1992,
year = 1992,
pages = "138--145",
keywords = "hidden line/surface elimination, three-dimensional"
}
@article{bos-cvdo-94,
author = "M. de Berg and M. H. Overmars and O. Schwarzkopf",
title = "Computing and verifying depth orders",
journal = SICOMP,
volume = 23,
year = 1994,
pages = "437--446"
}
@inproceedings{bo-hsrap-90,
author = "M. de Berg and M. H. Overmars",
title = "Hidden surface removal for axis-parallel polyhedra",
booktitle = FOCS_1990,
year = 1990,
pages = "252--261",
keywords = "hidden surface removal, ray tracing"
}
@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
}
@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"
}
@article{bs-ca-95,
author = "M. de Berg and O. Schwarzkopf",
title = "Cuttings and applications",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "343--355",
keywords = "cuttings, random sampling, segment intersection
counting, Hopcroft's problem, point location"
}
@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 = JALG,
volume = 13,
year = 1992,
pages = "274--296",
keywords = "domination, rectangular visibility"
}
@article{b-ttgt-57,
author = "B. Berge",
title = "Two Theorems in Graph Theroy",
journal = "Proc. Nat. Acad. Sci. USA",
volume = 43,
year = 1957,
pages = "842--844"
}
@book{b-g-85,
author = "C. Berge",
title = "Graphs",
publisher = "North-Holland",
year = 1985
}
@article{b-slcmd-58,
author = "C. Berge",
title = "Sur le couplage maximum d'un graphe",
journal = "C. R. Acad. Sciences, Paris",
volume = 247,
year = 1958,
pages = "258--259"
}
@book{bc-tpg-84,
title = "Topics on Perfect Graphs",
editor = "C. Berge and V. Chv{\'a}tal",
series = "Ann. Discrete Math.",
volume = 21,
publisher = "North-Holland",
year = 1984
}
@book{bpv-ocdat-84,
author = "P. Berge and Y. Pomeau and C. Vidal",
title = "Order within Chaos: towards a Deterministic Approach
to Turbulence",
publisher = "John Wiley \& Sons",
address = "New York",
year = 1984
}
@article{v-frgic-99,
author = "G. Van den Bergen",
title = "A Fast Robust GJK Implementation for Collision
Detection of Convex Objects",
journal = "J. Graphics Tools",
volume = 4,
number = 2,
year = 1999,
pages = "7--25"
}
@inproceedings{bkl-rtdma-96,
author = "Bonnie Berger and Jon Kleinberg and Tom Leighton",
title = "Reconstructing a Three-Dimensional Model with
Arbitrary Errors",
booktitle = STOC_1996,
nickname = "STOC '96",
site = "Philadelphia, PA",
month = may,
year = 1996,
pages = "449--458"
}
@article{br-slwin-91,
author = "B. Berger and J. Rompel",
title = "Simulating {$(\log^c n)$}-Wise Independence in {NC}",
journal = JACM,
volume = 38,
number = 4,
year = 1991,
pages = "1026--1046"
}
@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 = FOCS_1989,
volume = 30,
year = 1989,
pages = "54--59"
}
@inproceedings{bs-aamas-90,
author = "B. Berger and P. Shor",
title = "Approximation Algorithms for the Maximum Acyclic
Subgraph Problem",
booktitle = SODA_1990,
year = 1990,
pages = "236--243",
keywords = "graph drawing"
}
@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
}
@book{b-g-77,
author = "M. Berger",
title = "G{\'e}om{\'e}trie (vols. 1-5)",
publisher = "Fernand Nathan",
address = "Paris",
year = 1977
}
@book{b-g-87,
author = "M. Berger",
title = "Geometry (vols. 1-2)",
publisher = "Springer-Verlag",
year = 1987
}
@book{bg-gd-72,
author = "M. Berger and B. Gostiaux",
title = "G{\'e}om{\'e}trie diff{\'e}rentielle",
publisher = "Armand Collin",
year = 1972
}
@article{br-apcgg-91,
author = "M. Berger and I. Rigoutsos",
title = "An algorithm for point clustering and grid
generation",
journal = "IEEE Trans. Syst. Man Cybern.",
volume = 21,
number = 5,
year = 1991,
pages = "1278--1286"
}
@article{b-udp-66,
author = "R. Berger",
title = "The undecidability of the domino problem",
journal = "Memoirs Amer. Math. Soc.",
volume = 66,
year = 1966
}
@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 = IJCGA,
volume = 6,
year = 1996,
pages = "231--242"
}
@article{b-siec-69,
author = "E. R. Berlekamp",
title = "On subsets with intersections of even cardinality",
journal = "Canad. Math. Bull.",
volume = 12,
year = 1969,
pages = "363--366"
}
@article{bh-vpius-70,
author = "J. D. Berman and K. Hanes",
title = "Volumes of polyhedra inscribed in the unit sphere
$E^3$",
journal = "Mathematische Annalen",
volume = 188,
year = 1970,
pages = "78--84"
}
@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"
}
@incollection{b-olsn-98,
author = "Piotr Berman",
title = "On-line Searching and Navigation",
editor = "Amos Fiat and Gerhard Woeginger",
booktitle = "Online Algorithms: The State of the Art",
series = LNCS,
volume = 1442,
publisher = "Springer-Verlag",
year = 1998,
pages = "232--241",
comments = "chapter 10 of fw-ola-98"
}
@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 = SODA_1996,
year = 1996,
pages = "75--84",
keywords = "mobile robot, competitive ratio, shortest paths,
randomized strategies, rectangular obstacles"
}
@inproceedings{bd-arpcp-92,
author = "P. Berman and B. DasGupta",
title = "Approximating the rectilinear polygon cover
problems",
booktitle = CCCG_1992,
year = 1992,
pages = "229--235"
}
@techreport{bd-rarpc-92,
author = "P. Berman and B. DasGupta",
title = "Results on Approximating of the Rectilinear Cover
Problem",
type = "Technical Report",
number = "CS-92-07",
institution = "Pennsylvania State University",
month = apr,
year = 1992
}
@techreport{bk-rnwco-94,
author = "Piotr Berman and M. Karpinski",
title = "Randomized Navigation to a Wall through Convex
Obstacles",
type = "Technical Report",
number = "85118-CS",
institution = "Bonn University",
year = 1994
}
@article{bl-nopav-97,
author = "P. Berman and A. Lingas",
title = "A nearly optimal parallel algorithm for the
{Voronoi} diagram of a convex polygon",
journal = TCS,
volume = 174,
year = 1997,
pages = "193--202"
}
@inproceedings{br-iastp-92,
author = "P. Berman and V. Ramaiyer",
title = "Improved approximations for the {Steiner} tree
problem",
booktitle = SODA_1992,
month = jan,
year = 1992,
pages = "325--334"
}
@article{br-iastp-94,
author = "P. Berman and V. Ramaiyer",
title = "Improved approximations for the {Steiner} tree
problem",
journal = JALG,
volume = 17,
year = 1994,
pages = "381--408"
}
@article{bs-caisp-92,
author = "P. Berman and G. Schnitger",
title = "On the complexity of approximating the Independent
Set Problem",
journal = "Inform. Comput.",
volume = 96,
number = 1,
month = jan,
year = 1992,
pages = "77--94"
}
@incollection{b-hg-78,
author = "J. C. Bermond",
title = "Hamiltonian Graphs",
editor = "L. W. Beineke and R. J. Wilson",
booktitle = "Selected Topics in Graph Theory",
publisher = "Academic Press",
address = "London, UK",
year = 1978
}
@article{b-acpqh-93,
author = "M. Bern",
title = "Approximate closest-point queries in high
dimensions",
journal = IPL,
volume = 45,
year = 1993,
pages = "95--99"
}
@inproceedings{b-ct-93,
author = "M. Bern",
title = "Compatible tetrahedralizations",
booktitle = SOCG_1993,
year = 1993,
pages = "281--288"
}
@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"
}
@inproceedings{b-hsrr-88,
author = "M. Bern",
title = "Hidden surface removal for rectangles",
booktitle = SOCG_1988,
year = 1988,
pages = "183--192"
}
@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"
}
@incollection{b-t-97,
author = "M. Bern",
title = "Triangulations",
chapter = 22,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "413--428"
}
@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"
}
@techreport{bcer-dbmgh-93,
author = "M. Bern and L. P. Chew and D. Eppstein and
J. Ruppert",
title = "Dihedral Bounds for Mesh Generation in High
Dimensions",
type = "Manuscript",
institution = "??",
year = 1993
}
@inproceedings{bcer-dbmgh-95,
author = "M. Bern and Paul Chew and D. Eppstein and Jim
Ruppert",
title = "Dihedral Bounds for Mesh Generation in High
Dimensions",
booktitle = SODA_1995,
year = 1995,
pages = "189--196"
}
@inproceedings{bdeh-dpaomt-98,
author = "M. Bern and E. D. Demaine and D. Eppstein and
B. Hayes",
title = "A disk-packing algorithm for an origami magic trick",
booktitle = "Proc. Internat. Conf. Fun with Algorithms",
site = "Elba, Italy",
month = jun,
year = 1998
}
@inproceedings{bdek-up-99,
author = "M. Bern and E. D. Demaine and D. Eppstein and
E. Kuo",
title = "Ununfoldable Polyhedra",
booktitle = CCCG_1999,
year = 1999,
pages = "13--16",
note = "Full version: http://arXiv.org/abs/cs/9908003/",
url = "http://www.cs.ubc.ca/conferences/CCCG/elec_proc/elecproc.html"
}
@article{bdems-uptf-01,
author = "M. Bern and E. D. Demaine and D. Eppstein and E. Kuo
and A. Mantler and J. Snoeyink",
title = "Ununfoldable Polyhedra with Convex Faces",
journal = CGTA,
volume = "??",
year = 2001,
pages = "?--?"
}
@inproceedings{bde-tpwla-92,
author = "M. Bern and D. Dobkin and D. Eppstein",
title = "Triangulating polygons without large angles",
booktitle = SOCG_1992,
year = 1992,
pages = "222--231"
}
@article{bde-tpwla-95,
author = "M. Bern and D. Dobkin and D. Eppstein",
title = "Triangulating polygons without large angles",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "171--192",
keywords = "computational geometry, mesh generation,
triangulation, angle condition"
}
@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 = SODA_1990,
year = 1990,
pages = "107--117"
}
@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"
}
@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
}
@inproceedings{beemt-eiot-92i,
author = "M. Bern and H. Edelsbrunner and D. Eppstein and
S. Mitchell and T. S. Tan",
title = "Edge-insertion for optimal triangulations",
booktitle = "Proc. Latin Amer. Sympos. Theoret. Informatics",
nickname = "LATIN '92",
site = "Sao Paulo",
series = LNCS,
volume = 583,
publisher = "Springer-Verlag",
year = 1992,
pages = "46--60"
}
@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 = DCG,
volume = 10,
number = 1,
year = 1993,
pages = "47--65",
keywords = "points, triangulation"
}
@incollection{be-aagp-97,
author = "M. Bern and D. Eppstein",
title = "Approximation algorithms for geometric problems",
editor = "Dorit S. Hochbaum",
booktitle = "Approximation Algorithms for NP-Hard Problems",
publisher = "PWS Publishing Company",
address = "Boston, MA",
year = 1997,
pages = "296--345"
}
@misc{be-gaa-95,
author = "M. Bern and D. Eppstein",
title = "Geometric approximation algorithms",
year = 1995,
note = "manuscript"
}
@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
}
@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"
}
@incollection{be-mgot-95,
author = "M. Bern and D. Eppstein",
title = "Mesh generation and optimal triangulation",
editor = "D.-Z. Du and F. K. Hwang",
booktitle = "Computing in Euclidean Geometry",
series = "Lecture Notes Series on Computing",
volume = 4,
edition = "2nd",
publisher = "World Scientific",
address = "Singapore",
year = 1995,
pages = "47--123",
keywords = "survey paper, mesh generation, optimal
triangulation, Steiner triangulation"
}
@inproceedings{be-mrd-00,
author = "M. Bern and D. Eppstein",
title = "Multivariate Regression Depth",
booktitle = SOCG_2000,
year = 2000,
pages = "315--321"
}
@inproceedings{be-psntp-91,
author = "M. Bern and D. Eppstein",
title = "Polynomial-size nonobtuse triangulation of polygons",
booktitle = SOCG_1991,
year = 1991,
pages = "342--350",
keywords = "triangulation, polygons"
}
@article{be-psntp-92,
author = "M. Bern and D. Eppstein",
title = "Polynomial-size nonobtuse triangulation of polygons",
journal = IJCGA,
volume = 2,
number = 3,
year = 1992,
pages = "241--255, 449--450",
keywords = "mesh generation, triangulation, angle condition"
}
@inproceedings{be-wcbsg-93,
author = "M. Bern and D. Eppstein",
title = "Worst-case bounds for subadditive geometric graphs",
booktitle = SOCG_1993,
year = 1993,
pages = "183--188"
}
@misc{be-ecct-99,
author = "M. Bern and D. Eppstein and P. K. Agarwal and
N. Amenta and P. Chew and T. Dey and D. P. Dobkin
and H. Edelsbrunner and C. Grimm and L. J. Guibas
and J. Harer and J. Hass and A. Hicks and
C. K. Johnson and G. Lerman and D. Letscher and
P. Plassmann and E. Sedgwick and J. Snoeyink and
J. Weeks and C. Yap and D. Zorin",
title = "Emerging Challenges in Computational Topology",
year = 1999,
note = "Report on an NSF Workshop on Computational Topology,
June 11-12, Miami Beach, FL."
}
@inproceedings{beg-pgmg-90,
author = "M. Bern and D. Eppstein and J. Gilbert",
title = "Provably good mesh generation",
booktitle = FOCS_1990,
year = 1990,
pages = "231--241",
keywords = "VLSI design"
}
@article{beg-pgmg-94,
author = "M. Bern and D. Eppstein and J. Gilbert",
title = "Provably good mesh generation",
journal = "J. Comput. Syst. Sci.",
volume = 48,
year = 1994,
pages = "384--409"
}
@inproceedings{beghs-cpaw-95,
author = "M. Bern and D. Eppstein and L. J. Guibas and
J. Hershberger and S. Suri and J. Wolter",
title = "The centroid of points with approximate weights",
booktitle = "Proc. 3rd Annu. European Sympos. Algorithms",
nickname = "ESA '95",
series = LNCS,
volume = 979,
publisher = "Springer-Verlag",
year = 1995,
pages = "460--472"
}
@incollection{bepy-htlp-91,
author = "M. Bern and D. Eppstein and P. Plassman and F. Yao",
title = "Horizon theorems for lines and polygons",
editor = "J. Goodman and R. Pollack and W. Steiger",
booktitle = "Discrete and Computational Geometry: Papers from the
DIMACS Special Year",
series = "DIMACS Series in Discrete Mathematics and
Theoretical Computer Science",
volume = 6,
publisher = "American Mathematical Society, Association for
Computing Machinery",
address = "Providence, RI",
year = 1991,
pages = "45--66",
keywords = "arrangements, horizon, pseudo lines"
}
@inproceedings{bet-pcqqt-93,
author = "M. Bern and D. Eppstein and Shan-Hua Teng",
title = "Parallel Construction of Quadtrees and Quality
Triangulations",
booktitle = "Proc. 3rd Workshop Algorithms Data Struct.",
series = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "188--199"
}
@article{bet-pcqqt-99,
author = "M. Bern and D. Eppstein and S.-H. Teng",
title = "Parallel Construction of Quadtrees and Quality
Triangulations",
journal = IJCGA,
volume = 9,
number = 6,
year = 1999,
pages = "517--532"
}
@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 = LNCS,
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 = IJCGA,
volume = 1,
year = 1991,
pages = "79--91",
keywords = "Delaunay triangulation, probabilistic analysis"
}
@techreport{bg-dpd-91,
author = "M. Bern and J. Gilbert",
title = "Drawing the planar dual",
type = "Manuscript",
year = 1991
}
@inproceedings{bgrs-olalc-90,
author = "M. Bern and D. Greene and A. Raghunathan and
M. Sudan",
title = "Online Algorithms for Locating Checkpoints",
booktitle = STOC_1990,
year = 1990,
pages = "359--368"
}
@inproceedings{bh-cfo-96,
author = "M. Bern and Barry Hayes",
title = "The complexity of flat origami",
booktitle = SODA_1996,
year = 1996,
pages = "175--183",
keywords = "NP-hardness, crease patterns, flat folding, flat
foldability"
}
@inproceedings{bmr-lsntp-94,
author = "M. Bern and S. Mitchell and J. Ruppert",
title = "Linear-Size Nonobtuse Triangulation of Polygons",
booktitle = SOCG_1994,
year = 1994,
pages = "221--230"
}
@incollection{bp-mg-00,
author = "M. Bern and Paul Plassmann",
title = "Mesh Generation",
editor = "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier Science Publishers B.V. North-Holland",
address = "Amsterdam",
year = 2000,
pages = "291--332",
annote = "Chapter 6 of su-hcg-00"
}
@inproceedings{bs-pdtcm-96,
author = "M. Bern and Amit Sahai",
title = "Pushing Disks Together -- {The} Continuous-Motion
Case",
booktitle = STOC_1996,
nickname = "STOC '96",
year = 1996,
pages = "119--125"
}
@article{bs-pdtcm-98,
author = "M. Bern and Amit Sahai",
title = "Pushing Disks Together -- {The} Continuous-Motion
Case",
journal = DCG,
volume = 20,
year = 1998,
pages = "499--514"
}
@inproceedings{b-tprrs-86,
author = "M. W. Bern",
title = "Two probabilistic results on rectilinear {Steiner}
trees",
booktitle = STOC_1986,
year = 1986,
pages = "433--441"
}
@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"
}
@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 = SOCG_1989,
year = 1989,
pages = "292--301"
}
@article{bkrs-fgatg-92,
author = "Marshall W. Bern and Howard J. Karloff and Prabhakar
Raghavan and Baruch Schieber",
title = "Fast Geometric Approximation Techniques and
Geometric Embedding Problems",
journal = TCS,
volume = 106,
number = 2,
month = dec,
year = 1992,
pages = "265--281"
}
@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",
abstract = "Let S be a set of n sites chosen independently from
a uniform distribution in a cube in 3-dimensional
Euclidean space. In this paper, an expected O(n)
algorithm for constructing the Voronoi diagram for S
together with numerical results obtained from an
implementation of the algorithm are presented."
}
@techreport{b-bnvd,
author = "J. Bernal",
title = "Bibliographic notes on {Voronoi} diagrams",
institution = "National Institute of Standards and Technology",
address = "Gaithersburg, MD 20899",
year = 1992
}
@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",
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"
}
@techreport{bb-srmua-97t,
author = "F. Bernardini and C. Bajaj",
title = "Sampling and reconstructing manifolds using
alpha-shapes",
type = "Technical {Report}",
number = "CSD-TR-97-013",
institution = "Dept. Comput. Sci., Purdue Univ.",
address = "West Lafayette, IN",
year = 1997
}
@techreport{bbcs-ar3dc-97,
author = "F. Bernardini and C. Bajaj and J. Chen and
D. Schikore",
title = "Automatic reconstruction of $3${D} {CAD} models from
digital scans",
type = "Technical {Report}",
number = "CSD-TR-97-012",
institution = "Dept. Comput. Sci., Purdue Univ.",
address = "West Lafayette, IN",
year = 1997
}
@inproceedings{bbcs-tborm-97,
author = "F. Bernardini and C. Bajaj and J. Chen and
D. Schikore",
title = "Triangulation-Based Object Reconstruction Methods",
booktitle = SOCG_1997,
year = 1997,
pages = "481--484",
keywords = "video review"
}
@inproceedings{bb-srmua-97,
author = "Fausto Bernardini and Chandrajit L. Bajaj",
title = "Sampling and Reconstructing Manifolds Using
Alpha--Shapes",
booktitle = CCCG_1997,
year = 1997,
pages = "193--198"
}
@article{bbcs-ar3dc-99,
author = "F. Bernardini and C. L. Bajaj and J. Chen and
D. R. Schikore",
title = "Automatic reconstruction of $3${D} {CAD} models from
digital scans",
journal = IJCGA,
volume = 9,
year = 1999,
pages = "327--369"
}
@inproceedings{bfp-cfcss-92,
author = "Fausto Bernardini and Vincenzo Ferrucci and Alberto
Paoluzzi",
title = "Computation of Free Configuration Space by Solid
Modelling Techniques",
booktitle = "Abstracts 8th European Workshop Comput. Geom.",
nickname = "CG '92",
site = "Utrecht",
publisher = "Utrecht University",
year = 1992,
pages = "13--16"
}
@article{bmrst-bpasr-99,
author = "F. Bernardini and J. Mittleman and H. Rushmeir and
C. Silva and G. Taubin",
title = "The ball-pivoting algorithm for surface
reconstruction",
journal = "IEEE Transactions on Visualization and Computer
Graphics",
volume = 5,
number = 4,
year = 1999,
pages = ""
}
@article{bk-btg-79,
author = "F. Bernhart and P. C. Kainen",
title = "The book thickness of a graph",
journal = "J. Combin. Theory",
volume = "Ser. B 27",
year = 1979,
pages = "320--331"
}
@article{bkwmbrkst-pdbcb-77,
author = "F. C. Bernstein and T. F. Koetzle and
G. J. B. Williams and E. F. {Meyer, Jr.} and
M. D. Brice and J. R. Rodgers and O. Kennard and
T. Shimanouchi and M. Tasumi",
title = "The protein data bank: {A} computer based archival
file for macromolecular structure",
journal = "J. Molecular Biology",
volume = 112,
year = 1977,
pages = "535--542"
}
@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 = IPL,
volume = 22,
year = 1986,
pages = "255--260"
}
@techreport{b-dscns-84,
author = "H. J. Bernstein",
title = "Determining the Shape of a Convex $n$-Sided Polygon
Using $2n+k$ Tactile Probes",
type = "Technical {Report}",
number = 125,
institution = "Courant Inst. Math. Sci., New York Univ.",
address = "New York, NY",
month = jun,
year = 1984,
note = "Robotics Report No. 29"
}
@inproceedings{bgos-fdcpp-97,
author = "R.-P. Berretty and K. Goldberg and M. H. Overmars
and F. Van der Stappen",
title = "On fence design and the complexity of push plans for
orienting parts",
booktitle = SOCG_1997,
year = 1997,
pages = "21--29"
}
@article{bgos-cfdop-98,
author = "Robert-Paul Berretty and Ken Goldberg and Mark
H. Overmars and A. Frank van der Stappen",
title = "Computing fence designs for orienting parts",
journal = CGTA,
volume = 10,
year = 1998,
pages = "249--262"
}
@techreport{bos-dmpld-97b,
author = "R.-P. Berretty and M. H. Overmars and A. F. van der
Stappen",
title = "Dynamic motion planning in low density environments",
type = "Report",
number = "UU-CS-1997-20",
institution = "Dept. Comput. Sci., Utrecht Univ.",
address = "Utrecht, Netherlands",
year = 1997
}
@inproceedings{bos-dmpld-97,
author = "R.-P. Berretty and M. H. Overmars and A. F. van der
Stappen",
title = "Dynamic motion planning in low obstacle density
environments",
booktitle = "Proc. Workshop Algorithms Data Struct.",
nickname = "WADS '97",
site = "Halifax, Canada",
series = LNCS,
volume = 1272,
publisher = "Springer-Verlag",
year = 1997,
pages = "3--16"
}
@inproceedings{bdgss-gdml-97,
author = "Jonathan Berry and Nathaniel Dean and Mark Goldberg
and Gregory Shannon and Steven Skiena",
title = "Graph Drawing and Manipulation with {LINK}",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "425--437",
keywords = "graph drawing"
}
@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"
}
@techreport{brv-ipam-89,
author = "Patrice Bertin and Didier Roncin and Jean Vuillemin",
title = "Introduction to programmable active memories",
type = "Research Report",
number = 3,
institution = "Digital Paris Research Laboratory",
month = jun,
year = 1989
}
@techreport{bcdtt-hdspd-92t,
author = "P. Bertolazzi and R. F. Cohen and G. {Di Battista}
and R. Tamassia and I. G. Tollis",
title = "How to Draw a Series-Parallel Digraph",
type = "Technical Report",
number = "UTDCS-9-92",
institution = "The University of Texas at Dallas",
year = 1992
}
@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 = SWAT_1992,
series = LNCS,
volume = 621,
publisher = "Springer-Verlag",
year = 1992,
pages = "272--283",
keywords = "graph drawing"
}
@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 = IJCGA,
volume = 4,
year = 1994,
pages = "385--402",
keywords = "graph drawing, planar, upward"
}
@inproceedings{bd-udttd-91,
author = "P. Bertolazzi and G. {Di Battista}",
title = "On upward drawing testing of triconnected digraphs",
booktitle = SOCG_1991,
year = 1991,
pages = "272--280",
keywords = "graph drawing, planar graph representation"
}
@inproceedings{bdd-codmn-97,
author = "Paola Bertolazzi and Giuseppe {Di Battista} and
Walter Didimo",
title = "Computing Orthogonal Drawings with the Minimum
Number of Bends",
editor = "Frank Dehne and Andrew Rau-Chaplin and
J{\"o}rg-R{\"u}diger Sack and Roberto Tamassia",
booktitle = WADS_1997,
nickname = "WADS '97",
site = "Halifax, Canada",
series = LNCS,
volume = 1272,
publisher = "Springer-Verlag",
year = 1997,
pages = "331--344"
}
@inproceedings{bdd-qup-98,
author = "Paola Bertolazzi and Giuseppe {Di Battista} and
Walter Didimo",
title = "Quasi-Upward Planarity",
editor = "S. H. Whitesides",
booktitle = "Graph Drawing (Proc. GD '98)",
series = LNCS,
volume = 1547,
publisher = "Springer-Verlag",
year = 1998,
pages = "15--29",
keywords = "graph drawing, upward"
}
@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"
}
@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"
}
@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"
}
@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 = LNCS,
volume = 726,
publisher = "Springer-Verlag",
year = 1993,
pages = "37--48"
}
@article{bdmt-oupts-98,
author = "P. Bertolazzi and G. {Di Battista} and C. Mannino
and R. Tamassia",
title = "Optimal Upward Planarity Testing of Single-Source
Digraphs",
journal = SICOMP,
volume = 27,
number = 1,
year = 1998,
pages = "132--169",
keywords = "graph drawing, upward, planar"
}
@misc{bdtt-hdspd-91,
author = "P. Bertolazzi and G. {Di Battista} and R. Tamassia
and I. G. Tollis",
title = "How to Draw a Series-Parallel Digraph",
year = 1991,
note = "manuscript"
}
@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 = LNCS,
volume = 399,
year = 1989,
pages = "65--71",
keywords = "parallel computation, visibility"
}
@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"
}
@inproceedings{bbd-ahc-93,
author = "M. Bertolotto and E. Bruzzone and L. {De Floriani}",
title = "Acyclic hierarchical cell complexes",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "279--284"
}
@article{b-pccp-88,
author = "A. A. Bertossi",
title = "Parallel circle-cover problem",
journal = IPL,
volume = 27,
year = 1988,
pages = "133--139",
keywords = "parallel computation, circle, covering"
}
@article{bhl-ahp-00,
author = "C. Bertram-Kretzberg and T. Hofmeister and
H. Lefmann",
title = "An algorithm for {Heilbronn's} problem",
journal = SICOMP,
volume = 30,
year = 2000,
pages = "383--390"
}
@article{bd-asmbh-94,
author = "Y. Bertrand and J.-F. Dufourd",
title = "Algebraic specification of a {3D}-Modeler Based on
Hypermaps",
journal = "CVGIP: Graph. Models Image Process.",
volume = 56,
year = 1994,
pages = "29--60"
}
@book{b-colmm-82,
author = "D. P. Bertsekas",
title = "Constrained Optimization and {Lagrange} Multiplier
Methods",
publisher = "Academic Press",
address = "New York, NY",
year = 1982
}
@book{bt-pdcnm-89,
author = "D. P. Bertsekas and J. N. Tsitsiklis",
title = "Parallel and distributed Computation: {Numerical}
Methods",
publisher = "Prentice Hall",
address = "Englewood Cliffs, NJ",
year = 1989
}
@inproceedings{bg-ppcp-90,
author = "D. J. Bertsimas and M. X. Goemans",
title = "On the parsimonious property of connectivity
problems",
booktitle = SODA_1990,
year = 1990,
pages = "388--396"
}
@article{b-wcesc-89,
author = "D. Bertzimas",
title = "Worst-case examples for the spacefilling curve
heuristics for the {Euclidean} {Travelling}
{Salesman} {Problem}",
journal = "Oper. Res. Lett.",
volume = 8,
number = 5,
year = 1989,
pages = "241--244",
keywords = "optimization"
}
@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"
}
@article{b-kpso-28,
author = "A. S. Besicovitch",
title = "On {Kakeya's} problem and a similar one",
journal = "Mathematische Zeitschrift",
volume = 27,
year = 1928,
pages = "312--320"
}
@book{b-igs-85,
author = "N. M. Beskin",
title = "Images of geometric solids",
publisher = "Mir Publishers",
address = "Moscow",
year = 1985
}
@article{bj-tdor-85,
author = "P. J. Besl and R. C. Jain",
title = "Three-dimensional object recognition",
journal = "ACM Comput. Surv.",
volume = 17,
year = 1985,
pages = "75--154"
}
@article{b-eatdd-01,
author = "S. N. Bespamyathnikh",
title = "An efficient algorithm for the three-dimensional
diameter problem",
journal = DCG,
volume = 25,
year = 2001,
pages = "235--255"
}
@techreport{b-cmstt-,
author = "S. N. Bespamyathnikh",
title = "Constructing Minimum Spanning Trees in
{$R^k_\infty$} and triangulation of the k-Cube",
type = "manuscript"
}
@unpublished{b-eaet-00,
author = "Sergei Bespamyatnikh",
title = "An Efficient Algorithm for Enumeration of
Triangulations",
year = 2000,
note = "10th Annual Fall Workshop on Computational
Geometry.
\path|http://www.cs.ubc.ca/~besp/cgw.ps.gz|"
}
@article{b-eatddp-00,
author = "S. Bespamyatnikh",
title = "An Efficient Algorithm for the Three-Dimensional
Diameter Problem",
journal = DCG,
volume = 25,
number = 2,
year = 2000,
pages = "235--255"
}
@inproceedings{b-eaf2l-99,
author = "Sergei Bespamyatnikh",
title = "Efficient Algorithm for Finding 2 Largest Empty
Circles",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "37--38"
}
@article{bbkks-eacm-01,
author = "S. Bespamyatnikh and B. Bhattacharya and M. Keil and
D. Kirkpatrick and M. Segal",
title = "Efficient algorithms for centers and medians in
interval and circular-arc graphs",
journal = "Networks",
volume = "??",
year = 2002,
note = "to appear"
}
@article{bkst-oflvd-00,
author = "S. Bespamyatnikh and K. Kedem and M. Segal and
A. Tamir",
title = "Optimal facility location under various distance
functions",
journal = IJCGA,
volume = 10,
year = 2000,
pages = "523--534"
}
@article{bds-ghsces-00,
author = "S. Bespamyatnikh and D. Kirkpatrick and J. Snoeyink",
title = "Generalizing Ham Sandwich Cuts to Equitable
Subdivisions",
journal = DCG,
volume = 24,
number = 4,
year = 2000,
pages = "605--622"
}
@inproceedings{bs-cspta-97,
author = "Sergei Bespamyatnikh and Michael Segal",
title = "Covering a Set of Points by Two Axis--Parallel
Boxes",
booktitle = CCCG_1997,
year = 1997,
pages = "33--38"
}
@article{bs-qsvd-00,
author = "S. Bespamyatnikh and J. Snoeyink",
title = "Queries with Segments in {Voronoi} Diagrams",
journal = CGTA,
volume = 16,
number = 1,
year = 2000,
pages = "23--33"
}
@inproceedings{b-eatdd-98,
author = "Sergei N. Bespamyatnikh",
title = "An Efficient Algorithm for the Three-Dimensional
Diameter Problem",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "137--146"
}
@inproceedings{b-oacpm-95,
author = "Sergei N. Bespamyatnikh",
title = "An Optimal Algorithm for Closest Pair Maintenance",
booktitle = SOCG_1995,
year = 1995,
pages = "152--161",
keywords = "dynamic closest pair"
}
@article{b-oacpm-98,
author = "S. N. Bespamyatnikh",
title = "An Optimal Algorithm for Closest-Pair Maintenance",
journal = DCG,
volume = 19,
year = 1998,
pages = "175--195"
}
@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 = CCCG_1996,
year = 1996,
pages = "101--106"
}
@inproceedings{b-daans-96,
author = "S. N. Bespamyatnikh",
title = "Dynamic algorithms for approximate neighbor
searching",
booktitle = CCCG_1996,
year = 1996,
pages = "252--257"
}
@article{b-ocmst-97,
author = "S. N. Bespamyatnikh",
title = "On constructing minimum spanning trees in {$R^k_1$}",
journal = "Algorithmica",
volume = 18,
year = 1997,
pages = "524--529"
}
@inproceedings{b-rasdc-94,
author = "S. N. Bespamyatnikh",
title = "The Region Approach for some Dynamic Closest-Point
Problems",
booktitle = CCCG_1994,
year = 1994,
pages = "75--80",
keywords = "region approach, dynamic maintenance, data
structures"
}
@inproceedings{brs-plue-93,
author = "Margrit Betke and Ronald L. Rivest and Mona Singh",
title = "Piecemeal Learning of an Unknown Environment",
booktitle = "Proc. 6th ACM Conf. Comput. Learning Theory",
nickname = "COLT '93",
month = jul,
year = 1993,
pages = "277--286"
}
@article{brs-plue-95,
author = "Margrit Betke and Ronald L. Rivest and Mona Singh",
title = "Piecemeal Learning of an Unknown Environment",
journal = "Machine Learning",
volume = 18,
number = "2--3",
year = 1995,
pages = "231--254"
}
@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"
}
@inproceedings{bc-ap1sq-94,
author = "D. Beus and D. Crockett",
title = "Automated production of $1:24,000$ scale quadrangle
maps",
booktitle = "Proc. 1994 ASPRS/ACSM Annual Convention and
Exposition",
volume = 1,
year = 1994,
pages = "94--99"
}
@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"
}
@article{b-orect-97,
author = "Andras Bezdek",
title = "On optimal route planning evading cubes in the three
space",
journal = "Beitr{\"a}ge zur Algebra und Geometrie",
volume = "??",
year = 1997,
abstract = "Let $\cal P$ be a finite arrangement of
non-overlapping open cubes with side-lengths not
exceeding 1 in the $3$-dimensional euclidean
space. Let $S$ and $T$ be two points lying outside
the open cubes. Assume one needs to find a short
path emanating from $S$ and terminating at $T$
avoiding the cubes of $\cal P$ under the restriction
that the cubes are not known prior to the search. In
fact the positions and the side-lengths of the cubes
become known to the searcher as the cubes are
contacted. We give an algorithm to construct a path
of length less than $\frac 32 d + 3 \sqrt 3 \log d +
5$, where $d > 3 \sqrt 3$ denotes the distance
between S and T."
}
@article{b-ddcc-90,
author = "A. Bezdek",
title = "On the density of dual circle coverings",
journal = "Geom. Dedicata",
volume = 33,
number = 2,
year = 1990,
pages = "227--238",
keywords = "arrangements of circles, Sylvester problem"
}
@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"
}
@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"
}
@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
}
@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"
}
@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"
}
@article{bkm-mdspp-91,
author = "A. Bezdek and W. Kuperberg and E. Makai",
title = "Maximum density space packing with parallel strings
of spheres",
journal = DCG,
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"
}
@inproceedings{b-irubd-01,
author = "K{\'a}roly Bezdek",
title = "Improving {Roger's} Upper Bound for the Density of
Unit Ball Packings in {Euclidean} $d$-Space for all
$d\ge 8$",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "191--194"
}
@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"
}
@article{bl-ecld-88,
author = "M. Bezem and J. van Leeuwen",
title = "On estimating the complexity of logarithmic
decompositions",
journal = IPL,
volume = 26,
number = 6,
year = 1988,
pages = "321--324"
}
@book{b-ncma-72,
author = "P. Bezier",
title = "Numerical Control - Mathematics and Aplications",
publisher = "John Wiley \& Sons",
address = "London, UK",
year = 1972
}
@inproceedings{bc-fsamn-96,
author = "J. Bhadury and R. Chandrasekaran",
title = "Finding the set of all minimal nested convex
polygons",
booktitle = CCCG_1996,
year = 1996,
pages = "26--31"
}
@article{bcmc-agpcn-97,
author = "J. Bhadury and V. Chandru and A. Maheshwari and
R. Chandrasekaran",
title = "Art Gallery Problems for Convex Nested Polygons",
journal = "INFORMS J. Comput.",
volume = 9,
number = 1,
year = 1997,
pages = "100--110"
}
@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"
}
@inproceedings{blosz-fsamb-92,
author = "D. Bhagavathi and P. Looges and S. Olariu and
J. L. Schwing and J. Zhang",
title = "Fast selection algorithms on meshes with multiple
broadcasting",
booktitle = "Proc. Internat. Conf. Parallel Process.",
site = "St. Charles",
year = 1992
}
@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 = CCCG_1992,
year = 1992,
pages = "365--370",
keywords = "convex polygons, meshes with muliple broadcasting,
diameter, enclosing rectangle, inscribed triangle,
time-optimal algorithms, image processing, computer
vision"
}
@techreport{bosw-tomsa-92t,
author = "D. Bhagavathi and S. Olariu and W. Shen and
L. Wilson",
title = "A time-optimal multiple search algorithm on enhanced
meshes, with applications",
type = "Technical Report",
number = "TR-092-08",
institution = "Department of Computer Science, Old Dominion
University",
year = 1992
}
@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 = CCCG_1992,
year = 1992,
pages = "359--364"
}
@inproceedings{bwc-ihd-00,
author = "Praveen Bhaniramka and R. Wenger and Roger Crawfis",
title = "Isosurfacing in Higher Dimensions",
booktitle = "Proceedings of Visualization 2000",
year = 2000,
pages = "267--273"
}
@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"
}
@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"
}
@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
}
@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"
}
@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 = "??"
}
@inproceedings{bgks-flddf-98,
author = "Randeep Bhatia and Sudipto Guha and Samir Khuller
and Yoram J. Sussmann",
title = "Facility Location with Dynamic Distance Functions",
booktitle = SWAT_1998,
nickname = "SWAT '98",
site = "Stockholm",
series = LNCS,
volume = 1432,
publisher = "Springer-Verlag",
year = 1998,
pages = "23--34"
}
@article{bl-tdfem-90,
author = "R. P. Bhatia and K. L. Lawrence",
title = "Two-Dimensional Finite Element Mesh Generation Based
On Stripwise Automatic Triangulation",
journal = "Comput. Struct.",
volume = 36,
number = 2,
year = 1990,
pages = "309--319",
keywords = "two-dimensional finite element mesh, finite element
mesh generation, stripwise automatic triangulation,
central mesh generation, laplacian smoothing",
annote = "Advancing front scheme. Tri that maximizes $A/P^2$
is chosen.",
abstract = "A new mesh generator, capable of discretizing
arbitrary, two-dimensional, multiply connected
domains into triangles with a prescribed spatial
density, has been developed. The technique is based
on stripwise automatic triangulation. The
triangulation strategy has been enhanced using two
heuristics. The first is a method to temporarily
reorient a region before submitting it for
generation. The second is a technique to find and
repair 'omitted patches' near sharply curved
boundaries. Despite employing a set of heuristics,
the resulting scheme is versatile, robust, and
demonstrates a near linear growth rate. (Author
abstract) 17 Refs."
}
@inproceedings{bclr-ostm-86,
author = "S. Bhatt and F. Chung and F. Leighton and
A. Rosenberg",
title = "Optimal simulations of tree machines",
booktitle = FOCS_1986,
year = 1986,
pages = "274--282"
}
@article{bc-cmwlv-87,
author = "S. Bhatt and S. Cosmadakis",
title = "The Complexity of Minimizing Wire Lengths in {VLSI}
Layouts",
journal = IPL,
volume = 25,
year = 1987,
pages = "263--267",
keywords = "graph drawing"
}
@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"
}
@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
}
@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
}
@article{bb-cobbt-01,
author = "Binay Bhattacharya and Robert Benkoczi",
title = "On computing the optimal bridge between two convex
polygons",
journal = IPL,
volume = 79,
year = 2001,
pages = "215--221"
}
@techreport{bcetsu-csts-90,
author = "B. Bhattacharya and J. Czyzowicz and P. Egyed and
G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia",
title = "Computing Shortest Transversals of Sets",
type = "Technical {Report}",
number = "SOCS 90.23",
institution = "McGill Univ.",
address = "Montreal, PQ",
year = 1990
}
@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 = SOCG_1991,
year = 1991,
pages = "71--80",
keywords = "stabbing"
}
@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 = IJCGA,
volume = 2,
number = 4,
year = 1992,
pages = "417--442",
keywords = "computational geometry, shortest transversal,
envelope, butterfly polygon"
}
@inproceedings{bet-cwb-91,
author = "B. Bhattacharya and P. Egyed and G. Toussaint",
title = "Computing the wingspan of a butterfly",
booktitle = CCCG_1991,
year = 1991,
pages = "88--91"
}
@inproceedings{be-bskpc-97,
author = "Binay Bhattacharya and Hossam ElGindy",
title = "Biased Search and $k$--Point Clustering",
booktitle = CCCG_1997,
year = 1997,
pages = "141--146"
}
@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"
}
@article{bg-clvpr-01,
author = "B. Bhattacharya and S. K. Ghosh",
title = "Characterizing {LR}-visibility polygons and related
problems",
journal = CGTA,
volume = 18,
year = 2001,
pages = "19--36"
}
@inproceedings{bkt-dsvp-89,
author = "B. Bhattacharya and D. G. Kirkpatrick and
G. T. Toussaint",
title = "Determining sector visibility of a polygon",
booktitle = SOCG_1989,
year = 1989,
pages = "247--254"
}
@inproceedings{bm-ltacm-01,
author = "Binay Bhattacharya and Asish Mukhopadhyay",
title = "A Linear Time Algorithm for Computing the Minimum
Perimeter Triangle Enclosing a Convex Polygon",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "43--47"
}
@inproceedings{bs-psdsr-90,
author = "B. Bhattacharya and T. Shermer",
title = "Polygonal separators and digital shape recognition",
booktitle = CCCG_1990,
year = 1990,
pages = "74--77"
}
@inproceedings{bt-cmscs-89,
author = "B. Bhattacharya and G. Toussaint",
title = "Computing minimal spanning covers of sets",
booktitle = CCCG_1989,
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 = LNCS,
volume = 510,
publisher = "Springer-Verlag",
year = 1991,
pages = "649--660",
keywords = "stabbing"
}
@article{bt-cst-91a,
author = "B. Bhattacharya and G. Toussaint",
title = "Computing shortest transversals",
journal = "Computing",
volume = 46,
number = 3,
year = 1991,
pages = "93--119",
keywords = "stabbing, line fitting",
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"
}
@techreport{b-acgpr-82,
author = "B. K. Bhattacharya",
title = "Application of computational geometry to pattern
recognition problems",
type = "Technical {Report}",
number = "82-3",
institution = "Dept. Comput. Sci., Simon Fraser Univ.",
address = "Burnaby, BC",
year = 1982
}
@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 = FSTTCS_1991,
site = "New Delhi, India",
year = 1991,
pages = "??"
}
@techreport{bet-csdix-,
author = "B. K. Bhattacharya and P. Egyed and G. T. Toussaint",
title = "On computing shortest distances inside {X}-shaped
polygons",
type = "Manuscript"
}
@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 = SOCG_1991,
year = 1991,
pages = "81--88",
keywords = "prune and search, optimization"
}
@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 = ISAAC_1995,
nickname = "ISAAC '95",
series = LNCS,
volume = 1004,
publisher = "Springer-Verlag",
year = 1995,
pages = "22--31"
}
@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 = WADS_1991,
series = LNCS,
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"
}
@article{bs-spoos-97,
author = "B. K. Bhattacharya and S. Sen",
title = "On a Simple, Practical, Optimal, Output-Sensitive
Randomized Planar Convex Hull Algorithm",
journal = JALG,
volume = 25,
year = 1997,
pages = "177--193"
}
@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"
}
@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 = JALG,
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"
}
@article{bt-tseio-83,
author = "B. K. Bhattacharya and G. T. Toussaint",
title = "Time- and storage-efficient implementation of an
optimal convex hull algorithm",
journal = "Image Vision Comput.",
volume = 1,
year = 1983,
pages = "140--144"
}
@techreport{bz-stdfp-86,
author = "B. K. Bhattacharya and J. Zorbas",
title = "Solving the two-dimensional findpath problem using a
line-triangle representation of the robot",
type = "Technical {Report}",
institution = "School Comput. Sci., Simon Fraser Univ.",
address = "Burnaby, BC",
year = 1986
}
@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 = JALG,
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"
}
@article{b-sfctg-69,
author = "T. Bially",
title = "Space-filling curves: Their generation and their
application to bandwidth reduction",
journal = "IEEE Trans. Inform. Theory",
volume = 15,
year = 1969,
pages = "658--664"
}
@article{bd-shc2c-91,
author = "A. Bialostocki and P. Dierker",
title = "On simple {Hamiltonian} cycles in a 2-colored
complete graph",
journal = "Ars Combin.",
volume = 21,
year = 1991,
pages = "13--16"
}
@article{bl-rpsp-90,
author = "G. Bianchi and M. Longinetti",
title = "Reconstructing plane sets from projections",
journal = DCG,
volume = 5,
year = 1990,
pages = "223--242"
}
@article{bd-nstg-93,
author = "E. Bibelnieks and P. M. Dearing",
title = "Neighborhood Subtree Tolerance Graphs",
journal = "Discrete Appl. Math.",
volume = 43,
year = 1993,
pages = "13--26"
}
@inproceedings{b-iod3g-96,
author = "T. Biedl",
title = "Improved orthogonal drawings of 3-graphs",
booktitle = CCCG_1996,
year = 1996,
pages = "295--299"
}
@inproceedings{b-oodcp-96,
author = "T. Biedl",
title = "Optimal orthogonal drawings of connected plane
graphs",
booktitle = CCCG_1996,
year = 1996,
pages = "306--311"
}
@inproceedings{bddlloorstw-lupc3d-99,
author = "T. Biedl and E. Demaine and M. Demaine and S. Lazard
and A. Lubiw and J. O'Rourke and M. H. Overmars and
S. Robbins and I. Streinu and G. Toussaint and
S. Whitesides",
title = "Locked and Unlocked Polygonal Chains in {3D}",
booktitle = SODA_1999,
nickname = "SODA '99",
month = jan,
year = 1999,
pages = "866--867",
note = "Full version Smith Tech. Rep. 060, Oct. 1999; LANL
arXive cs.CG/9910009",
archive = "XXX:cs.CG/9910009"
}
@article{bddlloorstw-lupc3d-01,
author = "T. Biedl and E. Demaine and M. Demaine and S. Lazard
and A. Lubiw and J. O'Rourke and M. H. Overmars and
S. Robbins and I. Streinu and G. Toussaint and
S. Whitesides",
title = "Locked and Unlocked Polygonal Chains in {3D}",
journal = DCG,
volume = 26,
number = 3,
year = 2001,
pages = "269--282",
comments = "Much detail left out; see full versions"
}
@inproceedings{bddloorsw-orfltcl-98,
author = "T. Biedl and E. Demaine and M. Demaine and A. Lubiw
and J. O'Rourke and M. H. Overmars and S. Robbins
and I. Streinu and G. T. Toussaint and
S. Whitesides",
title = "On Reconfiguring Tree Linkages: {T}rees Can Lock",
booktitle = CCCG_1998,
year = 1998,
pages = "4--5",
note = "Full version LANL arXive cs.CG/9910024; to appear in
{\em Discrete Math.}",
archive = "XXX:cs.CG/9910024"
}
@inproceedings{bddloorw-uscop-98,
author = "T. Biedl and E. Demaine and M. Demaine and A. Lubiw
and J. O'Rourke and M. H. Overmars and S. Robbins
and S. Whitesides",
title = "Unfolding Some Classes of Orthogonal Polyhedra",
booktitle = CCCG_1998,
year = 1998,
pages = "70--71",
note = "Fuller version in
Elec.
Proc.
http://cgm.cs.mcgill.ca/cccg98/proceedings/welcome.hml"
}
@inproceedings{bk-bhogd-94,
author = "T. Biedl and G. Kant",
title = "A Better Heuristic for Orthogonal Graph Drawings",
booktitle = ESA_1994,
nickname = "ESA '94",
series = LNCS,
volume = 855,
publisher = "Springer-Verlag",
year = 1994,
pages = "24--35",
keywords = "graph drawing"
}
@article{bk-bhogd-98,
author = "T. Biedl and G. Kant",
title = "A Better Heuristic for Orthogonal Graph Drawings",
journal = CGTA,
volume = 9,
year = 1998,
pages = "159--180"
}
@inproceedings{bls-wcnfp-99,
author = "T. Biedl and Anna Lubiw and Julie Sun",
title = "When Can a Net Fold to a Polyhedron?",
booktitle = CCCG_1999,
year = 1999,
pages = "1--4"
}
@inproceedings{bsww-o3dgd-97,
author = "T. Biedl and T. Shermer and S. Whitesides and
S. Wismath",
title = "Orthogonal $3$-{D} Graph Drawing",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "76--86",
keywords = "graph drawing"
}
@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"
}
@article{b-nlbod-98,
author = "Therese C. Biedl",
title = "New Lower Bounds For Orthogonal Drawings",
journal = "J. Graph Algorithms Appl.",
volume = 2,
number = 7,
year = 1998,
pages = "1--31",
url = "http://www.cs.brown.edu/publications/jgaa/accepted/98/Biedl98.2.7.ps.gz"
}
@inproceedings{b-nlbog-96,
author = "T. C. Biedl",
title = "New Lower Bounds for Orthogonal Graph Drawings",
editor = "F. J. Brandenburg",
booktitle = "Graph Drawing (Proc. GD~'95)",
series = LNCS,
volume = 1027,
publisher = "Springer-Verlag",
year = 1996,
pages = "28--39"
}
@article{b-rbsog-98,
author = "Therese C. Biedl",
title = "Relating Bends and Size in Orthogonal Graph
Drawings",
journal = IPL,
volume = 65,
year = 1998,
pages = "111--115",
keywords = "graph drawing, orthogonal"
}
@techreport{bdlrs-cmp-99,
author = "T. C. Biedl and E. D. Demaine and S. Lazard and
S. M. Robbins and M. A. Soss",
title = "Convexifying Monotone Polygons",
number = "CS-99-03",
institution = "Univ. Waterloo, Ontario",
year = 1999
}
@inproceedings{bk-aesig-97,
author = "T. C. Biedl and M. Kaufmann",
title = "Area-Efficient Static and Incremental Graph
Darwings",
editor = "R. Burkard and G. Woeginger",
booktitle = "Algorithms (Proc. ESA~'97)",
series = LNCS,
volume = 1284,
publisher = "Springer-Verlag",
year = 1997,
pages = "37--52"
}
@inproceedings{bmt-tpmua-97,
author = "Therese C. Biedl and Brendan P. Madden and Ioannis
G. Tollis",
title = "The Three-Phase Method: A Unified Approach to
Orthogonal Graph Drawing",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "391--402",
keywords = "graph drawing"
}
@article{bmt-tpmua-00,
author = "Therese C. Biedl and Brendan P. Madden and Ioannis
G. Tollis",
title = "The Three-Phase Method: A Unified Approach to
Orthogonal Graph Drawing",
journal = IJCGA,
volume = 10,
number = 6,
year = 2000,
pages = "553--580"
}
@techreport{bgg-raor-88,
author = "E. Bienenstock and D. Geman and S. Geman",
title = "A relational approach in object recognition",
type = "Technical {Report}",
institution = "Brown Univ.",
address = "Providence, RI",
year = 1988
}
@techreport{bggm-p2trd-90,
author = "E. Bienenstock and D. Geman and S. Geman and
D. E. McClure",
title = "Phase {II} technical report, development of laser
radar {ATR} algorithms",
type = "Technical {Report}",
number = "DAAL02-89-C-0081",
institution = "CECOM Center for Night Vision and Electro-Optics",
month = oct,
year = 1990
}
@inproceedings{b-sphcn-90,
author = "D. Bienstock",
title = "Some provably hard crossing number problems",
booktitle = SOCG_1990,
year = 1990,
pages = "253--260"
}
@article{b-sphcn-91,
author = "D. Bienstock",
title = "Some provably hard crossing number problems",
journal = DCG,
volume = 6,
year = 1991,
pages = "443--459"
}
@unpublished{bd-brcn-,
author = "D. Bienstock and N. Dean",
title = "Bounds on rectilinear crossing numbers",
note = "Submitted"
}
@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"
}
@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"
}
@techreport{bm-oerpg-??,
author = "D. Bienstock and C. L. Monma",
title = "Optimal Enclosing Regions in Planar Graphs",
type = "Manuscript",
year = "??"
}
@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 = ""
}
@article{b-sdtd-90,
author = "Eric A. Bier",
title = "Snap-Dragging in Three Dimensions",
journal = "Computer Graphics",
volume = 24,
number = 2,
year = 1990,
pages = "193--204",
keywords = "Methodology and Techniques, Interaction techniques,
Scene composition, interactive design, geometric
construction, constraint systems"
}
@techreport{bs-ppht-??,
author = "E. A. Bier and K. R. {Sloan, Jr.}",
title = "Pointing and placing with homogeneous transforms",
type = "Report",
number = "??",
institution = "Architect. Mach. Group, Massachusetts Inst. Tech.,
Xerox Palo Alto Res. Center",
year = "??"
}
@inproceedings{b-rp-89,
author = "H. Bieri",
title = "{Raster}-{Polyeder}",
booktitle = "Abstracts 5th Intern. Workshop Comput. Geom.",
nickname = "CG '89",
site = "Freiburg",
publisher = "Universit{\"a}t Freiburg",
year = 1989
}
@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"
}
@article{bn-spacv-83,
author = "H. Bieri and W. Nef",
title = "A sweep-plane algorithm for computing the volume of
polyhedra represented in boolean form",
journal = "Linear Algebra and its Applications",
volume = "52--53",
year = 1983,
pages = "69--97"
}
@article{bn-aecra-84,
author = "H. Bieri and W. Nef",
title = "Algorithms for the {Euler} characteristic and
related additive functionals of digital objects",
journal = "Comput. Vision Graph. Image Process.",
volume = 28,
year = 1984,
pages = "166--175"
}
@inproceedings{bn-esodd-88,
author = "H. Bieri and W. Nef",
title = "Elementary set operations with $d$-dimensional
polyhedra",
booktitle = "Computational Geometry and its Applications",
nickname = "CG '88",
site = "W{\"u}rzburg",
series = LNCS,
volume = 333,
publisher = "Springer-Verlag",
year = 1988,
pages = "97--112",
annote = "4th Intern. Workshop Comput. Geom."
}
@proceedings{bn-cgmaa-91,
title = "Proc. Computational Geometry: Methods, Algorithms
and Applications",
editor = "H. Bieri and H. Noltemeier",
nickname = "CG '91",
site = "Bern",
series = LNCS,
volume = 553,
publisher = "Springer-Verlag",
year = 1991,
annote = "7th Intern. Workshop Comput. Geom."
}
@inproceedings{bs-olacs-91,
author = "Hanspeter Bieri and Peter-Michael Schmidt",
title = "An on-line algorithm for constructing sweep planes
in regular position",
booktitle = "Proc. Computational Geometry: Methods, Algorithms
and Applications",
nickname = "CG '91",
site = "Bern",
series = LNCS,
volume = 553,
publisher = "Springer-Verlag",
year = 1991,
pages = "27--35",
annote = "7th Intern. Workshop Comput. Geom."
}
@inproceedings{bs-ofmpi-92,
author = "Hanspeter Bieri and Peter-Michael Schmidt",
title = "On the Orders of Finitely Many Points Induced by
Rotational Sweeps",
booktitle = "Abstracts 8th European Workshop Comput. Geom.",
nickname = "CG '92",
site = "Utrecht",
publisher = "Utrecht University",
year = 1992,
pages = "61--63"
}
@inproceedings{bs-pgrsp-96,
author = "H. Bieri and P.-M. Schmidt",
title = "On the permutations generated by rotational sweeps
of planar point sets",
booktitle = CCCG_1996,
year = 1996,
pages = "179--184"
}
@inproceedings{bs-rpgsp-93,
author = "Hanspeter Bieri and Peter-Michael Schmidt",
title = "Recognizing Permutations Generated by Sweeps of
Planar Point Sets",
booktitle = "Abstracts 9th European Workshop Comput. Geom.",
nickname = "CG '93",
site = "Hagen",
publisher = "FernUniversit{\"a}t Hagen",
year = 1993,
pages = "10--13"
}
@book{b-agt-74,
author = "N. Biggs",
title = "Algebraic Graph Theory",
edition = "1st",
publisher = "Cambridge University Press",
year = 1974
}
@book{b-agt-93,
author = "N. Biggs",
title = "Algebraic Graph Theory",
edition = "2nd",
publisher = "Cambridge University Press",
year = 1993
}
@techreport{bn-absop-86,
author = "G. Bilardi and A. Nicolau",
title = "Adaptive Bitonic Sorting: {An} Optimal Parallel
Algorithm for Shared Memory Machines",
type = "Technical {Report}",
number = "86-769",
institution = "Dept. Comput. Sci., Cornell Univ.",
address = "Ithaca, NY",
month = aug,
year = 1986
}
@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"
}
@inproceedings{bp-mavno-84,
author = "G. Bilardi and F. P. Preparata",
title = "A minimum area {VLSI} network for {$O(\log n)$} time
sorting",
booktitle = STOC_1984,
year = 1984,
pages = "64--70"
}
@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"
}
@inproceedings{bp-lbptt-95,
author = "G. Bilardi and F. P. Preparata",
title = "Lower bounds to processor-time tradeoffs under
bounded-speed message propagation",
booktitle = WADS_1995,
nickname = "WADS '95",
site = "Kingston, Canada",
series = LNCS,
volume = 955,
publisher = "Springer-Verlag",
year = 1995,
pages = "1--12"
}
@techreport{bp-pangs-??,
author = "G. Bilardi and F. P. Preparata",
title = "Probabilistic analysis of a new geometric searching
technique",
type = "Manuscript",
institution = "??",
year = "??",
keywords = "point location, probabilistic analysis"
}
@incollection{bs-ovcdf-87,
author = "Gianfranco Bilardi and Majid Sarrafzadeh",
title = "Optimal {VLSI} Circuits for the Discrete {Fourier}
Transform",
editor = "F. P. Preparata",
booktitle = "Parallel and Distributed Computing",
series = "Adv. Comput. Res.",
volume = 4,
publisher = "JAI Press",
address = "Greenwich, Conn.",
year = 1987,
pages = "87--101"
}
@article{b-htssg-88,
author = "L. Billera",
title = "Homology theory of smooth splines: generic
triangulations and a conjecture of {Strang}",
journal = "Trans. Amer. Math. Soc.",
volume = 310,
year = 1988,
pages = "325--340"
}
@incollection{bb-fnpc-97,
author = "L. J. Billera and A. Bj{\"o}rner",
title = "Face numbers of polytopes and complexes",
chapter = 15,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "291--310"
}
@article{bfs-ccsp-90,
author = "L. J. Billera and P. Filliman and B. Sturmfels",
title = "Constructions and Complexity of Secondary Polytopes",
journal = "Adv. Math.",
volume = 83,
year = 1990,
pages = "155--179"
}
@article{bl-psmcf-81,
author = "L. J. Billera and C. W. Lee",
title = "A Proof of the Suffiency of {McMullen}'s Conditions
for $f$-vectors of Simplicial Polytopes",
journal = "J. Combin. Theory Ser. A",
volume = 31,
number = 3,
year = 1981,
pages = "237--255"
}
@article{bm-bsebs-87,
author = "L. J. Billera and K. E. Magurn",
title = "Balanced subdivision and enumeration in balanced
spheres",
journal = DCG,
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 = DCG,
volume = 6,
year = 1991,
pages = "107--128"
}
@incollection{b-sat3m-64,
author = "R. H. Bing",
title = "Some aspects of the topology of $3$-manifolds
related to the {Poincar\'e} conjecture",
booktitle = "Lectures in Modern Mathematics",
volume = 2,
publisher = "John Wiley \& Sons",
year = 1964,
pages = "93--128",
keywords = "triangulation, three-dimensional, shellability,
topology",
annote = "possibly some other topics"
}
@book{bp-fa-94,
author = "D. Bini and V. Y. Pan",
title = "Fundamental Algorithms",
series = "Polynomial and Matrix Computations",
volume = 1,
publisher = "Birkh{\"a}user",
address = "Boston, MA",
year = 1994
}
@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"
}
@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"
}
@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 = SODA_1991,
year = 1991,
pages = "465--474"
}
@book{bgm-sma-65,
author = "Birkhoff and Garret and S. {MacLane}",
title = "A Survey of Modern Algebra",
edition = "3rd",
publisher = "MacMillan",
address = "New York, NY",
year = 1965
}
@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"
}
@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"
}
@inproceedings{bm-carnd-95,
author = "P. Biscondi and J.-M. Moreau",
title = "Computer-Aided Road Network Design",
booktitle = CCCG_1995,
year = 1995,
pages = "229--234"
}
@book{bb-ca-85,
author = "E. Bishop and D. Bridges",
title = "Constructive Analysis",
publisher = "Springer-Verlag",
address = "Berlin, Germany",
year = 1985
}
@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
}
@article{bst-cre-93,
author = "V. Bistiolas and D. Sofotassios and A. Tsakalidis",
title = "Computing rectangle enclosures",
journal = CGTA,
volume = 2,
number = 6,
year = 1993,
pages = "303--308",
keywords = "isothetic, enclosure"
}
@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
}
@article{bpp-rwcvp-98,
author = "Supriya Biswas and D. Chithra Prasad and Sudebkumar
Prasant Pal",
title = "Recognizing weakly convex visible polygons",
journal = CGTA,
volume = 10,
year = 1998,
pages = "171--186"
}
@article{bt-gest-89,
author = "T. Bisztricky and G. Fejes T{\'o}th",
title = "A generalization of the {Erd{\H{o}}s-Szekeres}
theorem",
journal = "J. Reine Angew. Math.",
volume = 395,
year = 1989,
pages = "167--170"
}
@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
}
@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"
}
@phdthesis{b-vagt-93,
author = "Iliana Bjorling-Sachs",
title = "Variations on the Art Gallery Theorem",
school = "Rutgers University",
year = 1993,
keywords = "doctoral thesis"
}
@techreport{bs-tbegm-92t,
author = "Iliana Bjorling-Sachs and Diana L. Souvaine",
title = "A Tight Bound for Edge Guards in Monotone Polygons",
type = "Technical Report",
number = "92-52",
institution = "DIMACS, Rutgers University",
year = 1992
}
@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 = DCG,
volume = 13,
year = 1995,
pages = "77--109"
}
@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 = CCCG_1992,
year = 1992,
pages = "93--98"
}
@incollection{b-tm-95,
author = "A. Bj{\"o}rner",
title = "Topological Methods",
chapter = 34,
editor = "R. L. Graham and M. Gr{\"o}tschel and L. Lov{\'a}sz",
booktitle = "Handbook of Combinatorics",
publisher = "North-Holland",
address = "Amsterdam",
year = 1995,
pages = "1819--1872"
}
@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 = DCG,
volume = 5,
year = 1990,
pages = "263--288"
}
@book{blwsz-om-93,
author = "A. Bj{\"o}rner and M. {Las Vergnas} and N. White and
B. Sturmfels and G. M. Ziegler",
title = "Oriented Matroids",
publisher = "Cambridge University Press",
address = "Cambridge",
year = 1993
}
@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 = STOC_1992,
year = 1993,
pages = "170--177"
}
@article{bz-csca-92,
author = "A. Bj{\" o}rner and G. M. Ziegler",
title = "Combinatorial stratification of complex
arrangements",
journal = "J. Amer. Math. Soc.",
volume = 5,
year = 1992,
pages = "105--149"
}
@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"
}
@manual{bbehlmstwobclpwwt-cmgev-94,
author = "T. D. Blacker and W. J. Bohnhoff and T. L. Edwards
and J. R. Hipp and R. R. Lober and S. A. Mitchell
G. D. Sjaardema and T. J. Tautges and T. J. Wilson
and W. R. Oakes and S. Benzley and J. C. Clements
and L. Lopez-Buriek and S. Parker and M. Whitely and
D. White and E. Trimble",
title = "CUBIT mesh generation environment volume 1: users
manual",
organization = "Sandia National Laboratories",
address = "Albuquerque, NM",
month = may,
year = 1994,
note = "SAND94-1100"
}
@article{bj-etb-84,
author = "C. E. Blair and R. G. Jeroslow",
title = "Extension of a theorem of {Balas}",
journal = "Discrete Appl. Math.",
volume = 9,
year = 1984,
pages = "11--26"
}
@inproceedings{blhrs-iacv-96,
author = "Gregoria Blanco and Jes{\'u}s Garc{\'\i}a L{\'o}pez
and Ferran Hurtado and Pedro Ramos and Vera
Sacrist{\'a}n",
title = "Incidence Angle Constrained Visibility",
booktitle = "Abstracts 12th European Workshop Comput. Geom.",
nickname = "CG '96",
site = "M{\"u}nster",
publisher = "Universit{\"a}t M{\"u}nster",
year = 1996,
pages = "27--28"
}
@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"
}
@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"
}
@article{bv-om-78,
author = "R. G. Bland and M. {Las Vergnas}",
title = "Orientability of Matroids",
journal = "J. Combin. Theory",
volume = 23,
year = 1978,
pages = "94--123"
}
@article{bd-glihf-93,
author = "J. Blaney and S. Dixon",
title = "A good ligand is hard to find: {Automated} docking
methods",
journal = "Perspectives in Drug Discovery and Design",
volume = 1,
year = 1993,
pages = "310--319"
}
@inproceedings{buma-ggfdp-90,
author = "H. Blanken and A. Ubema and P. Meek and B. Akker",
title = "The generalized grid file: description and
performance aspects",
booktitle = "Proc. IEEE Internat. Conf. Data Eng.",
site = "Los-Angeles, Calif.",
year = 1990,
pages = "380--388",
keywords = "data structuring"
}
@inproceedings{bg-eest-90,
author = "Gabriele Blankenagel and Ralf Hartmut G{\"u}ting",
title = "{EST}: {Externe} {Segment} {Trees}",
booktitle = "Abstracts 6th Intern. Workshop Comput. Geom.",
nickname = "CG '90",
site = "Siegen",
publisher = "Universit{\"a}t Siegen",
year = 1990,
pages = 8
}
@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
}
@inproceedings{bg-ieapr-88,
author = "G. Blankenagel and R. H. G{\"u}ting",
title = "Internal and external algorithms for the
points-in-regions problem: the inside join of
geo-relational algebra",
booktitle = "Computational Geometry and its Applications",
nickname = "CG '88",
site = "W{\"u}rzburg",
series = LNCS,
volume = 333,
publisher = "Springer-Verlag",
year = 1988,
pages = "85--89",
comments = "extended abstract",
annote = "4th Intern. Workshop Comput. Geom."
}
@article{bg-ieapr-90,
author = "G. Blankenagel and R. H. G{\"u}ting",
title = "Internal and external algorithms for the
points-in-regions problem: the inside join of
geo-relational algebra",
journal = "Algorithmica",
volume = 5,
year = 1990,
pages = "251--276"
}
@incollection{bps-aamv-89,
author = "W.-E. Blanz and D. Petkovic and J. L. C. Sanz",
title = "Algorithms and Architectures for Machine Vision",
editor = "C. H. Chen",
booktitle = "Signal Processing Handbook",
publisher = "M. Dekker",
address = "New York",
year = 1989
}
@book{b-kuk-16,
author = "W. Blaschke",
title = "Kreis und {Kugel}",
publisher = "??",
address = "Leipzig",
year = 1916
}
@inproceedings{bmt-dppbp-96,
author = "Guy Blelloch and Gary L. Miller and Dafna Talmor",
title = "Developing a Practical Projection-Based Parallel
{Delaunay} Algorithm",
booktitle = SOCG_1996,
year = 1996,
pages = "186--195"
}
@inproceedings{bmt-pdti-94,
author = "G. Blelloch and G. L. Miller and D. Talmor",
title = "Parallel {Delaunay} triangulation imlpementation",
booktitle = "Proc. 4th MSI Workshop Comput. Geom.",
month = oct,
year = 1994
}
@article{bchsz-ipndp-94,
author = "G. E. Blelloch and S. Chatterjee and J. C. Hardwick
and J. Sipelstein and M. Zagha",
title = "Implementation of a portable nested data-parallel
language",
journal = "J. Parallel Distrib. Comput.",
volume = 21,
number = 1,
month = apr,
year = 1994,
pages = "4--14"
}
@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"
}
@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"
}
@article{bl-psgps-94,
author = "G. E. Blelloch and J. J. Little",
title = "Parallel solutions to geometric problems in the scan
model of computation",
journal = "J. Comput. Syst. Sci.",
volume = 48,
number = 1,
month = feb,
year = 1994,
pages = "90--115"
}
@article{bmht-dippd-99,
author = "G. E. Blelloch and G. L. Miller and J. C. Hardwick
and D. Talmor",
title = "Design and Implementation of a Practical Parallel
{Delaunay} Algorithm",
journal = "Algorithmica",
volume = 24,
number = 3,
year = 1999,
pages = "243--269"
}
@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"
}
@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 = SIGGRAPH_1977
}
@techreport{b-mrsdh-,
author = "J. F. Blinn",
title = "A Method for Removing Some Degeneracies in Hidden
Line and Ray Tracing Calculations",
institution = "Jet Propulsion Lab.",
year = "??"
}
@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"
}
@article{b-cwbcb-89,
author = "E. D. Bloch",
title = "Complexes whose boundaries cannot be pushed around",
journal = DCG,
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 = FOCS_1991,
year = 1991,
pages = "670--677"
}
@inproceedings{b-hdrnr-92,
author = "J. Bl{\"o}mer",
title = "How to Denest {Ramanujan's} Nested Radicals",
booktitle = FOCS_1992,
year = 1992,
pages = "447--457"
}
@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 = IPL,
volume = 31,
year = 1989,
pages = "319--322",
keywords = "lower bounds, points"
}
@article{b-ctp-77,
author = "G. S. Bloom",
title = "A counterexamlpe to a theorem of {Piccard}",
journal = "J. Combin. Theory Ser. A",
volume = 22,
year = 1977,
pages = "378--379"
}
@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",
annote = "Gives code to polygonize an arbitrary implicit
surface. Polygonization is a common approach to
implicit surface rendering and volume
rendering. When combined with code for trilinear
interpolation code, a program for polygonizing
volume data can easily be constructed. The resulting
polygonizations will be superior to those generated
by the ``Marching Cubes'' algorithm, in many
cases. Contains C code."
}
@book{b-iis-97,
title = "Introduction to Implicit Surfaces",
editor = "Jules Bloomenthal",
volume = 391,
publisher = "Morgan-Kaufmann",
year = 1997
}
@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"
}
@inproceedings{bc-olaip-93,
author = "Avrim Blum and Prasad Chalasani",
title = "An On-Line Algorithm for Improving Performance in
Navigation",
booktitle = FOCS_1993,
nickname = "FOCS '93",
year = 1993,
pages = "2--11"
}
@article{bc-oaipn-00,
author = "A. Blum and P. Chalasani",
title = "An online algorithm for improving performance in
navigation",
journal = SICOMP,
volume = 29,
year = 2000,
pages = "1907--1938"
}
@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 = STOC_1995,
nickname = "STOC '95",
year = 1995,
pages = "294--302"
}
@inproceedings{bk-likhu-93,
author = "Avrim Blum and Ravi Kannan",
title = "Learning an Intersection of $k$ Halfspaces Over a
Uniform Distribution",
booktitle = FOCS_1993,
nickname = "FOCS '93",
year = 1993,
pages = "312--320"
}
@inproceedings{brs-nugt-91,
author = "A. Blum and P. Raghavan and B. Schieber",
title = "Navigating in unfamiliar geometric terrain",
booktitle = STOC_1991,
year = 1991,
pages = "494--503",
keywords = "path planning, on-line",
comments = "Computing Reviews 9111-0883"
}
@article{brs-nugt-97,
author = "A. Blum and P. Raghavan and B. Schieber",
title = "Navigating in unfamiliar geometric terrain",
journal = SICOMP,
volume = 26,
number = 1,
month = feb,
year = 1997,
pages = "110--137"
}
@inproceedings{brs-nut-90,
author = "A. Blum and P. Raghavan and B. Schieber",
title = "Navigating in Unfamiliar Terrain",
booktitle = STOC_1990,
year = 1990
}
@inproceedings{br-t3nnn-88,
author = "A. Blum and R. Rivest",
title = "Training a $3$-node neural network is {NP}-complete",
booktitle = "Proc. 1st. Workshop Comput. Learning Th.",
year = 1988,
pages = "9--18"
}
@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"
}
@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"
}
@article{bss-tccrn-89,
author = "L. Blum and M. Shub and S. Smale",
title = "On a theory of computation and complexity over the
real numbers: {NP}-completeness, recursive functions
and universal machines",
journal = "Bull. Amer. Math. Soc.",
volume = 21,
number = "1--46",
year = 1989
}
@article{bfprt-tbs-73,
author = "M. Blum and R. W. Floyd and V. Pratt and
R. L. Rivest and R. E. Tarjan",
title = "Time bounds for selection",
journal = "J. Comput. Syst. Sci.",
volume = 7,
year = 1973,
pages = "448--461"
}
@article{bk-dpcw-95,
author = "Manuel Blum and Sampath Kannan",
title = "Designing Programs that Check Their Work",
journal = JACM,
volume = 42,
number = 1,
month = jan,
year = 1995,
pages = "269--291"
}
@inproceedings{bk-ptctw-89,
author = "M. Blum and S. Kannan",
title = "Programs that check their work",
booktitle = STOC_1989,
year = 1989
}
@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 = FOCS_1978,
year = 1978,
pages = "132--142"
}
@article{blr-stcan-93,
author = "Manuel Blum and Michael Luby and Ronitt Rubinfeld",
title = "Self-Testing/Correcting with Applications to
Numerical Problems",
journal = "J. Comput. Syst. Sci.",
volume = 47,
number = 3,
year = 1993,
pages = "549--595"
}
@inproceedings{blr-scanp-90,
author = "M. Blum and M. Luby and R. Rubinfeld",
title = "Selftesting/correcting with applications to
numerical problems",
booktitle = STOC_1990,
year = 1990,
pages = "73--83"
}
@article{bm-anrow-80,
author = "N. Blum and K. Mehlhorn",
title = "On the average number of rebalancing operations in
weight-balanced trees",
journal = TCS,
volume = 11,
year = 1980,
pages = "303--320"
}
@book{bm-sg-70,
author = "L. M. Blumenthal and K. Menger",
title = "Studies in Geometry",
publisher = "W. H. Freeman",
address = "San Francisco, CA",
year = 1970
}
@inproceedings{bbehw-clgcv-86,
author = "A. Blumer and A. Ehrenfeucht and D. Haussler and
M. Warmuth",
title = "Classifying learnable geometric concepts with
Vapnik-Chervonenkis dimension",
booktitle = STOC_1986,
year = 1986
}
@article{behw-clgcv-89,
author = "A. Blumer and A. Ehrenfeucht and D. Haussler and
M. Warmuth",
title = "Learnability and the {Vapnik}-{Chervonenkis}
Dimension",
journal = JACM,
volume = 36,
year = 1989,
pages = "929--965",
keywords = "pattern recognition, probability theory,
probabilistic geometry, approximation, separation,
probabilistic analysis"
}
@inproceedings{bgp-cdnsc-98,
author = "Marko Boben and Harald Gropp and Toma{\v z}
Pisanski",
title = "Computer Drawings of Non-Symmetric Configurations",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "37--40"
}
@article{bw-rphs-88,
author = "J. Bobowski and J. M. Wills",
title = "Regular polyhedra with hidden symmetry",
journal = "The Mathematical Intelligencer",
volume = 10,
number = 11,
year = 1988,
pages = "27--32"
}
@article{bdg-tocrm-85,
author = "J. Bobrow and S. Dubowsky and J. Gibson",
title = "Time-Optimal Control of Robot Manipulators",
journal = "Internat. J. Robot. Res.",
volume = 4,
number = 3,
year = 1985
}
@inproceedings{bdg-ocrma-83,
author = "J. E. Bobrow and S. Dubowsky and J. S. Gibson",
title = "On the Optimal Control of Robotic Manipulators with
Actuator Constraints",
booktitle = "Proc. ACC",
site = "San Francisco, CA",
year = 1983,
pages = "782--787"
}
@book{b-iha-07,
author = "Maxime Bocher",
title = "Introduction to higher algebra",
publisher = "Macmillan",
year = 1907
}
@inproceedings{bm-csdp-97,
author = "Daciana Bochis and Marisa Mazon",
title = "Combinatorial Structure of {Dirichlet} Partitions",
booktitle = "Abstracts 13th European Workshop Comput. Geom.",
nickname = "CG '97",
site = "W{\"u}rzburg",
publisher = "Universit{\"a}t W{\"u}rzburg",
year = 1997,
pages = "51--54"
}
@inproceedings{bs-mnf3d-98,
author = "Daciana Bochis and Francisco Santos",
title = "On the Maximal Number of Facets of 3-Dimensional
{Dirichlet} Stereohedra",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "41--43"
}
@inproceedings{bgr-sppta-95,
author = "D. F. Bochis and M. J. Gonz{\'a}lez-L{\'o}pez and
T. Recio",
title = "Simulation Program of the Path Tracking for Any
Irredundant Planar Manipulator and the {6R}
Manipulator",
booktitle = "Abstracts 11th European Workshop Comput. Geom.",
nickname = "CG '95",
site = "Linz",
publisher = "Universit{\"a}t Linz",
year = 1995,
pages = "71--73"
}
@book{bcr-gar-87,
author = "J. Bochnak and M. Coste and M.-F. Roy",
title = "G\'eom\'etrie Alg\'ebrique R\'eelle",
publisher = "Springer-Verlag",
address = "Heidelberg",
year = 1987
}
@book{b-ak-74,
author = "H. H. Bock",
title = "Automatische {Klassifikation}",
publisher = "Vandenhoeck \& Ruprecht",
address = "G{\"o}ttingen, West Germany",
year = 1974
}
@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
}
@article{bfk-scsmc-84,
author = "W. Boehm and G. Farin and J. Kahmann",
title = "A survey of curve and surface methods in {CAGD}",
journal = "Comput. Aided Geom. Design",
volume = 1,
number = 1,
year = 1984,
pages = "1--60"
}
@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"
}
@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"
}
@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"
}
@techreport{bilf-putg-91,
author = "K. P. Bogart and G. Isaak and L. Langley and
P. C. Fishburn",
title = "Proper and Unit Tolerance Graphs",
type = "Technical Report",
number = "91-74",
institution = "DIMACS",
month = nov,
year = 1991
}
@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
}
@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"
}
@techreport{b-smc-49,
author = "D. J. Bogue",
title = "The structure of the metropolitan community",
type = "Report",
number = "??",
institution = "Univ. Mich. Contributions Inst. Human Adjustment
Social Sci.",
address = "Ann Arbor, MI",
year = 1949
}
@incollection{b-wdwnb-90,
author = "G. Bohlender",
title = "What do we need beyond {IEEE}-arithmetics?",
booktitle = "Computer Arithmetic and self-validating numerical
methods",
publisher = "Academic Press",
address = "New York, NY",
year = 1990,
pages = "1--32"
}
@book{bruw-pcmls-86,
author = "G. Bohlender and L. B. Rall and C. Ullrich and
J. {Wolff von Gudenberg}",
title = "{PASCAL-CS} - {A} Microcomputer Language for
Scientific Computation",
publisher = "Academic Press",
address = "New York, NY",
year = 1986
}
@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"
}
@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"
}
@book{bs-dcmta-84,
author = "K. B{\"o}hmer and H. J. Stetter",
title = "Defect correction methods, theory and applications",
publisher = "Springer-Verlag",
year = 1984
}
@inproceedings{bn-ucasa-90,
author = "K. Bohringer and F. {Newbery Paulisch}",
title = "Using Constraints to Achieve Stability in Automatic
Graph Layout Algorithms",
booktitle = "Proc. ACM Conf. on Human Factors in Computing
Systems",
nickname = "CHI",
year = 1990,
pages = "43--51",
keywords = "graph drawing"
}
@inproceedings{bbg-smutv-95,
author = "K.-F. B{\"o}hringer and V. Bhatt and K. Y. Goldberg",
title = "Sensorless manipulation using transverse vibrations
of a plate",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
site = "Nagoya, Japan",
year = 1995,
pages = "1989--1996"
}
@inproceedings{bdh-abpfe-97,
author = "K.-F. B{\"o}hringer and B. Donald and D. Halperin",
title = "The Area Bisectors of a Polygon and Force Equilibria
in Programmable Vector Fields",
booktitle = SOCG_1997,
year = 1997,
pages = "457--459"
}
@inproceedings{bdm-scsaa-96,
author = "K.-F. B{\"o}hringer and B. R. Donald and
N. C. MacDonald",
title = "Single-crystal silicon actuator arrays for micro
manipulation tasks",
booktitle = "Proc. IEEE Workshop on Micro Electro Mechanical
Systems",
nickname = "MEMS",
site = "San Diego, CA",
month = feb,
year = 1996
}
@incollection{bdm-ulbpv-96,
author = "K.-F. B{\"o}hringer and B. R. Donald and
N. C. MacDonald",
title = "Upper and lower bounds for programmable vector
fields with applications to {MEMS} and vibratory
plate part feeders",
editor = "J.-P. Laumond and M. H. Overmars",
booktitle = "Algorithms for Robotic Motion and Manipulation",
publisher = "A. K. Peters",
address = "Wellesley, MA",
year = 1996,
pages = "255--276"
}
@article{b--94,
author = "J.-D. Boissonnat",
title = "??",
journal = "J. Mol Graphics",
volume = 12,
year = 1994,
pages = "61--62"
}
@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,
J. D. Boissonnat, L. Cohen, B. Geiger,
J. Levy-Vehel, O. Monga, P. Sander--Steps toward the
Automatic Interpretation of 3D Images. In 3D imaging
in Medicine, vol F60 (1990)"
}
@inproceedings{b-pagc-98,
author = "J.-D. Boissonnat",
title = "Predicate Arithmetic for Geometric Computing",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = 3
}
@inproceedings{b-rs-85,
author = "J.-D. Boissonnat",
title = "Reconstruction of solids",
booktitle = SOCG_1985,
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)"
}
@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."
}
@techreport{b-srpcs-86,
author = "J.-D. Boissonnat",
title = "Shape reconstruction from planar cross-sections",
type = "Report",
number = 546,
institution = "INRIA Sophia-Antipolis",
address = "Valbonne, France",
year = 1986
}
@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",
annote = "Computes the 3D DT between two contours (extra
points are added to force the boundary---by
repeatedly adding midpoints to edges not in DT) by
merging DTs of each contour. Then tetras are
eliminated so that each point is on the surface.",
abstract = "We propose a new solution to the problem of
constructing a shape over a set of cross-sectional
contours. We construct a volume whose boundary is a
polyhedron with triangular faces intersecting the
cutting planes along the given contours. This volume
is obtained, slice by slice, by pruning the Delaunay
triangulations formed between two adjacent cross
sections. The Delaunay triangulation can be computed
efficiently in this specific situation: an algorithm
is presented that is optimal with respect to the
input size and the output size and that only uses
2-dimensional operations. The shape reconstruction
method extracts, from that triangulation, a maximum
solid with no singularity. It can handle the case
where the number of contours varies from one cross
section to the other and thus, can handle
contour-defined objects which are branched and have
holes. This algorithm has been fully implemented and
tested on various examples; results on medical
images are presented. (Author abstract) 28 Refs."
}
@techreport{bb-arcto-94,
author = "J.-D. Boissonnat and X.-N. Bui",
title = "Accessibility region for a car that only moves
forwards along optimal paths",
type = "Research Report",
number = 2181,
institution = "INRIA Sophia-Antipolis",
year = 1994,
abstract = " In [BSBL93], the synthesis problem has been solved
for a non-holonomic car-like robot only allowed to
move forwards in a plane. Here we complete the study
of this mobile robot by computing the
SP-accessibility regions which are the sets of
points reached from the origin configuration with an
optimal path of length less than or equal to a given
value. For that, we consider the problem of
optimising the paths starting from an oriented point
and arriving at another point with free
orientation. After characterising these optimal
paths, we compute the partition of the plane
w.r.t. the types of the optimal paths, and finally
we find the shapes of the SP-accessibility regions."
}
@inproceedings{bc-cfssg-01,
author = "J.-D. Boissonnat and F. Cazls",
title = "Coarse-to-fine surface simplification with geometric
guarantees",
editor = "A. Chalmers and T.-M. Rhyne",
booktitle = "Eurographics'01",
publisher = "Blackwell",
address = "Manchester",
year = 2001,
pages = ""
}
@article{bc-ncps-01,
author = "J.-D. Boissonnat and F. Cazls",
title = "Natural Coordinates of Points on a Surface",
journal = CGTA,
volume = 19,
year = 2001,
pages = "155--173"
}
@article{bc-nncps-01,
author = "J.-D. Boissonnat and F. Cazals",
title = "Natural neighbor coordinates of points on a surface",
journal = CGTA,
volume = 19,
year = 2001,
pages = "155--173"
}
@inproceedings{bc-ssrnn-00,
author = "J.-D. Boissonnat and F. Cazls",
title = "Smooth surface reconstruction via natural neighbour
interpolation of distance functions",
booktitle = SOCG_2000,
year = 2000,
pages = "223--232"
}
@inproceedings{bcddprty-pcet-99,
author = "J.-D. Boissonnat and F. Cazls and F. Da and
O. Devillers and S. Pion and F. Rebufat and
M. Teillaud and M. Yvinec",
title = "Programming with {CGAL}: The Example of
Triangulations",
booktitle = SOCG_1999,
year = 1999,
pages = "421--423",
url = "http://www-sop.inria.fr/prisme/publis/bcddprty-pcet-99.ps.gz"
}
@inproceedings{bcf-2sdsm-00,
author = "J.-D. Boissonnat and F. Cazls and Julia
Fl{\"o}totto",
title = "2$D$-Structure Drawings of Similar Molecules",
editor = "Joe Marks",
booktitle = "Graph Drawing: 8th international symposium",
series = LNCS,
volume = 1984,
publisher = "Springer-Verlag",
year = 2000,
pages = "115--126"
}
@inproceedings{bcn-ssr-99,
author = "J.-D. Boissonnat and F. Cazls and St{\'e}phane
Nullans",
title = "Smooth Shape Reconstruction",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "63--68"
}
@article{bcdkl-sppbd-99,
author = "J.-D. Boissonnat and Andr\'e C\'er\'ezo and Elena
Degtiariora-Kostova and Vladimir Kostov and Juliette
Leblond",
title = "Shortest plane paths with bounded derivative of the
curvature",
journal = "C. R. Acad. Sci.",
volume = "329-I",
year = 1999,
pages = "613--618"
}
@inproceedings{bcddy-acchs-92,
author = "J.-D. Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and
O. Devillers and Jacqueline Duquesne and M. Yvinec",
title = "An algorithm for constructing the convex hull of a
set of spheres in dimension $d$",
booktitle = CCCG_1992,
year = 1992,
pages = "269--273"
}
@article{bcddy-acchs-96,
author = "J.-D. Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and
O. Devillers and Jacqueline Duquesne and M. Yvinec",
title = "An algorithm for constructing the convex hull of a
set of spheres in dimension $d$",
journal = CGTA,
volume = 6,
year = 1996,
pages = "123--130",
url = "http://www-sop.inria.fr/prisme/publis/bcddy-acchs-96.ps.gz",
abstract = "We present an algorithm which computes the convex
hull of a set of $n$ spheres i n dimension $d$ in
time $O (n^{\lceil \frac{d}{2} \rceil}+n\log n)$. It
is worst-case optimal in three dimensions and in
even dimensions. The same method can also be used to
compute the convex hull of a set of $n$ homo thetic
convex objects of $E^d$. If the complexity of each
object is constant, the time needed in the worst
case is $O(n^{\lceil \frac{d}{2} \rceil}+n\log n)$."
}
@techreport{bcdt-osc3d-91t,
author = "J.-D. Boissonnat and Andr{\'e} 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/RRRT/RR-1415",
keywords = "Delaunay triangulation, Voronoi diagrams,
output-sensitive algorithms, shape reconstructions,
shelling, tomography"
}
@inproceedings{bcdt-osc3d-91i,
author = "J.-D. Boissonnat and Andr{\'e} 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 = CCCG_1991,
year = 1991,
pages = "110--113",
keywords = "Delaunay triangulation, Voronoi diagrams,
output-sensitive algorithms, shape reconstructions,
shelling, tomography"
}
@article{bcdt-oscdt-96,
author = "J.-D. Boissonnat and Andr{\'e} 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 = IJCGA,
volume = 6,
number = 1,
year = 1996,
pages = "1--14",
url = "http://www-sop.inria.fr/prisme/publis/bcdt-oscdt-96.ps.gz",
abstract = "In this paper, we propose an algorithm to compute
the Delaunay triangulation of a set $S$ of {$n$}
points in 3-dimensional space when the points lie in
2 planes. The algorithm is output-sensitive and
optimal with respect to the input and the output
sizes. Its time complexity is {$O(n\log n+t)$},
where {$t$} is the size of the output, and the extra
storage is {$O(n)$}."
}
@inproceedings{bcd-acchs-92,
author = "J. D. Boissonnat and A. C{\'e}r{\'e}zo and
J. Duquesne",
title = "An Algorithm for Constructing the Convex Hull of a
Set of Spheres in Three Dimensional Space",
booktitle = "Abstracts 8th European Workshop Comput. Geom.",
nickname = "CG '92",
site = "Utrecht",
publisher = "Utrecht University",
year = 1992,
pages = "51--53"
}
@techreport{bcl-nspps-94,
author = "J.-D. Boissonnat and Andr{\'e} C\'er\'ezo and
Juliette Leblond",
title = "A Note on Shortest Paths in the Plane Subject to a
Constraint on the Derivative of the Curvature",
type = "Rapport de recherche",
number = 2160,
institution = "INRIA",
year = 1994,
url = "http://www-sop.inria.fr/RRRT/RR-2160.html"
}
@techreport{bcl-spbcp-91,
author = "J.-D. Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and
Juliette Leblond",
title = "Shortest paths of bounded curvature in the plane",
type = "Report",
number = 1503,
institution = "INRIA Sophia-Antipolis",
address = "Valbonne, France",
month = jul,
year = 1991
}
@inproceedings{bcl-spbcp-92,
author = "J.-D. Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and
Juliette Leblond",
title = "Shortest paths of bounded curvature in the plane",
booktitle = "Proc. 9th IEEE Internat. Conf. Robot. Autom.",
year = 1992
}
@article{bcl-spbcp-94,
author = "J.-D. Boissonnat and Andr{\'e} C\'er\'ezo and
Juliette Leblond",
title = "Shortest paths of bounded curvature in the plane",
journal = "Internat. J. Intell. Syst.",
volume = 10,
year = 1994,
pages = "1--16"
}
@inproceedings{bcdry-ctbc-94,
author = "J.-D. Boissonnat and Jurek Czyzowicz and
O. Devillers and Jean-Marc Robert and M. Yvinec",
title = "Convex Tours of Bounded Curvature",
booktitle = ESA_1994,
nickname = "ESA '94",
series = LNCS,
volume = 855,
publisher = "Springer-Verlag",
year = 1994,
pages = "254--265",
url = "http://www-sop.inria.fr/prisme/biblio/search.html",
abstract = " We consider the motion planning problem for a point
constrained to move along a smooth (C1) closed
(cycle) convex path of bounded curvature. The
workspace of the moving point is bounded by a convex
polygon with m vertices, containing an obstacle in a
form of a simple polygon with n vertices. We present
an O(m + n) time algorithm finding the path, going
around the obstacle, whose curvature is the smallest
possible."
}
@article{bcdry-ctbc-99,
author = "J.-D. Boissonnat and Jurek Czyzowicz and
O. Devillers and Jean-Marc Robert and M. Yvinec",
title = "Convex Tours of Bounded Curvature",
journal = CGTA,
volume = 13,
year = 1999,
pages = "149--159",
url = "http://www-sop.inria.fr/prisme/biblio/",
archive = "XXX:cs.CG/9909004",
abstract = "We consider the motion planning problem for a point
constrained to move along a smooth closed convex
path of bounded curvature. The workspace of the
moving point is bounded by a convex polygon with $m$
vertices, containing an obstacle in a form of a
simple polygon with $n$ vertices. We present an
$O(m+n)$ time algorithm finding the path, going
around the obstacle, whose curvature is the smallest
possible."
}
@techreport{bcduy-clcst-95,
author = "J.-D. Boissonnat and Jurek Czyzowicz and
O. Devillers and Jorge 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",
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 Jurek Czyzowicz and
O. Devillers and Jorge Urrutia and M. Yvinec",
title = "Computing largest circles separating two sets of
segments",
booktitle = CCCG_1996,
year = 1996,
pages = "173--178"
}
@article{bcduy-clcst-00,
author = "J.-D. Boissonnat and Jurek Czyzowicz and
O. Devillers and Jorge Urrutia and M. Yvinec",
title = "Computing Largest Circles Separating Two Sets of
Segments",
journal = IJCGA,
volume = 10,
year = 2000,
pages = "41--54",
url = "http://www-sop.inria.fr/prisme/publis/bcduy-clcst.ps.gz",
archive = "XXX/cs.CG/9909005",
abstract = "A circle $C$ separates two planar sets if it
encloses one of the sets and its open interior disk
does not meet the other set. A separating circle is
a largest one if it cannot be locally increased
while still separating the two given sets. An
$\Theta(n \log n)$ optimal algorithm is proposed to
find all largest circles separating two given sets
of line segments when line segments are allowe d to
meet only at their endpoints. In the general case,
when line segments may intersect $\Omega(n^2)$
times, our algorithm can be adapted to work in $O(n
\alpha(n) \log n)$ time and $O(n \alpha(n))$ space,
where $\alpha(n)$ represents the extremely slowly
growing inverse of the Ackermann function."
}
@inproceedings{bcdy-csp-95,
author = "J.-D. Boissonnat and Jurek Czyzowicz and
O. Devillers and M. Yvinec",
title = "Circular Separability of Polygons",
booktitle = SODA_1995,
year = 1995,
pages = "273--281",
keywords = "separation, containment, largest disk, Voronoi
diagrams",
abstract = "Two planar sets are circularly separable if there
exists a circle enclosing one of the set and whose
open interior disk does not intersect the other
set. This paper studies two problems related to
circular separability. A linear-time algorithm is
proposed to decide if two polygons are circularly
separable. The algorithm outputs the smallest
separating circle. The second problem asks for the
largest circle included in a preprocessed, convex
polygon, under some point and/or line
constraints. The resulting circle must contain the
query points and it must lie in the halfplanes
delimited by the query lines."
}
@article{bcdy-csp-01,
author = "J.-D. Boissonnat and Jurek Czyzowicz and
O. Devillers and M. Yvinec",
title = "Circular Separability of Polygons",
journal = "Algorithmica",
volume = 30,
year = 2001,
pages = "67i--82",
url = "http://link.springer.de/link/service/journals/00453/contents/00/10078/paper/10078.pdf",
archive = "XXX/cs.CG/9909007",
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 LeonBattista
Donati and F. P. Preparata",
title = "Motion planning for a spider robot",
booktitle = "Proc. 9th IEEE Internat. Conf. Robot. Autom.",
year = 1992,
pages = "2321--2326",
keywords = "motion planning, legged robot"
}
@article{bddp-mplrs-95,
author = "J.-D. Boissonnat and O. Devillers and LeonBattista
Donati and F. P. Preparata",
title = "Motion planning of legged robots: the spider robot
problem",
journal = IJCGA,
volume = 5,
number = "1--2",
year = 1995,
pages = "3--20",
url = "http://www-sop.inria.fr/prisme/publis/bddp-mplrs-95.ps.gz",
abstract = "We consider the problem of planning motions of a
simple legged robot called the spider robot. The
robot is modelled as a point where all its legs are
attached, and the footholds where the robot can
securely place its feet consist of a set of $n$
points in the plane. We show that the space $\cal F$
of admissible and stable placements of such robots
has size $\Theta(n^2)$ and can be constructed in
$O(n^2\log n)$ time and $O(n^2)$ space. Once $\cal
F$ has been constructed, we can efficiently solve
several problems related to motion planning."
}
@inproceedings{bddp-spsr-92,
author = "J.-D. Boissonnat and O. Devillers and LeonBattista
Donati and F. P. Preparata",
title = "Stable placements of spider robots",
booktitle = SOCG_1992,
year = 1992,
pages = "242--250",
url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1767",
keywords = "motion planning, legged robot"
}
@inproceedings{bdl-srhdr-94c,
author = "J.-D. Boissonnat and O. Devillers and S. Lazard",
title = "From Spider Robots to Half-Disk Robots",
booktitle = "Abstracts 10th European Workshop Comput. Geom.",
nickname = "CG '94",
site = "Santander",
publisher = "Universidad de Cantabria, Santander",
year = 1994,
pages = "62--63"
}
@inproceedings{bdl-srhdr-94,
author = "J.-D. Boissonnat and O. Devillers and S. Lazard",
title = "From Spider Robots to Half Disks Robots",
booktitle = "Proc. 11th IEEE Internat. Conf. Robot. Autom.",
year = 1994,
pages = "953--958"
}
@inproceedings{bdl-mplr-94,
author = "J.-D. Boissonnat and O. Devillers and S. Lazard",
title = "Motion Planning of Legged Robots",
booktitle = WAFR_1994,
publisher = "A. K. Peters, Boston, MA",
year = 1994
}
@article{bdl-mplr-00,
author = "J.-D. Boissonnat and O. Devillers and S. Lazard",
title = "Motion Planning of Legged Robots",
journal = SICOMP,
volume = 30,
year = 2000,
pages = "218--246",
url = "http://www-sop.inria.fr/prisme/publis/bdl-mplr.ps.gz",
archive = "XXX/cs.CG/9909006",
abstract = "We study the problem of computing the free space
$\cal F$ of a simple legged robot called the spider
robot. The body of this robot is a single point and
the legs are attached to the body. The robot is
subject to two constraints: each leg has a maximal
extension $R$ (accessibility constraint) and the
body of the robot must lie above the convex hull of
its feet (stability constraint). Moreover, the robot
can only put its feet on some regions, called the
foothold regions. The free space $\cal F$ is the set
of positions of the body of the robot such that
there exists a set of accessible footholds for which
the robot is stable. We present an efficient
algorithm that computes $\cal F$ in $O(n^2\log n)$
time using $O(n^2\alpha(n))$ space for $n$ discrete
point footholds where $\alpha(n)$ is an extremely
slowly growing function ($\alpha(n)\leq 3$ for any
practical value of $n$). We also present an
algorithm for computing $\cal F$ when the foothold
regions are pairwise disjoint polygons with $n$ ed
ges in total. This algorithm computes $\cal F$ in
$O(n^2\alpha_8(n)\log n)$ time using
$O(n^2\alpha_8(n))$ space ($\alpha_8(n)$ is also an
extremely slowly growing function). These results
are close to optimal since $\Omega(n^2)$ is a lower
bound for the size of~$\cal F$."
}
@techreport{bdp-cu3ct-90,
author = "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/RRRT/RR-1293"
}
@article{bdp-cu3ct-91,
author = "J.-D. Boissonnat and O. Devillers and
F. P. Preparata",
title = "Computing the union of $3$-colored triangles",
journal = IJCGA,
volume = 1,
number = 2,
year = 1991,
pages = "187--196",
url = "http://www-sop.inria.fr/prisme/publis/bdp-cu3ct-91.ps.gz",
keywords = "convex hull, motion planning, legged robot",
abstract = "Given is a set $s$ of $n$ points, each colored with
one of $k \geq 3$ colours. We say that a triangle
defined by three points of $\cal s$ is 3-colored if
its vertices have distinct colours. We prove in this
paper that the problem of constructing the boundary
of the union $\cal ts$ of all such 3-colored
triangles can be done in optimal $O(n \log n)$
time."
}
@techreport{bdsty-arsol-90,
author = "J.-D. Boissonnat and O. Devillers and Ren{\'e}
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/RRRT/RR-1285"
}
@article{bdsty-arsol-92,
author = "J.-D. Boissonnat and O. Devillers and Ren{\'e}
Schott and M. Teillaud and M. Yvinec",
title = "Applications of random sampling to on-line
algorithms in computational geometry",
journal = DCG,
volume = 8,
year = 1992,
pages = "51--71",
url = "http://www-sop.inria.fr/prisme/publis/bdsty-arsol-92.ps.gz",
keywords = "randomized algorithms, Delaunay triangulation,
semi-dynamic algorithms, arrangement of
line-segments",
abstract = "This paper presents a general framework for the
design and randomized analysis of geometric
algorithms. These algorithms are on-line and the
framework provides general bounds for their expected
space and time complexities when averaging over all
permutations of the input data. The method is
general and can be applied to various geometric
problems. The power of the technique is illustrated
by new efficient on-line algorithms for constructing
convex hulls and Voronoi diagrams in any dimension,
Voronoi diagrams of line segments in the plane,
arrangements of curves in the plane and others."
}
@techreport{bdsty-olgag-90t,
author = "J.-D. Boissonnat and O. Devillers and Ren{\'e}
Schott and M. Teillaud and M. Yvinec",
title = "On-line geometric algorithms with good expected
behaviours",
type = "Technical Report",
number = "INRIA 1285",
month = aug,
year = 1990
}
@inproceedings{bdsty-olgag-91i,
author = "J.-D. Boissonnat and O. Devillers and Ren{\'e}
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"
}
@article{bdsty-olgag-91a,
author = "J.-D. Boissonnat and O. Devillers and Ren{\'e}
Schott and M. Teillaud and M. Yvinec",
title = "On-line geometric algorithms with good expected
behaviours",
journal = "IMACS",
volume = "??",
year = 1991
}
@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/RRRT/RR-1207",
keywords = "randomized algorithms, higher order Voronoi
diagrams, dynamic algorithms"
}
@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-sop.inria.fr/prisme/publis/bdt-schov-93.ps.gz",
keywords = "randomized algorithms, higher order Voronoi
diagrams, dynamic algorithms",
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 = CCCG_1990,
year = 1990,
pages = "278--281",
comments = "to appear in Algorithmica"
}
@inproceedings{bdty-tcgal-00,
author = "J.-D. Boissonnat and O. Devillers and M. Teillaud
and M. Yvinec",
title = "Triangulations in {CGAL}",
booktitle = SOCG_2000,
year = 2000,
pages = "11--18",
abstract = "This paper presents the main algorithmic and design
choices that have been made to implement
triangulations in the computational geometry
algorithms library CGAL."
}
@article{bd-olcue-96,
author = "J.-D. Boissonnat and Katrin Dobrindt",
title = "On-line construction of the upper envelope of
triangles and surface patches in three dimensions",
journal = CGTA,
volume = 5,
year = 1996,
pages = "303--320"
}
@techreport{bd-olrcu-93,
author = "J.-D. Boissonnat and Katrin Dobrindt",
title = "On-line randomized construction of the upper
envelope of triangles and surface patches in
{$R^{3}$}",
type = "Manuscript",
number = "Tech. Rep. 1878",
institution = "INRIA, Sophia-Antipolis, France",
year = 1993
}
@inproceedings{bd-rcuet-92,
author = "J.-D. Boissonnat and Katrin Dobrindt",
title = "Randomized construction of the upper envelope of
triangles in {$R^3$}",
booktitle = CCCG_1992,
year = 1992,
pages = "311--315"
}
@inproceedings{bdgm-gmpmr-95,
author = "J.-D. Boissonnat and Katrin Dobrindt and Bernhard
Geiger and Henri Michel",
title = "A Global Motion Planner for a Mobile Robot on a
Terrain",
booktitle = SOCG_1995,
year = 1995,
pages = "C20--C21",
keywords = "?"
}
@inproceedings{bf-t3do-81,
author = "J.-D. Boissonnat and O. D. Faugeras",
title = "Triangulation of $3$-d objects",
booktitle = "Proc. 7th Internat. Joint Conf. Artif. Intell.",
year = 1981,
pages = "658--660"
}
@techreport{bfl-rsddt-88t,
author = "J. D. Boissonnat and O. D. Faugeras and E. {Le
Bras-Mehlman}",
title = "Representing stereo data with the {Delaunay}
triangulation",
type = "Technical Report",
number = 788,
institution = "INRIA",
address = "Domaine de Voluceau Rocquencourt, BP 105, 78153 Le
Chesnay Cedex, France",
month = feb,
year = 1988
}
@inproceedings{bfl-rsddt-88i,
author = "J. D. Boissonnat and O. D. Faugeras and E. {Le
Bras-Mehlman}",
title = "Representing stereo data with the {Delaunay}
triangulation",
booktitle = "Proc. 5th IEEE Internat. Conf. Robot. Autom.",
year = 1988,
pages = "24--29"
}
@inproceedings{bf-lcss-02,
author = "J.-D. Boissonnat and Julia Fl{\"o}totto",
title = "A local coordinate system on a surface",
booktitle = "Proc. 7th ACM Symposium on Solid Modeling and
Applications",
year = 2002,
pages = "?"
}
@inproceedings{bg-3dsd-93,
author = "J.-D. Boissonnat and Bernhard Geiger",
title = "3D simulation of delivery",
editor = "G. M. Nielson and D. Bergeron",
booktitle = "Visualization 93",
publisher = "IEEE Computer Society Press",
address = "San Jose CA",
year = 1993,
pages = "416--419"
}
@techreport{bg-tdrcs-92,
author = "J.-D. Boissonnat and Bernhard Geiger",
title = "Three-dimensional reconstruction of complex shapes
based on the {Delaunay} triangulation",
type = "Report",
number = 1697,
institution = "INRIA Sophia-Antipolis",
address = "Valbonne, France",
month = apr,
year = 1992,
url = "http://www-sop.inria.fr/cgi-bin/wais_ra_sophia?question=1697",
keywords = "shape reconstruction, medical images, Delaunay
triangulation"
}
@inproceedings{bg-tdrcs-93,
author = "J.-D. Boissonnat and Bernhard Geiger",
title = "Three dimensional reconstruction of complex shapes
based on the {Delaunay} triangulation",
editor = "R. S. Acharya and D. B. Goldgof",
booktitle = "Biomedical Image Processing and Biomedical
Visualization",
volume = 1905,
publisher = "SPIE",
year = 1993,
pages = "964--975",
url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
}
@inproceedings{bk-udtil-85,
author = "J.-D. Boissonnat and P. Kofakis",
title = "Use of the {Delaunay} Triangulation for the
Identification and the Localization of Objects",
booktitle = "Proc. IEEE Internat. Conf. Comput. Vision
Pattern. Recogn.",
year = 1985,
pages = "398--401",
annote = "Uses skeleton of object foe rep. Computes
approximation of the skeleton by connecting centres
of adjacent triangles in DT."
}
@inproceedings{blt-mosal-97,
author = "J.-D. Boissonnat and Eelco de Lange and M. Teillaud",
title = "Minkowski operations for satellite antenna layout",
booktitle = SOCG_1997,
year = 1997,
pages = "67--76",
url = "http://www-sop.inria.fr/prisme/publis/blt-mosal-97.ps.gz"
}
@article{blt-smssa-98,
author = "J.-D. Boissonnat and Eelco de Lange and M. Teillaud",
title = "Slicing {Minkowski} Sums for Satellite Antenna
Layout",
journal = "Comput. Aided Design",
volume = 30,
number = 4,
year = 1998,
pages = "255--265",
note = "Special Issue on Computational Geometry and
Computer-Aided Design and Manufacturing"
}
@proceedings{bl-gr-89,
title = "Proc. of the Workshop on Geometry and Robotics",
editor = "J.-D. Boissonnat and J.-P. Laumond",
series = LNCS,
volume = 391,
publisher = "Springer-Verlag",
year = 1989
}
@inproceedings{bl-ptacs-96,
author = "J.-D. Boissonnat and S. Lazard",
title = "A Polynomial-Time Algorithm for Computing a Shortest
Path of Bounded Curvature Amidst Moderate Obstacles",
booktitle = SOCG_1996,
year = 1996,
pages = "242--251",
keywords = "Non-holonomic robot, motion planning, shortest
paths, mobile robot, computational geometry",
abstract = " In this paper, we consider the problem of computing
a shortest path of bounded curvature amidst
obstacles in the plane. More precisely, given
prescribed initial and final configurations
(i.e. positions and orientations) and a set of
obstacles in the plane, we want to compute a
shortest C1 path joining those two configurations,
avoiding the obstacles, and with the further
constraint that, on each C2 piece, the radius of
curvature is at least 1. In this paper, we consider
the case of moderate obstacles (as introduced by
Agarwal et al.) and present a polynomial-time exact
algorithm to solve this problem."
}
@inproceedings{bl-chbc-96,
author = "J.-D. Boissonnat and S. Lazard",
title = "Convex hulls of bounded curvature",
booktitle = CCCG_1996,
year = 1996,
pages = "14--19"
}
@techreport{bp-rpsis-97,
author = "J.-D. Boissonnat and F. P. Preparata",
title = "Robust Plane Sweep for Intersecting Segments",
type = "Research {Report}",
number = 3270,
institution = "INRIA",
address = "Sophia Antipolis",
month = sep,
year = 1997
}
@article{bp-rpsis-00,
author = "J.-D. Boissonnat and F. P. Preparata",
title = "Robust Plane Sweep for Intersecting Segments",
journal = SICOMP,
volume = 29,
number = 5,
year = 2000,
pages = "1401--1421"
}
@inproceedings{bsty-vdhdc-95,
author = "J.-D. Boissonnat and M. Sharir and Boaz Tagansky and
M. Yvinec",
title = "Voronoi Diagrams in Higher Dimensions under Certain
Polyhedral Distance Functions",
booktitle = SOCG_1995,
year = 1995,
pages = "79--88",
keywords = "?"
}
% also claimed, pages = "485--519"
@article{bsty-vdhdc-98,
author = "J.-D. Boissonnat and M. Sharir and Boaz Tagansky and
M. Yvinec",
title = "Voronoi Diagrams in Higher Dimensions under Certain
Polyhedral Distance Functions",
journal = DCG,
volume = 19,
number = 4,
year = 1998,
pages = "473--484"
}
% also claimed, title = "Line and curve segment intersection with restricted predicates"
@inproceedings{bs-ealcs-99,
author = "J.-D. Boissonnat and J. Snoeyink",
title = "Efficient Algorithms for Line and Curve Segment
Intersection Using Restricted Predicates",
booktitle = SOCG_1999,
year = 1999,
pages = "370--379"
}
@article{bs-ealcs-00,
author = "J.-D. Boissonnat and J. Snoeyink",
title = "Efficient Algorithms for Line and Curve Segment
Intersection Using Restricted Predicates",
journal = CGTA,
volume = 16,
number = 1,
year = 2000,
pages = "35--52",
annote = "Special Issue on the 1998 Workshop on Computational
Geometry"
}
@inproceedings{bt-hrodt-86,
author = "J.-D. Boissonnat and M. Teillaud",
title = "A hierarchical representation of objects: {The}
{Delaunay} tree",
booktitle = SOCG_1986,
year = 1986,
pages = "260--268"
}
@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"
}
@article{bt-rcdt-93,
author = "J.-D. Boissonnat and M. Teillaud",
title = "On the randomized construction of the {Delaunay}
tree",
journal = TCS,
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"
}
@techreport{bv-earic-99,
author = "J.-D. Boissonnat and Antoine Vigneron",
title = "Elementary Algorithms for Reporting Intersections of
Curve Segments",
type = "Rapport de recherche",
number = 3825,
institution = "INRIA",
year = 1999,
url = "http://www.inria.fr/RRRT/RR-3825",
abstract = "We propose several algorithms to report the $k$
intersecting pairs among a set of $n$ curve
segments. Apart from the intersection predicate, our
algorithms only use two simple predicates: the
predicate that compares the coordinates of two
points and the predicate that says if a point is
below, on, or above a segment. In particular, the
predicates we use do not allow to count the number
of intersection points nor to sort them, and the
time complexity of our algorithms depends on the
number of intersecting pairs, not on the number of
intersection points (differently from the other non
trivial algorithms). We present an algorithm for the
red-blue variant of the problem where we have a set
of blue segments and a set of red segments so that
no two segments of the same set intersect. The time
complexity is $O((n+k)\log n)$. This algorithm is
then used to solve the general case in
$O(n\sqrt{k}\log n)$ time. In the case of
pseudo-segments (i.e. segments that intersect in at
most one point) we propose a better algorithm whose
time com plexity is $O((k+n)\log n+ n\sqrt k)$. All
our time complexity results are a log factor from
optimal."
}
@article{bv-earic-02,
author = "J.-D. Boissonnat and Antoine Vigneron",
title = "Elementary Algorithms for Reporting Intersections of
Curve Segments",
journal = CGTA,
volume = 21,
year = 2002,
pages = "167--175"
}
@book{by-ag-98,
author = "J.-D. Boissonnat and M. Yvinec",
title = "Algorithmic Geometry",
publisher = "Cambridge University Press",
address = "UK",
year = 1998,
note = "Translated by H. Br{\"o}nnimann",
url = "http://www.cup.cam.ac.uk/Scripts/webbook.asp?isbn=0521563224",
annote = "translated from {\cite{by-ga-95}} by Herv{\'e}
Br{\"o}nnimann"
}
@book{by-ga-95,
author = "J.-D. Boissonnat and M. Yvinec",
title = "G{\'e}om{\'e}trie Algorithmique",
publisher = "Ediscience international",
address = "Paris",
year = 1995,
url = "http://www-sop.inria.fr/prisme/personnel/yvinec/livre.html"
}
@inproceedings{by-psncp-89,
author = "J.-D. Boissonnat and M. Yvinec",
title = "Probing a scene of non-convex polyhedra",
booktitle = SOCG_1989,
year = 1989,
pages = "237--246"
}
@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"
}
@article{b-fmapg-84,
author = "S. H. Bokhari",
title = "Finding maximum on an array processor with a global
bus",
journal = "IEEE Trans. Comput.",
volume = "C-33",
number = 2,
month = feb,
year = 1984,
pages = "133--139"
}
@article{b-grwsi-89,
author = "J. Bokowski",
title = "A geometric realization without self-intersections
does exist for {Dyck}'s regular map",
journal = DCG,
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"
}
@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"
}
@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 = DCG,
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 = DCG,
volume = 1,
year = 1986,
pages = "293--306"
}
@article{b-koejk-36,
author = "G. Bol",
title = "Zur kinematischen Ordnung ebener {Jorden}-Kurven",
journal = "Abh. Math. Sem. Univ. Hamburg",
volume = 11,
year = 1936,
pages = "394--408"
}
@mastersthesis{b-scs-92,
author = "R. Boland",
title = "Separating convex sets",
school = "Carleton Univ.",
address = "Ottawa, Ontario, Canada",
year = 1992,
keywords = "master thesis"
}
@unpublished{bu-scpes-,
author = "R. Boland and J. Urrutia",
title = "Separating collections of points in {Euclidean}
space",
note = "In preparation"
}
@inproceedings{bu-sfpes-92,
author = "R. P. Boland and J. Urrutia",
title = "Separating families of points in {Euclidean} spaces",
booktitle = CCCG_1992,
year = 1992,
pages = "6--10"
}
@book{b-c-86,
author = "B. Bollob{\'a}s",
title = "Combinatorics",
publisher = "Cambridge University Press",
year = 1986
}
@book{b-egt-78,
author = "B. Bollob{\'a}s",
title = "Extremal Graph Theory",
publisher = "Academic Press",
address = "New York",
year = 1978
}
@book{b-gtic-79,
author = "B. Bollob{\'a}s",
title = "Graph Theory; {An} Introductory Course",
publisher = "Springer-Verlag",
year = 1979
}
@book{b-rg-85,
author = "B. Bollob{\'a}s",
title = "Random Graphs",
publisher = "Academic Press",
address = "New York, NY",
year = 1985
}
@article{bb-gweto-87,
author = "B. Bollob{\'a}s and G. Brightwell",
title = "Graphs whose every transitive orientation contains
almost every relation",
journal = "Israel J. Math.",
volume = 59,
year = 1987,
pages = "112--128"
}
@inproceedings{bdgm-tsspw-97,
author = "B. Bollob{\'a}s and G. Das and D. Gunopulos and
H. Mannila",
title = "Time-Series Similarity Problems and Well-Separated
Geometric Sets",
booktitle = SOCG_1997,
year = 1997,
pages = "454--456"
}
@article{bm-tspkd-,
author = "B. Bollob{\'a}s and A. Meir",
title = "A traveling salesman problem in the $k$-dimensional
unit-cube",
journal = "Oper. Res. Lett.",
volume = "??",
year = "??",
note = "To appear"
}
@article{b-orasr-81,
author = "A. Bolour",
title = "Optimal retrieval algorithms for small region
queries",
journal = SICOMP,
volume = 10,
year = 1981,
pages = "721--741"
}
@article{b-opmkh-79,
author = "A. Bolour",
title = "Optimality properties of multiple-key hashing
functions",
journal = JACM,
volume = 26,
year = 1979,
pages = "196--210"
}
@book{bg-rpcg-85,
author = "V. Boltjansky and I. T. Gohberg",
title = "Results and Problems in Combinatorial Geometry",
publisher = "Cambridge University Press",
address = "New York, NY",
year = 1985
}
@article{b-lgc-74,
author = "E. Bombieri",
title = "Le grand crible",
journal = "Asterisque",
volume = 18,
year = 1974
}
@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"
}
@inproceedings{bl-oavdr-89,
author = "C. R. Bonapace and C. Lo",
title = "An {$O(n \log n)$} algorithm for {VLSI} design rule
checking",
booktitle = "Proc. 26th Design Autom. Conf.",
year = 1989,
pages = "503--507"
}
@book{bm-gta-76,
author = "J. A. Bondy and U. S. R. Murty",
title = "Graph Theory with Applications",
publisher = "Macmillan",
address = "London",
year = 1976,
isbn = "0-333-17791-6",
keywords = "graph drawing",
comments = "Also attributed to North-Holland, New York, NY"
}
@article{bp-adtaa-91,
author = "J. Bonet and J. Peraire",
title = "An alternating digital tree (ADT) algortihm for $3$D
geometric searching and intersection problems",
journal = "Internat. J. Numer. Methods Eng.",
volume = 31,
year = 1991,
pages = "1--17"
}
@book{bf-tdkk-34,
author = "T. Bonnesen and W. Fenchel",
title = "Theorie der konvexen {K{\"o}rper}",
publisher = "J. Springer",
address = "Berlin, Germany",
year = 1934,
note = "Reprinted Chelsea, New York, 1948"
}
% ### 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"
}
@inproceedings{bkr-dcbws-95,
author = "A. Bookstein and S. T. Klein and T. Raita",
title = "Detecting Content-Bearing Words by Serial
Clustering",
booktitle = "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research
and Develop. in Inform. Retrieval",
year = 1995,
pages = "319--327"
}
@book{b-mtld-91,
author = "F. L. Bookstein",
title = "Morphometric Tools for Landmark Data",
publisher = "Cambridge University Press",
address = "Cambridge",
year = 1991
}
@article{b-ls-79,
author = "F. L. Bookstein",
title = "The line skeleton",
journal = "Comput. Graph. Image Process.",
volume = 11,
number = 2,
month = oct,
year = 1979,
pages = "123--137",
keywords = "algorithm; computer graphics; computer programming
Subroutines; methodology, techniques, modeling,
representation, graphic, algorithmic aspects,
polygon"
}
@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
}
@book{b-pgs-78,
author = "C. de Boor",
title = "A practical guide to splines",
publisher = "Springer-Verlag",
address = "New York, NY",
year = 1978
}
@article{b-cbs-72,
author = "C. de Boor",
title = "On Calculating with {B}-Splines",
journal = "J. Approx. Theory",
volume = 6,
year = 1972,
pages = "50--62"
}
@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"
}
@article{b-affst-91,
author = "R. S. Booth",
title = "Analytic formulas for full {Steiner} trees",
journal = DCG,
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"
}
@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
}
@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"
}
@article{bm-afps-89,
author = "J. Boreddy and R. N. Mukherjee",
title = "An algorithm to find polygon similarity",
journal = IPL,
volume = 33,
number = 4,
year = 1989,
pages = "205--206",
note = "erratic",
keywords = "polygons, similarity"
}
@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
}
@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"
}
@phdthesis{b-tcosl-79,
author = "A. Borning",
title = "Thinglab: {A} constraint-oriented simulation
laboratory",
school = "Dept. Comput. Sci., Stanford Univ.",
address = "Stanford, CA",
month = jul,
year = 1979,
note = "Available as Technical Report STAN-CS-79-746",
keywords = "doctoral thesis"
}
@article{bh-rmspm-85,
author = "A. Borodin and J. E. Hopcroft",
title = "Routing, merging, and sorting on parallel models of
computation",
journal = "J. Comput. Syst. Sci.",
volume = 30,
number = 1,
year = 1985,
pages = "130--145"
}
@inproceedings{bor-lbhdn-99,
author = "A. Borodin and R. Ostrovsky and Y. Rabani",
title = "Lower Bounds for High Dimensional Nearest Neighbor
Search and Related Problems",
booktitle = STOC_1999,
year = 1999,
pages = "312--321"
}
@inproceedings{bor-saacp-99,
author = "A. Borodin and R. Ostrovsky and Y. Rabani",
title = "Subquadratic Approximation Algorithms For Clustering
Problems in High Dimensional Spaces",
booktitle = STOC_1999,
year = 1999,
pages = "435--444"
}
@article{bf-ntccn-84,
author = "E. Boros and Z. F{\"u}redi",
title = "The number of triangles covering the center of an
$n$-set",
journal = "Geom. Dedicata",
volume = 17,
year = 1984,
pages = "69--77"
}
@article{bfk-rsgd-89,
author = "E. Boros and Z. F{\"u}redi and L. M. Kelly",
title = "On representing {Sylvester}-{Gallai} designs",
journal = DCG,
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
}
@article{bh-cpcoe-89,
author = "E. Boros and P. L. Hammer",
title = "On clustering problems with connected optima in
{Euclidean} spaces",
journal = "Discrete Math.",
volume = 75,
year = 1989,
pages = "81--88"
}
@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"
}
@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"
}
@inproceedings{bm-pcg-95,
author = "Ali R. Boroujerdi and Bernard M. E. Moret",
title = "Persistence in Computational Geometry",
booktitle = CCCG_1995,
year = 1995,
pages = "241--246"
}
@article{brs-dot-92,
author = "J. Borowski and J. Richter-Gebert and W. Schindler",
title = "On the distribution of order types",
journal = CGTA,
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 = IJCGA,
volume = 1,
number = 4,
year = 1991,
pages = "427--453"
}
@article{b-dsudn-33,
author = "K. Borsuk",
title = "Drei {S{\"a}tze} {\"u}ber die $n$-dimensionale
euklidische {Sph{\"a}re}",
journal = "Fundam. Math.",
volume = 20,
year = 1933
}
@book{b-mag-69,
author = "K. Borsuk",
title = "Multidimensional Analytic Geometry",
publisher = "Polish Scientific Publishers",
address = "Warsaw, Poland",
year = 1969
}
@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"
}
@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"
}
@phdthesis{b-gcamp-95,
author = "P. Bose",
title = "Geometric and Computational Aspects of Manufacturing
Processes",
school = "Dept. Comput. Sci., Univ. British Columbia",
address = "Vancouver, BC",
year = 1995,
note = "UBC Tech. Rep 95-02",
keywords = "doctoral thesis"
}
@inproceedings{b-eopgp-97,
author = "Prosenjit Bose",
title = "On Embedding an Outer-Planar Graph in a Point Set",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "25--36",
keywords = "graph drawing"
}
@techreport{bbk-dcsp-93,
author = "P. Bose and D. Bremner and M. van Kreveld",
title = "Determining the Castability of Simple Polyhedra",
type = "Technical {Report}",
number = "SOCS 93.12",
institution = "School Comput. Sci., McGill Univ.",
address = "Montreal, PQ",
year = 1993
}
@inproceedings{bbk-dcsp-94,
author = "P. Bose and D. Bremner and M. van Kreveld",
title = "Determining the Castability of Simple Polyhedra",
booktitle = SOCG_1994,
year = 1994,
pages = "123--131"
}
@article{bbk-dcsp-97,
author = "P. Bose and D. Bremner and M. van Kreveld",
title = "Determining the Castability of Simple Polyhedra",
journal = "Algorithmica",
volume = 19,
number = "1--2",
month = sep,
year = 1997,
pages = "84--113"
}
@techreport{bbt-acpcb-,
author = "P. Bose and D. Bremner and G. Toussaint",
title = "All convex polyhedra can be clamped with parallel
jaw grippers",
institution = "School of Computer Science, McGill University",
note = "to appear"
}
@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 = CCCG_1994,
year = 1994,
pages = "344--349"
}
@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 = CGTA,
volume = 6,
year = 1996,
pages = "291--302"
}
@inproceedings{bckm-aptcc-00,
author = "P. Bose and J. Czyzowicz and E. Kranakis and
A. Maheshwari",
title = "Algorithms for packing two circles in a convex
polygon",
booktitle = "Proc. Japan Conf. Discrete Comput. Geom.",
series = LNCS,
volume = 1763,
publisher = "Springer-Verlag",
year = 2000,
pages = "93--103"
}
@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"
}
@techreport{bd-irgo-95,
author = "P. Bose and L. Devroye",
title = "Intersections with random geometric objects",
institution = "School of Computer Science, McGill University",
year = 1995,
note = "Manuscript"
}
@article{bd-irgo-98,
author = "Prosenjit Bose and Luc Devroye",
title = "Intersections with random geometric objects",
journal = CGTA,
volume = 10,
year = 1998,
pages = "139--154"
}
@techreport{bde-danmw-96t,
author = "P. Bose and L. Devroye and W. Evans",
title = "Diamonds are not a minimum weight triangulation's
best friend",
type = "Technical {Report}",
number = "96-01",
institution = "Dept. Comput. Sci., Univ. British Comumbia",
month = jan,
year = 1996
}
@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 = CCCG_1996,
year = 1996,
pages = "68--73"
}
@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 = LNCS,
volume = 894,
publisher = "Springer-Verlag",
year = 1995,
pages = "340--351",
keywords = "graph drawing, proximity, trees"
}
@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"
}
@inproceedings{bekms-aspal-96,
author = "P. Bose and W. Evans and D. Kirkpatrick and
M. McAllister and J . Snoeyink",
title = "Approximating shortest paths in arrangements of
lines",
booktitle = CCCG_1996,
publisher = "Carleton University Press, Ottawa, Canada",
year = 1996,
pages = "143--148",
annote = "2-approximation in $O(n\log n)$ time"
}
@incollection{beflmrsw-ovrg3d-94,
author = "P. Bose and H. Everett and S{\'a}ndor P. Fekete and
A. Lubiw and H. Meijer and K. Romanik and T. Shermer
and S. Whitesides",
title = "On a Visibility Representation for Graphs in Three
Dimensions",
editor = "D. Avis and P. Bose",
booktitle = "Snapshots in Computational and Discrete Geometry,
Volume III",
publisher = "McGill University",
month = jul,
year = 1994,
pages = "2--25",
note = "McGill technical report SOCS-94.50",
keywords = "graph drawing, visibility"
}
@article{behflmrrswz-vrg3d-98,
author = "P. Bose and H. Everett and Michael E. Houle and
S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer and
K. Romanik and G. Rote and T. Shermer and
S. Whitesides and Christian Zelle",
title = "A visibility representation for graphs in three
dimensions",
journal = "J. Graph Algorithms Appl.",
volume = 2,
number = 3,
year = 1998,
pages = "1--16",
keywords = "graph drawing, visibility",
abstract = "We propose a 3-dimensional visibility representation
of graphs in which vertices are mapped to horizontal
axis-parallel rectangles floating in 3-space, with
edges represented by vertical lines of sight. We
apply an extension of the {Erd\H os}-Szekeres
Theorem in a geometric setting to obtain an upper
bound of 56 for size of the largest complete graph
which is representable. On the other hand, we
construct a representation of the complete graph
with 22 vertices. These are the best existing
bounds."
}
@inproceedings{bew-pag-98,
author = "P. Bose and H. Everett and S. K. Wismath",
title = "Properties of Arragement Graphs",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "45--47"
}
@inproceedings{bgrt-dnpos-96,
author = "Prosenjit Bose and Francisco Gomez and Pedro Ramos
and G. T. Toussaint",
title = "Drawing nice projections of objects in space",
booktitle = "Graph Drawing (Proc. GD '95)",
series = LNCS,
volume = 1027,
publisher = "Springer-Verlag",
year = 1996,
pages = "52--63"
}
@inproceedings{bglosu-fp-93,
author = "P. Bose and L. J. Guibas and A. Lubiw and
M. H. Overmars and D. Souvaine and J. Urrutia",
title = "The floodlight problem",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "399--404"
}
@article{bglosu-fp-97,
author = "P. Bose and L. J. Guibas and A. Lubiw and
M. H. Overmars and D. Souvaine and J. Urrutia",
title = "The floodlight problem",
journal = IJCGA,
volume = 7,
year = 1997,
pages = "153--163"
}
@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 = ISAAC_1994,
nickname = "ISAAC '94",
site = "Beijing, China",
series = LNCS,
volume = 834,
publisher = "Springer-Verlag",
year = 1994,
pages = "??"
}
@article{bht-esdls-01,
author = "P. Bose and M. E. Houle and G. T. Toussaint",
title = "Every Set of Disjoint Line Segments Admits a Binary
Tree",
journal = DCG,
volume = 26,
year = 2001,
pages = "387--410"
}
@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 = CCCG_1995,
year = 1995,
pages = "73--78"
}
@article{bhot-oaa-93,
author = "P. Bose and F. Hurtado and E. Oman{\~n}a and
G. T. Toussaint",
title = "Optimizaci{\'o}n del {\`a}ngulo de apertura",
journal = "Actas del {IV} Encuentro Espan{\~n}ol de
Geometr{\'i}a Computacional",
volume = "??",
year = 1993
}
@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"
}
@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 = CCCG_1996,
year = 1996,
pages = "217--222"
}
@inproceedings{bkt-fpm-93,
author = "Prosenjit Bose and M. van~Kreveld and Godfried
Toussaint",
title = "Filling Polyhedral Molds",
booktitle = "Proc. 3rd Workshop Algorithms Data Struct.",
series = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "210--221"
}
@article{bkt-fpm-98,
author = "P. Bose and M. van Kreveld and G. Toussaint",
title = "Filling Polyhedral Molds",
journal = "Comput. Aided Design",
volume = 30,
number = 4,
month = apr,
year = 1998,
pages = "245--254"
}
@techreport{bll-cpt-93t,
author = "P. Bose and W. Lenhart and G. Liotta",
title = "Characterizing proximity trees",
type = "Technical Report",
number = "SOCS 93.9",
institution = "School of Computer Science, McGill University",
address = "Montr{\'e}al, Quebec",
year = 1993
}
@inproceedings{bll-cpt-93,
author = "P. Bose and W. Lenhart and G. Liotta",
title = "Characterizing proximity trees",
booktitle = "Graph Drawing (Proc. GD '93)",
year = 1993
}
@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"
}
@inproceedings{blm-evqsp-92,
author = "P. Bose and A. Lubiw and J. I. Munro",
title = "Efficient visibility queries in simple polygons",
booktitle = CCCG_1992,
year = 1992,
pages = "23--28"
}
@inproceedings{bmmm-gpp-01,
author = "Prosenjit Bose and Anil Maheshwari and Pat Morin and
Jason Morrison",
title = "The Grid Placement Problem",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "74--77"
}
@inproceedings{bm-ort-99,
author = "P. Bose and P. Morin",
title = "Online routing in triangulations",
booktitle = ISAAC_1999,
nickname = "ISAAC '99",
series = LNCS,
volume = 1741,
publisher = "Springer-Verlag",
year = 1999,
pages = "113--122"
}
@inproceedings{brtt-ecqas-96,
author = "Prosenjit Bose and Suneeta Ramaswami and Godfried
Toussaint and Alain Turki",
title = "Experimental Comparison of Quadrangulation
Algorithms for Sets of Points",
booktitle = "Abstracts 12th European Workshop Comput. Geom.",
nickname = "CG '96",
site = "M{\"u}nster",
publisher = "Universit{\"a}t M{\"u}nster",
year = 1996,
pages = "39--40"
}
@techreport{bstz-gpt-92,
author = "P. Bose and T. Shermer and G. Toussaint and B. Zhu",
title = "Guarding polyhedral terrains",
type = "Technical Report",
number = "SOCS-92.20",
institution = "McGill University",
year = 1992
}
@article{bstz-gpt-97,
author = "P. Bose and T. Shermer and G. Toussaint and B. Zhu",
title = "Guarding polyhedral terrains",
journal = CGTA,
volume = 7,
year = 1997,
pages = "173--185"
}
@article{bt-cecqp-97,
author = "Prosenjit Bose and Godfried Toussaint",
title = "Characterizing and Efficiently Computing
Quadrangulations of Planar Point Sets",
journal = "Comput. Aided Geom. Design",
volume = 14,
year = 1997,
pages = "763--785",
comments = "See also \cite{ahms-htfr-96}, where some similar
facts are shown."
}
@techreport{bt-gcaim-92,
author = "P. Bose and G. Toussaint",
title = "Geometric and computational aspects of injection
molding",
type = "Technical Report",
number = "SOCS 92.16",
institution = "School of Computer Science, McGill University",
address = "Canada",
year = 1992
}
@inproceedings{bt-gcaim-93,
author = "P. Bose and G. Toussaint",
title = "Geometric and computational aspects of injection
molding",
booktitle = "Proc. 3rd. Internat. Conf. CAD Comput. Graph.",
site = "Beijing, China",
year = 1993,
pages = "237--242"
}
@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"
}
@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",
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 = ISAAC_1995,
nickname = "ISAAC '95",
series = LNCS,
volume = 1004,
publisher = "Springer-Verlag",
year = 1995,
pages = "372--381"
}
@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"
}
@inproceedings{b-cahs-93,
author = "R. A. Botafogo",
title = "Cluster Analysis for Hypertext Systems",
booktitle = "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research
and Develop. in Inform. Retrieval",
year = 1993,
pages = "116--125",
keywords = "Aggregation, Clustering, Structural analysis,
Hypertext, Graph theory"
}
@book{bt-dfat-82,
author = "R. Bott and L. W. Tu",
title = "Differentiable forms in algebraic topology",
publisher = "Springer-Verlag",
address = "New York, NY",
year = 1982
}
@article{bv-lsedn-77,
author = "O. Bottema and G. R. Veldkamp",
title = "On the lines in space with equal distances to $n$
given points",
journal = "Geom. Dedicata",
volume = 6,
year = 1977,
pages = "121--129"
}
@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"
}
@techreport{bfhcp-gcs-93,
author = "W. Bouma and I. Fudos and C. Hoffmann and J. Cai and
R. Paige",
title = "A geometric constraint solver",
type = "Technical {Report}",
number = "CSD-TR-93-054",
institution = "Dept. Comput. Sci., Purdue Univ.",
address = "West Lafayette, IN",
year = 1993
}
@incollection{bv-vbcd-95,
author = "W. Bouma and G. {Van{\v e}{\v c}ek Jr.}",
title = "Velocity-based collision detection",
editor = "A. Paeth",
booktitle = "Graphics Gems V",
publisher = "Academic Press",
year = 1995
}
@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
}
@inbook{b-geadl-68,
author = "N. Bourbaki",
title = "Groupes et alg{\`e}bres de Lie",
chapter = "4, 5, 6",
publisher = "Hermann",
address = "Paris, France",
year = 1968
}
@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"
}
@article{bl-abmss-93,
author = "J. Bourgain and Joram Lindenstrauss",
title = "Approximating the ball by a {Minkowski} sum of
segments with equal length",
journal = DCG,
volume = 9,
year = 1993,
pages = "131--144"
}
% 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"
}
@article{bc-mgrfc-92,
author = "S. W. Bova and G. F. Carey",
title = "Mesh generation/refinement using fractal concepts
and iterated function systems",
journal = "Internat. J. Numer. Methods Eng.",
volume = 33,
year = 1992,
pages = "287--305"
}
@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
}
@article{bd-agisr-90,
author = "K. W. Bowyer and C. R. Dyer",
title = "Aspect graphs: {An} introduction and survey of
recent results",
journal = "Int. J. of Imaging Systems and Technology",
volume = 2,
year = 1990,
pages = "315--328"
}
@article{bm-pccma-89,
author = "L. Boxer and R. Miller",
title = "A parallel circle-cover minimization algorithm",
journal = IPL,
volume = 32,
number = 2,
year = 1989,
pages = "57--60",
keywords = "parallel computations, circles, covering,
optimization"
}
@article{bm-cip-90,
author = "L. Boxer and R. Miller",
title = "Common intersection of polygons",
journal = IPL,
volume = 33,
number = 5,
year = 1990,
pages = "249--254",
keywords = "convex polygons, intersection, parallel
computations"
}
@article{bm-ccipi-90,
author = "L. Boxer and R. Miller",
title = "Corrigenda ``{Common} intersections of polygons,
{Inf}.{Proc}.{Lett}. 33(1990) 249-254''",
journal = IPL,
volume = 35,
number = 1,
year = 1990,
pages = 53,
keywords = "convex polygons, intersection, parallel
computations"
}
@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"
}
@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"
}
@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
}
@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"
}
@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 = STOC_1982,
year = 1982,
pages = "282--289",
keywords = "polygons, maximum, dynamic programming"
}
@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 = SICOMP,
volume = 14,
year = 1985,
pages = "134--147",
keywords = "polygons, maximum, dynamic programming"
}
@article{b-ipfst-77,
author = "W. M. Boyce",
title = "An improved program for the full {Steiner} tree
problem",
journal = "ACM Trans. Math. Softw.",
volume = 3,
year = 1977,
pages = "359--385"
}
@techreport{bs-s72iv-73,
author = "W. M. Boyce and J. E. Seery",
title = "{STEINER} 72: {An} improved version of {Cockayne}
and {Schiller}'s program {STEINER} for the minimal
network problem",
type = "Report",
number = 35,
institution = "Comput. Sci. Center, Bell Lab.",
address = "Murray Hill, NJ",
year = 1973
}
@incollection{b-amm-90,
author = "D. B. Boyd",
title = "Aspects of molecular modeling",
editor = "K. Lipkowitz and D. B. Boyd",
booktitle = "Reviews in Computational Chemistry",
volume = 1,
publisher = "VCH Publishers",
year = 1990,
pages = "321--351"
}
@inproceedings{bp-ri-01,
author = "Edmond Boyer and Sylvain Petitjean",
title = "Regular Interpolants",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "125--128"
}
@article{bp-adiic-76,
author = "M. Boyer and L. Paquette",
title = "An algorithm to decide if the intersection of convex
polyhedral cones has a non empty interior",
journal = "BIT",
volume = 16,
year = 1976,
pages = "459--461"
}
@article{bs-iftmo-92,
author = "M. Boyer and N. F. Stewart",
title = "Imperfect-form tolerancing on manifold objects: a
metric approach",
journal = "Internat. J. Robot. Res.",
volume = 11,
number = 5,
year = 1992,
pages = "482--490"
}
@article{bs-msto-91,
author = "M. Boyer and N. F. Stewart",
title = "Modeling spaces for toleranced objects",
journal = "Internat. J. Robot. Res.",
volume = 10,
number = 5,
year = 1991,
pages = "570--582"
}
@book{b-hjfd-89,
title = "Handbook of Jig and Fixture Design",
editor = "W. Boyes",
edition = "2nd",
publisher = "Society of Manufacturing Engineers",
year = 1989
}
@article{b-idss-79,
author = "J. W. Boyse",
title = "Interference detection among solids and surfaces",
journal = "Commun. ACM",
volume = 22,
year = 1979,
pages = "3--9"
}
@article{bg-gimha-84,
author = "J. W. Boyse and J. E. Gilchrist",
title = "GMSOLID interactive modeling for hull algorithms",
journal = "BYTE",
volume = "??",
year = 1984,
pages = "2--13"
}
@unpublished{bkmt-nriqp-96,
author = "P. Bozanis and N. Ktsios and C. Makris and
A. Tsakalidis",
title = "New results on intersection query problems",
year = 1996,
note = "unpublished manuscript"
}
@inproceedings{bkmt-nubgi-95,
author = "P. Bozanis and N. Ktsios and C. Makris and
A. Tsakalidis",
title = "New upper bounds for generalized intersection
searching problems",
booktitle = "Proc. 22nd Inter. Colloq. Auto. Lang. and Program.",
series = LNCS,
volume = 944,
year = 1995,
pages = "464--475"
}
@inproceedings{bs-vasoq-00,
author = "Franti{\v s}ek Brabec and Hanan Samet",
title = "Visualizing and Animating Search Operations on
Quadtrees on the Worldwide Web",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "70--76"
}
@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
}
@article{bc-wenph-97,
author = "P. G. Bradford and V. Capoyleas",
title = "Weak $\epsilon$-nets for points on a hypersphere",
journal = DCG,
volume = 18,
year = 1997,
pages = "83--91"
}
@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
}
@article{bfs-meptm-97,
author = "P. G. Bradford and R. Fleischer and M. Smid",
title = "More efficient parallel totally monotone matrix
searching",
journal = JALG,
volume = 23,
year = 1997,
pages = "386--400"
}
@book{b-rmpc-82,
title = "Robot Motion: Planning and Control",
editor = "M. Brady",
publisher = "MIT Press",
address = "Cambridge, MA",
year = 1982
}
@incollection{bb-vrfls-84,
author = "M. L. Brady and D. J. Brown",
title = "VLSI Routing: {Four} Layers Suffice",
editor = "F. P. Preparata",
booktitle = "VLSI Theory",
series = "Adv. Comput. Res.",
volume = 2,
publisher = "JAI Press",
address = "Greenwich, Conn.",
year = 1984,
pages = "245--257"
}
@article{b-sctdm-22,
author = "H. R. Brahana",
title = "Systems of circuits on Two-dimensional manifolds",
journal = "Annals of Math.",
volume = 23,
year = 1922,
pages = "144--168"
}
@techreport{b-ngm-79,
author = "I. C. Braid",
title = "Notes on a geometric modeller",
type = "{CAD} {Group} {Document}",
number = 101,
institution = "Comput. Lab., Cambridge Univ.",
address = "Cambridge, England",
year = 1979
}
@article{b-ssbmf-75,
author = "I. C. Braid",
title = "The synthesis of solids bounded by many faces",
journal = "Commun. ACM",
volume = 18,
number = 4,
year = 1975,
pages = "209--216"
}
@incollection{bhs-swcpg-80,
author = "I. C. Braid and R. C. Hillyard and I. A. Stroud",
title = "Step-wise construction of polyhedra in geometric
modeling",
editor = "K. W. Brodlie",
booktitle = "Mathematical Methods in Computer Graphics and
Design",
publisher = "Academic Press",
address = "London, England",
year = 1980,
pages = "123--141",
keywords = "polyhedra, geometric modeling"
}
@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 = LNCS,
volume = 894,
publisher = "Springer-Verlag",
year = 1995,
pages = "416--427",
keywords = "graph drawing, grammar"
}
@inproceedings{b-gc1cc-97,
author = "F. J. Brandenburg",
title = "Graph Clustering {I}: Cycles of Cliques",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "158--168",
keywords = "graph drawing"
}
@proceedings{b-gd-96,
title = "Graph Drawing (Proc. GD '95)",
editor = "F. J. Brandenburg",
series = LNCS,
volume = 1027,
publisher = "Springer-Verlag",
year = 1996,
keywords = "graph drawing"
}
@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"
}
@inproceedings{bhr-ecfdr-96,
author = "Franz J. Brandenburg and M. Himsolt and Christoph
Rohrer",
title = "An Experimental Comparison of Force-Directed and
Randomized Graph Drawing Algorithms",
editor = "F. J. Brandenburg",
booktitle = "Graph Drawing (Proc. GD '95)",
series = LNCS,
volume = 1027,
publisher = "Springer-Verlag",
year = 1996,
pages = "76--87",
keywords = "graph drawing, experiments, straight-line"
}
@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
}
@inproceedings{bw-bpdgl-97,
author = "Ulrik Brandes and Dorothea Wagner",
title = "A Bayesian Paradigm for Dynamic Graph Layout",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "236--247",
keywords = "graph drawing"
}
@incollection{b-jnpbg-89,
author = "A. Brandstadt",
title = "The jump number problem for biconvex graphs and
rectangle covers of rectangular regions",
booktitle = "??",
series = LNCS,
volume = 380,
year = 1989,
pages = "68--77",
keywords = "isothetic, covering, rectangles"
}
@inproceedings{bcd-auhsm-95,
author = "A. Brandst{\"a}dt and V. D. Chepoi and F. F. Dragan",
title = "The algorithmic use of hypertree structure and
maximum neighbourhood orderings",
booktitle = "Proc. 20th Internat. Workshop
Graph-Theoret. Concepts Comput. Sci.",
series = LNCS,
volume = 903,
publisher = "Springer-Verlag",
year = 1995,
pages = "65--80"
}
@article{b-cccda-94,
author = "J. W. Brandt",
title = "Convergence and continuity criteria for discrete
approximations of the continuous planar skeletons",
journal = "CVGIP: Image Understanding",
volume = 59,
number = 1,
year = 1994,
pages = "116--124"
}
@inproceedings{ba-cscsd-91,
author = "Jonathan W. Brandt and V. Ralph Algazi",
title = "Computing a Stable, Connected Skeleton From Discrete
Data",
booktitle = "Proceedings of the 1991 IEEE Computer Society
Conference on Computer Vision and Pattern
Recognition",
publisher = "IEEE",
address = "IEEE Service Center, Piscataway, NJ, USA (IEEE cat n
91CH2983-5)",
year = 1991,
pages = "666--667",
keywords = "Voronoi diagram",
abstract = "The relationship between the skeleton and the
Voronoi diagram for the case of morphologically
regular sets is described. Using the discrete-point
Voronoi diagram, a practical algorithm is developed
to compute an approximate skeleton of a continuous
shape from sampled data. The analysis also yields a
sampling criterion under which the approximation is
stable. The algorithm is applied to a simple test
image. 4 Refs."
}
@article{ba-cscvd-92,
author = "J. W. Brandt and V. R. Algazi",
title = "Continuous Skeleton Computation by {Voronoi}
Diagram",
journal = "CVGIP: Image Understanding",
volume = 55,
number = 3,
year = 1992,
pages = "329--338"
}
@inproceedings{b-albhp-01,
author = "Peter Bra{\ss}",
title = "Another Lower Bound for {Hopcroft's} Problem",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "70--73"
}
@article{b-edpns-96,
author = "P. Brass",
title = "Erd{\H o}s distance problems in normed spaces",
journal = CGTA,
volume = 6,
year = 1996,
pages = "195--214"
}
@inproceedings{b-aps-00,
author = "Peter Brass",
title = "On the Approximation of Polygons by Subpolygons",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "59--61"
}
@inproceedings{bk-tcddp-00a,
author = "Peter Bra{\ss} and Christian Knauer",
title = "Testing the Congruence of $d$-Dimensional Point
Sets",
booktitle = SOCG_2000,
year = 2000,
pages = "310--314"
}
@inproceedings{bk-tcddp-00e,
author = "Peter Bra{\ss} and Christian Knauer",
title = "Testing the Congruence of {$d$}-Dimensional Point
Sets",
booktitle = "Abstracts 16th European Workshop Comput. Geom.",
nickname = "CG 2000",
site = "Eilat",
publisher = "Ben-Gurion University of the Negev",
year = 2000,
pages = "104--107"
}
@book{bb-atp-88,
author = "G. Brassard and P. Bratley",
title = "Algorithmics: Theory and Practice",
publisher = "Prentice Hall",
address = "Enlewood Cliffs, NJ",
year = 1988
}
@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 = SIGGRAPH_1979
}
@article{br-pgtp-79,
author = "K. E. Brassel and D. Reif",
title = "A procedure to generate {Thiessen} polygons",
journal = "Geogr. Anal.",
volume = 11,
year = 1979,
pages = "289--303"
}
@article{bw-arfam-88,
author = "K. E. Brassel and R. Weibel",
title = "A review and framework of automated map
generalization",
journal = "Intl. J. Geographic. Info. Systems",
volume = 2,
number = 3,
year = 1988,
pages = "229--244"
}
@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",
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"
}
@article{b-cvdks-82,
author = "M. Breen",
title = "Clear visibility and the dimension of kernels of
starshaped sets",
journal = "Proc. Amer. Math. Soc.",
volume = 85,
year = 1982,
pages = "414--418"
}
@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"
}
@article{bk-gdtmc-76,
author = "M. Breen and D. C. Kay",
title = "General decomposition theorems for $m$-convex sets
in the plane",
journal = "Israel J. Math.",
volume = 24,
year = 1976,
pages = "217--233"
}
@article{bk-sapsr-82,
author = "U. Brehm and W. K{\"u}hnel",
title = "Smooth approximation of polyhedral surfaces
regarding curvatures",
journal = "Geom. Dedicata",
volume = 12,
year = 1982,
pages = "435--461"
}
@incollection{bs-pm-97,
author = "U. Brehm and E. Schulte",
title = "Polyhedral maps",
chapter = 18,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "345--360"
}
@incollection{bw-pm-93,
author = "U. Brehm and J. M. Wills",
title = "Polyhedral Manifolds",
editor = "P. M. Gruber and J. M. Wills",
booktitle = "Handbook of Convex Geometry",
publisher = "North-Holland",
year = 1993
}
@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
}
@techreport{bs-parpv-92,
author = "David Bremmer and Thomas Shermer",
title = "Properties and applications of
restricted-orientation point visibility graphs",
type = "manuscript",
institution = "School of Computing Science, Simon Fraser
University",
year = 1992
}
@inproceedings{b-l2cof-94,
author = "D. Bremner",
title = "Link-$2$-Convex One-Fillable Polygons are
Starshaped",
booktitle = CCCG_1994,
year = 1994,
pages = "363--368"
}
@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"
}
@inproceedings{bfm-pdmvf-97,
author = "D. Bremner and K. Fukuda and M. Marzetta",
title = "Primal-Dual Methods for Vertex and Facet
Enumeration",
booktitle = SOCG_1997,
year = 1997,
pages = "49--56"
}
@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"
}
@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
}
@phdthesis{b-afzef-71,
author = "R. Brent",
title = "Algorithms for finding zeros and extrema of
functions without calculating derivatives",
school = "Stanford University",
address = "Stanford, CA",
year = 1971,
keywords = "doctoral thesis"
}
@article{b-fmpee-76,
author = "R. P. Brent",
title = "Fast multiple-precision evaluation of elementary
functions",
journal = JACM,
volume = 23,
year = 1976,
pages = "242--251"
}
@article{b-pegae-74,
author = "R. P. Brent",
title = "The Parallel Evaluation of General Arithmetic
Expressions",
journal = JACM,
volume = 21,
number = 2,
year = 1974,
pages = "201--206"
}
@article{bk-abtl-80,
author = "R. P. Brent and H. T. Kung",
title = "On the area of binary tree layouts",
journal = IPL,
volume = 11,
year = 1980,
pages = "521--534",
keywords = "graph drawing"
}
@article{b-laidd-77,
author = "J. E. Bresenham",
title = "A linear algorithm for incremental digital display
of circular arcs",
journal = "Commun. ACM",
volume = 20,
year = 1977,
pages = "100--106"
}
@article{b-accdp-65,
author = "J. E. Bresenham",
title = "Algorithm for computer control of digital plotter",
journal = "IBM Syst. J.",
volume = 4,
year = 1965,
pages = "25--30"
}
@incollection{b-ailr-88,
author = "J. E. Bresenham",
title = "Ambiguities in incremental line rastering",
editor = "R. A. Earnshaw",
booktitle = "Theoretical Foundations of Computer Graphics and
CAD",
series = "NATO ASI Series~F",
volume = 40,
publisher = "Springer-Verlag",
address = "Berlin, West Germany",
year = 1988,
pages = "329--358"
}
@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"
}
@article{bk-udgrn-98,
author = "H. Breu and D. G. Kirkpatrick",
title = "Unit Disk Graph Recognition is {NP}-hard",
journal = CGTA,
volume = 9,
number = "1--2",
year = 1998,
pages = "3--24",
note = "(special issue on Geometric Representations of
Graphs, edited by G. {Di Battista} and R. Tamassia)",
keywords = "graph drawing, proximity, NP-hardness"
}
@inproceedings{bbdltv-trodo-99,
author = "Stina Bridgeman and Giuseppe Di Battista and Walter
Didimo and Guiseppe Liotta and Roberto Tamassia and
Luca Vismara",
title = "Turn-Regularity and Optimal Drawings of Orthogonal
Representations",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "161--164"
}
@inproceedings{bddltv-ocor-98,
author = "Stina Bridgeman and Giuseppe {Di Battista} and
Walter Didimo and Giuseppe Liotta and Roberto
Tamassia and Luca Vismara",
title = "Optimal Compaction of Orthogonal Representations",
booktitle = "CGC Workshop on Geometric Computing",
year = 1998,
url = "http://www.cs.brown.edu/cgc/cgc98/",
keywords = "graph drawing, planar, orthogonal"
}
@article{bgt-gdtsw-99,
author = "Stina Bridgeman and Ashim Garg and Roberto Tamassia",
title = "A Graph Drawing and Translation Service on the
{World Wide Web}",
journal = IJCGA,
volume = 9,
number = "4--5",
year = 1999,
pages = "419--446",
keywords = "graph drawing, system"
}
@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 = LNCS,
volume = 1190,
publisher = "Springer-Verlag",
year = 1997,
pages = "45--52",
url = "http://www.cs.brown.edu/cgc/papers/bgt-gdtsw-97.ps.gz",
keywords = "graph drawing, system, WWW, orthogonal,
planarization, CGC, Brown"
}
@inproceedings{bt-dmiog-98,
author = "S. Bridgeman and R. Tamassia",
title = "Difference Metrics for Interactive Orthogonal Graph
Drawing Algorithms",
booktitle = "Proc. Graph Drawing '98",
publisher = "Springer-Verlag",
note = "to appear",
keywords = "graph drawing, interactive, dynamic, system"
}
@article{bddltv-troad-00,
author = "S. S. Bridgeman and G. {Di Battista} and W. Didimo
and G. Liotta and R. Tamassia and L. Vismara",
title = "Turn-Regularity and Optimal Area Drawings of
Orthogonal Representations",
journal = CGTA,
volume = 16,
number = 1,
year = 2000,
pages = "53--93",
annote = "Special Issue on the 1998 Workshop on Computational
Geometry"
}
@inproceedings{bddltv-trpod-99,
author = "S. S. Bridgeman and G. {Di Battista} and W. Didimo
and G. Liotta and R. Tamassia and L. Vismara",
title = "Turn-Regularity and Planar Orthogonal Drawings",
editor = "J. Kratochv{\'\i}l",
booktitle = "Graph Drawing",
nickname = "GD '99",
series = LNCS,
volume = 1731,
publisher = "Springer-Verlag",
year = 1999,
pages = "8--26"
}
@inproceedings{bfgtv-iaiog-97,
author = "Stina S. Bridgeman and Jody Fanto and Ashim Garg and
Roberto Tamassia and Luca Vismara",
title = "{InteractiveGiotto}: An Algorithm for Interactive
Orthogonal Graph Drawing",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "303--308",
keywords = "graph drawing"
}
@inproceedings{b-eaosp-89,
author = "A. J. Briggs",
title = "An efficient algorithm for one-step planar compliant
motion planning with uncertainty",
booktitle = SOCG_1989,
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"
}
@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
}
@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"
}
@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"
}
@article{bt-odpm-97,
author = "Graham R. Brightwell and William T. Trotter",
title = "The Order Dimension of Planar Maps",
journal = "SIAM J. Discrete Math.",
volume = 10,
number = 4,
year = 1997,
pages = "515--528"
}
@inproceedings{bk-igcsd-94,
author = "T. Brinkhoff and H.-P. Kriegel",
title = "The Impact of Global Clusterings on Spatial Database
Systems",
booktitle = "Proceedings of the International Conference on Very
Large Databases",
publisher = "Morgan Kauffman",
month = sep,
year = 1994,
pages = "168--179"
}
@inproceedings{bks-epsju-93,
author = "T. Brinkhoff and H.-P. Kriegel and B. Seeger",
title = "Efficient Processing of Spatial Joins Using
{R}-Trees",
booktitle = SIGMOD,
year = 1993,
pages = "237--246"
}
@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 = CCCG_1994,
year = 1994,
pages = "63--68"
}
@article{b-pedlp-88,
author = "M. Brion",
title = "Points entires dans les poly{\`e}dres convexes",
journal = "Annales Sci. {\'E}c. Norm. Sup., Ser IV",
volume = 21,
number = 4,
year = 1988,
pages = "653--663"
}
@techreport{b-rgsdt-88,
author = "E. Brisson",
title = "Representing geometric structures in $d$ dimensions:
Topology and order",
number = "88-11-07",
institution = "Dept. of Computer Science, Univ. of Washington",
year = 1988
}
@inproceedings{b-rgsdd-89,
author = "E. Brisson",
title = "Representing geometric structures in $d$ dimensions:
Topology and order",
booktitle = SOCG_1989,
year = 1989,
pages = "218--227"
}
@article{b-rgsdd-93,
author = "E. Brisson",
title = "Representing Geometric Structures in $d$ Dimensions:
Topology and Order",
journal = DCG,
volume = 9,
year = 1993,
pages = "387--426"
}
@techreport{b-edrhu-87,
author = "D. Broch",
title = "Enhancing the dexterity of a robot hand using
controlled slip",
type = "Technical {Report}",
number = "MIT AI-TR-992",
institution = "Artif. Intell. Lab., Massachusetts Inst. Tech.",
address = "Cambridge, MA",
year = 1987
}
@incollection{b-flerg-87,
author = "J. Brock",
title = "Finding the largest empty rectangle on a grated
surface",
booktitle = "??",
series = LNCS,
volume = 247,
year = 1987,
pages = "66--75",
keywords = "isothetic, empty rectangle"
}
@inproceedings{bl-piss-99,
author = "Christoph Br{\"o}cker and Alejandro L{\'o}pez-Ortiz",
title = "Position-Independent Street Searching",
booktitle = WADS_1999,
nickname = "WADS '99",
site = "Vancouver, Canada",
series = LNCS,
volume = 1663,
publisher = "Springer-Verlag",
year = 1999,
pages = "241--252"
}
@inproceedings{bs-srsc-99,
author = "Christoph Br{\"o}cker and Sven Schuierer",
title = "Searching Rectilinear Streets Completely",
booktitle = WADS_1999,
nickname = "WADS '99",
site = "Vancouver, Canada",
series = LNCS,
volume = 1663,
publisher = "Springer-Verlag",
year = 1999,
pages = "98--109"
}
@incollection{bj-dpcho-00,
author = "Gerth St{\o}lting Brodal and Riko Jacob",
title = "Dynamic Planar Convex Hull with Optimal Query Time
and $O(\log n\cdot\log\log n)$ Update Time",
booktitle = SWAT_2000,
series = LNCS,
volume = 1851,
publisher = "Springer-Verlag",
year = 2000,
pages = "57--70"
}
@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"
}
@inproceedings{bpg-cfpa-93,
author = "M. Brokowski and M. A. Peskin and K. Goldberg",
title = "Curved fences for part alignment",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
site = "Atlanta, GA",
volume = 3,
year = 1993,
pages = "467--473"
}
@article{bk-facus-73,
author = "C. Bron and J. Kerbosch",
title = "Finding all cliques of an undirected subgraph",
journal = "Commun. ACM",
volume = 16,
year = 1973,
pages = "575--577"
}
@proceedings{b-ewcg-99,
title = "Abstracts 15th European Workshop Comput. Geom.",
editor = "H. Br{\"o}nnimann",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
isbn = "2-7261-1139-4"
}
@inproceedings{b-aops-94,
author = "H. Br{\"o}nnimann",
title = "Almost Optimal Polyhedral Separators",
booktitle = SOCG_1994,
year = 1994,
pages = "393--394",
keywords = "video review"
}
@techreport{b-imhsh-94,
author = "H. Br{\"o}nnimann",
title = "An implementation of {MIN} {HITTING} {SET}
heuristics",
type = "Manuscript",
institution = "??",
year = 1994
}
@inproceedings{b-dchol-98,
author = "H. Br{\"o}nnimann",
title = "Degenerate convex hulls on-line in any fixed
dimension",
booktitle = SOCG_1998,
year = 1998,
pages = "249--258"
}
@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"
}
@inproceedings{bbp-iayea-98cg,
author = "H. Br{\"o}nnimann and Christoph Burnikel and
S. Pion",
title = "Interval Arithmetic Yields Efficient Arithmetic
Filters for Computational Geometry",
booktitle = "Abstracts 14th European Workshop Comput. Geom.",
nickname = "CG '98",
site = "Barcelona",
publisher = "Universitat Polyt{\`e}nica de Catalunya, Barcelona",
year = 1998,
pages = "49--54"
}
@inproceedings{bbp-iayed-98scg,
author = "H. Br{\"o}nnimann and Christoph Burnikel and
S. Pion",
title = "Interval Arithmetic Yields Efficient Dynamic Filters
for Computational Geometry",
booktitle = SOCG_1998,
year = 1998,
pages = "165--174"
}
@inproceedings{bc-hhihr-92,
author = "H. Br{\"o}nnimann and B. Chazelle",
title = "How hard is halfspace range searching?",
booktitle = SOCG_1992,
year = 1992,
pages = "271--275"
}
@inproceedings{bc-ossc-94,
author = "H. Br{\"o}nnimann and B. Chazelle",
title = "Optimal Slope Selection Via Cuttings",
booktitle = CCCG_1994,
year = 1994,
pages = "99--103"
}
@article{bc-ossc-98,
author = "H. Br{\"o}nnimann and B. Chazelle",
title = "Optimal Slope Selection Via Cuttings",
journal = CGTA,
volume = 10,
number = 1,
year = 1998,
pages = "23--29"
}
@inproceedings{bcm-prsss-93,
author = "H. Br{\"o}nnimann and B. Chazelle and Ji{\v r}{\'\i}
Matou{\v s}ek",
title = "Product Range Spaces, Sensitive Sampling, and
Derandomization",
booktitle = FOCS_1993,
year = 1993,
pages = "400--409",
keywords = "approximations, epsilon-nets, derandomization,
diameter computation, method of conditional
probabilities, parametric search"
}
@article{bcm-prsss-99,
author = "H. Br{\"o}nnimann and B. Chazelle and J. Matou{\v
s}ek",
title = "Product Range Spaces, Sensitive Sampling, and
Derandomization",
journal = SICOMP,
volume = 28,
year = 1999,
pages = "1552--1575"
}
@article{bcp-hhihr-93,
author = "H. Br{\"o}nnimann and B. Chazelle and J. Pach",
title = "How hard is halfspace range searching",
journal = DCG,
volume = 10,
year = 1993,
pages = "143--155"
}
@techreport{bd-uubhq-99,
author = "H. Br{\"o}nnimann and O. Devillers",
title = "The union of unit balls has quadratic complexity,
even if they all contain the origin",
type = "Rapport de recherche",
number = 3758,
institution = "INRIA",
year = 1999,
url = "http://www.inria.fr/RRRT/RR-3758",
archive = "XXX:cs.CG/9907025",
abstract = "We provide a lower bound construction showing that
the union of unit balls in $R^3$ has quadratic
complexity, even if they all contain the
origin. This settles a conjecture of Sharir."
}
@inproceedings{bepp-cegpu-97,
author = "H. Br{\"o}nnimann and I. Emiris and V. Pan and
S. Pion",
title = "Computing exact geometric predicates using modular
arithmetic with single precision",
booktitle = SOCG_1997,
year = 1997,
pages = "174--182"
}
@article{bepp-sdrns-99,
author = "H. Br{\"o}nnimann and I. Emiris and V. Pan and
S. Pion",
title = "Sign Determination in {R}esidue {N}umber {S}ystems",
journal = TCS,
volume = 210,
number = 1,
year = 1999,
pages = "173--197",
note = "Special Issue on Real Numbers and Computers",
url = "http://www-sop.inria.fr/prisme/personnel/pion/publis/TCS.ps.gz"
}
@inproceedings{bg-aoscf-94,
author = "H. Br{\"o}nnimann and M. T. Goodrich",
title = "Almost Optimal Set Covers in Finite {VC}-Dimension",
booktitle = SOCG_1994,
year = 1994,
pages = "293--302"
}
@article{bg-aoscf-95,
author = "H. Br{\"o}nnimann and M. T. Goodrich",
title = "Almost Optimal Set Covers in Finite {VC}-Dimension",
journal = DCG,
volume = 14,
year = 1995,
pages = "263--279"
}
@misc{bikmm-oipcha-01,
author = "H. Br{\"o}nnimann and John Iacono and Jryki
Katajainen and Pat Morin and Jason Morrison",
title = "Optimal In-Place Planar Convex Hull Algorithms",
howpublished = "11th Annual Fall Workshop on Computational Geometry",
year = 2001,
note = "\url{http://geometry.poly.edu/cgwpapers/}",
url = "http://geometry.poly.edu/cgwpapers/hbr\_inplace.ps"
}
@inproceedings{bp-ergc-97,
author = "H. Br{\"o}nnimann and S. Pion",
title = "Exact rounding for geometric constructions",
booktitle = "GAMM/IMACS International Symposium on Scientific
Computing, Computer Arithmetic and Validated
Numerics",
year = 1997,
pages = "?",
url = "http://www-sop.inria.fr/prisme/publis/bp-ergc-97.ps.gz"
}
@techreport{by-cacas-96,
author = "H. Br{\"o}nnimann and M. Yvinec",
title = "A complete analysis of {Clarkson}'s algorithm for
safe determinant evaluation",
type = "Research {Report}",
number = 3051,
institution = "INRIA",
year = 1996,
url = "http://www.inria.fr/rapports/sophia/RR-3051.html",
abstract = "In this paper, we give a complete and self-contained
analysis of Clarkson's algorithm that performs safe
and efficient determinant evaluation of an $n\times
n$ matrix with integer coefficients that can be
expressed with $b$ bits. Clarkson's original paper
is generally felt difficult to read. We complete the
gaps in his exposition, simplifying the analysis
where we can. The number of extra bits needed by
this analysis is roughly equivalent to the number of
bits needed by Clarkson's analysis. We show that the
algorithm performs sign evaluation correctly if
$b+O(n)$ bits are available. We give a table of the
maximum numbers $b$ of bits available for the
entries as a function of $n$, when the arithmetic is
performed using a floating point processor complying
with the IEEE 754 standard for double precision
arithmetic (with $53$ bits available for the
mantissa). We also gain some insight into the
practical behavior of the algorithm by
experimenting. In particular, we provide
experimental evidence that the algorithm evaluates
correctly the sign of determinants of order up to 15
with $48$-bit coefficients."
}
@inproceedings{by-eeesd-97i,
author = "H. Br{\"o}nnimann and M. Yvinec",
title = "Efficient exact evaluation of signs of determinants",
booktitle = SOCG_1997,
year = 1997,
pages = "166--173"
}
@article{by-eeesd-00,
author = "H. Br{\"o}nnimann and M. Yvinec",
title = "Efficient Exact Evaluation of Signs of Determinants",
journal = "Algorithmica",
volume = 27,
year = 2000,
pages = "21--56",
keywords = "determinant, robustness, Clarkson, safe, lattice,
exact arithmetic, precision"
}
@techreport{by-eeesd-97t,
author = "Herv{\'e}. Br{\"o}nnimann and M. Yvinec",
title = "Efficient Exact Evaluation of Signs of Determinants",
type = "Research {Report}",
number = 3140,
institution = "INRIA",
year = 1997,
url = "http://www.inria.fr/rapports/sophia/RR-3140.html",
abstract = "This paper presents a theoretical and experimental
study on two different methods to evaluate the sign
of a determinant with integer entries. The first one
is a method based on the Gram-Schmidt
orthogonalisation process which has been proposed by
Clarkson. We review the analysis of Clarkson and
propose a variant of his method. The second method
is an extension to $n \times n$ determinants of the
ABDPY method which works only for $2 \times 2$ and
$3 \times 3$ determinants. Both methods compute the
signs of a $n \times n$ determinant whose entries
are integers on $b$ bits, by using an exact
arithmetic on only $b +O(n)$ bits. Furthermore, both
methods are adaptive, dealing quickly with easy
cases and resorting to the full-length computation
only for null determinants."
}
@book{b-icp-83,
author = "A. Br{\"o}nsted",
title = "An Introduction to Convex Polytopes",
publisher = "Springer-Verlag",
address = "New York, NY",
year = 1983
}
@book{bsmm-tdm-93,
author = "I. N. Bronstein and K. A. Semendjajew and G. Musiol
and H. M{\"u}hlig",
title = "Taschenbuch der Mathematik",
publisher = "Harri Deutsch",
address = "Frankfurt am Main",
year = 1993
}
@inproceedings{bl-sacsf-83,
author = "R. Brooks and T. Lozano-P{\'e}rez",
title = "A subdivision algorithm in configuration space for
findpath with rotation",
booktitle = "Proc. 8th Internat. Joint Conf. Artif. Intell.",
site = "Karlsruhe, West Germany",
month = aug,
year = 1983
}
@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"
}
@article{b-sfppg-83,
author = "R. A. Brooks",
title = "Solving the Find-Path Problem by Good Representation
of Free Space",
journal = "IEEE Trans. Syst. Man Cybern.",
volume = 13,
number = 3,
year = 1983,
pages = "190--197"
}
@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
}
@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"
}
@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"
}
@inproceedings{b-agppu-86,
author = "R. Brost",
title = "Automatic grasp planning in the presence of
uncertainty",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
site = "San Francisco, CA",
month = apr,
year = 1986
}
@inproceedings{bg-casmf-94,
author = "R. C. Brost and K. Y. Goldberg",
title = "A complete algorithm for synthesizing modular
fixtures for polygonal parts",
booktitle = "Proc. 11th IEEE Internat. Conf. Robot. Autom.",
month = may,
year = 1994
}
@inproceedings{bm-gaprb-89,
author = "R. C. Brost and M. T. Mason",
title = "Graphical Analysis of Planar Rigid Body Dynamics
with Multiple Frictional Contacts",
booktitle = "Proc. 5th Intl. Symp. on Robotics Research",
year = 1989,
pages = "367--374"
}
@article{bdf-cvp-78,
author = "W. Brostow and J. P. Dussault and B. L. Fox",
title = "Construction of {Voronoi} polyhedra",
journal = "J. Comput. Phys.",
volume = 29,
year = 1978,
pages = "81--92"
}
@article{b-fodm-84,
author = "P. Brou",
title = "Finding Objects in Depth Maps",
journal = "Internat. J. Robot. Res.",
volume = "??",
year = 1984
}
@article{b-mp-66,
author = "U. A. Brousseau",
title = "A mathematician's progress",
journal = "Math. Teacher",
volume = 59,
year = 1966,
pages = "722--727"
}
@book{bcn-drg-89,
author = "A. E. Brouwer and A. M. Cohen and A. Neumaier",
title = "Distance-regular graphs",
publisher = "Springer-Verlag",
year = 1989
}
@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"
}
@article{b-scaps-97,
author = "J. L. Brown",
title = "Systems of coordinates associated with points
scattered in the plane",
journal = "Comput. Aided Design",
volume = 14,
year = 1997,
pages = "547--559"
}
@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"
}
@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."
}
@article{b-vdch-79,
author = "K. Q. Brown",
title = "Voronoi diagrams from convex hulls",
journal = IPL,
volume = 9,
number = 5,
year = 1979,
pages = "223--228"
}
@article{b-lfitm-62,
author = "M. Brown",
title = "Locally flat imbeddings of topological manifolds",
journal = "Ann. Math.",
volume = 75,
year = 1962,
pages = "331--341"
}
@book{b-aa-87,
author = "M. H. Brown",
title = "Algorithm Animation",
series = "ACM Distinguished Dissertations Series",
publisher = "MIT Press",
address = "Cambridge, MA",
year = 1987
}
@article{b-eaub-88,
author = "M. H. Brown",
title = "Exploring algorithms using Balsa-{II}",
journal = "Computer",
volume = 21,
number = 5,
month = may,
year = 1988,
pages = "14--36"
}
@inproceedings{b-1saf-93,
author = "M. H. Brown",
title = "The $1992$ {SRC} animation festival",
booktitle = "Proc. IEEE Sympos. on Visual Languages",
month = aug,
year = 1993,
pages = "116--123"
}
@techreport{b-zsaam-92,
author = "M. H. Brown",
title = "Zeus: {A} system for algorithm animation and
multi-view editing",
type = "Technical {Report}",
number = 75,
institution = "Digital Systems Research Center",
address = "Palo Alto, CA",
month = feb,
year = 1992
}
@article{b-zsaam-92a,
author = "M. H. Brown",
title = "Zeus: {A} system for algorithm animation and
multi-view editing",
journal = "Comput. Graph.",
volume = 18,
number = 3,
year = 1992,
pages = "177--186"
}
@inproceedings{b-zsaa-91,
author = "M. H. Brown",
title = "Zeus: {A} system for algorithms animation",
booktitle = "Proc. IEEE Workshop on Visual Languages",
year = 1991
}
@article{bh-csaa-92,
author = "M. H. Brown and J. Hershberger",
title = "Color and sound in algorithms animation",
journal = "IEEE Comput.",
volume = 25,
number = 12,
year = 1992,
pages = "52--63"
}
@inproceedings{bn-cat-96,
author = "M. H. Brown and M. A. Najork",
title = "Collaborative Active Textbooks",
booktitle = "IEEE Symp. on Visual Languages",
year = 1996
}
@techreport{bn-catwb-96,
author = "M. H. Brown and M. A. Najork",
title = "Collaborative active textbooks: {A} web-based
algorithm animation system for an electronic
classroom",
type = "Research {Report}",
number = 142,
institution = "SRC",
month = may,
year = 1996
}
@article{bs-taa-85,
author = "M. H. Brown and R. Sedgewick",
title = "Techniques for algorithm animation",
journal = "IEEE Softw.",
volume = 2,
number = 1,
month = jan,
year = 1985,
pages = "28--39"
}
@article{bt-dadsr-80,
author = "M. R. Brown and R. E. Tarjan",
title = "Design and analysis of a data structure for
representing sorted lists",
journal = SICOMP,
volume = 9,
year = 1980,
pages = "594--614"
}
@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"
}
@article{b-bdn-87,
author = "D. Brownawell",
title = "Bounds for the degrees in the {Nullstellensatz}",
journal = "Annals of Math. Second Series",
volume = 126,
number = 3,
year = 1987,
pages = "577--591"
}
@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"
}
@techreport{bdmpw-gas-87,
author = "A. Browyer and J. Davenport and P. Milne and
J. Padget and A. Wallis",
title = "A geometric algebra system",
type = "Draft",
institution = "Schools of Mechanical Engineering and Mathematical
Sciences, Univ. Bath",
address = "Bath, UK",
year = 1987
}
@book{bg-cs2e-92,
author = "J. W. Bruce and P. J. Giblin",
title = "Curves and Singularities (2nd edition)",
publisher = "Cambridge University Press",
address = "New York",
year = 1992
}
@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"
}
@incollection{b-ccp-77,
author = "P. Brucker",
title = "On the Complexity of Clustering Problems",
editor = "R. Henn and B. Korte and W. Oletti",
booktitle = "Optimizing and Operations Research",
publisher = "Springer-Verlag",
address = "Berlin, West Germany",
year = 1977
}
@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"
}
@techreport{boo-dspir-91,
author = "A. Bruckstein and L. O'Gorman and A. Orlitsky",
title = "Design of shapes for precise image registration",
type = "Technical Report",
institution = "AT\&T",
year = 1991
}
@article{bn-dipcr-95,
author = "A. M. Bruckstein and A. N. Netravali",
title = "On differential invariants of planar curves and
recognizing partially occluded planar shapes",
journal = "Ann. Math. Artif. Intell.",
volume = 13,
year = 1995,
pages = "227--250",
keywords = "matching, shape recognition, vision"
}
@inproceedings{b-agpc-88,
author = "B. Br{\"u}derlin",
title = "Automatizing geometric proofs and constructions",
booktitle = "Computational Geometry and its Applications",
nickname = "CG '88",
site = "W{\"u}rzburg",
series = LNCS,
volume = 333,
publisher = "Springer-Verlag",
year = 1988,
pages = "232--252",
annote = "4th Intern. Workshop Comput. Geom."
}
@inproceedings{b-rcga-90,
author = "Beat Br{\"u}derlin",
title = "Robustness of Computational Geometry Algorithms",
booktitle = "Abstracts 6th Intern. Workshop Comput. Geom.",
nickname = "CG '90",
site = "Siegen",
publisher = "Universit{\"a}t Siegen",
year = 1990,
pages = 9
}
@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"
}
@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"
}
@article{bm-sdcs-71,
author = "H. Bruggesser and P. Mani",
title = "Shellable decompositions of cells and spheres",
journal = "Math. Scand.",
volume = 29,
year = 1971,
pages = "197--205"
}
@article{b-ttt-84,
author = "G. Br{\"u}gner",
title = "Three-triangle-tangram",
journal = "BIT",
volume = 24,
year = 1984,
pages = "380--382"
}
@book{b-navw-54,
author = "N. G. de Bruijn",
title = "Nieuw Archief voor Wiskunde",
volume = 2,
publisher = "??",
year = 1954
}
@incollection{b-p11a-55,
author = "N. G. de Bruijn",
title = "Problems 17 and 18. Answers",
booktitle = "Opgaven met de oplossingen",
volume = 20,
publisher = "??",
year = 1955,
pages = "19--20"
}
@article{be-cp-48,
author = "N. G. de Bruin and P. Erd{\H o}s",
title = "On a combinatorial problem",
journal = "Proc. Konink. Nederl. Akad. Wetensch. Ser. A",
volume = 51,
year = 1948,
pages = "1277--1279",
note = "Indagationes Math. 10, 421-423"
}
@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"
}
@article{bn-srueo-90,
author = "P. Brunet and I. Navazo",
title = "Solid representations using extended octrees",
journal = "ACM Trans. Graph.",
volume = 9,
year = 1990,
pages = "170--197"
}
@article{bmfn-psbzi-,
author = "A. Br{\"u}ngger and A. Marzetta and K. Fukuda and
J. Nievergelt",
title = "The parallel search bench {ZRAM} and its
applications",
journal = "Ann. Oper. Res.",
volume = "??",
year = "??",
note = "To appear"
}
@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 = LNCS,
volume = 1027,
publisher = "Springer-Verlag",
year = 1996,
pages = "99--110",
keywords = "graph drawing, 3D, straight-line"
}
@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,
annote = "Describes data structure for representing 3D
triangulations. Relationships VE, EV, EF, FE, FT, TF
are explicitly represented and the others can be
deduced from these in time proportional to the size
of the output."
}
@article{bs-ftmsb-85,
author = "R. Bryant and D. Singerman",
title = "Foundations of the theory of maps on surfaces with
boundaries",
journal = "Quart. J. Math. Oxford",
volume = 2,
number = 36,
year = 1985,
pages = "17--41"
}
@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"
}
@article{bz-trdpo-93,
author = "T. H. Brylawski and G. M. Ziegler",
title = "Topological representation of dual pairs of oriented
matroids",
journal = DCG,
volume = 10,
year = 1993,
pages = "237--240"
}
@article{b-omt-74,
author = "O. Bryngdahl",
title = "Optical map transformations",
journal = "Optics Commun.",
volume = 10,
number = 2,
year = 1974,
pages = "164--168"
}
@article{b-gto-74,
author = "O. Brynghdahl",
title = "Geometrical transformations in optics",
journal = "J. Optical Soc. Amer.",
volume = 64,
number = 8,
year = 1974,
pages = "1092--1099"
}
@inproceedings{bgmst-ntdfl-96,
author = "Nader Bshouty and Sally A. Goldman and H. David
Mathias and S. Suri and Hisao Tamaki",
title = "Noise-Tolerant Distribution-Free Learning of General
Geometric Concepts",
booktitle = STOC_1996,
nickname = "STOC '96",
site = "Philadelphia, PA",
month = may,
year = 1996,
pages = "151--160"
}
@incollection{b-lbact-91,
author = "N. H. Bshouty",
title = "Lower bounds for algebraic computation trees of
functions with finite domains",
booktitle = "??",
series = LNCS,
volume = 497,
year = 1991,
pages = "55--65",
keywords = "lower bounds"
}
@inproceedings{b-amnlc-88,
author = "B. Buchberger",
title = "Algebraic methods for non-linear computational
geometry",
booktitle = SOCG_1988,
year = 1988,
pages = "81--82"
}
@incollection{b-agbnc-88,
author = "B. Buchberger",
title = "Applications of {Gr\"obner} bases in nonlinear
computational geometry",
booktitle = "??",
series = LNCS,
volume = 296,
year = 1988,
pages = "52--80",
keywords = "algebraic geometry, motion planning"
}
@article{b-aklag-70,
author = "Bruno Buchberger",
title = "Ein algorithmisches {Kriterium} f{\"u}r die
{L{\"o}sbarkeit} eines algebraischen
{Gleichungssystems}",
journal = "Aequationes Mathematicae",
volume = 4,
number = 3,
year = 1970,
pages = "374--383"
}
@article{b-eakfd-70,
author = "B. Buchberger",
title = "Ein algorithmisches {Kriterium} f{\"u}r die
{L{\"o}sbarkeit} eines algebraischen
{Gleichungssystems}",
journal = "Aequationes Math.",
volume = 4,
number = 3,
year = 1970,
pages = "374--383"
}
@incollection{b-gbamp-85,
author = "B. Buchberger",
title = "{Gr{\"o}bner} Bases: {An} Algorithmic Method in
Polynomial Ideal Theory",
chapter = 6,
editor = "N. Bose",
booktitle = "Multidimensional Systems Theory",
publisher = "Reidel Publishing",
year = 1985
}
@article{b-hbfcp-87,
author = "B. Buchberger",
title = "History and basic features of the
critical-pair/completion procedure",
journal = "J. Symbolic Comput.",
volume = 3,
year = 1987,
pages = "3--38"
}
@incollection{b-wcgbd-89,
author = "B. Buchberger",
title = "What can {Gr{\"o}bner} bases do for computational
geometry and robotics?",
editor = "D. Kapur and J. L. Mundy",
booktitle = "Geometric Reasoning",
publisher = "MIT Press",
year = 1989,
pages = "415--447"
}
@book{bcl-casac-82,
title = "Computer Algebra: Symbolic and Algebraic
Computation",
editor = "B. Buchberger and G. Collins and R. Loos",
series = "Computing Supplementum",
volume = 4,
edition = "1st",
publisher = "Springer-Verlag",
address = "New York, NY",
year = 1982
}
@article{bck-amgr-88,
author = "B. Buchberger and G. E. Collins and B. Kutzler",
title = "Algebraic methods for geometric reasoning",
journal = "Annu. Rev. Comput. Sci.",
volume = 3,
year = 1988,
pages = "85--119"
}
@book{bcla-casac-83,
title = "Computer Algebra: Symbolic and Algebraic
Computation",
editor = "B. Buchberger and G. E. Collins and R. Loos and
R. Albrecht",
edition = "2nd",
publisher = "Springer-Verlag",
year = 1983
}
@incollection{bl-as-83,
author = "B. Buchberger and R. Loos",
title = "Algebraic simplification",
editor = "B. Buchberger and G. E. Collins and R. Loos and
R. Albrecht",
booktitle = "Computer Algebra: Symbolic and Algebraic
Computation",
publisher = "Springer-Verlag",
year = 1983,
pages = "11--43"
}
@proceedings{bs-ewcg-95,
title = "Abstracts 11th European Workshop Comput. Geom.",
editor = "Bruno Buchberger and Sabine Stifter",
nickname = "CG '95",
site = "Linz",
publisher = "Universit{\"a}t Linz",
year = 1995
}
@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 = "Greenwich, Conn.",
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"
}
@article{b-nsrsl-87,
author = "C. Buchta",
title = "On nonnegative solutions of random systems of linear
inequalities",
journal = DCG,
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 = IPL,
volume = 33,
number = 2,
year = 1989,
pages = "63--66",
keywords = "probabilistic geometry"
}
@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"
}
@inproceedings{b-dcac4-88,
author = "C. E. Buckley",
title = "A divide-and-conquer algorithm for computing
$4$-dimensional convex hulls",
booktitle = "Computational Geometry and its Applications",
nickname = "CG '88",
site = "W{\"u}rzburg",
series = LNCS,
volume = 333,
publisher = "Springer-Verlag",
year = 1988,
pages = "113--135",
annote = "4th Intern. Workshop Comput. Geom."
}
@inproceedings{bl-pmcpp-85,
author = "C. E. Buckley and l. J. Leifer",
title = "A proximity metric for continuum pah planning",
booktitle = "Proc. 9th Internat. Conf. Artificial Intell.",
year = 1985,
pages = "1096--1102"
}
@phdthesis{b-ptcms-87,
author = "S. J. Buckley",
title = "Planning and teaching compliant motion strategies",
school = "Department of Electrical Engineering and Computer
Science, MIT",
year = 1987,
keywords = "doctoral thesis"
}
@inproceedings{befl-evcpp-96,
author = "B. B{\"u}eler and A. Enge and K. Fukuda and
H.-J. L{\"u}thi",
title = "Exact Volume Computations for Polytopes: a Practical
Study",
booktitle = "Abstracts 12th European Workshop Comput. Geom.",
nickname = "CG '96",
site = "M{\"u}nster",
publisher = "Universit{\"a}t M{\"u}nster",
year = 1996,
pages = "57--64"
}
@article{bh-amgfe-90,
author = "T. D. Bui and V. N. Hanh",
title = "Automatic Mesh Generation for Finite-Element
Analysis",
journal = "Computing",
volume = 44,
number = 4,
year = 1990,
pages = "305--329",
annote = "Your basic selection algorithm for triangulation."
}
@phdthesis{b-ptrpn-94,
author = "X.-N. Bui",
title = "Planification de trajectoire pour un robot polygonal
non-holonome dans un environnement polygonal",
type = "Th\`{e}se de doctorat en sciences",
school = "{\'E}cole Nationale Sup\'erieure des Mines de Paris",
address = "France",
year = 1994,
keywords = "doctoral thesis"
}
@inproceedings{bsbl-spsdn-94,
author = "X.-N. Bui and P. Sou{\`e}res and J.-D. Boissonnat
and J.-P. Laumond",
title = "Shortest path synthesis for {Dubins} nonholonomic
robot",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
site = "San Diego, CA",
year = 1994,
pages = "2--7"
}
@techreport{bsbl-spsnr-93,
author = "Xuan-Nam Bui and Philippe Soueres and
J.-D. Boissonnat and Jean-Paul Laumond",
title = "The Shortest Path Synthesis for Non-holonomic Robots
Moving Forwards",
type = "Research {Report}",
number = 2153,
institution = "INRIA",
month = dec,
year = 1993,
abstract = "We calculate the partition of the configuration
space $I\!\!R^2 x S^1$ of a car-like robot, only
moving forwards, with respect to the type of the
length optimal paths. This kind of robot is subject
to kinematic constraints on its path curvature and
its orientation. Starting from the results on
shortest paths by [Dub57 ] and [BCL92 ], we give new
optimality conditions on these paths, and compute
the partition for any horizontal plane of the
configuration space."
}
@article{bs-aulbr-66,
author = "R. Bulirsch and J. Stoer",
title = "Asymptotic upper and lower bounds for results of
extrapolation methods",
journal = "Numer. Math.",
volume = 8,
year = 1966,
pages = "93--104"
}
@article{bs-nqe-67,
author = "R. Bulirsch and J. Stoer",
title = "Numerical quadrature by extrapolation",
journal = "Numer. Math.",
volume = 9,
year = 1967,
pages = "271--278"
}
@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"
}
@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"
}
@article{bsh-sgfgt-84,
author = "A. B{\"u}low-Olsen and N. R. {Sakevile Hamilton} and
M. J. Hutchings",
title = "A study of growth form in genets of {Trifolium
repens L.} as affected by intra- and interplant
contacts",
journal = "Oecologia",
volume = "??",
year = 1984
}
@book{b-mpg-69,
author = "R. J. Bumcrot",
title = "Modern Projective Geometry",
publisher = "Holt, Rinehart \& Winston",
address = "New York, NY",
year = 1969
}
@book{bz-gi-88,
author = "Y. D. Burago and V. A. Zalgaller",
title = "Geometric Inequalities",
publisher = "Springer-Verlag",
year = 1988,
note = "Translated from the Russian"
}
@article{b-gafp-74,
author = "C. A. Burdet",
title = "Generating all faces of a polyhedron",
journal = "SIAM J. Appl. Math.",
volume = 26,
year = 1974,
pages = "479--489"
}
@book{bcs-act-96,
author = "Peter B{\"u}rgisser and Michael Clausen and M. Amin
Shokrollahi",
title = "Algebraic Complexity Theory",
series = "Grundlehren der mathematischen Wissenschaften",
volume = 315,
publisher = "Springer-Verlag",
address = "Berlin",
year = 1996,
isbn = "0-387-60582-7"
}
@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",
abstract = "Place two regular polygons in a circle so as to
minimize the maximum separation between two vertices
along the circle."
}
@article{bddvw-wsctsps-98,
author = "Rainer E. Burkard and Vladimir G. Deineko and
Ren{\'e} van Dal and Jack A. A. van der Veen and
Gerhard J. Woeginger",
title = "Well-Solvable Special Cases of the Traveling
Salesman Problem: A Survey",
journal = "SIAM Rev.",
volume = 40,
number = 3,
year = 1998,
pages = "496 -- 546",
keywords = "survey paper, traveling salesman problem,
combinatorial optimization, polynomial time
algorithm, computational complexity",
abstract = "The traveling salesman problem (TSP) belongs to the
most basic, most important, and most investigated
problems in combinatorial optimization. Although it
is an ${\cal NP}$-hard problem, many of its special
cases can be solved efficiently in polynomial
time. We survey these special cases with emphasis on
the results that have been obtained during the
decade 1985--1995. This survey complements an
earlier survey from 1985 compiled by Gilmore,
Lawler, and Shmoys [The Traveling Salesman
Problem---A Guided Tour of Combinatorial
Optimization, Wiley, Chichester, pp. 87--143]"
}
@article{bhr-saucf-91,
author = "R. E. Burkard and H. W. Hamacher and G. 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"
}
@techreport{bkr-pmpo-95,
author = "Rainer E. Burkard and Bettina Klinz and R{\"u}diger
Rudolf",
title = "Perspectives of {Monge} Properties in Optimization",
type = "?",
number = 2,
institution = "Spezialforschungsbereich F~003,
Karl-Franzens-Universit{\"a}t Graz and Technische
Universit{\"a}t Graz",
month = aug,
year = 1995,
url = "ftp://ftp.tu-graz.ac.at/pub/papers/math/sfb2.ps.gz"
}
@article{bryy-spps-90,
author = "Rainer E. Burkard and G. Rote and En-Yu Yao and
Zhong-Liang Yu",
title = "Shortest Polygonal Paths in Space",
journal = "Computing",
volume = 45,
year = 1990,
pages = "51--68",
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 = STOC_1976,
year = 1976,
pages = "211--219"
}
@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"
}
@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 = TCS,
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 = TCS,
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"
}
@article{bfms-secsb-00,
author = "C. Burnikel and R. Fleischer and K. Mehlhorn and
S. Schirra",
title = "A Strong and Easily Computable Separation Bound for
Arithmetic Expressions Involving Radicals",
journal = "Algorithmica",
volume = 27,
number = 1,
year = 2000,
pages = "87--99"
}
@inproceedings{bfms-secsb-97,
author = "C. Burnikel and R. Fleischer and K. Mehlhorn and
S. Schirra",
title = "A strong and easily computable separation bound for
arithmetic expressions involving square roots",
booktitle = SODA_1997,
year = 1997,
pages = "702--709"
}
@inproceedings{bfms-eegcm-99,
author = "C. Burnikel and R. Fleischer and K. Mehlhorn and
S. Schirra",
title = "Efficient Exact Geometric Computation Made Easy",
booktitle = SOCG_1999,
year = 1999,
pages = "341--350"
}
@article{bfs-egcc-01,
author = "C. Burnikel and S. Funke and M. Seel",
title = "Exact Geometric Computation using Cascading",
journal = IJCGA,
volume = 11,
year = 2001,
pages = "245--266"
}
@inproceedings{bfs-egpuc-98,
author = "C. Burnikel and S. Funke and M. Seel",
title = "Exact Geometric Predicates using Cascaded
Computation",
booktitle = SOCG_1998,
year = 1998,
pages = "175--183"
}
@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 = SOCG_1995,
year = 1995,
pages = "C18--C19",
url = "http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html",
keywords = "?"
}
@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 = ESA_1994,
nickname = "ESA '94",
series = LNCS,
volume = 855,
publisher = "Springer-Verlag",
year = 1994,
pages = "227--239"
}
@inproceedings{bms-dgc-94,
author = "C. Burnikel and K. Mehlhorn and S. Schirra",
title = "On degeneracy in geometric computations",
booktitle = SODA_1994,
year = 1994,
pages = "16--23"
}
@techreport{bms-lcrn-96,
author = "C. Burnikel and K. Mehlhorn and S. Schirra",
title = "The {LEDA} class real number",
type = "Technical {Report}",
number = "MPI-I-96-1-001",
institution = "Max-Planck Institut Inform.",
address = "Saarbr{\"u}cken, Germany",
month = jan,
year = 1996,
url = "http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1996-1-001"
}
@incollection{b-grtgs-74,
author = "S. A. Burr",
title = "Generalized {Ramsey} theory for graphs: a survey",
editor = "R. Bari and F. Haray",
booktitle = "Graphs Combin.",
series = "Lecture Notes Math.",
volume = 406,
publisher = "Springer-Verlag",
address = "Berlin, Germany",
year = 1974,
pages = "52--75"
}
@article{bes-rtmcg-75,
author = "S. A. Burr and P. Erd{\H o}s and J. H. Spencer",
title = "{Ramsey} theorems for multiple copies of graphs",
journal = "Trans. Amer. Math. Soc.",
volume = 209,
year = 1975,
pages = "87--99"
}
@article{bgs-op-74,
author = "S. A. Burr and B. Gr{\"u}nbaum and N. J. A. Sloane",
title = "The orchard problem",
journal = "Geometriae Dedicatia",
volume = 2,
year = 1974,
pages = "397--424"
}
@inproceedings{brs-phpsd-87,
author = "R. Burridge and V. T. Rajan and J. T. Schwartz",
title = "The peg-in-hole problem: {Statistics} and dynamics
of nearly rigid bodies in frictional contact",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
site = "Raleigh, NC",
year = 1987
}
@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
}
@article{bkk-cppt-84,
author = "F. W. Burton and V. J. Kollias and J. G. Kollias",
title = "Consistency in point-in-polygon tests",
journal = "Comput. J.",
volume = 27,
number = 4,
year = 1984,
pages = "375--376"
}
@article{bp-ddnpp-79,
author = "G. R. Burton and G. B. Purdy",
title = "The directions determined by $n$ points in the
plane",
journal = "J. London Math. Soc.",
volume = 20,
number = 2,
year = 1979,
pages = "109--114"
}
@article{bs-hlah-82,
author = "R. P. Burton and D. R. Smith",
title = "A hidden-line algorithm for hyperspace",
journal = SICOMP,
volume = 11,
year = 1982,
pages = "71--80"
}
@article{b-rmspp-77,
author = "W. Burton",
title = "Representation of many-sided polygons and polygonal
lines for rapid processing",
journal = "Commun. ACM",
volume = 20,
year = 1977,
pages = "166--171"
}
@book{b-cs-58,
author = "H. Buseman",
title = "Convex Surfaces",
publisher = "Interscience Publishers",
address = "New York, NY",
year = 1958
}
@book{b-sdg-87,
author = "H. Busemann",
title = "Spaces with distinguished Geodesics",
publisher = "M. Dekker",
address = "New York",
year = 1987
}
@book{b-gog-55,
author = "H. Busemann",
title = "The Geometry of Geodesics",
publisher = "Academic Press Inc.",
address = "New York",
year = 1955
}
@book{bgsss-mcm-66,
author = "N. P. Buslenko and D. I. Golenko and I. M. Sobol and
V. G. Sragovi{\v c} and J. A. {\v S}reider",
title = "The {Monte} {Carlo} Method",
editor = "J. A. Shrider",
publisher = "Pergamon Press",
address = "Oxford, UK",
year = 1966
}
@inproceedings{by-lotmc-94,
author = "S. Buss and P. Yianilos",
title = "Linear and {$O(n \log n)$} time minimum-cost
matching algorithms for quasi-convex tours",
booktitle = SODA_1994,
year = 1994,
pages = "65--76"
}
@article{by-lotmc-98,
author = "S. R. Buss and P. N. Yianilos",
title = "Linear and {$O(n \log n)$} time minimum-cost
matching algorithms for quasi-convex tours",
journal = SICOMP,
volume = 27,
year = 1998,
pages = "170--201"
}
@inproceedings{bdltvv-gwspt-96,
author = "L. Buti and G. {Di Battista} and G. Liotta and
E. Tassinari and F. Vargiu and L. Vismara",
title = "{GD-W}orkbench: A System for Prototyping and Testing
Graph Drawing Algorithms",
editor = "F. J. Brandenburg",
booktitle = "Graph Drawing (Proc. GD '95)",
series = LNCS,
volume = 1027,
publisher = "Springer-Verlag",
year = 1996,
pages = "111--122",
keywords = "graph drawing, system"
}
@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"
}
@article{b-tcl-85,
author = "B. Buttenfield",
title = "Treatment of the Cartographic Line",
journal = "Cartographica",
volume = 22,
year = 1985,
pages = "1--26"
}
@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 = IPL,
volume = 7,
year = 1978,
pages = "296--298"
}
@article{b-ps-79,
author = "A. Bykat",
title = "On polygon similarity",
journal = IPL,
volume = 9,
year = 1979,
pages = "23--25"
}
@inproceedings{cgmm-dfglm-01,
author = "Jos{\'e} C{\'a}ceres and Clara I. Grima and Alberto
M{\'a}rquez and Auxiliadora Moreno-Gonz{\'a}lez",
title = "Dilation Free Graphs in {$L_1$}-Metric",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "178--182"
}
@inproceedings{cm-atm-99,
author = "Jos{\'e} C{\'a}ceres and Alberto M{\'a}rquez",
title = "An Aperiodic Tiles Machine",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "55--57"
}
@article{c-cepgu-93,
author = "Jiazhen Cai",
title = "Counting Embeddings of Planar Graphs Using {DFS}
Trees",
journal = "SIAM J. Discrete Math.",
volume = 6,
year = 1993,
pages = "335--352",
keywords = "graph drawing, DFS tree, planarization"
}
@article{cht-otams-93,
author = "J. Cai and X. Han and R. E. Tarjan",
title = "An ${O}(m \log n)$-time Algorithm for the Maximal
Subgraph Problem",
journal = SICOMP,
volume = 22,
year = 1993,
pages = "1142--1162",
keywords = "graph drawing, planarization"
}
@inproceedings{ch-rdtps-94,
author = "J. Cai and M. D. Hirsch",
title = "Rotation Distance, Triangulations of Planar Surfaces
and Hyperbolic Geometry",
booktitle = ISAAC_1994,
nickname = "ISAAC '94",
site = "Beijing, China",
series = LNCS,
volume = 834,
publisher = "Springer-Verlag",
year = 1994,
pages = "172--180"
}
@inproceedings{c-apeg-96,
author = "L. Cai",
title = "Algorithms on polygonal embeddings of graphs",
booktitle = CCCG_1996,
year = 1996,
pages = "300--305"
}
@misc{c-t2s-91,
author = "L. Cai",
title = "Tree 2-Spanners",
year = 1991,
note = "manuscript, Simon Fraser University"
}
@inproceedings{ce-vgpr-95,
author = "Leizhen Cai and Hazel Everett",
title = "Visibility Graphs of Polygonal Rings",
booktitle = CCCG_1995,
year = 1995,
pages = "157--161"
}
@article{ck-cviis-97,
author = "L. Cai and J. M. Keil",
title = "Computing Visibility Information in an Inaccurate
Simple Polygon",
journal = IJCGA,
volume = 7,
year = 1997,
pages = "515--538"
}
@article{cxz-cobtcp-99,
author = "L. Cai and Y. Xu and B. Zhu",
title = "Computing the Optimal Bridge between two Convex
Polygons",
journal = IPL,
volume = 69,
year = 1999,
pages = "127--130"
}
@article{ch-srpfc-68,
author = "L. Calabi and W. E. Hartnett",
title = "Shape recognition, prairie fires, convex
deficiencies and skeletons",
journal = "Amer. Math. Monthly",
volume = 75,
year = 1968,
pages = "335--342"
}
@inproceedings{cm-tdlin-97,
author = "Tiziana Calamoneri and Annalisa Massini",
title = "On Three-Dimensional Layout of Interconnection
Networks",
editor = "G. {Di Battista}",
booktitle = "Graph Drawing (Proc. GD '97)",
series = LNCS,
volume = 1353,
publisher = "Springer-Verlag",
year = 1997,
pages = "64--75",
keywords = "graph drawing, 3D"
}
@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"
}
@inproceedings{cs-d234c-97,
author = "T. Calamoneri and A. Sterbini",
title = "Drawing $2$-, $3$-, and $4$-Colorable Graphs in
$O(n^2)$ Volume",
editor = "S. North",
booktitle = "Graph Drawing (Proc. GD '96)",
series = LNCS,
volume = 1190,
publisher = "Springer-Verlag",
year = 1997,
pages = "53--62",
keywords = "graph drawing, straight-line, 3D"
}
@inproceedings{cgg-oiprf-99,
author = "A. Calatayud and J. Garc{\'\i}a and F. G{\'o}mez",
title = "Optimal Illumination of Points with a Restricted
Flood-Light",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "87--90"
}
@inproceedings{cgr-tbtta-95,
author = "Paul Callahan and Michael T. Goodrich and Kumar
Ramaiyer",
title = "Topology {B}-Trees and their Applications",
booktitle = WADS_1995,
nickname = "WADS '95",
site = "Kingston, Canada",
series = LNCS,
volume = 955,
publisher = "Springer-Verlag",
year = 1995,
pages = "381--392"
}
@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"
}
@inproceedings{c-opann-93,
author = "Paul B. Callahan",
title = "Optimal Parallel All-Nearest-Neighbors Using the
Well-Seated Pair Decomposition",
booktitle = FOCS_1993,
nickname = "FOCS '93",
year = 1993,
pages = "332--340"
}
@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 = STOC_1992,
year = 1992,
pages = "546--556",
keywords = "well-separated pair decomposition"
}
@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 = JACM,
volume = 42,
year = 1995,
pages = "67--90"
}
@inproceedings{ck-adcpn-95,
author = "Paul B. Callahan and S. Rao Kosaraju",
title = "Algorithms for Dynamic Closest-Pair and {$n$}-Body
Potential Fields",
booktitle = SODA_1995,
year = 1995,
pages = "263--272",
keywords = "dynamic algorithms, closest pair, all nearest
neighbors, fast multipole method"
}
@inproceedings{ck-fasgg-93,
author = "P. B. Callahan and S. R. Kosaraju",
title = "Faster Algorithms for Some Geometric Graph Problems
in Higher Dimensions",
booktitle = SODA_1993,
year = 1993,
pages = "291--300",
keywords = "optimization, minimum spanning trees, spanner,
well-separated pair decomposition"
}
@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
}
@incollection{c-agg-83,
author = "P. J. Cameron",
title = "Automorphism Groups of Graphs",
editor = "B. Wilson",
booktitle = "Selected Topics in Graph Theory",
publisher = "Academic Press",
year = 1983
}
@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"
}
@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"
}
@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"
}
@inproceedings{cc-dmtdb-86,
author = "S. A. Cameron and R. K. Culley",
title = "Determining the minimum translational distance
between two convex polyhedra",
booktitle = "Proc. of IEEE Inter. Conf. on Robotics and
Automation",
year = 1986,
pages = "591--596",
keywords = "GEOMOD OBSTACLE-AVOID COMPUTATIONAL-GEOMETRY 3D
PROXIMITY INTERSECTION CONVEX",
annote = "An algorithm is described to determine the Minimal
Translation Distance (MTD) between two
polyhedra. One way in which this algorithm differs
from others is that it will return a value other
than zero if the two objects intersect. This value
is the penetration distance and has a negative
sign. -WCF"
}
@article{cks-desrt-99,
author = "S. Campagna and L. Kobbelt and H.-P. Seidel",
title = "Directed Edges --- A Scalable Representation for
Triangle Meshes",
journal = "J. Graphics Tools",
volume = 3,
number = 4,
year = 1999,
pages = "1--12"
}
@phdthesis{c-mgdii-91,
author = "A. T. Campbell",
title = "Modeling Global Diffuse Illumination for Image
Synthesis",
school = "Dept. Comput. Sci., Univ. Texas Austin",
address = "Austin, TX",
year = 1991,
keywords = "doctoral thesis"
}
@techreport{c-crsdr-85,
author = "D. Campbell",
title = "The {Cornell} robot system design report",
type = "Technical {Report}",
number = "85-697",
institution = "Cornell Univ.",
address = "Ithaca, NY",
year = 1985
}
@article{ch-mvg-91,
author = "D. Campbell and J. Higgins",
title = "Minimal visibility graphs",
journal = IPL,
volume = 37,
number = 1,
year = 1991,
pages = "49--53",
keywords = "visibility, geometric graphs, segments"
}
@article{cf-amggdi-90,
author = "A. T. {Campbell III} and D. S. Fussell",
title = "Adaptive Mesh Generation for Global Diffuse
Illumination",
journal = "Comput. Graph.",
volume = 24,
month = aug,
year = 1990,
pages = "155--164"
}
@techreport{cf-aaial-91,
author = "A. T. {Campbell III} and D. S. Fussell",
title = "An Analytic Approach to Illumination with Area Light
Sources",
type = "Report",
number = "TR--91--25",
institution = "Department of Computer Sciences, University of Texas
at Austin",
address = "Austin, Texas",
month = aug,
year = 1991
}
@article{c-icdir-93,
author = "F. Can",
title = "Incremental clustering for dynamic information
retrieval",
journal = "ACM Trans. Inform. Syst.",
volume = 11,
year = 1993,
pages = "143--164"
}
@incollection{cgh-snebc-89,
author = "L. Canaglia and A. Galligo and J. Heintz",
title = "Some new effectivity bounds in computational
geometry",
booktitle = "??",
series = LNCS,
volume = 357,
year = 1989,
pages = "131--151",
keywords = "algebraic geometry, motion planning, parallel
computation"
}
@article{c-talp-69,
author = "R. Canham",
title = "A theorem on arrangements of lines in the plane",
journal = "Israel J. Math.",
volume = 7,
year = 1969,
pages = "393--397",
keywords = "arrangements, complexity of faces"
}
@techreport{cgh-snebc-88,
author = "L. Caniglia and A. Galligo and J. Heintz",
title = "Some new efficient bounds in computational geometry",
institution = "Instituto Argentino de Mathem{\'a}tica",
address = "Buenos Aires, Argentina",
year = 1988,
note = "Preliminary version"
}
@article{c-cgts-69,
author = "J. J. Cannon",
title = "Computers in Group Theory: {A} Survey",
journal = "Commun. ACM",
volume = 12,
year = 1969,
pages = "3--12"
}
@inproceedings{c-namrm-87,
author = "J. Canny",
title = "A new algebraic method for robot motion planning and
real geometry",
booktitle = FOCS_1987,
year = 1987,
pages = "39--48"
}
@inproceedings{c-vmpmp-85,
author = "J. Canny",
title = "A {Voronoi} method for the piano-movers problem",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
site = "St. Louis, MO",
year = 1985,
pages = "530--535"
}
@inproceedings{c-emscc-87,
author = "J. Canny",
title = "An efficient method for skeletonizing the connected
components of a semi-algebraic set",
booktitle = "4th Computational Geometry Day",
organization = "New York Univ.",
month = mar,
year = 1987,
note = "Presented Talk"
}
@techreport{c-cdmp-84,
author = "J. Canny",
title = "Collision Detection for Moving Polyhedra",
type = "A. {I}. {Memo}",
number = 806,
institution = "Massachusetts Inst. Tech.",
address = "Cambridge, MA",
year = 1984
}
@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"
}
@article{c-crgss-93,
author = "J. Canny",
title = "Computing roadmaps in general semialgebraic sets",
journal = "Comput. J.",
volume = 36,
year = 1993,
pages = "409--418"
}
@inproceedings{c-crsas-91,
author = "J. Canny",
title = "Computing roadmaps of semi-algebraic sets",
booktitle = "Proc. 9th AAECC",
site = "New Orleans",
year = 1991
}
@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
}
@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"
}
@inproceedings{c-gcp-88,
author = "J. Canny",
title = "Generalized Characteristic Poynomials",
booktitle = "Proc. ACM Sympos. Symbolic and Algebraic
Computation",
year = 1988
}
@article{c-iasde-93,
author = "J. Canny",
title = "Improved algorithms for sign determination and
existential quantifier elimination",
journal = "Comput. J.",
volume = 36,
year = 1993,
pages = "504--514"
}
@inproceedings{c-dcbp-84,
author = "J. Canny",
title = "On detecting collision between polyhedra",
booktitle = "Proc. ECAI",
year = 1984,
pages = "533--542"
}
@inproceedings{c-sagcp-88,
author = "J. Canny",
title = "Some algebraic and geometric computations in
{PSPACE}",
booktitle = STOC_1988,
year = 1988,
pages = "460--467"
}
@book{c-crmp-87,
author = "J. Canny",
title = "The Complexity of Robot Motion Planning",
series = "ACM -- MIT Press Doctoral Dissertation Award Series",
publisher = "MIT Press",
address = "Cambridge, MA",
year = 1987,
isbn = "0-262-03136-1",
keywords = "doctoral thesis",
comments = "revised version of author's Ph.D. thesis, Electrical
Engineering and Computer Science Dept.,
Massachusetts Inst. Tech. 1987"
}
@inproceedings{cd-svd-87,
author = "J. Canny and B. R. Donald",
title = "Simplified {Voronoi} diagrams",
booktitle = SOCG_1987,
year = 1987,
pages = "153--161"
}
@article{cd-svd-88,
author = "J. Canny and B. R. Donald",
title = "Simplified {Voronoi} diagrams",
journal = DCG,
volume = 3,
year = 1988,
pages = "219--236"
}
@inproceedings{cdrx-ckp-88,
author = "J. Canny and B. R. Donald and J. H. Reif and
P. Xavier",
title = "On the complexity of kinodynamic planning",
booktitle = FOCS_1988,
site = "White Plains, NY",
year = 1988,
pages = "306--316"
}
@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 = SOCG_1992,
year = 1992,
pages = "251--260"
}
@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"
}
@inproceedings{crr-eakpp-90,
author = "J. Canny and A. Rege and J. H. Reif",
title = "An exact algorithm for kinodynamic planning in the
plane",
booktitle = SOCG_1990,
year = 1990,
pages = "271--280"
}
@article{crr-eakpp-91,
author = "J. Canny and A. Rege and J. H. Reif",
title = "An exact algorithm for kinodynamic planning in the
plane",
journal = DCG,
volume = 6,
year = 1991,
pages = "461--484"
}
@inproceedings{cr-nlbtr-87,
author = "J. Canny and J. H. Reif",
title = "New lower bound techniques for robot motion planning
problems",
booktitle = FOCS_1987,
year = 1987,
pages = "49--60"
}
@inproceedings{c-isda-91,
author = "J. F. Canny",
title = "An improved sign determination algorithm",
booktitle = "Proc. 9th AAECC",
site = "New Orleans",
year = 1991
}
@inproceedings{c-cfmp-89,
author = "J. F. Canny",
title = "On the Computability of Fine-Motion Plans",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
publisher = "IEEE Computer Society Press",
address = "Scottsdale, Arizona",
year = 1989
}
@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
}
@article{cgv-fccsa-92,
author = "John F. Canny and Dima Grigor{\'e}v and Nicolai
Vorobjov",
title = "Finding connected components of a semi-algebraic set
in subexponential time",
journal = "Appl. Algebra Emg. Commun. Comput.",
volume = 2,
year = 1992,
pages = "217--238"
}
@techreport{ckl-sspef-89,
author = "J. F. Canny and E. Kaltofen and Y. Lakshman",
title = "Solving Systems of Polynomial Equations Faster",
type = "Technical {Report}",
number = "89-14",
institution = "Dept. Comput. Sci., Rensselaer Polytech. Inst.",
address = "Troy, NY",
year = 1989
}
%, number = "8"
@article{cj-nepiu-98,
author = "J. Cantarella and H. Johnston",
title = "Nontrivial embeddings of polygonal intervals and
unknots in 3-space",
journal = "J. Knot Theory Ramifications",
volume = 7,
year = 1998,
pages = "1027--1039"
}
@article{c-ocfpl-71,
author = "A. Cantoni",
title = "Optimal curve fitting with piecewise linear
functions",
journal = "IEEE Trans. Comput.",
volume = "C-20",
year = 1971,
pages = "59--67"
}
@inproceedings{cgt-pumlp-96,
author = "F. Cao and J. R. Gilbert and S. H. Teng",
title = "Partitioning Unstructured Meshes with Lines and
Planes",
booktitle = "9th Internat. Conf. Domain Decomposition",
year = 1996,
note = "submitted"
}
@book{cm-ecgt-78,
author = "M. Capobianco and J. C. Molluzzo",
title = "Examples and Counterexamples in Graph Theory",
publisher = "North-Holland",
year = 1978
}
@article{c-cpo-93,
author = "V. Capoyleas",
title = "Clamping of polygonal objects",
journal = "Pattern Recogn. Lett.",
volume = 14,
year = 1993,
pages = "704--714"
}
@article{c-aidp-96,
author = "V. Capoyleas",
title = "On the area of the intersection of disks in the
plane",
journal = CGTA,
volume = 6,
year = 1996,
pages = "393--396"
}
@article{cch-gngcb-96,
author = "V. Capoyleas and X. Chen and C. M. Hoffmann",
title = "Generic naming in generative, constraint-based
design",
journal = "Comput. Aided Design",
volume = 28,
number = 1,
year = 1996,
pages = "17--26"
}
@techreport{cp-tttcc-90,
author = "V. Capoyleas and J. Pach",
title = "A {Tur{\'a}n}-type theorem on chords of a convex
polygon",
type = "Technical {Report}",
number = "90-30",
institution = "DIMACS",
year = 1990
}
@inproceedings{cp-ppsp-91,
author = "V. Capoyleas and J. Pach",
title = "On the perimeter of a point set in the plane",
booktitle = CCCG_1991,
year = 1991,
pages = "54--57"
}
@inproceedings{crw-gc-90,
author = "V. Capoyleas and G. Rote and G. Woeginger",
title = "Geometric clusterings",
booktitle = CCCG_1990,
year = 1990,
pages = "28--31"
}
@article{crw-gc-91,
author = "V. Capoyleas and G. Rote and G. Woeginger",
title = "Geometric clusterings",
journal = JALG,
volume = 12,
year = 1991,
pages = "341--356",
keywords = "cluster analysis",
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"
}
@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 = SOCG_1990,
year = 1990,
pages = "83--91",
note = "(A revised version, entitled ``Common tangents and
common transversals,'' {\it Advance in Math.} 106
(1994), 198--215.)"
}
% ### others?
@article{c-mvor-87,
author = "V. Cappellini and others",
title = "From multiple views to object recognition",
journal = "IEEE Trans. Circuits Syst.",
volume = 34,
year = 1987,
pages = "1344--1350"
}
@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"
}
@article{csw-cds2d-88,
author = "G. Carey and M. Sharna and K. Wang",
title = "A class of data structures for $2$-d and $3$-d
adaptive mesh refinements",
journal = "Internat. J. Numer. Methods Eng.",
volume = 26,
year = 1988,
pages = "2607--2622"
}
@techreport{cc-hdsrs-??,
author = "I. Carlbom and I. Chakravaty",
title = "A hierarchical data structure for representing the
spatial decomposition of $3$-d objects",
type = "Manuscript",
institution = "??",
year = "??"
}
@article{cp-gpvt-78,
author = "I. Carlbom and J. Paciorek",
title = "Geometric projection and viewing transformations",
journal = "ACM Comput. Surv.",
volume = 10,
year = 1978,
pages = "465--502"
}
@inproceedings{cgrw-pgfip-94,
author = "B. Carlisle and K. Y. Goldberg and A. S. Rao and
J. Wiegley",
title = "A pivoting gripper for feeding industrial parts",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
month = may,
year = 1994,
pages = "1650--1655"
}
@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"
}
@article{c-ddehi-87,
author = "Svante Carlsson",
title = "The Deap: a Double-Ended Heap to Implement
Double-Ended Priority Queries",
journal = IPL,
volume = 26,
number = 1,
year = 1987,
pages = "33--36",
keywords = "data structuring"
}
@article{ccs-ncdsd-89,
author = "Svante Carlsson and Jingsen Chen and Thomas
Strothotte",
title = "A Note on the Construction of the Data Structure
``Deap''",
journal = IPL,
volume = 31,
year = 1989,
pages = "315--317",
keywords = "data structuring"
}
@inproceedings{cj-cswps-95,
author = "Svante Carlsson and Hakan Jonsson",
title = "Computing a Shortest Watchman Path in a Simple
Polygon in Polynomial Time",
booktitle = WADS_1995,
nickname = "WADS '95",
site = "Kingston, Canada",
series = LNCS,
volume = 955,
publisher = "Springer-Verlag",
year = 1995,
pages = "122--134"
}
@inproceedings{cj-gt-93,
author = "Svante Carlsson and Hakan Jonsson",
title = "Guarding a Treasury",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "85--90"
}
@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 = ISAAC_1993,
nickname = "ISAAC '93",
series = LNCS,
volume = 762,
publisher = "Springer-Verlag",
year = 1993,
pages = "58--67"
}
@article{cjn-fswrs-99,
author = "S. Carlsson and H. Jonsson and B. J. Nilsson",
title = "Finding the Shortest Watchman Route in a Simple
Polygon",
journal = DCG,
volume = 22,
number = 3,
year = 1999,
pages = "377--402"
}
@article{cn-cvpp-99,
author = "S. Carlsson and B. J. Nilsson",
title = "Computing Vision Points in Polygons",
journal = "Algorithmica",
volume = 24,
year = 1999,
pages = "50--75"
}
@inproceedings{cnn-ogcmw-91,
author = "Svante Carlsson and Bengt J. Nilsson and Simeon
Ntafos",
title = "Optimum Guard Covers and $m$-Watchmen Routes for
Restricted Polygons",
booktitle = WADS_1991,
series = LNCS,
volume = 519,
publisher = "Springer-Verlag",
year = 1991,
pages = "367--378",
keywords = "polygons, visibility"
}
@article{cnn-ogcmw-93,
author = "Svante Carlsson and Bengt J. Nilsson and Simeon
Ntafos",
title = "Optimum Guard Covers and $m$-Watchmen Routes for
Restricted Polygons",
journal = IJCGA,
volume = 3,
year = 1993,
pages = "85--105",
keywords = "Visibility, art gallery, watchman route, dynamic
programming"
}
@inproceedings{ck-mchlt-01,
author = "Paz Carmi and Matthew J. Katz",
title = "Minimizing the Convex Hull via Local Transfers",
booktitle = "Abstracts 17th European Workshop Comput. Geom.",
nickname = "CG 2001",
site = "Berlin",
publisher = "Freie Universit{\"a}t Berlin",
year = 2001,
pages = "105--108"
}
@book{c-dgcs-76,
author = "M. de Carmo",
title = "Differential Geometry of Curves and Surfaces",
publisher = "Prentice Hall",
address = "Englewood Cliffs, NJ",
year = 1976
}
@article{c-dkhvn-70,
author = "H. Carnal",
title = "Die konvexe {H{\"u}lle} von $n$ rotationssymmetrisch
verteilten {Punkten}",
journal = "Z. Wahrsch. Verw. Gebiete",
volume = 15,
year = 1970,
pages = "168--176"
}
@article{c-gesc96,
author = "Y. Caro",
title = "On the generalized {Erd{\H{o}}s-Szekeres}
conjecture",
journal = "Discrete Math.",
volume = 160,
year = 1996,
pages = "229--233"
}
@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"
}
% what is this??
@article{cd-adtgi-80,
author = "M. J. Carpano and M. Delarche",
title = "Apport des Techniques Graphiques Interactives a
l'Analyse Structurale de Systemes. {II}-Exemples de
Realization et d'Application",
journal = "RAIRO Sept. Anal. Cont. June",
volume = "??",
year = 1980,
keywords = "graph drawing"
}
@inproceedings{cms-sssa-01,
author = "Hamish Carr and Torsten M{\"o}ller and J. Snoeyink",
title = "Simplicial Subdivisions and Sampling Artifacts",
booktitle = "Proceedings IEEE Visualization 2001",
year = 2001,
pages = "99--106"
}
@article{c-csma-87,
author = "L. Carstensen",
title = "A comparison of simple mathematical approaches to
spot symbols",
journal = "Cartographica",
volume = 24,
number = 3,
year = 1987,
pages = "46--63"
}
@incollection{cc-pptus-95,
author = "P. C. P. Carvalho and P. R. Cavalcanti",
title = "Point in polyhedron testing using spherical
polygons",
editor = "A. W. Paeth",
booktitle = "Graphics Gems V",
publisher = "Academic Press",
address = "Boston, MA",
year = 1995,
pages = "42--54"
}
@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 = IJCGA,
volume = 6,
year = 1996,
pages = "443--460"
}
@book{c-ign-59,
author = "J. Cassels",
title = "An Introduction to the Geometry of Numbers",
publisher = "Springer-Verlag",
year = 1959
}
@inproceedings{csm-nocpt-95,
author = "T. Cassen and K. R. Subramanian and Z. Michalewicz",
title = "Near-Optimal Construction of Partitioning Trees by
Evolutionary Techniques",
booktitle = "Proc. of Graphics Interface '95",
year = 1995,
pages = "263--271"
}
@inproceedings{cu-slepg-96,
author = "N. Castaneda and J. Urrutia",
title = "Straight line embeddings of planar graphs on point
sets",
booktitle = CCCG_1996,
year = 1996,
pages = "312--318"
}
@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"
}
@inproceedings{ccdm-rdbrc-99,
author = "Natalia de Castro and Francisco Javier Cobos and
Juan Carlos Dana and Alberto M{\'a}rquez",
title = "Rectangular Duals and Box-Representation in the
Cylinder",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "145--147"
}
@article{c-ahcr-95,
author = "T. Catarci",
title = "The Assignment Heuristic for Crossing Reduction",
journal = "IEEE Trans. Syst. Man Cybern.",
volume = 25,
number = 3,
year = 1995,
pages = "515--521"
}
@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"
}
@techreport{c-sacdc-74,
author = "E. Catmull",
title = "A Subdivision Algorithm for Computer Display of
Curved Surfaces",
number = "UTEC-CSC-74-133",
institution = "Dept. Comput. Sci., Univ. Utah",
address = "Salt Lake City",
year = 1974
}
@article{cc-rgbss-78,
author = "E. Catmull and J. Clark",
title = "Recursively generated {B}-spline surfaces on
arbitrary topological meshes",
journal = "Comput. Aided Design",
volume = 10,
year = 1978,
pages = "350--365"
}
@article{c-spp-1813,
author = "Augustin L. Cauchy",
title = "Sur les polygones et les poly{\`e}dres, seconde
m{\'e}moire",
journal = "J. {\'E}cole Polytechnique",
volume = "XVIe Cahier, Tome IX",
year = 1813,
pages = "113--148",
note = "OEuvres Compl{\`e}tes, IIe S{\`e}rie, Vol. 1, Paris,
1905, 26--38."
}
@inproceedings{ca-hadla-86,
author = "H. J. Caulfield and M. A. G. Abushagur",
title = "Hybrid analog-digital linear algebra processors",
booktitle = "Proc. of SPIE",
volume = 634,
year = 1986,
pages = "86--95"
}
@article{c-atapd-74,
author = "J. C. Cavendish",
title = "Automatic triangulation of arbitrary planar domains
for the finite element method",
journal = "Internat. J. Numer. Methods Eng.",
volume = 8,
year = 1974,
pages = "679--696"
}
@article{cff-aatdf-85,
author = "J. C. Cavendish and D. A. Field and W. H. Frey",
title = "An approach to automatic three-dimensional finite
element mesh generation",
journal = "Internat. J. Numer. Methods Eng.",
volume = 21,
year = 1985,
pages = "329--347"
}
@article{cfm-fbdfe-91,
author = "J. C. Cavendish and W. H. Frey and S. P. Marin",
title = "Feature-Based Design And Finite Element Mesh
Generation For Functional Surfaces",
journal = "Advances in Engineering Software and Workstations",
volume = 13,
number = "5--6",
month = sep,
year = 1991,
pages = "226--237",
keywords = "feature based design, finite element mesh
generation, functional surfaces, Delaunay surface
triangulation, surface modeling systems, downstream
mesh generation",
annote = "Watson's alg for tri. Constraint edges are forced by
ensuring that no generated points falls in their
circumcircles.",
abstract = "This paper describes an approach to feature-based
design and feature-based mesh generation for
multi-featured functional surfaces. Unlike standard
free-form parametric surface representation where
the parametric surface patch plays the key role in
both surface design and finite element mesh
generation, we propose an approach to these two
tasks which proceeds from the level of a complete
feature (for example, a pocket or channel). The
result is a more direct method for modeling
functional surface characteristics and a more
efficient feature-based implementation of Delaunay
surface triangulation. (Author abstract) 10 Refs."
}
@article{c-te-48,
author = "A. Cayley",
title = "On the Theory of Elimination",
journal = "Cambridge and Dublin Math. J.",
volume = 3,
year = 1948,
pages = "116--120"
}
@article{c-tggr-95,
author = "A. Cayley",
title = "The Theory of Groups Graphical Representation",
journal = "Math. Papers",
volume = 10,
year = 1895,
pages = "26--28"
}
@article{c-cpoda-97,
author = "F. Cazals",
title = "Combinatorial properties of one-dimensional
arrangements",
journal = "Experimental Math.",
volume = 6,
number = 1,
year = 1997
}
@inproceedings{c-ennsh-98,
author = "F. Cazals",
title = "Effective nearest neighbors searching on the
hyper-cube, with a pplications to molecular
clustering",
booktitle = SOCG_1998,
year = 1998,
pages = "222--230"
}
@inproceedings{cdp-fchcn-95,
author = "F. Cazals and G. Drettakis and C. Puech",
title = "Filtering, clustering and hierarchy construction: a
new solution for ray-tracing complex scenes",
booktitle = "EG'95",
site = "Maastricht, Netherlands",
year = 1995
}
@inproceedings{cp-blspd-97,
author = "F. Cazals and C. Puech",
title = "Bucket-like space partitioning data structures with
applications to ray tracing",
booktitle = SOCG_1997,
year = 1997,
pages = "11--20"
}
@unpublished{cs-sigte-97,
author = "F. Cazals and M. Sbert",
title = "Some integral geometry tools to estimate the
complexity of 3d scenes",
year = 1997,
note = "In preparation"
}
@article{cd-fsgr-00,
author = "D. Cazier and J.-F. Dufourd",
title = "A formal specification of geometric refinements",
journal = "Visual Comput.",
volume = "?",
year = 2000,
pages = "?"
}
@inproceedings{cd-rsbps-95,
author = "David Cazier and Jean-Fran{\c c}ois Dufourd",
title = "A Rewrite System to Build Planar Subdivisions",
booktitle = CCCG_1995,
year = 1995,
pages = "235--240"
}
@article{cgaf-gstlm-94,
author = "G. Ceder and G. Garbulsky and D. Avis and K. Fukuda",
title = "Ground states of a ternany lattice model with
nearest and next-nearest neighbor interactions",
journal = "Physical Review B",
volume = 49,
year = 1994,
pages = "1--7"
}
@article{css-mfcud-83,
author = "Z. J. Cendes and D. N. Shenton and H. Shahnasser",
title = "Magnetic Field Computation using {Delaunay}
Triangulation and Complementary Finite Element
Methods",
journal = "IEEE Trans. Magn.",
volume = "MAG-19",
number = 6,
year = 1983,
annote = "Uses incremental switching algorithm. Triangles are
refined by adding point at the centroid."
}
@techreport{b-dgs-70,
author = "Bureau of the Census",
title = "The DIME Geocoding System",
type = "Report",
number = 4,
institution = "U.S. Department of Commerce, Bureau of the Census",
address = "Washington",
year = 1970,
note = "Census use Study"
}
@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"
}
@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 = CCCG_1996,
year = 1996,
pages = "167--172"
}
@inproceedings{ces-hmpmo-96,
author = "T. Chadzelek and J. Eckstein and E. Sch{\"o}mer",
title = "Heuristic motion planning with movable obstacles",
booktitle = CCCG_1996,
year = 1996,
pages = "131--136"
}
@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"
}
@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"
}
@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"
}
@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"
}
@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"
}
@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"
}
@article{cg-fpms-85,
author = "G. D. Chakerian and M. A. Ghandehari",
title = "The {Fermat} problem in {Minkowski} space",
journal = "Geom. Dedicata",
volume = 17,
year = 1985,
pages = "227--238"
}
@article{cl-gep-71,
author = "G. D. Chakerian and L. H. Lange",
title = "Geometric extremum problems",
journal = "Math. Mag.",
volume = 44,
year = 1971,
pages = "57--69"
}
@inproceedings{cf-cvbtd-82,
author = "I. Chakravarty and H. Freeman",
title = "Characteristic views as a basis for
three-demensional object recognition",
booktitle = "Proc. SPIE: Robot Vision",
volume = 336,
year = 1982,
pages = "37--45"
}
@inproceedings{cr-gaha-87,
author = "S. B. Chalasani and C. S. Raghavendra",
title = "Geometric algorithms on a mesh architecture",
booktitle = "Computer Architecture in Pattern Analysis and
Machine Intelligence",
site = "Seattle",
publisher = "IEEE Computer Society",
month = oct,
year = 1987,
pages = "169--175",
keywords = "parallel computation"
}
@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"
}
@inproceedings{cdlss-frceu-96,
author = "Bradford Chamberlain and Tony DeRose and Dana
Lischinski and David Salesin and John Snyder",
title = "Fast Rendering of Complex Environments Using a
Spatial Hierarchy",
booktitle = "Proceedings of Graphics Interface '96",
year = 1996,
pages = "?"
}
@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 = LNCS,
volume = 557,
publisher = "Springer-Verlag",
year = 1991,
pages = "375--384"
}
@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 = IJCGA,
volume = 3,
year = 1993,
pages = "367--382",
keywords = "parallel algorithms, computational geometry,
isothetic rectangles, direct dominance"
}
@inproceedings{cl-flwsf-90,
author = "K. Chan and T. Lam",
title = "Finding least-weight subsequences with fewer
processors",
booktitle = "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms",
series = LNCS,
volume = 450,
publisher = "Springer-Verlag",
year = 1990,
pages = "318--327"
}
@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"
}
@article{cl-olanu-93,
author = "K. F. Chan and T. W. Lam",
title = "An on-line algorithm for navigating in unknown
environment",
journal = IJCGA,
volume = 3,
year = 1993,
pages = "227--244",
keywords = "on-line algorithms, motion-planning,
competitiveness, shortest paths, computational
geometry",
annote = "They consider on-line navigation among a disjoint
set of non-aligned rectangular obstacles, having
aspect ratio at most $r$. They give a strategy that
has competitive ratio $({r\over 2}+1)$, and show
that this is tight."
}
@inproceedings{cl-olanu-91,
author = "K. F. Chan and T. W. Lam",
title = "An on-line algorithm for navigating in unknown
terrain",
booktitle = "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms",
series = LNCS,
volume = 557,
publisher = "Springer-Verlag",
year = 1991,
pages = "127--136"
}
@inproceedings{cc-ompa-97,
author = "K. W. Chan and Francis Y. L. Chin",
title = "Optimal Multiresolution Polygonal Approximation",
booktitle = "Proc. 3rd Ann. Internat. Conf. Computing and
Combinatorics",
nickname = "COCOON '97",
site = "Shanghai, China",
series = LNCS,
volume = 1276,
publisher = "Springer-Verlag",
year = 1997,
pages = "32--41"
}
@article{c-nrdma-85,
author = "M. Y. Chan",
title = "A note on redundant disk modulo allocation",
journal = IPL,
volume = 20,
year = 1985,
pages = "121--123"
}
@inproceedings{c-stsar-94,
author = "T. M. Chan",
title = "A Simple Trapezoid Sweep Algorithm for Reporting
Red/Blue Segment Intersections",
booktitle = CCCG_1994,
year = 1994,
pages = "263--268"
}
@inproceedings{c-annqr-97,
author = "T. M. Chan",
title = "Approximate Nearest Neighbor Queries Revisited",
booktitle = SOCG_1997,
year = 1997,
pages = "352--358"
}
@inproceedings{c-adwse-00,
author = "T. M. Chan",
title = "Approximating the diameter, width, smallest
enclosing cylinder, and minimum-width annulus",
booktitle = SOCG_2000,
year = 2000,
pages = "300--309"
}
@inproceedings{c-dpcho-99,
author = "T. M. Chan",
title = "Dynamic planar convex hull operations in
near-logarithmic amortized time",
booktitle = FOCS_1999,
nickname = "FOCS '99",
year = 1999,
pages = "92--99"
}
@article{c-dpcho-01,
author = "T. M. Chan",
title = "Dynamic planar convex hull operations in
near-logarithmic amortized time",
journal = JACM,
volume = 48,
year = 2001,
pages = "1--12"
}
@inproceedings{c-fdlpq-96,
author = "T. M. Chan",
title = "Fixed-Dimensional Linear Programming Queries Made
Easy",
booktitle = SOCG_1996,
year = 1996,
pages = "284--290"
}
@inproceedings{c-garot-98,
author = "T. M. Chan",
title = "Geometric Applications of a Randomized Optimization
Technique",
booktitle = SOCG_1998,
year = 1998,
pages = "269--278"
}
@article{c-garot-99,
author = "T. M. Chan",
title = "Geometric Applications of a Randomized Optimization
Technique",
journal = DCG,
volume = 22,
number = 4,
year = 1999,
pages = "547--567"
}
@article{c-mptca-99,
author = "T. M. Chan",
title = "More planar two-center algorithms",
journal = CGTA,
volume = 13,
year = 1999,
pages = "189--198"
}
@inproceedings{c-oesd-98,
author = "T. M. Chan",
title = "On enumerating and selecting distances",
booktitle = SOCG_1998,
year = 1998,
pages = "279--286"
}
@article{c-oesd-01,
author = "T. M. Chan",
title = "On enumerating and selecting distances",
journal = IJCGA,
volume = 11,
year = 2001,
pages = "291--304"
}
@inproceedings{c-lac-00,
author = "T. M. Chan",
title = "On Levels in Arrangements of Curves",
booktitle = FOCS_2000,
nickname = "FOCS 2000",
year = 2000,
pages = "219--227"
}
@article{c-oosch-96,
author = "T. M. Chan",
title = "Optimal Output-Sensitive Convex Hull Algorithms in
Two and Three Dimensions",
journal = DCG,
volume = 16,
year = 1996,
pages = "361--368"
}
% also claimed, pages = "369--388"
@article{c-osrch-96,
author = "T. M. Chan",
title = "Output-Sensitive Results on Convex Hulls, Extreme
Points, and Related Problems",
journal = DCG,
volume = 16,
year = 1996,
pages = "369--387"
}
@inproceedings{c-rshrr-98,
author = "T. M. Chan",
title = "Random Sampling, Halfspace Range Reporting, and
Construction of $(\le k)$-Levels in Three
Dimensions",
booktitle = FOCS_1998,
year = 1998,
pages = "586--595"
}
@article{c-rshrr-00,
author = "T. M. Chan",
title = "Random sampling, halfspace range reporting, and
construction of $(\le k)$-levels in three
dimensions",
journal = SICOMP,
volume = 30,
year = 2000,
pages = "561--575"
}
@article{c-rcsiu-00,
author = "T. M. Chan",
title = "Reporting curve segment intersections using
restricted predicates",
journal = CGTA,
volume = 16,
number = 4,
year = 2000,
pages = "245--256"
}
@inproceedings{cgkt-oaars-97,
author = "T. M. Chan and M. T. Goodrich and S. R. Kosaraju and
R. Tamassia",
title = "Optimizing Area and Aspect Ratio in Straight-Line
Orthogonal Tree Drawings",
editor = "S. North",
booktitle = "Graph Drawing (Proc. GD '96)",
series = LNCS,
volume = 1190,
publisher = "Springer-Verlag",
year = 1997,
pages = "63--75",
url = "http://www.cs.brown.edu/cgc/papers/cgkt-oaars-97.ps.gz",
keywords = "graph drawing, upward, tree, planar, straight-line,
orthogonal, CGC, Brown"
}
@inproceedings{csy-oscpf-95,
author = "T. M. Chan and J. Snoeyink and Chee-Keng Yap",
title = "Output-Sensitive Construction of Polytopes in Four
Dimensions and Clipped {Voronoi} Diagrams in Three",
booktitle = SODA_1995,
year = 1995,
pages = "282--291",
keywords = "convex hulls, Voronoi diagram, ultimate convex hull
algorithm"
}
@article{csy-pddpo-97,
author = "T. M. Chan and J. Snoeyink and C. K. Yap",
title = "Primal dividing and dual pruning: Output-sensitive
construction of $4$-d polytopes and $3$-d {Voronoi}
diagrams",
journal = DCG,
volume = 18,
year = 1997,
pages = "433--454"
}
@inproceedings{c-osrch-95,
author = "Timothy M. Y. Chan",
title = "Output-Sensitive Results on Convex Hulls, Extreme
Points, and Related Problems",
booktitle = SOCG_1995,
year = 1995,
pages = "10--19"
}
% ### 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",
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 = LNCS,
volume = 650,
publisher = "Springer-Verlag",
year = 1992,
pages = "378--387"
}
@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 = IJCGA,
volume = 6,
year = 1996,
pages = "59--77"
}
@inproceedings{cc-afodp-97,
author = "Wun-Tat Chan and Francis Y. L. Chin",
title = "Algorithms for Finding Optimal Disjoint Paths Around
a Rectangle",
booktitle = ISAAC_1997,
nickname = "ISAAC '97",
site = "Singapore",
series = LNCS,
volume = 1350,
publisher = "Springer-Verlag",
year = 1997,
pages = "314--323"
}
@inproceedings{cc-eafdp-97,
author = "W.-T. Chan and F. Y. L. Chin",
title = "Efficient algorithms for finding disjoint paths in
grids",
booktitle = SODA_1997,
year = 1997,
pages = "454--463"
}
@article{ck-acp-70,
author = "D. R. Chand and S. S. Kapur",
title = "An algorithm for convex polytopes",
journal = JACM,
volume = 17,
number = 1,
month = jan,
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"
}
@article{c-cssmg-94,
author = "B. Chandra",
title = "Constructing sparse spanners for most graphs in
higher dimensions",
journal = IPL,
volume = 51,
year = 1994,
pages = "289--294"
}
@inproceedings{cdns-nsrgs-92,
author = "B. Chandra and G. Das and G. Narasimhan and
J. Soares",
title = "New sparseness results on graph spanners",
booktitle = SOCG_1992,
year = 1992,
pages = "192--201"
}
@article{cdns-nsrgs-95,
author = "B. Chandra and G. Das and G. Narasimhan and
J. Soares",
title = "New sparseness results on graph spanners",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "125--144",
keywords = "spanners, geometric graphs, greedy algorithm,
transformational method, sparse spanners, euclidean
graphs"
}
@article{ckt-nroko-99,
author = "B. Chandra and H. Karloff and C. Tovey",
title = "New results on the old $k$-opt algorithm for the
traveling salesman problem",
journal = SICOMP,
volume = 28,
year = 1999,
pages = "1998--2029"
}
@inproceedings{ckt-nroko-94,
author = "B. Chandra and H. Karloff and C. Tovey",
title = "New results on the old $k$-opt algorithm for the
{TSP}",
booktitle = SODA_1994,
year = 1994,
pages = "150--159"
}
@techreport{cv-crcns-91,
author = "B. Chandra and S. Vishwanathan",
title = "Constructing reliable communication networks of
small weight on-line",
type = "Manuscript",
institution = "??",
year = 1991
}
@article{cm-paeet-92,
author = "S. Chandran and D. M. Mount",
title = "A parallel algorithm for enclosed and enclosing
triangles",
journal = IJCGA,
volume = 2,
number = 2,
year = 1992,
pages = "191--214",
keywords = "minimum enclosures, convex polygons, parallel
algorithms, rotating calipers"
}
@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"
}
@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"
}
@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
}
@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
}
@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 = JALG,
volume = 19,
year = 1995,
pages = "173--203"
}
@inproceedings{crs-mpc-90,
author = "V. Chandru and V. T. Rajan and R. Swaminathan",
title = "Monotone pieces of chains",
booktitle = CCCG_1990,
year = 1990,
pages = "156--159"
}
@article{crs-mpc-92,
author = "V. Chandru and V. T. Rajan and R. Swaminathan",
title = "Monotone Pieces of Chains",
journal = "ORSA J. Comput.",
volume = 4,
number = 4,
year = 1992,
pages = "439--446",
annote = "Special issue on computational geometry; J. Mitchell
and J. Karel Lenstra, eds."
}
@techreport{cs-hdcg-87,
author = "V. Chandru and R. Samuel",
title = "How to draw a circumscribing gleichdick",
type = "Technical {Report}",
number = "CC-87-36",
institution = "School Indust. Engrg., Purdue Univ.",
address = "West Lafayette, IN",
year = 1987
}
@inproceedings{cv-chosp-91,
author = "V. Chandru and R. Venkataraman",
title = "Circular hulls and orbiforms of simple polygons",
booktitle = SODA_1991,
year = 1991,
pages = "433--440"
}
@article{cld-sgcpm-82,
author = "C. C. Chang and R. C. T. Lee and M. W. Du",
title = "Symbolic gray code as a perfect multiattribute
hashing scheme for partial match queries",
journal = "IEEE Trans. Softw. Eng.",
volume = "SE-8",
year = 1982,
pages = "235--249"
}
@inproceedings{cy-wafi-97,
author = "E.-C. Chang and C. K. Yap",
title = "A wavelet approach to foveating images",
booktitle = SOCG_1997,
year = 1997,
pages = "397--399"
}
@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 = DCG,
volume = 7,
year = 1992,
pages = "1--11"
}
@article{cgs-icmcm-89,
author = "G. Chang and W. Guida and W. Still",
title = "An internal coordinate {Monte}-{Carlo} method for
searching conformational space",
journal = "J. Amer. Chem. Soc.",
volume = 111,
year = 1989,
pages = "4379--4386"
}
@inproceedings{cm-euleg-93,
author = "J. Chang and V. Milenkovic",
title = "An experiment using {LN} for exact geometric
computations",
booktitle = CCCG_1993,
site = "Waterloo, Canada",
year = 1993,
pages = "67--72",
url = "http://www.cs.miami.edu/~vjm/papers.html",
keywords = "robust geometric computation, exact arithmetic"
}
@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 = FOCS_1984,
year = 1984,
pages = "408--416"
}
@article{cy-psppp-86,
author = "J. S. Chang and C. K. Yap",
title = "A polynomial solution for the potato-peeling
problem",
journal = DCG,
volume = 1,
year = 1986,
pages = "155--182"
}
@article{cht-oacov-90,
author = "Maw Shang Chang and Nen-Fu Huang and Chuan-Yi Tang",
title = "An Optimal Algorithm For Constructing Oriented
{Voronoi} Diagrams And Geographic Neighborhood
Graphs",
journal = IPL,
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"
}
@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 = LNCS,
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 = IPL,
volume = 41,
number = 2,
year = 1992,
pages = "99--102",
keywords = "geometric graphs, polygons, decomposition"
}
@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"
}
@book{cgglmw-fltim-92,
author = "B. W. Char and K. O. Geddes and G. H. Gonnet and
B. L. Leong and M. B. Monagan and S. M. Watt",
title = "First leaves: a tutorial introduction to Maple {V}",
publisher = "Springer-Verlag",
address = "New York",
year = 1992
}
@book{cgglmw-m5lrm-91,
author = "B. W. Char and K. O. Geddes and G. H. Gonnet and
B. L. Leong and M. B. Monagan and S. M. Watt",
title = "Maple {V} Language Reference Manual",
publisher = "Springer-Verlag",
address = "New York",
year = 1991
}
@book{cgglmw-mvlrm-91,
author = "Bruce W. Char and Keith O. Geddes and Gaston
H. Gonnet and Benton L. Leong and Micheal B. Monagan
and Stephen M. Watt",
title = "Maple V Language Reference Manual",
publisher = "Springer-Verlag",
address = "New York",
year = 1991
}
@inproceedings{ccfm-icdir-97,
author = "Moses Charikar and Chandra Chekuri and Tom{\'a}s
Feder and Rajeev Motwani",
title = "Incremental Clustering and Dynamic Information
Retrieval",
booktitle = STOC_1997,
year = 1997,
pages = "626--635"
}
@inproceedings{ccgg-rvtda-98,
author = "M. Charikar and C. Chekuri and A. Goel and S. Guha",
title = "Rounding via trees: {D}eterministic approximation
algorithms for group {S}teiner trees and $k$-median",
booktitle = STOC_1998,
year = 1998,
pages = "114--123"
}
@inproceedings{cg-icafl-99,
author = "M. Charikar and S. Guha",
title = "Improved combinatorial algorithms for facility
location and $k$-median problems",
booktitle = FOCS_1999,
year = 1999,
pages = "378--388"
}
@inproceedings{cgts-cfaak-99,
author = "M. Charikar and S. Guha and E. Tardos and D. Shmoys",
title = "A constant-factor approximation algorithm for the
$k$-median problem",
booktitle = STOC_1999,
year = 1999,
pages = "1--10"
}
@inproceedings{chm-dsp-98,
author = "Moses Charikar and D. Halperin and Rajeev Motwani",
title = "The Dynamic Servers Problem",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "410--419",
keywords = "minimum-length monotone subdivision, approximation
algorithms"
}
@article{c-odlp-52,
author = "A. Charnes",
title = "Optimality and degeneracy in linear programming",
journal = "Econometrica",
volume = 20,
number = 2,
year = 1952,
pages = "160--170"
}
@article{cg-pspca-84,
author = "P. Charrot and J. A. Gregory",
title = "A pentagonal surface patch for computer aided
geometric design",
journal = "Comput. Aided Design",
volume = 1,
year = 1984,
pages = "87--94"
}
@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"
}
@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"
}
@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"
}
@article{cd-kdcp-90,
author = "S. Chattopadhyay and P. Das",
title = "The {$k$}-dense corridor problems",
journal = "Pattern Recogn. Lett.",
volume = 11,
year = 1990,
pages = "463--469"
}
@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",
annote = "Computes formulae for number of thin triangulations
(2 ears) and bushy triangulations (max ears) of a
convex polygon."
}
@inproceedings{c-fbfpf-98,
author = "Vasiliki Chatzi",
title = "Finding Basis Functions for Pyramidal Finite
Elements",
booktitle = "CGC Workshop on Geometric Computing",
year = 1998,
url = "http://www.cs.brown.edu/cgc/cgc98/"
}
@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"
}
@article{c-ocfod-90,
author = "B. B. Chaudhuri",
title = "Optimal circular fit to objects in two and hree
dimensions",
journal = "Pattern Recogn. Lett.",
volume = 11,
year = 1990,
pages = "571--574"
}
@article{ck-ocfwd-93,
author = "B. B. Chaudhuri and P. Kundu",
title = "Optimum circular fit to weighted data in
multi-dimensional space",
journal = "Pattern Recogn. Lett.",
volume = 14,
year = 1993,
pages = "1--6"
}
@inproceedings{cn-lerps-99,
author = "J. Chaudhuri and S. C. Nandy",
title = "Largest empty rectangle among a point set",
booktitle = FSTTCS_1999,
series = LNCS,
volume = 1738,
publisher = "Springer-Verlag",
year = 1999,
pages = "34--46"
}
@article{c-dpopp-83,
author = "B. Chazelle",
title = "A decision procedure for optimal polyhedron
partitioning",
journal = IPL,
volume = 16,
year = 1983,
pages = "75--78"
}
@inproceedings{c-fdams-97,
author = "B. Chazelle",
title = "A Faster Deterministic Algorithm for Minimum
Spanning Trees",
booktitle = FOCS_1997,
nickname = "FOCS '97",
year = 1997,
pages = "To appear"
}
@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
}
@article{c-fadsi-88,
author = "B. Chazelle",
title = "A functional approach to data structures and its use
in multidimensional searching",
journal = SICOMP,
volume = 17,
number = 3,
month = jun,
year = 1988,
pages = "427--462"
}
@techreport{c-sptgd-93,
author = "B. 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"
}
@inproceedings{c-salb-94,
author = "B. Chazelle",
title = "A spectral approach to lower bounds",
booktitle = FOCS_1994,
year = 1994,
pages = "674--682"
}
@article{c-salb-98,
author = "B. Chazelle",
title = "A spectral approach to lower bounds with
applications to geometric searching",
journal = SICOMP,
volume = 27,
number = 2,
year = 1998,
pages = "545--556"
}
@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"
}
@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 = IPL,
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 = FOCS_1989,
year = 1989,
pages = "586--591",
keywords = "intersection, polyhedra, polytopes, duality, convex
hulls, Voronoi diagrams"
}
@article{c-oaitd-92,
author = "B. Chazelle",
title = "An optimal algorithm for intersecting
three-dimensional convex polyhedra",
journal = SICOMP,
volume = 21,
number = 4,
year = 1992,
pages = "671--696"
}
@techreport{c-oaitd-89t,
author = "B. Chazelle",
title = "An optimal algorithms for intersecting
three-dimensional convex polyhedra",
type = "Technical {Report}",
institution = "Princeton Univ.",
address = "Princeton, NJ",
year = 1989
}
@inproceedings{c-ochan-91,
author = "B. Chazelle",
title = "An optimal convex hull algorithm and new results on
cuttings",
booktitle = FOCS_1991,
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 = DCG,
volume = 10,
year = 1993,
pages = "377--409"
}
@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 = "145--185",
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 = STOC_1994,
year = 1994,
pages = "75--94"
}
@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 = 4,
edition = "2nd",
publisher = "World Scientific",
year = 1995,
pages = "22--46",
keywords = "survey paper"
}
@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."
}
@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 = LNCS,
volume = 510,
year = 1991,
pages = "686--696"
}
@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"
}
@inproceedings{c-cftvc-84,
author = "B. Chazelle",
title = "Computing on a free tree via complexity preserving
mappings",
booktitle = FOCS_1984,
year = 1984,
pages = "358--368"
}
@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 = STOC_1981,
year = 1981,
pages = "70--79"
}
@article{c-cpplb-84,
author = "B. Chazelle",
title = "Convex partitions of polyhedra: a lower bound and
worst-case optimal algorithm",
journal = SICOMP,
volume = 13,
year = 1984,
pages = "488--507"
}
@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 = DCG,
volume = 9,
number = 2,
year = 1993,
pages = "145--158",
keywords = "partition, divide-and-conquer, hyperplanes"
}
@techreport{c-ept-90,
author = "B. Chazelle",
title = "Efficient Polygon Trinangulation",
number = "CS-TR-249-90",
institution = "Princeton Univ.",
year = 1990
}
@techreport{c-fsram-84,
author = "B. Chazelle",
title = "Fast searching in a real algebraic manifold with
applications to geometric complexity",
type = "Technical {Report}",
number = "84-13",
institution = "Dept. Comput. Sci., Brown Univ.",
address = "Providence, RI",
year = 1984
}
@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 = LNCS,
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 = FOCS_1983,
year = 1983,
pages = "122--132"
}
@article{c-fsnaq-86,
author = "B. Chazelle",
title = "Filtering search: a new approach to query-answering",
journal = SICOMP,
volume = 15,
year = 1986,
pages = "703--724"
}
@inproceedings{c-gcdm-99,
author = "B. Chazelle",
title = "Geometric Complexity and the Discrepancy Method",
booktitle = "Abstracts 15th European Workshop Comput. Geom.",
nickname = "CG '99",
site = "Antibes",
publisher = "INRIA Sophia-Antipolis",
year = 1999,
pages = "21--23"
}
@inproceedings{c-gdr-93,
author = "B. Chazelle",
title = "Geometric Discrepancy Revisited",
booktitle = FOCS_1993,
nickname = "FOCS '93",
year = 1993,
pages = "392--399"
}
@incollection{c-hsh-83,
author = "B. Chazelle",
title = "How to search in history",
booktitle = "??",
series = LNCS,
volume = 158,
year = 1983,
pages = "52--63"
}
@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"
}
@inproceedings{c-iies-84,
author = "B. Chazelle",
title = "Intersecting is easier than sorting",
booktitle = STOC_1984,
year = 1984,
pages = "125--134"
}
@inproceedings{c-lbolr-95,
author = "B. Chazelle",
title = "Lower bounds for off-line range searching",
booktitle = STOC_1995,
year = 1995,
pages = "733--740"
}
@article{c-lbolr-97,
author = "B. Chazelle",
title = "Lower bounds for off-line range searching",
journal = DCG,
volume = 17,
number = 1,
year = 1997,
pages = "53--66"
}
@article{c-lbors1-90,
author = "B. Chazelle",
title = "Lower bounds for orthogonal range searching, {I}:
{T}he reporting case",
journal = JACM,
volume = 37,
year = 1990,
pages = "200--212"
}
@article{c-lbors2-90,
author = "B. Chazelle",
title = "Lower bounds for orthogonal range searching, {II}:
{T}he arithmetic model",
journal = JACM,
volume = 37,
year = 1990,
pages = "439--463"
}
@inproceedings{c-lbcms-86,
author = "B. Chazelle",
title = "Lower bounds on the complexity of multidimensional
searching",
booktitle = FOCS_1986,
year = 1986,
pages = "87--96"
}
@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"
}
@inproceedings{c-ntcos-85,
author = "B. Chazelle",
title = "New techniques for computing order statistics in
{Euclidean} space",
booktitle = SOCG_1985,
year = 1985,
pages = "125--134"
}
@article{c-clps-85,
author = "B. Chazelle",
title = "On the convex layers of a planar set",
journal = "IEEE Trans. Inform. Theory",
volume = "IT-31",
number = 4,
month = jul,
year = 1985,
pages = "509--517"
}
@inproceedings{c-pt-90i,
author = "B. Chazelle",
title = "Polygon Triangulation",
booktitle = "Proceedings of FOCCS",
year = 1990
}
@inproceedings{c-prsig-87,
author = "B. Chazelle",
title = "Polytope range searching and integral geometry",
booktitle = FOCS_1987,
year = 1987,
pages = "1--10"
}
@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"
}
@inproceedings{c-sdssf-85,
author = "B. Chazelle",
title = "Slimming down search structures: {A} functional
approach to algorithm design",
booktitle = FOCS_1985,
year = 1985,
pages = "165--174",
keywords = "searching, data structuring"
}
@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"
}
@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 = "Greenwich, Conn.",
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
}
@inproceedings{c-tsplt-90i,
author = "B. Chazelle",
title = "Triangulating a simple polygon in linear time",
booktitle = FOCS_1990,
year = 1990,
pages = "220--230"
}
@article{c-tsplt-91a,
author = "B. Chazelle",
title = "Triangulating a simple polygon in linear time",
journal = DCG,
volume = 6,
number = 5,
year = 1991,
pages = "485--524"
}
@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"
}
@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"
}
@techreport{ccpy-nubns-84,
author = "B. Chazelle and R. Cole and F. P. Preparata and
C. K. Yap",
title = "New upper bounds for neighbor searching",
number = "CS-84-11",
institution = "Brown Univ.",
address = "Providence, RI",
year = 1984
}
@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"
}
@inproceedings{cdhmst-sdtlt-01,
author = "B. Chazelle and O. Devillers and Ferran Hurtado and
Merc{\`e} Mora and Vera Sacrist{\'a}n and
M. Teillaud",
title = "Splitting a {Delaunay} Triangulation in Linear Time",
booktitle = "Proc. 9th. European Symposiun on Algorithms",
series = LNCS,
volume = 2161,
publisher = "Springer-Verlag",
year = 2001,
pages = "312--320"
}
@article{cdst-spsde-97,
author = "B. Chazelle and D. Dobkin and N. Shouraboura and
A. Tal",
title = "Strategies for polyhedral surface decomposition: An
experimental study",
journal = CGTA,
volume = 7,
year = 1997,
pages = "327--342"
}
@inproceedings{cd-dpicp-79,
author = "B. Chazelle and D. P. Dobkin",
title = "Decomposing a polygon into its convex parts",
booktitle = STOC_1979,
year = 1979,
pages = "38--48"
}
@inproceedings{cd-diec-80,
author = "B. Chazelle and D. P. Dobkin",
title = "Detection is easier than computation",
booktitle = STOC_1980,
year = 1980,
pages = "146--153"
}
@article{cd-icott-87,
author = "B. Chazelle and D. P. Dobkin",
title = "Intersection of convex objects in two and three
dimensions",
journal = JACM,
volume = 34,
number = 1,
month = jan,
year = 1987,
pages = "1--27",
keywords = "polygons, polyhedra, intersection, detection"
}
@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"
}
@inproceedings{cdst-csd-95,
author = "B. Chazelle and David P. Dobkin and N. Shouraboura
and A. Tal",
title = "Convex Surface Decomposition",
booktitle = SOCG_1995,
year = 1995,
pages = "V9--V10",
keywords = "video review"
}
@inproceedings{cdst-spsde-95,
author = "B. Chazelle and David P. Dobkin and N. Shouraboura
and A. Tal",
title = "Strategies for Polyhedral Surface Decomposition:
{An} Experimental Study",
booktitle = SOCG_1995,
year = 1995,
pages = "297--305",
keywords = "convex surfaces"
}
@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 '84",
series = LNCS,
volume = 166,
publisher = "Springer-Verlag",
year = 1984,
pages = "43--54",
keywords = "rectangles, Voronoi diagrams"
}
@article{cdl-cler-86,
author = "B. Chazelle and R. L. {Drysdale, III} and D. T. Lee",
title = "Computing the largest empty rectangle",
journal = SICOMP,
volume = 15,
year = 1986,
pages = "300--315",
keywords = "rectangles, Voronoi diagrams"
}
@techreport{ce-falsi-87,
author = "B. Chazelle and H. Edelsbrunner",
title = "A fast algorithm for line segment intersection and
its extensions",
type = "Manuscript",
institution = "??",
year = 1987
}
@inproceedings{ce-iacko-85,
author = "B. Chazelle and H. Edelsbrunner",
title = "An improved algorithm for constructing $k$th-order
{Voronoi} diagrams",
booktitle = SOCG_1985,
year = 1985,
pages = "228--234"
}
@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"
}
@techreport{ce-oails-88t,
author = "B. Chazelle and H. Edelsbrunner",
title = "An optimal algorithm for intersecting line segments
in the plane",
type = "Technical {Report}",
number = "UIUCDCS-R-1419",
institution = "Dept. Comput. Sci., Univ. of Illinois",
address = "Urbana, IL",
month = mar,
year = 1988
}
@inproceedings{ce-oails-88,
author = "B. Chazelle and H. Edelsbrunner",
title = "An optimal algorithm for intersecting line segments
in the plane",
booktitle = FOCS_1988,
year = 1988,
pages = "590--600",
keywords = "intersection, topological sweep, segments"
}
@article{ce-oails-92,
author = "B. Chazelle and H. Edelsbrunner",
title = "An optimal algorithm for intersecting line segments
in the plane",
journal = JACM,
volume = 39,
number = 1,
year = 1992,
pages = "1--54",
keywords = "intersection, topological sweep, segments"
}
@inproceedings{ce-lsdst-86,
author = "B. Chazelle and H. Edelsbrunner",
title = "Linear space data structures for two types of range
search",
booktitle = SOCG_1986,
year = 1986,
pages = "293--302"
}
@article{ce-lsdst-87,
author = "B. Chazelle and H. Edelsbrunner",
title = "Linear space data structures for two types of range
search",
journal = DCG,
volume = 2,
year = 1987,
pages = "113--126",
keywords = "data structuring, reporting, domination, range
search, point location, directed acyclic graphs,
two-dimensional, three-dimensional"
}
@incollection{ce-oscpr-85a,
author = "B. Chazelle and H. Edelsbrunner",
title = "Optimal solutions for a class of point retrieval
problems",
booktitle = "??",
series = LNCS,
volume = 194,
year = 1985,
pages = "80--89"
}
@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"
}
@inproceedings{cegghss-rspug-91,
author = "B. Chazelle and H. Edelsbrunner and M. Grigni and
L. J. 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 = LNCS,
volume = 510,
publisher = "Springer-Verlag",
year = 1991,
pages = "661--673",
keywords = "ray shooting, simple polygon, geodesics"
}
@article{cegghss-rspug-94,
author = "B. Chazelle and H. Edelsbrunner and M. Grigni and
L. J. 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"
}
@inproceedings{ceggs-ibwen-93,
author = "B. Chazelle and H. Edelsbrunner and M. Grigni and
L. J. Guibas and M. Sharir",
title = "Improved Bounds on Weak $\epsilon$-Nets for Convex
Sets",
booktitle = STOC_1993,
nickname = "STOC '93",
year = 1993,
pages = "495--504"
}
@techreport{ceggss-rspug-90,
author = "B. Chazelle and H. Edelsbrunner and M. Grigni and
L. J. Guibas and M. Sharir and J. Snoeyink",
title = "Ray shooting in polygons using geodesic
triangulations",
type = "Manuscript",
year = 1990
}
@article{ceggsw-ibwen-95,
author = "B. Chazelle and H. Edelsbrunner and M. Grigni and
L. J. Guibas and M. Sharir and E. Welzl",
title = "Improved bounds on weak $\epsilon$-nets for convex
sets",
journal = DCG,
volume = 13,
year = 1995,
pages = "1--15"
}
@article{ceghss-shcp-94,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
J. Hershberger and R. Seidel and M. Sharir",
title = "Selecting heavily covered points",
journal = SICOMP,
volume = 23,
year = 1994,
pages = "1138--1151"
}
@article{cegs-plrav-89,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir",
title = "Point location in real-algebraic varieties and its
applications",
journal = "ICALP",
volume = "??",
year = 1989
}
@article{ceg-ccc-89,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas",
title = "The complexity of cutting complexes",
journal = DCG,
volume = 4,
year = 1989,
pages = "139--181",
keywords = "discrete geometry, optimization, visibility, cell
complexes, arrangements, polytopes, convex,
three-dimensional, directed acyclic graphs"
}
@inproceedings{ceg-cccp-87,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas",
title = "The complexity of cutting convex polytopes",
booktitle = STOC_1987,
year = 1987,
pages = "66--76",
keywords = "discrete geometry, optimization, visibility, cell
complexes, arrangements, polytopes, convex,
three-dimensional, directed acyclic graphs"
}
@inproceedings{ceghss-sdash-90,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
J. Hershberger and R. Seidel and M. Sharir",
title = "Slimming down by adding; selecting heavily covered
points",
booktitle = SOCG_1990,
year = 1990,
pages = "116--127"
}
@techreport{cegpsss-cccll-??,
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 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"
}
@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 = FOCS_1990,
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 = CGTA,
volume = 1,
year = 1992,
pages = "305--323"
}
@inproceedings{cegs-sessr-89,
author = "B. Chazelle and H. Edelsbrunner and L. J. 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 = LNCS,
volume = 372,
publisher = "Springer-Verlag",
year = 1989,
pages = "179--193",
keywords = "cell decomposition, random sampling, triangulation"
}
@article{cegs-sessr-91,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir",
title = "A singly-exponential stratification scheme for real
semi-algebraic varieties and its applications",
journal = TCS,
volume = 84,
year = 1991,
pages = "77--105",
keywords = "cell decomposition, random sampling, triangulation"
}
@techreport{cegs-ablsp-89,
author = "B. Chazelle and H. Edelsbrunner and L. J. 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. J. Guibas and
M. Sharir",
title = "Algorithms for bichromatic line segment problems and
polyhedral terrains",
journal = "Algorithmica",
volume = 11,
year = 1994,
pages = "116--132"
}
@inproceedings{cegs-dwclp-92,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir",
title = "Diameter, width, closest line pair, and parametric
searching",
booktitle = SOCG_1992,
year = 1992,
pages = "120--129"
}
@article{cegs-dwclp-93,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir",
title = "Diameter, width, closest line pair and parametric
searching",
journal = DCG,
volume = 10,
year = 1993,
pages = "183--196"
}
@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 = STOC_1989,
year = 1989,
pages = "382--393",
keywords = "arrangements of lines in 3D, Plucker coordinates,
random sampling, convex hulls"
}
@inproceedings{cegss-cfals-91,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir and J. Snoeyink",
title = "Computing a face in an arrangement of line segments",
booktitle = SODA_1991,
year = 1991,
pages = "441--448",
keywords = "arrangements, randomized incremental algorithm"
}
@article{cegss-cfals-93,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir and J. Snoeyink",
title = "Computing a face in an arrangement of line segments
and related problems",
journal = SICOMP,
volume = 22,
year = 1993,
pages = "1286--1302"
}
@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"
}
@techreport{cf-dvrsi-88t,
author = "B. Chazelle and J. Friedman",
title = "A deterministic view of random sampling and its use
in geometry",
type = "Report",
number = "CS-TR-181-88",
institution = "??",
year = 1988
}
@inproceedings{cf-dvrsi-88,
author = "B. Chazelle and J. Friedman",
title = "A deterministic view of random sampling and its use
in geometry",
booktitle = FOCS_1988,
year = 1988,
pages = "539--549",
keywords = "point location, range search, $d$-dimensional",
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",
annote = "derandomizes with polynomial overhead"
}
@techreport{cf-plh-91,
author = "B. Chazelle and J. Friedman",
title = "Point location among hyperplanes",
type = "Manuscript",
year = 1991
}
@article{cf-plhur-94,
author = "B. Chazelle and J. Friedman",
title = "Point Location among Hyperplanes and Unidirectional
Ray-Shooting",
journal = CGTA,
volume = 4,
year = 1994,
pages = "53--62"
}
@inproceedings{cg-fc-85,
author = "B. Chazelle and L. J. Guibas",
title = "Fractional Cascading",
booktitle = "Proc. Internat. Colloq. Automata Lang. Program.",
year = 1985,
note = "To appear"
}
@inproceedings{cg-fcdst-84,
author = "B. Chazelle and L. J. Guibas",
title = "Fractional Cascading: {A} data structuring technique
with geometric applications",
booktitle = "Efficicent Algorithms Workshop",
site = "Oberwolfach, Germany",
year = 1984
}
@article{cg-fc1ds-86,
author = "B. Chazelle and L. J. Guibas",
title = "Fractional cascading: {I}. {A} data structuring
technique",
journal = "Algorithmica",
volume = 1,
number = 3,
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 = SOCG_1985,
year = 1985,
pages = "135--146"
}
@techreport{cg-vippg-88,
author = "B. Chazelle and L. J. Guibas",
title = "Visibility and Intersection Problems in Plane
Geometry",
type = "Report",
number = "CS-TR-167-88",
institution = "Princeton Univ.",
year = 1988
}
@article{cg-vippg-89,
author = "B. Chazelle and L. J. Guibas",
title