Sciweavers

1879 search results - page 62 / 376
» Computational geometry algorithms library
Sort
View
COMPGEOM
1997
ACM
15 years 8 months ago
Realistic Input Models for Geometric Algorithms
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
Mark de Berg, Matthew J. Katz, A. Frank van der St...
113
Voted
IPPS
2002
IEEE
15 years 9 months ago
Distribution Sweeping on Clustered Machines with Hierarchical Memories
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pie...
CA
2000
IEEE
15 years 8 months ago
Algorithms for Generating Motion Trajectories Described by Prepositions
A list of representative directional prepositions of the English language is investigated to develop computation models that output some general motion trajectory or goal directio...
Yilun Dianna Xu, Norman I. Badler
DGCI
2006
Springer
15 years 7 months ago
Generating Distance Maps with Neighbourhood Sequences
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and...
Robin Strand, Benedek Nagy, Céline Fouard, ...
COMBINATORICS
2002
102views more  COMBINATORICS 2002»
15 years 3 months ago
Computation in Coxeter Groups-I. Multiplication
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
Bill Casselman