Computational geometry edited. Machine intelligence and pattern recognition 2.

Godfried T. Toussaint

ISBN 10: 0444878068 / ISBN 13: 9780444878069

Published by Amsterdam, North-Holland [1985]., 1985

About this Item

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 65 TOU 9780444878069 Sprache: Englisch Gewicht in Gramm: 550.

Seller Inventory # 2502129

Bibliographic Details

• Title: Computational geometry edited. Machine intelligence and pattern recognition 2.
• Publisher: Amsterdam, North-Holland [1985].
• Publication Date: 1985
• Language: English
• ISBN 10: 0444878068
• ISBN 13: 9780444878069
• Binding: Hardcover
• Weight: 550 grams
• Seller catalogs:
  • SA MATHEMATIK

About this title

Synopsis

Machine Intelligence and Pattern Recognition, Volume 2: Computational Geometry focuses on the operations, processes, methodologies, and approaches involved in computational geometry, including algorithms, polygons, convex hulls, and bucketing techniques. The selection first ponders on optimal parallel algorithms for selection, sorting, and computing convex hulls, simple on-line algorithms for convex polygons, and geometric algorithms that use the furthest-point Voronoi diagram. Discussions focus on algorithms that use the furthest-point Voronoi diagram, intersection of a convex polygon and a halfplane, point insertion, convex hulls and polygons and their representations, and parallel algorithm for selection and computing convex hulls. The text then examines optimal convex decompositions, expected time analysis of algorithms in computational geometry, and practical use of bucketing techniques in computational geometry. The book takes a look at minimum decompositions of polygonal objects, framework for computational morphology, display of visible edges of a set of convex polygons, and implementation study of two algorithms for the minimum spanning circle problem. Topics include rolling algorithm, shape of point sets, and decomposition of rectilinear and simple polygons and polygons with holes. The selection is a valuable source of data for researchers interested in computational geometry.