Hasil Pencarian  ::  Simpan CSV :: Kembali

"The papers present original research in computational geometry, in its broadest sense. Topics included are discrete and combinatorial geometry, linear programming applied to geometric problems, geometric algorithms and data structures, theoretical foundations of computational geometry, questions of interest in the implementation of geometric algorithms, and applications of computational geometry."

"This refereed volume arose from the editors' recognition that physical scientists, engineers, and applied mathematicians are developing, in parallel, solutions to problems of parallelization. The cross-disciplinary field of scientific computation is bringing about better communication between heterogeneous computational groups, as they face this common challenge. This volume is one attempt to provide cross-disciplinary communication. Problem decomposition and the use of domain-based parallelism in computational science and engineering was the subject addressed at a workshop held at the University of Minnesota Supercomputer Institute in April 1994. The authors were subsequently able to address the relationships between their individual applications and independently developed approaches. This book is written for an interdisciplinary audience and concentrates on transferable algorithmic techniques, rather than the scientific results themselves. Cross-disciplinary editing was employed to identify jargon that needed further explanation and to ensure provision of a brief scientific background for each chapter at a tutorial level so that the physical significance of the variables is clear and correspondences between fields are visible."

"This book is that explicitly focuses on the presentation of the most important digital geometry algorithms. Each chapter provides a brief survey on a major research area related to the general volume theme, description and analysis of related fundamental algorithms, as well as new original contributions by the authors."

"This book reviews the algorithms for processing geometric data, with a practical focus on important techniques not covered by traditional courses on computer vision and computer graphics. Features, presents an overview of the underlying mathematical theory, covering vector spaces, metric space, affine spaces, differential geometry, and finite difference methods for derivatives and differential equations, reviews geometry representations, including polygonal meshes, splines, and subdivision surfaces, examines techniques for computing curvature from polygonal meshes, describes algorithms for mesh smoothing, mesh parametrization, and mesh optimization and simplification, discusses point location databases and convex hulls of point sets, investigates the reconstruction of triangle meshes from point clouds, including methods for registration of point clouds and surface reconstruction, provides additional material at a supplementary website, and includes self-study exercises throughout the text."

"This undergraduate textbook on Linear Algebra and n-Dimensional Geometry, in a self-teaching style, is invaluable for sophomore level undergraduates in mathematics, engineering, business, and the sciences. These are classical subjects on which there are many mathematics books in theorem-proof style, but this unique volume has its focus on developing the mathematical modelling as well as computational and algorithmic skills in students at this level. The explanations in this book are detailed, lucid, and supported with numerous well-constructed examples to capture the interest and encourage the student to master the material."