3025 search results - page 367 / 605 » Computational geometry: a retrospective |
141
click to vote
COMPGEOM
2004
ACM
16 years 8 days ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
192
click to vote
COMPGEOM
2004
ACM
16 years 8 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
202
click to vote
CAAN
2004
Springer
16 years 7 days ago
2004
Springer
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...
155
click to vote
IPTPS
2004
Springer
16 years 6 days ago
2004
Springer
In this paper, we model the cost incurred by each peer participating in a peer-to-peer network. Such a cost model allows to gauge potential disincentives for peers to collaborate,...
199
click to vote
ISMS
2004
Springer
16 years 6 days ago
2004
Springer
In this paper we propose an open source/open architecture framework for developing organ level surgical simulations. Our goal is to facilitate shared development of reusable models...