2981 search results - page 553 / 597 » Word Sense and Subjectivity |
COMPGEOM
1994
ACM
15 years 1 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...
ESA
1993
Springer
15 years 1 months ago
1993
Springer
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
SIGGRAPH
1993
ACM
15 years 1 months ago
1993
ACM
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
102
click to vote
SIGGRAPH
1993
ACM
15 years 1 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...