Sciweavers

1879 search results - page 44 / 376
» Computational geometry algorithms library
Sort
View
COMPGEOM
2011
ACM
14 years 7 months ago
On the structure and composition of forbidden sequences, with geometric applications
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Seth Pettie
SC
2009
ACM
15 years 10 months ago
Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
Fengguang Song, Asim YarKhan, Jack Dongarra
SAC
2008
ACM
15 years 3 months ago
Runtime concepts for the C++ standard template library
A key benefit of generic programming is its support for producing modules with clean separation. In particular, generic algorithms are written to work with a wide variety of unmod...
Peter Pirkelbauer, Sean Parent, Mat Marcus, Bjarne...
132
Voted
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
15 years 8 months ago
Computing Linking Numbers of a Filtration
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
Herbert Edelsbrunner, Afra Zomorodian
SMA
2008
ACM
136views Solid Modeling» more  SMA 2008»
15 years 3 months ago
Kinematic convexity of spherical displacements and its application to collision prediction
In recent years, there has been an increasing interest in developing geometric algorithms for kinematic computations. The aim of this paper is to present the notion of kinematic c...
Qiaode Jeffrey Ge, Anurag Purwar, Jun Wu