Curve and surface reconstruction: Algorithms with by Tamal K. Dey

By Tamal K. Dey

Many functions in technological know-how and engineering require a electronic version of a true actual item. complex scanning expertise has made it attainable to experiment such items and generate element samples on their obstacles. This booklet indicates how you can compute a electronic version from this element pattern. After constructing the fundamentals of sampling concept and its connections to varied geometric and topological homes, the writer describes a collection of algorithms which have been designed for the reconstruction challenge, together with algorithms for floor reconstruction from dense samples, from samples that aren't accurately dense and from noisy samples. Voronoi and Delaunay dependent suggestions, implicit floor established tools and Morse conception established equipment are coated. Scientists and engineers operating in drug layout, scientific imaging, CAD, GIS, and plenty of different parts will make the most of this primary e-book at the topic.

Show description

Read or Download Curve and surface reconstruction: Algorithms with mathematical analysis PDF

Similar differential geometry books

Minimal surfaces and Teichmuller theory

The notes from a suite of lectures writer introduced at nationwide Tsing-Hua collage in Hsinchu, Taiwan, within the spring of 1992. This notes is the a part of ebook "Thing Hua Lectures on Geometry and Analisys".

Complex, contact and symmetric manifolds: In honor of L. Vanhecke

This ebook is concentrated at the interrelations among the curvature and the geometry of Riemannian manifolds. It includes study and survey articles in accordance with the most talks added on the foreign Congress

Differential Geometry and the Calculus of Variations

During this e-book, we learn theoretical and useful points of computing tools for mathematical modelling of nonlinear structures. a couple of computing thoughts are thought of, corresponding to tools of operator approximation with any given accuracy; operator interpolation thoughts together with a non-Lagrange interpolation; tools of process illustration topic to constraints linked to techniques of causality, reminiscence and stationarity; tools of procedure illustration with an accuracy that's the most sensible inside a given category of versions; tools of covariance matrix estimation;methods for low-rank matrix approximations; hybrid tools in line with a mixture of iterative techniques and most sensible operator approximation; andmethods for info compression and filtering below situation filter out version should still fulfill regulations linked to causality and sorts of reminiscence.

Extra resources for Curve and surface reconstruction: Algorithms with mathematical analysis

Sample text

The Delaunay triangulation form a planar graph since no two Delaunay edges intersect in their interiors. It follows from the property of planar graphs that the number of Delaunay edges is at most 3n − 6 for a set of n points. The number of Delaunay triangles is at most 2n − 4. This means that the dual Voronoi diagram also has at most 3n − 6 Voronoi edges and 2n − 4 Voronoi vertices. The Voronoi diagram and the Delaunay triangulation of a set of n points in the plane can be computed in O(n log n) time and O(n) space.

This subset is homeomorphic to a space which is formed by taking the product of Sk−1 with the closed unit interval I in R and then collapsing one of its boundary to a single point, that is, the quotient space (Sk−1 × I )/(Sk−1 × {0}). This space is a k-ball which contradicts the fact that B ∩ is not a k-ball to begin with. Therefore, as B is continually shrunk, it becomes tangent to at a point y = m. Apply the previous argument to claim that B has a medial axis point. 8 illustrates the different cases of Feature Ball Lemma in R2 .

8(b). If pq is not correct, γ contains a sample point, say s, between p and q inside B. Again, we reach a contradiction as p − s < p − q . Next we show that edges connecting a sample point to its half neighbors are also correct. 9 (Half Neighbor). An edge pq where q is a half neighbor of p is correct when ε < 13 . → makes Proof. Let r be the nearest neighbor of p. According to the definition − pq − → π at least 2 angle with pr . If pq is not correct, consider the correct edge ps incident to p other than → → pr for pr .

Download PDF sample

Rated 4.51 of 5 – based on 15 votes