Atjaunināt sīkdatņu piekrišanu

Curve and Surface Reconstruction: Algorithms with Mathematical Analysis [Mīkstie vāki]

(Ohio State University)
  • Formāts: Paperback / softback, 230 pages, height x width x depth: 229x152x13 mm, weight: 340 g, Worked examples or Exercises
  • Sērija : Cambridge Monographs on Applied and Computational Mathematics
  • Izdošanas datums: 03-Mar-2011
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 0521175186
  • ISBN-13: 9780521175180
  • Mīkstie vāki
  • Cena: 59,92 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 230 pages, height x width x depth: 229x152x13 mm, weight: 340 g, Worked examples or Exercises
  • Sērija : Cambridge Monographs on Applied and Computational Mathematics
  • Izdošanas datums: 03-Mar-2011
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 0521175186
  • ISBN-13: 9780521175180
After developing the basics of a sampling theory and its connections to various geometric and topological properties, the author describes a suite of algorithms that have been designed for the reconstruction problem, including algorithms for surface reconstruction from dense samples, from samples that are not adequately dense and from noisy samples.

Many applications in science and engineering require a digital model of a real physical object. Advanced scanning technology has made it possible to scan such objects and generate point samples on their boundaries. This book, first published in 2007, shows how to compute a digital model from this point sample. After developing the basics of sampling theory and its connections to various geometric and topological properties, the author describes a suite of algorithms that have been designed for the reconstruction problem, including algorithms for surface reconstruction from dense samples, from samples that are not adequately dense and from noisy samples. Voronoi- and Delaunay-based techniques, implicit surface-based methods and Morse theory-based methods are covered. Scientists and engineers working in drug design, medical imaging, CAD, GIS, and many other areas will benefit from this first book on the subject.

Recenzijas

'The text is well written, and present the algorithms in a way that makes them quite understandable. Instead of presenting the algorithms as single, monolithic and complex methods, they are broken into parts that can be explained and mathematically analyzed in an order that makes clear how they are later composed into the larger task.' SIGACT News

Papildus informācija

Develops the fundamentals for processing point data into a digital mode and presents algorithms for surface reconstruction.
Preface xi
1 Basics
1(25)
1.1 Shapes
2(6)
1.1.1 Spaces and Maps
3(3)
1.1.2 Manifolds
6(1)
1.1.3 Complexes
7(1)
1.2 Feature Size and Sampling
8(10)
1.2.1 Medial Axis
10(4)
1.2.2 Local Feature Size
14(2)
1.2.3 Sampling
16(2)
1.3 Voronoi Diagram and Delaunay Triangulation
18(5)
1.3.1 Two Dimensions
19(3)
1.3.2 Three Dimensions
22(1)
1.4 Notes and Exercises
23(3)
Exercises
24(2)
2 Curve Reconstruction
26(15)
2.1 Consequences of ε-Sampling
27(3)
2.2 Crust
30(5)
2.2.1 Algorithm
30(2)
2.2.2 Correctness
32(3)
2.3 NN-Crust
35(3)
2.3.1 Algorithm
35(1)
2.3.2 Correctness
36(2)
2.4 Notes and Exercises
38(3)
Exercises
39(2)
3 Surface Samples
41(18)
3.1 Normals
43(7)
3.1.1 Approximation of Normals
43(2)
3.1.2 Normal Variation
45(2)
3.1.3 Edge and Triangle Normals
47(3)
3.2 Topology
50(7)
3.2.1 Topological Ball Property
50(3)
3.2.2 Voronoi Faces
53(4)
3.3 Notes and Exercises
57(2)
Exercises
57(2)
4 Surface Reconstruction
59(21)
4.1 Algorithm
59(11)
4.1.1 Poles and Cocones
59(3)
4.1.2 Cocone Triangles
62(2)
4.1.3 Pruning
64(2)
4.1.4 Manifold Extraction
66(4)
4.2 Geometric Guarantees
70(3)
4.2.1 Additional Properties
72(1)
4.3 Topological Guarantee
73(3)
4.3.1 The Map &nu
73(2)
4.3.2 Homeomorphism Proof
75(1)
4.4 Notes and Exercises
76(4)
Exercises
78(2)
5 Undersampling
80(13)
5.1 Samples and Boundaries
80(3)
5.1.1 Boundary Sample Points
81(1)
5.1.2 Flat Sample Points
82(1)
5.2 Flatness Analysis
83(4)
5.3 Boundary Detection
87(3)
5.3.1 Justification
88(1)
5.3.2 Reconstruction
89(1)
5.4 Notes and Exercises
90(3)
Exercises
91(2)
6 Watertight Reconstructions
93(20)
6.1 Power Crust
93(11)
6.1.1 Definition
94(3)
6.1.2 Proximity
97(2)
6.1.3 Homeomorphism and Isotopy
99(2)
6.1.4 Algorithm
101(3)
6.2 Tight Cocone
104(5)
6.2.1 Marking
105(2)
6.2.2 Peeling
107(2)
6.3 Experimental Results
109(2)
6.4 Notes and Exercises
111(2)
Exercises
111(2)
7 Noisy Samples
113(20)
7.1 Noise Model
113(2)
7.2 Empty Balls
115(4)
7.3 Normal Approximation
119(5)
7.3.1 Analysis
119(3)
7.3.2 Algorithm
122(2)
7.4 Feature Approximation
124(7)
7.4.1 Analysis
126(4)
7.4.2 Algorithm
130(1)
7.5 Notes and Exercises
131(2)
Exercises
132(1)
8 Noise and Reconstruction
133(19)
8.1 Preliminaries
133(3)
8.2 Union of Balls
136(6)
8.3 Proximity
142(2)
8.4 Topological Equivalence
144(5)
8.4.1 Labeling
145(2)
8.4.2 Algorithm
147(2)
8.5 Notes and Exercises
149(3)
Exercises
150(2)
9 Implicit Surface-Based Reconstructions
152(30)
9.1 Generic Approach
152(3)
9.1.1 Implicit Function Properties
153(1)
9.1.2 Homeomorphism Proof
154(1)
9.2 MLS Surfaces
155(4)
9.2.1 Adaptive MLS Surfaces
156(3)
9.3 Sampling Assumptions and Consequences
159(7)
9.3.1 Influence of Samples
162(4)
9.4 Surface Properties
166(6)
9.4.1 Hausdorff Property
167(3)
9.4.2 Gradient Property
170(2)
9.5 Algorithm and Implementation
172(3)
9.5.1 Normal and Feature Approximation
172(1)
9.5.2 Projection
173(2)
9.6 Other MLS Surfaces
175(4)
9.6.1 Projection MLS
175(1)
9.6.2 Variation
176(1)
9.6.3 Computational Issues
176(3)
9.7 Voronoi-Based Implicit Surface
179(1)
9.8 Notes and Exercises
180(2)
Exercises
181(1)
10 Morse Theoretic Reconstructions
182(25)
10.1 Morse Functions and Flows
182(3)
10.2 Discretization
185(7)
10.2.1 Vector Field
185(2)
10.2.2 Discrete Flow
187(3)
10.2.3 Relations to Voronoi/Delaunay Diagrams
190(2)
10.3 Reconstruction with Flow Complex
192(4)
10.3.1 Flow Complex Construction
192(1)
10.3.2 Merging
193(1)
10.3.3 Critical Point Separation
194(2)
10.4 Reconstruction with a Delaunay Subcomplex
196(9)
10.4.1 Distance from Delaunay Balls
196(2)
10.4.2 Classifying and Ordering Simplices
198(3)
10.4.3 Reconstruction
201(1)
10.4.4 Algorithm
202(3)
10.5 Notes and Exercises
205(2)
Exercises
205(2)
Bibliography 207(6)
Index 213