Muutke küpsiste eelistusi

E-raamat: Isosurfaces: Geometry, Topology, and Algorithms [Taylor & Francis e-raamat]

(Ohio State University, Columbus, USA)
  • Formaat: 488 pages, 228 Illustrations, color; 228 Illustrations, black and white
  • Ilmumisaeg: 24-Jun-2013
  • Kirjastus: A K Peters
  • ISBN-13: 9780429101861
  • Taylor & Francis e-raamat
  • Hind: 166,18 €*
  • * hind, mis tagab piiramatu üheaegsete kasutajate arvuga ligipääsu piiramatuks ajaks
  • Tavahind: 237,40 €
  • Säästad 30%
  • Formaat: 488 pages, 228 Illustrations, color; 228 Illustrations, black and white
  • Ilmumisaeg: 24-Jun-2013
  • Kirjastus: A K Peters
  • ISBN-13: 9780429101861
"Ever since Lorensen and Cline published their paper on the marching cubes algorithm, isosurfaces have been a standard technique for the visualization of 3D volumetric data. Yet there is no book exclusively devoted to isosurfaces. This book presents the basic algorithms for isosurface construction and gives a rigorous mathematical perspective to some of the algorithms and results. It offers a solid introduction to research in this area as well as an organized overview of the various algorithms associatedwith isosurfaces"--



Ever since Lorensen and Cline published their paper on the Marching Cubes algorithm, isosurfaces have been a standard technique for the visualization of 3D volumetric data. Yet there is no book exclusively devoted to isosurfaces. Isosurfaces: Geometry, Topology, and Algorithms represents the first book to focus on basic algorithms for isosurface construction. It also gives a rigorous mathematical perspective on some of the algorithms and results.

In color throughout, the book covers the Marching Cubes algorithm and variants, dual contouring algorithms, multilinear interpolation, multiresolution isosurface extraction, isosurfaces in four dimensions, interval volumes, and contour trees. It also describes data structures for faster isosurface extraction as well as methods for selecting significant isovalues.

For designers of visualization software, the book presents an organized overview of the various algorithms associated with isosurfaces. For graduate students, it provides a solid introduction to research in this area. For visualization researchers, the book serves as a reference to the vast literature on isosurfaces.

Preface xi
Acknowledgments xiii
1 Introduction
1(16)
1.1 What Are Isosurfaces?
1(2)
1.2 Applications of Isosurfaces
3(1)
1.3 Isosurface Properties
4(2)
1.4 Isosurface Construction
6(1)
1.5 Limitations of Isosurfaces
7(1)
1.6 Multivalued Functions and Vector Fields
8(1)
1.7 Definitions and Basic Techniques
9(8)
2 Marching Cubes and Variants
17(38)
2.1 Definitions
17(1)
2.2 Marching Squares
18(12)
2.3 Marching Cubes
30(15)
2.4 Marching Tetrahedra
45(7)
2.5 Notes and Comments
52(3)
3 Dual Contouring
55(42)
3.1 Definitions
56(1)
3.2 Surface Nets
57(18)
3.3 Dual Marching Cubes
75(15)
3.4 Comparison of Algorithms
90(3)
3.5 Notes and Comments
93(4)
4 Multilinear Interpolation
97(18)
4.1 Bilinear Interpolation: 2D
98(4)
4.2 The Asymptotic Decider: 3D
102(8)
4.3 Trilinear Interpolation
110(3)
4.4 Notes and Comments
113(2)
5 Isosurface Patch Construction
115(46)
5.1 Definitions and Notation
116(2)
5.2 Isosurface Patch Construction
118(4)
5.3 Isosurface Table Construction
122(1)
5.4 Marching Polyhedra Algorithm
123(20)
5.5 Isohull
143(16)
5.6 Notes and Comments
159(2)
6 Isosurface Generation in 4D
161(48)
6.1 Definitions and Notation
162(2)
6.2 Isosurface Table Generation in 4D
164(7)
6.3 Marching Hypercubes
171(19)
6.4 Marching Simplices
190(8)
6.5 Marching Polytopes
198(5)
6.6 IsoHull4D
203(3)
6.7 4D Surface Nets
206(2)
6.8 Notes and Comments
208(1)
7 Interval Volumes
209(30)
7.1 Definitions and Notation
210(1)
7.2 MCVol
211(3)
7.3 Automatic Table Generation
214(5)
7.4 MCVol Interval Volume Properties
219(13)
7.5 Tetrahedral Meshes
232(3)
7.6 Convex Polyhedral Meshes
235(3)
7.7 Notes and Comments
238(1)
8 Data Structures
239(42)
8.1 Uniform Grid Partitions
241(1)
8.2 Octrees
242(11)
8.3 Span Space Priority Trees
253(11)
8.4 Seed Sets
264(14)
8.5 Notes and Comments
278(3)
9 Multiresolution Tetrahedral Meshes
281(36)
9.1 Bisection of Tetrahedra
282(10)
9.2 Multiresolution Isosurfaces
292(23)
9.3 Notes and Comments
315(2)
10 Multiresolution Polyhedral Meshes
317(38)
10.1 Multiresolution Convex Polyhedral Mesh
318(16)
10.2 Multiresolution Surface Nets
334(5)
10.3 Multiresolution in 4D
339(13)
10.4 Notes and Comments
352(3)
11 Isovalues
355(24)
11.1 Counting Grid Vertices
357(6)
11.2 Counting Grid Edges and Grid Cubes
363(6)
11.3 Measuring Gradients
369(7)
11.4 Notes and Comments
376(3)
12 Contour Trees
379(44)
12.1 Examples of Contour Trees
379(4)
12.2 Definition of Contour Tree
383(6)
12.3 Join, Split, and Merge Trees
389(5)
12.4 Constructing Join, Split, and Merge Trees
394(6)
12.5 Constructing Contour Trees
400(7)
12.6 Theory and Proofs
407(9)
12.7 Simplification of Contour Trees
416(2)
12.8 Applications
418(2)
12.9 Notes and Comments
420(3)
A Geometry
423(4)
A.1 Affine Hull
423(1)
A.2 Convexity
423(1)
A.3 Convex Polytope
424(1)
A.4 Simplex
425(1)
A.5 Barycentric Coordinates
425(1)
A.6 Linear Function
426(1)
A.7 Congruent and Similar
426(1)
B Topology
427(18)
B.1 Interiors and Boundaries
427(1)
B.2 Homeomorphism
428(1)
B.3 Manifolds
429(1)
B.4 Triangulations
430(1)
B.5 Convex Polytopal Meshes
430(1)
B.6 Orientation
431(1)
B.7 Piecewise Linear Functions
432(1)
B.8 Paths and Loops
433(1)
B.9 Separation
434(1)
B.10 Compact
434(1)
B.11 Connected
435(3)
B.12 Homotopy Map
438(1)
B.13 Embeddings
439(6)
C Graph Theory
445(2)
D Notation
447(6)
Greek Letters
447(1)
Roman Letters
448(4)
Operators
452(1)
Bibliography 453(16)
Index 469
Rephael Wenger is an associate professor in the Department of Computer Science and Engineering at the Ohio State University. He earned a Ph.D. from McGill University. He has published over fifty papers in computational geometry, computational topology, combinatorics, geometric modeling, and visualization.