Effective Computational Geometry for Curves and Surfaces
Computational geometry emerged as a discipline in the seventies and has had considerable success in improving the asymptotic complexity of the solutions to basic geometric problems including constructions of data structures,convex hulls, triangulations, Voronoi diagrams and geometric arrangements as well as geometric optimisation. The goal of this book is to take into consideration the multidisciplinary nature of the problem and to provide solid mathematical and algorithmic foundations for effiective computational geometry fo rcurves and surfaces. This book covers two main approaches. In a first part, we discuss exact geometric algorithms for curves and s- faces. We revisit two prominent data structures of computational geometry, namely arrangements (Chap. 1) and Voronoi diagrams (Chap. 2) in order to understand how these structures, which are well-known for linear objects, behave when de?ned on curved objects.
Computational Methods for Algebraic Spline Surfaces : ESF Exploratory Workshop
The papers included in this volume provide an overview about the state-of-the-art in approximative implicitization and various related topics, including both the theoretical basis and the existing computational techniques. The novel idea of approximate implicitization has strengthened the existing link between Computer Aided Geometric Design and classical algebraic geometry. There is a growing interest from researchers and professionals both in CAGD and Algebraic Geometry, to meet and combine knowledge and ideas, in order to better solve industrial--type challenges, as well as to initiate new directions for basic research. This volume will support this exchange of ideas between the various communities.

