zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Computational geometry. An introduction. (English) Zbl 0575.68059
Texts and Monographs in Computer Science. New York etc.: Springer-Verlag. XII, 390 p. DM 148.00 (1985).
Computational Geometry concerns with systematic study of geometric algorithms. The beauty of problems attracted many researchers and in the past decade computational geometry took a strong development. This book offers a panoramic view of computational geometry informing the reader about the basic concepts and algorithms. For each presented algorithm its time-complexity is evaluated. The contents of the book include geometric searching and retrieval, convex hull constructions and related problems, proximity, intersection, and the geometry of rectangles. The rigorous presentation of problems, the numerous examples, and the suggestive figures make the book accessible for a large number of readers.
Reviewer: D.Lucanu

MSC:
68U05Computer graphics; computational geometry
68P10Searching and sorting
05B25Finite geometries (combinatorics)
68Q25Analysis of algorithms and problem complexity
68-01Textbooks (computer science)
05-01Textbooks (combinatorics)