Search results for "data structures using c"
Items we need to order for you
R 916.00
Computer Analysis of Skeletal Structures
This book presents five computer programs in FORTRAN together with descriptions of how to use them for static analysis of skeletal structures. It includes several worked examples, including pin-jointed plane and space trusses, continuous beams, and two and three dimensional rigid-jointed frames.
R 13,872.61
R 1,221.00
Algorithms and Data Structures
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
R 2,224.60
Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
Implicit objects have gained increasing importance in geometric modeling, visualisation, animation, and computer graphics, because their geometric properties provide a good alternative to traditional parametric objects. This book presents the mathematics, computational methods and data structures, as well as the algorithms needed to render implicit curves and surfaces, and shows how implicit objects can easily describe smooth, intricate, and articulatable shapes, and hence why they are being increasingly used in graphical applications. Divided into two parts, the first introduces the mathematics of implicit curves and surfaces, as well as the data structures suited to store their sampled or discrete approximations, and the second deals with different computational methods for sampling implicit curves and surfaces, with particular reference to how these are applied to functions in 2D and 3D spaces.
R 3,950.94
Modular Calculus for the Average Cost of Data Structuring
This book introduces the first programming language for which average-case time analysis of its programs is guaranteed to be modular. The main time measure currently used for real-time languages (worst-case time) is well-known not to be modular in general, which makes average-case analysis notoriously difficult. Schellekens includes sample programs as well as derivations of the average-case time of these programs to illustrate this radically different approach.
R 3,032.31
From Data to Decisions in Music Education Research
From Data to Decisions in Music Education Research provides a structured and hands-on approach to working with empirical data in the context of music education research. Using step-by-step tutorials with in-depth examples of music education data, this book draws upon concepts in data science and statistics to provide a comprehensive framework for working with a variety of data and solving data-driven problems.All of the skills presented here use the R programming language, a free, open-source statistical computing and graphics environment. Using R enables readers to refine their computational thinking abilities and data literacy skills while facilitating reproducibility, replication, and transparency of data analysis in the field. The book offers: A clear and comprehensive framework for thinking about data analysis processes in a music education context. An overview of common data structures and data types used in statistical programming and data analytics. Techniques for cleaning, preprocessing, manipulating, aggregating, and mining data in ways that facilitate organization and interpretation. Methods for summarizing and visualizing data to help identify structures, patterns, and trends within data sets. Detailed applications of descriptive, diagnostic, and predictive analytics processes. Step-by-step code for all concepts and analyses. Direct access to all data sets and R script files through the accompanying eResource.From Data to Decisions in Music Education Research offers a reference "cookbook" of code and programming recipes written with the graduate music education student in mind and breaks down data analysis processes and skills in an approachable fashion. It can be used across a wide range of graduate music education courses that rely on the application of empirical data analyses and will be useful to all music education scholars and professionals seeking to enhance their use of quantitative data.
R 3,236.00
Data Structures and Algorithms 1
The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years.
R 1,688.66
Healthcare Data Analytics
At the intersection of computer science and healthcare, data analytics has emerged as a promising tool for solving problems across many healthcare-related disciplines. Supplying a comprehensive overview of recent healthcare analytics research, Healthcare Data Analytics provides a clear understanding of the analytical techniques currently available to solve healthcare problems.The book details novel techniques for acquiring, handling, retrieving, and making best use of healthcare data. It analyzes recent developments in healthcare computing and discusses emerging technologies that can help improve the health and well-being of patients.Written by prominent researchers and experts working in the healthcare domain, the book sheds light on many of the computational challenges in the field of medical informatics. Each chapter in the book is structured as a "survey-style" article discussing the prominent research issues and the advances made on that research topic. The book is divided into three major categories: Healthcare Data Sources and Basic Analytics - details the various healthcare data sources and analytical techniques used in the processing and analysis of such data Advanced Data Analytics for Healthcare - covers advanced analytical methods, including clinical prediction models, temporal pattern mining methods, and visual analytics Applications and Practical Systems for Healthcare - covers the applications of data analytics to pervasive healthcare, fraud detection, and drug discovery along with systems for medical imaging and decision supportComputer scientists are usually not trained in domain-specific medical concepts, whereas medical practitioners and researchers have limited exposure to the data analytics area. The contents of this book will help to bring together these diverse communities by carefully and comprehensively discussing the most relevant contributions from each domain.
R 2,274.80
R 720.00
Programming for Chemical Engineers Using C, C++, and MATLAB®
Designed for chemical engineering students and industry professionals, Programming for Chemical Engineers Using C, C++, and MATLAB(r) shows how to write reusable computer programs by guiding the reader through the process of: establishing the theoretical concept; determining the applicable numerical methods; testing the algorithm through manual calculation; writing and debugging the computer program based on the algorithm; and validating the result, using statistical analysis. All programs in the book are written in the three most popular languages (C, C++, and MATLAB) currently used in the chemical engineering curriculum and in industry. Because the book is written by a chemical engineer, practitioners and students will learn to write programs for appropriate subject matter of interest to them.
R 3,236.00
R 2,177.00
R 1,422.53
Mining of Data with Complex Structures
Mining of Data with Complex Structures:- Clarifies the type and nature of data with complex structure including sequences, trees and graphs- Provides a detailed background of the state-of-the-art of sequence mining, tree mining and graph mining.- Defines the essential aspects of the tree mining problem: subtree types, support definitions, constraints.- Outlines the implementation issues one needs to consider when developing tree mining algorithms (enumeration strategies, data structures, etc.)- Details the Tree Model Guided (TMG) approach for tree mining and provides the mathematical model for the worst case estimate of complexity of mining ordered induced and embedded subtrees.- Explains the mechanism of the TMG framework for mining ordered/unordered induced/embedded and distance-constrained embedded subtrees.- Provides a detailed comparison of the different tree mining approaches highlighting the characteristics and benefits of each approach.- Overviews the implications and potential applications of tree mining in general knowledge management related tasks, and uses Web, health and bioinformatics related applications as case studies.- Details the extension of the TMG framework for sequence mining- Provides an overview of the future research direction with respect to technical extensions and application areasThe primary audience is 3rd year, 4th year undergraduate students, Masters and PhD students and academics. The book can be used for both teaching and research. The secondary audiences are practitioners in industry, business, commerce, government and consortiums, alliances and partnerships to learn how to introduce and efficiently make use of the techniques for mining of data with complex structures into their applications. The scope of the book is both theoretical and practical and as such it will reach a broad market both within academia and industry. In addition, its subject matter is a rapidly emerging field that is critical for efficient analysis of knowledge stored in various domains.
R 4,661.34
R 1,650.88
Concept Data Analysis
With the advent of the Web along with the unprecedented amount of information available in electronic format, conceptual data analysis is more useful and practical than ever, because this technology addresses important limitations of the systems that currently support users in their quest for information. Concept Data Analysis: Theory & Applications is the first book that provides a comprehensive treatment of the full range of algorithms available for conceptual data analysis, spanning creation, maintenance, display and manipulation of concept lattices. The accompanying website allows you to gain a greater understanding of the principles covered in the book through actively working on the topics discussed. The three main areas explored are interactive mining of documents or collections of documents (including Web documents), automatic text ranking, and rule mining from structured data. The potentials of conceptual data analysis in the application areas being considered are further illustrated by two detailed case studies. Concept Data Analysis: Theory & Applications is essential for researchers active in information processing and management and industry practitioners who are interested in creating a commercial product for conceptual data analysis or developing content management applications.
R 4,557.00
Conceptual Structures for Knowledge Creation and Communication
This volume contains the proceedings of ICCS 2003, the 11th International C- ferenceonConceptualStructures. Thisconferenceseriescontinuestobethemain forum for the presentation and discussion of state-of-the-art research on conc- tualstructures. Thetheories,methodologies,andtechniquespresentedherehave grown considerably in scope in recent years. On the other hand, solid bridges spanning the boundaries between such diverse ?elds as Conceptual Graphs, F- mal Concept Analysis, and others are increasingly being built in our community. The theme of this year’s conference was “Conceptual Structures for Kno- edge Creation and Communication”. In our increasingly (Inter)networked world, the potential support of information technology for the creation and commu- cation of quality knowledge is almost boundless. However, in reality, many c- ceptual barriers prevent the use of this potential. The main problem is no longer in the technological infrastructure, but in how to navigate, use, and manage the wealth of available data resources. Thus, the question is: how to create and communicate from data the information and ultimately the knowledge required by an ever more complex and dynamic society? Conceptual structures research focuses on what is behind and between the data glut and the information ov- load that need to be overcome in answering this question. In this way, our ?eld contributes important ideas on how to actually realize some of the many still ambitious visions. All regular papers were reviewed in a thorough and open process by at least two reviewers and one editor.
R 1,576.36
Algorithms and Data Structures
This book constitutes the refereed proceedings of the 15th Algorithms and Data Structures Symposium, WADS 2017, held in St. John's, NL, Canada, in July/August 2017. The 49 full papers presented together with 3 abstracts of invited talks were carefully reviewed and selected from 109 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.The WADS Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Papers presenting original research on the theory and application of algorithms and data structures
R 2,224.60
Structure Determination from Powder Diffraction Data
The art of solving a structure from powder diffraction data has developed rapidly over the last ten years to the point where numerous crystal structures, both organic and inorganic, have been solved directly from powder data. However, it is still an art and, in contrast to its single crystal equivalent, is far from routine. The art lies not only in the correct application of a specific experimental technique or computer program, but also in the selection of theoptimal path for the problem at hand. Written and edited by experts active in the field, and covering both the fundamental and applied aspects of structure solution from powder diffraction data, this book guides both novices and experienced practitioners alike through the maze ofpossibilities.
R 4,834.00
Compressed Data Structures for Strings
Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this monograph we introduce solutions that overcome this dichotomy. We start by presenting the use of optimization techniques to improve the compression of classical data compression algorithms, then we move to the design of compressed data structures providing fast random access or efficient pattern matching queries on the compressed dataset. These theoretical studies are supported by experimental evidences of their impact in practical scenarios.
R 1,528.57
Robustness and Complex Data Structures
This Festschrift in honour of Ursula Gather’s 60th birthday deals with modern topics in the field of robust statistical methods, especially for time series and regression analysis, and with statistical methods for complex data structures. The individual contributions of leading experts provide a textbook-style overview of the topic, supplemented by current research results and questions. The statistical theory and methods in this volume aim at the analysis of data which deviate from classical stringent model assumptions, which contain outlying values and/or have a complex structure. Written for researchers as well as master and PhD students with a good knowledge of statistics.
R 4,030.00
Algebraic Approach to Data Processing
The book explores a new general approach to selecting—and designing—data processing techniques. Symmetry and invariance ideas behind this algebraic approach have been successful in physics, where many new theories are formulated in symmetry terms.The book explains this approach and expands it to new application areas ranging from engineering, medicine, education to social sciences. In many cases, this approach leads to optimal techniques and optimal solutions. That the same data processing techniques help us better analyze wooden structures, lung dysfunctions, and deep learning algorithms is a good indication that these techniques can be used in many other applications as well. The book is recommended to researchers and practitioners who need to select a data processing technique—or who want to design a new technique when the existing techniques do not work. It is also recommended to students who want to learn the state-of-the-art data processing.
R 3,595.24
Data Structure in Cognitive Metaphor Research
This collection of papers focuses on cognitive metaphor research (CMR) from the perspective of the current debate on linguistic data and evidence. The peculiarity of the book is that it reveals the causes that trigger the methodological problems of data handling in CMR. These problems include the identifiability of metaphors in discourse and the reliability of the methods of gathering metaphors such as linguistic intuition, discourse analysis, corpus analysis, and psycholinguistic experiments. In order to overcome their weaknesses and to enhance their reliance, the papers argue, on the one hand, for the combination of different methods of gathering and evaluating data in CMR. On the other hand, the papers also point out that converging evidence cannot be obtained without constraining the combinability of data stemming from different sources.
R 1,591.00
Index Data Structures in Object-Oriented Databases
Object-oriented database management systems (OODBMS) are used to imple ment and maintain large object databases on persistent storage. Regardless whether the underlying database model follows the object-oriented, the rela tional or the object-relational paradigm, a key feature of any DBMS product is content based access to data sets. On the one hand this feature provides user-friendly query interfaces based on predicates to describe the desired data. On the other hand it poses challenging questions regarding DBMS design and implementation as well as the application development process on top of the DBMS. The reason for the latter is that the actual query performance depends on a technically meaningful use of access support mechanisms. In particular, if chosen and applied properly, such a mechanism speeds up the execution of predicate based queries. In the object-oriented world, such queries may involve arbitrarily complex terms referring to inheritance hierarchies and aggregation paths. These features are attractive at the application level, however, they increase the complexity of appropriate access support mechanisms which are known to be technically non-trivial in the relational world.
R 4,636.39
People and Data
Organizational data can be one of the most valuable assets in a business. However, too often an organization's structure prevents the effective analysis of this data. This book solves that problem. People and Data is a practical guide for Organization Development (OD) professionals which explains how to structure an organization so that the business can collect data that is accurate, useful and impactful. This is the foundation of achieving valuable insights from organizational data. This book is full of practical tips and advice on how to design an organization where data is accessible to the whole workforce and not just kept in silos by those with data in their job title. This book also explains how to build data into the design of company culture as well as into workforce design, learning and development (L&D) and talent management initiatives. Finally, People and Data includes a toolkit with eight specific tools that can be used to build a better organization for data. Full of practical advice, key takeaways and real-world examples from companies including AT&T, Shell and J.P. Morgan this book is essential reading for all Organization Development (OD) professionals needing to ensure that their organization is structured to achieve the performance gains made possible by data and analytics.
R 1,361.92
Morphological Structure, Lexical Representation and Lexical Access (RLE Linguistics C: Applied Linguistics)
The main concern of this work is whether morphemes play a role in the lexical representation and processing of several types of polymorphemic words and, more particularly, at what precise representational and processing level. The book comprises two theoretical contributions and a number of empirical ones. One theoretical paper discusses several possible motivations for a morphologically organised mental lexicon (like the economy of representation view, and the efficiency of processing view), and lays out the weaknesses that are associated with some of these motivations. The other theoretical paper offers an interactive-activation reinterpretation of the findings that were originally reported within the lexical search framework. The empirical papers together cover a relatively broad array of language types and mainly deal with visual word recognition in normals in the context of lexical morphology (derived and compound words). Evidence is reported on the function of stems and affixes as processing units in prefixed and suffixed derivations. The role of semantic transparency in the lexical representation of compounds is studied, as is the effect of orthographic ambiguity on the parsing of novel compounds. The inflection-derivational distinction is approached in the context of Finnish, a highly agglutinative language with much richer morphology than the languages usually studied in psycholinguistic experiments on polymorphemic words. Two other contributions also approach the study object in the context of relatively uncharted domains: one presents data on Chinese, a language which uses a different script-type (logographic) from the languages that are usually studied (alphabetic script), and another one presents data on language production.
R 2,794.24
From Data to Decisions in Music Education Research
From Data to Decisions in Music Education Research provides a structured and hands-on approach to working with empirical data in the context of music education research. Using step-by-step tutorials with in-depth examples of music education data, this book draws upon concepts in data science and statistics to provide a comprehensive framework for working with a variety of data and solving data-driven problems.All of the skills presented here use the R programming language, a free, open-source statistical computing and graphics environment. Using R enables readers to refine their computational thinking abilities and data literacy skills while facilitating reproducibility, replication, and transparency of data analysis in the field. The book offers: A clear and comprehensive framework for thinking about data analysis processes in a music education context. An overview of common data structures and data types used in statistical programming and data analytics. Techniques for cleaning, preprocessing, manipulating, aggregating, and mining data in ways that facilitate organization and interpretation. Methods for summarizing and visualizing data to help identify structures, patterns, and trends within data sets. Detailed applications of descriptive, diagnostic, and predictive analytics processes. Step-by-step code for all concepts and analyses. Direct access to all data sets and R script files through the accompanying eResource.From Data to Decisions in Music Education Research offers a reference "cookbook" of code and programming recipes written with the graduate music education student in mind and breaks down data analysis processes and skills in an approachable fashion. It can be used across a wide range of graduate music education courses that rely on the application of empirical data analyses and will be useful to all music education scholars and professionals seeking to enhance their use of quantitative data.
R 9,411.60
R 4,572.00
R 763.00
Programming the Dynamic Analysis of Structures
This book presents a series of integrated computer programs in Fortran-90 for the dynamic analysis of structures, using the finite element method. Two dimensional continuum structures such as walls are covered along with skeletal structures such as rigid jointed frames and plane grids. Response to general dynamic loading of single degree freedom systems is calculated, and the author also examines multi degree of freedom systems (including earthquake analysis). Each chapter covers a different aspect of analytic theory and the corresponding program segments. It will be an essential tool for practising structural and civil engineers, whilst also being of interest to academics and postgraduate students.
R 4,130.60
Organic Structures from 2D NMR Spectra
The derivation of structural information from spectroscopic data is now an integral part of organic chemistry courses at all Universities. Over recent years, a number of powerful two-dimensional NMR techniques (e.g. HSQC, HMBC, TOCSY, COSY and NOESY) have been developed and these have vastly expanded the amount of structural information that can be obtained by NMR spectroscopy. Improvements in NMR instrumentation now mean that 2D NMR spectra are routinely (and sometimes automatically) acquired during the identification and characterisation of organic compounds. Organic Structures from 2D NMR Spectra is a carefully chosen set of more than 60 structural problems employing 2D-NMR spectroscopy. The problems are graded to develop and consolidate a student’s understanding of 2D NMR spectroscopy. There are many easy problems at the beginning of the collection, to build confidence and demonstrate the basic principles from which structural information can be extracted using 2D NMR. The accompanying text is very descriptive and focussed on explaining the underlying theory at the most appropriate level to sufficiently tackle the problems. Organic Structures from 2D NMR Spectra Is a graded series of about 60 problems in 2D NMR spectroscopy that assumes a basic knowledge of organic chemistry and a basic knowledge of one-dimensional NMR spectroscopyIncorporates the basic theory behind 2D NMR and those common 2D NMR experiments that have proved most useful in solving structural problems in organic chemistryFocuses on the most common 2D NMR techniques – including COSY, NOESY, HMBC, TOCSY, CH-Correlation and multiplicity-edited C-H Correlation.Incorporates several examples containing the heteronuclei 31P, 15N and 19F Organic Structures from 2D NMR Spectra is a logical follow-on from the highly successful “Organic Structures from Spectra” which is now in its fifth edition. The book will be invaluable for students of Chemistry, Pharmacy, Biochemistry and those taking courses in Organic Chemistry.Also available: Instructors Guide and Solutions Manual to Organic Structures from 2D NMR Spectra
R 2,323.00
Algorithms and Data Structures
This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions. They present original research on the theory, design and application of algorithms and data structures.
R 5,106.33
Computational Physics - A Practical Introduction to Computational Physics and Scientific Computing (Using C++), Vol. II
This book is an introduction to the computational methods used in physics and other related scientific fields. It is addressed to an audience that has already been exposed to the introductory level of college physics, usually taught during the first two years of an undergraduate program in science and engineering. It assumes no prior knowledge of numerical analysis, programming or computers and teaches whatever is necessary for the solution of the problems addressed in the text. C++ is used for programming the core programs and data analysis is performed using the powerful tools of the GNU/Linux environment. All the necessary software is open source and freely available. The book starts with very simple problems in particle motion and ends with an in-depth discussion of advanced techniques used in Monte Carlo simulations in statistical mechanics. The level of instruction rises slowly, while discussing problems like the diffusion equation, electrostatics on the plane, quantum mechanics and random walks.
R 1,350.81
R 1,270.00
Visualizing Graph Data
One of the most powerful ways to understand data is to recognize the ways in which each datum—person, product, etc—connects to another. Visualizing these graphs makes it possible to literally see the connections. The graph model consists of data elements, called nodes, and edges, which are the relationships between these nodes. Graphs make the relationships between the data elements a core part of the data structure, which means you can better comprehend the meaning of your data. And visual data is easier for everyone to understand. Visualizing Graph Data teaches readers not only how to build graph data structures, but also how to create their own dynamic, interactive visualizations using a variety of tools. This book is loaded with fascinating examples and case studies to show the real-world value of graph visualizations. It begins by teaching fundamental graph concepts and techniques used to visualize graph data. Next, readers drill down to learn how to create their own useful visualizations, as well as additional tools. Readers also learn how to model data, create the best graphs for their particular audience, handle big data, and depict temporal and spatial data. By the end of this book, readers know to ask the right questions of data to create powerful visualizations. Key Features:• Real-world case studies • Teaches techniques for creating effective visualizations • Shows fundamental visualization concepts • Includes tutorials using the best visualization tools AUDIENCE A basic understanding of RDBMS systems is assumed. No previous knowledge of graph databases required. ABOUT THE TECHNOLOGY The graph way of thinking about data is becoming more and more popular as people value the relationships between bits of data as much as the data themselves. Key to understanding the complex structure of connected data is being able to visualize those connections.
R 902.00
Data Structures and Algorithm Analysis in Java
Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. It is also suitable for a first-year graduate course in algorithm analysis As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text's coverage.
R 2,188.00
Algorithms and Data Structures
This book contains the papers presented at the 1989 Workshop on Algorithms and Data Structures, which succeeds the 1988 Scandinavian Workshop on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.
R 1,550.49
R 608.00
New Geometric Data Structures for Collision Detection and Haptics
Starting with novel algorithms for optimally updating bounding volume hierarchies of objects undergoing arbitrary deformations, the author presents a new data structure that allows, for the first time, the computation of the penetration volume. The penetration volume is related to the water displacement of the overlapping region, and thus corresponds to a physically motivated and continuous force. The practicability of the approaches used is shown by realizing new applications in the field of robotics and haptics, including a user study that evaluates the influence of the degrees of freedom in complex haptic interactions. New Geometric Data Structures for Collision Detection and Haptics closes by proposing an open source benchmarking suite that evaluates both the performance and the quality of the collision response in order to guarantee a fair comparison of different collision detection algorithms.Required in the fields of computer graphics, physically-based simulations, computer animations, robotics and haptics, collision detection is a fundamental problem that arises every time we interact with virtual objects. Some of the open challenges associated with collision detection include the handling of deformable objects, the stable computation of physically-plausible contact information, and the extremely high frequencies that are required for haptic rendering. New Geometric Data Structures for Collision Detection and Haptics presents new solutions to all of these challenges, and will prove to be a valuable resource for researchers and practitioners of collision detection in the haptics, robotics and computer graphics and animation domains.
R 1,607.70
Algorithms and Data Structures
The refereed proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003, held in Ottawa, Ontario, Canada, in July/August 2003.The 40 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 126 submissions. A broad variety of current aspects in algorithmics and data structures is addressed.
R 2,015.00
Algorithms and Data Structures
This book constitutes the refereed proceedings of the 5th International Workshop on Algorithms and Data Structures, WADS'97, held in Nova Scotia, Halifax, Canada, in August 1997.The 37 revised full papers presented were carefully selected from a total of 81 submissions. Also included are four abstracts and one full contribution corresponding to the invited talks. Among the topics covered are data structures and algorithmic aspects in a variety of areas like computational geometry, graph theory, networking, load balancing, optimization, approximation, sorting, pattern matching, etc.
R 1,587.07
