Sciweavers

690 search results - page 79 / 138
» Dense Admissible Sets
Sort
View
SIBGRAPI
2002
IEEE
15 years 11 months ago
Dynamic Scene Occlusion Culling Using a Regular Grid
We present an output-sensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular ...
Harlen Costa Batagelo, Shin-Ting Wu
VISUALIZATION
2000
IEEE
15 years 10 months ago
A level-set method for flow visualization
In this paper we propose a technique for visualizing steady flow. Using this technique, we first convert the vector field data into a scalar level-set representation. We then a...
Rüdiger Westermann, Christopher Johnson, Thom...
SIGGRAPH
2000
ACM
15 years 10 months ago
Progressive geometry compression
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist o...
Andrei Khodakovsky, Peter Schröder, Wim Sweld...
SIGGRAPH
1993
ACM
15 years 10 months ago
Mesh optimization
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 10 months ago
Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts
Our paper concerns optimal combinations of different types of reinsurance contracts. We introduce a novel approach based on the Mean-Variance-Criterion to solve this task. Two sta...
Ingo Oesterreicher, Andreas Mitschele, Frank Schlo...