Sciweavers

29 search results - page 4 / 6
» Computational implementation of non-linear convex hull refor...
Sort
View
SASO
2008
IEEE
14 years 2 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
14 years 1 months ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
ENTCS
2006
140views more  ENTCS 2006»
13 years 7 months ago
A Library for Self-Adjusting Computation
We present a Standard ML library for writing programs that automatically adjust to changes to their data. The library combines modifiable references and memoization to achieve eff...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Rob...
IPPS
1999
IEEE
13 years 12 months ago
Irregular Parallel Algorithms in JAVA
The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data...
Brian Blount, Siddhartha Chatterjee, Michael Phili...
CAD
2011
Springer
13 years 2 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...