Sciweavers

248 search results - page 45 / 50
» acm 1992
Sort
View
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 4 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
COMPGEOM
1992
ACM
15 years 4 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
129
Voted
SIGGRAPH
1992
ACM
15 years 4 months ago
Re-tiling polygonal surfaces
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at var...
Greg Turk
125
Voted
SIGGRAPH
1992
ACM
15 years 4 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 1 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson