COVID-19 Update: We are currently shipping orders daily. However, due to transit disruptions in some geographies, deliveries may be delayed. To provide all customers with timely access to content, we are offering 50% off Science and Technology Print & eBook bundle options. Terms & conditions.
Machine Intelligence and Pattern Recognition - 1st Edition - ISBN: 9780444878069, 9781483257112

Machine Intelligence and Pattern Recognition, Volume 2

1st Edition

Editor: Godfried T. Toussaint
eBook ISBN: 9781483257112
Imprint: North Holland
Published Date: 1st January 1985
Page Count: 472
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST

Institutional Subscription

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Table of Contents


Optimal Parallel Algorithms for Selection, Sorting and Computing Convex Hulls

Simple On-Line Algorithms for Convex Polygons

On Geometric Algorithms that Use the Furthest-Point Voronoi Diagram

Optimal Convex Decompositions

Expected Time Analysis of Algorithms in Computational Geometry

Practical Use of Bucketing Techniques in Computational Geometry

Minimum Decompositions of Polygonal Objects

A Framework for Computational Morphology

Display of Visible Edges of a Set of Convex Polygons

An Implementation Study of Two Algorithms for the Minimum Spanning Circle Problem

Curve Similarity via Signatures

A Method for Proving Lower Bounds for Certain Geometric Problems

Movable Separability of Sets

Computational Geometry and Motion Planning

An Isothetic View of Computational Geometry


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.


No. of pages:
© North Holland 1985
1st January 1985
North Holland
eBook ISBN:

Ratings and Reviews

About the Editor

Godfried T. Toussaint