TL;DR: In this paper, the mathematical techniques for the representation, analysis and synthesis of shape information by computers are discussed, and splines and related means for defining composite curves and "patched" surfaces are discussed.
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
TL;DR: This paper proposes to remesh an arbitrary surface onto a completely regular structure the authors call a geometry image, which captures geometry as a simple 2D array of quantized points.
Abstract: Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, which has advantages for many graphics applications. However, current techniques for remeshing arbitrary surfaces create only semi-regular meshes. The original mesh is typically decomposed into a set of disk-like charts, onto which the geometry is parametrized and sampled. In this paper, we propose to remesh an arbitrary surface onto a completely regular structure we call a geometry image. It captures geometry as a simple 2D array of quantized points. Surface signals like normals and colors are stored in similar 2D arrays using the same implicit surface parametrization --- texture coordinates are absent. To create a geometry image, we cut an arbitrary mesh along a network of edge paths, and parametrize the resulting single chart onto a square. Geometry images can be encoded using traditional image compression algorithms, such as wavelet-based coders.
TL;DR: A collection of theorems and proofs automatically generated by computers about the Hilbert intersection point Theorems are presented.
Abstract: The Hilbert intersection point theorems the constructive theorems the Hilbert intersection point theorems in solid geometry a collection of theorems and proofs automatically generated by computers.
TL;DR: The authors present a closed-form, physically based solution for recovering a three-dimensional (3-D) solid model from collections of 3-D surface measurements that is overconstrained and unique except for rotational symmetries.
Abstract: The authors present a closed-form, physically based solution for recovering a three-dimensional (3-D) solid model from collections of 3-D surface measurements. Given a sufficient number of independent measurements, the solution is overconstrained and unique except for rotational symmetries. The proposed approach is based on the finite element method (FEM) and parametric solid modeling using implicit functions. This approach provides both the convenience of parametric modeling and the expressiveness of the physically based mesh formulation and, in addition, can provide great accuracy at physical simulation. A physically based object-recognition method that allows simple, closed-form comparisons of recovered 3-D solid models is presented. The performance of these methods is evaluated using both synthetic range data with various signal-to-noise ratios and using laser rangefinder data. >