14 search results - page 1 / 3 » Computing Envelopes in Four Dimensions with Applications |
COMPGEOM
1994
ACM
13 years 8 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
CAIP
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We propose a new computational method for segmenting topological sub-dimensional point-sets in scalar images of arbitrary spatial dimensions. The technique is based on co...
CGF
2002
13 years 4 months ago
2002
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...
EICS
2009
ACM
13 years 11 months ago
2009
ACM
In this paper we present a software toolkit for deploying peer-topeer distributed graphical user interfaces across four dimensions: multiple displays, multiple platforms, multiple...