3575 search results - page 386 / 715 » Modeling Concurrency with Geometry |
159
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
167
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
160
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
181
click to vote
GRID
2004
Springer
16 years 2 days ago
2004
Springer
In this paper we present the MASSIVE project that aims to use Grid technology to establish an enabling environment for distributed simulation and visualization of large-scale scie...
194
click to vote
IMR
2004
Springer
16 years 1 days ago
2004
Springer
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...