songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Spelling checking bibliography 

Spell check on bibliography
This commit is contained in:
albert-github 2024-05-30 12:07:55 +02:00
parent e90842fd05
commit 8c15e4ba8f
1 changed files with 99 additions and 99 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

198
Documentation/doc/biblio/geom.bib
View File

@ -695,7 +695,7 @@
, 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"
, publisher = "Data Commission of the International Union of Crystallography"
, address = "Bonn/Cambridge/Chester"
, year = 1987
, update = "98.03 bibrelex"
@ -1691,7 +1691,7 @@ cell neighborhood in $O(m)$ time."
, year = 1995
, pages = "267--276"
, issn = "0-89791-724-3"
, keywords = "ray shooting, contrained triangulation, tetrahedra"
, keywords = "ray shooting, constrained triangulation, tetrahedra"
, cites = "am-stl3s-95, as-tsbac-90, be-mgot-92i, b-ct-93, c-cpplb-84, ceg-ccc-89, cp-tncp-90, cs-bst-94, cw-qorss-89, dk-fdpi-82, dk-ladsc-85, e-t-91, hs-parss-95, m-ept-92, mms-qsrs-94, o-agta-87, rs-dt3dn-89, w-stlcn-92t, ZZZ"
, update = "98.07 bibrelex, 98.03 bibrelex, 95.09 mitchell"
}
@ -2353,7 +2353,7 @@ cell neighborhood in $O(m)$ time."
@inproceedings{amv-nacbs-98
, author = "Pankaj K. Agarwal and T. Murali and J. Vitter"
, title = "A new algorithm for constructing binary space partitions for orthogonal rectangles"
, booktitle = "Proc. European Sympos. Algortihms"
, booktitle = "Proc. European Sympos. Algorithms"
, year = 1998
, update = "99.03 agarwal"
}
@ -2942,7 +2942,7 @@ cell neighborhood in $O(m)$ time."
@article{a-lncg-88
, author = "A. Aggarwal"
, title = "Lecture Notes in Computational Geometry"
, journal = "MIT Reserch Seminar Series MIT/LCS/RSS"
, journal = "MIT Research Seminar Series MIT/LCS/RSS"
, volume = 3
, month = aug
, year = 1988
@ -4413,7 +4413,7 @@ cell neighborhood in $O(m)$ time."
@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"
, booktitle = "Proc. Int. Conf. on Parallel Processing"
, year = 1987
, pages = "393--400"
, update = "98.07 bibrelex"
@ -8161,7 +8161,7 @@ cell neighborhood in $O(m)$ time."
, 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"
, organization = "International Geographical Union Commission on Geographic Information Systems, Association for Geographical Information"
, month = sep
, year = 1994
, pages = "190--208"
@ -9887,7 +9887,7 @@ sites with respect to the geodesic metric within a simple $n$-sided polygon."
@incollection{a-rrm-91
, author = "J. Arvo"
, title = "Random rotation matrics"
, title = "Random rotation matrices"
, editor = "J. Arvo"
, booktitle = "Graphics Gems II"
, publisher = "Academic Press"
@ -11248,7 +11248,7 @@ method that uses very different techniques."
@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"
, title = "Optimal parallel algorithm for visibility of a simple polygon from a point"
, booktitle = "Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year = 1989
, pages = "114--123"
@ -11651,7 +11651,7 @@ method that uses very different techniques."
@inproceedings{a-vgsls-96
, author = "Y. Atassi"
, title = "Visibility graph of a set of line sements: {A} dynamic sequential algorithm and its parallel version"
, title = "Visibility graph of a set of line segments: {A} dynamic sequential algorithm and its parallel version"
, booktitle = "Proc. 8th Canad. Conf. Comput. Geom."
, year = 1996
, pages = "246--251"
@ -12787,7 +12787,7 @@ method that uses very different techniques."
, number = 5
, year = 1991
, pages = "39--42"
, keywords = "linear programing, convex hull, oriented matroid"
, keywords = "linear programming, convex hull, oriented matroid"
, update = "95.05 korneenko"
}
@ -13344,7 +13344,7 @@ small factor with respect to floating-point calculation."
, 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
$S-$convex approximation of minimal 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
@ -13454,7 +13454,7 @@ small factor with respect to floating-point calculation."
@incollection{b-ssar-89
, author = "R. {Baeza-Yates}"
, title = "String searching algorthms revisited"
, title = "String searching algorithms revisited"
, booktitle = "??"
, series = "Lecture Notes Comput. Sci."
, volume = 382
@ -14012,7 +14012,7 @@ small factor with respect to floating-point calculation."
, 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"
, comments = "full version appeared as Generation of configuration space obstacles:{II} The moving of algebraic surfaces, the international journal of robotics research 9:1, feb 1990, 92-112"
, cites = "a-hragr-76, ab-arpcs-87, ba-aprcs-86, ab-arpcs3-86, aa-ntsrm-76, bk-gcso2-86, bk-gcso3-87, bfh-sam-86, bcl-casac-82, c-cdmp-84, c-cpplb-84, c-cmpr-71, d-etqti-08, c-dgcs-76, d-mpsdf-84, fa-spbsg-84, f-past-75, grs-kfcg-83, gs-ccrs-86, hh-gabr-86, hk-crcs-85, h-rv-86, kw-gcsmm-79, l-spcsa-83, lw-apcfp-79, lmt-asfms-84, mmp-dgp-85, m-fspcp-85, osb-spps-85, p-mmp-78, r-rrso-80, rv-smcsr-83, ss-pmp2g-83, ss-spps-84, th-otdp-84, u-cdacc-77, w-ac-78, y-amp-85, ZZZ"
, update = "98.03 bibrelex, 93.09 milone+mitchell"
}
@ -16972,7 +16972,7 @@ Contains C code."
@article{b-sbbtd-72
, author = "R. Bayer"
, title = "Symmetric binary B-trees: data structure and maintenace algorithms"
, title = "Symmetric binary B-trees: data structure and maintenance algorithms"
, journal = "Acta Inform."
, volume = 1
, year = 1972
@ -21144,7 +21144,7 @@ where $d > 3 \sqrt 3$ denotes the distance between S and T."
@book{b-ncma-72
, author = "P. Bezier"
, title = "Numerical Control - Mathematics and Aplications"
, title = "Numerical Control - Mathematics and Applications"
, publisher = "John Wiley \& Sons"
, address = "London, UK"
, year = 1972
@ -21199,7 +21199,7 @@ where $d > 3 \sqrt 3$ denotes the distance between S and T."
, booktitle = "Proc. 4th Canad. Conf. Comput. Geom."
, year = 1992
, pages = "365--370"
, keywords = "convex polygons, meshes with muliple broadcasting, diameter, enclosing rectangle, inscribed triangle, time-optimal algorithms, image processing, computer vision"
, keywords = "convex polygons, meshes with multiple broadcasting, diameter, enclosing rectangle, inscribed triangle, time-optimal algorithms, image processing, computer vision"
, cites = "cdr-ultbp-86, ds-gmmmc-79, dh-pcsa-73, fs-dmaer-75, l-ipaaa-92, l-spcsa-83, pl-pdavs-88, ps-cgi-85, rk-dpp-82, t-mss-85, ag-hpc-90, bb-cv-82, blosz-fsamb-92, bps-aamv-89, kr-icmmb-89, losz-sema-, l-cvdmc-85, ml-cascv-89, osz-tosam-92, p-cg-78, pr-apmb-87, v-mvavi-91, v-spa-91, ZZZ"
, update = "98.07 bibrelex"
}
@ -22381,7 +22381,7 @@ where $d > 3 \sqrt 3$ denotes the distance between S and T."
@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"
, title = "A Proof of the Sufficiency of {McMullen}'s Conditions for $f$-vectors of Simplicial Polytopes"
, journal = "J. Combin. Theory Ser. A"
, volume = 31
, number = 3
@ -24037,7 +24037,7 @@ of the output, and the extra storage is {$O(n)$}."
, succeeds = "bcduy-clcst-96"
, cites = "abosy-fmcnp-89, b-cspps-88, bcdy-csp-95, bg-aoscf-95, cegss-cfals-93, dj-cmcnp-90, bds-lric-95, dk-ladsc-85, egs-cmcap-90, ep-mps-88, f-spcrd-86, ka-dd-84, k-eccs-79, k-osps-83, ld-gvdp-81, mt-cppna-85, m-lpltw-84, ms-sapo-95, m-idssp-92, okm-ccs-86"
, update = "01.11 devillers"
, abstract = "A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An $\Theta(n \log n)$ optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowe d to meet only at their endpoints. In the general case, when line segments may intersect $\Omega(n^2)$ times, our algorithm can be adapted to work in $O(n \alpha(n) \log n)$ time and $O(n \alpha(n))$ space, where $\alpha(n)$ represents the extremely slowly growing inverse of the Ackermann function."
, 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. 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
@ -24943,7 +24943,7 @@ present a polynomial-time exact algorithm to solve this problem."
@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"
, title = "An alternating digital tree (ADT) algorithm for $3$D geometric searching and intersection problems"
, journal = "Internat. J. Numer. Methods Eng."
, volume = 31
, year = 1991
@ -25610,7 +25610,7 @@ present a polynomial-time exact algorithm to solve this problem."
@inproceedings{bew-pag-98
, author = "P. Bose and H. Everett and S. K. Wismath"
, title = "Properties of Arragement Graphs"
, title = "Properties of Arrangement Graphs"
, booktitle = "Abstracts 14th European Workshop Comput. Geom."
, nickname = "CG '98"
, site = "Barcelona"
@ -26964,7 +26964,7 @@ and solids on dynamically evolving grids without remeshing."
}
@inproceedings{bbdltv-trodo-99
, author = "Stina Bridgeman and Giuseppe Di Battista and Walter Didimo and Guiseppe Liotta and Roberto Tamassia and Luca Vismara"
, author = "Stina Bridgeman and Giuseppe Di Battista and Walter Didimo and Giuseppe 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"
@ -29040,7 +29040,7 @@ determinants."
@book{b-pgisl-86
, author = "P. A. Burrough"
, title = "Principles of Geographical Information Systems for Land Resourses Assessment"
, title = "Principles of Geographical Information Systems for Land Resources Assessment"
, publisher = "Oxford University Press"
, address = "New York"
, year = 1986
@ -30545,7 +30545,7 @@ determinants."
@inproceedings{c-ennsh-98
, author = "F. Cazals"
, title = "Effective nearest neighbors searching on the hyper-cube, with a pplications to molecular clustering"
, title = "Effective nearest neighbors searching on the hyper-cube, with applications to molecular clustering"
, booktitle = "Proc. 14th Annu. ACM Sympos. Comput. Geom."
, year = 1998
, pages = "222--230"
@ -31157,7 +31157,7 @@ determinants."
@inproceedings{cc-eafdp-97
, author = "W.-T. Chan and F. Y. L. Chin"
, title = "Efficient algorithms for finding disjoint paths in grids"
, booktitle = "Proc. 8th ACM-SIAM Sympos. Discrete Alogrithms"
, booktitle = "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
, year = 1997
, pages = "454--463"
, update = "98.07 bibrelex"
@ -34628,10 +34628,10 @@ graphic and geometric problems."
@incollection{c-cses-67
, author = "S. S. Chern"
, title = "Curves and Surfaces in {E}ucidean Space"
, title = "Curves and Surfaces in {E}uclidean Space"
, editor = "S. S. Chern"
, booktitle = "Studies in Global Geometry and Analaysis"
, series = "MAA Studies in Mathmatics"
, series = "MAA Studies in Mathematics"
, volume = 4
, publisher = "Math. Assoc. Amer."
, year = 1967
@ -34641,10 +34641,10 @@ graphic and geometric problems."
@incollection{c-cses-89
, author = "S. S. Chern"
, title = "Curves and Surfaces in {E}ucidean Space"
, title = "Curves and Surfaces in {E}uclidean Space"
, editor = "S. S. Chern"
, booktitle = "Global Differential Geometry"
, series = "Studies in Mathmatics"
, series = "Studies in Mathematics"
, volume = 27
, publisher = "Math. Assoc. Amer."
, year = 1989
@ -36716,7 +36716,7 @@ avoids overlap. This is useful in cartography."
@article{c-psepg-92
, author = "R. J. Cimikowski"
, title = "Properties of some {Euclidian} proximity graphs"
, title = "Properties of some {Euclidean} proximity graphs"
, journal = "Pattern Recogn. Lett."
, volume = 13
, number = 6
@ -38862,7 +38862,7 @@ data. Contains C code."
@article{c-sscg-86
, author = "R. L. Cook"
, title = "Stochastic sampling in computer graphics"
, journal = "ACM Trans. Grpah."
, journal = "ACM Trans. Graph."
, volume = 5
, year = 1986
, pages = "51--72"
@ -39149,7 +39149,7 @@ data. Contains C code."
@article{cghj-lwfm-93
, author = "Robert M. Corless and Gaston H. Gonnet and D. E. G. Hare and David J. Jeffrey"
, title = "{Lambert's} {W} function in {Maple}"
, journal = "The Maple Techical Newsletter"
, journal = "The Maple Technical Newsletter"
, volume = "Issue 9"
, year = 1993
, pages = "12--22"
@ -41046,7 +41046,7 @@ Contains C code."
}
@inproceedings{dfl-rcems-98
, author = "Fabrizio d'Amore and Paolo G. Franciosa and Guiseppe Liotta"
, author = "Fabrizio d'Amore and Paolo G. Franciosa and Giuseppe Liotta"
, title = "Robust Computation of {Euclidean} Minimum Spanning Trees"
, booktitle = "Abstracts 14th European Workshop Comput. Geom."
, nickname = "CG '98"
@ -42218,7 +42218,7 @@ Contains C code."
@article{d-i2dch-90
, author = "A. M. Day"
, title = "The Implementation of a 2{D} Convex Hull Algorithm Using Pertubation"
, title = "The Implementation of a 2{D} Convex Hull Algorithm Using Perturbation"
, journal = "Comput. Graph. Forum"
, volume = 9
, number = 4
@ -42562,7 +42562,7 @@ Contains C code."
@incollection{dp-scdta-89
, author = "L. {De Floriani} and E. Puppo"
, title = "A survey of constrained {Delaunay} triangulation algorithms for surface representaion"
, title = "A survey of constrained {Delaunay} triangulation algorithms for surface representation"
, editor = "G. G. Pieroni"
, booktitle = "Issues on Machine Vision"
, publisher = "Springer-Verlag"
@ -44092,7 +44092,7 @@ Contains C code."
@article{ds-embrr-92
, author = "H. Desaulniers and N. F. Stewart"
, title = "An extension of manifold boudary representations to the $r$-sets"
, title = "An extension of manifold boundary representations to the $r$-sets"
, journal = "ACM Trans. Graph."
, volume = 11
, number = 1
@ -44789,7 +44789,7 @@ respectively, we obtain a speedup of $\frac p{\log p}$."
, archive = "XXX:cs.CG/9909017"
, precedes = "dm-focoh-99"
, update = "00.03 devillers, 99.11 devillers"
, abstract = "Given a finite set of non-collinear points in the plane there exists a line that passes through exactly two points. Such a line is called an {\em ordinary line}. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et al. In this note we extend this result in two directions. We first show how to use this algorithm to compute an {\em ordinary conic}, that is, a conic passing through exactly five points, assuming that all the points do not lie onthe same conic. Our proof of existence and the consequent algorithm is simpler than previous ones. We also show how to compute an ordinary hyperplane in three and higher dimensions."
, abstract = "Given a finite set of non-collinear points in the plane there exists a line that passes through exactly two points. Such a line is called an {\em ordinary line}. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et al. In this note we extend this result in two directions. We first show how to use this algorithm to compute an {\em ordinary conic}, that is, a conic passing through exactly five points, assuming that all the points do not lie on the same conic. Our proof of existence and the consequent algorithm is simpler than previous ones. We also show how to compute an ordinary hyperplane in three and higher dimensions."
}
@inproceedings{dpt-wt-01
@ -50466,7 +50466,7 @@ library."
@inproceedings{dc-hcpc-80
, author = "P. W. Dymon and S. A. Cook"
, title = "Hardware Complexity and Parallel Comuting"
, title = "Hardware Complexity and Parallel Computing"
, booktitle = "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
, year = 1980
, pages = "360--372"
@ -57053,7 +57053,7 @@ points per bucket (on average) is fastest."
@inproceedings{fm-cpgcs-91
, author = "T. Feder and R. Motwani"
, title = "Clique partitions, graph compression, and speeding up algoithms"
, title = "Clique partitions, graph compression, and speeding up algorithms"
, booktitle = "Proc. 27th Annu. ACM Sympos. Theory Comput."
, year = 1991
, pages = "123--133"
@ -63102,7 +63102,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
@incollection{g-csg-89
, author = "Shmuel Gal"
, title = "Continous Search Games"
, title = "Continuous Search Games"
, booktitle = "Search theory: some recent developments."
, series = "Lecture Notes in pure and applied mathematics"
, volume = 112
@ -63116,7 +63116,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
@book{g-sg-80
, author = "Shmuel Gal"
, title = "Search Games"
, series = "Mathematics in Science and Engeneering"
, series = "Mathematics in Science and Engineering"
, volume = 149
, publisher = "Academic Press"
, address = "New York"
@ -63781,7 +63781,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
@article{gjs-agcpc-76
, author = "M. Garey and D. Johnson and H. So"
, title = "An Apllication of Graph Coloring to Printed Circuit Testing"
, title = "An Application of Graph Coloring to Printed Circuit Testing"
, journal = "IEEE Trans. Circuits Syst."
, volume = "CAS-23"
, number = 10
@ -66056,7 +66056,7 @@ library, used in several other Gems in the book. Contains C code."
@article{gmhhwsbr-cads5-95
, author = "R. Glen and G. Martin and A. Hill and R. Hyde and P. Wollard and J. Salmon and J. Buckingham and A. Robertson"
, title = "Computer-aided design and sythesis of $5$-substituted tryptamines and their pharmacology at the $5-{HT}_{10}$ receptor: {Discovery} of compounds with potential anti-migraine properties"
, title = "Computer-aided design and synthesis of $5$-substituted tryptamines and their pharmacology at the $5-{HT}_{10}$ receptor: {Discovery} of compounds with potential anti-migraine properties"
, journal = "J. Medical Chemistry"
, volume = 38
, year = 1995
@ -67844,7 +67844,7 @@ generated in O(dn2d+1) time. We present a simple proof that the (d -
, author = "M. T. Goodrich"
, title = "Communication-Efficient Parallel Sorting"
, type = "Technical {Report}"
, institution = "Dept. of Computer Science, Johns Hopkins Univeristy"
, institution = "Dept. of Computer Science, Johns Hopkins University"
, year = 1995
, update = "96.09 orourke"
}
@ -67963,7 +67963,7 @@ generated in O(dn2d+1) time. We present a simple proof that the (d -
@inproceedings{g-ilspo-89
, author = "M. T. Goodrich"
, title = "Intersectin line segments in parallel with an output sensitive number of processors"
, title = "Intersecting line segments in parallel with an output sensitive number of processors"
, booktitle = "Proc. 1st ACM Sympos. Parallel Algorithms Architect."
, year = 1989
, pages = "127--137"
@ -69069,7 +69069,7 @@ instance. Contains pseudocode."
@inproceedings{gkm-hzbv-93
, author = "N. Greene and M. Kass and G. Miller"
, title = "Hierachical Z-Buffer Visibility"
, title = "Hierarchical Z-Buffer Visibility"
, booktitle = "Computer Graphics Proceedings, Annu. Conference Series, 1993"
, year = 1993
, pages = "273--278"
@ -76990,7 +76990,7 @@ processing. Contains C code."
, author = "E. G. Hoel and H. Samet"
, title = "Efficient processing of spatial queries in line segment databases"
, editor = "O. G{\"u}nther and H. J. Schek"
, booktitle = "Proc. 2rd Sympos. Advances in Spatial Databases"
, booktitle = "Proc. 2nd Sympos. Advances in Spatial Databases"
, publisher = "Springer-Verlag"
, address = "Berlin, Germany"
, year = 1991
@ -80919,7 +80919,7 @@ fitting method."
, volume = 3
, year = 1996
, pages = "183--186"
, note = "ICIAM95 Proc., Applied Stochastics and Optimzation"
, note = "ICIAM95 Proc., Applied Stochastics and Optimization"
, update = "98.07 bibrelex"
}
@ -81888,7 +81888,7 @@ fitting method."
, title = "Planning Smooth Paths for Mobile Robots"
, editor = "Z. Li and J. F. Canny"
, booktitle = "Nonholonomic Motion Planning"
, publisher = "Kluwer Academic Pubishers"
, publisher = "Kluwer Academic Publishers"
, address = "Norwell, MA"
, year = 1992
, pages = "271--342"
@ -82189,7 +82189,7 @@ fitting method."
@techreport{jp-wcp-93t
, author = "R. Janaardan and F. P. Preparata"
, title = "Widest-corridor problemes"
, title = "Widest-corridor problems"
, type = "Technical Report"
, number = "TR-93-17"
, institution = "Dept. of Computer Science, University of Minnesota"
@ -83207,7 +83207,7 @@ fitting method."
@article{j-episc-48
, author = "F. John"
, title = "Extremum problems with inequalities as subsidary conditions"
, title = "Extremum problems with inequalities as subsidiary conditions"
, journal = "Courant Anniversary"
, volume = "??"
, year = 1948
@ -86151,7 +86151,7 @@ fitting method."
@incollection{k-racpc-72
, author = "R. Karp"
, title = "Reducibility among combinatorical problems of computer computaions"
, title = "Reducibility among combinatorial problems of computer computations"
, editor = "E. Miller and J. W. Thatcher"
, booktitle = "Complexity of Computer Computations"
, publisher = "Plenum Press"
@ -86649,7 +86649,7 @@ the R*-tree."
, institution = "INRIA"
, year = 1996
, update = "02.03 devillers, 97.11 bibrelex"
, abstract = "A set of objects is $k$-pierceable if there exists a set of $k$ poin ts such that each object is pierced by (contains) at least one of these points. Finding the smallest integer $k$ such that a set is $k$-pierceable is NP-complete. In this technical report, we present efficient algorithms for findi ng a piercing set (i.e., a set of $k$ points as above) for several classes of convex objects and small values of $k$. In some of the cases, our algorithms imply known as well as new Helly-type theorems, thus adding to previous results of Danzer and Gr{\"u}nbaum who studied the case of axis-parallel boxes. The problems studied here are related to the collection of optimization problems in which one seeks the smallest scaling factor of a centrally symmetric convex object $K$, so that a set of points can be covered by $k$ congruent homothets of $K$."
, abstract = "A set of objects is $k$-pierceable if there exists a set of $k$ points such that each object is pierced by (contains) at least one of these points. Finding the smallest integer $k$ such that a set is $k$-pierceable is NP-complete. In this technical report, we present efficient algorithms for findi ng a piercing set (i.e., a set of $k$ points as above) for several classes of convex objects and small values of $k$. In some of the cases, our algorithms imply known as well as new Helly-type theorems, thus adding to previous results of Danzer and Gr{\"u}nbaum who studied the case of axis-parallel boxes. The problems studied here are related to the collection of optimization problems in which one seeks the smallest scaling factor of a centrally symmetric convex object $K$, so that a set of points can be covered by $k$ congruent homothets of $K$."
}
@phdthesis{k-grdsc-85
@ -91271,7 +91271,7 @@ some 2 curves cross exponentially many times."
@article{kn-iscpi-90
, author = "J. Kratochvil and J. Ne{\v s}et{\v r}il"
, title = "Independend set and clique problems in intersection-defined classes of graphs"
, title = "Independent set and clique problems in intersection-defined classes of graphs"
, journal = "Comment. Math. Univ. Carol."
, volume = 31
, year = 1990
@ -91584,7 +91584,7 @@ some 2 curves cross exponentially many times."
@inproceedings{kbs-csamc-91
, author = "H.-P. Kriegel and T. Brinkhoff and R. Schneider"
, title = "The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems"
, booktitle = "Proc. 2rd Sympos. Advances in Spatial Databases"
, booktitle = "Proc. 2nd Sympos. Advances in Spatial Databases"
, series = "Lecture Notes Comput. Sci."
, number = 525
, year = 1991
@ -92644,7 +92644,7 @@ some 2 curves cross exponentially many times."
@article{l-ccsda-85
, author = "J. Lagarias"
, title = "The computational complexity of simultaneos {Diophantine} approximation problems"
, title = "The computational complexity of simultaneous {Diophantine} approximation problems"
, journal = "SIAM J. Comput."
, volume = 14
, year = 1985
@ -96116,7 +96116,7 @@ addition to their own purposes before conducting the conversion."
}
@article{kl-bpss-78
, author = "G. A. Kabatjansky ans V. Leven{\v s}te{\v i}n"
, author = "G. A. Kabatjansky and V. Leven{\v s}te{\v i}n"
, title = "Bounds for packings of the sphere and in space"
, journal = "Prob. Information Trans."
, volume = 14
@ -96321,7 +96321,7 @@ addition to their own purposes before conducting the conversion."
@book{lc-nmp-92
, title = "Nonholonomic Motion Planning"
, editor = "Z. Li and J. F. Canny"
, publisher = "Kluwer Academic Pubishers"
, publisher = "Kluwer Academic Publishers"
, address = "Norwell, MA"
, year = 1992
, update = "98.03 mitchell, 97.11 bibrelex"
@ -99046,7 +99046,7 @@ used in many computational geometry algorithms. Contains C++ code."
@inproceedings{l-cmpue-86
, author = "V. J. Lumelsky"
, title = "Continous motion planning in unknown environment for a $3$d cartesian robot arm"
, title = "Continuous motion planning in unknown environment for a $3$d cartesian robot arm"
, booktitle = "Proc. IEEE Internat. Conf. Robot. Autom."
, year = 1986
, pages = "1569--1574"
@ -99815,7 +99815,7 @@ used in many computational geometry algorithms. Contains C++ code."
@incollection{m-ltn-76
, author = "K. Mahler"
, title = "Lectures on transcendental numbres"
, title = "Lectures on transcendental numbers"
, booktitle = "??"
, series = "Lecture Notes Math."
, volume = 546
@ -102187,7 +102187,7 @@ used in many computational geometry algorithms. Contains C++ code."
@techreport{mr-vdbsc-91
, author = "M. L. Maz{\'o}n and T. Recio"
, title = "Voronoi Diagrams Bases on Stricly Convex Distances on the Plane"
, title = "Voronoi Diagrams Bases on Strictly Convex Distances on the Plane"
, type = "Manuscript"
, institution = "Departamento de Matem{\'a}ticas, Universidad del Cantabria"
, address = "Santander, Spain"
@ -105042,7 +105042,7 @@ used in many computational geometry algorithms. Contains C++ code."
@article{m-hpppp-70
, author = "R. E. Miles"
, title = "On the homogenous planar {Poisson} point-process"
, title = "On the homogeneous planar {Poisson} point-process"
, journal = "Math. Biosci."
, volume = 6
, year = 1970
@ -107000,7 +107000,7 @@ problems in computational geometry is presented."
@article{mr-tcomd-93
, author = "N. E. Mn{\"e}v and J{\"u}rgen Richter-Gebert"
, title = "Two constructions of oriented matroids with disconnected extention space"
, title = "Two constructions of oriented matroids with disconnected extension space"
, journal = "Discrete Comput. Geom."
, volume = 10
, year = 1993
@ -108061,7 +108061,7 @@ problems in computational geometry is presented."
@article{mrtt-ddm-53
, author = "T. S. Motzkin and H. Raiffa and G. L. Thompson and R. M. Thrall"
, title = "The Double Desription Method"
, title = "The Double Description Method"
, journal = "Annals of Math. Studies"
, volume = 8
, year = 1953
@ -109902,7 +109902,7 @@ problems in computational geometry is presented."
, title = "Parallel Algorithm Design on the {WPRAM} Model"
, type = "Technical {Report}"
, number = "94.24"
, institution = "School of Computer Science, Univeristy of Leeds"
, institution = "School of Computer Science, University of Leeds"
, year = 1994
, update = "96.09 orourke"
}
@ -111847,7 +111847,7 @@ encapsulated PostScript"
@article{oww-h2ceg-00
, author = "C. {\'O}'D{\'u}nlaing and C. Watt and D. Wilkins"
, title = "Homeomorphism of 2-complexes is equivalent to grap isomorphism"
, title = "Homeomorphism of 2-complexes is equivalent to graph isomorphism"
, journal = "Internat. J. Comput. Geom. Appl."
, volume = 10
, year = 2000
@ -112274,7 +112274,7 @@ distance in two or more dimensions without square roots. Contains C code."
, author = "S. Onn"
, title = "On the {Radon} number of the integer lattice"
, editor = "Ravi Kannan and W. R. Pulleyblank"
, booktitle = "Integer Programmming and Combinatorial Optimization"
, booktitle = "Integer Programming and Combinatorial Optimization"
, publisher = "Univ. Waterloo Press"
, address = "Waterloo, ON"
, year = 1990
@ -115547,7 +115547,7 @@ dither and stipple patterns."
@phdthesis{p-ccmsp-87
, author = "R. S. Palmer"
, title = "Computational Complexity of Motion and Stablility of Polygons"
, title = "Computational Complexity of Motion and Stability of Polygons"
, school = "Cornell Univ."
, address = "Ithaca, NY"
, month = jan
@ -116929,7 +116929,7 @@ dither and stipple patterns."
@inproceedings{pu-osh-87
, author = "D. Peleg and J. Ullman"
, title = "An optimal synchonizer for the hypercube"
, title = "An optimal synchronizer for the hypercube"
, booktitle = "Proc. 6th ACM Symp. on Princ. Distr. Comp."
, year = 1987
, pages = "77--85"
@ -116939,7 +116939,7 @@ dither and stipple patterns."
@article{pu-osh-89
, author = "D. Peleg and J. Ullman"
, title = "An optimal synchonizer for the hypercube"
, title = "An optimal synchronizer for the hypercube"
, journal = "SIAM J. Comput."
, volume = 18
, year = 1989
@ -116970,7 +116970,7 @@ dither and stipple patterns."
@phdthesis{p-caasv-91
, author = "M. Pellegrini"
, title = "Combinatorical and algorithmic analysis of stabbing and visibility problems in $3$-dimensional space"
, title = "Combinatorial and algorithmic analysis of stabbing and visibility problems in $3$-dimensional space"
, school = "Courant Inst. Math. Sci., New York University"
, address = "New York, NY"
, month = feb
@ -117541,8 +117541,8 @@ both for rendering and for modeling. Contains C code."
}
@article{pg-aldit-84
, author = "M. B. Phillips and M. O. Garret"
, title = "An algorithm for locating and displaying the intersection of two arbitary surfaces"
, author = "M. B. Phillips and Garrett M. Odell"
, title = "An algorithm for locating and displaying the intersection of two arbitrary surfaces"
, journal = "IEEE Comput. Graph. Appl."
, volume = "??"
, year = 1984
@ -119117,7 +119117,7 @@ both for rendering and for modeling. Contains C code."
@inproceedings{p-aapfp-91
, author = "D. Priest"
, title = "Algorithms for arbitrary precision floating point arithmetic"
, booktitle = "Proc. 10th Symp. on coputer arithmetic"
, booktitle = "Proc. 10th Symp. on computer arithmetic"
, year = 1991
, pages = "132--143"
, update = "96.05 devillers"
@ -121909,7 +121909,7 @@ Previous title: On-Line Navigation Through Regions of Variable
, update = "93.09 rote"
, annote = "linear-time heuristic for the MAXIMUM bipartite matching
between two sets of $n$ points in the unit square with
an abolute error of $O(n^{5/6})$. For uniformly distributed
an absolute error of $O(n^{5/6})$. For uniformly distributed
points, the $z$ of the value of the maximum matching
satisfies $\lim_{n\to\infty} = (\sqrt{3}+\log(1+\sqrt{2}))/3$
almost surely."
@ -127129,7 +127129,7 @@ geophysicists."
@unpublished{s-nromd-
, author = "F. Santos"
, title = "Non-realizable oriented matroids coming from {Delaunay} triangulations for strictly convex matrics"
, title = "Non-realizable oriented matroids coming from {Delaunay} triangulations for strictly convex matrices"
, note = "in preparation"
, update = "98.11 bibrelex"
}
@ -128227,7 +128227,7 @@ Contains C code."
@inproceedings{sss-chbal-93
, author = "J. P. Schmidt and A. Siegel and A. Srinivasan"
, title = "{Chernoff}-{Hoeffding} Bounds for Applications with Limited Idependence"
, title = "{Chernoff}-{Hoeffding} Bounds for Applications with Limited Independence"
, booktitle = "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
, year = 1993
, pages = "331--340"
@ -131490,7 +131490,7 @@ Contains C code."
@article{s-frbri-80
, author = "U. Shani"
, title = "Filling regions in binary raster images: a graph-theoretical appoach"
, title = "Filling regions in binary raster images: a graph-theoretical approach"
, journal = "Computer graphics"
, volume = 14
, year = 1980
@ -132310,7 +132310,7 @@ Contains C code."
@inproceedings{st-tsms-91
, author = "X. Sheng and U. Tucholke"
, title = "On triangulating suface models for {SLA}"
, title = "On triangulating surface models for {SLA}"
, booktitle = "Proc. 2nd Internat. Conf. on Rapid Prototyping"
, site = "Dayton, OH"
, year = 1991
@ -132518,7 +132518,7 @@ Contains C code."
@techreport{s-cgopl-91
, author = "T. Shermer"
, title = "Convering and Guarding Orthogonal Polygons with $l_k$-Sets"
, title = "Covering and Guarding Orthogonal Polygons with $l_k$-Sets"
, type = "manuscript"
, institution = "Simon Fraser University"
, year = 1991
@ -132527,7 +132527,7 @@ Contains C code."
@article{s-cgpul-91
, author = "T. Shermer"
, title = "Convering and Guarding Polygons Using $L_k$-Sets"
, title = "Covering and Guarding Polygons Using $L_k$-Sets"
, journal = "Geom. Dedicata"
, volume = 37
, year = 1991
@ -135519,7 +135519,7 @@ Contains C code."
@techreport{s-mmp-91
, author = "J.-C. Spehner"
, title = "Merging in maps and pavings"
, title = "Merging in maps and in pavings"
, type = "Research {Report}"
, number = 48
, institution = "Laboratoire de Math{\'e}matiques et Informatique, Universit{\'e} des Haute-Alsace"
@ -135834,7 +135834,7 @@ Contains C code."
@techreport{sntm-amgus-90
, author = "V. Srinivasan and L. R. Nackman and J. Tang and S. N. Meshkat"
, title = "Automatic Mesh Generation unsing the Symmetric Axis Transformation of Polygonal Domains"
, title = "Automatic Mesh Generation using the Symmetric Axis Transformation of Polygonal Domains"
, number = "RC 16132"
, institution = "IBM Res. Center"
, year = 1990
@ -140905,7 +140905,7 @@ code."
@inproceedings{tac-rsmw-92
, author = "C. D. Thomborson and B. Alpern and L. Carter"
, title = "Rectilinear {Steiner} tree minimzation on a workstation"
, title = "Rectilinear {Steiner} tree minimization on a workstation"
, booktitle = "Proc. of the DIMACS Workshop on Comput. Support for Discr. Math."
, year = 1992
, update = "98.11 bibrelex"
@ -141243,7 +141243,7 @@ code."
@article{t-ctud-73
, author = "W. R. Tobler"
, title = "A continous transformation useful for districting"
, title = "A continuous transformation useful for districting"
, journal = "Ann. New York Acad. Sci."
, volume = 219
, year = 1973
@ -141480,7 +141480,7 @@ of geometric optics."
@article{t-dmwhf-63
, author = "A. Toomre"
, title = "On the distibution of matter within highly flattened galaxies"
, title = "On the distribution of matter within highly flattened galaxies"
, journal = "The astrophysical J."
, volume = 138
, year = 1963
@ -141551,7 +141551,7 @@ of geometric optics."
, keywords = "points, matching, segments, intersection"
, update = "96.09 agarwal, 95.09 korneenko"
, abstract = "Given a set of $n$ red and $n$ blue points in the plane,
it is requred to find a nonintersecting red-blue matching,
it is required to find a nonintersecting red-blue matching,
i.e., a set of $n$ nonintersecting line segments that connect
red and blue points in pairs.
\par
@ -144995,7 +144995,7 @@ of geometric optics."
@inproceedings{vbh-hsruc-94
, author = "Andreas Voigtmann and Ludger Becker and Klaus Hinrichs"
, title = "Hierachical Surface Representation Using Constrained {Delaunay} Triangulations"
, title = "Hierarchical Surface Representation Using Constrained {Delaunay} Triangulations"
, booktitle = "Abstracts 10th European Workshop Comput. Geom."
, nickname = "CG '94"
, site = "Santander"
@ -145126,7 +145126,7 @@ of geometric optics."
@article{vs-dctds-91
, author = "G. Vriend and C. Sander"
, title = "Detection of common three-dimensional substructures in proteins"
, journal = "PROTEINS: Structure, Funcion, and Genetics"
, journal = "PROTEINS: Structure, Function, and Genetics"
, volume = 11
, year = 1991
, pages = "52--58"
@ -145144,7 +145144,7 @@ of geometric optics."
@book{w-rfeb-
, author = "E. Wachspress"
, title = "A Rational Finite Elemente Basis"
, title = "A Rational Finite Element Basis"
, publisher = "Academic Press"
, address = "New York, NY"
, year = "??"
@ -145237,12 +145237,12 @@ of geometric optics."
@article{w-ortdc-93
, author = "D. Wagner"
, title = "Optimal routing through dense chanels"
, title = "Optimal routing through dense channels"
, journal = "Internat. J. Comput. Geom. Appl."
, volume = 3
, year = 1993
, pages = "269--289"
, keywords = "VLSI design, knock knee chanel routing, wire length, number of bends, layer assignment"
, keywords = "VLSI design, knock knee channel routing, wire length, number of bends, layer assignment"
, succeeds = "w-nakkc-91"
, update = "96.09 devillers"
}
@ -146841,7 +146841,7 @@ Contains C code."
@book{w-cem-99
, author = "E. W. Weisstein"
, title = "CRC Concise Encylopedia of Mathematics"
, title = "CRC Concise Encyclopedia of Mathematics"
, publisher = "CRC Press LLC"
, address = "Boca Raton, FL"
, year = 1999
@ -147768,7 +147768,7 @@ Contains C code."
@article{w-ffcmf-77
, author = "D. Whitney"
, title = "Force feedback control of manipulator fine motions"
, journal = "Journal of Dynamic Systems, Measurment and Control"
, journal = "Journal of Dynamic Systems, Measurement and Control"
, volume = "??"
, month = jun
, year = 1977
@ -148150,7 +148150,7 @@ Contains C code."
@techreport{w-cpadv-90
, author = "J. Wilhelms"
, title = "A Coherent Projection Appoach for Direct Volume Rendering"
, title = "A Coherent Projection Approach for Direct Volume Rendering"
, type = "Technical Report"
, number = "UCSC-CRL-90-38"
, institution = "Computer Research Laboratory, University of California"
@ -148605,7 +148605,7 @@ Contains C code."
@article{w-tbcav-87
, author = "P. M. H. Wilson"
, title = "Towards Birational Classfication of Algebraic Varieties"
, title = "Towards Birational Classification of Algebraic Varieties"
, journal = "Bull. London Math. Soc."
, volume = 19
, year = 1987
@ -148705,7 +148705,7 @@ Contains C code."
@article{w-aspep-85
, author = "P. Winter"
, title = "An algortihm for the {Steiner} problem in the {Euclidean} plane"
, title = "An algorithm for the {Steiner} problem in the {Euclidean} plane"
, journal = "Networks"
, volume = 15
, year = 1985
@ -150075,7 +150075,7 @@ code."
, update = "98.03 mitchell, 96.05 mitchell"
, annote = "They consider shortest paths (also MST) in the $L_1$ geodesic
metric. They use a path-preserving graph approach, together with
segment draggin. For a set of disjoint rectilinear obstacles
segment dragging. For a set of disjoint rectilinear obstacles
having $m$ edges, $t$ of which are ``extreme'' (locally -- having
both adjacent edges on the same side of the line through the edge),
they compute a shortest path in time $O(m\log t+ t\log^{3/2} t)$, using
@ -150723,7 +150723,7 @@ This improves previous bound of $O(mt+m\log m)$ in
, address = "Singapore"
, year = 1995
, pages = "452--492"
, keywords = "survey paper, numeral computing, exact compuation, fixed-precision, multiprecision number packages"
, keywords = "survey paper, numeral computing, exact computation, fixed-precision, multiprecision number packages"
, update = "98.07 icking+vismara, 97.11 icking, 97.03 devillers+pocchiola"
, abstract = "A survey of the approaches to non-robustness of geometric algorithms, and especially the exact computation approach. Also surveys available big-number packages."
}
@ -151202,7 +151202,7 @@ This improves previous bound of $O(mt+m\log m)$ in
@incollection{z-1aasp-92
, author = "A. Z. Zelikovsky"
, title = "An $11/8$-approximation algorithm for the {Steiner} problem on networks with rectilinear distance"
, booktitle = "Sets, Graphs and Nubers"
, booktitle = "Sets, Graphs and Numbers"
, series = "Colloquia Mathematica Societatis J{\'a}nos Bolyai"
, volume = 60
, publisher = "??"