Showing papers on "Computational geometry published in 1979"

Computational Geometry for Design and Manufacture

Abstract: Focusing on the mathematical techniques for the representation, analysis and synthesis of 'shape information' by computers. There is a discussion of splines and related means for defining composite curves and 'patched' surfaces, and coverage of both parametric and non-parametric techniques. The book is primarily concerned with the mathematics of the various methods. A good introductory text to surface modeling

Algorithms for Reporting and Counting Geometric Intersections

Abstract: An interesting class of "geometric intersection problems" calls for dealing with the pairwise intersections among a set of N objects in the plane, These problems arise in many applications such as printed circuit design, architectural data bases, and computer graphics. Shamos and Hoey have described a number of algorithms for detecting whether any two objects in a planar set intersect. In this paper we extend their work by giving algorithms that count the number of such intersections and algorithms that report all such intersections.

A Note on Locating a Set of Points in a Planar Subdivision

Abstract: In this note we algorithmically show that a set of k points can be located in the planar subdivision induced by a straight-line planar graph with n vertices in time $O(k\log k) + O(n) + O(k\log n)$, given a preprocessing time $O(n\log n)$.