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

Cupidity

confederacy

coltish

Triangulating a monotone polygon in parallel,ting diagonals. We propose an .(log .)-time algorithm for triangulating monotone .-sided polygons using only ./log . processors in the CREW-PRAM model. This improves on the previously best bound of .(log .) time using . processors.

assail

过份好问

Automatizing geometric proofs and constructions,t has been axiomatized systematically by D. Hilbert, in the beginning of this century [HIL 71]. Nevertheless, for most algorithms of "Computational Geometry" the algebraic interpretation of Geometry is of greater importance (see, e.g. [SHA

SOW

expdient

Interlocking

亵渎

眉毛

Random Measures and Point Processes,eprocessing is allowed. This problem arises in geometric database systems. More specifically it is equivalent to computing the . join of geo-relational algebra, a conceptual model for geo-data management. We describe efficient algorithms for solving this problem based on plane-sweep and divide-and-c