Titlebook: Computational Geometry and its Applications; CG ‘88 International Hartmut Noltemeier Conference proceedings 1988 Springer-Verlag Berlin Hei

赏心悦目

雄辩

Global Random Search: Extensions,An algorithm is presented for the following problem: Given . convex polyhedra of . vertices each, determine whether they have a point in common. The running time of the algorithm is .(κ log κ log..).

Flatus

A sweep algorithm for the all-nearest-neighbors problem,The 2-dimensional all-nearest-neighbors problem is solved directly in asymptotically optimal time O(n*log n) using a simple plane-sweep algorithm. We present the algorithm, its analysis, and a "foolproof" implementation which guarantees an exact result at the cost of using five-fold-precision rational arithmetic.

EVICT

On continuous homotopic one layer routing,We give an O(n. · log n) time and O(n.) space algorithm for the continuous homotopic one layer routing problem. The main contribution is an extension of the sweep paradigm to a universal cover space of the plane.

endoscopy

下垂

,On the detection of a common intersection of κ convex polyhedra,An algorithm is presented for the following problem: Given . convex polyhedra of . vertices each, determine whether they have a point in common. The running time of the algorithm is .(κ log κ log..).

BROTH

nephritis

芳香一点

Conquest

https://doi.org/10.1007/b129604 engineering design. The generation of smooth surfaces from a set of three-dimensional data points is a key problem in this field. The purpose of this paper is to present algorithms for designing and testing smooth free-form surfaces.