Finite topology as applied to image analysis
Computer Vision, Graphics, and Image Processing
Subdivisions of n-dimensional spaces and n-dimensional generalized maps
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Generic programming and the STL: using and extending the C++ Standard Template Library
Generic programming and the STL: using and extending the C++ Standard Template Library
Voronoi diagrams and arrangements
SCG '85 Proceedings of the first annual symposium on Computational geometry
Functional programming in C++ using the FC++ library
ACM SIGPLAN Notices
The boost graph library: user guide and reference manual
The boost graph library: user guide and reference manual
Automatically tuned linear algebra software
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Generic programming for high performance scientific applications
JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
The Matrix Template Library: Generic Components for High-Performance Scientific Computing
Computing in Science and Engineering
GrAL - The Grid Algorithms Library
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Formal software engineering for computational modelling
Nordic Journal of Computing
Parametric polymorphism for software component architectures
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
The GNU libstdc++ parallel mode: software engineering considerations
Proceedings of the 1st international workshop on Multicore software engineering
MCSTL: the multi-core standard template library
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Requirements in scientific computing emerge from various areas such as algebraic topology, geometrical algebra, and differential topology with different notations. Cell and complex properties are introduced in order to derive a common specification for properties of data structures. Only topological properties are used, thereby separating the actual data storage structure from the stored data. Several theoretical topological properties are introduced, and traversal capabilities which excel current implementations are presented and accompanied by selected examples. This work focuses on extracting these necessary mathematical concepts and introduces generic programming concepts necessary to fully transfer the mathematical concepts. Not only theoretical contributions are presented, but they are also demonstrated by means of applications in scientific computing.