5456 search results - page 754 / 1092 » General Equilibrium Theory |
167
click to vote
COMPGEOM
2004
ACM
16 years 4 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...
161
click to vote
COMPGEOM
2004
ACM
16 years 4 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 ...
171
Voted
COMPGEOM
2004
ACM
16 years 4 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
172
click to vote
COMPGEOM
2004
ACM
16 years 4 days ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
156
click to vote
CSCW
2004
ACM
16 years 4 days ago
2004
ACM
A shared visual workspace allows multiple people to see similar views of objects and environments. Prior empirical literature demonstrates that visual information helps collaborat...