4850 search results - page 208 / 970 » Proof and Computation in Geometry |
139
click to vote
CGA
1998
15 years 6 months ago
1998
We are investigating methods to accelerate rendering of architectural walkthroughs. In this paper, we improve upon a cells and portals framework by using images to replace geometr...
168
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
160
click to vote
JSYML
2008
15 years 6 months ago
2008
Abstract. In this paper we study the metric spaces that are definable in a polynomially bounded ominimal structure. We prove that the family of metric spaces definable in a given p...
186
click to vote
IMR
2003
Springer
15 years 11 months ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
200
click to vote
PG
2002
IEEE
15 years 11 months ago
2002
IEEE
Densely-sampled image representations such as the light field or Lumigraph have been effective in enabling photorealistic image synthesis. Unfortunately, lighting interpolation w...