102291 search results - page 273 / 20459 » Computability in Computational Geometry |
178
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
This research further develops the light field and lumigraph imagebased rendering methods and extends their utility. We present alternate parameterizations that permit 1) interac...
177
click to vote
SIGGRAPH
1998
ACM
15 years 11 months ago
1998
ACM
This paper describes some of the principles of traditional floral ornamental design, and explores ways in which these designs can be created algorithmically. It introduces the id...
207
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...
179
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
184
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...