231 search results - page 1 / 47 » On overlays and minimization diagrams |
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
The overlay of 2 ≤ m ≤ d minimization diagrams of n surfaces in Rd is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in Rd+m−1 . ...
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...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
TVCG
2012
11 years 7 months ago
2012
— Scientists conducting microarray and other experiments use circular Venn and Euler diagrams to analyze and illustrate their results. As one solution to this problem, this artic...
P2P
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract—The problem of defining a support for multidimensional range queries on P2P overlays is currently an active field of research. Several approaches based on the extensio...